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

Computer Sciences Commons

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

2009

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 271 - 300 of 1345

Full-Text Articles in Computer Sciences

Vocate: Auditory Interfaces For The Lok8 Project, John Mcgee, Charlie Cullen Oct 2009

Vocate: Auditory Interfaces For The Lok8 Project, John Mcgee, Charlie Cullen

9th. IT & T Conference

The auditory modality has a number of unique advantages over other modalities, such as a fast neural processing rate and focus-independence. As part of the LOK8 project’s aim to develop location-based services, the Vocate module will be seeking to exploit these advantages to augment the overall usability of the LOK8 interface and also to deliver scalable content in scenarios where the user may be in transit or requires focus-independence. This paper discusses these advantages and outlines three possible approaches that the Vocate module may take within the LOK8 project: speech interfaces, auditory user interfaces, and sonification.


Tracker: Indoor Positioning For The Lok8 Project, Viacheslav Filonenko, James Carswell Oct 2009

Tracker: Indoor Positioning For The Lok8 Project, Viacheslav Filonenko, James Carswell

9th. IT & T Conference

Spatial awareness is identified as a key feature of today’s mobile devices. While outdoor navigation has been accessible and broadly used for some time already with the help of GPS, indoor positioning has not yet made it into mainstream life. GPS and other GNSS systems offer accuracy of a scale different to that required for efficient indoor navigation. This research aims to investigate how a number of sensors such as a Digital Compass, Bluetooth and Accelerometer may be combined to calculate device position and orientation to perform directional querying in a spatial database. These three technologies were chosen because they …


Localizing Volumetric Motion For Action Recognition In Realistic Videos, Xiao Wu, Chong-Wah Ngo, Jintao Li, Yongdong Zhang Oct 2009

Localizing Volumetric Motion For Action Recognition In Realistic Videos, Xiao Wu, Chong-Wah Ngo, Jintao Li, Yongdong Zhang

Research Collection School Of Computing and Information Systems

This paper presents a novel motion localization approach for recognizing actions and events in real videos. Examples include StandUp and Kiss in Hollywood movies. The challenge can be attributed to the large visual and motion variations imposed by realistic action poses. Previous works mainly focus on learning from descriptors of cuboids around space time interest points (STIP) to characterize actions. The size, shape and space-time position of cuboids are fixed without considering the underlying motion dynamics. This often results in large set of fragmentized cuboids which fail to capture long-term dynamic properties of realistic actions. This paper proposes the detection …


Towards Google Challenge: Combining Contextual And Social Information For Web Video Categorization, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo Oct 2009

Towards Google Challenge: Combining Contextual And Social Information For Web Video Categorization, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Web video categorization is a fundamental task for web video search. In this paper, we explore the Google challenge from a new perspective by combing contextual and social information under the scenario of social web. The semantic meaning of text (title and tags), video relevance from related videos, and user interest induced from user videos, are integrated to robustly determine the video category. Experiments on YouTube videos demonstrate the effectiveness of the proposed solution. The performance reaches 60% improvement compared to the traditional text based classifiers.


Distance Metric Learning From Uncertain Side Information With Application To Automated Photo Tagging, Lei Wu, Steven C. H. Hoi, Rong Jin, Jianke Zhu, Nenghai Yu Oct 2009

Distance Metric Learning From Uncertain Side Information With Application To Automated Photo Tagging, Lei Wu, Steven C. H. Hoi, Rong Jin, Jianke Zhu, Nenghai Yu

Research Collection School Of Computing and Information Systems

Automated photo tagging is essential to make massive unlabeled photos searchable by text search engines. Conventional image annotation approaches, though working reasonably well on small testbeds, are either computationally expensive or inaccurate when dealing with large-scale photo tagging. Recently, with the popularity of social networking websites, we observe a massive number of user-tagged images, referred to as "social images", that are available on the web. Unlike traditional web images, social images often contain tags and other user-generated content, which offer a new opportunity to resolve some long-standing challenges in multimedia. In this work, we aim to address the challenge of …


Streaming 3d Meshes Using Spectral Geometry Images, Ying He, Boon Seng Chew, Dayong Wang, Steven C. H. Hoi, Lap Pui Chau Oct 2009

Streaming 3d Meshes Using Spectral Geometry Images, Ying He, Boon Seng Chew, Dayong Wang, Steven C. H. Hoi, Lap Pui Chau

Research Collection School Of Computing and Information Systems

The transmission of 3D models in the form of Geometry Images (GI) is an emerging and appealing concept due to the reduction in complexity from R3 to image space and wide availability of mature image processing tools and standards. However, geometry images often suffer from the artifacts and error during compression and transmission. Thus, there is a need to address the artifact reduction, error resilience and protection of such data information during the transmission across an error prone network. In this paper, we introduce a new concept, called Spectral Geometry Images (SGI), which naturally combines the powerful spectral analysis with …


Parallel Sets In The Real World: Three Case Studies, Robert Kosara, Caroline Ziemkiewicz, F. Joseph Iii Mako, Tin Seong Kam Oct 2009

Parallel Sets In The Real World: Three Case Studies, Robert Kosara, Caroline Ziemkiewicz, F. Joseph Iii Mako, Tin Seong Kam

Research Collection School Of Computing and Information Systems

Parallel Sets are a visualization technique for categorical data. We recently released an implementation to the public in an effort to make our research useful to real users. This paper presents three case studies of Parallel Sets in use with real data.


Sharing Mobile Multimedia Annotations To Support Inquiry-Based Learning Using Mobitop, Khasfariyati Razikin, Dion Hoe-Lian Goh, Yin-Leng Theng, Quang Minh Nguyen, Thi Nhu Quynh Kim, Ee Peng Lim, Chew-Hung Chang, Kalyani Chatterjea, Aixin Sun Oct 2009

Sharing Mobile Multimedia Annotations To Support Inquiry-Based Learning Using Mobitop, Khasfariyati Razikin, Dion Hoe-Lian Goh, Yin-Leng Theng, Quang Minh Nguyen, Thi Nhu Quynh Kim, Ee Peng Lim, Chew-Hung Chang, Kalyani Chatterjea, Aixin Sun

Research Collection School Of Computing and Information Systems

Mobile devices used in educational settings are usually employed within a collaborative learning activity in which learning takes place in the form of social interactions between team members while performing a shared task. We introduce MobiTOP (Mobile Tagging of Objects and People), a geospatial digital library system which allows users to contribute and share multimedia annotations via mobile devices. A key feature of MobiTOP that is well suited for collaborative learning is that annotations are hierarchical, allowing annotations to be annotated by other users to an arbitrary depth. A group of student-teachers involved in an inquiry-based learning activity in geography …


Mining Globally Distributed Frequent Subgraphs In A Single Labeled Graph, Xing Jiang, Hui Xiong, Chen Wang, Ah-Hwee Tan Oct 2009

Mining Globally Distributed Frequent Subgraphs In A Single Labeled Graph, Xing Jiang, Hui Xiong, Chen Wang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Recent years have observed increasing efforts on graph mining and many algorithms have been developed for this purpose. However, most of the existing algorithms are designed for discovering frequent subgraphs in a set of labeled graphs only. Also, the few algorithms that find frequent subgraphs in a single labeled graph typically identify subgraphs appearing regionally in the input graph. In contrast, for real-world applications, it is commonly required that the identified frequent subgraphs in a single labeled graph should also be globally distributed. This paper thus fills this crucial void by proposing a new measure, termed G-Measure, to find globally …


Distribution-Based Concept Selection For Concept-Based Video Retrieval, Juan Cao, Hongfang Jing, Chong-Wah Ngo, Yongdong Zhang Oct 2009

Distribution-Based Concept Selection For Concept-Based Video Retrieval, Juan Cao, Hongfang Jing, Chong-Wah Ngo, Yongdong Zhang

Research Collection School Of Computing and Information Systems

Query-to-concept mapping plays one of the keys to concept-based video retrieval. Conventional approaches try to find concepts that are likely to co-occur in the relevant shots from the lexical or statistical aspects. However, the high probability of co-occurrence alone cannot ensure its effectiveness to distinguish the relevant shots from the irrelevant ones. In this paper, we propose distribution-based concept selection (DBCS) for query-to-concept mapping by analyzing concept score distributions of within and between relevant and irrelevant sets. In view of the imbalance between relevant and irrelevant examples, two variants of DBCS are proposed respectively by considering the two-sided and onesided …


Secure Mobile Agents With Designated Hosts, Qi Zhang, Yi Mu, Minji Zhang, Robert H. Deng Oct 2009

Secure Mobile Agents With Designated Hosts, Qi Zhang, Yi Mu, Minji Zhang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Mobile agents often travel in a hostile environment where their security and privacy could be compromised by any party including remote hosts in which agents visit and get services. It was proposed in the literature that the host visited by an agent should jointly sign a service agreement with the agent's home, where a proxy-signing model was deployed and every host in the agent system can sign. We observe that this actually poses a serious problem in that a host that should be excluded from an underlying agent network could also send a signed service agreement. In order to solve …


Continuous Monitoring Of Spatial Queries In Wireless Broadcast Environments, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias Oct 2009

Continuous Monitoring Of Spatial Queries In Wireless Broadcast Environments, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias

Research Collection School Of Computing and Information Systems

Wireless data broadcast is a promising technique for information dissemination that leverages the computational capabilities of the mobile devices in order to enhance the scalability of the system. Under this environment, the data are continuously broadcast by the server, interleaved with some indexing information for query processing. Clients may then tune in the broadcast channel and process their queries locally without contacting the server. Previous work on spatial query processing for wireless broadcast systems has only considered snapshot queries over static data. In this paper, we propose an air indexing framework that 1) outperforms the existing (i.e., snapshot) techniques in …


A Study Of Content Authentication In Proxy-Enabled Multimedia Delivery Systems: Model, Techniques, And Applications, Robert H. Deng, Yanjiang Yang Oct 2009

A Study Of Content Authentication In Proxy-Enabled Multimedia Delivery Systems: Model, Techniques, And Applications, Robert H. Deng, Yanjiang Yang

Research Collection School Of Computing and Information Systems

Compared with the direct server-user approach, the server-proxy-user architecture for multimedia delivery promises significantly improved system scalability. The introduction of the intermediary transcoding proxies between content servers and end users in this architecture, however, brings unprecedented challenges to content security. In this article, we present a systematic study on the end-to-end content authentication problem in the server-proxy-user context, where intermediary proxies transcode multimedia content dynamically. We present a formal model for the authentication problem, propose a concrete construction for authenticating generic data modality and formally prove its security. We then apply the generic construction to authenticating specific multimedia formats, for …


Analysis Of Tradeoffs Between Buffer And Qos Requirements In Wireless Networks, Raphael Rom, Hwee-Pink Tan Oct 2009

Analysis Of Tradeoffs Between Buffer And Qos Requirements In Wireless Networks, Raphael Rom, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

In this paper, we consider the scheduling problem where data packets from K input-flows need to be delivered to K corresponding wireless receivers over a heterogeneous wireless channel. Our objective is to design a wireless scheduler that achieves good throughput and fairness performance while minimizing the buffer requirement at each wireless receiver. This is a challenging problem due to the unique characteristics of the wireless channel. We propose a novel idea of exploiting both the long-term and short-term error behavior of the wireless channel in the scheduler design. In addition to typical first-order Quality of Service (QoS) metrics such as …


A Surprise Triggered Adaptive And Reactive (Star) Framework For Online Adaptation In Non-Stationary Environments, Truong-Huy Dinh Nguyen, Tze-Yun Leong Oct 2009

A Surprise Triggered Adaptive And Reactive (Star) Framework For Online Adaptation In Non-Stationary Environments, Truong-Huy Dinh Nguyen, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

We consider the task of developing an adaptive autonomous agent that can interact with non-stationary environments. Traditional learning approaches such as Reinforcement Learning assume stationary characteristics over the course of the problem, and are therefore unable to learn the dynamically changing settings correctly. We introduce a novel adaptive framework that can detect dynamic changes due to non-stationary elements. The Surprise Triggered Adaptive and Reactive (STAR) framework is inspired by human adaptability in dealing with daily life changes. An agent adopting the STAR framework consists primarily of two components, Adapter and Reactor. The Reactor chooses suitable actions based on predictions made …


Rc-Chord: Resource Clustering In A Large-Scale Hierarchical Peer-To-Peer System, Daniel R. Karrels, Gilbert L. Peterson, Barry E. Mullins Oct 2009

Rc-Chord: Resource Clustering In A Large-Scale Hierarchical Peer-To-Peer System, Daniel R. Karrels, Gilbert L. Peterson, Barry E. Mullins

Faculty Publications

Conducting data fusion and Command and Control (C2) in large-scale systems requires more than the presently available Peer-to-Peer (P2P) technologies provide. Resource Clustered Chord (RC-Chord) is an extension to the Chord protocol that incorporates elements of a hierarchical peer-to-peer architecture to facilitate coalition formation algorithms in large-scale systems. Each cluster in this hierarchy represents a particular resource available for allocation, and RC-Chord provides the capabilities to locate agents of a particular resource. This approach improves upon other strategies by including support for abundant resources, or those resources that most or all agents in the system possess. This scenario exists in …


Dynamic Coalition Formation Under Uncertainty, Daylon J. Hooper, Gilbert L. Peterson, Brett J. Borghetti Oct 2009

Dynamic Coalition Formation Under Uncertainty, Daylon J. Hooper, Gilbert L. Peterson, Brett J. Borghetti

Faculty Publications

Coalition formation algorithms are generally not applicable to real-world robotic collectives since they lack mechanisms to handle uncertainty. Those mechanisms that do address uncertainty either deflect it by soliciting information from others or apply reinforcement learning to select an agent type from within a set. This paper presents a coalition formation mechanism that directly addresses uncertainty while allowing the agent types to fall outside of a known set. The agent types are captured through a novel agent modeling technique that handles uncertainty through a belief-based evaluation mechanism. This technique allows for uncertainty in environmental data, agent type, coalition value, and …


Uav Intelligent Path Planning For Wilderness Search And Rescue, Michael A. Goodrich, Lanny Lin Oct 2009

Uav Intelligent Path Planning For Wilderness Search And Rescue, Michael A. Goodrich, Lanny Lin

Faculty Publications

In the priority search phase of Wilderness Search and Rescue, a probability distribution map is created. Areas with higher probabilities are searched first in order to find the missing person in the shortest expected time. When using a UAV to support search, the onboard video camera should cover as much of the important areas as possible within a set time. We explore several algorithms (with and without set destination) and describe some novel techniques in solving this problem and compare their performances against typical WiSAR scenarios. This problem is NP-hard, but our algorithms yield high quality solutions that approximate the …


Livecut: Learning-Based Interactive Video Segmentation By Evaluation Of Multiple Propagated Cues, Bryan S. Morse, Brian L. Price, Scott Cohen Oct 2009

Livecut: Learning-Based Interactive Video Segmentation By Evaluation Of Multiple Propagated Cues, Bryan S. Morse, Brian L. Price, Scott Cohen

Faculty Publications

Video sequences contain many cues that may be used to segment objects in them, such as color, gradient, color adjacency, shape, temporal coherence, camera and object motion, and easily-trackable points. This paper introduces LIVEcut, a novel method for interactively selecting objects in video sequences by extracting and leveraging as much of this information as possible. Using a graph-cut optimization framework, LIVEcut propagates the selection forward frame by frame, allowing the user to correct any mistakes along the way if needed. Enhanced methods of extracting many of the features are provided. In order to use the most accurate information from the …


Versatile Reactive Navigation, Robert P. Burton, Luther A. Tychonievich, Louis P. Tychonievich Oct 2009

Versatile Reactive Navigation, Robert P. Burton, Luther A. Tychonievich, Louis P. Tychonievich

Faculty Publications

Most autonomous mobile agents operate in a highly constrained environment. Despite significant research, existing solutions are limited in their ability to handle heterogeneous constraints within highly dynamic or uncertain environments. This paper presents a novel maneuver selection technique suited for both 2D and 3D environments with highly dynamic maneuvering constraints and multiple mobile obstacles. Agents may have any arbitrary set of nonholonomic control variables; maneuvers can be constrained by a broad class of function inequalities, including time-dependent constraints involving nonlinear relationships between controlled and agent-state variables. The resulting algorithm has been implemented to run in real time using only a …


Back Matter Sep 2009

Back Matter

Journal of Digital Forensics, Security and Law

No abstract provided.


Front Matter Sep 2009

Front Matter

Journal of Digital Forensics, Security and Law

No abstract provided.


Masthead Sep 2009

Masthead

Journal of Digital Forensics, Security and Law

No abstract provided.


Quo Vadis Face Recognition: Spectral Considerations, Stefan Robila Sep 2009

Quo Vadis Face Recognition: Spectral Considerations, Stefan Robila

Department of Computer Science Faculty Scholarship and Creative Works

The paper provides novel approaches for the employment of spectral information when pursuing face recognition. We designed and tested Eigenface based algorithms that improve face recognition through feature extraction, i.e. extracting the 'best bands' according to various criteria such as decorelation and statistical independence. Eigenfaces correspond to principal components and have previously been used for regular grayscale and color images. In this paper we expand theiruse to hyperspectral imagery, i.e. data sets of images of the same scene associated to narrow wavelength intervals. Our approach is a two decomposition process. In the first, the hyperspectral data is reduced to grayscale …


Complexities Of Information Security In Cyber-Physical Power Systems, Bruce Mcmillin Sep 2009

Complexities Of Information Security In Cyber-Physical Power Systems, Bruce Mcmillin

Computer Science Faculty Research & Creative Works

Cyber-Physical Power Systems consist of significant cyber components that mange the physical electric power infrastructure under distributed control of power electronics devices. This represents a departure from more centralized SCADA-type control. NERC Critical Infrastructure Protection standards emphasize the need to protect the power infrastructure from both cyber and physical attacks. Complex interactions between the cyber and physical worlds introduce new vulnerabilities that go beyond those found in the purely computer world. in this paper, some of these new vulnerabilities are described and a direction is suggested to determine and mitigate these vulnerabilities. © 2009 IEEE.


Secure Hierarchical Data Aggregation In Wireless Sensor Networks, Julia Albath, Sanjay Madria Sep 2009

Secure Hierarchical Data Aggregation In Wireless Sensor Networks, Julia Albath, Sanjay Madria

Computer Science Faculty Research & Creative Works

Communication in wireless sensor networks uses the majority of a sensor's limited energy. using aggregation in wireless sensor network reduces the overall communication cost. Security in wireless sensor networks entails many different challenges. Traditional end-to-end security is not suitable for use with in-network aggregation. a corrupted sensor has access to the data and can falsify results. Additively homomorphic encryption allows for aggregation of encrypted values, with the result being the same as the result when unencrypted data was aggregated. using public key cryptography, digital signatures can be used to achieve integrity. We propose a new algorithm using homomorphic encryption and …


Context Is Highly Contextual!, Amit P. Sheth Sep 2009

Context Is Highly Contextual!, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.


Motion Analysis Of Fluid Flow In A Spinning Disk Reactor, Valentina N. Korzhova Sep 2009

Motion Analysis Of Fluid Flow In A Spinning Disk Reactor, Valentina N. Korzhova

USF Tampa Graduate Theses and Dissertations

The flow of a liquid film over a rapidly rotating horizontal disk has numerous industrial applications including pharmaceuticals, chemical engineering, bioengineering, etc. The analysis and control of complex fluid flows over a rapidly rotating horizontal disk is an important issue in the experimental fluid mechanics. The spinning disk reactor exploits the benefits of centrifugal force, which produces thin highly sheared films due to radial acceleration. The hydrodynamics of the film results in excellent fluid mixing and high heat or mass transfer rates.

This work focuses on developing a novel approach for fluid flow tracking and analysis. Specifically, the developed algorithm …


Networks - Ii: Optimal Fractional Frequency Reuse (Ffr) And Resource Allocation In Multiuser Ofdma System, Naveed Ul Hassan, Mohamad Assaad Sep 2009

Networks - Ii: Optimal Fractional Frequency Reuse (Ffr) And Resource Allocation In Multiuser Ofdma System, Naveed Ul Hassan, Mohamad Assaad

International Conference on Information and Communication Technologies

In this paper we determine the optimal fractional frequency reuse (FFR) and resource allocation in OFDMA system. Since the users at the cell edge are more exposed to inter-cell interference therefore each cell is partitioned into two regions; inner region and outer region. We determine the optimal FFR factor for the outer region, bandwidth assigned to each region and subcarrier and power allocation to all the users in the cell. The problem is formulated as sum-power minimization problem subject to minimum rate constraints in both the regions. This is a mixed linear integer programming problem which is relaxed into a …


Guided Testing For Automatic Error Discovery In Concurrent Software, Neha Shyam Rungta Sep 2009

Guided Testing For Automatic Error Discovery In Concurrent Software, Neha Shyam Rungta

Theses and Dissertations

The quality and reliability of software systems, in terms of their functional correctness, critically relies on the effectiveness of the testing tools and techniques to detect errors in the system before deployment. A lack of testing tools for concurrent programs that systematically control thread scheduling choices has not allowed concurrent software development to keep abreast with hardware trends of multi-core and multi-processor technologies. This motivates a need for the development of systematic testing techniques that detect errors in concurrent programs. The work in this dissertation presents a potentially scalable technique that can be used to detect concurrency errors in production …