Theoretical computer

Eric H. Glendinning is Director of the Institute of Applied Linguistics at the University of Edinburgh in the UK. He has worked in teaching English in Tanzania, Norway, Nepal, and the United Kingdom and former Research Director of the Edinburgh Language Organization. John McEwan is the computer staff at the Institute of Applied Linguistics, University of Edinburgh. He is an experienced mathematics and physics teacher and teaching study skills, computers, and learning computer languages supported in the EFL language schools.
130p sang_hoahoc 17082011 328 93 Download

Although much of its discovery process is descriptive and qualitative, chemistry is fundamentally a quantitative science. It serves a wide range of human needs, activities, and concerns. The mathematical sciences provide the language for quantitative science, and this language is growing in many directions as computational science in general continues its rapid expansion. A timely opportunity now exists to strengthen and increase the beneficial impacts of chemistry by enhancing the interaction between chemistry and the mathematical sciences.
144p camchuong_1 08122012 38 6 Download

The book is intended for computer science students, programmers and professionals who have already got acquainted with the basic courses and background on discrete mathematics. It may be used as a textbook for graduate course on theoretical computer science. The book introduces a reader to the conceptual framework for thinking about computations with the objects. The several areas of theoretical computer science are covered, including the following: type free and typed calculus and combinatory logic with applications, evaluation of expressions, computations in a category.
347p culao1122 08012013 24 3 Download

For over ten years, Richard Deal has operated his own company, The Deal Group Inc., in Oviedo, Florida, east of Orlando. Richard has over 20 years of experience in the computing and networking industry including networking, training, systems administration, and programming. In addition to a BS in Mathematics from Grove City College, he holds many certifications from Cisco and has taught many beginning and advanced Cisco classes.
752p khainvtk4 04032010 217 52 Download

Computational fluid dynamics (CFD) is concerned with the efficient numerical solution of the partial differential equations that describe fluid dynamics. CFD techniques are commonly used in the many areas of engineering where fluid behavior is an important factor. Traditional fields of application include aerospace and automotive design, and more recently, bioengineering and consumer and medical electronics.
523p chipmoon 19072012 93 33 Download

For quite a long time, computer security was a rather narrow field of study that was populated mainly by theoretical computer scientists, electrical engineers, and applied mathematicians. With the proliferation of open systems in general, and of the Internet and the World Wide Web (WWW) in particular, this situation has changed fundamentally. Today, computer and network practitioners are equally interested in computer security, since they require technologies and solutions that can be used to secure applications related to electronic commerce.
417p thutrang 26082009 59 14 Download

Evolutionary computation has been widely used in computer science for decades. Even though it started as far back as the 1960s with simulated evolution, the subject is still evolving. During this time, new metaheuristic optimization approaches, like evolutionary algorithms, genetic algorithms, swarm intelligence, etc., were being developed and new fields of usage in artificial intelligence, machine learning, combinatorial and numerical optimization, etc., were being explored.
326p bi_bi1 11072012 45 14 Download

This book is about how to construct and use computational models of specific parts of the nervous system, such as a neuron, a part of a neuron or a network of neurons. It is designed to be read by people from a wide range of backgrounds from the biological, physical and computational sciences. The word ‘model’ can mean different things in different disciplines, and even researchers in the same field may disagree on the nuances of its meaning.
0p taurus23 27092012 21 5 Download

Harvester Studies in Cognitive Science is a new series which will explore the nature of knowledge by way of a distinctive theoretical approach one that takes account of the complex structures and interacting processes that make thought and action possible. Intelligence can be studied from the point of view of psychology, philosophy, linguistics, pedagogy and artificial intelligence, and all these different emphases will be represented within the series.
223p nhutretho 26022013 20 5 Download

An enumeration of a collection of items is a complete, ordered listing of all of the items in that collection. The term is commonly used in mathematics and theoretical computer science to refer to a listing of all of the elements of a set. In statistics the term categorical variable is used rather than enumeration. The precise requirements for an enumeration (for example, whether the set must be finite, or whether the list is allowed to contain repetitions) depend on the branch of mathematics and the context in which one is working....
46p doilan 26012013 21 4 Download

http://www.nap.edu/catalog/4886.html We ship printed books within 1 business day; personal PDFs are available immediately. Mathematical Challenges from Theoretical/Computational Chemistry Committee on Mathematical Challenges from Computational Chemistry, National Research Council ISBN: 0309560640, 144 pages, 8.5 x 11, (1995) This PDF is available from the National Academies Press at: http://www.nap.edu/catalog/4886.
144p banhkem0908 24112012 18 3 Download

It is by now well established that quantum machines can solve certain computational problems much faster than the best algorithms known in the standard Turing machine model. The complexity question of which problems can be feasibly computed by quantum machines has also been extensively investigated in recent years, both in the context of one machine models (quantum polynomial classes) and various flavors of multimachine models (single and multiple prover quantum interactive proofs).
0p hotmoingay 03012013 19 2 Download

We describe a new loss function, due to Jeon and Lin (2006), for estimating structured loglinear models on arbitrary features. The loss function can be seen as a (generative) alternative to maximum likelihood estimation with an interesting informationtheoretic interpretation, and it is statistically consistent. It is substantially faster than maximum (conditional) likelihood estimation of conditional random ﬁelds (Lafferty et al., 2001; an order of magnitude or more).
8p hongvang_1 16042013 23 2 Download

Allan BORRA Software Technology Department De La Salle University 2401 Taft Avenue, Manila, Philippines ccsabb@ccs.dlsu.edu.ph languages spoken in Southern Philippines. But as of yet, extensive research has already been done on theoretical linguistics and little is known for computational linguistics. In fact, the computational linguistics researches on Philippine languages are mainly focused on Tagalog.1 There are also notable work done on Ilocano.
2p bunrieu_1 18042013 14 2 Download

Much effort has been put into computational lexicons over the years, and most systems give much room to (lexical) semantic data. However, in these systems, the effort put on the study and representation of lexical items to express the underlying continuum existing in 1) language vagueness and polysemy, and 2) language gaps and mismatches, has remained embryonic.
7p bunrieu_1 18042013 15 2 Download

An important goal of ntodent linguistic theory is to characterize as narrowly as possible the class of natural !anguaooes. An adequate linguistic theory should be broad enough to cover observed variation iu human languages, and yet narrow enough to account for what might be dubbed "cognitive demands"  among these, perhaps, the demands of lcarnability and pars,ability. If cognitive demands are to carry any real theoretical weight, then presumably a language may be a (theoretically) pos~ible human language, and yet be "inaccessible" because it is not leanmble or pa~able. ...
6p bungio_1 03052013 11 2 Download

Modeltheoretic semantics provides a computationally attractive means of representing the semantics of natural language. However, the models used in this formalism are static and are usually infinite. Dynamic models are incomplete models that include only the information needed for an application and to which information can be added. Dynamic models are basically approximations of larger conventional models, but differ is several interesting ways. The difference discussed here is the possibility of inconsistent information being included in the model. ...
3p bungio_1 03052013 22 2 Download

This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of handson, practical applications.
270p bautroibinhyen20 06032017 3 2 Download

We present a gametheoretic model of bargaining over a metaphor in the context of political communication, ﬁnd its equilibrium, and use it to rationalize observed linguistic behavior. We argue that game theory is well suited for modeling discourse as a dynamic resulting from a number of conﬂicting pressures, and suggest applications of interest to computational linguists.
12p hongdo_1 12042013 10 1 Download

A computational vehicle for lexicography was designed to keep to the constraints of meaningtext theory: sets of lexical correlates, limits on the form of definitions, and argument relations similar to lexicalfunctional grA~r. Relational data bases look like a natural framework for this. But linguists operate with a nonnormalized view. Mappings between semantic actants and grammatical relations do not fit actant fields uniquely. Lexical correlates and examples are polyvalent, hence denormalized. ...
4p bungio_1 03052013 18 1 Download