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 (1105)
- 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 (732)
- 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 (525)
- SelectedWorks (522)
- New Jersey Institute of Technology (511)
- Syracuse University (501)
- University of Nebraska at Omaha (485)
- Keyword
-
- Machine learning (1337)
- Deep learning (800)
- Artificial intelligence (659)
- Machine Learning (651)
- Computer Science (638)
-
- Security (620)
- Computer science (436)
- Cybersecurity (410)
- Privacy (408)
- Simulation (379)
- Technical Reports (369)
- Classification (367)
- UTEP Computer Science Department (367)
- Data mining (349)
- Deep Learning (349)
- Algorithms (337)
- Optimization (336)
- 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) (892)
- Master's Projects (845)
- Electronic Theses and Dissertations (738)
- Computer Science Faculty Publications (725)
- 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 (468)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (463)
- Masters Theses (402)
- Computer Science and Engineering Theses (356)
- Electronic Thesis and Dissertation Repository (334)
- Theses (334)
- 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 54991 - 55020 of 58034
Full-Text Articles in Physical Sciences and Mathematics
Sbl- The Structural Biology Language, Marius A. Cornea-Hasegan, Dan C. Marinescu
Sbl- The Structural Biology Language, Marius A. Cornea-Hasegan, Dan C. Marinescu
Department of Computer Science Technical Reports
No abstract provided.
Simple Genetic Algorithms With Linear Fitness, Michael D. Vose, Alden H. Wright
Simple Genetic Algorithms With Linear Fitness, Michael D. Vose, Alden H. Wright
Computer Science Faculty Publications
A general form of stochastic search is described (random heuristic search), and some of its general properties are proved. This provides a framework in which the simple genetic algorithm (SGA) is a special case. The framework is used to illuminate relationships between seemingly different probabilistic perspectives of SGA behavior. Next, the SGA is formalized as an instance of random heuristic search. The formalization then used to show expected population fitness is a Lyapunov function in the infinite population model when mutation is zero and fitness is linear. In particular, the infinite population algorithm must converge, and average population …
On The Noninterpolation Of Polyhedral Maps, Adrian Riskin, D.W. Barnette
On The Noninterpolation Of Polyhedral Maps, Adrian Riskin, D.W. Barnette
Mathematics
In this paper we show that if attention is restricted to polyhedral embeddings of graphs, no theorem analogous to the Duke interpolation theorem for 2-cell embeddings is true. We also give two interesting classes of graphs: (i) a class in which the members have polyhedral embeddings in the torus and also in orientable manifolds of arbitrarily high genus, (ii) and another in which the members have polyhedral embeddings in the projective plane and also in orientable and nonorientable manifolds of arbitrarily low Euler characteristic.
Learning And Teaching Of Boolean And Geometric Classes, H. David Mathias
Learning And Teaching Of Boolean And Geometric Classes, H. David Mathias
All Computer Science and Engineering Research
We consider the concept classes of DNF formulas and unions of discretized, axis-parallel d-dimensional boxes in discretized d-dimensional space with respect to several different learning models. In the model of learning with queries we present an algorithm to learn unions of boxes. We introduce a model of teaching that prevents illicit communication between the teacher and the leaner but that captures the intuitive aspect of teaching: a learner should perform at least as well with a cooperative teacher as with an adversarial teacher. We propose the study of teaching of DNF formulas and unions of boxes in this model. We …
Pipelined And Superscalar Architectures In Clocked And Asynchronous Environments, Mark A. Franklin, Tienyo Pan
Pipelined And Superscalar Architectures In Clocked And Asynchronous Environments, Mark A. Franklin, Tienyo Pan
All Computer Science and Engineering Research
In this paper, a set of simple, general, yet practical performance models for RISC architectures are developed. These models apply to a wide range of systems that include both pipelined and superscalar systems operating in either clocked or asynchronous environments. The models permit quantitative evaluation of various design choices (e.g., the number of pipelines in the system, the pipeline depth, and the choice between clocked and asynchronous methodologies) as functions of technology parameters, environmental operating parameters, and pipeline function characteristics. Design curves are presented indicating optimal pipeline depth and number of pipelines to employ under various conditions.
Smooth Low Degree Approximations Of Polyhedra, Chandrajit L. Bajaj, Jindon Chen, Guoliang Xu
Smooth Low Degree Approximations Of Polyhedra, Chandrajit L. Bajaj, Jindon Chen, Guoliang Xu
Department of Computer Science Technical Reports
No abstract provided.
On The Three Diumensionality Of Motion Correspondence, Anupam Joshi, Zygmunt Pizlo
On The Three Diumensionality Of Motion Correspondence, Anupam Joshi, Zygmunt Pizlo
Department of Computer Science Technical Reports
No abstract provided.
Visual Specification Of Interprocess And Intraprocess Communication, T. Paul Mccartney, Kenneth J. Goldman
Visual Specification Of Interprocess And Intraprocess Communication, T. Paul Mccartney, Kenneth J. Goldman
All Computer Science and Engineering Research
We present a visual specification language for constructing distributed applications and their direct manipulation graphical user interfaces. Each distributed application consists of a collection of independent modules and a configuration of logical connections that define communication among the data interfaces of the modules. Our specification language uses a single visual mechanism that allows end-users to define interprocess communication among distributed modules and to define intraprocess communication among objects within a module. This seamless specification provides a general encapsulation/abstraction mechanism and is designed to support dynamic change to the communication structure. User interfaces are completely decoupled from the module(s) they control.
Congestion Control In Atm Networks, Apostolos Dailianas, Andreas Bovopoulos
Congestion Control In Atm Networks, Apostolos Dailianas, Andreas Bovopoulos
All Computer Science and Engineering Research
No abstract provided.
Rationales And Argument Moves, R. P. Loui, Jeff Norman
Rationales And Argument Moves, R. P. Loui, Jeff Norman
All Computer Science and Engineering Research
No abstract provided.
Exact Learning Of Discretized Geometric Concepts, Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
Exact Learning Of Discretized Geometric Concepts, Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
All Computer Science and Engineering Research
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the unioin of m axis-parallel boxes in d-dimensional discretized Euclidean space where each coordinate can have n discrete values. This algorithm receives at most md counterexamples and uses time and membership queries polynomial in m and log(n) for any constant d. Furthermore, all equivalence queries can be formulated as the union of O(mdlog(m)) axis-parallel boxes. Next, we show how to extend our algorithm to efficiently learn, from only equivalence queries, any discretized geometric concept generated from any number of halfspaces …
Learning From A Consistently Ignorant Teacher, Michael Frazier, Sally Goldman, Nina Mishra, Leonard Pitt
Learning From A Consistently Ignorant Teacher, Michael Frazier, Sally Goldman, Nina Mishra, Leonard Pitt
All Computer Science and Engineering Research
One view of computational learning theory is that of a learner acquiring the knowledge of a teacher. We introduce a formal model of learning capturing the idea that teachers may have gaps in their knowledge. The goal of the learner is still to acquire the knowledge of the teacher, but now the learner must also identify the gaps. This is the notion of learning from a consistently ignorant teacher. We consider the impact of knowledge gaps on learning, for example, monoton DNF and d-dimensional boxes, and show that leraning is still possible. Negatively, we show that knowledge gaps make learning …
Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn
Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn
All Computer Science and Engineering Research
The Washington University MultiMedia eXplorer (MMX) is a complete, host-independent multimedia system capable of transmitting and receiving JPEG-compressed video, CD-quality audio, and high-resolution radiographic images over the Washington University broadband ATM network. If the host is equipped with an ATM interface card, normal network traffic can be supported via an ATM extension port on the MMX. The major components of the MMX are an ATMizer and three multimedia channels. The ATMizer implements the host interface, the interface to the ATM network, and hte interface to the three multimdeia channels. This paper describes the architecture of the MMX, the software used …
An Evaluation Of The Pavane Visualization System, Kenneth C. Cox, Gruia-Catalin Roman
An Evaluation Of The Pavane Visualization System, Kenneth C. Cox, Gruia-Catalin Roman
All Computer Science and Engineering Research
The Pavane program visualization system is an implementation of the declarative paradigm of visualization. After a brief report on the status of the Pavane implementation, we present the results of an evaluation of the usability of Pavane. This evaluation is based on the use of Pavane by its developers to construct program visualizations, on its use in a classroom setting as a tool for examining executing programs, and on its application to some simple scientific visualizations.
Design Of A Large Scale Multimedia Server, Milind M. Buddhikot, Guru Parulkar, Jerome R. Cox Jr.
Design Of A Large Scale Multimedia Server, Milind M. Buddhikot, Guru Parulkar, Jerome R. Cox Jr.
All Computer Science and Engineering Research
Large scale multimedia storage servers will be an integral part of the emerging distributed multimedia computing infrastructure. However, given the modest rate of improvements in storage transfer rates, designing servers that meet the demands of multimedia applications is a challenging task that needs significant architectural innovation. Our research project, called Massively-parallel And Real-time Storage (MARS) architecture, is aimed at the design and prototype implementation of a large scale multimedia storage server. It uses some of the well-known techniques in parallel I/O, such as data striping and Redundant Arrays of Inexpensive Disks (RAID) and an innovative ATM based interconnect inside the …
Universal Continuous Media I/O: Design And Implementation, Charles D. Cranor, Gurudatta M. Parulkar
Universal Continuous Media I/O: Design And Implementation, Charles D. Cranor, Gurudatta M. Parulkar
All Computer Science and Engineering Research
The problem this paper addresses is how to modify an existing operating system's I/O subsystem to support new high-speed networks and high-bandwidth multimedia applications that will play an important role in future computing environments. The proposed I/O subsystem is called universal continuous media I/O (UCM I/O). This paper will cover the preliminary design of UCM I/O, some of the trade-offs and issues that need to be addressed in order to implement UCM I/O, and a summary of work in progress.
Visualizing Electrostatic Phenomena Using Mathematica, Eric Mayes
Visualizing Electrostatic Phenomena Using Mathematica, Eric Mayes
Journal of the Arkansas Academy of Science
A set of packages for visualizing electrostatic phenomena was developed using Mathematica as a programming language. These packages allow users to plot potential fields, equipotential lines, 2-D and 3-D vector fields in order to gain a visual understanding of electrostatic charges. They would be useful in accompanying undergraduate physics labs pertaining to electrostatics, as they would enable students to connect experiment with mathematics through open-ended visual exploration
A Fuzzy Logic-Based Foundation For Analyzing Imprecise Conflicting Requirements, J. Yen, Xiaoqing Frank Liu
A Fuzzy Logic-Based Foundation For Analyzing Imprecise Conflicting Requirements, J. Yen, Xiaoqing Frank Liu
Computer Science Faculty Research & Creative Works
Imprecise requirements are represented by the canonical form in test-score semantics. The concepts of feasibility, satisfiability, and specificity are formalized based on the fuzzy sets. The relationships between requirements are classified to be conflicting and cooperative. A feasible overall requirement can thus be formulated based on the tradeoff analysis of the conflicting requirements by using fuzzy multi-criteria optimization technique
Managing Risks In Information Technology Projects, Boon Siong Neo, Kwong Sin Leong
Managing Risks In Information Technology Projects, Boon Siong Neo, Kwong Sin Leong
Research Collection School Of Accountancy
The development and implementation of IT (Information Technology) projects are plagued with problems of cost and time overruns. technical inadequacy, inability to meet user requirements. lack of utilization. and failure to achieve anticipated benefits. These problems occur to some projects and not to others because I) IT projects have different profiles of risk. and 2) IT project risks have been managed more or less effectively. This paper synthesizes the literature into four classes of risks. and applies it to evaluate TradeNet. an EDLbased trading system implemented in Singapore in I989. Through a case study of TradeNet. we derived a typology …
Parameter Tuning For The Max Expert System, Christopher J. Merz, M. J. Pazzani
Parameter Tuning For The Max Expert System, Christopher J. Merz, M. J. Pazzani
Computer Science Faculty Research & Creative Works
We investigate methods for tuning numeric parameters in Nynex MAX, a telephone trouble screening expert system. Steepest descent, hillclimbing, and simulated annealing parameter adjustment strategies are applied to the problems of maximizing classification accuracy and minimizing misclassification cost. For both of those optimization problems we evaluate each algorithm''s ability to tune initial parameters for several situations
Relationship Between Information System Project Characteristics And Project Management Activities: An Empirical Investigation, Vijay V. Raghavan, Deepak Khazanchi, Joyce L. Webster
Relationship Between Information System Project Characteristics And Project Management Activities: An Empirical Investigation, Vijay V. Raghavan, Deepak Khazanchi, Joyce L. Webster
Information Systems and Quantitative Analysis Faculty Publications
The activities of a project manager in overseeing the development of a software system are many and varied. Not all such activities are performed in managing every project. If so, a natural ensuing question is whether project managers adapt their managerial functions to the projects being managed. Prior research suggests that they do adapt, and that project characteristics may be the factors determining this adaptation. This assertion is investigated by considering three characteristics of a project (size, type, and environment) and investigating their association with four traditionally recognized management functions (planning, organizing, controlling, and motivating). Results indicate that project managers …
An ‘Events’ Model For Information Aggregation, Douglas Havelka, Deepak Khazanchi
An ‘Events’ Model For Information Aggregation, Douglas Havelka, Deepak Khazanchi
Information Systems and Quantitative Analysis Faculty Publications
Aggregation is one of the key characteristics of information delivered by "information systems." It is important because the ability to design effective support systems depends to a great extent upon the degree of flexibility with regards to information aggregation that can be incorporated in the system. This paper sets forth a conceptual model of information aggregation based on the events theory of accounting. The model suggests that aggregation should be considered as a two-dimensional concept, comprising a temporal and sectional dimension. The two axes are further delineated in the form of "levels of summation" based on specified "events" of aggregation. …
Linear Codes And Error-Correction, Karen Brown
Linear Codes And Error-Correction, Karen Brown
Presidential Scholars Theses (1990 – 2006)
The process of encoding information for transmission from one source to another is a vital process in many areas of science and technology. Whenever coded information is sent, there arises a certain possibility that an error will occur, either during transmission or in decoding. Therefore, it is imperative to develop methods to detect and correct errors in a code. The study of coding theory is a "new" area of mathematics which is relatively undeveloped.
This paper focuses on the properties of linear codes -and their corresponding methods of error-correction. To simplify the issue, only binary block codes are studied; hence …
Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise, Paul W. Goldberg, Sally A. Goldman
Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise, Paul W. Goldberg, Sally A. Goldman
All Computer Science and Engineering Research
Developing the ability to recognize a landmark from a visual image of a robot's current location is a fundamental problem in robotics. We consider the problem of PAC-learning the concept class of geometric patterns where the target geometric pattern is a configuration of k points on the real line. Each instance is a configuration of n points on the real line, where it is labeled according to whether or not it visually resembles the target pattern. To capture the notion of visual resemblance we use the Hausdorff metric. Informally, two geometric patterns P and Q resemble each othe runder the …
Trading Packet Headers For Packet Processing, George Varghese
Trading Packet Headers For Packet Processing, George Varghese
All Computer Science and Engineering Research
In high speed networks, packet processing is relatively expensive while bandwidth is cheap. This begs the question: what fields can be added to packets to make packet processing easier? By exploring this question, we device a number of novel mechanisms to speed up packet processing. With the advent of new standards for hte Data Link, Network, and Transport lyaers, we believe there is an opportunity to apply these techniques to improve the performance of real protocols. First, we suggest adding a data manipulation header to an easily accessible portion of each packet. This header contains pointers to fields (in various …
Cell Tracking Using A Distributed Algorithm For 3d Image Segmentation, Vikas Awasthi, Keith W. Doolittle, Guru Parulkar, James G. Mcnally
Cell Tracking Using A Distributed Algorithm For 3d Image Segmentation, Vikas Awasthi, Keith W. Doolittle, Guru Parulkar, James G. Mcnally
All Computer Science and Engineering Research
We have developed and tested an automated method for simultaneous 3D tracking of numerous, flourescently-tagged cells. The procedure uses multiple thresholding to segment individual cells at a starting timepoint, and then iteratively applies a template-matching algorithm to locate a particular cell's position at subsequent time points. To speed up the method, we have developed a distributed implementation in which template matching is carried out in parallel on several different server machines. The distributed implementation showed a monotonic decrease in response time with increasing number of servers (up to 15 tested), demonstrating that the tracking algorithm is well suited to parallelization, …
Efficient Quality Of Service Support In Multimedia Computer Operating Systems, Raman Gopalakrishna, Guru M. Parulkar
Efficient Quality Of Service Support In Multimedia Computer Operating Systems, Raman Gopalakrishna, Guru M. Parulkar
All Computer Science and Engineering Research
This report describes our approach towards providing quality of service (QoS) guarantees for network communication within the endsystems to support multimedia applications. We first address the problem of QoS specification by identifying a set of application classes and their QoS parameters that cover the communication requirements of most applications. We then describe the QoS mapping problem, and show how requirements for resources (such as the CPU, the network interface adaptor and network connections) can be automatically derived from the application QoS parameters. We then deal with the QoS enforcement issue in which we describe techniques for scheduling protocol processing threads …
High-Performance Training Of Feedforward & Simple Recurrent Networks, Barry L. Kalman, Stan C. Kwasny
High-Performance Training Of Feedforward & Simple Recurrent Networks, Barry L. Kalman, Stan C. Kwasny
All Computer Science and Engineering Research
TRAINREC is a system for training feedforward and recurrent neural networks that incorporates several ideas. It uses the conjugate-gradient method which is demonstrably more efficient than traditional backward error propagation. We assume epoch-based training and derive a new error function having several desirable properties absent from the traditional sum-of-squared-error function. We argue for skip (shortcut) connections where appropriate and the preference for a sigmoidal yielding values over the [-1,1] interval. The input feature space is often over-analyzed, but by using singular value decomposition, input patterns can be conditioned for better learning often with a reduced number of input units. Recurrent …
Reasoning About Places, Times, And Actions In The Presence Of Mobility, C. Donald Wilcox, Gruia-Catalin Roman
Reasoning About Places, Times, And Actions In The Presence Of Mobility, C. Donald Wilcox, Gruia-Catalin Roman
All Computer Science and Engineering Research
The current trend toward portable computing systems (e.g., cellular phones, laptop computers) brings with it the need for a new paradigm for thinking about designing distributed applications. We introduce the term mobile to refer to distributed systems that include moving, autonomous agents which loosely cooperate to accomplish a tastk. The fluid nature of hte interconnections between components in a mobile system provides new challenges and new opportunities for the research community. While we do not propsoe to have fully grasped the consequences of these systems, we believe that the notions of place, time, and action will be central in any …
Boxgraph: A Two-Dimensional Visual Computation Model, Takayuki Dan Kimura, Timothy B. Brown
Boxgraph: A Two-Dimensional Visual Computation Model, Takayuki Dan Kimura, Timothy B. Brown
All Computer Science and Engineering Research
Traditional computation models such as Turing machines, lambda-calculus, Markov's normal algorithms, are not suitable models for visual programming languages because they are all based on one-dimensional text strings and visual programming uses two-dimensional graphic diagrams. We propose a two-dimensional computation model, called Boxgraph, that requires no text. The syntax of the model consists of nested boxes connected by arrows, and the semantics consists of dataflow and the concept of consistency. The expressive power of the model is demonstrated by constructing representations of a binary full adder, the Fibonacci function, and the GCD function. The model, with a small extension to …