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 (57)
- TÜBİTAK (33)
- Dartmouth College (31)
- Wright State University (31)
- Purdue University (30)
-
- Selected Works (25)
- Brigham Young University (22)
- Air Force Institute of Technology (20)
- City University of New York (CUNY) (20)
- California Polytechnic State University, San Luis Obispo (19)
- University of Nebraska - Lincoln (17)
- University of Massachusetts Amherst (16)
- Old Dominion University (14)
- Portland State University (12)
- New Jersey Institute of Technology (11)
- Edith Cowan University (9)
- Missouri University of Science and Technology (9)
- Syracuse University (9)
- Nova Southeastern University (8)
- Smith College (8)
- Louisiana State University (7)
- Technological University Dublin (6)
- The University of Maine (6)
- University of Massachusetts - Amherst (6)
- University of Nevada, Las Vegas (6)
- William & Mary (6)
- California State University, San Bernardino (5)
- University of Nebraska at Omaha (5)
- University of New Hampshire (5)
- East Tennessee State University (4)
- Keyword
-
- Computer Science (9)
- College of Engineering and Computer Science (8)
- Engineering (8)
- Newsletters (8)
- Science news (8)
-
- Technical writing (8)
- Mobile computing (7)
- Data mining (6)
- Digital libraries (5)
- [RSTDPub] (5)
- Genetic algorithms (4)
- Geographic information systems (4)
- Information retrieval (4)
- Information visualization (4)
- Multicast (4)
- Security (4)
- Software engineering (4)
- Alpha-bearing wastes; Argonne Model for Universal Solvent Extraction (AMUSE); Computer programming; Separation (Technology); Software engineering; System analysis; Systems engineering; Transuranium elements – Separation; Uranium Recovery by Extraction (UREX) (3)
- Bluetooth (3)
- Computer networks (3)
- Computer simulation (3)
- Electronic data processing -- Distributed processing (3)
- FDTD (3)
- Information storage and retrieval systems (3)
- Metadata (3)
- Middleware (3)
- Neural networks (3)
- Predictable assembly (3)
- Privacy (3)
- Routing (3)
- Publication
-
- Research Collection School Of Computing and Information Systems (57)
- Computer Science Technical Reports (37)
- Turkish Journal of Electrical Engineering and Computer Sciences (33)
- Department of Computer Science Technical Reports (30)
- Theses and Dissertations (25)
-
- Faculty Publications (21)
- Kno.e.sis Publications (17)
- Computer Science Department Faculty Publication Series (16)
- Computer Science and Software Engineering (11)
- Theses (11)
- Electronic Theses and Dissertations (9)
- Philip L Frana (9)
- BITs and PCs Newsletter (8)
- CSE Conference and Workshop Papers (8)
- Collaborative Agent Design (CAD) Research Center (8)
- Computer Science Faculty Publications (8)
- Computer Science Faculty Publications and Presentations (8)
- Computer Science: Faculty Publications (8)
- Electrical Engineering and Computer Science - All Scholarship (8)
- CCE Theses and Dissertations (7)
- CSE Technical Reports (7)
- Dartmouth Scholarship (7)
- R. Manmatha (7)
- Research outputs pre 2011 (7)
- Computer Science and Engineering Faculty Publications (6)
- Dissertations, Theses, and Masters Projects (6)
- Masters Theses (6)
- Separations Campaign (TRP) (6)
- Center for Coastal and Ocean Mapping (5)
- Computer Science Faculty Research & Creative Works (5)
- Publication Type
- File Type
Articles 1 - 30 of 524
Full-Text Articles in Physical Sciences and Mathematics
A Fast Connection-Time Redirection Mechanism For Internet Application Scalability, Michael Haungs, Raju Pandey, Earl Barr, J. Fritz Barnes
A Fast Connection-Time Redirection Mechanism For Internet Application Scalability, Michael Haungs, Raju Pandey, Earl Barr, J. Fritz Barnes
Computer Science and Software Engineering
Applications that are distributed, fault tolerant, or perform dynamic load balancing rely on redirection techniques, such as network address translation (NAT), DNS request routing, or middleware to handle Internet scale loads. In this paper, we describe a new connection redirection mechanism that allows applications to change end-points of communication channels. The mechanism supports redirections across LANs and WANs and is application-independent. Further, it does not introduce any central bottlenecks. We have implemented the redirection mechanism using a novel end-point control session layer. The performance results show that the overhead of the mechanism is minimal. Further, Internet applications built using this …
Level Oriented Formal Model For Asynchronous Circuit Verification And Its Efficient Analysis Method, Eric G. Mercer, Tomoya Kitai, Chris Myers, Yusuke Oguro, Tomohiro Yoneda
Level Oriented Formal Model For Asynchronous Circuit Verification And Its Efficient Analysis Method, Eric G. Mercer, Tomoya Kitai, Chris Myers, Yusuke Oguro, Tomohiro Yoneda
Faculty Publications
Using a level-oriented model for verification of asynchronous circuits helps users to easily construct formal models with high readability or to naturally model datapath circuits. On the other hand, in order to use such a model on large circuits, techniques to avoid the state explosion problem must be developed. This paper first introduces a level-oriented formal model based on time Petri nets, and then proposes its partial order reduction algorithm that prunes unnecessary state generation while guaranteeing the correctness of the verification.
Implications Of Mbti In Software Engineering Education, Luiz Fernando Capretz
Implications Of Mbti In Software Engineering Education, Luiz Fernando Capretz
Electrical and Computer Engineering Publications
A number of approaches exist to aid the understanding of individual differences and their effects on teaching and learning. Educators have been using the Myers-Briggs Type Indicator (MBTI) to understand differences in learning styles and to develop teaching methods that cater for the various personality styles. Inspired by the MBTI, we developed a range of practices for effective teaching and learning in a software engineering course. Our aim is to reach every student, but in different ways, by devising various teaching approaches.
Flat-State Connectivity Of Linkages Under Dihedral Motions, Greg Aloupis, Erik D. Demaine, Vida Dujmović, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark Overmars, Michael Soss, Ileana Streinu, Godfried T. Toussaint
Flat-State Connectivity Of Linkages Under Dihedral Motions, Greg Aloupis, Erik D. Demaine, Vida Dujmović, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark Overmars, Michael Soss, Ileana Streinu, Godfried T. Toussaint
Computer Science: Faculty Publications
We explore which classes of linkages have the property that each pair of their flat states - that is, their embeddings in ℝ2 without self-intersection - can be connected by a continuous dihedral motion that avoids self-intersection throughout. Dihedral motions preserve all angles between pairs of incident edges, which is most natural for protein models. Our positive results include proofs that open chains with nonacute angles are flat-state connected, as are closed orthogonal unit-length chains. Among our negative results is an example of an orthogonal graph linkage that is flat-state disconnected. Several additional results are obtained for other restrictedclasses of …
Data Mining With Newton's Method., James Dale Cloyd
Data Mining With Newton's Method., James Dale Cloyd
Electronic Theses and Dissertations
Capable and well-organized data mining algorithms are essential and fundamental to helpful, useful, and successful knowledge discovery in databases. We discuss several data mining algorithms including genetic algorithms (GAs). In addition, we propose a modified multivariate Newton's method (NM) approach to data mining of technical data. Several strategies are employed to stabilize Newton's method to pathological function behavior. NM is compared to GAs and to the simplex evolutionary operation algorithm (EVOP). We find that GAs, NM, and EVOP all perform efficiently for well-behaved global optimization functions with NM providing an exponential improvement in convergence rate. For local optimization problems, we …
Computer Sciences At Purdue University 1962 To 2000, John R. Rice, Saul Rosen
Computer Sciences At Purdue University 1962 To 2000, John R. Rice, Saul Rosen
Department of Computer Science Technical Reports
No abstract provided.
Periodicity Detection In Time Series Databases, Mohamed G. Elfeky, Walid G. Aref, Mikhail J. Atallah
Periodicity Detection In Time Series Databases, Mohamed G. Elfeky, Walid G. Aref, Mikhail J. Atallah
Department of Computer Science Technical Reports
No abstract provided.
Multi-Dimenstional Traversals For Normalization Constants, Jorge R. Ramos, Vernon J. Rego
Multi-Dimenstional Traversals For Normalization Constants, Jorge R. Ramos, Vernon J. Rego
Department of Computer Science Technical Reports
No abstract provided.
Performance Of Multi-Dimensional Space- Filling Curves, Mohamed F. Mokbel, Walid G. Aref, Ibrahim Kamel
Performance Of Multi-Dimensional Space- Filling Curves, Mohamed F. Mokbel, Walid G. Aref, Ibrahim Kamel
Department of Computer Science Technical Reports
No abstract provided.
An Efficient Burst-Arrival And Batch- Departure Algoriths For Round-Robin Service, Jorge R. Ramos, Janche Sang
An Efficient Burst-Arrival And Batch- Departure Algoriths For Round-Robin Service, Jorge R. Ramos, Janche Sang
Department of Computer Science Technical Reports
No abstract provided.
Multi-Level Decomposition Of Probalistic Relations, Stanislaw Grygiel, Martin Zwick, Marek Perkowski
Multi-Level Decomposition Of Probalistic Relations, Stanislaw Grygiel, Martin Zwick, Marek Perkowski
Systems Science Faculty Publications and Presentations
Two methods of decomposition of probabilistic relations are presented in this paper. They consist of splitting relations (blocks) into pairs of smaller blocks related to each other by new variables generated in such a way so as to minimize a cost function which depends on the size and structure of the result. The decomposition is repeated iteratively until a stopping criterion is met. Topology and contents of the resulting structure develop dynamically in the decomposition process and reflect relationships hidden in the data.
Load Balancing And Congestion Avoidance Routing, Konstantinos N. Kokkinos
Load Balancing And Congestion Avoidance Routing, Konstantinos N. Kokkinos
Dissertations
Today’s high speed backbone networks are expected to support a wide range of communication-intensive applications. One of the most important issues in Quality of Service (QoS) is efficient routing. Many QoS routing solutions have been published lately for different criteria of QoS requirements and resource constraints. In this dissertation we focus on the design of regular network topologies and suggest efficient routing schemes to reduce the probability of hot spot creation in the network. Furthermore, we provide a detection of congestion mechanism that reroutes traffic to maintain balancing with small communication cost. Several theoretical results relatively to network traffic balancing …
On Clustering And Retrieval Of Video Shots Through Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang
On Clustering And Retrieval Of Video Shots Through Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang
Research Collection School Of Computing and Information Systems
Based on the analysis of temporal slices, we propose novel approaches for clustering and retrieval of video shots. Temporal slices are a set of two-dimensional (2-D) images extracted along the time dimension of an image volume. They encode rich set of visual patterns for similarity measure. In this paper, we first demonstrate that tensor histogram features extracted from temporal slices are suitable for motion retrieval. Subsequently, we integrate both tensor and color histograms for constructing a two-level hierarchical clustering structure. Each cluster in the top level contains shots with similar color while each cluster in bottom level consists of shots …
Detection And Generalization Of Spatio-Temporal Trajectories For Motion Imagery, Panayotis Partsinevelos
Detection And Generalization Of Spatio-Temporal Trajectories For Motion Imagery, Panayotis Partsinevelos
Electronic Theses and Dissertations
In today's world of vast information availability users often confront large unorganized amounts of data with limited tools for managing them. Motion imagery datasets have become increasingly popular means for exposing and disseminating information. Commonly, moving objects are of primary interest in modeling such datasets. Users may require different levels of detail mainly for visualization and further processing purposes according to the application at hand. In this thesis we exploit the geometric attributes of objects for dataset summarization by using a series of image processing and neural network tools. In order to form data summaries we select representative time instances …
A Performance Study Of Lam And Mpich On An Smp Cluster, Brian Patrick Kearns
A Performance Study Of Lam And Mpich On An Smp Cluster, Brian Patrick Kearns
Dissertations and Theses
Many universities and research laboratories have developed low cost clusters, built from Commodity-Off-The-Shelf (COTS) components and running mostly free software. Research has shown that these types of systems are well-equipped to handle many problems requiring parallel processing. The primary components of clusters are hardware, networking, and system software. An important system software consideration for clusters is the choice of the message passing library.
MPI (Message Passing Interface) has arguably become the most widely used message passing library on clusters and other parallel architectures, due in part to its existence as a standard. As a standard, MPI is open for anyone …
On Computing Condensed Frequent Pattern Bases, Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han
On Computing Condensed Frequent Pattern Bases, Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han
Kno.e.sis Publications
Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated is often too large. In many applications it is sufficient to generate and examine only frequent patterns with support frequency in close-enough approximation instead of in full precision. Such a compact but close-enough frequent pattern base is called a condensed frequent patterns-base.
In this paper, we propose and examine several alternatives at the design, representation, and implementation of such condensed frequent pattern-bases. A few algorithms for computing such pattern-bases are proposed. Their effectiveness at pattern …
Web Service Technologies And Their Synergy With Simulation, Senthilanand Chandrasekaran, Gregory S. Silver, John A. Miller, Jorge Cardoso, Amit P. Sheth
Web Service Technologies And Their Synergy With Simulation, Senthilanand Chandrasekaran, Gregory S. Silver, John A. Miller, Jorge Cardoso, Amit P. Sheth
Kno.e.sis Publications
The World Wide Web has had a huge influence on the computing field in general as well as simulation in particular (e.g., Web-Based Simulation). A new wave of development based upon XML has started. Two of the most interesting aspects of this development are the Semantic Web and Web Services. This paper examines the synergy between Web service technology and simulation. In one direction, Web service processes can be simulated for the purpose of correcting/improving the design. In the other direction, simulation models/components can be built out of Web services. Work on seamlessly using simulation as a part of Web …
Evaluating Conflicts In The Use And Development Of Geographic Information Systems, Amber Bethell
Evaluating Conflicts In The Use And Development Of Geographic Information Systems, Amber Bethell
Electronic Theses and Dissertations
Use of geographic information systems is increasing in governments, commercial companies, and by individual users. With such pervasive use of GIs there has been surprisingly little investigation of the values that various parties would support in the development of geographic technologies. There are many parties involved in the use of GIs each with opinions of what are good goals for developing and using such systems. This research seeks to determine differences and similarities among parties in the importance placed on supporting specific societal goals germane to the use of geographic technologies and databases. Previous research determined six areas where the …
Modeling Boundaries Of Influence Among Positional Uncertainty Fields, Joshua P. King
Modeling Boundaries Of Influence Among Positional Uncertainty Fields, Joshua P. King
Electronic Theses and Dissertations
Within a CIS environment, the proper use of information requires the identification of the uncertainty associated with it. As such, there has been a substantial amount of research dedicated to describing and quantifying spatial data uncertainty. Recent advances in sensor technology and image analysis techniques are making image-derived geospatial data increasingly popular. Along with development in sensor and image analysis technologies have come departures from conventional point-by-point measurements. Current advancements support the transition from traditional point measures to novel techniques that allow the extraction of complex objects as single entities (e.g., road outlines, buildings). As the methods of data extraction …
Sketch-Based Queries In Mobile Gis-Environments, David Caduff
Sketch-Based Queries In Mobile Gis-Environments, David Caduff
Electronic Theses and Dissertations
Recent achievements in the field of mobile computing and wireless communication promise data retrieval anywhere and anytime. This development provided the basis to expand GIs technology to handheld devices, such as personal digital assistants (PDAs). Although traditional GIs technology is well suited for desktop workstations, it needs to be adapted in order to satisfy the requirements of users using handheld computing devices. This adaptation is necessary because the usability of traditional GISs depends on characteristics of desktop computers, such as their relatively large user interfaces (e.g., displays, keyboards, pointing devices), considerable computing resources (i.e., CPU, memory, storage, operating systems), and …
Load-Sensitive Transmission Power Control In Wireless Ad-Hoc Networks, Seung Jong Park, Raghupathy Sivakumar
Load-Sensitive Transmission Power Control In Wireless Ad-Hoc Networks, Seung Jong Park, Raghupathy Sivakumar
Computer Science Faculty Research & Creative Works
Transmission power control in ad-hoc networks has hitherto been used only for achieving connectivity of networks. It has been implicitly assumed that the optimal throughput performance in ad-hoc networks can be achieved when using the minimum transmission power required to keep the network connected. However, in this paper we argue that such an assumption remains valid only under high node densities, which is not the characteristic of typical ad-hoc networks. Using both throughput and throughput per unit energy as the optimization criteria, we demonstrate that the optimal transmission power depends on several network characteristics such as the number of stations, …
Modeling Multiple Granularities Of Spatial Objects, Chitra Ramalingam
Modeling Multiple Granularities Of Spatial Objects, Chitra Ramalingam
Electronic Theses and Dissertations
People conceptualize objects in an information space over different levels of details or granularities and shift among these granularities as necessary for the task at hand. Shifting among granularities is fundamental for understanding and reasoning about an information space. In general, shifting to a coarser granularity can improve one's understanding of a complex information space, whereas shifting to a more detailed granularity reveals information that is otherwise unknown. To arrive at a coarser granularity. objects must be generalized. There are multiple ways to perform generalization. Several generalization methods have been adopted from the abstraction processes that are intuitively carried out …
Neural Supernets: Structuring Artificial Neural Networks According To Cluster Analysis, Simon Lucas Winberg
Neural Supernets: Structuring Artificial Neural Networks According To Cluster Analysis, Simon Lucas Winberg
Masters Theses
A typical feed forward neural network relies solely on its training algorithm, such as backprop or quickprop, to determine suitable weight values for an architecture chosen by the human operator. The architecture itself is typically a fully connected structuring of neurons and synapses where each hidden neuron is connected to every neuron in the next layer. Such architecture does not reflect the structure of the data used to train it. Similarly, in the case where random initial weight values are used, these initial weights are also unlikely to relate to the training set. Thus the job of the training algorithm …
Active Processor Scheduling Using Evolution Algorithms, David J. Caswell
Active Processor Scheduling Using Evolution Algorithms, David J. Caswell
Theses and Dissertations
The allocation of processes to processors has long been of interest to engineers. The processor allocation problem considered here assigns multiple applications onto a computing system. With this algorithm researchers could more efficiently examine real-time sensor data like that used by United States Air Force digital signal processing efforts or real-time aerosol hazard detection as examined by the Department of Homeland Security. Different choices for the design of a load balancing algorithm are examined in both the problem and algorithm domains. Evolutionary algorithms are used to find near-optimal solutions. These algorithms incorporate multiobjective coevolutionary and parallel principles to create an …
Coordinated Target Assignment And Intercept For Unmanned Air Vehicles, Erik P. Anderson, Randal W. Beard, Michael A. Goodrich, Timothy W. Mclain
Coordinated Target Assignment And Intercept For Unmanned Air Vehicles, Erik P. Anderson, Randal W. Beard, Michael A. Goodrich, Timothy W. Mclain
Faculty Publications
This paper presents an end-to-end solution to the cooperative control problem represented by the scenario where unmanned air vehicles (UAVs) are assigned to transition through known target locations in the presence of dynamic threats. The problem is decomposed into the subproblems of: 1) cooperative target assignment; 2) coordinated UAV intercept; 3) path planning; 4) feasible trajectory generation; and 5) asymptotic trajectory following. The design technique is based on a hierarchical approach to coordinated control. Simulation results are presented to demonstrate the effectiveness of the approach.
Resource Annotation Framework In A Georeferenced And Geospatial Digital Library, Zehua Liu, Ee Peng Lim, Dion Hoe-Lian Goh
Resource Annotation Framework In A Georeferenced And Geospatial Digital Library, Zehua Liu, Ee Peng Lim, Dion Hoe-Lian Goh
Research Collection School Of Computing and Information Systems
G-Portal is a georeferenced and geospatial digital library that aims to identify, classify and organize geospatial and georeferenced resources on the web and to provide digital library services for these resources. Annotation service is supported in G-Portal to enable users to contribute content to the digital library. In this paper, we present a resource annotation framework for georeferenced and geospatial digital libraries and discuss its application in G-Portal. The framework is fiexible for managing annotations of heterogeneous web resources. It allows users to contribute not only the annotation content but also the schema of the annotations. Meanwhile, other digital library …
A Data Mining Approach To Library New Book Recommendations, San-Yih Hwang, Ee Peng Lim
A Data Mining Approach To Library New Book Recommendations, San-Yih Hwang, Ee Peng Lim
Research Collection School Of Computing and Information Systems
In this paper, we propose a data mining approach to recommending new library books that have never been rated or borrowed by users. In our problem context, users are characterized by their demographic attributes, and concept hierarchies can be defined for some of these demographic attributes. Books are assigned to the base categories of a taxonomy. Our goal is therefore to identify the type of users interested in some specific type of books. We call such knowledge generalized profile association rules. In this paper, we propose a new definition of rule interestingness to prune away rules that are redundant and …
Crystalclear: Active Visualization Of Association Rules, Hian-Huat Ong, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim
Crystalclear: Active Visualization Of Association Rules, Hian-Huat Ong, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Effective visualization is an important aspect of active data mining. In the context of association rules, this need has been driven by the large amount of rules produced from a run of the algorithm. To be able to address real user needs, the rules need to be summarized and organized so that it can be interpreted and applied in a timely manner. In this paper, we propose two visualization techniques that is an improvement over those used by existing data mining packages. In particular, we address the visualization of "differences" in the set of rules due to incremental changes in …
Vdl: A Language For Active Mining Variants Of Association Rules, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim
Vdl: A Language For Active Mining Variants Of Association Rules, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim
Research Collection School Of Computing and Information Systems
The popularity of association rules has resulted in several variations being proposed. In each case, additional attributes in the data are considered so as to produce more informative rules. In the context of active mining, different types of rules may be required over a period of time due to knowledge needs or the availability of new attributes. The present approach is the ad-hoc development of algorithms for each variant of rules. This is time consuming and costly, and is a stumping block to the vision of active mining. We argue that knowledge needs and the changing characteristics of the data …
Motion Retrieval By Temporal Slices Analysis, Chong-Wah Ngo, Chong-Wah Ngo, Hong-Jiang Zhang
Motion Retrieval By Temporal Slices Analysis, Chong-Wah Ngo, Chong-Wah Ngo, Hong-Jiang Zhang
Research Collection School Of Computing and Information Systems
In this papel; we investigate video shots retrieval based on the analysis of temporal slice images. Temporal slices are a set of2D images extracted along the time dimension of image sequences. They encode rich set of motion clues for shot similarity measure. Because motion is depicted as texture orientation in temporal slices, we utilize various texture features such as tensor histogram, Gabor feature, and the statistical feature of co-occurrence matrix extracted directly from slices for motion description and retrieval. In this way, motion retrieval can be treated in a similar way as texture retrieval problem. Experimental results indicate that the …