Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Series

2010

Institution
Keyword
Publication
File Type

Articles 1 - 30 of 910

Full-Text Articles in Physical Sciences and Mathematics

Home Automation Proposal, Paul Parham, Nathan James, Bonnie Bachman Dec 2010

Home Automation Proposal, Paul Parham, Nathan James, Bonnie Bachman

Business and Information Technology Faculty Research & Creative Works

1.1 Objectives The objective for Phase 2 of the Motorola project is to propose a comprehensive home automation system that can be launched in the next one to two years. Currently, there are many entertainment, security, and home control devices on the market but no device that ties these systems together for consumers. The goal is to develop a system that can be easily installed, cost efficient, and able to provide genuine home automation to consumers.

Go to article

A Note On Solid Coloring Of Pure Simplicial Complexes, Joseph O'Rourke Dec 2010

A Note On Solid Coloring Of Pure Simplicial Complexes, Joseph O'Rourke

Computer Science: Faculty Publications

We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in Rd may be colored with d+1 colors so that no two simplices that share a (d-1)-facet have the same color. In R2 this says that any planar map all of whose faces are triangles may be 3-colored, and in R3 it says that tetrahedra in a collection may be "solid 4-colored" so that no two glued face-to-face receive the same color.

Go to article

Caesked: A Class Scheduler For Wmu Students, Chris Fruin, Jerry Grochowski Dec 2010

Caesked: A Class Scheduler For Wmu Students, Chris Fruin, Jerry Grochowski

Computer Science Senior Projects

Scheduling classes is a tedious process for WMU students. CAESked, a class scheduling web application, was created to ease this process. The programming languages PHP and JavaScript were used to build a solution which integrates WMU data for upcoming courses into a web application. With features including a weekly calendar, a campus map, and class information all in one place, CAESked provides students with an easy to use tool for adding classes to their schedule.

Go to article

Testing Embedded System Applications, Tingting Yu Dec 2010

Testing Embedded System Applications, Tingting Yu

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Embedded systems are becoming increasingly ubiquitous, controlling a wide variety of popular and safety-critical devices. Testing is the most commonly used method for validating software systems, and effective testing techniques could be helpful for improving the dependability of these systems. However, there are challenges involved in developing such techniques. Embedded systems consist of layers of software – application layers utilize services provided by underlying system service and hardware support layers. A typical embedded application consists of multiple user tasks. Interactions between application layers and lower layers, and interactions between the various user tasks that are initiated by the application layer, …

Go to article

Paranets: A Parallel Network Architecture For The Future Internet, Khaled Harras, Abderrahmen Mtibaa Dec 2010

Paranets: A Parallel Network Architecture For The Future Internet, Khaled Harras, Abderrahmen Mtibaa

Computer Science Faculty Works

The evolution of networking technologies and portable devices has led users to expect connectivity anytime and everywhere. We have reached the point of seeing networking occur underwater, via aerial devices, and across space. While researchers push the true boundaries of networking to serve a wide range of environments, there is the challenge of providing robust network connectivity beyond the boundaries of the core internet, defined by fiber optics and well-organized backbones. As the internet edges expand, the expectation is that connectivity will be as good, in terms of high bandwidth and minimal interruption, as anywhere in the core. Such an …

Go to article

Automatic Media Segmentation Within Ieee 1599–2008, Antonello D'Aguanno, Luca A. Ludovico, Davide Andrea Mauro Dec 2010

Automatic Media Segmentation Within Ieee 1599–2008, Antonello D'Aguanno, Luca A. Ludovico, Davide Andrea Mauro

Computer Sciences and Electrical Engineering Faculty Research

This paper deals with the automatic extraction of synchronization data from IEEE 1599-2008, an XML-based standard aiming at a comprehensive description of music. Within such format, audio tracks and video contents related to the same music piece can be referred to the occurrence of symbolic music events. In this way, digital objects are mutually synchronized, too. The goal is to show how timing information can be easily extracted from an IEEE 1599-2008 file, converted into a suitable format, and finally employed in a multimedia editing environment in order to produce an automatic segmentation of media objects.

Go to article

Global Dimension Of Ci: Compete Or Collaborate, Arden L. Bement Jr. Dec 2010

Global Dimension Of Ci: Compete Or Collaborate, Arden L. Bement Jr.

PPRI Digital Library

No abstract provided.

Go to article

Spatial Semantics For Better Interoperability And Analysis: Challenges And Experiences In Building Semantically Rich Applications In Web 3.0, Amit P. Sheth Dec 2010

Spatial Semantics For Better Interoperability And Analysis: Challenges And Experiences In Building Semantically Rich Applications In Web 3.0, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Strategies For Preparing Computer Science Students For The Multicore World, Richard Brown, Elizabeth Shoop, Joel C. Adams, Curtis Clifton Dec 2010

Strategies For Preparing Computer Science Students For The Multicore World, Richard Brown, Elizabeth Shoop, Joel C. Adams, Curtis Clifton

University Faculty Publications and Creative Works

Multicore computers have become standard, and the number of cores per computer is rising rapidly. How does the new demand for understanding of parallel computing impact computer science education? In this paper, we examine several aspects of this question: (i) What parallelism body of knowledge do today's students need to learn? (ii) How might these concepts and practices be incorporated into the computer science curriculum? (iii) What resources will support computer science educators, including non-specialists, to teach parallel computing? (iv) What systemic obstacles impede this change, and how might they be overcome? We address these concerns as an initial framework …

Go to article

Mobile Visibility Querying For Lbs, James Carswell, Keith Gardiner, Junjun Jin Dec 2010

Mobile Visibility Querying For Lbs, James Carswell, Keith Gardiner, Junjun Jin

Articles

This article describes research carried out in the area of mobile spatial interaction (MSI) and the development of a 3D mobile version of a 2D web-based directional query processor. The TellMe application integrates location (from GPS, GSM, WiFi) and orientation (from magnetometer/accelerometer) sensor technologies into an enhanced spatial query processing module capable of exploiting a mobile device’s position and orientation for querying real-world spatial datasets. This article outlines our technique for combining these technologies and the architecture needed to deploy them on a sensor enabled smartphone (i.e. Nokia Navigator 6210). With all these sensor technologies now available on off-the-shelf devices, …

Go to article

Best-First Heuristic Search For Multicore Machines, Ethan Burns, Sofia N. Lemons, Wheeler Ruml, Rong Zhou Dec 2010

Best-First Heuristic Search For Multicore Machines, Ethan Burns, Sofia N. Lemons, Wheeler Ruml, Rong Zhou

Computer Science

To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-first search in a shared-memory setting. We present a new method, PBNF, that uses abstraction to partition the state space and to detect duplicate states without requiring frequent locking. PBNF allows speculative expansions when necessary to keep threads busy. We identify and fix potential livelock conditions in our approach, proving its correctness using temporal logic. Our approach is general, allowing it to extend easily to suboptimal and anytime heuristic search. In an empirical comparison on STRIPS …

Go to article

The Humanitarian Foss Project, Ralph A. Morelli, Allen Tucker, Trishan R. De Lanerolle Dec 2010

The Humanitarian Foss Project, Ralph A. Morelli, Allen Tucker, Trishan R. De Lanerolle

Faculty Scholarship

The Humanitarian Free and Open Source Software (Humanitarian FOSS) Project is primarily an educational project whose goal is to engage more undergraduates in building free and open source software (FOSS) that benefits their community. Over the past four years, increasing numbers of undergraduates and computer science programs have been inspired by the Humanitarian FOSS project to make significant contributions to several active open source software development projects that have benefited organizations such as the Portland, Maine Ronald McDonald House, and the New York City Salvation Army. This article provides examples of several Humanitarian FOSS projects and describes other initiatives aimed …

Go to article

Time Cost Evaluation For Executing Rfid Authentication Protocols, Kevin Chiew, Yingjiu Li, Tieyan Li, Robert H. Deng, Manfred Aigner Dec 2010

Time Cost Evaluation For Executing Rfid Authentication Protocols, Kevin Chiew, Yingjiu Li, Tieyan Li, Robert H. Deng, Manfred Aigner

Research Collection School Of Computing and Information Systems

There are various reader/tag authentication protocols proposed for the security of RFID systems. Such a protocol normally contains several rounds of conversations between a tag and a reader and involves cryptographic operations at both reader and tag sides. Currently there is a lack of benchmarks that provide a fair comparison platform for (a) the time cost of cryptographic operations at the tag side and (b) the time cost of data exchange between a reader and a tag, making it impossible to evaluate the total time cost for executing a protocol. Based on our experiments implemented on IAIK UHF tag emulators …

Go to article

Chosen-Ciphertext Secure Bidirectional Proxy Re-Encryption Schemes Without Pairings, Jian Weng, Huijie, Robert Deng, Shengli Liu, Kefei Chen Dec 2010

Chosen-Ciphertext Secure Bidirectional Proxy Re-Encryption Schemes Without Pairings, Jian Weng, Huijie, Robert Deng, Shengli Liu, Kefei Chen

Research Collection School Of Computing and Information Systems

Proxy re-encryption realizes delegation of decryption rights, enabling a proxy holding a re-encryption key to convert a ciphertext originally intended for Alice into an encryption of the same message for Bob. Proxy re-encryption is a very useful primitive, having many applications in distributed file systems, outsourced filtering of encrypted spam, access control over network storage, and so on. Lately, Weng et al. proposed the first unidirectional proxy re-encryption scheme without using bilinear pairs. However, Weng et al.'s construction does not possess collusion resilience, in the sense that a coalition of the proxy and the delegatee can recover the delegator's private …

Go to article

A Multi-User Steganographic File System On Untrusted Shared Storage, Jin Han, Meng Pan, Debin Gao, Hwee Hwa Pang Dec 2010

A Multi-User Steganographic File System On Untrusted Shared Storage, Jin Han, Meng Pan, Debin Gao, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Existing steganographic file systems enable a user to hide the existence of his secret data by claiming that they are (static) dummy data created during disk initialization. Such a claim is plausible if the adversary only sees the disk content at the point of attack. In a multi-user computing environment that employs untrusted shared storage, however, the adversary could have taken multiple snapshots of the disk content over time. Since the dummy data are static, the differences across snapshots thus disclose the locations of user data, and could even reveal the user passwords. In this paper, we introduce a Dummy-Relocatable …

Go to article

Revisiting Address Space Randomization, Zhi Wang, Renquan Cheng, Debin Gao Dec 2010

Revisiting Address Space Randomization, Zhi Wang, Renquan Cheng, Debin Gao

Research Collection School Of Computing and Information Systems

Address space randomization is believed to be a strong defense against memory error exploits. Many code and data objects in a potentially vulnerable program and the system could be randomized, including those on the stack and heap, base address of code, order of functions, PLT, GOT, etc. Randomizing these code and data objects is believed to be effective in obfuscating the addresses in memory to obscure locations of code and data objects. However, attacking techniques have advanced since the introduction of address space randomization. In particular, return-oriented programming has made attacks without injected code much more powerful than what they …

Go to article

Protecting And Restraining The Third Party In Rfid-Enabled 3pl Supply Chains, Shaoying Cai, Chunhua Su, Yingjiu Li, Robert H. Deng Dec 2010

Protecting And Restraining The Third Party In Rfid-Enabled 3pl Supply Chains, Shaoying Cai, Chunhua Su, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

“Symmetric secret”-based RFID systems are widely adopted in supply chains. In such RFID systems, a reader’s ability to identify a RFID tag relies on the possession of the tag’s secret which is usually only known by its owner. If a “symmetric secret”-based RFID system is deployed in third party logistics (3PL) supply chains, all the three parties (the sender of the goods, the receiver of the goods and the 3PL provider) should have a copy of those tags’ secrets to access the tags. In case the three parties in 3PL supply chain are not all honest, sharing the secrets among …

Go to article

Sequence Alignment Based Analysis Of Player Behavior In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Jaideep Srivastava Dec 2010

Sequence Alignment Based Analysis Of Player Behavior In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

This study proposes a sequence alignment-based behavior analysis framework (SABAF) developed for predicting inactive game players that either leave the game permanently or stop playing the game for a long period of time. Sequence similarity scores and derived statistics form profile databases of inactive players and active players from the past. SABAF uses global and local sequence alignment algorithms and a unique scoring scheme to measure similarity between activity sequences. SABAF is tested on the game player activity data of Ever Quest II, a popular massively multiplayer online role-playing game developed by Sony Online Entertainment. SABAF consists of the following …

Go to article

Map Estimation For Graphical Models By Likelihood Maximization, Akshat Kumar, Shlomo Zilberstein Dec 2010

Map Estimation For Graphical Models By Likelihood Maximization, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Computing a maximum a posteriori (MAP) assignment in graphical models is a crucial inference problem for many practical applications. Several provably convergent approaches have been successfully developed using linear programming (LP) relaxation of the MAP problem. We present an alternative approach, which transforms the MAP problem into that of inference in a finite mixture of simple Bayes nets. We then derive the Expectation Maximization (EM) algorithm for this mixture that also monotonically increases a lower bound on the MAP assignment until convergence. The update equations for the EM algorithm are remarkably simple, both conceptually and computationally, and can be implemented …

Go to article

Opportunistic Routing In Wireless Sensor Networks Powered By Ambient Energy Harvesting, Zhi Ang Eu, Hwee-Pink Tan, Winston K. G. Seah Dec 2010

Opportunistic Routing In Wireless Sensor Networks Powered By Ambient Energy Harvesting, Zhi Ang Eu, Hwee-Pink Tan, Winston K. G. Seah

Research Collection School Of Computing and Information Systems

Energy consumption is an important issue in the design of wireless sensor networks (WSNs) which typically rely on portable energy sources like batteries for power. Recent advances in ambient energy harvesting technologies have made it possible for sensor nodes to be powered by ambient energy entirely without the use of batteries. However, since the energy harvesting process is stochastic, exact sleep-and-wakeup schedules cannot be determined in WSNs Powered solely using Ambient Energy Harvesters (WSN–HEAP). Therefore, many existing WSN routing protocols cannot be used in WSN–HEAP. In this paper, we design an opportunistic routing protocol (EHOR) for multi-hop WSN–HEAP. Unlike traditional …

Go to article

Dynamic Group Key Exchange Revisited, Guomin Yang, Chik How Tan Dec 2010

Dynamic Group Key Exchange Revisited, Guomin Yang, Chik How Tan

Research Collection School Of Computing and Information Systems

In a dynamic group key exchange protocol, besides the basic group setup protocol, there are also a join protocol and a leave protocol, which allow the membership of an existing group to be changed more efficiently than rerunning the group setup protocol. The join and leave protocols should ensure that the session key is updated upon every membership change so that the subsequent sessions are protected from leaving members (backward security) and the previous sessions are protected from joining members (forward security). In this paper, we present a new security model for dynamic group key exchange. Comparing to existing models, …

Go to article

Automobile Exhaust Gas Detection Based On Fuzzy Temperature Compensation System, Zhiyong Wang, Hao Ding, Fufei Hao, Zhaoxia Wang, Zhen Sun, Shujin Li Dec 2010

Automobile Exhaust Gas Detection Based On Fuzzy Temperature Compensation System, Zhiyong Wang, Hao Ding, Fufei Hao, Zhaoxia Wang, Zhen Sun, Shujin Li

Research Collection School Of Computing and Information Systems

A temperature compensation scheme of detecting automobile exhaust gas based on fuzzy logic inference is presented in this paper. The principles of the infrared automobile exhaust gas analyzer and the influence of the environmental temperature on analyzer are discussed. A fuzzy inference system is designed to improve the measurement accuracy of the measurement equipment by reducing the measurement errors caused by environmental temperature. The case studies demonstrate the effectiveness of the proposed method. The fuzzy compensation scheme is promising as demonstrated by the simulation results in this paper.

Go to article

Optimized Algorithms For Predictive Range And Knn Queries On Moving Objects, Rui Zhang, H.V. Jagadish, Bing Tian Dai, Kotagiri Ramamohanarao Dec 2010

Optimized Algorithms For Predictive Range And Knn Queries On Moving Objects, Rui Zhang, H.V. Jagadish, Bing Tian Dai, Kotagiri Ramamohanarao

Research Collection School Of Computing and Information Systems

There have been many studies on management of moving objects recently. Most of them try to optimize the performance of predictive window queries. However, not much attention is paid to two other important query types: the predictive range query and the predictive k nearest neighbor query. In this article, we focus on these two types of queries. The novelty of our work mainly lies in the introduction of the Transformed Minkowski Sum, which can be used to determine whether a moving bounding rectangle intersects a moving circular query region. This enables us to use the traditional tree traversal algorithms to …

Go to article

Exploiting Intensity Inhomogeneity To Extract Textured Objects From Natural Scenes, Jundi Ding, Jialie Shen, Hwee Hwa Pang, Songcan Chen, Jingyu Yang Dec 2010

Exploiting Intensity Inhomogeneity To Extract Textured Objects From Natural Scenes, Jundi Ding, Jialie Shen, Hwee Hwa Pang, Songcan Chen, Jingyu Yang

Research Collection School Of Computing and Information Systems

Extracting textured objects from natural scenes is a challenging task in computer vision. The main difficulties arise from the intrinsic randomness of natural textures and the high-semblance between the objects and the background. In this paper, we approach the extraction problem with a seeded region-growing framework that purely exploits the statistical properties of intensity inhomogeneity. The pixels in the interior of potential textured regions are first found as texture seeds in an unsupervised manner. The labels of the texture seeds are then propagated through their respective inhomogeneous neighborhoods, to eventually cover the different texture regions in the image. Extensive experiments …

Go to article

Toward Effective Concept Representation In Decision Support To Improve Patient Safety, Tze-Yun Leong Dec 2010

Toward Effective Concept Representation In Decision Support To Improve Patient Safety, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

Patient safety is an emerging, major health care discipline with significance accentuated in the influential Institute of Medicine (IOM) reports in the United States “To Err is Human” and “Crossing the Quality Chasm”. These reports highlighted the danger and prevalence of medical errors and preventable adverse events, explained the three main sources of system-related, human factors-related and cognitive-related errors, and recommended the use of information and decision support technologies to help alleviate the problem. A number of studies and reports from all over the world with similar findings have since followed, culminating in the 55th World Health Assembly Resolution on …

Go to article

Considerations On Unsupervised Spectral Data Unmixing And Complexity Pursuit, Stefan Robila Dec 2010

Considerations On Unsupervised Spectral Data Unmixing And Complexity Pursuit, Stefan Robila

Department of Computer Science Faculty Scholarship and Creative Works

Hyperspectral sensors carry the distinctive advantage of recording hundreds of contiguous spectral images for the same scene providing an extraordinary amount of information that leads to precise differentiation of materials present in the scene even when such materials contribute only to few pixels [1]. With the advent of more and more powerful sensing platforms, coupled with reduction in manufacturing costs and diversification of technologies, hyperspectral imaging has become a powerful approach in remote sensing with applications spanning all traditional fields (such as agriculture, mining, military, resource management, etc.) as well as new ones (manufacturing quality control, pollution detection, health and …

Go to article

Parallel Unmixing Of Hyperspectral Data Using Complexity Pursuit, Stefan Robila, Martin Butler Dec 2010

Parallel Unmixing Of Hyperspectral Data Using Complexity Pursuit, Stefan Robila, Martin Butler

Department of Computer Science Faculty Scholarship and Creative Works

Accurate and fast data unmixing is key to most applications employing hyperspectral data. Among the large number unmixing approaches, Blind Source Separation (BSS) has been employed successfully through a variety of techniques, yet most of these approaches continue to be computationally expensive due to their iterative nature. In this context, it is imperative to seek efficient approaches that leverage the accuracy of the algorithms and the availability of off-the-shelf computationally performant systems such as multi-cpu and multi core. In this paper we tackle the spatial complexity based unmixing, a new technique shown to outperform many BSS solutions. We develop a …

Go to article

A Genetic Algorithm For Multiobjective Hard Scheduling Optimization, Elías Niño, Carlos Ardila, Alfredo J. Perez, Yexid Donoso Dec 2010

A Genetic Algorithm For Multiobjective Hard Scheduling Optimization, Elías Niño, Carlos Ardila, Alfredo J. Perez, Yexid Donoso

Computer Science Faculty Publications

This paper proposes a genetic algorithm for multiobjective scheduling optimization based in the object oriented design with constrains on delivery times, process precedence and resource availability. Initially, the programming algorithm (PA) was designed and implemented, taking into account all constraints mentioned. This algorithm’s main objective is, given a sequence of production orders, products and processes, calculate its total programming cost and time.
Once the programming algorithm was defined, the genetic algorithm (GA) was developed for minimizing two objectives: delivery times and total programming cost. The stages defined for this algorithm were: selection, crossover and mutation. During the first stage, the …

Go to article

Decentralized State Feedback And Near Optimal Adaptive Neural Network Control Of Interconnected Nonlinear Discrete-Time Systems, Shahab Mehraeen, Jagannathan Sarangapani, Mariesa Crow Dec 2010

Decentralized State Feedback And Near Optimal Adaptive Neural Network Control Of Interconnected Nonlinear Discrete-Time Systems, Shahab Mehraeen, Jagannathan Sarangapani, Mariesa Crow

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, first a novel decentralized state feedback stabilization controller is introduced for a class of nonlinear interconnected discrete-time systems in affine form with unknown subsystem dynamics, control gain matrix, and interconnection dynamics by employing neural networks (NNs). Subsequently, the optimal control problem of decentralized nonlinear discrete-time system is considered with unknown internal subsystem and interconnection dynamics while assuming that the control gain matrix is known. For the near optimal controller development, the direct neural dynamic programming technique is utilized to solve the Hamilton-Jacobi-Bellman (HJB) equation forward-in-time. The decentralized optimal controller design for each subsystem utilizes the critic-actor structure …

Go to article

Evaluation Of Protein Backbone Alphabets : Using Predicted Local Structure For Fold Recognition, Kyong Jin Shim Dec 2010

Evaluation Of Protein Backbone Alphabets : Using Predicted Local Structure For Fold Recognition, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

Optimally combining available information is one of the key challenges in knowledge-driven prediction techniques. In this study, we evaluate six Phi and Psi-based backbone alphabets. We show that the addition of predicted backbone conformations to SVM classifiers can improve fold recognition. Our experimental results show that the inclusion of predicted backbone conformations in our feature representation leads to higher overall accuracy compared to when using amino acid residues alone.

Go to article

Next Last