|
| |
| | Model (abstract) - Wikipedia, the free encyclopedia |
 | | In some cases, abstract models can be used to implement computer simulations that illustrate the behavior of a system over time. |  | | Abstract models are used primarily as a reusable tool for discovering new facts, for providing systematic logical arguments as explicatory or pedagogical aids, for evaluating hypotheses theoretically, and for devising experimental procedures to test them. |  | | An abstract model (or conceptual model) is a theoretical construct that represents physical, biological or social processes, with a set of variables and a set of logical and quantitative relationships between them. |
|
http://en.wikipedia.org/wiki/Model_(abstract)
(1352 words)
|
|
| |
| | Abstract: The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm |
 | | Abstract: In this paper, we analyze a performance model for the TCP Congestion Avoidance algorithm. |  | | Abstract: The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm |  | | The model predicts the bandwidth of a sustained TCP connection subjected to light to moderate packet losses, such as loss caused by network congestion. |
|
http://www.psc.edu/networking/papers/model_abstract.html
(1352 words)
|
|
| |
| | Writing Abstract Classes and Methods |
 | | Similarly, in object-oriented programming, you may want to model an abstract concept without being able to create an instance of it. |  | | In this way, an abstract class can define a complete programming interface for its subclasses but allows its subclasses to fill in the implementation details of those methods. |  | | Let's look at an example of when you might want to create an abstract class with an abstract method in it. |
|
http://java.sun.com/docs/books/tutorial/java/javaOO/abstract.html
(1352 words)
|
|
| |
| | SVBPEL4WS - Technical Report |
 | | In that respect, a pragmatic orientation of formal software models and their use for practical purposes such as standardization demands for a gradual formalization of the key language attributes at different levels of abstraction and with a degree of detail and precision as needed [11]. |  | | As mentioned in the abstract model, a pick alarm agent has to record its starting time to calculate the time when each alarm is triggered and inform the pick agent as soon as an onAlarm event occurs. |  | | By refining the abstract model of Section 4, we obtain the intermediate model, which provides the full DASM model of the core constructs of BPEL. |
|
http://www.cs.sfu.ca/~se/bpeltr/TechnicalReport.htm
(1352 words)
|
|
| |
| | Natural Language through Abstract Memory |
 | | ABSTRACT A model is proposed for the functioning of natural language in a mind. |  | | In the superstructure model for natural language, an "abstract" memory channel is superimposed to flow in parallel with the input/output channels, in such a way that a spiral of habituation comes to dominate the associative crossflows in a conscious, linguistically generative process of "transabstractivity." 1. |  | | The dimensionality of the abstract channel is orthogonal, just as the rest of this model is. One function of the abstract memory channel is to intercept the afferent associative tags coming from the visual memory, those tags which might otherwise proceed directly to the auditory memory and control engrams there. |
|
http://mind.sourceforge.net/theory4.html
(1352 words)
|
|
| |
| | Abstract machine - Wikipedia, the free encyclopedia |
 | | An abstract machine, also called an abstract computer, is a theoretical model of a computer hardware or software system. |  | | In the theory of computation, abstract machines are often used in thought experiments regarding computability or to analyze the complexity of algorithms (see computational complexity theory). |  | | An abstract machine implemented as a software simulation, or for which an interpreter exists, is called a virtual machine. |
|
http://en.wikipedia.org/wiki/Abstract_machine
(295 words)
|
|
| |
| | Data model - Wikipedia, the free encyclopedia |
 | | A data model is a model that describes in an abstract way how data is represented in a business organization, an information system or a database management system. |  | | For example in the relational model all data is represented by mathematical relations (or, to be precise, a slightly generalized version thereof). |  | | While simple data models consisting of few tables or objects can be created "manually", large applications need a more systematic approach. |
|
http://en.wikipedia.org/wiki/Data_model
(384 words)
|
|
| |
| | Relational database - Wikipedia, the free encyclopedia |
 | | A relational database is a database that is structured in accordance with the relational model. |  | | The relational algebra is a set of operations that manipulate relations as they are defined in the relational model and as such describes part of the data manipulation aspect of this data model. |  | | The exact set of operations may differ per definition and also depends on whether the unlabeled relational model (that uses mathematical relations) or the labeled relational model (that uses the labeled specialization of mathematical relations) is used. |
|
http://en.wikipedia.org/wiki/Relational_database
(587 words)
|
|
| |
| | OWL Web Ontology Language Semantics and Abstract Syntax |
 | | One of these semantics, defined in Section 3, is a direct, standard model-theoretic semantics for OWL ontologies written in the abstract syntax. |  | | A model-theoretic semantics is given to provide a formal meaning for OWL ontologies written in this abstract syntax. |  | | A mapping from the abstract syntax to RDF graphs is given and the two model theories are shown to have the same consequences on OWL ontologies that can be written in the abstract syntax. |
|
http://www.w3.org/TR/owl-absyn
(2906 words)
|
|
| |
| | OhioLINK ETD: Chen, Pu |
 | | In such a hierarchy, the uppermost layer is an abstract execution model developed to support the computation of logic programs. |  | | An abstract machine is at the bottom of the hierarchy to support the process network model. |  | | Logic programs, which are represented by well motivated logical formalisms, can be viewed operationally as the execution of an abstract computation model on a logical theory, guided by some control information supplied with the theory. |
|
http://www.ohiolink.edu/etd/view.cgi?case1061906762
(453 words)
|
|
| |
| | Cache-oblivious model: Encyclopedia topic |
 | | In computing (computing: The branch of engineering science that studies (with the aid of computers) computable processes and structures), the cache-oblivious model is an abstract machine (abstract machine: an abstract machine, also called an abstract computer, is a theoretical model of a... |  | | The cache-oblivious model was conceived by Harald Prokop for his masters thesis at the Massachusetts Institute of Technology (Massachusetts Institute of Technology: An engineering university in Cambridge) in 1999. |  | | The benefit of the model is that an algorithm which is efficient on a cache-oblivious machine is likely to be efficient across many real machines without fine tuning for particular machine parameters. |
|
http://www.absoluteastronomy.com/reference/cache-oblivious_model
(176 words)
|
|
| |
| | Abstract machine - Wikipedia, the free encyclopedia |
 | | An abstract machine, also called an abstract computer, is a theoretical model of a computer hardware or software system used in Automata theory. |  | | Abstraction of computing processes is used in both the computer science and computer engineering disciplines and usually assumes discrete time paradigm. |  | | An abstract machine can also refer to a microprocessor design which has yet to be (or is not intended to be) implemented as hardware. |
|
http://en.wikipedia.org/wiki/Model_of_computation
(291 words)
|
|
| |
| | A Threaded Abstract Machine |
 | | The machine we have designed is a distributed memory multiprocessor SPMD machine whose nodal model of execution is based on a paradigm of self-scheduling threads. |  | | An abstract machine program is defined a collection of disjoint "threads" each made up of a sequence of abstract machine instructions. |  | | Each node of our machine holds its own distinct copy of the abstract machine program P, and executes threads from that program in a manner that is independent of the state of any other node. |
|
http://www.cs.adelaide.edu.au/~idea/idea4/final/andreww.htm
(1249 words)
|
|
| |
| | Computing Papers on Waterfall model |
 | | A software process model is an abstract blueprint of software life cycle activities. |  | | A software process model is an abstract representation of a process. |  | | Software Process Model A software process model is a high-level representation of the strategy to be followed during the entire life cycle of a software product. |
|
http://computing.breinestorm.net/waterfall+model
(2240 words)
|
|
| |
| | Resource Description Framework (RDF): Concepts and Abstract Syntax |
 | | RDF has an abstract syntax that reflects a simple graph-based data model, and formal semantics with a rigorously defined notion of entailment providing a basis for well founded deductions in RDF data. |  | | Resource Description Framework (RDF): Concepts and Abstract Syntax |  | | RDF Concepts and Abstract Syntax defines an abstract syntax on which RDF is based, and which serves to link its concrete syntax to its formal semantics. |
|
http://www.w3.org/TR/rdf-concepts
(2240 words)
|
|
| |
| | OWL Web Ontology Language Semantics and Abstract Syntax |
 | | One of these semantics, defined in Section 3, is a direct, standard model-theoretic semantics for OWL ontologies written in the abstract syntax. |  | | A mapping from the abstract syntax to RDF graphs is given and the two model theories are shown to have the same consequences on OWL ontologies that can be written in the abstract syntax. |  | | A model-theoretic semantics in the form of an extension to the RDF semantics is also given to provide a formal meaning for OWL ontologies as RDF graphs (OWL Full). |
|
http://www.w3.org/TR/owl-semantics
(2240 words)
|
|
| |
| | XML Protocol Abstract Model |
 | | The WG developed the Abstract Model to provide a framework for evaluating candidate protocols and for reasoning about the development of the protocol itself. |  | | An abstract model is a tool for the description of complex behaviour — it is not a template for an implementation... |  | | An abstract reference that denotes the XML protocol application that a message was originally sent to by the initiating or sending XML protocol application. |
|
http://www.w3.org/TR/xmlp-am
(2240 words)
|
|
| |
| | Agent based model: Facts and details from Encyclopedia Topic |
 | | A computer simulation or a computer model is a computer program which attempts to simulate an abstract model_(abstract)model of a particular system.... |  | | Agent Based Model is a specific individual based computational model for computer simulation computer simulation quick summary: |  | | A von neumann machine is a model created by john von neumann for a computing machine that uses a single storage structure to hold both the set of instructions on... |
|
http://www.absoluteastronomy.com/encyclopedia/a/ag/agent_based_model.htm
(903 words)
|
|
| |
| | abstract machine from FOLDOC |
 | | An abstract machine has an instruction set, a register set and a model of memory. |  | | Such abstract machines are not intended to be constructed as hardware but are used in thought experiments about computability. |  | | A virtual machine is an abstract machine for which an interpreter exists. |
|
http://foldoc.org/?abstract+machine
(179 words)
|
|
| |
| | Publications |
 | | Keywords: symbiogenesis, major evolutionary transitions, evolutionary computation, evolutionary algorithms, Symbiogenic Evolutionary Adaptation Model (SEAM), Hierarchical-if-and-only-if, (HIFF). |  | | Artificial neural networks are a computational paradigm inspired by neurobiology. |  | | All processing is handled by the robot's on-board computer with individuals evaluated using the robot's hardware. |
|
http://www.demo.cs.brandeis.edu/papers/long.html
(179 words)
|
|
| |
| | 3. The Relational Model. |
 | | In 1970, E. Codd, a member of the IBM Research Laboratory in San Jose, California, published his now famous paper, 'A Relational Model for Large Shared Data Banks' [1] in which were defined a set of abstract principles for database management. |  | | A useful aspect of the relational model is that the data definition may itself is represented in tabular form; data descriptions may be created and examined using extensions to the relational query language. |  | | Takes two relations, one binary and one unary, and builds a relation consisting of all values of one column of the binary relation that match, in the other column, all values in the unary relation. |
|
http://www.soi.city.ac.uk/~tony/dbms/relational_dm.html
(2149 words)
|
|
| |
| | WWW Resources on BSP Computing |
 | | Abstract: The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. |  | | Abstract: A quantitative comparison of the BSP and LogP models for parallel computation is developed. |  | | Abstract: Bulk Synchronous Parallelism (BSP) is a parallel programming model that abstracts from low-level program structures in favour of supersteps. |
|
http://web.comlab.ox.ac.uk/oucl/work/bill.mccoll/oparl.html
(3812 words)
|
|
| |
| | Abstracts |
 | | Object-oriented languages provide both a framework and a motivation for exploring the interaction among the concepts of type, data abstraction, and polymorphism, since they extend the notion of type to data abstraction and since type inheritance is an important form of polymorphism. |  | | We define here a query language for semistructured data that is based on the ambient logic, and we describe an execution model for this language. |  | | With subtyping, we obtain partially abstract types and certain initial order-sorted algebras, and may derive proof principles for them. |
|
http://www.luca.demon.co.uk/Papers.html
(3812 words)
|
|
| |
| | ipedia.com: List of publications in computer science Article |
 | | Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints">13.53 Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints |  | | Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints |  | | Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints"> |
|
http://www.ipedia.com/list_of_publications_in_computer_science.html
(2652 words)
|
|
| |
| | New Page 1 |
 | | Study the model - Aspirin, found on pp. |  | | A summary restates the essence of the original in as few words as possible and does not duplicate phrases or phrasing from the original. |  | | One meaning of the word summary is "done without delay or formalities," as in a summary trial. |
|
http://blue.utb.edu/czvalk/assign2.htm
(213 words)
|
|
| |
| | Writing Abstract Classes and Methods |
 | | Similarly, in object-oriented programming, you may want to model an abstract concept without being able to create an instance of it. |  | | In this way, an abstract class can define a complete programming interface for its subclasses but allows its subclasses to fill in the implementation details of those methods. |  | | Let's look at an example of when you might want to create an abstract class with an abstract method in it. |
|
http://java.sun.com/docs/books/tutorial/java/javaOO/abstract.html
(519 words)
|
|
| |
| | Abstract machine - Wikipedia, the free encyclopedia |
 | | An abstract machine, also called an abstract computer, is a theoretical model of a computer hardware or software system. |  | | Abstract machines are often used in thought experiments regarding computability or to analyze the complexity of algorithms (see computational complexity theory). |  | | Abstraction of computing processes is used in both the computer science and computer engineering disciplines and usually assumes discrete time paradigm. |
|
http://en.wikipedia.org/wiki/Abstract_machine
(272 words)
|
|
| |
| | 05-01-01.txt |
 | | Abstract Syntax : The model form of a software artifact expressed in the modeling language such as UML for describing the software language in which software artifacts are written. |  | | The Abstract Syntax Tree Metamodel (ASTM) is the subject of this RFP. |  | | AST model structures permit the expression of compositional relationships to other language constructs and provide a means of expressing a set of direct and derived properties associated with each such language construct. |
|
http://www.omg.org/docs/admtf/05-01-01.txt
(2453 words)
|
|
| |
| | Abstract machine - Wikipedia, the free encyclopedia |
 | | An abstract machine, also called an abstract computer, is a theoretical model of a computer hardware or software system. |  | | Abstract machines are often used in thought experiments regarding computability or to analyze the complexity of algorithms (see computational complexity theory). |  | | Abstraction of computing processes is used in both the computer science and computer engineering disciplines and usually assumes discrete time paradigm. |
|
http://en.wikipedia.org/wiki/Abstract_machine
(272 words)
|
|
| |
| | Computer Science Papers of Andreas R. Blass |
 | | Abstract state machines (ASMs) form a relatively new computation model holding the promise that they can simulate any computational system in lockstep. |  | | This is the first in a series of papers extending the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- to algorithms that can interact with their environments during a step rather than only between steps. |  | | This model, to which we refer as the BGS model, provides a powerful query language in which all computable queries can be expressed. |
|
http://www.math.lsa.umich.edu/~ablass/comp.html
(272 words)
|
|
|