LEADER 01435nam2 22003253i 450 001 TO01514056 005 20231121125845.0 100 $a20150429d1966 ||||0itac50 ba 101 | $alat 102 $afr 181 1$6z01$ai $bxxxe 182 1$6z01$an 200 1 $a˜3.4: œSupplementum$faccurante Adalberto Hamman 210 $aParis$cGarnier frères$d1966 215 $aCol. 1109-1504$d28 cm. 461 1$1001SBL0682423$12001 $aPatrologiae cursus completus a J.-P. Migne editus et Parisiis, anno Domini 1844, excusus$eseries latina. Supplementum$faccurante Adalberto Hamman ordinis fratrum minorum s. theologiæ doctore et lectore$v3.4 700 1$aHamman$b, Adalbert G.$3CFIV013649$4070$0153013 790 1$aHamman$b, Adalberto$3CFIV018089$zHamman, Adalbert G. 790 1$aHamman$b, Adalbert$3CFIV094768$zHamman, Adalbert G. 790 1$aHamman$b, Adalbert Gautier$3CFIV159636$zHamman, Adalbert G. 790 1$aHamman$b, A.-G.$3NAPV199046$zHamman, Adalbert G. 790 1$aGautier Hamman$b, Adalbert$3SBNV060588$zHamman, Adalbert G. 801 3$aIT$bIT-01$c20150429 850 $aIT-FR0017 899 $aBiblioteca umanistica Giorgio Aprea$bFR0017 $eN 912 $aTO01514056 950 2$aBiblioteca umanistica Giorgio Aprea$d 52PL Sup.3.4$e 52FLS0000178945 VMC RS $fC $h20150429$i20150429 977 $a 52 996 $aSupplementum$93638641 997 $aUNICAS LEADER 03769nam 2200805 a 450 001 9910828062203321 005 20230912122632.0 010 $a9786613239808 010 $a9781283239806 010 $a1283239809 010 $a9781118267028 010 $a1118267028 010 $a9781118067413 010 $a111806741X 035 $a(CKB)2670000000112749 035 $a(EBL)699487 035 $a(SSID)ssj0000545126 035 $a(PQKBManifestationID)11343200 035 $a(PQKBTitleCode)TC0000545126 035 $a(PQKBWorkID)10554289 035 $a(PQKB)10739349 035 $a(WaSeSS)Ind00025050 035 $a(Au-PeEL)EBL699487 035 $a(CaPaEBR)ebr10492704 035 $a(CaSebORM)9781118067567 035 $a(MiAaPQ)EBC699487 035 $a(OCoLC)773301049 035 $a(MiAaPQ)EBC4031460 035 $a(PPN)230011322 035 $a(OCoLC)757516359 035 $a(OCoLC)ocn757516359 035 $a(FR-PaCSA)88808471 035 $a(FRCYB88808471)88808471 035 $a(Perlego)1013474 035 $a(EXLCZ)992670000000112749 100 $a20110103d2011 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 04$aThe theory and practice of investment management $easset allocation, valuation, portfolio construction, and strategies /$fFrank J. Fabozzi, Harry M. Markowitz, editors 205 $a2nd ed. 210 $aHoboken, N.J. $cWiley$dc2011 215 $a1 online resource (707 p.) 225 1 $aFrank J. Fabozzi series 300 $aIncludes index. 311 08$a9781118067567 311 08$a1118067568 311 08$a9780470929902 311 08$a0470929901 320 $aIncludes index. 327 $apt. 1. Instruments, asset allocation, portfolio selection, and asset pricing -- pt. 2. Equity analysis and portfolio management -- pt. 3. Bond analysis and portfolio management. 330 $a"An updated guide to the theory and practice of investment management Many books focus on the theory of investment management and leave the details of the implementation of the theory up to you. This book illustrates how theory is applied in practice while stressing the importance of the portfolio construction process. The Second Edition of The Theory and Practice of Investment Management is the ultimate guide to understanding the various aspects of investment management and investment vehicles. Tying together theoretical advances in investment management with actual practical applications, this book gives you a unique opportunity to use proven investment management techniques to protect and grow a portfolio under many different circumstances. Contains new material on the latest tools and strategies for both equity and fixed income portfolio management Includes key take-aways as well as study questions at the conclusion of each chapter A timely updated guide to an important topic in today's investment world This comprehensive investment management resource combines real-world financial knowledge with investment management theory to provide you with the practical guidance needed to succeed within the investment management arena."--Provided by publisher. 410 0$aFrank J. Fabozzi series. 606 $aInvestments 606 $aBusiness enterprises$xFinance 615 0$aInvestments. 615 0$aBusiness enterprises$xFinance. 676 $a332.6 686 $aBUS027000$2bisacsh 701 $aFabozzi$b Frank J$0109596 701 $aMarkowitz$b Harry M.$f1927-2023.$01612591 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910828062203321 996 $aThe theory and practice of investment management$93941475 997 $aUNINA LEADER 12109nam 22007935 450 001 9910484286803321 005 20251226202141.0 010 $a3-319-16706-5 024 7 $a10.1007/978-3-319-16706-0 035 $a(CKB)3710000000379657 035 $a(SSID)ssj0001465695 035 $a(PQKBManifestationID)11817465 035 $a(PQKBTitleCode)TC0001465695 035 $a(PQKBWorkID)11477949 035 $a(PQKB)10226116 035 $a(DE-He213)978-3-319-16706-0 035 $a(MiAaPQ)EBC6298295 035 $a(MiAaPQ)EBC5590759 035 $a(Au-PeEL)EBL5590759 035 $a(OCoLC)906153677 035 $a(PPN)18489509X 035 $a(EXLCZ)993710000000379657 100 $a20150325d2015 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aResearch in Computational Molecular Biology $e19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings /$fedited by Teresa M. Przytycka 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XVII, 368 p. 110 illus., 98 illus. in color.) 225 1 $aLecture Notes in Bioinformatics,$x2366-6331 ;$v9029 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-319-16705-7 320 $aIncludes bibliographical references and index. 327 $aIntro -- Preface -- Organization -- Contents -- Efficient Alignment Free Sequence Comparison with Bounded Mismatches -- 1 Introduction -- 2 Key Concepts and Properties -- 3 An Overview of Our Algorithm -- 4 Constructing Sk -- 4.1 Analysis -- 5 Processing Sk -- 5.1 Proof of Lemma 6 -- 6 Conclusions -- A Ordering of Pairs -- References -- DockStar: A Novel ILP Based Integrative Method for Structural Modelling of Multimolecular Protein Complexes (Extended Abstract) -- References -- CRISPR Detection from Short Reads Using Partial Overlap Graphs -- 1 Introduction -- 2 Methods -- 2.1 Algorithm Overview -- 2.2 Identifying Frequent k-Mers -- 2.3 Analysis of Frequent k-Mers: Basic Observation -- 2.4 Data Indexing -- 2.5 Partial Construction of Overlap Graph -- 2.6 k-Mer Clustering -- 2.7 Repeat Consensus Derivation -- 3 Results -- 3.1 Simulated Reads Data -- 3.2 Real Reads Data -- 4 Conclusions and Future Work -- References -- HapTree-X: An Integrative Bayesian Framework for Haplotype Reconstruction from Transcriptome and Genome Sequencing Data -- References -- Read Clouds Uncover Variation in Complex Regions of the Human Genome -- 1 Background -- 2 Method -- 3 Results -- References -- Learning Microbial Interaction Networks from Metagenomic Count Data -- 1 Introduction -- 2 Materials and Methods -- 2.1 Preliminaries -- 2.2 The Model -- Model Learning. -- Model Initialization. -- Model Selection. -- 2.3 Synthetic Experiment -- 2.4 Artificial Community Experiment -- 2.5 In vitro Coplating Validation Experiments -- 3 Results -- 3.1 Synthetic Experiment -- 3.2 Artificial Community Experiment -- 4 Discussion -- References -- Immunoglobulin Classification Using the Colored Antibody Graph -- 1 Introduction -- 2 Methods -- 3 Results -- 4 Discussion -- References -- CIDANE: Comprehensive Isoform Discovery and Abundance Estimation -- References. 327 $aDiffusion Component Analysis: Unraveling Functional Topology in Biological Networks -- 1 Introduction -- 2 Methods -- 3 Results -- References -- Fragmentation Trees Reloaded -- 1 Introduction -- 2 Fragmentation Trees -- 3 Maximum a Posteriori Estimation -- 3.1 Prior Probability of the Tree -- 3.2 Likelihood of the Tree -- 3.3 Posterior Probability of the Tree -- 3.4 Hypothesis-Driven Recalibration. -- 4 Results -- 5 Conclusion -- References -- KGSrna: Efficient 3D Kinematics-Based Sampling for Nucleic Acids -- 1 Introduction -- 2 Methods -- 2.1 Construction of the Tree -- 2.2 Modeling the Conformational Flexibility of Pentameric Rings -- 2.3 Null Space Perturbations -- 2.4 Rebuild Perturbations -- 2.5 Experimental Design -- 3 Results and Discussion -- 3.1 Broad and Accurate Atomic-Scale Sampling of the Native Ensemble -- 3.2 Large Scale Deformations -- 3.3 KGSrna as an Alternative to NMA -- 4 Conclusion -- A Benchmark Set -- B Ensemble Backbone Torsional Distributions -- C Video Files -- References -- Locating a Tree in a Phylogenetic Network in Quadratic Time -- 1 Introduction -- 2 Concepts and Notions -- 3 How Many Reticulations in a Network? -- 4 A Quadratic-Time Algorithm for the TCP -- 5 Conclusion -- References -- Constructing Structure Ensembles of Intrinsically Disordered Proteins from Chemical Shift Data -- 1 Introduction -- 2 Methods -- 2.1 Overview -- 2.2 Constructing the Initial Structure Pool -- 2.3 Selecting Representative Structures from the Initial Pool -- 2.4 Obtaining the Chemical Shifts of Backbone Atoms -- 2.5 Calculating the Corresponding Weights of the Selected Structures -- 2.6 Implementation -- 3 Results -- 3.1 Validation through A Reference Ensemble Approach -- 3.2 Tests on Real Data -- 3.3 Case Study -- 4 Conclusions -- References. 327 $aComets (Constrained Optimization of Multistate Energies by Tree Search): A Provable and Efficient Algorithm to Optimize Binding Affinity and Specificity with Respect to Sequence -- 1 Introduction -- 2 Methods -- 2.1 Problem Formulation -- 2.2 A* Over Sequences -- 2.3 Starting and Finishing the Calculation -- 3 Results -- 3.1 Measurement of Efficiency -- 3.2 Differences in Sequences Returned by Multistate Designs and Single-state Proxies -- 4 Conclusions -- References -- Efficient and Accurate Multiple-Phenotypes Regression Method for High Dimensional Data Considering Population Structure -- 1 Introduction -- 2 Results -- 2.1 Correcting for Population Structure in Multivariate Analysis -- 2.2 GAMMA Corrects for Population Structure and Accurately Identifies Genetic Variances in a Simulated Study -- 2.3 GAMMA Identifies Regulatory Hotspots Related to Regulatory Elements of a Yeast Dataset -- 2.4 GAMMA Identifies Variants that Associated with a Gut Microbiome -- 3 Discussion -- 4 Materials and Methods -- 4.1 Linear Mixed Models -- 4.2 Multiple-Phenotypes Analysis -- 4.3 Correcting for Population Structure -- 4.4 Implementation -- 4.5 Simulated Dataset -- 4.6 Real Datasets -- References -- BWM*: A Novel, Provable, Ensemble-Based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design -- 1 Introduction -- 1.1 Design with Sparse Energy Functions -- 2 Background -- 2.1 Sparse Residue Interaction Graphs -- 2.2 Branch-Decomposition in Protein Design -- 3 Methods -- 3.1 Total Effective Search Space -- 3.2 Algorithm: Preprocessing and Enumeration -- 3.3 Sparse Error Bounds -- 4 Computational Experiments -- 4.1 Experimental Methods -- 4.2 Total Effective Search Space Predictions -- 4.3 Ensemble Enumeration Time -- 5 Conclusion -- References. 327 $aAn Efficient Nonlinear Regression Approach for Genome-Wide Detection of Marginal and Interacting Genetic Variations -- 1 Introduction -- 2 Methods -- 2.1 Piecewise Linear Model-Based Group Lasso -- Randomization -- Stability Selection. -- 2.2 Piecewise Linear Model-Based Screening -- 2.3 System Implementation of Piecewise Linear Model-Based Screening -- 3 Simulation Study -- 3.1 Power to Detect True Casual SNPs and SNP Pairs Under False Positive Control -- 3.2 Scalability of Screening Implementation -- 4 Association Analysis of Late-Onset Alzheimer's Disease Data -- 4.1 Marginal Effects in Late-Onset Alzheimer's Disease Dataset -- 4.2 Interaction Effects in Late-Onset Alzheimer's Disease Dataset -- 5 Conclusions -- S1 Simulation Study -- S1.1 Generation of Simulation Data -- S1.2 Benefits of Using a Piecewise Linear Model for Screening -- S1.3 Comparison of Different Methods for the Detection of SNP Pairs with Interaction Effects -- Comparison with Different Minor Allele Frequencies. -- Comparison with Different Association Strengths. -- References -- Exploration of Designability of Proteins Using Graph Features of Contact Maps: Beyond Lattice Models -- 1 Introduction -- 2 Methods -- 2.1 Selection of Datasets -- 2.2 Calculating Designabilities of Structures Using Binary Energy Functions -- 2.3 Generation of Contact Graphs and Graph Features that Describe Them -- 2.4 Regression Analysis -- 2.5 Nai?ve Bayes Prediction -- 3 Results and Discussion -- References -- CoMEt: A Statistical Approach to Identify Combinations of Mutually Exclusive Alterations in Cancer -- 1 Introduction -- 2 Methods -- 3 Results -- References -- Deep Feature Selection: Theory and Application to Identify Enhancers and Promoters -- 1 Introduction -- 2 Method -- 2.1 Deep Feature Selection -- 2.2 Learning Model Parameter -- 2.3 Shallow DFS is not Equivalent to LASSO. 327 $a3 Applying DFS to Enhancer-Promoter Classification -- 3.1 Data -- 3.2 Comparing Test Accuracy and Computing Time -- 3.3 Feature Analysis -- 4 Conclusion -- References -- Protein Contact Prediction by Integrating Joint Evolutionary Coupling Analysis and Supervised Learning -- References -- ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching -- References -- A Symmetric Length-Aware Enrichment Test -- 1 Introduction -- 2 The Model -- 3 The Asymmetry Problem -- 4 Computing the p-Value of the Symmetric Test -- 5 Comparison of the Symmetric p-Value Approximation Schemes -- 6 Discussion -- 6.1 Normal Approximation - Exact Computation of the Conditional Moments -- 6.2 The Saddlepoint Approximation (Details) -- References -- Functional Alignment of Metabolic Networks -- 1 Introduction -- 2 Preliminaries -- 2.1 Metabolic Modeling -- 2.2 Problem Definition -- 3 The Alignment Algorithm -- 3.1 Similarity Computation -- 3.2 Alignment Computation -- 3.3 Media Selection and the Final Alignment -- 4 Results -- 4.1 Performance Evaluation -- 4.2 Aligning Similar Models -- 4.3 Aligning the Yeast and Human Models -- 5 Conclusions -- References -- Joint Inference of Genome Structure and Content in Heterogeneous Tumor Samples -- References -- Ultra-Large Alignments Using Ensembles of Hidden Markov Models -- 1 Introduction and Motivation -- 2 UPP: Ultra-Large Alignment Using Phylogeny-aware Profiles -- References -- Topological Signatures for Population Admixture -- 1 Background -- 1.1 Problem Setting -- 2 Topology Model -- 3 Experiments -- 3.1 Experiments on Avocado Germplasm -- 4 Conclusion -- References -- Haplotype Allele Frequency (HAF) Score: Predicting Carriers of Ongoing Selective Sweeps Without Knowledge of the Adaptive Allele -- References -- Gap Filling as Exact Path Length Problem -- 1 Introduction and Related Work. 327 $a2 Gap Filling as Exact Path Length Problem. 330 $aThis book constitutes the refereed proceedings of the 19th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2015, held in Warsaw, Poland, in April 2015. The 36 extended abstracts were carefully reviewed and selected from 170 submissions. They report on original research in all areas of computational molecular biology and bioinformatics. 410 0$aLecture Notes in Bioinformatics,$x2366-6331 ;$v9029 606 $aBioinformatics 606 $aBiomathematics 606 $aData mining 606 $aAlgorithms 606 $aComputational and Systems Biology 606 $aMathematical and Computational Biology 606 $aData Mining and Knowledge Discovery 606 $aAlgorithms 615 0$aBioinformatics. 615 0$aBiomathematics. 615 0$aData mining. 615 0$aAlgorithms. 615 14$aComputational and Systems Biology. 615 24$aMathematical and Computational Biology. 615 24$aData Mining and Knowledge Discovery. 615 24$aAlgorithms. 676 $a570.285 702 $aPrzytycka$b Teresa M$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484286803321 996 $aResearch in Computational Molecular Biology$9772065 997 $aUNINA