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 4861 - 4890 of 6726

Full-Text Articles in Physical Sciences and Mathematics

An Online Versions Of Hyperlinked-Induced Topics Search (Hits) Algorithm, Amith Kollam Chandranna Dec 2010

An Online Versions Of Hyperlinked-Induced Topics Search (Hits) Algorithm, Amith Kollam Chandranna

Master's Projects

Generally, search engines perform the ranking of web pages in an offline mode, which is after the web pages have been retrieved and stored in the database. The existing HITS algorithm (Kleinberg, 1996) operates in an offline mode to perform page rank calculation. In this project, we have implemented an online mode of page ranking for this algorithm. This will improve the overall performance of the Search Engine. This report describes the approach used to implement and test this algorithm. Comparison results performed against other existing search engines are also presented in this report. This is helpful in describing the …

Go to article

Putting Artists On The Map: A Five Part Study Of Greater Cleveland Artists' Location Decisions - Part 2: Profiles Of Artist Neighborhoods, Mark Salling, Gregory Soltis, Charles Post, Sharon Bliss, Ellen Cyran Nov 2010

Putting Artists On The Map: A Five Part Study Of Greater Cleveland Artists' Location Decisions - Part 2: Profiles Of Artist Neighborhoods, Mark Salling, Gregory Soltis, Charles Post, Sharon Bliss, Ellen Cyran

All Maxine Goodman Levin School of Urban Affairs Publications

A series of reports detailing the residential and work space location preferences of Cuyahoga county's artists.

Go to article

Information Leakage Through Online Social Networking: Opening The Doorway For Advanced Persistence Threats, Nurul Nuha Abdul Molok, Shanton Chang, Atif Ahmad Nov 2010

Information Leakage Through Online Social Networking: Opening The Doorway For Advanced Persistence Threats, Nurul Nuha Abdul Molok, Shanton Chang, Atif Ahmad

Australian Information Security Management Conference

The explosion of online social networking (OSN) in recent years has caused damages to organisations due to leakage of information by their employees. Employees’ social networking behaviour, whether accidental or intentional, provides an opportunity for advanced persistent threats (APT) attackers to realise their social engineering techniques and undetectable zero-day exploits. APT attackers use a spear-phishing method that targeted on key employees of victim organisations through social media in order to conduct reconnaissance and theft of confidential proprietary information. This conceptual paper posits OSN as the most challenging channel of information leakage and provides an explanation about the underlying factors of …

Go to article

Flexible Bootstrapping-Based Ontology Alignment, Prateek Jain, Pascal Hitzler, Amit P. Sheth Nov 2010

Flexible Bootstrapping-Based Ontology Alignment, Prateek Jain, Pascal Hitzler, Amit P. Sheth

Kno.e.sis Publications

BLOOMS (Jain et al, ISWC2010) is an ontology alignment system which, in its core, utilizes the Wikipedia category hierarchy for establishing alignments. In this paper, we present a Plug-and-Play extension to BLOOMS, which allows to flexibly replace or complement the use of Wikipedia by other online or offline resources, including domain-specific ontologies or taxonomies. By making use of automated translation services and of Wikipedia in languages other than English, it makes it possible to apply BLOOMS to alignment tasks where the input ontologies are written in different languages.

Go to article

Ontology Alignment For Linked Open Data, Prateek Jain, Pascal Hitzler, Amit P. Sheth, Kunal Verma, Peter Z. Yeh Nov 2010

Ontology Alignment For Linked Open Data, Prateek Jain, Pascal Hitzler, Amit P. Sheth, Kunal Verma, Peter Z. Yeh

Kno.e.sis Publications

The Web of Data currently coming into existence through the Linked Open Data (LOD) effort is a major milestone in realizing the Semantic Web vision. However, the development of applications based on LOD faces difficulties due to the fact that the different LOD datasets are rather loosely connected pieces of information. In particular, links between LOD datasets are almost exclusively on the level of instances, and schema-level information is being ignored. In this paper, we therefore present a system for finding schema-level links between LOD datasets in the sense of ontology alignment. Our system, called BLOOMS, is based on the …

Go to article

Vireo At Trecvid 2010: Semantic Indexing, Known-Item Search, And Content-Based Copy Detection, Chong-Wah Ngo, Shi-Ai Zhu, Hung-Khoon Tan, Wan-Lei Zhao Nov 2010

Vireo At Trecvid 2010: Semantic Indexing, Known-Item Search, And Content-Based Copy Detection, Chong-Wah Ngo, Shi-Ai Zhu, Hung-Khoon Tan, Wan-Lei Zhao

Research Collection School Of Computing and Information Systems

This paper presents our approaches and the comparative analysis of our results for the three TRECVID 2010 tasks that we participated in: semantic indexing, known-item search and content-based copy detection.

Go to article

Smu-Sis At Tac 2010 - Kbp Track Entity Linking, Swapna Gottipati, Jing Jiang Nov 2010

Smu-Sis At Tac 2010 - Kbp Track Entity Linking, Swapna Gottipati, Jing Jiang

Research Collection School Of Computing and Information Systems

Entity linking task is a process of linking the named entity within the unstructured text to the entity in the Knowledge Base. Entity liking to the relevant knowledge is useful in various information extraction and natural language processing applications that improve the user experiences such as search, summarization and so on. We propose the two way entity linking approach to reformulate query, disambiguate the entity and link to the relevant KB repository. This paper describes the details of our participation in TAC 2010 - Knowledge Base Population track. We provided an innovative approach to disambiguate the entity by query reformulation …

Go to article

Going Mobile: Launching A Mobile Website And Other Mobile Resources, Elizabeth Palena Hall, Alexandra Gomes, Laura E. Abate, Paul Levett, Morgan Wilcoxson, Steven W. Brown, Jolinda Thompson, John B. Lopez, Velda Jones Oct 2010

Going Mobile: Launching A Mobile Website And Other Mobile Resources, Elizabeth Palena Hall, Alexandra Gomes, Laura E. Abate, Paul Levett, Morgan Wilcoxson, Steven W. Brown, Jolinda Thompson, John B. Lopez, Velda Jones

Himmelfarb Library Faculty Posters and Presentations

In spring 2010, the staff of Himmelfarb Health Sciences Library met to discuss ideas for a mobile web page and review ways to reach out to users in the mobile environment. By fall 2010, the library launched a mobile website and LibGuide, including drop-in help sessions provided for students. This poster presentation is an overview of the mobile support that the library currently provides to users.

Go to article

Detecting Product Review Spammers Using Rating Behaviors, Ee Peng Lim, Viet-An Nguyen, Nitin Jindal, Bing Liu, Hady Wirawan Lauw Oct 2010

Detecting Product Review Spammers Using Rating Behaviors, Ee Peng Lim, Viet-An Nguyen, Nitin Jindal, Bing Liu, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

This paper aims to detect users generating spam reviews or review spammers. We identify several characteristic be- haviors of review spammers and model these behaviors so as to detect the spammers. In particular, we seek to model the following behaviors. First, spammers may target specific products or product groups in order to maximize their im- pact. Second, they tend to deviate from the other reviewers in their ratings of products. We propose scoring methods to measure the degree of spam for each reviewer and apply them on an Amazon review dataset. We then select a sub- set of highly suspicious …

Go to article

The Mississippi Digital Library’S Civil Rights Thesaurus: An Evolving Authority Control Tool For Civil Rights-Related Headings In Metadata Records, Kathleen L. Wells Oct 2010

The Mississippi Digital Library’S Civil Rights Thesaurus: An Evolving Authority Control Tool For Civil Rights-Related Headings In Metadata Records, Kathleen L. Wells

The Southeastern Librarian

The online Civil Rights Thesaurus (CRT) at the University of Southern Mississippi (USM) had its beginnings in the digitization of civil rights materials in the university’s McCain Library and Archives in the early 2000s. The materials included oral history interviews, letters, newspaper clippings, photographs, and other items from the rich history of the civil rights movement in Mississippi, including materials from the Freedom Summer of 1964. In addition to the creation of digitized images, making these materials available online as the Civil Rights in Mississippi Digital Archive included the formulation of descriptive records using Dublin Core metadata and the development …

Go to article

Program Transformations For Information Personalization, Saverio Perugini, Naren Ramakrishnan Oct 2010

Program Transformations For Information Personalization, Saverio Perugini, Naren Ramakrishnan

Computer Science Faculty Publications

Personalization constitutes the mechanisms necessary to automatically customize information content, structure, and presentation to the end user to reduce information overload. Unlike traditional approaches to personalization, the central theme of our approach is to model a website as a program and conduct website transformation for personalization by program transformation (e.g., partial evaluation, program slicing). The goal of this paper is study personalization through a program transformation lens and develop a formal model, based on program transformations, for personalized interaction with hierarchical hypermedia. The specific research issues addressed involve identifying and developing program representations and transformations suitable for classes of hierarchical …

Go to article

Rich Internet Geoweb For Spatial Data Infrastructure, Tin Seong Kam Oct 2010

Rich Internet Geoweb For Spatial Data Infrastructure, Tin Seong Kam

Research Collection School Of Computing and Information Systems

In this information age, more and more public statistical data such as population census, household living, local economy and business establishment are distributed over the internet within the framework of spatial data infrastructure. By and large, these data are organized geographically such as region, province as well as district. Usually, they are published in the form of digital maps over the internet as simple points, lines and polygons markers limited or no analytical function available to transform these data into useful information. To meet the analytical needs of casual public data users, we contribute RIGVAT, a rich internet geospatial visual …

Go to article

Trajectory-Based Visualization Of Web Video Topics, Juan Cao, Chong-Wah Ngo, Yong-Dong Zhang, Dong-Ming Zhang, Liang Ma Oct 2010

Trajectory-Based Visualization Of Web Video Topics, Juan Cao, Chong-Wah Ngo, Yong-Dong Zhang, Dong-Ming Zhang, Liang Ma

Research Collection School Of Computing and Information Systems

While there have been research efforts in organizing largescale web videos into topics, efficient browsing of web video topics remains a challenging problem not yet addressed. The related issues include how to efficiently browse and track the evolution of topics and eventually locate the videos of interest. In this paper, we introduce a novel interface for visualizing video topics as evolution trajectories. The trajectory visualization is capable of highlighting milestone events and depicting the topical hotness over time. The interface also allows multi-level browsing from topics to events and to videos, resulting in search exploration could be more efficiently conducted …

Go to article

Modeling 3d Facial Expressions Using Geometry Videos, Jiazhi Xia, Ying He, Dao T. P. Quynh, Xiaoming Chen, Steven C. H. Hoi Oct 2010

Modeling 3d Facial Expressions Using Geometry Videos, Jiazhi Xia, Ying He, Dao T. P. Quynh, Xiaoming Chen, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

The significant advances in developing high-speed shape acquisition devices make it possible to capture the moving and deforming objects at video speeds. However, due to its complicated nature, it is technically challenging to effectively model and store the captured motion data. In this paper, we present a set of algorithms to construct geometry videos for 3D facial expressions, including hole filling, geodesic-based face segmentation, and expression-invariant parametrization. Our algorithms are efficient and robust, and can guarantee the exact correspondence of the salient features (eyes, mouth and nose). Geometry video naturally bridges the 3D motion data and 2D video, and provides …

Go to article

Wsm'10: Second Acm Workshop On Social Media, Susanne Boll, Steven C. H. Hoi, Roelof Van Zwol, Jiebo Luo Oct 2010

Wsm'10: Second Acm Workshop On Social Media, Susanne Boll, Steven C. H. Hoi, Roelof Van Zwol, Jiebo Luo

Research Collection School Of Computing and Information Systems

The ACM SIGMM International Workshop on Social Media (WSM'10) is the second workshop held in conjunction with the ACM International Multimedia Conference (MM'10) at Firenze, Italy, 2010. This workshop provides a forum for researchers and practitioners from all over the world to share information on their latest investigations on social media analysis, exploration, search, mining, and emerging new social media applications.

Go to article

Mining Interesting Link Formation Rules In Social Networks, Cane Wing-Ki Leung, Ee Peng Lim, David Lo, Jianshu Weng Oct 2010

Mining Interesting Link Formation Rules In Social Networks, Cane Wing-Ki Leung, Ee Peng Lim, David Lo, Jianshu Weng

Research Collection School Of Computing and Information Systems

Link structures are important patterns one looks out for when modeling and analyzing social networks. In this paper, we propose the task of mining interesting Link Formation rules (LF-rules) containing link structures known as Link Formation patterns (LF-patterns). LF-patterns capture various dyadic and/or triadic structures among groups of nodes, while LF-rules capture the formation of a new link from a focal node to another node as a postcondition of existing connections between the two nodes. We devise a novel LF-rule mining algorithm, known as LFR-Miner, based on frequent subgraph mining for our task. In addition to using a support-confidence framework …

Go to article

Finding Unusual Review Patterns Using Unexpected Rules, Nitin Jindal, Bing Liu, Ee Peng Lim Oct 2010

Finding Unusual Review Patterns Using Unexpected Rules, Nitin Jindal, Bing Liu, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In recent years, opinion mining attracted a great deal of research attention. However, limited work has been done on detecting opinion spam (or fake reviews). The problem is analogous to spam in Web search [1, 9 11]. However, review spam is harder to detect because it is very hard, if not impossible, to recognize fake reviews by manually reading them [2]. This paper deals with a restricted problem, i.e., identifying unusual review patterns which can represent suspicious behaviors of reviewers. We formulate the problem as finding unexpected rules. The technique is domain independent. Using the technique, we analyzed an Amazon.com …

Go to article

Cast2face: Character Identification In Movie With Actor-Character Correspondence, Mengdi Xu, Xiaotong Yuan, Jialie Shen, Shuicheng Yan Oct 2010

Cast2face: Character Identification In Movie With Actor-Character Correspondence, Mengdi Xu, Xiaotong Yuan, Jialie Shen, Shuicheng Yan

Research Collection School Of Computing and Information Systems

We investigate the problem of automatically identifying characters in a movie with the supervision of actor-character name correspondence provided by the movie cast. Our proposed framework, namely Cast2Face, is featured by: (i) we restrict the names to assign within the set of character names in the cast; (ii) for each character, by using the corresponding actor's name as a key word, we retrieve from Google image search a group of face images to form the gallery set; and (iii) the probe face tracks in the movie are then identified as one of the actors by robust multi-task joint sparse representation …

Go to article

Jointly Modeling Aspects And Opinions With A Maxent-Lda Hybrid, Xin Zhao, Jing Jiang, Hongfei Yan, Xiaoming Li Oct 2010

Jointly Modeling Aspects And Opinions With A Maxent-Lda Hybrid, Xin Zhao, Jing Jiang, Hongfei Yan, Xiaoming Li

Research Collection School Of Computing and Information Systems

Discovering and summarizing opinions from online reviews is an important and challenging task. A commonly-adopted framework generates structured review summaries with aspects and opinions. Recently topic models have been used to identify meaningful review aspects, but existing topic models do not identify aspect-specific opinion words. In this paper, we propose a MaxEnt-LDA hybrid model to jointly discover both aspects and aspect-specific opinion words. We show that with a relatively small amount of training data, our model can effectively identify aspect and opinion words simultaneously. We also demonstrate the domain adaptability of our model.

Go to article

Mining Collaboration Patterns From A Large Developer Network, Didi Surian, David Lo, Ee Peng Lim Oct 2010

Mining Collaboration Patterns From A Large Developer Network, Didi Surian, David Lo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In this study, we extract patterns from a large developer collaborations network extracted from Source Forge. Net at high and low level of details. At the high level of details, we extract various network-level statistics from the network. At the low level of details, we extract topological sub-graph patterns that are frequently seen among collaborating developers. Extracting sub graph patterns from large graphs is a hard NP-complete problem. To address this challenge, we employ a novel combination of graph mining and graph matching by leveraging network-level properties of a developer network. With the approach, we successfully analyze a snapshot of …

Go to article

Youth Olympic Village Co-Space, Zin-Yan Chua, Yilin Kang, Xing Jiang, Kah-Hoe Pang, Andrew C. Gregory, Chi-Yun Tan, Wai-Lun Wong, Ah-Hwee Tan, Yew-Soon Ong, Chunyan Miao Oct 2010

Youth Olympic Village Co-Space, Zin-Yan Chua, Yilin Kang, Xing Jiang, Kah-Hoe Pang, Andrew C. Gregory, Chi-Yun Tan, Wai-Lun Wong, Ah-Hwee Tan, Yew-Soon Ong, Chunyan Miao

Research Collection School Of Computing and Information Systems

We have designed and implemented a 3D virtual world based on the Co-Space concept encompasses the Youth Olympic Village (YOV) and several sports competition venues. It is a massively multiplayer online (MMO) virtual world built according to the actual, physical locations of the YOV and sports competition venues. On top of that, the Co-Space is being populated with human-like avatars, which are created according to the actual human size and appearance; they perform their activities and interact with the users in realworld context. In addition, autonomous intelligent agents are integrated into the Co-Space to provide context-aware and personalized services to …

Go to article

Online Multiple Kernel Learning: Algorithms And Mistake Bounds, Rong Jin, Steven C. H. Hoi, Tianbao Yang Oct 2010

Online Multiple Kernel Learning: Algorithms And Mistake Bounds, Rong Jin, Steven C. H. Hoi, Tianbao Yang

Research Collection School Of Computing and Information Systems

Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing the intersecting research. In this paper, we introduce a new research problem, termed Online Multiple Kernel Learning (OMKL), that aims to learn a kernel based prediction function from a pool of predefined kernels in an online learning fashion. OMKL is generally more challenging than typical online learning because both the kernel classifiers and their linear combination weights must be learned simultaneously. In this work, we consider two setups for OMKL, i.e. combining …

Go to article

Comparative Analysis Of Combinations Of Dimension Reduction And Data Mining Techniques For Malware Detection, Proceso L. Fernandez Jr, Jeffrey C. Yiu, Paul Albert R. Arana Oct 2010

Comparative Analysis Of Combinations Of Dimension Reduction And Data Mining Techniques For Malware Detection, Proceso L. Fernandez Jr, Jeffrey C. Yiu, Paul Albert R. Arana

Department of Information Systems & Computer Science Faculty Publications

Many malware detectors utilize data mining techniques as primary tools for pattern recognition. As the number of new and evolving malware continues to rise, there is an increasing need for faster and more accurate detectors. However, for a given malware detector, detection speed and accuracy are usually inversely related. This study explores several configurations of classification combined with feature selection. An optimization function involving accuracy and processing time is used to evaluate each configuration. A real data set provided by Trend Micro Philippines is used for the study. Among 18 di↵erent configurations studied, it is shown that J4.8 without feature …

Go to article

Business Network-Based Value Creation In Electronic Commerce, Robert John Kauffman, Ting Li, Eric Van Heck Oct 2010

Business Network-Based Value Creation In Electronic Commerce, Robert John Kauffman, Ting Li, Eric Van Heck

Research Collection School Of Computing and Information Systems

Information technologies (IT) have affected economic activities within and beyond the boundaries of the firm, changing the face of e-commerce. This article explores the circumstances under which value is created in business networks made possible by IT. Business networks combine the capabilities of multiple firms to produce and deliver products and services that none of them could more economically produce on its own and for which there is demand in the market. We call this business network-based value creation. We apply economic theory to explain the conditions under which business networks will exist and are able to sustain their value-producing …

Go to article

Context Modeling For Ranking And Tagging Bursty Features In Text Streams, Xin Zhao, Jing Jiang, Jing He, Xiaoming Li, Hongfei Yan, Dongdong Shan Oct 2010

Context Modeling For Ranking And Tagging Bursty Features In Text Streams, Xin Zhao, Jing Jiang, Jing He, Xiaoming Li, Hongfei Yan, Dongdong Shan

Research Collection School Of Computing and Information Systems

Bursty features in text streams are very useful in many text mining applications. Most existing studies detect bursty features based purely on term frequency changes without taking into account the semantic contexts of terms, and as a result the detected bursty features may not always be interesting or easy to interpret. In this paper we propose to model the contexts of bursty features using a language modeling approach. We then propose a novel topic diversity-based metric using the context models to find newsworthy bursty features. We also propose to use the context models to automatically assign meaningful tags to bursty …

Go to article

Investigating Ultrasonic Positioning On Mobile Phones, Viacheslav Filonenko, Charlie Cullen, James Carswell Sep 2010

Investigating Ultrasonic Positioning On Mobile Phones, Viacheslav Filonenko, Charlie Cullen, James Carswell

Conference papers

In this paper we evaluate the innate ability of mobile phone speakers to produce ultrasound and the possible uses of this ability for accurate indoor positioning. The frequencies in question are a range between 20 and 22 KHz, which is high enough to be inaudible but low enough to be generated by standard sound hardware. A range of tones is generated at different volume settings on several popular modern mobile phones with the aim of finding points of failure. Our results indicate that it is possible to generate the given range of frequencies without significant distortions, provided the signal volume …

Go to article

Shortest Path Computation On Air Indexes, Georgios Kellaris, Kyriakos Mouratidis Sep 2010

Shortest Path Computation On Air Indexes, Georgios Kellaris, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Shortest path computation is one of the most common queries in location-based services that involve transportation net- works. Motivated by scalability challenges faced in the mo- bile network industry, we propose adopting the wireless broad- cast model for such location-dependent applications. In this model the data are continuously transmitted on the air, while clients listen to the broadcast and process their queries locally. Although spatial problems have been considered in this environment, there exists no study on shortest path queries in road networks. We develop the rst framework to compute shortest paths on the air, and demonstrate the practicality and …

Go to article

A Taxonomy-Based Model For Expertise Extrapolation, Delroy H. Cameron, Boanerges Aleman-Meza, Ismailcem Budak Arpinar, Sheron L. Decker, Amit P. Sheth Sep 2010

A Taxonomy-Based Model For Expertise Extrapolation, Delroy H. Cameron, Boanerges Aleman-Meza, Ismailcem Budak Arpinar, Sheron L. Decker, Amit P. Sheth

Kno.e.sis Publications

While many ExpertFinder applications succeed in finding experts, their techniques are not always designed to capture the various levels at which expertise can be expressed. Indeed, expertise can be inferred from relationships between topics and subtopics in a taxonomy. The conventional wisdom is that expertise in subtopics is also indicative of expertise in higher level topics as well. The enrichment of Expertise Profiles for finding experts can therefore be facilitated by taking domain hierarchies into account. We present a novel semantics-based model for finding experts, expertise levels and collaboration levels in a peer review context, such as composing a Program …

Go to article

Ranking Documents Semantically Using Ontological Relationships, Boanerges Aleman-Meza, I. Budak Arpinar, Mustafa V. Nural, Amit P. Sheth Sep 2010

Ranking Documents Semantically Using Ontological Relationships, Boanerges Aleman-Meza, I. Budak Arpinar, Mustafa V. Nural, Amit P. Sheth

Kno.e.sis Publications

Although arguable success of today’s keyword based search engines in certain information retrieval tasks, ranking search results in a meaningful way remains an open problem. In this work, the goal is to use of semantic relationships for ranking documents without relying on the existence of any specific structure in a document or links between documents. Instead, real-world entities are identified and the relevance of documents is determined using relationships that are known to exist between the entities in a populated ontology. We introduce a measure of relevance that is based on traversal and the semantics of relationships that link entities …

Go to article

Diract: Agent-Based Interactive Storytelling, Yundong Cai, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan Sep 2010

Diract: Agent-Based Interactive Storytelling, Yundong Cai, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

A lot of researches haven been done on the interactive storytelling authoring , e.g. by a director agent, or by interactions among a number of character agents. However, it is still difficult to construct the interactive storytelling for novice users, due to a need of various agents development and complex communication among the agents. We propose an agent-based interactive storytelling architecture, namely DIRACT (short of “Direct and Act”). It is composed of numerous atomic DIRACT agents, which are goal oriented and use an unified communication protocol. By removing the difference between the director and character, each DIRACT agent can either …

Go to article

First Prev Next Last