S.C. van der Made-Potuyt, The necessity for check-on-commit in the protection of the integrity of a database, 1989 Department of Computer Science, Erasmus University Rotterdam, Report EUR-CS-89-05.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....counting these conspiracy numbers allows search to be focused towards parts of the tree most likely to change the choice of best move. Some experiments with the technique are reported in [Schaeffer 91] and [Allis et al. 91a] devises a version that uses a pruning technique similar to alpha beta. [Allis et al. 91] describes a specialized version of conspiracy search called proof number search that is optimized for finding solution trees; it has been used in solving several games (proving their game theoretic values) All the above selective search methods are general, in that they can be applied to any ....

....unknown. So instead, we 1. This measure is discussed in a machine learning context by Rivest and Sloan in [Rivest Sloan 93] It leads to a significantly different view of the problem, one that is perhaps not so appropriate for medical decision making. Also one can view Allis s proof number search [Allis et al. 91] in this way. 118 decided to fix the level of our states to be that of information states describing all that we know about the state at a given point all the visible cards. As we mentioned earlier, it is possible to treat the outcome of turning over a new card as if it were a chance event, ....

L. V. Allis, M. van der Meulen, and H. J. van den Herik. Proof-number search. Technical report 91-01, Department of Computer Science, University of Limburg, PO Box 616, 6200 MD Maastricht, The Netherlands. 1991.

....(where an action can occur even if the receiver is not ready, producing a fault) According to [Di89] CSP has a similar inconvenience. 4 Contents and form This paper is structured as follows. In Section 2 we define our basic model, which is closely related to trace theories like those of [Sn83], Ud86] Eb86] and [Ve94] In Section 3, we discuss a general pattern and some desirable properties for modular and hierarchical verification of correctness conditions. In Section 4, we discuss correctness conditions other than liveness that are needed as restrictions for our liveness ....

....formally because we do not need it as a restriction for our liveness condition. Nevertheless, we mention input control because we refer to it in later examples. Safety Safety has been extensively studied in trace theory. Conditions covering safety concerns have been proposed, for example, in [Sn83, Ud86, Eb86, Di89, Eb91, Jos92, GBMN94, Ve94]. Our condition for safety agrees with some of these previous conditions under appropriate connectivity restrictions, and we discuss this issue in more detail later in this section. However, all these previous conditions have restrictions (either explicit or hidden in the model) on the ports of ....

[Article contains additional citation context not shown here]

J. L. A. van de Snepscheut. Trace Theory and VLSI Design. PhD Thesis, Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1983.

....access in general. However, newspapers and journals contain huge amounts of multi disciplinary information that cannot always be semantically linked nor classified. Indeed, current retrieval techniques have evolved towards methods based on keywords, dates, types of data, etc. zsu et al., 1995; Sanderson Rijsbergen, 1994). However, since these methods ignore the relationships between news such as their temporal connections, they do not exploit all the potential outcomes that historical issues offer. So far, document databases have partially concerned with similar issues, especially with the document structures. ....

....applications with minor extensions to the definition and query database languages. On the other hand, little work has been done to represent the temporal information of documents. Current systems to retrieve news and newspapers only manage the date of publication of documents (zsu et al., 1995; Sanderson Rijsbergen, 1994; San Jose Mercury News, 1996) In this way, the user can only specify a time interval when retrieving documents, but cannot take profit of other temporal features and relationships between them, like their frequency and time ordering. Consequently, there not exists any retrieval language for ....

[Article contains additional citation context not shown here]

Sanderson, M. & van Rijsbergen, K. (1994). NRT (News Retrieval Tool). Tech. Rep. Department of Computer Science. The University of Glasgow. UK.

....of machine architecture. To provide a set of computational primitives that perform well on machines with a memory hierarchy the so called level 3 BLAS was proposed in 1986. The level 3 BLAS is a collection of linear algebra subroutines that perform O(n 3 ) operations on O(n 2 ) data; see [33, 53]. The algorithms implemented in the LAPACK library, which is used on most serial and shared memory multiprocessor machines today for computations involving dense matrix, use block algorithms written in terms of calls to the level 3 BLAS subroutines to achieve good performance. As an example of the ....

B. K#gstr#m & C. Van Loan, GEMM-Based Level-3 BLAS, Tech. rep. CTC91TR47, Department of Computer Science, Cornell University, Dec. 1989.

....in cooperation with other agents and only prompts the user when necessary. We will thus consider the ID paradigm from the point of view of multi agent systems. Much research has been done into agents (see e.g. Mar97] and especially in the field of formal logics (see e.g. WJ95] HL96] and [vL96] However, the use of agents in ID has, to this moment, been rather pragmatic and ad hoc. Most of the agents used in ID are not developped from a formal point of view. A more elaborate investigation into the types of agents needed in ID is necessary. The majority of agents used in ID systems ....

B. van Linder. Modal Logics for Rational Agents. PhD thesis, Department of Computer Science, Utrecht University, The Netherlands, June 1996.

....for an agent based approach, since they are considered essential to the notion of agency as described in [WJ95] More about this in subsection 3.3. For information about intelligent agents see e.g. the aforementioned article as well as [HL96] which describes an IR application of agents, and [vL96] which provides a formal framework for intelligent agents based on modal logics. The Retrieval Engine will therefore be developed as an intelligent retrieval agent, incorporating the above mentioned characteristics, as well as being able to communicate with other agents. Agents can be described ....

B. van Linder. Modal Logics for Rational Agents. PhD thesis, Department of Computer Science, Utrecht University, The Netherlands, june 1996.

....1 work on 2 6 6 4 0 1 2 3 4 7 5 6 8 9 3 7 7 5 ; 2 6 6 4 26 27 28 29 30 33 31 32 34 35 3 7 7 5 : 7) Finally, on level 0 there is the root of the tree which is working on the A ij blocks in Figure 3. The recursive blocked algorithms for the RB TRSM and RB SYRK use the GEMM based approach [9, 5, 10] and therefore call RB GEMM, which in turn perform all computations at the leaves of its recursion tree by calling registerbased GEMM kernel routines with operands that fit in level 1 cache. Our recursive algorithm for RB GEMM is further discussed in the next section. 4 Recursive Blocked DGEMM ....

B. Kagstrom and C. Van Loan. GEMM-Based Level-3 BLAS. Technical Report CTC91TR47, Department of Computer Science, Cornell University, December 1989.

....its tasks in cooperation with other agents and only prompts the user when necessary. We will thus consider the ID paradigm from the point of view of multi agent systems. Much research has been done into agents (see e.g. 5] and especially in the field of formal logics (see e.g. 10] 4] and [8]) However, the use of agents in ID has, to this moment, been rather pragmatic and ad hoc. Most of the agents used in ID are not developped from a formal point of view. A more elaborate investigation into the types of agents needed in ID is necessary. The majority of agents used in ID systems ....

B. van Linder. Modal Logics for Rational Agents. PhD thesis, Department of Computer Science, Utrecht University, The Netherlands, June 1996.

....that interact with each other. In [Kur86] language containment techniques are proposed to verify that the language generated by the circuit is included in the language of the specification. Later, the same author proposed homomorphic reductions to simplify the problem [Kur87] Trace theory [vdS83, Dil89] has been used to keep the history of the system. Then, properties of the system can be verified on the state graph by using temporal logic. In his thesis [Dil89] Dill already proposed hierarchical verification of speed independence: if a component conforms to a trace structure, the ....

J. L. A. van de Snepscheut. Trace Theory and VLSI design. PhD thesis, Department of Computer Science, Eindhoven University of Technology, October 1983.

....message passing protocols to form a network layer for machines involved in the application. In a larger context, this work can be viewed as extending the hierarchical approach to constructing modular networking software represented by such systems as the x kernel [HP91] and Horus [RBG 95, RB95] to support finer grain modules and more flexible inter module communication capabilities. The goal of this paper is to describe the design of this configurable membership service and to relate some initial experience with a prototype implementation written in C . In relation to other papers on ....

....in [Hil95] In addition to research on specific membership protocols, three other projects have investigated issues similar to those addressed in this paper. The membership service in Horus, a system for constructing modular networking software according to a hierarchical model [RBG 95, RB95] provides some degree of choice in the properties that it guarantees. In particular, the application may choose to deal with partitions by using a single partition approach or by allowing computation to continue in all partitions. In [RFJ93] a family of three membership protocols are described, ....

R. van Renesse and K. Birman. Protocol composition in Horus. Technical Report TR95-1505, Department of Computer Science, Cornell University, Mar 1995.

....automata that interact with each other. In [13] language containment techniques are proposed to verify that the language generated by the circuit is included in the language of the specification. Later, the same author proposed homomorphic reductions to simplify the problem [14] Trace theory [28, 7] has been used to keep the history of the system. Then, properties of the system can be verified on the state graph by using temporal logic. More recently, 20] has modeled both circuit and specification as Petri nets [22] mitigating the state explosion problem by means of Petri net unfolding. ....

J. L. A. van de Snepscheut. Trace Theory and VLSI design. PhD thesis, Department of Computer Science, Eindhoven University of Technology, Oct. 1983.

....(e.g. for layer sizes) SNNS[57] NeuralWorks[38] NeuroGraph[53] Module libraries. Other tools basically offer a library of programmed modules (written in a general purpose language like C or C ) Again, networks can be instantiated with different parameters (SESAME[25] RCS[12] Xerion[4]) Specific programming languages. Finally, there are systems offering a special programming language for specifying networks. In addition there may also be a library of modules written in that language (DESIRE NEUNET[20] Nessus[55] Aspirin[23] PlaNet[33] AXON[15] CONNECT[18] Some of the ....

....networks, but also tools for their graphical representation and analysis. Moreover, tools for data base access, for data preprocessing and postprocessing etc. can be found. Of course, despite these common general characteristics, there are differences between the systems. RCS[12] and Xerion[4], for example, provide C libraries; the predefined routines and struc20 tures can be used to construct a simulator for a specific neural network model (e.g. the Boltzmann machine, the Kohonen network, a backpropagation network etc. The principle of having a toolbox of basic building blocks for ....

D. van Camp: A Users Guide for the Xerion Neural Network Simulator, Version 3.1, Department of Computer Science, University of Toronto (1993).

....daemon in every subnet and the receiving daemon is responsible for distributing the message to the other daemons in the subnet. We are currently working on better solutions for the message distribution. Therefore we are trying to use existing toolkits for achieving our functionality (e.g. HORUS [Renes93], GTS [Maffe95] IP multicast, MBONE) Applications that want to use the multicast service are linked with the client library that consists of stub functions that communicate with the daemon process. When messages are received they are queued for the clients. 5.2.2 Multithread Our thread library ....

R. van Renesse, K. P. Birman, R. Cooper, B. Glade, and P. Stephenson. The Horus System. Technical report CS TR. Department of Computer Science, Cornell University, Ithaca, NY, July 1993.

....the x kernel. Although configurable, the different choices available for the application builder are limited to different message ordering properties. The Horus system provides similar services for distributed applications but with a higher degree of 29 configurability than Consul [RBG 95, RB95, RBM96] Both systems are oriented around hierarchical composition of code modules. 1.3 A New Model for Configurable Fault Tolerant Services This dissertation presents a new approach to constructing configurable fault tolerant services. In this approach, a service is constructed of fine grained ....

....Psync to all sites where it will be received by, among others, the Membership protocol objects. Similar problems were encountered in a project attempting a modular implementation of the xAMP atomic broadcast protocol suite in the x kernel [RV92, Fon94] 2.1.2. 2 Horus Horus [RHB95, RBG 95, RB95, RBM96] is a successor to the Isis system [Bir85a] It is generally targeted for the same type of applications as Isis, but adds extensibility and 37 configurability. The composition model in Horus is linear, that is, a system is constructed as a stack of protocols. STABLE FC XFER MERGE MBRSHIP ....

[Article contains additional citation context not shown here]

R. van Renesse and K. Birman. Protocol composition in Horus. Technical Report TR95-1505, Department of Computer Science, Cornell University, Mar 1995.

....etc. Hence, it is not really important to understand the details presented in this section unless the reader wants to understand why this paper really does formalize category theory. The following definition is copied almost directly from Jaap van Oosten s Basic Category Theory [12]: A category C is given by a class C 0 of objects and a class C 1 of arrows which have the following structure: ffl Each arrow has a domain and a codomain which are objects; one writes f : X Y if X is the domain and Y the codomain of the arrow f . One also writes X = dom(f) and Y = cod(f ) ....

J. van Oosten. Basic category theory. Technical Report LS-95-1, BRICS, Department of Computer Science, University of Aarhus, January 1995.

....University Rotterdam Dr. L.P.J. Groenewegen State University Leiden . November 1990 1 Preface This is the second report concerning transaction management in the database environment. In the first report the role of the transaction manager in protecting the integrity of a database has been studied [MaNe]. In this report a model will be given for the transaction manager as a parallel decision process. To that purpose a modelling method for parallel behaviour, Paradigm, will be introduced. This method uses parallel decision processes for modelling parallel phenomena. Not all the notions of Paradigm ....

S.C. van der Made-Potuyt, The necessity for check-on-commit in the protection of the integrity of a database, 1989 Department of Computer Science, Erasmus University Rotterdam, Report EUR-CS-89-05.

....because it requires assembly level programming thinking. The GEMM based approach presents a way to attain high performance and portability with a limited effort. Often computer systems have efficient implementations of the general matrix multiply operation. The GEMM based level 3 BLAS concept [13] shows that it is possible to formulate the level 3 BLAS operations in terms of the level 3 operation for general matrix multiply and add (GEMM) and some level 1 and level 2 BLAS operations. Department of Computer Science, Cornell University, Ithaca, New York 14853 7501 We are in the process ....

....for both general and structured matrix multiplication. Multiple right hand side triangular system solving is also handled by the package as it is rich in matrix multiplication if properly organized. We have shown that one can live with just one highly optimized Level 3 BLAS routine: GEMM [13, 8]. This subprogram oversees a general matrix multiply of the form C ffop(A)op(B) fiC, where op(X) denotes X or X T . The structured matrix multiplication problems handled by the other Level 3 BLAS can be couched in terms of GEMM and a negligible amount of Level 1 and 2 computations, with ....

B. Kagstrom and C. Van Loan. GEMM--Based Level--3 BLAS. Technical Report CTC91TR47, Department of Computer Science, Cornell University, December 1989.

....tied to the lexicographic ordering of strings. The main open problems in this paper are interesting in connection with recent work by Impagliazzo and Wigderson [IW98] on the BPP vs. EXP problem. First we remark that the main result of [IW98] implies that either BPP = EXP or BPP has E measure zero [vM98]. Among the many measure statements in the last section that imply BPP 6= EXP, the most constrained and easiest to attack seems to be item 4 in Corollary 6.5. Indeed, in the specific relevant case starting with the assumption BPP = EXP, one is given a non adaptive E betting game G and an ....

D. van Melkebeek. On the measure of BPP. Technical Report TR-98-07, Department of Computer Science, University of Chicago, July 1998.

....notions of category theory and presents a formalization in higher order logic. In Section 3.9 a number of problems and limitations of the formalization are discussed. 3. 1 Definition of Category The following definition is copied almost directly from Jaap van Oosten s Basic Category Theory [9]: A category C is given by a class C 0 of objects and a class C 1 of arrows which have the following structure: ffl Each arrow has a domain and a codomain which are objects; one writes f : X Y if X is the domain and Y the codomain of the arrow f . One also writes X = dom(f) and Y = cod(f ) ....

J. van Oosten. Basic category theory. Technical Report LS-95-1, BRICS, Department of Computer Science, University of Aarhus, January 1995.

....can be reorganized in terms of blocked factorizations and higher level (matrixmatrix) operations to reduce A to upper block Hessenberg form and B to upper triangular form. In order to make the algorithm portable and efficient most operations are expressed in terms of BLAS [8] 4] 6] [7] and LAPACK. Several ways to annihilate elements are evaluated. We compare the use of Givens rotations, Householder transformations, and combinations of the two. Performance results of the different variants are presented and compared to the unblocked LAPACK implementation DGGHRD. The rest of the ....

B. Kagstrom and C. Van Loan. GEMM-Based Level 3 BLAS. Tech. rep. CTC91TR47, Department of Computer Science, Cornell University, 1989.

.... can be used to perform the actual structure update. In the case of a pipe of length 4, this means 4 instantiations of B, 3 creations of new message queues, and the necessary connects. A more comprehensive description of these concepts, and an introduction to the Prolog interface can be found in [PvS96b]. Summary With the Prolog interface described above, we have three techniques which can be used together to design a parallel, distributed application: ffl A graphical communication structuring technique in terms of processes, gates and channels, rendering a process hierarchy by means of process ....

M. Polman and M.R. van Steen. Dynamic creation in ADL-D. Technical report, Erasmus University Rotterdam, Department of Computer Science, 1996. to appear.

....tied to the lexicographic ordering of strings. The main open problems in this paper are interesting in connection with recent work by Impagliazzo and Wigderson [IW98] on the BPP vs. EXP problem. First we remark that the main result of [IW98] implies that either BPP = EXP or BPP has E measure zero [vM98]. Among the many measure statements in the last section that imply BPP 6= EXP, the most constrained and easiest to attack seems to be item 4 in Corollary 6.5. Indeed, in the specific relevant case starting with the assumption BPP = EXP, one is given a non adaptive E betting game G and an ....

D. van Melkebeek. On the measure of BPP. Technical Report TR-98-07, Department of Computer Science, University of Chicago, July 1998.

....architectures it can be very costly and time consuming to develop a high performance level 3 BLAS because it requires assembly level programming thinking. The GEMM based approach presents a way to attain high performance and portability with a limited effort. The GEMM based level 3 BLAS concept [21] shows that it is possible to formulate the level 3 BLAS operations in terms of the level 3 operation for general matrix multiply and add (GEMM) and some level 1 and level 2 BLAS operations. Whenever new high performance architectures or extensions and modifications of existing ones are ....

.... n, k, alpha, A, lda, B, ldb, beta, C, ldc ) TRMM ( side, uplo, trans, diag, m, n, alpha, A, lda, C, ldc ) TRSM ( side, uplo, trans, diag, m, n, alpha, A, lda, C, ldc ) 3 GEMM Based Level 3 BLAS Concept We have shown that one can live with just one highly optimized level 3 BLAS routine: GEMM [21, 17]. This subprogram oversees a general matrix multiply of the form C ffop(A)op(B) fiC; where op(X) denotes X or X T : The structured matrix multiplication problems handled by the other level 3 BLAS can be couched in terms of GEMM and a small amount of level 1 and 2 computations, with ....

B. Kagstrom and C. Van Loan. GEMM-Based Level 3 BLAS. Technical Report CTC91TR47, Department of Computer Science, Cornell University, December 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC