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

Computer Sciences Commons™

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

2006

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 361 - 390 of 1262

Full-Text Articles in Computer Sciences

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt Jul 2006

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt

Computer Science & Engineering Syllabi

This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics).

Go to article

Ceg 260-01: Digital Computer Hardware, Travis E. Doom Jul 2006

Ceg 260-01: Digital Computer Hardware, Travis E. Doom

Computer Science & Engineering Syllabi

Digital Computer Hardware. Topics include switching algebra and switching functions, logic design of combinational and sequential circuits using TTL, combinational logic design with MSI and LSI, busing, storage elements, and instrumentation. 3 hours lecture, 2 hours lab. Prerequisite: CS 241.

Go to article

Ceg 333-01: Introduction To Unix, Eric Maston Jul 2006

Ceg 333-01: Introduction To Unix, Eric Maston

Computer Science & Engineering Syllabi

Introduction to the use of UNIX and UNIX tools as a computing environment. Emphasis on the shell, files and directories, editing files, user process management, compiling, debugging and other tools such as document development.

Go to article

Cs 240: Computer Science - I, Ronald F. Taylor Jul 2006

Cs 240: Computer Science - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. For CS/CEG majors with familiarity of a high-level programming language. Prerequisite: MTH 130 (Precalculus) or MPL 5. 4 credit hours.

Go to article

A Framework For Developing Wireless Mobile Online Applications, Chong-Wei Xu Jul 2006

A Framework For Developing Wireless Mobile Online Applications, Chong-Wei Xu

Faculty Articles

Online applications based on the HTTP protocol are shifting from wired networks, known as Web applications and Web services, to wireless networks, known as wireless mobile online applications, due to the rapid growth of mobile devices, such as Personal Digital Assistants and cell phones. Among the enabling technologies, J2ME is the dominant and the most potential one for building up these wireless mobile online applications. This paper presents a framework that makes the modeling, implementation, and maintenance of wireless mobile online applications intuitive and easy, especially for students and beginners.

Go to article

Boundary Fragment Matching And Articulated Pose Under Occlusion, Nicholas Howe Jul 2006

Boundary Fragment Matching And Articulated Pose Under Occlusion, Nicholas Howe

Computer Science: Faculty Publications

Silhouette recognition can reconstruct the three-dimensional pose of a human subject in monocular video so long as the camera’s view remains unoccluded by other objects. This paper develops a shape representation that can describe and compare partial shapes, extending the silhouette recognition technique to apply to video with occlusions. The new method operates without human intervention, and experiments demonstrate that it can reconstruct accurate three-dimensional articulated pose tracks from single-camera walking video despite occlusion of one-third to one-half of the subject.

Go to article

Image Interpolation By Two-Dimensional Parametric Cubic Convolution, Jiazheng Shi, Stephen E. Reichenbach Jul 2006

Image Interpolation By Two-Dimensional Parametric Cubic Convolution, Jiazheng Shi, Stephen E. Reichenbach

School of Computing: Faculty Publications

Cubic convolution is a popular method for image interpolation. Traditionally, the piecewise-cubic kernel has been derived in one dimension with one parameter and applied to two-dimensional (2-D) images in a separable fashion. However, images typically are statistically nonseparable, which motivates this investigation of nonseparable cubic convolution. This paper derives two new nonseparable, 2-D cubic-convolution kernels. The first kernel, with three parameters (designated 2D-3PCC), is the most general 2-D, piecewise-cubic interpolator defined on [-2, 2] x [-2, 2] with constraints for biaxial symmetry, diagonal (or 90 rotational) symmetry, continuity, and smoothness. The second kernel, with five parameters (designated 2D-5PCC), relaxes the …

Go to article

Private Information Retrieval Using Trusted Hardware, Shuhong Wang, Xuhua Ding, Robert H. Deng, Feng Bao Jul 2006

Private Information Retrieval Using Trusted Hardware, Shuhong Wang, Xuhua Ding, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

Many theoretical PIR (Private Information Retrieval) constructions have been proposed in the past years. Though information theoretically secure, most of them are impractical to deploy due to the prohibitively high communication and computation complexity. The recent trend in outsourcing databases fuels the research on practical PIR schemes. In this paper, we propose a new PIR system by making use of trusted hardware. Our system is proven to be information theoretically secure. Furthermore, we derive the computation complexity lower bound for hardware-based PIR schemes and show that our construction meets the lower bounds for both the communication and computation costs, respectively.

Go to article

Factored Mdp Elicitation And Plan Display, Krol Kevin Mathias, Casey Lengacher, Derek Williams, Austin Cornett, Alex Dekhtyar, Judy Goldsmith Jul 2006

Factored Mdp Elicitation And Plan Display, Krol Kevin Mathias, Casey Lengacher, Derek Williams, Austin Cornett, Alex Dekhtyar, Judy Goldsmith

Computer Science and Software Engineering

The software suite we will demonstrate at AAAI ’06 was designed around planning with factored Markov decision processes (MDPs). It is a user-friendly suite that facilitates domain elicitation, preference elicitation, planning, and MDP policy display. The demo will concentrate on user interactions for domain experts and those for whom plans are made.

Go to article

Crossing The Chasm: The Xid Technologies Story, Arcot Desai Narasimhalu, Roberto Mariani Jul 2006

Crossing The Chasm: The Xid Technologies Story, Arcot Desai Narasimhalu, Roberto Mariani

Research Collection School Of Computing and Information Systems

XID Technologies is a face processing start up company built initially around a disruptive face recognition technology. The technology innovation came from Kent Ridge Digital Labs, a publicly funded software research laboratory in Singapore. Face recognition is the least intrusive and harmless among the various biometric solutions available in the market. The basic approach to human face recognition is to identify a robust feature set that was unique enough to differentiate amongst the many millions of human faces that the system was required to verify. The technology innovation used by XID framed the problem differently and thereby overcame the challenges …

Go to article

Hierarchical Hidden Markov Model For Rushes Structuring And Indexing, Chong-Wah Ngo, Zailiang Pan, Xiaoyong Wei Jul 2006

Hierarchical Hidden Markov Model For Rushes Structuring And Indexing, Chong-Wah Ngo, Zailiang Pan, Xiaoyong Wei

Research Collection School Of Computing and Information Systems

Rushes footage are considered as cheap gold mine with the potential for reuse in broadcasting and filmmaking industries. However, it is difficult to mine the "gold" from the rushes since usually only minimum metadata is available. This paper focuses on the structuring and indexing of the rushes to facilitate mining and retrieval of "gold". We present a new approach for rushes structuring and indexing based on motion feature. We model the problem by a two-level Hierarchical Hidden Markov Model (HHMM). The HHMM, on one hand, represents the semantic concepts in its higher level to provide simultaneous structuring and indexing, on …

Go to article

Generalized On-Demand Service Architecture For Interactive Applications [Us 2006/0168107 A1], Rajesh K. Balan, Paul C. Castro, Maria R. Ebling, Archan Misra Jul 2006

Generalized On-Demand Service Architecture For Interactive Applications [Us 2006/0168107 A1], Rajesh K. Balan, Paul C. Castro, Maria R. Ebling, Archan Misra

Research Collection School Of Computing and Information Systems

A method, system, and computer program for executing a network-based distributed application. An infrastructure is described that includes application containers configured to execute an application instance of the distributed application and measure quality of service metrics for the application instance. Workload management elements form a decentralized workload management layer. The workload management layer is configured to assign a workload to application containers based on the quality of service metrics received by the application containers.

Go to article

Learning Quantum Operators From Quantum State Pairs, Neil Toronto, Dan A. Ventura Jul 2006

Learning Quantum Operators From Quantum State Pairs, Neil Toronto, Dan A. Ventura

Faculty Publications

Developing quantum algorithms has proven to be very difficult. In this paper, the concept of using classical machine learning techniques to derive quantum operators from examples is presented. A gradient descent algorithm for learning unitary operators from quantum state pairs is developed as a starting point to aid in developing quantum algorithms. The algorithm is used to learn the quantum Fourier transform, an underconstrained two-bit function, and Grover’s iterate.

Go to article

Extraction Of Coherent Relevant Passages Using Hidden Markov Models, Jing Jiang, Chengxiang Zhai Jul 2006

Extraction Of Coherent Relevant Passages Using Hidden Markov Models, Jing Jiang, Chengxiang Zhai

Research Collection School Of Computing and Information Systems

In information retrieval, retrieving relevant passages, as opposed to whole documents, not only directly benefits the end user by filtering out the irrelevant information within a long relevant document, but also improves retrieval accuracy in general. A critical problem in passage retrieval is to extract coherent relevant passages accurately from a document, which we refer to as passage extraction. While much work has been done on passage retrieval, the passage extraction problem has not been seriously studied. Most existing work tends to rely on presegmenting documents into fixed-length passages which are unlikely optimal because the length of a relevant passage …

Go to article

Authenticating Multi-Dimensional Query Results In Data Publishing, Weiwei Cheng, Hwee Hwa Pang, Kian-Lee Tan Jul 2006

Authenticating Multi-Dimensional Query Results In Data Publishing, Weiwei Cheng, Hwee Hwa Pang, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

In data publishing, the owner delegates the role of satisfying user queries to a third-party publisher. As the publisher may be untrusted or susceptible to attacks, it could produce incorrect query results. This paper introduces a mechanism for users to verify that their query answers on a multi-dimensional dataset are correct, in the sense of being complete (i.e., no qualifying data points are omitted) and authentic (i.e., all the result values originated from the owner). Our approach is to add authentication information into a spatial data structure, by constructing certified chains on the points within each partition, as well as …

Go to article

Autonomic Management Of Stream Processing Applications Via Adaptive Bandwidth Control, Dimitrios Pendarakis, Jeremy Silber, Laura Wynter Jul 2006

Autonomic Management Of Stream Processing Applications Via Adaptive Bandwidth Control, Dimitrios Pendarakis, Jeremy Silber, Laura Wynter

Research Collection School Of Computing and Information Systems

We present a novel autonomic control system for high performance stream processing systems. The system uses bandwidth controls on incoming or outgoing streams to achieve a desired resource utilization balance among a set of concurrently executing stream processing tasks. We show that CPU prioritization and allocation mechanisms in schedulers and virtual machine managers are not sufficient to control such I/O-centric applications, and present an autonomic bandwidth control system that adaptively adjusts incoming and outgoing traffic rates to achieve system management goals. The system dynamically learns the bandwidth rate necessary to meet the system management goals using stochastic nonlinear optimization, and …

Go to article

Ontosearch: A Full-Text Search Engine For The Semantic Web, Xing Jiang, Ah-Hwee Tan Jul 2006

Ontosearch: A Full-Text Search Engine For The Semantic Web, Xing Jiang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

OntoSearch, a full-text search engine that exploits ontological knowledge for document retrieval, is presented in this paper. Different from other ontology based search engines, OntoSearch does not require a user to specify the associated concepts of his/her queries. Domain ontology in OntoSearch is in the form of a semantic network. Given a keyword based query, OntoSearch infers the related concepts through a spreading activation process in the domain ontology. To provide personalized information access, we further develop algorithms to learn and exploit user ontology model based on a customized view of the domain ontology. The proposed system has been applied …

Go to article

Keyframe Retrieval By Keypoints: Can Point-To-Point Matching Help?, Wanlei Zhao, Yu-Gang Jiang, Chong-Wah Ngo Jul 2006

Keyframe Retrieval By Keypoints: Can Point-To-Point Matching Help?, Wanlei Zhao, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Bag-of-words representation with visual keypoints has recently emerged as an attractive approach for video search. In this paper, we study the degree of improvement when point-to-point (P2P) constraint is imposed on the bag-of-words. We conduct investigation on two tasks: near-duplicate keyframe (NDK) retrieval, and high-level concept classification, covering parts of TRECVID 2003 and 2005 datasets. In P2P matching, we propose a one-to-one symmetric keypoint matching strategy to diminish the noise effect during keyframe comparison. In addition, a new multi-dimensional index structure is proposed to speed up the matching process with keypoint filtering. Through experiments, we demonstrate that P2P constraint can …

Go to article

Prediction-Based Gesture Detection In Lecture Videos By Combining Visual, Speech And Electronic Slides, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong Jul 2006

Prediction-Based Gesture Detection In Lecture Videos By Combining Visual, Speech And Electronic Slides, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong

Research Collection School Of Computing and Information Systems

This paper presents an efficient algorithm for gesture detection in lecture videos by combining visual, speech and electronic slides. Besides accuracy, response time is also considered to cope with the efficiency requirements of real-time applications. Candidate gestures are first detected by visual cue. Then we modifity HMM models for complete gestures to predict and recognize incomplete gestures before the whole gestures paths are observed. Gesture recognition is used to verify the results of gesture detection. The relations between visual, speech and slides are analyzed. The correspondence between speech and gesture is employed to improve the accuracy and the responsiveness of …

Go to article

Mobile Healthcare Informatics, Keng Siau, Zixing Shen Jul 2006

Mobile Healthcare Informatics, Keng Siau, Zixing Shen

Research Collection School Of Computing and Information Systems

Advances in wireless technology give pace to the rapid development of mobile applications. The coming mobile revolution will bring dramatic and fundamental changes to our daily life. It will influence the way we live, the way we do things, and the way we take care of our health. For the healthcare industry, mobile applications provide a new frontier in offering better care and services to patients, and a more flexible and mobile way of communicating with suppliers and patients. Mobile applications will provide important real time data for patients, physicians, insurers, and suppliers. In addition, it will revolutionalize the way …

Go to article

Learning A Rendezvous Task With Dynamic Joint Action Perception, Nancy Fulda, Dan A. Ventura Jul 2006

Learning A Rendezvous Task With Dynamic Joint Action Perception, Nancy Fulda, Dan A. Ventura

Faculty Publications

Groups of reinforcement learning agents interacting in a common environment often fail to learn optimal behaviors. Poor performance is particularly common in environments where agents must coordinate with each other to receive rewards and where failed coordination attempts are penalized. This paper studies the effectiveness of the Dynamic Joint Action Perception (DJAP) algorithm on a grid-world rendezvous task with this characteristic. The effects of learning rate, exploration strategy, and training time on algorithm effectiveness are discussed. An analysis of the types of tasks for which DJAP learning is appropriate is also presented.

Go to article

Preparing More Effective Liquid State Machines Using Hebbian Learning, David Norton, Dan A. Ventura Jul 2006

Preparing More Effective Liquid State Machines Using Hebbian Learning, David Norton, Dan A. Ventura

Faculty Publications

In Liquid State Machines, separation is a critical attribute of the liquid—which is traditionally not trained. The effects of using Hebbian learning in the liquid to improve separation are investigated in this paper. When presented with random input, Hebbian learning does not dramatically change separation. However, Hebbian learning does improve separation when presented with real-world speech data.

Go to article

An Operational Model For Mobile Sensor Cloud Management, Indrajeet Kalyankar Jul 2006

An Operational Model For Mobile Sensor Cloud Management, Indrajeet Kalyankar

Electrical & Computer Engineering Theses & Dissertations

Mobile sensors provide a safe, cost effective method for gathering information in hazardous environments. When the hazardous environment is either unexplored, such as the surface of Mars, or unanticipated, such as the result of chemical contamination, it is desirable for a system to gather information with a minimal amount of outside control (localization, decision control, etc.) and prepositioned sensors. If one takes a look at the number of the sensors deployed on a scale, at the lower end is the sole, multipurpose sensor unit. The upper end deals with hordes of inexpensive, expendable sensors. In the middle, a cluster of …

Go to article

Spatiotemporal Pattern Recognition Via Liquid State Machines, Eric Goodman, Dan A. Ventura Jul 2006

Spatiotemporal Pattern Recognition Via Liquid State Machines, Eric Goodman, Dan A. Ventura

Faculty Publications

The applicability of complex networks of spiking neurons as a general purpose machine learning technique remains open. Building on previous work using macroscopic exploration of the parameter space of an (artificial) neural microcircuit, we investigate the possibility of using a liquid state machine to solve two real-world problems: stockpile surveillance signal alignment and spoken phoneme recognition.

Go to article

Back Matter Jun 2006

Back Matter

Journal of Digital Forensics, Security and Law

No abstract provided.

Go to article

Front Matter Jun 2006

Front Matter

Journal of Digital Forensics, Security and Law

No abstract provided.

Go to article

Masthead Jun 2006

Masthead

Journal of Digital Forensics, Security and Law

No abstract provided.

Go to article

Brand X, A Cross-Layer Architecture For Quality Of Transport (Qot), Gregory Arthur De Hart Jun 2006

Brand X, A Cross-Layer Architecture For Quality Of Transport (Qot), Gregory Arthur De Hart

Theses and Dissertations

Computing devices are commonly equipped with multiple transport technologies such as IrDA, Bluetooth and WiFi. Transport switching technologies, such as Quality of Transport (QoT), take advantage of this heterogeneity to keep network sessions active as users move in and out of range of various transports or as the networking environment changes. Autonomous transport switching technologies rely on information regarding current network status and the ambient wireless environment in order to make intelligent decisions. This thesis proposes Brand X, a cross-layer architecture designed for a QoT environment to provide timely and accurate environment information in order to facilitate autonomous transport switching. …

Go to article

Socio-Economic Impacts Of Computer Viruses In Tanzania, M Victor Jun 2006

Socio-Economic Impacts Of Computer Viruses In Tanzania, M Victor

Tanzania Journal of Engineering and Technology (TJET)

This paper reports on a research project conducted with an objective of identifying and assessing various approaches used by different computer users (Management, System Administrators and end users) in Tanzania to combat computer viruses (CVs), and to assess users' awareness level on CVs. Specifically, the study aimed at assessing the awareness level on CVs to the Tanzanian business community; analyze the socio -economic impact caused by CVs in Tanzania and; assess existing methods, capacity and limitations on controlling CVs in Tanzania. Data was collected using both questionnaires and interview from financial institutions such as NBC and BOT, and telecommunications sector …

Go to article

A Dynamic Attribute-Based Load Shedding And Data Recovery Scheme For Data Stream Management Systems, Amit Ahuja Jun 2006

A Dynamic Attribute-Based Load Shedding And Data Recovery Scheme For Data Stream Management Systems, Amit Ahuja

Theses and Dissertations

Data streams being transmitted over a network channel with capacity less than the data rate of the data streams is very common when using network channels such as dial-up, low bandwidth wireless links. Not only does this lower capacity creates delays but also causes sequential network problems such as packet losses, network congestion, errors in data packets giving rise to other problems and creating a cycle of problems hard to break out from. In this thesis, we present a new approach for shedding the less informative attribute data from a data stream with a fixed schema to maintain a data …

Go to article

First Prev Next Last