Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (7243)
- China Simulation Federation (3382)
- TÜBİTAK (3020)
- Selected Works (2644)
- Wright State University (2602)
-
- Purdue University (2057)
- Old Dominion University (1458)
- Missouri University of Science and Technology (1360)
- Edith Cowan University (1172)
- Air Force Institute of Technology (1108)
- University of Texas at El Paso (1094)
- Dartmouth College (1022)
- San Jose State University (995)
- University of Nebraska - Lincoln (979)
- Embry-Riddle Aeronautical University (853)
- City University of New York (CUNY) (819)
- Technological University Dublin (792)
- Washington University in St. Louis (785)
- Brigham Young University (759)
- California Polytechnic State University, San Luis Obispo (731)
- Kennesaw State University (714)
- University for Business and Technology in Kosovo (626)
- University of Texas at Arlington (614)
- Nova Southeastern University (535)
- Portland State University (529)
- Western University (524)
- SelectedWorks (522)
- New Jersey Institute of Technology (511)
- Syracuse University (501)
- University of Nebraska at Omaha (484)
- Keyword
-
- Machine learning (1335)
- Deep learning (799)
- Artificial intelligence (657)
- Machine Learning (650)
- Computer Science (638)
-
- Security (620)
- Computer science (435)
- Cybersecurity (410)
- Privacy (408)
- Simulation (378)
- Classification (367)
- Technical Reports (358)
- UTEP Computer Science Department (356)
- Data mining (349)
- Deep Learning (348)
- Algorithms (336)
- Optimization (335)
- Neural networks (307)
- Artificial Intelligence (299)
- Computer vision (291)
- Software engineering (254)
- College for Professional Studies (253)
- Education (253)
- Clustering (251)
- Cloud computing (244)
- Department of Computer Science and Engineering (243)
- Applied sciences (236)
- School of Computer & Information Science (236)
- Visualization (236)
- Natural language processing (231)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (6890)
- Journal of System Simulation (3382)
- Turkish Journal of Electrical Engineering and Computer Sciences (3020)
- Theses and Dissertations (2498)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Departmental Technical Reports (CS) (881)
- Master's Projects (845)
- Electronic Theses and Dissertations (735)
- Computer Science Faculty Publications (724)
- All Computer Science and Engineering Research (683)
- Computer Science Technical Reports (673)
- Computer Science Faculty Research & Creative Works (595)
- Faculty Publications (588)
- Kno.e.sis Publications (543)
- Journal of Digital Forensics, Security and Law (536)
- Computer Science Faculty Publications and Presentations (507)
- Dissertations (500)
- CCE Theses and Dissertations (488)
- All Works (478)
- Walden Dissertations and Doctoral Studies (467)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (463)
- Masters Theses (402)
- Computer Science and Engineering Theses (356)
- Theses (334)
- Electronic Thesis and Dissertation Repository (333)
- Computer Science and Software Engineering (332)
- USF Tampa Graduate Theses and Dissertations (320)
- Computer Science: Faculty Publications (316)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (315)
- Publication Type
Articles 55741 - 55770 of 57999
Full-Text Articles in Physical Sciences and Mathematics
Real-Tv : Rtp/L3'S Visual Monitor, Richard Czop
Real-Tv : Rtp/L3'S Visual Monitor, Richard Czop
Theses
Today many real-world activities are being monitored and controlled by some type of micro-processor based system. Emphasis is placed on manufacturing and controlling through the use of computers. The inherent nature of these real-world applications makes them difficult to control and monitor. They must be built meeting strict timing constraints and must be predictable. We need to develop simplistic, reliable, and cost effective methods for building, evaluating, monitoring and controlling these complex systems. These tools should provide the user with system insight. At the New Jersey Institute of Technology Real-Time Computing Laboratory, we are building a system that will provide …
A Heuristical Method Of Corner Points Detection On An Image Boundary, Qiulin Li
A Heuristical Method Of Corner Points Detection On An Image Boundary, Qiulin Li
Theses
A heuristics-based method of corner points detection on an image boundary is proposed and implemented. The method uses the sampled boundary distances to find all of the candidate corner points along the image boundary. Then the curvature characteristical value is used to measure the severity of curvature change of the candidate points. Those candidates whose curvature characteristical value is under some threshold are eliminated. The paper also proposed some mechanism to reduce the effect of noises on the boundary. Experiments show that it is an efficient method and it gives satisfactory results on some image boundaries.
A Machine Entity For A Coordinate Measurement Machine : The Generic Workcell Project, Richard C. Meyer
A Machine Entity For A Coordinate Measurement Machine : The Generic Workcell Project, Richard C. Meyer
Theses
The Center for Manufacturing Systems (CMS) department at New Jersey Institute of Technology and Siemens Corporate Research located in Princeton have agreed to jointly implement a research project in generic workcell control architectures. This paper discusses the module, called a Machine Entity, developed by the author that interfaces the Brown & Sharpe Coordinate Measurement Machine located on the CMS factory floor with the cell control software. The module has been designed in such a manner to simplify the development of future Machine Entities, thereby reducing the time required to integrate the CMS factory floor.
Enforceable Interdatabase Constraints In Combining Multiple Autonomous Databases, Aidong Zhang, Ahmed K. Elmagarmid
Enforceable Interdatabase Constraints In Combining Multiple Autonomous Databases, Aidong Zhang, Ahmed K. Elmagarmid
Department of Computer Science Technical Reports
No abstract provided.
Parallel Algorithms For Gray-Scale Digitized Picture Component Labeling On A Mesh-Connected Computer, Susanne E. Hambrusch, Xin He, Russ Miller
Parallel Algorithms For Gray-Scale Digitized Picture Component Labeling On A Mesh-Connected Computer, Susanne E. Hambrusch, Xin He, Russ Miller
Department of Computer Science Technical Reports
No abstract provided.
Parameterization In Finite Precision, Chanderjit L. Bajaj, Andrew V. Royappa
Parameterization In Finite Precision, Chanderjit L. Bajaj, Andrew V. Royappa
Department of Computer Science Technical Reports
No abstract provided.
Fundamental Solutions Of 9-Point Discrete Laplacians; Derivation And Tables, Robert E. Lynch
Fundamental Solutions Of 9-Point Discrete Laplacians; Derivation And Tables, Robert E. Lynch
Department of Computer Science Technical Reports
No abstract provided.
On Projections In Geometric Design, Christoph M. Hoffmann
On Projections In Geometric Design, Christoph M. Hoffmann
Department of Computer Science Technical Reports
No abstract provided.
Implicit Curves And Surfaces In Cagd, Christoph M. Hoffmann
Implicit Curves And Surfaces In Cagd, Christoph M. Hoffmann
Department of Computer Science Technical Reports
No abstract provided.
A Switch-Level Test Generation System, Kent L. Einspahr, Sharad C. Seth
A Switch-Level Test Generation System, Kent L. Einspahr, Sharad C. Seth
CSE Conference and Workshop Papers
This paper presents a switch-level test generation system for synchronous sequential circuits in which a new algorithm for switch-level test generation and an existing fault simulator are integrated. For test generation, a switch-level circuit is modeled as a logic network that correctly models all aspects of switch-level behavior. The time-frame based algorithm uses asynchronous processing within each clock phase to achieve stability in the circuit, and synchronous processing between clock phases to model the passage of time. Unlike earlier time-frame based test generators for general sequential circuits, the test generator presented uses the monotonicity of the logic network to speed …
Exploring The Symbolic/Subsymbolic Continuum: A Case Study Of Raam, Doug Blank, Lisa Meeden, James Marshall
Exploring The Symbolic/Subsymbolic Continuum: A Case Study Of Raam, Doug Blank, Lisa Meeden, James Marshall
Computer Science Faculty Research and Scholarship
No abstract provided.
Grounding Via Scanning: Cooking Up Roles From Scratch, Doug Blank, Michael Gasser
Grounding Via Scanning: Cooking Up Roles From Scratch, Doug Blank, Michael Gasser
Computer Science Faculty Research and Scholarship
No abstract provided.
The Complexity Of Software Testing, J. Paul Myers Jr.
The Complexity Of Software Testing, J. Paul Myers Jr.
Computer Science Faculty Research
The futility of using a general-purpose metric to characterise 'the' complexity of a program has been argued to support the design of specific metrics for the different stages of the software life-cycle. An analysis of the module testing activity is performed, providing evidence of the absurdity of all-purpose metrics, as well as a methodical means with which to measure testing complexity. Several standard metrics are seen to serve as component measures for the intricacies of testing. The methodology is applied to compare traditional and adaptive means of testing. It is shown that previous informal arguments asserting the superiority of adaptive …
Static And Runtime Algorithms For All-To-Many Personalized Communication On Permutation Networks, Sanjay Ranka, Jhy-Chun Wang, Geoffrey C. Fox
Static And Runtime Algorithms For All-To-Many Personalized Communication On Permutation Networks, Sanjay Ranka, Jhy-Chun Wang, Geoffrey C. Fox
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
With the advent of new routing methods, the distance to which a message is sent is becoming relatively less and less important. Thus, assuming no link contention, permutation seems to be an efficient collective communication primitive. In this paper we present several algorithms for decomposing all-to-many personalized communication into a set of disjoint partial permutations. We discuss several algorithms and study their effectiveness from the view of static scheduling as well as runtime scheduling. An approximate analysis shows that with n processors and assuming that every processor sends and receives d messages to random destinations, our algorithm can perform the …
Parti Primitives For Unstructured And Block Structured Problems, Alan Sussman, Joel Saltz, Raja Das, S. Gupta, Dimitri Mavriplis, Ravi Ponnusamy
Parti Primitives For Unstructured And Block Structured Problems, Alan Sussman, Joel Saltz, Raja Das, S. Gupta, Dimitri Mavriplis, Ravi Ponnusamy
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
This paper describes a set of primitives (PARTI) developed to efficiently execute unstructured and block structured problems on distributed memory parallel machines. We present experimental data from a 3-D unstructured Euler solver run on the Intel Touchstone Delta to demonstrate the usefulness of our methods.
The Expressiveness Of Locally Stratified Programs, Howard A. Blair, Wiktor Marek, John S. Schlipf
The Expressiveness Of Locally Stratified Programs, Howard A. Blair, Wiktor Marek, John S. Schlipf
Electrical Engineering and Computer Science - Technical Reports
This paper completes an investigation of the logical expressibility of finite, locally stratified, general logic programs. We show that every hyperarithmetic set can be computed by a suitably chosen locally stratified logic program (as a set of values of a predicate over its perfect model). This is an optimal result, since the perfect model of a locally stratified program is itself an implicitly definable hyperarithmetic set (under a recursive coding of the Herbrand base); hence to obtain all hyperarithmetic sets requires something new, in this case selecting one predicate from the model. We find that the expressive power of programs …
Benchmarking The Cm-5 For Image Processing Applications, Ravi V. Shankar, Ravi Ponnusamy, Sanjay Ranka
Benchmarking The Cm-5 For Image Processing Applications, Ravi V. Shankar, Ravi Ponnusamy, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper presents benchmarking results for image processing algorithms on the Connection Machine model CM-5 and compares them with the results from the CM-2 and the Sun-4. Image processing algorithms with varying communication and computational requirements were implemented, tested and timed. The performance and the scalabilty of the CM-5 were analyzed and compared with that of the CM-2.
Software Support For Irregular And Loosely Synchronous Problems, Alok Choudhary, Geoffrey C. Fox, Sanjay Ranka, Seema Hiranandani
Software Support For Irregular And Loosely Synchronous Problems, Alok Choudhary, Geoffrey C. Fox, Sanjay Ranka, Seema Hiranandani
Electrical Engineering and Computer Science - All Scholarship
A large class of scientific and engineering applications may be classified as irregular and loosely synchronous from the perspective of parallel processing. We present a partial classification of such problems. This classification has motivated us to enhance Fortran D to provide language support for irregular, loosely synchronous problems. We present techniques for parallelization of such problems in the context of Fortran D.
Flattening C++ Classes, Umesh Bellur, Al Villarica, Kevin Shank, Imram Bashir, Doug Lea
Flattening C++ Classes, Umesh Bellur, Al Villarica, Kevin Shank, Imram Bashir, Doug Lea
Center for Advanced Systems and Engineering
Inheritance with derived classes and virtual functions are key design concepts in C++. Despite this, their use can result in significant degradation of run time performance. We present a class flattening tool, which we believe will help eliminate the overhead associated with virtual functions in C++ programs. A flattener may also prove useful in the reuse, debugging, and understanding of C++ components. This report deals with the issues associated with flattening, and then presents a detailed design of such a tool.
On The De Bruijn Torus Problem, Glenn Hurlbert, Garth Isaak
On The De Bruijn Torus Problem, Glenn Hurlbert, Garth Isaak
Computer Science Technical Reports
A (kn;n)k-de Bruijn Cycle is a cyclic k-ary sequence with the property that every k-ary n-tuple appears exactly once contiguously on the cycle. A (kr, ks; m, n)k-de Bruijn Torus is a k-ary krXks toroidal array with the property that every k-ary m x n matrix appears exactly once contiguously on the torus. As is the case with de Bruijn cycles, the 2-dimensional version has many interesting applications, from coding and communications to pseudo-random arrays, spectral imaging, and robot self-location. J.C. Cock proved the existence of such tori for all m, n, and k, and Chung, Diaconis, and Graham asked …
Concurrent Local Search For Fast Proximity Algorithms On Parallel And Vector Architectures, Peter Su
Concurrent Local Search For Fast Proximity Algorithms On Parallel And Vector Architectures, Peter Su
Computer Science Technical Reports
This paper presents a fast algorithm for solving the all-nearest-neighbors problem. The algorithm uses a data parallel style of programming which can be efficiently utilized on a variety of parallel and vector architectures [4,21,26]. I have implemented the algorithm in C on one such architecture, the Cray Y-MP. On one Cray CPU, the implementation is about 19 times faster than a fast sequential algorithm running on a Sparc workstation. The main idea in the algorithm is to divide the plane up into a fixed grid of cells, or buckets. When the points are well distributed, the algorithm processes each query …
A Universal Method Of Scientific Inquiry, Daniel N. Osherson, Michael Stob, Scott Weinstein
A Universal Method Of Scientific Inquiry, Daniel N. Osherson, Michael Stob, Scott Weinstein
University Faculty Publications and Creative Works
A paradigm of scientific discovery is defined within a first-order logical framework. Within this paradigm, the concept of “successful scientific inquiry” is formalized and investigated. Among other results, it is shown that a simple method of scientific inquiry is universal in the sense that it leads to success on every problem for which success is in principle possible.
Energy-Related Feature Abstraction For Handwritten Digit Recognition, Thomas H. Fuller Jr.
Energy-Related Feature Abstraction For Handwritten Digit Recognition, Thomas H. Fuller Jr.
All Computer Science and Engineering Research
Most handwritten character recognizers use either graphical (static) or first-order dynamic data. Our research speculates that the mental signal to write a digit might be partially encoded as an energy profile. We used artificial neural networks (ANN) to analyze energy-related features (first and second time derivatives) of handwritten digits of 20 subjects and later 40 subjects. An experimenal environment was developed on a NeXTstation with a real-time link to a pen-based GO computer. Although such an experiment cannot confirm an energy profile encoded in the writer, it did indicate the usefulness of energy-related features by recognizing 94.5% of the 600 …
Dynatapp Dynamic Timing Analysis With Partial Path Activation In Sequential Circuits, Prathima Agrawal, Vishwani Agrawal, Sharad C. Seth
Dynatapp Dynamic Timing Analysis With Partial Path Activation In Sequential Circuits, Prathima Agrawal, Vishwani Agrawal, Sharad C. Seth
CSE Conference and Workshop Papers
This paper gives a method of finding all sensitizable paths in a non-scan synchronous sequential circuit. Path activation conditions of the circuit are mapped onto a single stuck type fault by adding a few modeling gates to the netlist. Only if the corresponding stuck type fault is found detectable by a sequential circuit test generator is the path considered sensitizable. A depth-first analysis of circuit topology, that determines all paths between primary inputs, primary outputs and flip-flops, employs a partial path hierarchy. Thus, all paths with a common unsensitizable segment need not be examined separately. Results on benchmark circuits show …
Executing Multidatabase Transactions, Mansoor Ansari, Marek Rusinkiewicz, Linda Ness, Amit P. Sheth
Executing Multidatabase Transactions, Mansoor Ansari, Marek Rusinkiewicz, Linda Ness, Amit P. Sheth
Kno.e.sis Publications
In a multidatabase environment, the traditional transaction model has been found to be too restrictive. Therefore, several extended transaction models have been proposed in which some of the requirements of transaction, such as isolation or atomicity, are optional. The authors describe one of such extensions, the flexible transaction model and discuss the scheduling of transactions involving multiple autonomous database systems managed by heterogeneous DBMS.
The scheduling algorithm for flexible transactions is implemented using L.0, a logically parallel language which provides a framework for concisely specifying the multidatabase transactions and for scheduling them. The key aspects of a flexible transaction specification, …
Experimentation With Proof Methods For Non-Horn Sets, Christopher J. Merz, Ralph W. Wilkerson
Experimentation With Proof Methods For Non-Horn Sets, Christopher J. Merz, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
Two Resolution Proof Strategies Developed by Peterson Are Implemented by Modifying Otter, an Existing Automated Theorem Prover. the Methods, Lock-T Refutation and LNL-T Refutation, Are Generalizations of Unit Refutation and Input Resolution, Respectively, to Non-Horn Sets and Represent Independent, Equivalent but Opposite Ways of Searching. the Algorithms Used Are based on a Corrected Version of the Foundational Work. the Strategies Have Been Tested on Various Non-Horn Challenge Problems from the Tarskian Geometry and the Non-Obvious Problem, with the Results Being in Some Cases Quite Favorable When Compared to Other Resolution Techniques.
Formation Of Clusters And Resolution Of Ordinal Attributes In Id3 Classification Trees, Chaman Sabharwal, Keith R. Hacke, Daniel C. St. Clair
Formation Of Clusters And Resolution Of Ordinal Attributes In Id3 Classification Trees, Chaman Sabharwal, Keith R. Hacke, Daniel C. St. Clair
Computer Science Faculty Research & Creative Works
Many learning systems have been designed to construct classification trees from a set of training examples. One of the most widely used approaches for constructing decision trees is the ID3 algorithm [Quinlan 1986]. Decision trees are ill-suited to handle attributes with ordinal values. Problems arise when a node representing an ordinal attribute has a branch for each value of the ordinal attribute in the training set. This is generally infeasible when the set of ordinal values is very large. Past approaches have sought to cluster large sets of ordinal values before the classification tree is constructed [Quinlan 1986; Lebowitz 1985; …
Proving Functionally Difficult Problems Through Model Generation, Richard Rankin, Ralph W. Wilkerson
Proving Functionally Difficult Problems Through Model Generation, Richard Rankin, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
Satchmo [MA88] is a Theorem Prover Implemented in Prolog Which Attempts to Provide Satisfiability Checking through Model Generation. This Paper Gives a Brief Introduction to SATCHMO and Reports Extensions to the Original Work Which Allow SATCHMO to Solve Problems Previously Considered to Be Finitely Unprovable within the SATCHMO System. the Specific Problems Are from [PE86, MO85, LU85] and Were Designed to Convert Simple Propositional Logic Problems into Functionally Difficult First Order Problems. Although the Benefits of using the SATCHMO System Are Many, the Fact that It Could Not Offer Proofs for a Set of Problems Provable in Other Systems is …
Composite Stock Cutting Through Simulated Annealing, Hanan Lutfiyya, Bruce M. Mcmillin, Pipatpong Poshyanonda, Cihan H. Dagli
Composite Stock Cutting Through Simulated Annealing, Hanan Lutfiyya, Bruce M. Mcmillin, Pipatpong Poshyanonda, Cihan H. Dagli
Computer Science Faculty Research & Creative Works
This paper explores the use of Simulated Annealing as an optimization technique for the problem of Composite Material Stock Cutting. The shapes are not constrained to be convex polygons or even regular shapes. However, due to the composite nature of the material, the orientation of the shapes on the stock is restricted. For placements of various shapes, we show how to determine a cost function, annealing parameters and performance. © 1992.
Semi-Supervised Adaptive Resonance Theory (Smart2), Christopher J. Merz, William E. Bond, Daniel C. St. Clair
Semi-Supervised Adaptive Resonance Theory (Smart2), Christopher J. Merz, William E. Bond, Daniel C. St. Clair
Computer Science Faculty Research & Creative Works
Adaptive resonance theory (ART) algorithms represent a class of neural network architectures which self-organize stable recognition categories in response to arbitrary sequences of input patterns. The authors discuss incorporation of supervision into one of these architectures, ART2. Results of numerical experiments indicate that this new semi-supervised version of ART2 (SMART2) outperformed ART for classification problems. The results and analysis of runs on several data sets by SMART2, ART2, and backpropagation are analyzed. The test accuracy of SMART2 was similar to that of backpropagation. However, SMART2 network structures are easier to interpret than the corresponding structures produced by backpropagation.