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 1501 - 1530 of 1760

Full-Text Articles in OS and Networks

Semantic Web In Action: Ontology-Driven Information Search, Integration And Analysis, Amit P. Sheth Sep 2003

Semantic Web In Action: Ontology-Driven Information Search, Integration And Analysis, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Context-Aware Semantic Association Ranking, Boanerges Aleman-Meza, Christian Halaschek-Wiener, I. Budak Arpinar, Amit P. Sheth Sep 2003

Context-Aware Semantic Association Ranking, Boanerges Aleman-Meza, Christian Halaschek-Wiener, I. Budak Arpinar, Amit P. Sheth

Kno.e.sis Publications

Discovering complex and meaningful relationships, which we call Semantic Associations, is an important challenge. Just as ranking of documents is a critical component of today's search engines, ranking of relationships will be essential in tomorrow's semantic search engines that would support discovery and mining of the Semantic Web. Building upon our recent work on specifying types of Semantic Associations in RDF graphs, which are possible to create through semantic metadata extraction and annotation, we discuss a framework where ranking techniques can be used to identify more interesting and more relevant Semantic Associations. Our techniques utilize alternative ways of specifying the …

Go to article

Continuity Of Semantic Operators In Logic Programming And Their Approximation By Artificial Neural Networks, Pascal Hitzler, Anthony K. Seda Sep 2003

Continuity Of Semantic Operators In Logic Programming And Their Approximation By Artificial Neural Networks, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

One approach to integrating first-order logic programming and neural network systems employs the approximation of semantic operators by feedforward networks. For this purpose, it is necessary to view these semantic operators as continuous functions on the reals. This can be accomplished by endowing the space of all interpretations of a logic program with topologies obtained from suitable embeddings. We will present such topologies which arise naturally out of the theory of logic programming, discuss continuity issues of several well-known semantic operators, and derive some results concerning the approximation of these operators by feedforward neural networks.

Go to article

Capacitated Network Revenue Management Through Shadow Pricing, Mustapha Bouhtou, Madiagne Diallo, Laura Wynter Sep 2003

Capacitated Network Revenue Management Through Shadow Pricing, Mustapha Bouhtou, Madiagne Diallo, Laura Wynter

Research Collection School Of Computing and Information Systems

In this paper, we analyze a method that links Lagrange multipliers from a resource allocation problem to the problem of revenue or profit maximization. This technique, first proposed in the transportation science literature by [7] has important implications for telecommunication network pricing. Indeed, the framework provides a generalization of telecommunication resource allocation/shadow price-based schemes such as those of [6] and [9], in that it permits the optimization of the shadow prices themselves, through a computationally simple procedure. We analyze the extent to which revenue can be maximized on a network that uses shadow-price-based prices, and how to deal with cases …

Go to article

Context-Aware Semantic Association Ranking, Boanerges Aleman-Meza, Chris Halaschek, I. Budak Arpinar, Amit P. Sheth Aug 2003

Context-Aware Semantic Association Ranking, Boanerges Aleman-Meza, Chris Halaschek, I. Budak Arpinar, Amit P. Sheth

Kno.e.sis Publications

Discovering complex and meaningful relationships, which we call Semantic Associations, is an important challenge. Just as ranking of documents is a critical component of today's search engines, ranking of relationships will be essential in tomorrow's semantic search engines that would support discovery and mining of the Semantic Web. Building upon our recent work on specifying types of Semantic Associations in RDF graphs, which are possible to create through semantic metadata extraction and annotation, we discuss a framework where ranking techniques can be used to identify more interesting and more relevant Semantic Associations. Our techniques utilize alternative ways of specifying the …

Go to article

Boltzmann Machine Learning With The Latent Maximum Entropy Principle, Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin Zhao Aug 2003

Boltzmann Machine Learning With The Latent Maximum Entropy Principle, Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin Zhao

Kno.e.sis Publications

We present a new statistical learning paradigm for Boltzmann machines based on a new inference principle we have proposed: the latent maximum entropy principle (LME). LME is different both from Jaynes maximum entropy principle and from standard maximum likelihood estimation. We demonstrate the LME principle BY deriving new algorithms for Boltzmann machine parameter estimation, and show how robust and fast new variant of the EM algorithm can be developed. Our experiments show that estimation based on LME generally yields better results than maximum likelihood estimation, particularly when inferring hidden units from small amounts of data.

Go to article

Learning Mixture Models With The Latent Maximum Entropy Principle, Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin Zhao Aug 2003

Learning Mixture Models With The Latent Maximum Entropy Principle, Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin Zhao

Kno.e.sis Publications

We present a new approach to estimating mixture models based on a new inference principle we have proposed: the latent maximum entropy principle (LME). LME is different both from Jaynes’ maximum entropy principle and from standard maximum likelihood estimation. We demonstrate the LME principle by deriving new algorithms for mixture model estimation, and show how robust new variants of the EM algorithm can be developed. Our experiments show that estimation based on LME generally yields better results than maximum likelihood estimation, particularly when inferring latent variable models from small amounts of data.

Go to article

Adaptive Live Video Streaming By Priority Drop, Jie Huang, Charles Krasic, Jonathan Walpole Jul 2003

Adaptive Live Video Streaming By Priority Drop, Jie Huang, Charles Krasic, Jonathan Walpole

Computer Science Faculty Publications and Presentations

In this paper we explore the use of Priority-progress streaming (PPS) for video surveillance applications. PPS is an adaptive streaming technique for the delivery of continuous media over variable bit-rate channels. It is based on the simple idea of reordering media components within a time window into priority order before transmission. The main concern when using PPS for live video streaming is the time delay introduced by reordering. In this paper we describe how PPS can be extended to support live streaming and show that the delay inherent in the approach can be tuned to satisfy a wide range of …

Go to article

A Visual Framework Invites Human Into The Clustering Process, Keke Chen, Ling Liu Jul 2003

A Visual Framework Invites Human Into The Clustering Process, Keke Chen, Ling Liu

Kno.e.sis Publications

Clustering is a technique commonly used in scientific research. The task of clustering inevitably involves human participation - the clustering is not finished when the computer/algorithm finishes but the user has evaluated, understood and accepted the patterns. This defines a human involved "clustering-analysis/evaluation" iteration. Instead of neglecting this human involvement, we provide a visual framework (VISTA) with all power of algorithmic approaches (since their result can be visualized), and in addition we allow the user to steer/monitor/refine the clustering process with domain knowledge. The visual-rendering result also provides a precise pattern for fast post-processing.

Go to article

Toward A Comprehensive Supplement For Language Courses, Krishnaprasad Thirunarayan, Stephen P. Carl Jul 2003

Toward A Comprehensive Supplement For Language Courses, Krishnaprasad Thirunarayan, Stephen P. Carl

Kno.e.sis Publications

No abstract provided.

Go to article

Adding Semantics To Web Services Standards, Kaarthik Sivashanmugam, Kunal Verma, Amit P. Sheth, John Miller Jun 2003

Adding Semantics To Web Services Standards, Kaarthik Sivashanmugam, Kunal Verma, Amit P. Sheth, John Miller

Kno.e.sis Publications

With the increasing growth in popularity of Web services, discovery of relevant Web services becomes a significant challenge. One approach is to develop semantic Web services where by the Web services are annotated based on shared ontologies, and use these annotations for semantics-based discovery of relevant Web services. We discuss one such approach that involves adding semantics to WSDL using DAML+OIL ontologies. Our approach also uses UDDI to store these semantic annotations and search for Web services based on them. We compare our approach with another initiative to add semantics to support Web service discovery, and show how our approach …

Go to article

Strategyproof Mechanisms For Ad Hoc Network Formation, C. Jason Woodard, David C. Parkes Jun 2003

Strategyproof Mechanisms For Ad Hoc Network Formation, C. Jason Woodard, David C. Parkes

Research Collection School Of Computing and Information Systems

Agents in a peer-to-peer system typically have incentives to influence its network structure, either to reduce their costs or increase their ability to capture value. The problem is compounded when agents can join and leave the system dynamically. This paper proposes three economic mechanisms that offset the incentives for strategic behavior and facilitate the formation of networks with desirable global properties.

Go to article

Semantic Web Process Lifecycle: Role Of Semantics In Annotation, Discovery, Composition And Orchestration, Amit P. Sheth May 2003

Semantic Web Process Lifecycle: Role Of Semantics In Annotation, Discovery, Composition And Orchestration, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Healthcare Enterprise Process Development And Integration, Kemafor Anyanwu, Amit P. Sheth, Jorge Cardoso, John A. Miller, Krzysztof J. Kochut May 2003

Healthcare Enterprise Process Development And Integration, Kemafor Anyanwu, Amit P. Sheth, Jorge Cardoso, John A. Miller, Krzysztof J. Kochut

Kno.e.sis Publications

Healthcare enterprises involve complex processes that span diverse groups and organisations. These processes involve clinical and administrative tasks, large volumes of data, and large numbers of patients and personnel. The tasks can be performed either by humans or by automated systems. In the latter case, the tasks are supported by a variety of software applications and information systems which are very often heterogeneous, autonomous, and distributed. The development of systems to manage and automate these processes has increasingly played an important role in improving the efficiency of healthcare enterprises. In this paper we look at four healthcare and medical applications …

Go to article

Ρ-Queries: Enabling Querying For Semantic Associations On The Semantic Web, Kemafor Anyanwu, Amit P. Sheth May 2003

Ρ-Queries: Enabling Querying For Semantic Associations On The Semantic Web, Kemafor Anyanwu, Amit P. Sheth

Kno.e.sis Publications

This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as similarity of entities based on a specific notion of similarity called ρ-isomorphism. It formalizes these notions for the RDF data model, by introducing a notion of a Property Sequence as a type. In the context of a graph model such as that for RDF, Semantic Associations amount to specific certain graph signatures. Specifically, they refer to sequences (i.e. directed paths) here called Property Sequences, between entities, networks of Property Sequences (i.e. undirected paths), or subgraphs …

Go to article

Exception Handling For Conflict Resolution In Cross-Organizational Workflows, Zongwei Luo, Amit P. Sheth, Krzysztof Kochut, I. Budak Arpinar May 2003

Exception Handling For Conflict Resolution In Cross-Organizational Workflows, Zongwei Luo, Amit P. Sheth, Krzysztof Kochut, I. Budak Arpinar

Kno.e.sis Publications

Workflow management systems (WfMSs) are being increasingly deployed to deliver e-business transactions across organizational boundaries. To ensure a high service quality in such transactions, exception-handling schemes for conflict resolution are needed. The conflicts primarily arise due to failure of a task in workflow execution because of underlying application, or controlling WfMS component failures or insufficient user input. So far, little progress has been reported in addressing conflict resolution in cross-organizational business processes, though its importance has been recognized. In this paper, we identify the exception handling techniques that support conflict resolution in cross-organizational settings. In particular, we propose a novel, …

Go to article

Identifying Patterns In Dna Change, Jason R. Gilder, Dan E. Krane, Travis E. Doom, Michael L. Raymer Apr 2003

Identifying Patterns In Dna Change, Jason R. Gilder, Dan E. Krane, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Now that a draft sequence of the human genome is nearly complete, questions regarding both the information contained within our genetic blueprints as well as the manner in which that information content changes over time can be addressed in ways that had not previously been possible. By their very nature, some of the nucleotide sequences present within our genome allow detailed examination of the mode and pattern of evolution that has shaped our genetic instructions over time spans of tens of millions of years. Alu repeats are one example. Using these relatively short, ubiquitous DNA sequences we explore the problem …

Go to article

Automatic Speaker Identification Using Reusable And Retrainable Binary-Pair Partitioned Neural Networks, Ashutosh Mishra Apr 2003

Automatic Speaker Identification Using Reusable And Retrainable Binary-Pair Partitioned Neural Networks, Ashutosh Mishra

Electrical & Computer Engineering Theses & Dissertations

This thesis presents an extension of the work previously done on speaker identification using Binary Pair Partitioned (BPP) neural networks. In the previous work, a separate network was used for each pair of speakers in the speaker population. Although the basic BPP approach did perform well and had a simple underlying algorithm, it had the obvious disadvantage of requiring an extremely large number of networks for speaker identification with large speaker populations. It also requires training of networks proportional to the square of the number of speakers under consideration, leading to a very large number of networks to be trained …

Go to article

Ontology Driven Information Systems In Action (Capturing And Applying Existing Knowledge To Semantic Applications), Amit P. Sheth Mar 2003

Ontology Driven Information Systems In Action (Capturing And Applying Existing Knowledge To Semantic Applications), Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Taxonomy Of Synchronization And Barrier As A Basic Mechanism For Building Other Synchronization From It, Pauline Braginton Jan 2003

Taxonomy Of Synchronization And Barrier As A Basic Mechanism For Building Other Synchronization From It, Pauline Braginton

Theses Digitization Project

A Distributed Shared Memory(DSM) system consists of several computers that share a memory area and has no global clock. Therefore, an ordering of events in the system is necessary. Synchronization is a mechanism for coordinating activities between processes, which are program instantiations in a system.

Go to article

Generalized Metrics And Uniquely Determined Logic Programs, Pascal Hitzler, Anthony K. Seda Jan 2003

Generalized Metrics And Uniquely Determined Logic Programs, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

The introduction of negation into logic programming brings the benefit of enhanced syntax and expressibility, but creates some semantical problems. Specifically, certain operators which are monotonic in the absence of negation become non-monotonic when it is introduced, with the result that standard approaches to denotational semantics then become inapplicable. In this paper, we show how generalized metric spaces can be used to obtain fixed-point semantics for several classes of programs relative to the supported model semantics, and investigate relationships between the underlying spaces we employ. Our methods allow the analysis of classes of programs which include the acyclic, locally hierarchical, …

Go to article

Semantic N-Gram Language Modeling With The Latent Maximum Entropy Principle, Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin Zhao Jan 2003

Semantic N-Gram Language Modeling With The Latent Maximum Entropy Principle, Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin Zhao

Kno.e.sis Publications

We describe a unified probabilistic framework for statistical language modeling-the latent maximum entropy principle-which can effectively incorporate various aspects of natural language, such as local word interaction, syntactic structure and semantic document information. Unlike previous work on maximum entropy methods for language modeling, which only allow explicit features to be modeled, our framework also allows relationships over hidden features to be captured, resulting in a more expressive language model. We describe efficient algorithms for marginalization, inference and normalization in our extended models. We then present experimental results for our approach on the Wall Street Journal corpus.

Go to article

Web Service: Been There, Done That?, Steffen Staab, Will Van Der Aalst, V. Richard Benjamins, Amit P. Sheth, John A. Miller, Chistoph Bussler, Alexander Maedche, Dieter Fensel, Dennis Gannon Jan 2003

Web Service: Been There, Done That?, Steffen Staab, Will Van Der Aalst, V. Richard Benjamins, Amit P. Sheth, John A. Miller, Chistoph Bussler, Alexander Maedche, Dieter Fensel, Dennis Gannon

Kno.e.sis Publications

Web services can be defined as loosely coupled, reusable software components that semantically encapsulate discrete functionality and are distributed and programmatically accessible over standard Internet protocols. Web services have received a lot of hype, the reasons for which are not easily determined. Some of their benefits might even seem to waste away, once we touch on the nitty-gritty details, because Web services per se do not offer a solution to underlying problems. The contributions included in this section delve into some of these issues, including: pitfalls of workflow issues; structuring procedural knowledge into problem-solving methods; discussing how a low initial …

Go to article

Under The Plastic: A Quantitative Look At Dvd Video Encoding And Its Impact On Video Modeling, Wu-Chi Feng, Jin Choi, Wu-Chang Feng, Jonathan Walpole Jan 2003

Under The Plastic: A Quantitative Look At Dvd Video Encoding And Its Impact On Video Modeling, Wu-Chi Feng, Jin Choi, Wu-Chang Feng, Jonathan Walpole

Computer Science Faculty Publications and Presentations

In this paper, we examine the DVD encoding process and the implications this process has video modeling and network traffic analysis. We have assembled a system that allows us to extract the video data from the DVDs as they were encoded for distribution. Analyzing the resulting video trace data, we describe how DVD encodings have evolved over time. In addition, our findings show that the underlying video content is fundamentally different than those produced by basic consumer video capture boards. We demonstrate how this affects current video modeling proposals and their affect on network traffic characterization. This research is based …

Go to article

Semantic Web Processes, Jorge Cardoso, Amit P. Sheth Jan 2003

Semantic Web Processes, Jorge Cardoso, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Sip Message Compression Technique For Efficient Multimedia Services In 3g Wireless Communications, Valerie Kenneally Jan 2003

Sip Message Compression Technique For Efficient Multimedia Services In 3g Wireless Communications, Valerie Kenneally

Theses

The direction of the global cellular industry is primarily determined by two standardisation bodies, the 3rd Generation Partnership Project (3GPP) (in Europe and Asia) and 3GPP2 (in North America). Both of these standardisation bodies are currently specifying a core network to deliver IP based multimedia services over 3G wireless networks. One of the fundamental building blocks of this IP based multimedia core network is the use of SIP (Session Initiation Protocol) as the control protocol. The radio resource, that is the available frequency spectrum, in wireless communication systems remains a limiting factor in terms of the bandwidth available to an …

Go to article

Heterogenous Network Management, Kenneth Carey Jan 2003

Heterogenous Network Management, Kenneth Carey

Theses

Enterprise level system development, integrating a broad range of arctures and legacy systems, has received significant attention over the last few yentegrated chain management, which allows companies to see their full manufactu inventory and sales channels, has driven much of this work. Delivering quality IP 1 wireless access is forcing similar integration in 2.5G and 3G telecom archires. Such integration has resulted in the emergence of multi-protocol heterogeneietworks, combining IP core backbones, legacy databases and switchinghnology. Heterogeneous networks, due to their diversity of equipment and suppoDrotocols, introduce challenges for today's network administrators, particularly ii areas of device configuration and alarm …

Go to article

The Staging Transformation Approach To Mixing Initiative, Robert Capra, Michael Narayan, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones Jan 2003

The Staging Transformation Approach To Mixing Initiative, Robert Capra, Michael Narayan, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones

Computer Science Faculty Publications

Mixed-initiative interaction is an important facet of many conversational interfaces, flexible planning architectures, intelligent tutoring systems, and interactive information retrieval systems. Software systems for mixed-initiative interaction must enable us to both operationalize the mixing of initiative (i.e., support the creation of practical dialogs) and to reason in real-time about how a flexible mode of interaction can be supported (e.g., from a meta-dialog standpoint). In this paper, we present the staging transformation approach to mixing initiative, where a dialog script captures the structure of the dialog and dialog control processes are realized through generous use of program transformation techniques (e.g., partial …

Go to article

Formal Concept Analysis And Resolution On Algebraic Domains - Preliminary Report, Matthias Wendt, Pascal Hitzler Jan 2003

Formal Concept Analysis And Resolution On Algebraic Domains - Preliminary Report, Matthias Wendt, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondence between contextual attribute logic on formal contexts resp. concept lattices and a clausal logic on coherent algebraic cpos. We show how to identify the notion of formal concept in the domain theoretic setting. In particular, we show that a special instance of the resolution rule from the domain logic coincides with the concept closure operator from formal concept analysis. The results shed light on the use of contexts and domains for knowledge representation and reasoning purposes.

Go to article

Learning Continuous Latent Variable Models With Bregman Divergences, Shaojun Wang, Dale Schuurmans Jan 2003

Learning Continuous Latent Variable Models With Bregman Divergences, Shaojun Wang, Dale Schuurmans

Kno.e.sis Publications

We present a class of unsupervised statistical learning algorithms that are formulated in terms of minimizing Bregman divergences— a family of generalized entropy measures defined by convex functions. We obtain novel training algorithms that extract hidden latent structure by minimizing a Bregman divergence on training data, subject to a set of non-linear constraints which consider hidden variables. An alternating minimization procedure with nested iterative scaling is proposed to find feasible solutions for the resulting constrained optimization problem. The convergence of this algorithm along with its information geometric properties are characterized.

Go to article

First Prev Next Last