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 451 - 480 of 532
Full-Text Articles in Computer Sciences
Householder Reduction, Per Brinch Hansen
Householder Reduction, Per Brinch Hansen
Electrical Engineering and Computer Science - Technical Reports
This tutorial discusses Householder reduction of n linear equations to a triangular form which can be solved by back substitution. The main strengths of the method are its numerical stability and suitability for parallel computing. We explain how Householder reduction can be derived from elementary matrix algebra. The method is illustrated by a numerical example and a Pascal algorithm. We assume that the reader has a general knowledge of vector and matrix algebra but is less familiar with linear transformation of a vector space.
Axiomatization Of Some Natural Quantifiers, William C. Purdy
Axiomatization Of Some Natural Quantifiers, William C. Purdy
Electrical Engineering and Computer Science - Technical Reports
This paper extends an existing logic, £n, to some of the generalized quantifiers of natural language. In contrast to the usual approach, this extension does not require the identity relation. Sommers has suggested that the identity is unnecessary in a logic that properly treats singular terms. This paper lends support to Sommers position. £n is a logic designed for natural language reasoning (see [3]). This paper defines an extension, LNQ, of that logic to include the cardinal quantifiers, at least n, and the second-order quantifier, most. Because of the limited expressiveness of first-order languages, a complete axiomatization for most is …
Hypercube Algorithms For Operations On Quadtrees, Ravi V. Shankar, Sanjay Ranka
Hypercube Algorithms For Operations On Quadtrees, Ravi V. Shankar, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper describes parallel algorithms for the following operations on quadtrees - boolean operations (union, intersection, complement), collapsing a quadtree, and neighbor finding in an image represented by a quadtree. The architecture assumed in this paper is a hypercube with one processing element (PE) per hypercube node. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit.
Parallel Vision Algorithms Using Sparse Array Representations, Ravi V. Shankar
Parallel Vision Algorithms Using Sparse Array Representations, Ravi V. Shankar
Electrical Engineering and Computer Science - Technical Reports
Sparse arrays are arrays in which the number of non-zero elements is a small fraction of the total number of array elements. This paper presents computer vision algorithms using sparse representations for arrays. The parallel architecture considered is a hypercube. The algorithms can be easily modified for other architectures like the mesh. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit.
Forecasting The Behavior Of Multivariate Time Series Using Neural Networks, Kanad Charkraborty, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Forecasting The Behavior Of Multivariate Time Series Using Neural Networks, Kanad Charkraborty, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper presents a neural network approach to multivariate time-series analysis. Real world observations of flour prices in three cities have been used as a benchmark in our experiments. Feedforward connectionist networks have been designed to model flour prices over the period from August 1972 to November 1980 for the cities of Buffalo, Minneapolis, and Kansas City. Remarkable success has been achieved in training the networks to learn the price curve for each of these cities, and thereby to make accurate price predictions. Our results show that the neural network approach leads to better predictions than the autoregressive moving average(ARMA) …
Optimal Parallel Solutions To The Neighbor Localization Problem And Integer Sorting: A Fine Grained Approach, Ramachandran Vaidyanathan, Carlos R.P. Hartmann, Pramod K. Varshney
Optimal Parallel Solutions To The Neighbor Localization Problem And Integer Sorting: A Fine Grained Approach, Ramachandran Vaidyanathan, Carlos R.P. Hartmann, Pramod K. Varshney
Electrical Engineering and Computer Science - Technical Reports
In this report, a fine-grained decomposition approach is used to obtain an optimal parallel solution to the Neighbor Localization Problem, which in turn is œ used to sort n θ(log n)-bit numbers optimally on an EREW model. The model of computation used is the EREW Reconfigurable PRAM (R-PRAM) that permits the use of “very small” processors. The main result of this report is a parallel EREW R-PRAM algorithm that sorts n θ(log n)-bit numbers in θ(log n) time with θ(n log n) “work”. The proposed algorithm is asymptotically optimal in time and efficiency. If a weaker variant of the R-PRAM …
A Space And Time Efficient Coding Algorithm For Lattíce Computations, Deb Dutta Ganguly, Sanjay Ranka
A Space And Time Efficient Coding Algorithm For Lattíce Computations, Deb Dutta Ganguly, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper presents an encoding algorithm to enable fast computation of the least upper bound (LUB) and greatest lower bound (GLB) of a partially ordered set. The algorithm presented reduces the LUB computation to an OR operation on the codes. The GLB computation is reduced essentially to an AND operation on the codes. The time complexity of our encoding algorithm is O(n + e) where n is the number of nodes and e is the number of edges. With respect to space requirements the algorithm presented gives good results for small lattices (code length was 50 bits for a 300 …
A Colored Petri Net-Based Approach For Automated Deadlock Detection In Parallel Programs, N. Mansouri, Amrit L. Goel
A Colored Petri Net-Based Approach For Automated Deadlock Detection In Parallel Programs, N. Mansouri, Amrit L. Goel
Electrical Engineering and Computer Science - Technical Reports
A static analysis approach is proposed for automated detection of deadlocks in a common class of parallel programs, referred to as Single Code Multiple Data (SCMD) programs. It is based on colored Petri net (CP-net) modeling and reachability analysis, where colors correspond to parallel processes. An SCMD program is first translated into a CP-net and a reachability tree is then derived and analyzed for deadlock information. CP-subnets representing basic programming language constructs are described. These subnets are employed as building blocks by an algorithm that translates synchronization-related statements of a process in an SCMD program and connects the resulting subnets. …
An Approach For Minimizing Spurious Errors In Testing Ada Tasking Programs, N. Mansouri, Amrit L. Goel
An Approach For Minimizing Spurious Errors In Testing Ada Tasking Programs, N. Mansouri, Amrit L. Goel
Electrical Engineering and Computer Science - Technical Reports
We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is based on an extension to Petri net-based techniques, where a concurrent program is modeled as a Petri net and a reachability graph is then derived and analyzed for desired information. In this approach, Predicate-Action subnets representing Ada programming constructs are described, where predicates and actions are attached to transitions. Predicates are those found in decision statements. Actions involve updating the status of the variables that affect the tasking behavior of the program and updating the Read and Write sets of shared variables. The shared …
A Petri Net-Based Tool For Detecting Deadlocks And Race Conditions In Concurrent Programs, Amrit L. Goel, N. Mansouri
A Petri Net-Based Tool For Detecting Deadlocks And Race Conditions In Concurrent Programs, Amrit L. Goel, N. Mansouri
Electrical Engineering and Computer Science - Technical Reports
A static analysis tool for detecting deadlocks and potential race conditions on shared variables in concurrent programs is presented. It is based on Petri Net modeling and reachability analysis, where a concurrent program is modeled as an augmented Petri net and a reachability graph is then derived and analyzed for desired information. Place-Transition subnets representing programming language constructs are described. Transitions in these subnets are augmented with sets of shared variables that occur in sections of the program, called concurrency zones, related to the transitions. The tool consists of four modules. The modeling module employs the augmented subnets as building …
Unification In Modal Theorem Proving, Xiaolin Zhang, Chilukuri K. Mohan
Unification In Modal Theorem Proving, Xiaolin Zhang, Chilukuri K. Mohan
Electrical Engineering and Computer Science - Technical Reports
Modal formulas can be proved by translating them into a three-typed logic and then using unification and resolution, with axioms describing properties of the reachability relation among possible worlds. In this paper, we improve on the algorithms in [1], showing that "strong skolemisation" and occurrence checks are not needed for proving theorems of Q, T, Q4, and S4. We also extend the 'path logic' approach to S5, give the appropriate unification algorithm, and prove its correctness.
Surface Reasoning, William C. Purdy
Surface Reasoning, William C. Purdy
Electrical Engineering and Computer Science - Technical Reports
Surface reasoning is defined to be deduction conducted in the surface language in terms of certain primitive logical relations. The surface language is a spoken or written natural language (in this paper, English), in contrast to a "base language" or “deep structure" sometimes hypothesized to explain natural language phenomena. The primitive logical relations are inclusion, exclusion and overlap between classes of entities. A calculus for surface reasoning is presented. Then a model for reasoning in this calculus is developed. The model is similar to but more general than syllogistic. In this model, reasoning is represented as construction of fragments (subposets) …
Mesh And Pyramid Algorithms For Iconic Indexing, Alok Choudhary, Sanjay Ranka
Mesh And Pyramid Algorithms For Iconic Indexing, Alok Choudhary, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
In this paper parallel algorithms on meshes and pyramids for iconic indexing are presented. Our algorithms are asymptotically superior to previously known parallel algorithms.
Load Redistribution On Hypercubes In The Presence Of Faults, Sanjay Ranka, Jhy-Chun Wang
Load Redistribution On Hypercubes In The Presence Of Faults, Sanjay Ranka, Jhy-Chun Wang
Electrical Engineering and Computer Science - Technical Reports
In this paper, we present load redistribution algorithms for hypercubes in the presence of faults. Our algorithms complete in low-order polynomial of the number of faulty nodes and exhibit excellent experimental performance. These algorithms are topology independent and can be applied to a wide variety of networks.
A Logic For Natural Language, William C. Purdy
A Logic For Natural Language, William C. Purdy
Electrical Engineering and Computer Science - Technical Reports
This paper describes a language called £N whose structure mirrors that of natural language. £N is characterized by absence of variables and individual constants. Singular predicates assume the role of both individual constants and free variables. The role of bound variables is played by predicate functors called "selection operators." Like natural languages, £N is implicitly many-sorted. £N does not have an identity relation. Its expressive power lies between the predicate calculus without identity and the predicate calculus with identity. The loss in expressiveness relative to the predicate calculus with identity however is not significant. Deduction in £N is intended to …
A Simpler Proof Of Ph C Bp[Өp], Kenneth W. Regan, James S. Royer
A Simpler Proof Of Ph C Bp[Өp], Kenneth W. Regan, James S. Royer
Electrical Engineering and Computer Science - Technical Reports
We simplify the proof by S. Toda [Tod89] that the polynomial hierarchy PH is contained in BP[ӨP]. Our methods bypass the technical quantifier interchange lemmas in the original proof, and clarify the counting principles on which the result depends. We also show that relative to a random oracle R, PHR is strictly contained in ӨPR.
Taxonomic Reasoning And Lexical Semantics, William C. Purdy
Taxonomic Reasoning And Lexical Semantics, William C. Purdy
Electrical Engineering and Computer Science - Technical Reports
Taxonomic reasoning is used in many applications, including many-sorted logic, knowledge bases, document retrieval, and natural language processing. These various applications have been dealt with independently. Because they have so much in common, a general approach to taxonomic reasoning would seem to be justified. This paper presents a theory of lexical semantics as an example of such a general approach. The theory defines a representation and an algebra for that representation. The operations of the algebra are inherently parallel, making them well matched to the capabilities of modern computer systems.
Monotone Logic Programming, Howard A. Blair, Allen Brown Jr., V. S. Subrahmanian
Monotone Logic Programming, Howard A. Blair, Allen Brown Jr., V. S. Subrahmanian
Electrical Engineering and Computer Science - Technical Reports
We propose a notion of an abstract logic. Based on this notion, we define abstract logic programs to be sets of sentences of an abstract logic. When these abstract logics possess certain logical properties (some properties considered are compactness, finitariness, and monotone consequence relations) we show how to develop a fixed-point, model-state-theoretic and proof theoretic semantics for such programs. The work of Melvin Fitting on developing a generalized semantics for multivalued logic programming is extended here to arbitrary abstract logics. We present examples to show how our semantics is robust enough to be applicable to various non-classical logics like temporal …
Korean Character Recognition Using Neural Networks, Jinhwan Koh, G. S. Moon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Korean Character Recognition Using Neural Networks, Jinhwan Koh, G. S. Moon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
We present a neural-network approach for recognizing printed Korean characters. Our approach is based on a variant of the back-propagation algorithm. The results indicate that by transforming the character data into Hough space, we can achieve excellent recognition.
A Logic Grammar Foundation For Document Representation And Document Layout, Allen Brown Jr., Howard A. Blair
A Logic Grammar Foundation For Document Representation And Document Layout, Allen Brown Jr., Howard A. Blair
Electrical Engineering and Computer Science - Technical Reports
We present a powerful grammar-based paradigm for electronic document markup: coordinated definite clause translation grammars. This markup is of a declarative character, being, in effect, a collection of constraints on the logical and physical structure of documents. To the best of our knowledge, coordinated grammars and their parsers can accommodate all of the descriptive and layout processing functionality enjoyed by extant electronic markup languages. We describe an operational prototype that demonstrates the feasibility of a syntax-directed basis for formalizing and realizing document layout.
On Choosing An Optimally Trimmed Mean, Kishan Mehrotra, Paul Jackson, Anton Schick
On Choosing An Optimally Trimmed Mean, Kishan Mehrotra, Paul Jackson, Anton Schick
Electrical Engineering and Computer Science - Technical Reports
In this paper we revisit the problem of choosing an optimally trimmed mean. This problem was originally addressed by Jaeckel (1971). We propose alternatives to Jaeckel's estimator and its modifications discussed in Andrews et al. (1972). Jaeckel's procedure chooses the optimal trimming by minimizing an estimate of the asymptotic variance of the trimmed mean. We use the bootstrap procedure to choose the optimal trimming. A simulation study shows that our procedure compares favorably with Jaeckel's procedure. We also discuss modification of our procedure to the two sample setting.
A Lexical Extension Of Montague Semantics, William C. Purdy
A Lexical Extension Of Montague Semantics, William C. Purdy
Electrical Engineering and Computer Science - Technical Reports
This paper presents a model theory of lexical semantics that is compatible with theories in the Montagovian tradition. Lexical expressions are modeled as subsets or “subspaces” in a “semantic spaces”. A unique representation is defined for subspaces of the semantic space. This unique representation is called the "normal form" of the lexical denotation. A Boolean algebra of normal forms is developed, in which lexical entailment is Boolean inclusion. The presentation in the body of the paper is informal, making use of examples to illustrate the theory and to indicate the range of applicability. Formal definitions and proofs in support of …
A Neural Network Simulator For The Connnection Machine, N. Asokan, Ravi V. Shankar, Chilukuri K. Mohan, Kishan Mehrotra, Sanjay Ranka
A Neural Network Simulator For The Connnection Machine, N. Asokan, Ravi V. Shankar, Chilukuri K. Mohan, Kishan Mehrotra, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
In this paper we describe the design, development, and performance of a neural network simulator for the Connection Machine (CM)3. The design of the simulator is based on the Rochester Connectionist Simulator(RCS). RCS is a simulator for connectionist networks developed at the University of Rochester. The CM simulator can be used as a stand-alone system or as a high-performance parallel back-end to RCS. In the latter case, once the network has been built by RCS, the high-performance parallel back-end system constructs an equivalent network on the CM processor array and executes it. The CM simulator facilitates the exploitation of the …
Dynamic Range Partitioning In Multiprocessor Database Implementations, Ophir Frieder
Dynamic Range Partitioning In Multiprocessor Database Implementations, Ophir Frieder
Electrical Engineering and Computer Science - Technical Reports
Multiprocessor implementation of the relational database operators has recently received great attention in literature [1-4, 8, 11]. As the complexity of implementing the relational operators rests on the inter-node communication patterns involved in an operation, greater research attention has been focused on Join algorithms. The Join traffic patterns subsume those of the remaining relational operators. To effectively exploit parallelism in bucket based join implementations, the domain of the joining attributes must be partitioned into equal subranges. That is, the processing of each subrange requires roughly the same amount of time. A skewed distribution of workload significantly hinders performance. As relations …
Forecasting Sunspot Numbers Using Neural Networks, Ming Li, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Forecasting Sunspot Numbers Using Neural Networks, Ming Li, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
A recurrent connectionist network has been designed to model sunspot data. Preliminary experimental work shows that the network can produce competitive results as compared to traditional autoregressive models. The method is not problem specific and could be applied to other problems in dynamical system modeling, recognition, prediction, and control fields. It is observed that statistical methods can be used to design an appropriate neural network architecture.
Simplifications To "A New Approach To The Covering Radius...”, H. F. Mattson Jr
Simplifications To "A New Approach To The Covering Radius...”, H. F. Mattson Jr
Electrical Engineering and Computer Science - Technical Reports
We simplify the proofs of four results in [3], restating two of them for greater clarity. The main purpose of this note is to give a brief transparent proof of Theorem 7 of [3], the main upper bound of that paper. The secondary purpose is to give a more direct statement and proof of the integer programming determination of covering radius of [3]. Theorem 7 of [3] follows from a simple result in [2], which we state with the notation (for the linear code A).
Arrays And The Lambda Calculus, Klaus Berkling
Arrays And The Lambda Calculus, Klaus Berkling
Electrical Engineering and Computer Science - Technical Reports
Why do functional languages have more difficulties with arrays than procedural languages? The problems arising in the designing of functional languages with arrays and in their implementations are manifold. They can be classified according to 1) first principles, 2) semantics, 3) pragmatics, and 4) performance. This paper attempts to give an outline of the issues in this area, and their relation to the lambda calculus. The lambda calculus is a formal system and as such seemingly remote from practical applications. However, specific representations and implementations of that system may be utilized to realize arrays such that progress is made towards …
Optical Switching And Routing Architectures For Fiber-Optic Computer Communication Networks, Alok Choudhary, Salim Hariri, Wang Song, Partha Banerjee, Sanjay Ranka
Optical Switching And Routing Architectures For Fiber-Optic Computer Communication Networks, Alok Choudhary, Salim Hariri, Wang Song, Partha Banerjee, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
Optical technology has become a significant part of communication networks. We propose an Optical Interface Message Processor (OPTIMP) that exploits high-bandwidth, parallelism, multi-dimensional capability, and high storage density offered by optics. The most time consuming operations such as switching and routing in communication networks are performed in optical domain in the proposed system. Our design does not suffer from the optical/electrical conversion bottlenecks and can perform switching and routing in the range of Gigabits/s. The proposed design can have significant impact in high-speed communication networks as well as high-speed interconnection networks for parallel computers. The source-destination (S-D) information from a …
Strong Completeness Results For Paraconsistent Logic Programming, Howard A. Blair, V. S. Subrahmanian
Strong Completeness Results For Paraconsistent Logic Programming, Howard A. Blair, V. S. Subrahmanian
Electrical Engineering and Computer Science - Technical Reports
In [6], we introduced a means of allowing logic programs to contain negations in both the head and the body of a clause. Such programs were called generally Horn programs (GHPs, for short). The model-theoretic semantics of GHPs were defined in terms of four-valued Belnap lattices [5]. For a class of programs called well-behaved programs, an SLD-resolution like proof procedure was introduced. This procedure was proven (under certain restrictions) to be sound (for existential queries) and complete (for ground queries). In this paper, we remove the restriction that programs be well-behaved and extend our soundness and completeness results to apply …
A Proof For A Quickhull Algorithm, Jonathan Scott Greenfield,
A Proof For A Quickhull Algorithm, Jonathan Scott Greenfield,
Electrical Engineering and Computer Science - Technical Reports
The planar convex hull problem is fundamental to computational geometry and has many applications, including pattern recognition and image processing. QuickHull is a simple planar convex hull algorithm analogous to Hoare’s QuickSort [1]. This paper presents a pedagogical description and analysis of a QuickHull algorithm, along with a formal proof of correctness.