00989cam0 2200265 450 E60020001057620201211134733.020050528d1977 |||||ita|0103 baitaITModelli di interazione familiare. Lo stato delle ricerche e delle formulazioni concettuali, con un glossario ed esempi di tecniche e strumenti d'indagineVittorio CigoliMilanoF.Angelic1977232 p.22 cmCollana di psicologia001LAEC000151552001 *Collana di psicologiaCigoli, VittorioA600200031032070143626ITUNISOB20201211RICAUNISOBUNISOB15026359E600200010576M 102 Monografia moderna SBNM150000104Si26359acquistocatenacciUNISOBUNISOB20050528090550.020190603140539.0SpinosaModelli di interazione familiare271117UNISOB05444nam 2200649Ia 450 991045532190332120200520144314.01-282-68920-797866126892080-470-74617-3(CKB)1000000000799707(EBL)470781(OCoLC)497151382(SSID)ssj0000341643(PQKBManifestationID)11252603(PQKBTitleCode)TC0000341643(PQKBWorkID)10396280(PQKB)10306494(MiAaPQ)EBC470781(CaSebORM)9780470744192(Au-PeEL)EBL470781(CaPaEBR)ebr10341711(CaONFJC)MIL268920(EXLCZ)99100000000079970719930915d2009 uy 0engur|n|---|||||txtrdacontentcrdamediacrPorting to the symbian platform[electronic resource] open mobile development in C/C++ /lead author, Mark Wilcox1st editionChichester, West Sussex Wiley20091 online resource (xxii, 419 pages) illustrationsDescription based upon print version of record.0-470-74419-7 Includes bibliographical references and indexes.Porting to the Symbian Platform; Contents; About this Book; Author Biographies; Author's Acknowledgements; Symbian Acknowledgements; 1 Introduction; 1.1 What Is Porting?; 1.2 What Is Portability?; 1.3 Why Port to Mobile Platforms?; 1.4 Why Get Interested Now?; 1.5 Why Port to the Symbian Platform?; 2 The Porting Process; 2.1 Choosing a Project; 2.2 Analyzing the Code; 2.3 Re-architecting; 2.4 Setting Up the Development Environment; 2.5 Integrating with the Symbian Build System; 2.6 Compiling; 2.7 Fixing Problems; 2.8 Running and Testing; 2.9 Debugging; 2.10 Re-integrating; 2.11 Summary3 Symbian Platform Fundamentals3.1 In the Beginning; 3.2 Naming Guidelines and Code Conventions; 3.3 Data Handling; 3.4 String Handling: Descriptors; 3.5 Error Handling and Memory Management; 3.6 Event-Driven Programming; 3.7 Writeable Static Data; 3.8 Multiple Inheritance; 3.9 Summary; 4 Standard APIs on the Symbian Platform; 4.1 P.I.P.S. Is POSIX on Symbian OS; 4.2 Open C; 4.3 The STLport, uSTL and Open C++; 4.4 Which Version of Symbian OS?; 4.5 How to Use the APIs; 4.6 Examples: SoundTouch and SoundStretch; 4.7 Known Limitations, Issues and Workarounds; 4.8 Summary; 5 Writing Hybrid Code5.1 Popular APIs You Can't Use Directly5.2 How to Create a Hybrid Port; 5.3 Example: Guitune; 5.4 Summary; 6 Other Port Enablers; 6.1 Real-time Graphics and Audio Libraries; 6.2 Simple DirectMedia Layer; 6.3 OpenKODE; 6.4 Qt; 6.5 Summary; 7 Porting from Mobile Linux; 7.1 Major Players in the Mobile Linux Space; 7.2 Porting from Linux to Symbian; 7.3 Summary; 8 Porting from Microsoft Windows; 8.1 Architecture Comparison; 8.2 Application Compatibility; 8.3 Development Languages and SDKs; 8.4 SDKs and APIs; 8.5 Porting an Application; 8.6 Windows-specific Issues; 8.7 Signing and Security8.8 Porting from C# and .NET8.9 Summary; 9 Porting from Other Mobile Platforms; 9.1 Android; 9.2 BREW; 9.3 iPhone OS; 9.4 Summary; 10 Porting a Simple Application; 10.1 Selecting a Project; 10.2 Analyzing the Code; 10.3 Setting Up the Development Environment; 10.4 Integrating with the Symbian Build System; 10.5 Getting It to Compile; 10.6 Getting It to Work; 10.7 Extensions Specific to Mobile Devices; 10.8 Deploying and Testing on Target Hardware; 10.9 Re-integrating; 10.10 Summary; 11 Porting Middleware; 11.1 GDAL; 11.2 Qt; 11.3 Summary; 12 Porting a Complex Application12.1 Selecting a Project12.2 Analyzing the Code; 12.3 Re-architecting; 12.4 Setting Up the Development Environment; 12.5 Integrating with the Symbian Build System; 12.6 Getting It to Compile; 12.7 Re-writing the User Interface; 12.8 Testing and Debugging; 12.9 Re-integrating; 12.10 Summary; 13 The P.I.P.S. Architecture; 13.1 The Glue Code; 13.2 The Core Libraries; 13.3 The Backend; 13.4 Emulator Writeable Static Data Support; 13.5 Summary; 14 Security Models; 14.1 The Capability Model; 14.2 Process Identity; 14.3 Data Caging; 14.4 Code-Signing and Certification14.5 Certification and Platform SecurityIf you want to write mobile applications without the idioms of Symbian C++, have existing software assets that you'd like to re-use on Symbian devices, or are an open source developer still waiting for an open Linux-based device to gain significant market penetration, this is the book for you! Beginning with an introduction to the native programming environments available and descriptions of the various technologies and APIs available, you will first learn how to go about porting your code to the Symbian platform. Next, you will discover how to port to Symbian from other common platforms iMobile communication systemsComputer programsElectronic books.Mobile communication systemsComputer programs.005.133005.43Wilcox Mark721084MiAaPQMiAaPQMiAaPQBOOK9910455321903321Porting to the symbian platform2114012UNINA05545nam 22008175 450 991048330510332120251226200006.03-319-30698-710.1007/978-3-319-30698-8(CKB)3710000000627348(SSID)ssj0001658186(PQKBManifestationID)16438043(PQKBTitleCode)TC0001658186(PQKBWorkID)14986409(PQKB)10608197(DE-He213)978-3-319-30698-8(MiAaPQ)EBC6303157(MiAaPQ)EBC5596176(Au-PeEL)EBL5596176(OCoLC)1076257099(PPN)192771795(EXLCZ)99371000000062734820160330d2016 u| 0engurnn|008mamaatxtccrEvolutionary Computation in Combinatorial Optimization 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings /edited by Francisco Chicano, Bin Hu, Pablo García-Sánchez1st ed. 2016.Cham :Springer International Publishing :Imprint: Springer,2016.1 online resource (XII, 267 p. 59 illus., 1 illus. in color.) Theoretical Computer Science and General Issues,2512-2029 ;9595Bibliographic Level Mode of Issuance: Monograph3-319-30697-9 A Hybrid Constructive Mat-Heuristic Algorithm for The Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery -- A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations -- An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem -- Construct, Merge, Solve & Adapt: Application to the Repetition-Free Longest Common Subsequence Problem -- Deconstructing the Big Valley Search Space Hypothesis -- Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks -- Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization -- Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems -- Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance -- Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems -- Hyperplane Elimination for Quickly Enumerating Local Optima -- Limits to Learning in Reinforcement Learning Hyperheuristics -- Modifying Colourings between Time-Steps to Tackle Changes in Dynamic Random Graphs -- Particle Swarm Optimisation with Sequence-Like Indirect Representation for Web Service Composition -- Particle Swarm Optimization for Multi-Objective Web Service Location Allocation -- Sim-EDA: A Multipopulation Estimation of Distribution Algorithm Based on Problem Similarity -- Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization. .This book constitutes the refereed proceedings of the 16th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2016, held in Porto, Portugal, in March/April 2016, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications. The 17 revised full papers presented were carefully reviewed and selected from 44 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic algorithms, variable neighborhood search, particle swarm optimization, hyperheuristics, mat-heuristic and other adaptive approaches. Applications included both traditional domains, such as graph coloring, vehicle routing, the longest common subsequence problem, the quadratic assignment problem; and new(er) domains such as the traveling thief problem, web service location, and finding short addition chains. The theoretical studies involved fitness landscape analysis, local search and recombination operator analysis, and the big valley search space hypothesis. The consideration of multiple objectives, dynamic and noisy environments was also present in a number of articles.Theoretical Computer Science and General Issues,2512-2029 ;9595Numerical analysisAlgorithmsComputer scienceMathematicsDiscrete mathematicsComputer scienceArtificial intelligenceNumerical AnalysisAlgorithmsDiscrete Mathematics in Computer ScienceTheory of ComputationArtificial IntelligenceNumerical analysis.Algorithms.Computer scienceMathematics.Discrete mathematics.Computer science.Artificial intelligence.Numerical Analysis.Algorithms.Discrete Mathematics in Computer Science.Theory of Computation.Artificial Intelligence.519.64Chicano Franciscoedthttp://id.loc.gov/vocabulary/relators/edtHu Binedthttp://id.loc.gov/vocabulary/relators/edtGarcía-Sánchez Pabloedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910483305103321Evolutionary Computation in Combinatorial Optimization4206794UNINA