Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Programming Languages and Compilers (27)
- Engineering (18)
- Artificial Intelligence and Robotics (10)
- Electrical and Computer Engineering (9)
- Social and Behavioral Sciences (9)
-
- Computer Engineering (8)
- Software Engineering (8)
- Databases and Information Systems (7)
- Information Security (6)
- Library and Information Science (4)
- Mathematics (4)
- Business (3)
- Education (3)
- Numerical Analysis and Scientific Computing (3)
- Sociology (3)
- Arts and Humanities (2)
- Communication (2)
- Communication Technology and New Media (2)
- Computer and Systems Architecture (2)
- Critical and Cultural Studies (2)
- Curriculum and Instruction (2)
- Medicine and Health Sciences (2)
- Meteorology (2)
- Oceanography and Atmospheric Sciences and Meteorology (2)
- Public Health (2)
- Social Media (2)
- Anthropology (1)
- Applied Linguistics (1)
- Keyword
-
- Algorithms (19)
- Security (16)
- Java (15)
- HPF (14)
- Parallel computing (13)
-
- Parallelism (10)
- Privacy (9)
- Codes (8)
- Genetic algorithms (8)
- High Performance Fortran (8)
- Load balancing (8)
- Logic programming (8)
- MPI (8)
- Neural networks (8)
- Sensor networks (8)
- C++ (7)
- Logic (7)
- Programming languages (7)
- XGSP (7)
- HPCC (6)
- NaradaBrokering (6)
- Programming (6)
- Semantics (6)
- Wireless sensor networks (6)
- Collaboration (5)
- Parallel algorithms (5)
- Parallel programming (5)
- SPMD (5)
- Communication (4)
- Concurrent computing (4)
- Publication Year
- Publication
-
- Electrical Engineering and Computer Science - Technical Reports (177)
- Electrical Engineering and Computer Science - All Scholarship (139)
- Northeast Parallel Architecture Center (92)
- College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects (50)
- Dissertations - ALL (36)
-
- Theses - ALL (11)
- Renée Crown University Honors Thesis Projects - All (4)
- School of Information Studies - Faculty Scholarship (4)
- Electrical Engineering and Computer Science - Dissertations (3)
- International Programs (3)
- Media Studies - All Scholarship (2)
- Population Health Research Brief Series (2)
- iSchool - All Scholarship (2)
- Architecture Master Theses (1)
- Center for Advanced Systems and Engineering (1)
- Instructional Design, Development and Evaluation - All Scholarship (1)
- School of Information Studies - Post-doc and Student Scholarship (1)
- Social Science - All Scholarship (1)
- Syracuse University Magazine (1)
- The Lender Center for Social Justice (1)
- Publication Type
Articles 511 - 532 of 532
Full-Text Articles in Computer Sciences
A Proof Procedure For Quantifier-Free Non-Clausal First Order Logic, Neil V. Murray
A Proof Procedure For Quantifier-Free Non-Clausal First Order Logic, Neil V. Murray
Electrical Engineering and Computer Science - Technical Reports
A proof procedure is described which operates on formulas of the predicate calculus which are quantifier-free. The procedure, which involves a single inference rule called NC-resolution, is shown to be complete. Completeness is also obtained for a simple restriction on the rule’s application. Examples are given using NC-resolution not only for synthesis of a logic program from its specification, but for execution of a program specification in its original form.
On List Structures And Their Use In The Programming Of Unification, F. Lockwood Morris
On List Structures And Their Use In The Programming Of Unification, F. Lockwood Morris
Electrical Engineering and Computer Science - Technical Reports
The notion of list structure is discussed, and a new construct is introduced into LISP which permits the computation of list structures containing cycles without recourse to operations which alter existing structures. It is shown that list structures can be used to represent both finite and “rational” infinite terms. Substitutions (generalized for a term algebra which includes infinite terms) are discussed, “tables” are introduced as an abstract data type, and two methods of representing substitutions by tables, together with their interrelation, are considered. Concise programs are given for a succession of forms of Robinson’s unification algorithm, including one which operates …
Dual-Mode Sequential Logic For Function Independent Fault-Testing, Sumit Dasgupta, Carlos R.P. Hartmann, Luther D. Rudolph
Dual-Mode Sequential Logic For Function Independent Fault-Testing, Sumit Dasgupta, Carlos R.P. Hartmann, Luther D. Rudolph
Electrical Engineering and Computer Science - Technical Reports
This paper presents a method of using hardware redundancy to ease the problem of fault testing in sequential logic networks. Sequential logic networks are constructed using two kinds of dual-mode logic gates, one of which is specifically required to initialize a feedback loop to some logic value. Initially, it is shown that these networks can be tested for all single stuck-at-faults with six function-independent tests. Next, this method is generalized to detect large classes of multiple faults with six function-independent tests. In both cases, the network must have the proper number of extra inputs.
A Time- And Space-Efficient Garbage Compaction Algorithm, F. Lockwood Morris
A Time- And Space-Efficient Garbage Compaction Algorithm, F. Lockwood Morris
Electrical Engineering and Computer Science - Technical Reports
Given an area of storage containing scattered marked nodes, one may wish to rearrange them into a compact mass at one end of the area, meanwhile revising all pointers to marked nodes to show their new locations. An algorithm is here described which accomplishes this task in Iinear time relative to the size of the storage area, and in space of the order of one bit for each pointer. The algorithm operates by reversibly encoding the situation that a collection of locations point to a single location by a linear list, emanating from the pointed-to location, passing through the pointing …
Dual-Mode Combinational Logic For Function-Independent Fault Testing, Sumit Dasgupta
Dual-Mode Combinational Logic For Function-Independent Fault Testing, Sumit Dasgupta
Electrical Engineering and Computer Science - Technical Reports
This paper presents a method of using hardware redundancy to ease the problem of fault testing in combinational logic networks. Combinational logic networks are constructed using dual-mode logic gates. Initially, it is shown that these networks can be tested for all single stuck-at-faults using just two function-independent tests. This method is then extended to detect a large class of multiple faults with the same two function-independent tests.
Some Results On Arithmetic Codes Of Composite Length, Tai-Yang Hwang, Carlos R.P. Hartmann
Some Results On Arithmetic Codes Of Composite Length, Tai-Yang Hwang, Carlos R.P. Hartmann
Electrical Engineering and Computer Science - Technical Reports
In this paper we present a new upper bound on the minimum distance of binary cyclic arithmetic codes of composite length. Two new classes of binary cyclic codes of composite length are introduced.
Data Types As Lattices: Retractions, Closures, And Projections, Luis E. Sanchis
Data Types As Lattices: Retractions, Closures, And Projections, Luis E. Sanchis
Electrical Engineering and Computer Science - Technical Reports
This paper considers the mathematical principals of lattice theory oriented toward the theory of computation.
The Definition Of Programming Languages, J. A. Robinson
The Definition Of Programming Languages, J. A. Robinson
Electrical Engineering and Computer Science - Technical Reports
There is no need to argue in favor of concise, clear, complete, consistent, descriptions of programming languages, nor to recite the cost in time, energy, money, and effectiveness which is incurred when a description falls short of these standards. Reliable, high-quality computer programming is impossible without a clear and precise understanding of the language in which the programs are written—this being true quite independently of the merits of a language as a language. In this study we tried to discover the current state of the methodology of definition of programming languages. We sought to separate the question (as far as …
An Optimum Symbol-By Symbol Decoding Rule For Linear Codes, Carlos R.P. Hartmann, Luther D. Rudolph
An Optimum Symbol-By Symbol Decoding Rule For Linear Codes, Carlos R.P. Hartmann, Luther D. Rudolph
Electrical Engineering and Computer Science - Technical Reports
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive to high rate codes. Examples are given for both block and convolutional codes.
Two Models For Combinatory Logic, Luis E. Sanchis
Two Models For Combinatory Logic, Luis E. Sanchis
Electrical Engineering and Computer Science - Technical Reports
We consider in this paper two models of combinatoric logic in which the domain is the same : P(N) the power set of N = the set of non negative integers.
Some Results On The Weight Structure Of Cyclic Codes Of Composite Length, Carlos R.P. Hartmann, T. Y. Hwang
Some Results On The Weight Structure Of Cyclic Codes Of Composite Length, Carlos R.P. Hartmann, T. Y. Hwang
Electrical Engineering and Computer Science - Technical Reports
In this work we investigate the weight structure of cyclic codes of composite length n = n1n2, where n1 and n2 are relatively prime. The actual minimum distances of some classes of binary cyclic codes of composite length are derived. For other classes new lower bounds on the minimum distance are obtained. These new lower bounds improve on the BCH bound for a considerable number of binary cyclic codes.
On The Benefactive Feature In Transitivity, Dale Ellen Gaucas
On The Benefactive Feature In Transitivity, Dale Ellen Gaucas
Electrical Engineering and Computer Science - Technical Reports
An elaboration on the transitivity system network introduced by M. A. K. Halliday is developed. This extension consists of a separate feature system network for the participant role of “beneficiary”. The formulation of the proposed grammar rules to conjoin this network and Halliday's is facilitated by building up the transitivity network to describe "systemically” and uniquely each type of benefactive and range clause presented by Halliday. Systemic descriptions of these clauses are given as examples throughout the discussion.
Statistical Modelling Of Computer Systems: A Review, Amrit L. Goel, Anand M. Joglekar
Statistical Modelling Of Computer Systems: A Review, Amrit L. Goel, Anand M. Joglekar
Electrical Engineering and Computer Science - Technical Reports
This paper briefly reviews the data dependent statistical methods useful for computer systems modelling. The techniques are classified according to their applicability toward comparison, tuning and design of computer systems. A review of publications dealing with statistical modeling of computer systems is presented and a comprehensive bibliography is included to provide a useful source of reference toward the present and potential applications of statistical methods for computer system modelling.
Weight Distributions Of Some Classes Of Binary Cyclic Codes, Carlos R.P. Hartmann, J. R. Riek Jr., Ralph J. Longobardi
Weight Distributions Of Some Classes Of Binary Cyclic Codes, Carlos R.P. Hartmann, J. R. Riek Jr., Ralph J. Longobardi
Electrical Engineering and Computer Science - Technical Reports
Let h1(x)h2(x) be the parity check polynomial of a binary cyclic code. This article presents a formula for decomposing words in the code as sums of multiples of words in the codes whose parity check polynomials are h1(x) and h2(x). This decomposition provides information about the weight distribution of the code.
Statistical Modelling Of Computer Systems: A Survey, Amrit L. Goel, Anand M. Joglekar
Statistical Modelling Of Computer Systems: A Survey, Amrit L. Goel, Anand M. Joglekar
Electrical Engineering and Computer Science - Technical Reports
This paper briefly surveys the data dependent statistical methods useful for computer systems modelling. The techniques are classified according to their applicability toward comparison, tuning and design of computer systems. A review of papers dealing with statistical modelling of computer systems is presented and a comprehensive bibliography is included to provide a useful source of reference toward the present and potential applications of statistical methods for computer system modelling.
Generalized Finite-Geometry Codes, Carlos R.P. Hartmann, Luther D. Rudolph
Generalized Finite-Geometry Codes, Carlos R.P. Hartmann, Luther D. Rudolph
Electrical Engineering and Computer Science - Technical Reports
A technique is presented for constructing cyclic codes that retain many of the combinatorial properties of finite-geometry codes, but are often superior to geometry codes. It is shown that L-step orthogonalization is applicable to certain subclasses of these codes.
Decoding By Sequential Code Reduction, Luther D. Rudolph, Carlos R.P. Hartmann
Decoding By Sequential Code Reduction, Luther D. Rudolph, Carlos R.P. Hartmann
Electrical Engineering and Computer Science - Technical Reports
A general decoding method for cyclic codes is presented which gives promise of substantially reducing the complexity of decoders at the cost of a modest increase in decoding time (or delay). Significant reductions in decoder complexity for binary cyclic finite-geometry codes are demonstrated, and two decoding options for the Golay code are presented.
Some Results On The Best Match Problem, Luther D. Rudolph, Kishan Mehrotra, Ralph J. Longobardi
Some Results On The Best Match Problem, Luther D. Rudolph, Kishan Mehrotra, Ralph J. Longobardi
Electrical Engineering and Computer Science - Technical Reports
The "best-match problem" is concerned with the complexity of finding the best match between a randomly chosen query word and the members of a randomly chosen set of data words. Of principal interest is whether it is possible to significantly reduce the search time required, as compared to exhaustive comparison, by use of memory redundancy (file structure). Minskv and Papert conjecture that "the speed-up values of large memory redundancies is very small, and for large data sets with long word lengths there are no practical alternatives to large searches that inspect large parts of memory". For this report we present …
Some Results On The Distance Properties Of Convolutional Codes, Luther D. Rudolph, Alexander Miczo
Some Results On The Distance Properties Of Convolutional Codes, Luther D. Rudolph, Alexander Miczo
Electrical Engineering and Computer Science - Technical Reports
Rate 1/2 binary convolutional codes are analyzed and a lower bound on free distance in terms of the minimum distances of two associated cyclic codes ìs derived. Next, the complexity of computing the free distance is discussed and a counterexample to a conjecture on the relationship of row distance to free distance for systematic codes Ìs presented. Finally, an improved Gilbert bound for definite decoding is derived.
Studies In Computational Linguistics No. 1, The Recognition Of Alphabets, Edward F. Storm
Studies In Computational Linguistics No. 1, The Recognition Of Alphabets, Edward F. Storm
Electrical Engineering and Computer Science - Technical Reports
Formal parsing rules for programming languages often have machinery for recognizing identifiers, numerical constants, and other substrings whose internal structure is only marginally relevant to the language structure as a whole. In this note alphabets are introduced in which identifiers, constants, etc. are regarded as single symbols. An alphabet is thus constructed out of a finite set of characters, is identified as a regular language and a simple recognition algorithm is described, giving the language designer considerable latitude in his choice of alphabet.
A Note On The Free Distance Of A Convolutional Code, Alexander Miczo
A Note On The Free Distance Of A Convolutional Code, Alexander Miczo
Electrical Engineering and Computer Science - Technical Reports
A counterexample to a conjecture on the number of constraint lengths required to achieve the free distance of a rate l/n systematic convolutional code is presented.
Generalized Threshold Decoding Of Convolutional Codes, Luther D. Rudolph
Generalized Threshold Decoding Of Convolutional Codes, Luther D. Rudolph
Electrical Engineering and Computer Science - Technical Reports
It is shown that any rate l/b systematic convolutional code over GF(p) can be decoded up to its minimum distance with respect to the decoding constraint length by a one-step threshold decoder. It is further shown that this decoding method can be generalized in a natural way to allow “decoding” of a received sequence in its unquantized analog form.