Your cart is empty
Graduate from Excel to MATLAB(R) to keep up with the evolution of finance data Foundations of Computational Finance with MATLAB(R) is an introductory text for both finance professionals looking to branch out from the spreadsheet, and for programmers who wish to learn more about finance. As financial data grows in volume and complexity, its very nature has changed to the extent that traditional financial calculators and spreadsheet programs are simply no longer enough. Today's analysts need more powerful data solutions with more customization and visualization capabilities, and MATLAB provides all of this and more in an easy-to-learn skillset. This book walks you through the basics, and then shows you how to stretch your new skills to create customized solutions. Part I demonstrates MATLAB's capabilities as they apply to traditional finance concepts, and PART II shows you how to create interactive and reusable code, link with external data sources, communicate graphically, and more. Master MATLAB's basic operations including matrices, arrays, and flexible data structures Learn how to build your own customized solutions when the built-ins just won't do Learn how to handle financial data and industry-specific variables including risk and uncertainty Adopt more accurate modeling practices for portfolios, options, time series, and more MATLAB is an integrated development environment that includes everything you need in one well-designed user interface. Available Toolboxes provide tested algorithms that save you hours of code, and the skills you learn using MATLAB make it easier to learn additional languages if you choose to do so. Financial firms are catching up to universities in MATLAB usage, so this is skill set that will follow you throughout your career. When you're ready to step into the new age of finance, Foundations of Computational Finance with MATLAB provides the expert instruction you need to get started quickly.
Nature-Inspired Computing: Physics and Chemistry-Based Algorithms provides a comprehensive introduction to the methodologies and algorithms in nature-inspired computing, with an emphasis on applications to real-life engineering problems. The research interest for Nature-inspired Computing has grown considerably exploring different phenomena observed in nature and basic principles of physics, chemistry, and biology. The discipline has reached a mature stage and the field has been well-established. This endeavour is another attempt at investigation into various computational schemes inspired from nature, which are presented in this book with the development of a suitable framework and industrial applications. Designed for senior undergraduates, postgraduates, research students, and professionals, the book is written at a comprehensible level for students who have some basic knowledge of calculus and differential equations, and some exposure to optimization theory. Due to the focus on search and optimization, the book is also appropriate for electrical, control, civil, industrial and manufacturing engineering, business, and economics students, as well as those in computer and information sciences. With the mathematical and programming references and applications in each chapter, the book is self-contained, and can also serve as a reference for researchers and scientists in the fields of system science, natural computing, and optimization.
This text is an introduction to methods of grid generation technology in scientific computing. Special attention is given to methods developed by the author for the treatment of singularly-perturbed equations, e.g. in modeling high Reynolds number flows. Functionals of conformality, orthogonality, energy and alignment are discussed.
This unique textbook/reference presents unified coverage of bioinformatics topics relating to both biological sequences and biological networks, providing an in-depth analysis of cutting-edge distributed algorithms, as well as of relevant sequential algorithms. In addition to introducing the latest algorithms in this area, more than fifteen new distributed algorithms are also proposed. Topics and features: reviews a range of open challenges in biological sequences and networks; describes in detail both sequential and parallel/distributed algorithms for each problem; suggests approaches for distributed algorithms as possible extensions to sequential algorithms, when the distributed algorithms for the topic are scarce; proposes a number of new distributed algorithms in each chapter, to serve as potential starting points for further research; concludes each chapter with self-test exercises, a summary of the key points, a comparison of the algorithms described, and a literature review.
This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for almost 50 years, but the term itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tubingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike.
The LNCS journal Transactions on Large-Scale Data- and Knowledge-Centered Systems focuses on data management, knowledge discovery, and knowledge processing, which are core and hot topics in computer science. Since the 1990s, the Internet has become the main driving force behind application development in all domains. An increase in the demand for resource sharing across different sites connected through networks has led to an evolution of data- and knowledge-management systems from centralized systems to decentralized systems enabling large-scale distributed applications providing high scalability. Current decentralized systems still focus on data and knowledge as their main resource. Feasibility of these systems relies basically on P2P (peer-to-peer) techniques and the support of agent systems with scaling and decentralized control. Synergy between grids, P2P systems, and agent technologies is the key to data- and knowledge-centered systems in large-scale environments. This, the 22nd issue of Transactions on Large-Scale Data- and Knowledge-Centered Systems, contains six revised selected regular papers. Topics covered include algorithms for large-scale private analysis, modelling of entities from social and digital worlds and their relations, querying virtual security views of XML data, recommendation approaches using diversity-based clustering scores, hypothesis discovery, and data aggregation techniques in sensor netwo rk environments.
This book is a comprehensive, systematic survey of the synthesis problem, and of region theory which underlies its solution, covering the related theory, algorithms, and applications. The authors focus on safe Petri nets and place/transition nets (P/T-nets), treating synthesis as an automated process which, given behavioural specifications or partial specifications of a system to be realized, decides whether the specifications are feasible, and then produces a Petri net realizing them exactly, or if this is not possible produces a Petri net realizing an optimal approximation of the specifications. In Part I the authors introduce elementary net synthesis. In Part II they explain variations of elementary net synthesis and the unified theory of net synthesis. The first three chapters of Part III address the linear algebraic structure of regions, synthesis of P/T-nets from finite initialized transition systems, and the synthesis of unbounded P/T-nets. Finally, the last chapter in Part III and the chapters in Part IV cover more advanced topics and applications: P/T-net with the step firing rule, extracting concurrency from transition systems, process discovery, supervisory control, and the design of speed-independent circuits. Most chapters conclude with exercises, and the book is a valuable reference for both graduate students of computer science and electrical engineering and researchers and engineers in this domain.
"Incomplete Information System and Rough Set Theory: Models and Attribute Reductions" covers theoretical study of generalizations of rough set model in various incomplete information systems. It discusses not only the regular attributes but also the criteria in the incomplete information systems. Based on different types of rough set models, the book presents the practical approaches to compute several reducts in terms of these models. The book is intended for researchers and postgraduate students in machine learning, data mining and knowledge discovery, especially for those who are working in rough set theory, and granular computing.
Dr. Xibei Yang is a lecturer at the School of Computer Science and Engineering, Jiangsu University of Science and Technology, China; Jingyu Yang is a professor at the School of Computer Science, Nanjing University of Science and Technology, China.
This book constitutes the refereed proceedings of the First International Symposium on Dependable Software Engineering: Theories, Tools, and Applications, SETTA 2015, held in Nanjing, China, in November 2015. The 20 full papers presented together with 3 invited talks were carefully reviewed and selected from 60 submissions.The papers are organized on topical sections on probabilistic systems; hybrid and cyber-physical systems; testing, simulation and inference; bisimulation and correctness; design and implementation; symbolic execution and invariants; and verification and case studies.
FoLLI-LNCS is the publication platform for the Association of Logic, Language and Information (FoLLI, www.folli.org). The Association was founded in 1991 to advance research and education on the interface between logic, linguistics, computer science, and cognitive science. The FoLLI Publications on Logic, Language and Information aim to disseminate results of cutting-edge research and tutorial materials in these interdisciplinary areas. This LNCS volume is part of FoLLi book serie and contains the papers presented at the 5th International Workshop on Logic, Rationality and Interaction/ (LORI-V), held in October 2015 in Taipei, Taiwan. The topics covered in this program well represent the span and depth that hasby now become a trademark of the LORI workshop series, where logic interfaceswith disciplines as diverse as game theory and decision theory, philosophyand epistemology, linguistics, computer science and artificial intelligence.
This book constitutes the refereed proceedings of the 22nd International Static Analysis Symposium, SAS 2015, held in Saint-Malo, France, in September 2015. The 18 papers presented in this volume were carefully reviewed and selected from 44 submissions. All fields of static analysis as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance are addressed, featuring theoretical, practical, and application advances in the area
This book constitutes the proceedings of the 10th International Conference on Information Processing in Cells and Tissues, IPCAT 2015, held in San Diego, CA, USA, in September 2015. The 19 papers presented in this volume were carefully reviewed and selected from 22 submissions. They were organized in topical sections named: biochemical information processing; collective and distributed behavior; patterning and rhythm generation; biochemical regulatory networks; metabolomics and phenotypes; and neural modelling and neural networks.
This Festschrift volume contains 28 refereed papers including personal memories, essays, and regular research papers by close collaborators and friends of Jose Meseguer to honor him on the occasion of his 65th birthday. These papers were presented at a symposium at the University of Illinois at Urbana-Champaign on September 23-25, 2015. The symposium also featured invited talks by Claude and Helene Kirchner and by Patrick Lincoln. The foreword of this volume adds a brief overview of some of Jose's many scientific achievements followed by a bibliography of papers written by Jose.
This book constitutes the thoroughly refereed post-conference proceedings of the JSAI-isAI 2014 Workshops LENLS, JURISIN, and GABA which took place on November 2014, in Japan. The 26 contributions in this volume were carefully reviewed and selected from 57 submissionsfrom the 3 workshops (LENLS11, JURISIN2014, and GABA2014). LENLS (Logic and Engineering of Natural Language Semantics) is an annual international workshop on formal semantics and pragmatics and it focused on the formal and theoretical aspects of natural language. JURISIN (Juris-informatics) 2014 was the 8th event in the series, the purpose of this workshop was to discuss fundamental and practical issues for juris-informatics, bringing together experts from a variety of relevant backgrounds, including law, social science, information and intelligent technology, logic and philosophy (including the area of AI and law). GABA (Graph-based Algorithms for Big Data and its Applications) 2014 was the first workshop on graph structures including string, tree, bipartite- and di-graph for knowledge discovery in big data. The purpose of this workshop was to discuss ideas for realizing big data integration, including algorithms with theoretical / experimental results.
This book constitutes the refereed proceedings of the 9th International Workshop on Reachability Problems, RP 2015, held in Warsaw, Poland, in September 2015. The 14 papers presented together with 6 extended abstracts in this volume were carefully reviewed and selected from 23 submissions. The papers cover a range of topics in the field of reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps and new computational paradigms.
This book constitutes the thoroughly refereed conference proceedings of the 4th International Conference on Algorithmic Decision Theory , ADT 2015, held in September 2015 in Lexington, USA. The 32 full papers presented were carefully selected from 76 submissions. The papers are organized in topical sections such as preferences; manipulation, learning and other issues; utility and decision theory; argumentation; bribery and control; social choice; allocation and other problems; doctoral consortium.
This book constitutes the refereed proceedings of the 8th International Symposium on Algorithmic Game Theory, SAGT 2015, held in Saarbrucken, Germany, in September 2015. The 22 full papers presented together with one extended abstract and 6 brief announcements were carefully reviewed and selected from 63 submissions. They cover various important aspects of algorithmic game theory, such as matching under preferences; cost sharing; mechanism design and social choice; auctions; networking; routing and fairness; and equilibrium computation.
This book constitutes the refereed proceedings of the 13th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2015, held in Madrid, Spain, in September 2015. The conference was organized under the umbrella of Madrid Meet 2015, a one week event focussing on the areas of formal and quantitative analysis of systems, performance engineering, computer safety, and industrial critical applications. The 19 papers presented in this volume were carefully reviewed and selected from 42 initial submissions.
This book constitutes the refereed proceedings of the 6th International Conference on Runtime Verification, RV 2015, held in Vienna, Austria, in September 2015. The 15 revised full papers presented together with 4 short papers, 2 tool papers, 4 tutorials, 3 invited talks, and 2 software competition papers were carefully reviewed and selected from 45 submissions. The discussion of the conference centers around two main aspects. The first is to understand wether the runtime verification techniques can practically complement the traditional methods proving programs correct before their execution, such as model checking and theorem proving. The second concerns with formal methods and how their application can improve traditional ad-hoc monitoring techniques used in performance monitoring, hardware design emulation and simulation, etc.
This book constitutes the proceedings of the 13th International Conference on Parallel Computing Technologies, PaCT 2015, held in Petrozavodsk, Russia, during August / September 2015. The 37 full papers and 14 short papers presented were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on parallel models, algorithms and programming methods; unconventional computing; cellular automata; distributed computing; special processors programming techniques; applications.
This book constitutes the refereed conference proceedings of the 21st International Conference on Principles and Practice of Constraint Programming, CP 2015, held in Cork, Ireland, in August/September 2015. This edition of the conference was part of George Boole 200, a celebration of the life and work of George Boole who was born in 1815 and worked at the University College of Cork. It was also co-located with the 31st International Conference on Logic Programming (ICLP 2015). The 48 revised papers presented together with 3 invited talks and 16 abstract papers were carefully selected from numerous submissions. The scope of CP 2014 includes all aspects of computing with constraints, including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, schedulling, configuration, and planning.
This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).
This book constitutes the refereed proceedings of the 6th International Conference on Algebraic Informatics, CAI 2015, held in Stuttgart, Germany, in September 2015. The 15 revised full papers presented were carefully reviewed and selected from 25 submissions. The papers cover topics such as data models and coding theory; fundamental aspects of cryptography and security; algebraic and stochastic models of computing; logic and program modelling.
This book constitutes the refereed proceedings of the 20th International Conference on Implementation and Application of Automata, CIAA 2015, held in held in Umea, Sweden, in August 2015. The 22 revised full papers presented together with 4 invited papers and 2 toool demonstration papers were carefully reviewed and selected from 49 submissions. The papers cover all aspects of cover automata, counter automata, decision algorithms on automata, descriptional complexity, expressive power of automata, homing sequences, jumping finite automata, multi-dimensional languages, parsing and pattern matching, quantum automata, realtime pushdown automata, random generation of automata, regular expressions, security issues, sensors in automata, transducers, transformation of automata, and weighted automata.
This book constitutes the refereed proceedings of the 6th International Conference on Information Technology in Bio- and Medical Informatics, ITBAM 2015, held in Valencia, Spain, in September 2015, in conjunction with DEXA 2015. The 9 revised long papers presented together with 1 poster paper were carefully reviewed and selected from 15 submissions. The papers address the following two topics: medical terminology and clinical processes and machine learning in biomedicine.
You may like...
Algorithmic Number Theory - 9th…
Guillaume Hanrot, Francois Morain, … Paperback
Modern Computational Finance - AAD and…
Antoine Savine, Leif Andersen Hardcover
Numerical Recipes Source Code CD-ROM 3rd…
William H. Press, Saul A. Teukolsky, … CD-ROM
Temporal Logics in Computer Science…
Stephane Demri, Valentin Goranko, … Hardcover
Sparse Image and Signal Processing…
Jean-Luc Starck, Fionn Murtagh, … Hardcover
Mathematics of Big Data - Spreadsheets…
Jeremy Kepner, Hayden Jananthan Hardcover
The 9 Pitfalls of Data Science
Gary Smith, Jay Cordes Hardcover R556 Discovery Miles 5 560
The Mathematics of Signal Processing
Steven B. Damelin, Willard Miller Paperback
Linear Algebra and Learning from Data
Gilbert Strang Hardcover (1)
R1,289 Discovery Miles 12 890
Advanced Java Programming
Uttam Kumar Roy Paperback R767 Discovery Miles 7 670