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

OS and Networks Commons

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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type

Articles 1351 - 1380 of 1759

Full-Text Articles in OS and Networks

Flexible Querying Of Xml Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni Sep 2006

Flexible Querying Of Xml Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni

Kno.e.sis Publications

Text search engines are inadequate for indexing and searching XML documents because they ignore metadata and aggregation structure implicit in the XML documents. On the other hand, the query languages supported by specialized XML search engines are very complex. In this paper, we present a simple yet flexible query language, and develop its semantics to enable intuitively appealing extraction of relevant fragments of information while simultaneously falling back on retrieval through plain text search if necessary. We also present a simple yet robust relevance ranking for heterogeneous document-centric XML.


Multi-Learner Based Recursive Supervised Training, Laxmi R. Iyer, Kiruthika Ramanathan, Sheng-Uei Guan Sep 2006

Multi-Learner Based Recursive Supervised Training, Laxmi R. Iyer, Kiruthika Ramanathan, Sheng-Uei Guan

Research Collection School Of Computing and Information Systems

In this paper, we propose the multi-learner based recursive supervised training (MLRT) algorithm, which uses the existing framework of recursive task decomposition, by training the entire dataset, picking out the best learnt patterns, and then repeating the process with the remaining patterns. Instead of having a single learner to classify all datasets during each recursion, an appropriate learner is chosen from a set of three learners, based on the subset of data being trained, thereby avoiding the time overhead associated with the genetic algorithm learner utilized in previous approaches. In this way MLRT seeks to identify the inherent characteristics of …


Beosh: The Beowulf Cluster Shell, Mason E. Vail Aug 2006

Beosh: The Beowulf Cluster Shell, Mason E. Vail

Computer Science Graduate Projects and Theses

The Beowulf Cluster Shell (beosh) has been created to provide cluster users with a Single System Image (SSI) by distributing individual commands or pipelined jobs over available nodes without requiring the user to be aware of where or how jobs are distributed. Job control of distributed jobs enables management of multiple concurrent remote jobs from a single shell session. In addition to SSI features, beosh supports parallel job execution through pdsh, a commonly used parallel-only cluster shell. In either distributed or parallel mode, beosh can limit nodes to those reserved through a system like the Portable Batch System (PBS).

This …


Optimal Adaptation Of Web Processes With Inter-Service Dependencies, Kunal Verma, Prashant Doshi, Karthik Gomadam, John A. Miller, Amit P. Sheth Jul 2006

Optimal Adaptation Of Web Processes With Inter-Service Dependencies, Kunal Verma, Prashant Doshi, Karthik Gomadam, John A. Miller, Amit P. Sheth

Kno.e.sis Publications

We present methods for optimally adapting Web processes to exogenous events while preserving inter-service dependencies. For example, in a supply chain process, orders placed by the manufacturer may get delayed in arriving. In response to this event, the manufacturer has the choice of either waiting out the delay or changing the supplier. Additionally, there may be compatibility constraints between the different orders, thereby introducing the problem of coordination between them if the manufacturer chooses to change the suppliers. We present our methods within the framework of autonomic Web processes. This framework seeks to add properties of self-configuration, adaptation, and self-optimization …


Querying Formal Contexts With Answer Set Programs, Pascal Hitzler, Markus Krotzsch Jul 2006

Querying Formal Contexts With Answer Set Programs, Pascal Hitzler, Markus Krotzsch

Computer Science and Engineering Faculty Publications

Recent studies showed how a seamless integration of formal concept analysis (FCA), logic of domains, and answer set programming (ASP) can be achieved. Based on these results for combining hierarchical knowledge with classical rule-based formalisms, we introduce an expressive common-sense query language for formal contexts. Although this approach is conceptually based on order-theoretic paradigms, we show how it can be implemented on top of standard ASP systems. Advanced features, such as default negation and disjunctive rules, thus become practically available for processing contextual data.


Geospatial Ontology Development And Semantic Analytics, I. Budak Arpinar, Cartic Ramakrishnan, Molly Azami, Amit P. Sheth, E. Lynn Usery, Mei-Po Kwan Jul 2006

Geospatial Ontology Development And Semantic Analytics, I. Budak Arpinar, Cartic Ramakrishnan, Molly Azami, Amit P. Sheth, E. Lynn Usery, Mei-Po Kwan

Kno.e.sis Publications

Geospatial ontology development and semantic knowledge discovery addresses the need for modeling, analyzing and visualizing multimodal information, and is unique in offering integrated analytics that encompasses spatial, temporal and thematic dimensions of information and knowledge. The comprehensive ability to provide integrated analysis from multiple forms of information and use of explicit knowledge make this approach unique. This also involves specification of spatiotemporal thematic ontologies and populating such ontologies with high quality knowledge. Such ontologies form the basis for defining the meaning of important relations terms, such as near or surrounded by, and enable computation of spatiotemporal thematic proximity measures we …


Masquerader Detection Using Oclep: One-Class Classification Using Length Statistics Of Emerging Patterns, Lijun Chen, Guozhu Dong Jun 2006

Masquerader Detection Using Oclep: One-Class Classification Using Length Statistics Of Emerging Patterns, Lijun Chen, Guozhu Dong

Kno.e.sis Publications

We introduce a new method for masquerader detection that only uses a user’s own data for training, called Oneclass Classification using Length statistics of Emerging Patterns (OCLEP). Emerging patterns (EPs) are patterns whose support increases from one dataset/class to another with a big ratio, and have been very useful in earlier studies. OCLEP classifies a case T as self or masquerader by using the average length of EPs obtained by contrasting T against sets of samples of a user’s normal data. It is based on the observation that one needs long EPs to differentiate instances from a common class, but …


Development Of A Methodology For Customizing Insider Threat Auditing On A Microsoft Windows Xp® Operating System, Terry E. Levoy Jun 2006

Development Of A Methodology For Customizing Insider Threat Auditing On A Microsoft Windows Xp® Operating System, Terry E. Levoy

Theses and Dissertations

Most organizations are aware that threats from trusted insiders pose a great risk to their organization and are very difficult to protect against. Auditing is recognized as an effective technique to detect malicious insider activities. However, current auditing methods are typically applied with a one-size-fits-all approach and may not be an appropriate mitigation strategy, especially towards insider threats. This research develops a 4-step methodology for designing a customized auditing template for a Microsoft Windows XP operating system. Two tailoring methods are presented which evaluate both by category and by configuration. Also developed are various metrics and weighting factors as a …


Interacting With Web Hierarchies, Saverio Perugini, Naren Ramakrishnan Jun 2006

Interacting With Web Hierarchies, Saverio Perugini, Naren Ramakrishnan

Computer Science Faculty Publications

Web site interfaces are a particularly good fit for hierarchies in the broadest sense of that idea, i.e. a classification with multiple attributes, not necessarily a tree structure. Several adaptive interface designs are emerging that support flexible navigation orders, exposing and exploring dependencies, and procedural information-seeking tasks. This paper provides a context and vocabulary for thinking about hierarchical Web sites and their design. The paper identifies three features that interface to information hierarchies. These are flexible navigation orders, the ability to expose and explore dependencies, and support for procedural tasks. A few examples of these features are also provided


A Metamodel And Uml Profile For Rule-Extended Owl Dl Ontologies, Saartje Brockmans, Peter Haase, Pascal Hitzler, Rudi Studer Jun 2006

A Metamodel And Uml Profile For Rule-Extended Owl Dl Ontologies, Saartje Brockmans, Peter Haase, Pascal Hitzler, Rudi Studer

Computer Science and Engineering Faculty Publications

In this paper we present a MOF compliant metamodel and UML profile for the Semantic Web Rule Language (SWRL) that integrates with our previous work on a metamodel and UML profile for OWL DL. Based on this metamodel and profile, UML tools can be used for visual modeling of rule-extended ontologies.


Semantic Empowerment Of Health Care And Life Science Applications, Amit P. Sheth May 2006

Semantic Empowerment Of Health Care And Life Science Applications, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.


Semantic Analytics Visualization, Leonidas Deligiannidis, Amit P. Sheth, Boanerges Aleman-Meza May 2006

Semantic Analytics Visualization, Leonidas Deligiannidis, Amit P. Sheth, Boanerges Aleman-Meza

Kno.e.sis Publications

In this paper we present a new tool for semantic analytics through 3D visualization called “Semantic Analytics Visualization” (SAV). It has the capability for visualizing ontologies and meta-data including annotated web-documents, images, and digital media such as audio and video clips in a synthetic three-dimensional semi-immersive environment. More importantly, SAV supports visual semantic analytics, whereby an analyst can interactively investigate complex relationships between heterogeneous information. The tool is built using Virtual Reality technology which makes SAV a highly interactive system. The backend of SAV consists of a Semantic Analytics system that supports query processing and semantic association discovery. Using a …


Forensic Analysis Of The Contents Of Nokia Mobile Phones, B. Williamson, P. Apeldoorn, B. Cheam, M. Mcdonald Apr 2006

Forensic Analysis Of The Contents Of Nokia Mobile Phones, B. Williamson, P. Apeldoorn, B. Cheam, M. Mcdonald

Australian Digital Forensics Conference

Acquiring information from a mobile phone is now an important issue in many criminal investigations. Mobile phones can contain large amounts of information which can be of use in an investigation. These include typical mobile device data including SMS, phone records and calendar and diary entries. As the difference between a PDA and a mobile phone is now blurred, the data that can reside on a mobile phone is somewhat endless. This report focuses on the performance of different mobile phone forensic software devices, and reports the findings. All aspects of the different software pieces will be reported, as well …


Engineering A Suburban Ad-Hoc Network, Mike Tyson, Ronald D. Pose, Carlo Kopp, Mohammad Rokonuzzaman, Muhammad Mahmudul Islam Apr 2006

Engineering A Suburban Ad-Hoc Network, Mike Tyson, Ronald D. Pose, Carlo Kopp, Mohammad Rokonuzzaman, Muhammad Mahmudul Islam

Australian Information Warfare and Security Conference

Networks are growing in popularity, as wireless communication hardware, both fixed and mobile, becomes more common and affordable. The Monash Suburban Ad-Hoc Network (SAHN) project has devised a system that provides a highly secure and survivable ad-hoc network, capable of delivering broadband speeds to co-operating users within a fixed environment, such as a residential neighbourhood, or a campus. The SAHN can be used by residents within a community to exchange information, to share access to the Internet, providing last-mile access, or for local telephony and video conferencing. SAHN nodes are designed to be self-configuring and selfmanaging, relying on no experienced …


Ivibrate: Interactive Visualization Based Framework For Clustering Large Datasets, Keke Chen, Ling Liu Apr 2006

Ivibrate: Interactive Visualization Based Framework For Clustering Large Datasets, Keke Chen, Ling Liu

Kno.e.sis Publications

With continued advances in communication network technology and sensing technology, there is astounding growth in the amount of data produced and made available through cyberspace. Efficient and high-quality clustering of large datasets continues to be one of the most important problems in large-scale data analysis. A commonly used methodology for cluster analysis on large datasets is the three-phase framework of sampling/summarization, iterative cluster analysis, and disk-labeling. There are three known problems with this framework which demand effective solutions. The first problem is how to effectively define and validate irregularly shaped clusters, especially in large datasets. Automated algorithms and statistical methods …


Detecting The Change Of Clustering Structure In Categorical Data Streams, Keke Chen, Ling Liu Apr 2006

Detecting The Change Of Clustering Structure In Categorical Data Streams, Keke Chen, Ling Liu

Kno.e.sis Publications

Analyzing clustering structures in data streams can provide critical information for making decision in real time. In this paper, we present a framework for detecting the change of critical clustering structure in categorical data streams. The framework consists of the Hierarchical Entropy Tree structure (HE-Tree) and the extended ACE clustering algorithm. HE-Tree can efficiently capture the entropy property of the categorical data streams and allow us to draw precise clustering information from the data stream for high-quality BkPLots with the extended ACE algorithm.


The Reliability Of The Computer Communication Networks Including Mobile Nodes, Sahin Yasar Apr 2006

The Reliability Of The Computer Communication Networks Including Mobile Nodes, Sahin Yasar

Electrical & Computer Engineering Theses & Dissertations

The wireless computer networks have an uncertainty in their structures aside from their big advantages for the users. The environmental conditions, changing locations of the mobile hosts and the changing components in the system can easily affect their reliability. In order to know a system capability performing its functions, keep the reliability at a certain level and/or detect the deficiency of the system, it is necessary to analyze the reliability of a computer communication network including the wired and wireless parts. But the above reasons also make the analysis and a unique solution difficult so a set of algorithms is …


Semantic Web Applications In Financial Industry, Government, Health Care And Life Sciences, Amit P. Sheth Mar 2006

Semantic Web Applications In Financial Industry, Government, Health Care And Life Sciences, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.


Wsdl-S: Specification, Tools, Use Cases And Applications, Amit P. Sheth, Kunal Verma, Karthik Gomadam Mar 2006

Wsdl-S: Specification, Tools, Use Cases And Applications, Amit P. Sheth, Kunal Verma, Karthik Gomadam

Kno.e.sis Publications

No abstract provided.


Visual Ontology Modeling For Electronic Markets, Saartje Brockmans, Andreas Geyer-Schulz, Pascal Hitzler, Rudi Studer Jan 2006

Visual Ontology Modeling For Electronic Markets, Saartje Brockmans, Andreas Geyer-Schulz, Pascal Hitzler, Rudi Studer

Computer Science and Engineering Faculty Publications

The research program, Information Management and Market Engineering, focuses on the analysis and the design of electronic markets. Taking a holistic view of the conceptualization and realization of solutions, the research integrates the disciplines business administration, economics, computer science, and law. Topics of interest range from the implementation, quality assurance, and further development of electronic markets to their integration into business processes, innovative business models, and legal frameworks.


Taxaminer: Improving Taxonomy Label Quality Using Latent Semantic Indexing, Cartic Ramakrishnan, Christopher Thomas, Vipul Kashyap, Amit P. Sheth Jan 2006

Taxaminer: Improving Taxonomy Label Quality Using Latent Semantic Indexing, Cartic Ramakrishnan, Christopher Thomas, Vipul Kashyap, Amit P. Sheth

Kno.e.sis Publications

The development of taxonomies/ontologies is a human intensive process requiring prohibitively large resource commitments in terms of time and cost. In our previous work we have identified an experimentation framework for semi-automatic taxonomy/hierarchy generation from unstructured text. In the preliminary results presented, the taxonomy/hierarchy quality was lower than we had anticipated. In this paper, we present two variations of our experimentation framework, viz. Latent semantic Indexing (LSI) for document indexing and the use of term vectors to prune labels assigned to nodes in the final taxonomy/hierarchy. Using our previous results of taxonomy/hierarchy quality as the baseline we present results that …


Data Processing In Space, Time, And Semantics Dimensions, Farshad Hakimpour, Boanerges Aleman-Meza, Matthew Perry, Amit P. Sheth Jan 2006

Data Processing In Space, Time, And Semantics Dimensions, Farshad Hakimpour, Boanerges Aleman-Meza, Matthew Perry, Amit P. Sheth

Kno.e.sis Publications

This work presents an experimental system for data processing in space, time and semantics dimensions using current Semantic Web technologies. The paper describes how we obtain geographic and event data from Internet sources and also how we integrate them into an RDF store. We briefly introduce a set of functionalities in space, time and semantics dimensions. These functionalities are implemented based on our existing technology for main-memory based RDF data processing developed in the LSDIS Lab. A number of these functionalities are exposed as REST Web services. We present two sample client side applications that are developed using a combination …


Semi-Supervised Conditional Random Fields For Improved Sequence Segmentation And Labeling, Feng Jiao, Shaojun Wang, Chi-Hoon Lee, Russell Greiner, Dale Schuurmans Jan 2006

Semi-Supervised Conditional Random Fields For Improved Sequence Segmentation And Labeling, Feng Jiao, Shaojun Wang, Chi-Hoon Lee, Russell Greiner, Dale Schuurmans

Kno.e.sis Publications

We present a new semi-supervised training procedure for conditional random fields (CRFs) that can be used to train sequence segmentors and labelers from a combination of labeled and unlabeled training data. Our approach is based on extending the minimum entropy regularization framework to the structured prediction case, yielding a training objective that combines unlabeled conditional entropy with labeled conditional likelihood. Although the training objective is no longer concave, it can still be used to improve an initial model (e.g. obtained from supervised training) by iterative ascent. We apply our new training algorithm to the problem of identifying gene and protein …


An Investigation Of Codon Usage Bias Including Visualization And Quantification In Organisms Exhibiting Multiple Biases, Douglas W. Raiford, Travis E. Doom, Dan E. Krane, Michael L. Raymer Jan 2006

An Investigation Of Codon Usage Bias Including Visualization And Quantification In Organisms Exhibiting Multiple Biases, Douglas W. Raiford, Travis E. Doom, Dan E. Krane, Michael L. Raymer

Kno.e.sis Publications

Prokaryotic genomic sequence data provides a rich resource for bioinformatic analytic algorithms. Information can be extracted in many ways from the sequence data. One often overlooked process involves investigating an organism’s codon usage. Degeneracy in the genetic code leads to multiple codons coding for the same amino acids. Organism’s often preferentially utilize specific codons when coding for an amino acid. This biased codon usage can be a useful trait when predicting a gene’s expressivity or whether the gene originated from horizontal transfer. There can be multiple biases at play in a genome causing errors in the predictive process. For this …


A Semantic Future For Ai, Rudi Studer, Anupriya Ankolekar, Pascal Hitzler Jan 2006

A Semantic Future For Ai, Rudi Studer, Anupriya Ankolekar, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In our modern information society, people need to manage ever-increasing numbers of personal devices and conduct more of their work and activities online, often making use of heterogeneous services. The amount of information to be processed by each individual is constantly growing, making it increasingly difficult to control, channel, share and make constructive use of it. To mitigate this, computing needs to become much more human-centered, e.g. by presenting personalised information to users and by respecting personal preferences in controlling multiple devices or invoking various services. Appropriate representation of the semantics of the information and functionality of devices and services …


Predicting Domain Specific Entities With Limited Background Knowledge, Christopher Thomas, Amit P. Sheth Jan 2006

Predicting Domain Specific Entities With Limited Background Knowledge, Christopher Thomas, Amit P. Sheth

Kno.e.sis Publications

This paper proposes a framework for automatic recognition of domain-specific entities from text, given limited background knowledge, e.g. in form of an ontology. The algorithm exploits several lightweight natural language processing techniques, such as tokenization and stemming, as well as statistical techniques, such as singular value decomposition (SVD) to suggest domain relatedness of unknown entities.


Using Query-Specific Variance Estimates To Combine Bayesian Classifiers, Chi-Hoon Lee, Russell Greiner, Shaojun Wang Jan 2006

Using Query-Specific Variance Estimates To Combine Bayesian Classifiers, Chi-Hoon Lee, Russell Greiner, Shaojun Wang

Kno.e.sis Publications

Many of today's best classification results are obtained by combining the responses of a set of base classifiers to produce an answer for the query. This paper explores a novel "query specific" combination rule: After learning a set of simple belief network classifiers, we produce an answer to each query by combining their individual responses, using weights based inversely on their respective variances around their responses. These variances are based on the uncertainty of the network parameters, which in turn depend on the training datasample. In essence, this variance quantifies the base classifier's confidence of its response to this query. …


Clustering Similarity Comparison Using Density Profiles, Eric Bae, James Bailey, Guozhu Dong Jan 2006

Clustering Similarity Comparison Using Density Profiles, Eric Bae, James Bailey, Guozhu Dong

Kno.e.sis Publications

The unsupervised nature of cluster analysis means that objects can be clustered in many ways, allowing different clustering algorithms to generate vastly different results. To address this, clustering comparison methods have traditionally been used to quantify the degree of similarity between alternative clusterings. However, existing techniques utilize only the point memberships to calculate the similarity, which can lead to unintuitive results. They also cannot be applied to analyze clusterings which only partially share points, which can be the case in stream clustering. In this paper we introduce a new measure named ADCO, which takes into account density profiles for each …


An Online Discriminative Approach To Background Subtraction, Li Cheng, Shaojun Wang, Terry Caelli Jan 2006

An Online Discriminative Approach To Background Subtraction, Li Cheng, Shaojun Wang, Terry Caelli

Kno.e.sis Publications

We present a simple, principled approach to detecting foreground objects in video sequences in real-time. Our method is based on an on-line discriminative learning technique that is able to cope with illumination changes due to discontinuous switching, or illumination drifts caused by slower processes such as varying time of the day. Starting from a discriminative learning principle, we derive a training algorithm that, for each pixel, computes a weighted linear combination of selected past observations with time-decay. We present experimental results that show the proposed approach outperforms existing methods on both synthetic sequences and real video data.


Realtime Query Expansion And Procedural Interfaces For Information Hierarchies, Saverio Perugini Jan 2006

Realtime Query Expansion And Procedural Interfaces For Information Hierarchies, Saverio Perugini

Computer Science Faculty Publications

We demonstrate the use of two user interfaces for interacting with web hierarchies. One uses the dependencies underlying a hierarchy to perform real-time query expansion and, in this way, acts as an in situ feedback mechanism. The other enables the user to cascade the output from one interaction to the input of another, and so on, and, in this way, supports procedural information-seeking tasks without disrupting the flow of interaction.