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

Physical Sciences and Mathematics Commons

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

Databases and Information Systems

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 5131 - 5160 of 6716

Full-Text Articles in Physical Sciences and Mathematics

Unsupervised Face Alignment By Robust Nonrigid Mapping, Jianke Zhu, Luc Van Gool, Steven C. H. Hoi Oct 2009

Unsupervised Face Alignment By Robust Nonrigid Mapping, Jianke Zhu, Luc Van Gool, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

We propose a novel approach to unsupervised facial image alignment. Differently from previous approaches, that are confined to affine transformations on either the entire face or separate patches, we extract a nonrigid mapping between facial images. Based on a regularized face model, we frame unsupervised face alignment into the Lucas-Kanade image registration approach. We propose a robust optimization scheme to handle appearance variations. The method is fully automatic and can cope with pose variations and expressions, all in an unsupervised manner. Experiments on a large set of images showed that the approach is effective.


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 …


Open & Mobile Equipment, Timothy J. Rowley Sep 2009

Open & Mobile Equipment, Timothy J. Rowley

Timothy J Rowley

This was a "Lightning Presentation" about making cutting edge technology available to university students.


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

Context Is Highly Contextual!, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.


Temporal Data Classification Using Linear Classifiers, Peter Revesz, Thomas Triplet Sep 2009

Temporal Data Classification Using Linear Classifiers, Peter Revesz, Thomas Triplet

CSE Conference and Workshop Papers

Data classification is usually based on measurements recorded at the same time. This paper considers temporal data classification where the input is a temporal database that describes measurements over a period of time in history while the predicted class is expected to occur in the future. We describe a new temporal classification method that improves the accuracy of standard classification methods. The benefits of the method are tested on weather forecasting using the meteorological database from the Texas Commission on Environmental Quality.


Robust Lifetime Measurement In Large-Scale P2p Systems With Non-Stationary Arrivals, Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri Loguinov Sep 2009

Robust Lifetime Measurement In Large-Scale P2p Systems With Non-Stationary Arrivals, Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri Loguinov

Computer Science Faculty Publications

Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work has shown that direct sampling of user lifetimes may lead to certain bias (arising from missed peers and round-off inconsistencies) and proposed a technique that estimates lifetimes based on sampled residuals. In this paper, however, we show that under non-stationary arrivals, which are often present in real systems, residual-based sampling does not correctly reconstruct user lifetimes and suffers a varying degree of bias, which in some cases makes estimation completely impossible. We overcome this problem using two contributions: a …


Localized Matching Using Earth Mover's Distance Towards Discovery Of Common Patterns From Small Image Samples, Hung-Khoon Tan, Chong-Wah Ngo Sep 2009

Localized Matching Using Earth Mover's Distance Towards Discovery Of Common Patterns From Small Image Samples, Hung-Khoon Tan, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper proposes a new approach for the discovery of common patterns in a small set of images by region matching. The issues in feature robustness, matching robustness and noise artifact are addressed to delve into the potential of using regions as the basic matching unit. We novelly employ the many-to-many (M2M) matching strategy, specifically with the Earth Mover's Distance (EMD), to increase resilience towards the structural inconsistency from improper region segmentation. However, the matching pattern of M2M is dispersed and unregulated in nature, leading to the challenges of mining a common pattern while identifying the underlying transformation. To avoid …


Why Quants Fail, M. Thulasidas Sep 2009

Why Quants Fail, M. Thulasidas

Research Collection School Of Computing and Information Systems

Mathematical finance is built on a couple of assumptions. The most fundamental of them is the one on ma ket efficiency. It states that the market prices every asset fairly, and that the prices contain all the information available in the market.


Visible Reverse K-Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien Lee, Ken C. K. Lee, Qing Li Sep 2009

Visible Reverse K-Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien Lee, Ken C. K. Lee, Qing Li

Research Collection School Of Computing and Information Systems

Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, etc. Previous work on RNN search does not take obstacles into consideration. In the real world, however, there are many physical obstacles (e.g., buildings) and their presence may affect the visibility between objects. In this paper, we introduce a novel variant of RNN queries, namely, visible reverse nearest neighbor (VRNN) search, which considers the impact of obstacles on the visibility of objects. Given a data set P, an obstacle set O, and a query point q in a 2D space, a VRNN …


A Latent Model For Visual Disambiguation Of Keyword-Based Image Search, Kong-Wah Wan, Ah-Hwee Tan, Joo-Hwee Lim, Liang-Tien Chia, Sujoy Roy Sep 2009

A Latent Model For Visual Disambiguation Of Keyword-Based Image Search, Kong-Wah Wan, Ah-Hwee Tan, Joo-Hwee Lim, Liang-Tien Chia, Sujoy Roy

Research Collection School Of Computing and Information Systems

The problem of polysemy in keyword-based image search arises mainly from the inherent ambiguity in user queries. We propose a latent model based approach that resolves user search ambiguity by allowing sense specific diversity in search results. Given a query keyword and the images retrieved by issuing the query to an image search engine, we first learn a latent visual sense model of these polysemous images. Next, we use Wikipedia to disambiguate the word sense of the original query, and issue these Wiki-senses as new queries to retrieve sense specific images. A sense-specific image classifier is then learnt by combining …


Self-Authentication Of Audio Signals By Chirp Coding, Jonathan Blackledge, Eugene Coyle Sep 2009

Self-Authentication Of Audio Signals By Chirp Coding, Jonathan Blackledge, Eugene Coyle

Conference papers

This paper discusses a new approach to ‘watermarking’ digital signals using linear frequency modulated or ‘chirp’ coding. The principles underlying this approach are based on the use of a matched filter to provide a reconstruction of a chirped code that is uniquely robust in the case of signals with very low signal-to-noise ratios. Chirp coding for authenticating data is generic in the sense that it can be used for a range of data types and applications (the authentication of speech and audio signals, for example). The theoretical and computational aspects of the matched filter and the properties of a chirp …


Accelerating Sequence Searching: Dimensionality Reduction Method, Guojie Song, Bin Cui, Baihua Zheng, Kunqing Xie, Dongqing Yang Sep 2009

Accelerating Sequence Searching: Dimensionality Reduction Method, Guojie Song, Bin Cui, Baihua Zheng, Kunqing Xie, Dongqing Yang

Research Collection School Of Computing and Information Systems

Similarity search over long sequence dataset becomes increasingly popular in many emerging applications, such as text retrieval, genetic sequences exploring, etc. In this paper, a novel index structure, namely Sequence Embedding Multiset tree (SEM − tree), has been proposed to speed up the searching process over long sequences. The SEM-tree is a multi-level structure where each level represents the sequence data with different compression level of multiset, and the length of multiset increases towards the leaf level which contains original sequences. The multisets, obtained using sequence embedding algorithms, have the desirable property that they do not need to keep the …


Communication-Efficient Classification In P2p Networks, Hock Hee Ang, Vivekanand Gopalkrishnan, Wee Keong Ng, Steven C. H. Hoi Sep 2009

Communication-Efficient Classification In P2p Networks, Hock Hee Ang, Vivekanand Gopalkrishnan, Wee Keong Ng, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Distributed classification aims to learn with accuracy comparable to that of centralized approaches but at far lesser communication and computation costs. By nature, P2P networks provide an excellent environment for performing a distributed classification task due to the high availability of shared resources, such as bandwidth, storage space, and rich computational power. However, learning in P2P networks is faced with many challenging issues; viz., scalability, peer dynamism, asynchronism and fault-tolerance. In this paper, we address these challenges by presenting CEMPaR—a communication-efficient framework based on cascading SVMs that exploits the characteristics of DHT-based lookup protocols. CEMPaR is designed to be robust …


Batch Mode Active Learning With Applications To Text Categorization And Image Retrieval, Steven C. H. Hoi, Rong Jin, Michael R. Lyu Sep 2009

Batch Mode Active Learning With Applications To Text Categorization And Image Retrieval, Steven C. H. Hoi, Rong Jin, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Most machine learning tasks in data classification and information retrieval require manually labeled data examples in the training stage. The goal of active learning is to select the most informative examples for manual labeling in these learning tasks. Most of the previous studies in active learning have focused on selecting a single unlabeled example in each iteration. This could be inefficient, since the classification model has to be retrained for every acquired labeled example. It is also inappropriate for the setup of information retrieval tasks where the user's relevance feedback is often provided for the top K retrieved items. In …


In-Group / Out-Group Dynamics And Effectiveness In Partially Distributed Teams, Faina Privman Aug 2009

In-Group / Out-Group Dynamics And Effectiveness In Partially Distributed Teams, Faina Privman

Dissertations

When organizations collaborate they often do so using partially distributed teams (PDTs). In a Partially Distributed Team there exist at least two distinct sub-groups. In addition, at least one of the sub-groups has two or more members that are geographically co-located. Co-located members can meet face to face; chat in the hallway; have lunch together; and otherwise socialize with one another. On the other hand, remote members must rely on technology to communicate and work together. This distinct characteristic of partially distributed teams makes them especially susceptible to the In-Group / Out Group dynamic (Huang and Ocker, 2006). This dynamic …


Design Development And Evaluation Of Collario, A Group Support System For Collaborative Scenario Creation, Xiang Yao Aug 2009

Design Development And Evaluation Of Collario, A Group Support System For Collaborative Scenario Creation, Xiang Yao

Dissertations

In the fields of Emergency Management and Business Continuity Planning, scenarios are a widely used tool for planning, training and knowledge sharing purposes. The ability to create and discuss emergency scenarios in virtual teams can lead to many potential applications, such as discussing emergency scenarios by world-wide experts, conducting on-line exercises, and creating Communities of Practices. Existing scenario creation systems, like NxMsel provided by FEMA, allow distributed groups to create scenarios together. However, collaborative support in these systems is generally limited.

This dissertation explores an innovative solution to provide various types of collaboration support around a knowledge structure and uses …


Wireless Networks: Spert: A Stateless Protocol For Energy-Sensitive Real-Time Routing For Wireless Sensor Network, Sohail Jabbar, Abid Ali Minhas, Raja Adeel Akhtar Aug 2009

Wireless Networks: Spert: A Stateless Protocol For Energy-Sensitive Real-Time Routing For Wireless Sensor Network, Sohail Jabbar, Abid Ali Minhas, Raja Adeel Akhtar

International Conference on Information and Communication Technologies

Putting constraints on performance of a system in the temporal domain, some times turns right into wrong and update into outdate. These are the scenarios where apposite value of time inveterate in the reality. But such timing precision not only requires tightly scheduled performance constraints but also requires optimal design and operation of all system components. Any malfunctioning at any relevant aspect may causes a serious disaster and even loss of human lives. Managing and interacting with such real-time system becomes much intricate when the resources are limited as in wireless sensor nodes. A wireless sensor node is typically comprises …


Application Of Ict Iii: Use Of Information And Mobile Computing Technologies In Healthcare Facilities Of Saudi Arabia, Abdul Ahad Siddiqi, Munir Ahmed, Yasser M. Alginahi, Abdulrahman Alharby Aug 2009

Application Of Ict Iii: Use Of Information And Mobile Computing Technologies In Healthcare Facilities Of Saudi Arabia, Abdul Ahad Siddiqi, Munir Ahmed, Yasser M. Alginahi, Abdulrahman Alharby

International Conference on Information and Communication Technologies

Information technology forms an important part of the healthcare solution. Accurate and up-to-date information is essential to continuous quality improvement in any organization, and particularly so in an area as complex as healthcare. Therefore, diverse information systems must be integrated across the healthcare enterprise. The knowledge base in the medical field is large, complex, and growing rapidly. It includes scientific knowledge, as well as familiarity with the day-to-day business of providing healthcare. It is crucial to identify the processes in the healthcare sector that would most benefit from the support of information technology. This study is focused on the analysis …


Networks - Ii: Overhead Analysis Of Security Implementation Using Ipsec, Muhammad Awais Azam, Zaka -Ul- Mustafa, Usman Tahir, S. M. Ahsan, Muhammad Adnan Naseem, Imran Rashid, Muhammad Adeel Aug 2009

Networks - Ii: Overhead Analysis Of Security Implementation Using Ipsec, Muhammad Awais Azam, Zaka -Ul- Mustafa, Usman Tahir, S. M. Ahsan, Muhammad Adnan Naseem, Imran Rashid, Muhammad Adeel

International Conference on Information and Communication Technologies

Authentication, access control, encryption and auditing make up the essential elements of network security. Researchers have dedicated a large amount of efforts to implement security features that fully incorporate the use of all these elements. Currently, data networks mainly provide authentication and confidentiality services. Confidentiality alone is not able to protect the system, thus, suitable security measures must be taken. However, this security is itself an overhead which must be accounted for. A trade-off must exist between performance and security. This trade-off must be carefully managed so as not to deteriorate the systems being secured. This calls for the true …


Networks - I: Investigating Access To Heterogeneous Storage Systems Using Linked Data In Unicore Grid Middleware, Roger Menday, M. Shahbaz Memon, A. Shiraz Memon, Achim Streit Aug 2009

Networks - I: Investigating Access To Heterogeneous Storage Systems Using Linked Data In Unicore Grid Middleware, Roger Menday, M. Shahbaz Memon, A. Shiraz Memon, Achim Streit

International Conference on Information and Communication Technologies

The Grid provides access to execution and storage resources - through middleware - by normalizing the access to resources. UNICORE calls this quality dasiaseamlessnesspsila. One result of this is that a request for some action at one resource can, with relative ease, be re-targeted to another, making possible the coordinated usage of multiple resources. In this paper we describe a seamless interface to heterogeneous storage systems, using the (Semantic) Web as middleware for the Grid. Data is accumulated by experiments and simulations running on execution systems, instruments and sensors, and by importing data from other locations. Storage systems are regular …


Networks - I: Collaborative 3d Digital Content Creation Exploiting A Grid Network, M. Gkion, M. Z. Patoli, A. Al-Barakati, W. Zhang, P. Newbury, M. White Aug 2009

Networks - I: Collaborative 3d Digital Content Creation Exploiting A Grid Network, M. Gkion, M. Z. Patoli, A. Al-Barakati, W. Zhang, P. Newbury, M. White

International Conference on Information and Communication Technologies

The increase in ease of the production of computer simulated graphics has opened new opportunities in the 3D industry. There are unlimited applications for the delivery of 3D Graphics especially concerning 3D multimedia presentation of digital content. Apart from aesthetic and entertaining reasons, experts apply computer simulations to visualize environments and to identify early errors or costs in order to limit the need of making real prototypes. Thus, 3D Graphics also minimize the time required for developing the final product. Existing 3D applications give partial support to users to engage in collaborative contribution for the production of a 3D model. …


End User As Application Developer For Decision Support, Shah Jahan Miah Aug 2009

End User As Application Developer For Decision Support, Shah Jahan Miah

Dr Shah Jahan Miah

This paper discusses a new generation end-user centred information service view, for developing decision support applications. The tailorable solution allows specific applications to be designed by end-users, where integrity is assured by the architecture’s control in knowledge-based systems. In the development approach, the end-users at different level engage in interaction for secondary application creation. This initiative reinforces a shift from the traditional IS development process to a new provision where end-users can actively participate for a secondary application design. A secondary application design can be seen as a secondary activity for tailoring applications by the end users so that it …


Exploiting Bilingual Information To Improve Web Search, Wei Gao, John Bitzer, Ming Zhou, Kam-Fai Wong Aug 2009

Exploiting Bilingual Information To Improve Web Search, Wei Gao, John Bitzer, Ming Zhou, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Web search quality can vary widely across languages, even for the same information need. We propose to exploit this variation in quality by learning a ranking function on bilingual queries: queries that appear in query logs for two languages but represent equivalent search interests. For a given bilingual query, along with corresponding monolingual query log and monolingual ranking, we generate a ranking on pairs of documents, one from each language. Then we learn a linear ranking function which exploits bilingual features on pairs of documents, as well as standard monolingual features. Finally, we show how to reconstruct monolingual ranking from …


Computer Assisted Diagnoses For Red Eye (Cadre), Dr. Muhammad Zubair Asghar Aug 2009

Computer Assisted Diagnoses For Red Eye (Cadre), Dr. Muhammad Zubair Asghar

Dr. Muhammad Zubair Asghar

This paper introduces an expert System (ES) named as “CADRE-Computer Assisted Diagnoses for Red Eye. Mostly the remote areas of the population are deprived of the facilities of having experts in eye disease. So it is the need of the day to store the expertise of Eye specialists in computers through using ES technology. This ES is a rule-based Expert System that assists in red-eye diagnosis and treatment. The knowledge acquired from literature review and human experts of the specific domain was used as a base for analysis, diagnosis and recommendations. CADRE evaluates the risk factors of 20 eye diseases …


An Empirical Investigation Of Filter Attribute Selection Techniques For Software Quality Classification, Kehan Gao, Taghi M. Khoshgoftaar, Huanjing Wang Aug 2009

An Empirical Investigation Of Filter Attribute Selection Techniques For Software Quality Classification, Kehan Gao, Taghi M. Khoshgoftaar, Huanjing Wang

Dr. Huanjing Wang

Attribute selection is an important activity in data preprocessing for software quality modeling and other data mining problems. The software quality models have been used to improve the fault detection process. Finding faulty components in a software system during early stages of software development process can lead to a more reliable final product and can reduce development and maintenance costs. It has been shown in some studies that prediction accuracy of the models improves when irrelevant and redundant features are removed from the original data set. In this study, we investigated four filter attribute selection techniques, Automatic Hybrid Search (AHS), …


Symphony: Enabling Search-Driven Applications, John C. Shafer, Rakesh Agrawal, Hady W. Lauw Aug 2009

Symphony: Enabling Search-Driven Applications, John C. Shafer, Rakesh Agrawal, Hady W. Lauw

Research Collection School Of Computing and Information Systems

We present the design of Symphony, a platform that enables non-developers to build and deploy a new class of search-driven applications that combine their data and domain expertise with content from search engines and other web services. The Symphony prototype has been built on top of Microsoft’s Live Search infrastructure. While Symphony naturally makes use of the customization capabilities exposed by Live Search, its distinguishing feature is the capability it provides to the application creator to combine their proprietary data and domain expertise with content obtained from Live Search. They can also integrate specialized data obtained from web services to …


A Distributed Spatial Index For Error-Prone Wireless Data Broadcast, Baihua Zheng, Wang-Chien Lee, Ken C. K. Lee, Dik Lun Lee, Min Shao Aug 2009

A Distributed Spatial Index For Error-Prone Wireless Data Broadcast, Baihua Zheng, Wang-Chien Lee, Ken C. K. Lee, Dik Lun Lee, Min Shao

Research Collection School Of Computing and Information Systems

Information is valuable to users when it is available not only at the right time but also at the right place. To support efficient location-based data access in wireless data broadcast systems, a distributed spatial index (called DSI) is presented in this paper. DSI is highly efficient because it has a linear yet fully distributed structure that naturally shares links in different search paths. DSI is very resilient to the error-prone wireless communication environment because interrupted search operations based on DSI can be resumed easily. It supports search algorithms for classical location-based queries such as window queries and kNN queries …


Multi-Task Transfer Learning For Weakly-Supervised Relation Extraction, Jing Jiang Aug 2009

Multi-Task Transfer Learning For Weakly-Supervised Relation Extraction, Jing Jiang

Research Collection School Of Computing and Information Systems

Creating labeled training data for relation extraction is expensive. In this paper, we study relation extraction in a special weakly-supervised setting when we have only a few seed instances of the target relation type we want to extract but we also have a large amount of labeled instances of other relation types. Observing that different relation types can share certain common structures, we propose to use a multi-task learning method coupled with human guidance to address this weakly-supervised relation extraction problem. The proposed framework models the commonality among different relation types through a shared weight vector, enables knowledge learned from …


Ssnetviz: A Visualization Engine For Heterogeneous Semantic Social Networks, Ee Peng Lim, Maureen Maureen, Nelman Lubis Ibrahim, Aixin Sun, Anwitaman Datta, Kuiyu Chang Aug 2009

Ssnetviz: A Visualization Engine For Heterogeneous Semantic Social Networks, Ee Peng Lim, Maureen Maureen, Nelman Lubis Ibrahim, Aixin Sun, Anwitaman Datta, Kuiyu Chang

Research Collection School Of Computing and Information Systems

SSnetViz is an ongoing research to design and implement a visualization engine for heterogeneous semantic social networks. A semantic social network is a multi-modal network that contains nodes representing di®erent types of people or object entities, and edges representing relationships among them. When multiple heterogeneous semantic social networks are to be visualized together, SSnetViz provides a suite of functions to store heterogeneous semantic social networks, to integrate them for searching and analysis. We will illustrate these functions using social networks related to terrorism research, one crafted by domain experts and another from Wikipedia.


Optimal-Location-Selection Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li Aug 2009

Optimal-Location-Selection Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li

Research Collection School Of Computing and Information Systems

This paper introduces and solves a novel type of spatial queries, namely, Optimal-Location-Selection (OLS) search, which has many applications in real life. Given a data object set D_A, a target object set D_B, a spatial region R, and a critical distance d_c in a multidimensional space, an OLS query retrieves those target objects in D_B that are outside R but have maximal optimality. Here, the optimality of a target object b \in D_B located outside R is defined as the number of the data objects from D_A that are inside R and meanwhile have their distances to b not exceeding …