If DSS is to contribute to the firm, then it must contribute to reaching the firm's objective, profit maximization. The present paper outlines the use of decision tables for initial implementation of a critical se...
详细信息
If DSS is to contribute to the firm, then it must contribute to reaching the firm's objective, profit maximization. The present paper outlines the use of decision tables for initial implementation of a critical search strategy for goal driven DSS design set out in two earlier papers.
Logic programs and databases are studied from the point of view of default logic. A specific class of programs, namely stratifiable programs, are considered. For stratifiable logic programs and databases, the authors ...
详细信息
ISBN:
(纸本)0818607939
Logic programs and databases are studied from the point of view of default logic. A specific class of programs, namely stratifiable programs, are considered. For stratifiable logic programs and databases, the authors show that: (a) default logic, perfect models, circumscription and iterated fixed points all lead to equivalent semantics;and (b) the minimal model semantics is sufficient to define the semantics of logic programs and databases.
The term 'referations' in a given document is defined as the joining of citations (citing documents), references (cited documents) and document itself. It represents the relationships between a given document ...
详细信息
ISBN:
(纸本)0938734199
The term 'referations' in a given document is defined as the joining of citations (citing documents), references (cited documents) and document itself. It represents the relationships between a given document and the others, and produces the more valuable measures between documents than references or citations. Referation file of document collection in a specific topic can be easily obtained in microcomputers using reference data. Referation database, that is, document file with referation file, is a kind of knowledge database structured by relations. This paper outlines some functions based on referations for the content and structure of bibliographic information.
Residue arithmetic has some desirable features which include: lack of carries, bounded input output dynamic range and the ability to decompose a calculation into many parallel subcalculations of lesser complexity. Suc...
详细信息
ISBN:
(纸本)0936659661
Residue arithmetic has some desirable features which include: lack of carries, bounded input output dynamic range and the ability to decompose a calculation into many parallel subcalculations of lesser complexity. Such features, when combined with high-speed position-coded optoelectronic look-up tables (LUT), result in high-speed, power efficient, low complexity processors. Residue position-coded LUTs. expected LUT performance, and LUT matrix multiplier complexity are considered.
The throughput of data-structure manipulation operations presently limits the applicability of relational database machines. Since most relational algebra operations can be treated as modifications of sorting algorith...
详细信息
ISBN:
(纸本)0892527897
The throughput of data-structure manipulation operations presently limits the applicability of relational database machines. Since most relational algebra operations can be treated as modifications of sorting algorithms, special-purpose hardware based on fast sorting algorithms should increase the performance of these machines. Parallel sorting algorithms representable as self-routing, multistage networks are ideal for optical implementation because they require global interconnects and simple parallel-processing units. The processing units perform a local operation called compare-and-exchange (C&E). Our goal is to realize fast optical sorting networks. Therefore, we describe C&E implementations in analog optics, and digital optics with all-optical, hybrid optoelectronic and polarization logic. Furthermore, we delineate application domains of the networks based on system and technology characteristics.
To increase the productivity of information processing and transmission systems with time redundancy, intermediate results, are stressed in a device where information is well protected against destruction. At the same...
详细信息
To increase the productivity of information processing and transmission systems with time redundancy, intermediate results, are stressed in a device where information is well protected against destruction. At the same time, for maximization of productivity of the system, the control in which the decision about the next storing of information is taken in accordance with the increment of the total work done by the system is generally used. The possibility of using controls of another type, in which the decision about the organization of the next storing information is taken on the basis of the corresponding increment of the 'net' system utilization time, is considered.
Megiddo introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. This paper provides a general method that trims a factor of O(log n) time ...
详细信息
Megiddo introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. This paper provides a general method that trims a factor of O(log n) time (or more) for many applications of this technique.
A new class of distributive partitioning sort algorithms is proposed, in which the number of subgroups in each distributing pass is only dependent on the number of records in the original file of records to be sorted ...
详细信息
A new class of distributive partitioning sort algorithms is proposed, in which the number of subgroups in each distributing pass is only dependent on the number of records in the original file of records to be sorted and on the number of distributing passes experienced before by the records to be distributed. The number of records to be distributed is irrelevant. An analysis of the expected time complexity is given.
This paper considers language C which has a high modularity among procedures (functions), and newly proposes a large-scale program processing system overcoming the limitation of the address space. A measurement is mad...
详细信息
This paper considers language C which has a high modularity among procedures (functions), and newly proposes a large-scale program processing system overcoming the limitation of the address space. A measurement is made on the implemented system, and it is shown that the increase of the production code and the decrease of the execution speed is within the permissible range, compared with the usual processing system.
Many applications in programming require to store and retrieve information in tabular form. One method that minimizes the number of comparisons needed to find an item is the binary search. Unfortunately, the binary se...
详细信息
Many applications in programming require to store and retrieve information in tabular form. One method that minimizes the number of comparisons needed to find an item is the binary search. Unfortunately, the binary search suffers from two defects that limit its application. First, it requires that the table it is searching be in sorted order. Second, because of the first requirement, it is difficult to add items to the table. Quite frequently, the addition of a new item into an unsorted table is required. Table lookup methods classified as hashing schemes, or hash-table techniques, not only meet the two objections above but are usually faster than the binary search. Although several hashing schemes are known and in use, they divide into two subclasses known as chaining techniques and open-addressing techniques each type is examined, in turn some examples are given and their strengths and weaknesses are compared. For those who want to delve more deeply into the subject, the results of some recent research in this area are indicated and some references are provided. 6 refs.
暂无评论