Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Wright State University (167)
- Washington University in St. Louis (21)
- Singapore Management University (17)
- Missouri University of Science and Technology (15)
- Old Dominion University (5)
-
- Air Force Institute of Technology (2)
- Claremont Colleges (2)
- Technological University Dublin (2)
- Chapman University (1)
- Florida International University (1)
- Munster Technological University (1)
- Pace University (1)
- San Jose State University (1)
- University of Missouri, St. Louis (1)
- University of Nevada, Las Vegas (1)
- Keyword
-
- Algorithms (3)
- Adaptive Control (2)
- Computer vision (2)
- Network traffic (2)
- Neural Network (NN) (2)
-
- Power Control (2)
- Steganography (2)
- Telecommunications (2)
- 1.2 COMPUTER AND INFORMATION SCIENCE (1)
- 2.2 ELECTRICAL, ELECTRONIC, INFORMATION ENGINEERING (1)
- ADCR (1)
- Activity durations (1)
- Adaptive Critic Control (1)
- Adaptive Estimation (1)
- Adaptive Neural Network (ANN) (1)
- Ant colony optimization (1)
- Archiving repository crawler (1)
- Archivists (1)
- Argonne Model for Universal Solvent Extraction (AMUSE); Computer programming; Radioactive wastes – Purification; Reactor fuel reprocessing; Separation (Technology); Software engineering; System analysis; Systems engineering; Transmutation (Chemistry) (1)
- Authentication (1)
- BP neural network (1)
- Bag-of-visual-words (1)
- Blog (1)
- BotMiner (1)
- BotSniffer (1)
- Botnet (1)
- Botnet detection (1)
- Classification (1)
- Classification accuracies (1)
- Classification systems (1)
- Publication
-
- Computer Science & Engineering Syllabi (162)
- All Computer Science and Engineering Research (21)
- Research Collection School Of Computing and Information Systems (17)
- Electrical and Computer Engineering Faculty Research & Creative Works (13)
- Computer Science and Engineering Faculty Publications (5)
-
- Computer Science Faculty Publications (3)
- Articles (2)
- CGU Faculty Publications and Research (2)
- Computer Science Faculty Research & Creative Works (2)
- Electrical & Computer Engineering Faculty Publications (2)
- Faculty Publications (2)
- Cornerstone 3 Reports : Interdisciplinary Informatics (1)
- Engineering Faculty Articles and Research (1)
- Faculty Publications, Computer Science (1)
- NIMBUS Articles (1)
- Physics Faculty Works (1)
- Separations Campaign (TRP) (1)
- Telecommunications and Information Technology Institute (1)
Articles 211 - 238 of 238
Full-Text Articles in Engineering
Ceg 725-01: Computer Vision Ii, Arthur A. Goshtasby
Ceg 725-01: Computer Vision Ii, Arthur A. Goshtasby
Computer Science & Engineering Syllabi
No abstract provided.
Ceg 355-01: Introduction To The Design Of Information Technology Systems, Thomas C. Hartrum
Ceg 355-01: Introduction To The Design Of Information Technology Systems, Thomas C. Hartrum
Computer Science & Engineering Syllabi
Introduction to the design of information systems comprising modem technologies such as SQL database programming, networks, and distributed computing with CORBA, electronic and hypertext (HTML) documents, and multimedia.
Emergent Behavior In Massively-Deployed Sensor Networks, Ekaterina Shurkova, Ruzana Ishak, Stephan Olariu, Shaharuddin Salleh
Emergent Behavior In Massively-Deployed Sensor Networks, Ekaterina Shurkova, Ruzana Ishak, Stephan Olariu, Shaharuddin Salleh
Computer Science Faculty Publications
The phenomenal advances in MEMS and nanotechnology make it feasible to build small devices, referred to as sensors that are able to sense, compute and communicate over small distances. The massive deployment of these small devices raises the fascinating question of whether or not the sensors, as a collectivity, will display emergent behavior, just as living organisms do. In this work we report on a recent effort intended to observe emerging behavior of large groups of sensor nodes, like living cells demonstrate. Imagine a massive deployment of sensors that can be in two states "red" and "blue". At deployment time …
Object Detection And Classification With Applications To Skin Cancer Screening, Jonathan Blackledge, Dmitryi Dubovitskiy
Object Detection And Classification With Applications To Skin Cancer Screening, Jonathan Blackledge, Dmitryi Dubovitskiy
Articles
This paper discusses a new approach to the processes of object detection, recognition and classification in a digital image. The classification method is based on the application of a set of features which include fractal parameters such as the Lacunarity and Fractal Dimension. Thus, the approach used, incorporates the characterisation of an object in terms of its texture.
The principal issues associated with object recognition are presented which includes two novel fast segmentation algorithms for which C++ code is provided. The self-learning procedure for designing a decision making engine using fuzzy logic and membership function theory is also presented and …
Creating Preservation-Ready Web Resources, Joan A. Smith, Michael L. Nelson
Creating Preservation-Ready Web Resources, Joan A. Smith, Michael L. Nelson
Computer Science Faculty Publications
There are innumerable departmental, community, and personal web sites worthy of long-term preservation but proportionally fewer archivists available to properly prepare and process such sites. We propose a simple model for such everyday web sites which takes advantage of the web server itself to help prepare the site's resources for preservation. This is accomplished by having metadata utilities analyze the resource at the time of dissemination. The web server responds to the archiving repository crawler by sending both the resource and the just-in-time generated metadata as a straight-forward XML-formatted response. We call this complex object (resource + metadata) a CRATE. …
Covert Encryption And Document Authentication Using Texture Coding, Jonathan Blackledge, Mary Hallot
Covert Encryption And Document Authentication Using Texture Coding, Jonathan Blackledge, Mary Hallot
Articles
With the improvements in the quality of Commercial-Off-The-Shelf (COTS) printing and scanning devices, the ability to counterfeit documents has become a widespread problem. Consequently, there has been an increasing demand to develop digital watermarking techniques which can be applied to both electronic and printed images (and documents) that can be authenticated, prevent unauthorized copying and withstand abuse and degradation. In this paper , a new approach to digital watermarking is presented and a range of possible applications are considered. The process is defined by using concepts and techniques borrowed from Cryptography. It is based on computing a 'scramble image' by …
Functorial Coalgebraic Logic: The Case Of Many-Sorted Varieties, Alexander Kurz, Daniela Petrişan
Functorial Coalgebraic Logic: The Case Of Many-Sorted Varieties, Alexander Kurz, Daniela Petrişan
Engineering Faculty Articles and Research
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This paper makes two contributions. First, a previous result characterizing those functors that have presentations is generalized from endofunctors on one-sorted varieties to functors between many-sorted varieties. This yields an equational logic for the presheaf semantics of higher-order abstract syntax. As another application, we show how the move to functors between many-sorted varieties allows to modularly combine syntax and proof systems of different logics. Second, we show how to associate …
Columbia University/Vireo-Cityu/Irit Trecvid2008 High-Level Feature Extraction And Interactive Video Search, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky
Columbia University/Vireo-Cityu/Irit Trecvid2008 High-Level Feature Extraction And Interactive Video Search, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky
Research Collection School Of Computing and Information Systems
In this report, we present overview and comparative analysis of our HLF detection system, which achieves the top performance among all type-A submissions in 2008. We also describe preliminary evaluation of our video search system, CuZero, in the interactive search task.
Vegetation Identification Based On Satellite Imagery, Vamsi K.R. Mantena, Ramu Pedada, Srinivas Jakkula, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.)
Vegetation Identification Based On Satellite Imagery, Vamsi K.R. Mantena, Ramu Pedada, Srinivas Jakkula, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.)
Electrical & Computer Engineering Faculty Publications
Automatic vegetation identification plays an important role in many applications including remote sensing and high performance flight simulations. This paper presents a method to automatically identify vegetation based upon satellite imagery. First, we utilize the ISODATA algorithm to cluster pixels in the images where the number of clusters is determined by the algorithm. We then apply morphological operations to the clustered images to smooth the boundaries between clusters and to fill holes inside clusters. After that, we compute six features for each cluster. These six features then go through a feature selection algorithm and three of them are determined to …
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Computer Science Faculty Publications
Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireless communications capabilities. It is expected that these small devices, referred to as sensors, will be mass-produced and deployed, making their production cost negligible. Due to their small form factor and modest non-renewable energy budget, individual sensors are not expected to be GPS-enabled. Moreover, in most applications, exact geographic location is not necessary, and all that the individual sensors need is a coarse-grain location awareness. The task of acquiring such a coarse-grain location awareness is referred to as training. …
Scheduling Design And Verification For Open Soft Real-Time Systems, Robert Glaubius, Terry Tidwell, William D. Smart, Christopher Gill
Scheduling Design And Verification For Open Soft Real-Time Systems, Robert Glaubius, Terry Tidwell, William D. Smart, Christopher Gill
All Computer Science and Engineering Research
Open soft real-time systems, such as mobile robots, experience unpredictable interactions with their environments and yet must respond both adaptively and with reasonable temporal predictability. New scheduling approaches are needed to address the demands of such systems, in which many of the assumptions made by traditional real-time scheduling theory do not hold. In previous work we established foundations for a scheduling policy design and verification approach for open soft real-time systems, that can use different decision models, e.g., a Markov Decision Process (MDP), to capture the nuances of their scheduling semantics. However, several important refinements to the preliminary techniques developed …
Local Neighborhoods For Shape Classification And Normal Estimation, Cindy Grimm, William Smart
Local Neighborhoods For Shape Classification And Normal Estimation, Cindy Grimm, William Smart
All Computer Science and Engineering Research
We introduce the concept of local neighborhoods, a generalization of the one-ring on a mesh to unlabeled 3D data points arising from sampling a 2D surface embedded in 3D. The local neighborhood supports both local shape classification and robust normal estimation. In particular, local neighborhoods out-perform traditional approaches in unevenly sampled, curved regions. We show that the local neighborhood can be used in place of a full mesh structure for applications such as smoothing, moving least-squares reconstruction, and parameterization. Longer version of paper submitted to CAGD
Practical Schedulability Analysis For Generalized Sporadic Tasks In Distributed Real-Time Systems, Yuanfang Zhang, Donald K. Krecker, Christopher Gill, Chenyang Lu, Guatam H. Thaker
Practical Schedulability Analysis For Generalized Sporadic Tasks In Distributed Real-Time Systems, Yuanfang Zhang, Donald K. Krecker, Christopher Gill, Chenyang Lu, Guatam H. Thaker
All Computer Science and Engineering Research
Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fixed minimum inter-arrival times is a poor approximation for systems in which tasks arrive in bursts, but have longer intervals between the bursts. In such cases, schedulability analysis based on the existing sporadic task model is pessimistic and seriously overestimates the task's time demand. In this paper, we propose a generalized sporadic task model that characterizes arrival times more precisely than the traditional sporadic task model, and we develop a corresponding schedulability analysis that computes tighter bounds …
A Practical Schedulability Analysis For Generalized Sporadic Tasks In Distributed Real-Time Systems, Yuanfang Zhang, Donald K. Krecker, Christopher Gill, Chenyang Lu, Guatam H. Thakar
A Practical Schedulability Analysis For Generalized Sporadic Tasks In Distributed Real-Time Systems, Yuanfang Zhang, Donald K. Krecker, Christopher Gill, Chenyang Lu, Guatam H. Thakar
All Computer Science and Engineering Research
Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fixed minimum inter-arrival times is a poor approximation for systems in which tasks arrive in bursts, but have longer intervals between the bursts. In such cases, schedulability analysis based on the existing sporadic task model is pessimistic and seriously overestimates the task's time demand. In this paper, we propose a generalized sporadic task model that characterizes arrival times more precisely than the traditional sporadic task model, and we develop a corresponding schedulability analysis that computes tighter bounds …
Scheduling For Reliable Execution In Autonomic Systems, Terry Tidwell, Robert Glaubius, Christopher Gill, William D. Smart
Scheduling For Reliable Execution In Autonomic Systems, Terry Tidwell, Robert Glaubius, Christopher Gill, William D. Smart
All Computer Science and Engineering Research
Scheduling the execution of multiple concurrent tasks on shared resources such as CPUs and network links is essential to ensuring the reliable operation of many autonomic systems. Well known techniques such as rate-monotonic scheduling can offer rigorous timing and preemption guarantees, but only under assumptions (i.e., a fixed set of tasks with well-known execution times and invocation rates) that do not hold in many autonomic systems. New hierarchical scheduling techniques are better suited to enforce the more flexible execution constraints and enforcement mechanisms that are required for autonomic systems, but a rigorous foundation for verifying and enforcing concurrency and timing …
Financial Monte Carlo Simulation On Architecturally Diverse Systems, Naveen Singla, Michael Hall, Berkley Shands, Roger D. Chamberlain
Financial Monte Carlo Simulation On Architecturally Diverse Systems, Naveen Singla, Michael Hall, Berkley Shands, Roger D. Chamberlain
All Computer Science and Engineering Research
Computational finance relies heavily on the use of Monte Carlo simulation techniques. However, Monte Carlo simulation is computationally very demanding. We demonstrate the use of architecturally diverse systems to accelerate the performance of these simulations, exploiting both graphics processing units and field-programmable gate arrays. Performance results include a speedup of 74× relative to an 8 core multiprocessor system (180× relative to a single processor core).
Partial Program Admission By Path Enumeration, Michael Wilson, Ron Cytron, Jon Turner
Partial Program Admission By Path Enumeration, Michael Wilson, Ron Cytron, Jon Turner
All Computer Science and Engineering Research
Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most commonly used to bound program execution time. While bounding a program's WCET statically is possible, computing its true WCET is difficult without significant semantic knowledge. We present an algorithm for partial program admission, suited for non-preemptive platforms, using dynamic programming to perform explicit enumeration of program paths. Paths - possible or not - are bounded by the available execution time and admitted on a path-by-path basis without requiring semantic knowledge of the program beyond its Control …
Reliable Data Collection From Mobile Users For Real-Time Clinical Monitoring, Octav Chipara, Christopher Brooks, Sangeeta Bhattacharya, Chenyang Lu
Reliable Data Collection From Mobile Users For Real-Time Clinical Monitoring, Octav Chipara, Christopher Brooks, Sangeeta Bhattacharya, Chenyang Lu
All Computer Science and Engineering Research
Real-time patient monitoring is critical to early detection of clinical patient deterioration in general hospital wards. A key challenge in such applications is to reliably deliver sensor data from mobile patients. We present an empirical analysis on the reliability of data collection from wireless pulse oximeters attached to users. We observe that most packet loss occur from mobile users to their first-hop relays. Based on this insight we developed the Dynamic Relay Association Protocol (DRAP), a simple and effective mechanism for dynamically discovering the right relays for wireless sensors attached to mobile users. DRAP enables highly reliable data collection from …
Transcriptome Analysis Of Alzheimer's Disease Identifies Links To Cardiovascular Disease, Monika Ray, Jianhua Ruan, Weixiong Zhang
Transcriptome Analysis Of Alzheimer's Disease Identifies Links To Cardiovascular Disease, Monika Ray, Jianhua Ruan, Weixiong Zhang
All Computer Science and Engineering Research
No abstract provided.
Women And Technology: Reversing The Trends Of Attrition And Obtaining A Balance, Gondy Leroy, Kristin M. Tolle, Linda Perkins
Women And Technology: Reversing The Trends Of Attrition And Obtaining A Balance, Gondy Leroy, Kristin M. Tolle, Linda Perkins
CGU Faculty Publications and Research
Many reports and technical news bulletins presented by organizations such as the National Science Foundation (NSF), the Institute of Electrical and Electronics Engineers (IEEE), the Association for Computing Machinery (ACM), and the National Center for Women & Information Technology (NCWIT) highlight that few female and minority college students are choosing science, technology, engineering, and math (STEM) fields of study or careers. For those who choose STEM fields, attrition both during education and in the workplace is pervasive. NSF reports in its 2006 Science Indicators that women account for only 27% of the bachelor’s degrees in computer sciences. And although the …
Verification Of Component-Based Distributed Real-Time Systems, Huang-Ming Huang, Christopher Gill
Verification Of Component-Based Distributed Real-Time Systems, Huang-Ming Huang, Christopher Gill
All Computer Science and Engineering Research
Component-based software architectures enable reuse by separating application-specific concerns into modular components that are shielded from each other and from common concerns addressed by underlying services. Even so, concerns such as invocation rates, execution latencies, deadlines, and concurrency and scheduling semantics still cross-cut component boundaries in many real-time systems. Verification of these systems therefore must consider how composition of components relates to timing, resource utilization, and other properties. However, existing approaches only address a sub-set of the concerns that must be modeled in component-based distributed real-time systems, and a new more comprehensive approach is thus needed. To address that need, …
Faster Optimal State-Space Search With Graph Decomposition And Reduced Expansion, Yixin Chen
Faster Optimal State-Space Search With Graph Decomposition And Reduced Expansion, Yixin Chen
All Computer Science and Engineering Research
Traditional AI search methods, such as BFS, DFS, and A*, look for a path from a starting state to the goal in a state space most typically modelled as a directed graph. Prohibitively large sizes of the state space graphs make optimal search difficult. A key observation, as manifested by the SAS+ formalism for planning, is that most commonly a state-space graph is well structured as the Cartesian product of several small subgraphs. This paper proposes novel search algorithms that exploit such structure. The results reveal that standard search algorithms may explore many redundant paths. Our algorithms provide an automatic …
Flexible Service Provisioning For Heterogeneous Sensor Networks, Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu
Flexible Service Provisioning For Heterogeneous Sensor Networks, Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu
All Computer Science and Engineering Research
This paper presents Servilla, a highly flexible service provisioning framework for heterogeneous wireless sensor networks. Its service-oriented programming model and middleware enable developers to construct platform-independent applications over a dynamic set of devices with diverse computational resources and sensors. A salient feature of Servilla is its support for dynamic discovery and binding to local and remote services, which enables flexible and energy-efficient in-network collaboration among heterogeneous devices. Furthermore, Servilla provides a modular middleware architecture that can be easily tailored for devices with a wide range of resources, allowing even resource-limited devices to provide services and leverage resource-rich devices for in-network …
Generalized Hamilton-Jacobi-Bellman Formulation-Based Neural Network Control Of Affine Nonlinear Discrete-Time Systems, Zheng Chen, Jagannathan Sarangapani
Generalized Hamilton-Jacobi-Bellman Formulation-Based Neural Network Control Of Affine Nonlinear Discrete-Time Systems, Zheng Chen, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
In this paper, we consider the use of nonlinear networks towards obtaining nearly optimal solutions to the control of nonlinear discrete-time (DT) systems. The method is based on least squares successive approximation solution of the generalized Hamilton-Jacobi-Bellman (GHJB) equation which appears in optimization problems. Successive approximation using the GHJB has not been applied for nonlinear DT systems. The proposed recursive method solves the GHJB equation in DT on a well-defined region of attraction. The definition of GHJB, pre-Hamiltonian function, HJB equation, and method of updating the control function for the affine nonlinear DT systems under small perturbation assumption are proposed. …
Concept Detection: Convergence To Local Features And Opportunities Beyond, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky
Concept Detection: Convergence To Local Features And Opportunities Beyond, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky
Research Collection School Of Computing and Information Systems
No abstract provided.
Towards A Metric For The Assessment Of Safety Critical Control Systems, Oscar R. Gonzalez, Jorge R. Chavez-Fuentes, W. Steven Gray
Towards A Metric For The Assessment Of Safety Critical Control Systems, Oscar R. Gonzalez, Jorge R. Chavez-Fuentes, W. Steven Gray
Electrical & Computer Engineering Faculty Publications
There is a need for better integration of the fault tolerant and the control designs for safety critical systems such as aircraft. The dependability of current designs is assessed primarily with measures of the interconnection of fault tolerant components: the reliability function and the mean time to failure. These measures do not directly take into account the interaction of the fault tolerant components with the dynamics of the aircraft. In this paper, a first step to better integrate these designs is made. It is based on the observation that unstable systems are intrinsically unreliable and that a necessary condition for …
Network Formation Using Ant Colony Optimization -- A Systematic Review, Steven C. Oimoen, Gilbert L. Peterson, Kenneth M. Hopkinson
Network Formation Using Ant Colony Optimization -- A Systematic Review, Steven C. Oimoen, Gilbert L. Peterson, Kenneth M. Hopkinson
Faculty Publications
A significant area of research in the field of hybrid communications is the Network Design Problem (NDP) [1]. The NDP is an NP complete problem [1] that focuses on identifying the optimal network topology for transmitting commodities between nodes, under constraints such as bandwidth, limited compatible directed channels, and link and commodity costs. The NDP focuses on designing a flexible network while trying to achieve optimal flow or routing. If a link (or arc) is used, then an associated fixed cost of the edge is incurred. In addition, there is a cost for using the arc depending on the flow. …
The Oil Drilling Model And Iterative Deepening Genetic Annealing Algorithm For The Traveling Salesman Problem, Hoong Chuin Lau, Fei Xiao
The Oil Drilling Model And Iterative Deepening Genetic Annealing Algorithm For The Traveling Salesman Problem, Hoong Chuin Lau, Fei Xiao
Research Collection School Of Computing and Information Systems
In this work, we liken the solving of combinatorial optimization problems under a prescribed computational budget as hunting for oil in an unexplored ground. Using this generic model, we instantiate an iterative deepening genetic annealing (IDGA) algorithm, which is a variant of memetic algorithms. Computational results on the traveling salesman problem show that IDGA is more effective than standard genetic algorithms or simulated annealing algorithms or a straightforward hybrid of them. Our model is readily applicable to solve other combinatorial optimization problems.