Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (77)
- Social and Behavioral Sciences (74)
- Bioinformatics (73)
- Communication (73)
- Communication Technology and New Media (73)
-
- Life Sciences (73)
- Science and Technology Studies (73)
- Engineering (3)
- Other Computer Sciences (3)
- Theory and Algorithms (3)
- Graphics and Human Computer Interfaces (2)
- Software Engineering (2)
- Computational Engineering (1)
- Computer Engineering (1)
- Computer and Systems Architecture (1)
- Controls and Control Theory (1)
- Education (1)
- Electrical and Computer Engineering (1)
- Emergency and Disaster Management (1)
- Higher Education (1)
- Information Security (1)
- Numerical Analysis and Scientific Computing (1)
- Operations Research, Systems Engineering and Industrial Engineering (1)
- Public Affairs, Public Policy and Public Administration (1)
- Scholarship of Teaching and Learning (1)
- Systems Architecture (1)
- Systems Engineering (1)
- Institution
- Keyword
-
- Semantic Web (8)
- SAWSDL (5)
- Semantic Web Services (5)
- SSW (3)
- Semantic web (3)
-
- WSDL-S (3)
- Communications Society (2)
- Computer science (2)
- Data Integration (2)
- Entrez Gene (2)
- Gene Ontology (2)
- Mashups (2)
- Ontology (2)
- Peer-to-peer computing (2)
- RDF (2)
- Relationship Web (2)
- SA-REST (2)
- SPARQL (2)
- Semantic Analytics (2)
- Semantic Sensor Web (2)
- Web 2.0 (2)
- #antcenter (1)
- ARRAY(0x962d330) (1)
- Abductive Inference (1)
- Adaptive Web Process (1)
- Adaptive Web Service (1)
- Age-independent neighbor replacement (1)
- Age-weighted graph partitioning (1)
- Anonymity (1)
- Authenticated key exchange (1)
- Publication
- Publication Type
Articles 1 - 30 of 84
Full-Text Articles in OS and Networks
Semantic Web For Health Care And Biomedical Informatics, Amit P. Sheth
Semantic Web For Health Care And Biomedical Informatics, Amit P. Sheth
Kno.e.sis Publications
No abstract provided.
Towards Tractable Local Closed World Reasoning For The Semantic Web, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler
Towards Tractable Local Closed World Reasoning For The Semantic Web, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler
Computer Science and Engineering Faculty Publications
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and closed world reasoning for the Semantic Web. We present an extension based on a new three-valued framework including an alternating fixpoint, the well-founded MKNF model. This approach, the well-founded MKNF semantics, derives its name from the very close relation to the corresponding semantics known from logic programming. We show that the well-founded MKNF model is the least model among all (three-valued) MKNF models, thus soundly approximating also the two-valued MKNF models from …
Video On The Semantic Sensor Web, Cory Andrew Henson, Amit P. Sheth, Prateek Jain, Josh Pschorr, Terry Rapoch
Video On The Semantic Sensor Web, Cory Andrew Henson, Amit P. Sheth, Prateek Jain, Josh Pschorr, Terry Rapoch
Kno.e.sis Publications
Millions of sensors around the globe currently collect avalanches of data about our world. The rapid development and deployment of sensor technology is intensifying the existing problem of too much data and not enough knowledge. With a view to alleviating this glut, we propose that sensor data, especially video sensor data, can be annotated with semantic metadata to provide contextual information about videos on the Web. In particular, we present an approach to annotating video sensor data with spatial, temporal, and thematic semantic metadata. This technique builds on current standardization efforts within the W3C and Open Geospatial Consortium (OGC) and …
A General Boosting Method And Its Application To Learning Ranking Functions For Web Search, Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier Chapelle, Keke Chen, Gordon Sun
A General Boosting Method And Its Application To Learning Ranking Functions For Web Search, Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier Chapelle, Keke Chen, Gordon Sun
Kno.e.sis Publications
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach is based on optimization of quadratic upper bounds of the loss functions which allows us to present a rigorous convergence analysis of the algorithm. More importantly, this general framework enables us to use a standard regression base learner such as decision trees for fitting any loss function. We illustrate an application of the proposed method in learning ranking functions for Web search by combining both preference data and labeled data for training. We present experimental …
Multi-Order Neurons For Evolutionary Higher Order Clustering And Growth, Kiruthika Ramanathan, Sheng Uei Guan
Multi-Order Neurons For Evolutionary Higher Order Clustering And Growth, Kiruthika Ramanathan, Sheng Uei Guan
Research Collection School Of Computing and Information Systems
This letter proposes to use multiorder neurons for clustering irregularly shaped data arrangements. Multiorder neurons are an evolutionary extension of the use of higher-order neurons in clustering. Higher-order neurons parametrically model complex neuron shapes by replacing the classic synaptic weight by higher-order tensors. The multiorder neuron goes one step further and eliminates two problems associated with higher-order neurons. First, it uses evolutionary algorithms to select the best neuron order for a given problem. Second, it obtains more information about the underlying data distribution by identifying the correct order for a given cluster of patterns. Empirically we observed that when the …
What Is Rcu, Fundamentally?, Paul E. Mckenney, Jonathan Walpole
What Is Rcu, Fundamentally?, Paul E. Mckenney, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Read-copy update (RCU) is a synchronization mechanism that was added to the Linux kernel in October of 2002. RCU achieves scalability improvements by allowing reads to occur concurrently with updates. In contrast with conventional locking primitives that ensure mutual exclusion among concurrent threads regardless of whether they be readers or updaters, or with reader-writer locks that allow concurrent reads but not in the presence of updates, RCU supports concurrency between a single updater and multiple readers. RCU ensures that reads are coherent by maintaining multiple versions of objects and ensuring that they are not freed up until all pre-existing read-side …
Leveraging Semantic Web Techniques To Gain Situational Awareness, Amit P. Sheth
Leveraging Semantic Web Techniques To Gain Situational Awareness, Amit P. Sheth
Kno.e.sis Publications
No abstract provided.
Can Semantic Web Techniques Empower Comprehension And Projection In Cyber Situational Awareness?, Amit P. Sheth
Can Semantic Web Techniques Empower Comprehension And Projection In Cyber Situational Awareness?, Amit P. Sheth
Kno.e.sis Publications
No abstract provided.
Semantic Convergence Of Wikipedia Articles, Christopher J. Thomas, Amit P. Sheth
Semantic Convergence Of Wikipedia Articles, Christopher J. Thomas, Amit P. Sheth
Kno.e.sis Publications
Social networking, distributed problem solving and human computation have gained high visibility. Wikipedia is a well established service that incorporates aspects of these three fields of research. For this reason it is a good object of study for determining quality of solutions in a social setting that is open, completely distributed, bottom up and not peer reviewed by certified experts. In particular, this paper aims at identifying semantic convergence of Wikipedia articles; the notion that the content of an article stays stable regardless of continuing edits. This could lead to an automatic recommendation of good article tags but also add …
Supporting Complex Thematic, Spatial And Temporal Queries Over Semantic Web Data, Matthew Perry, Amit P. Sheth, Farshad Hakimpour, Prateek Jain
Supporting Complex Thematic, Spatial And Temporal Queries Over Semantic Web Data, Matthew Perry, Amit P. Sheth, Farshad Hakimpour, Prateek Jain
Kno.e.sis Publications
Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. Often, the analytical process requires uncovering and analyzing complex thematic relationships between disparate people, places and events. Fundamentally new query operators based on the graph structure of Semantic Web data models, such as semantic associations, are proving useful for this purpose. However, these analysis mechanisms are primarily intended for thematic relationships. In this paper, we describe a framework built around the RDF metadata model for analysis of thematic, spatial and temporal relationships between named entities. We …
Conjunctive Queries For A Tractable Fragment Of Owl 1.1, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler
Conjunctive Queries For A Tractable Fragment Of Owl 1.1, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler
Computer Science and Engineering Faculty Publications
Despite the success of the Web Ontology Language OWL, the development of expressive means for querying OWL knowledge bases is still an open issue. In this paper, we investigate how a very natural and desirable form of queries-namely conjunctive ones-can be used in conjunction with OWL such that one of the major design criteria of the latter-namely decidability-can be retained. More precisely, we show that querying the tractable fragment EL++ of OWL 1.1 is decidable. We also provide a complexity analysis and show that querying unrestricted EL++ is undecidable.
A Proposed Statistical Protocol For The Analysis Of Metabolic Toxicological Data Derived From Nmr Spectroscopy, Benjamin J. Kelly, Paul E. Anderson, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom, Michael L. Raymer
A Proposed Statistical Protocol For The Analysis Of Metabolic Toxicological Data Derived From Nmr Spectroscopy, Benjamin J. Kelly, Paul E. Anderson, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom, Michael L. Raymer
Kno.e.sis Publications
Nuclear magnetic resonance (NMR) spectroscopy is a non-invasive method of acquiring a metabolic profile from biofluids. This metabolic information may provide keys to the early detection of exposure to a toxin. A typical NMR toxicology data set has low sample size and high dimensionality. Thus, traditional pattern recognition techniques are not always feasible. In this paper, we evaluate several common alternatives for isolating these biomarkers. The fold test, unpaired t-test, and paired t-test were performed on an NMR-derived toxicological data set and results were compared. The paired t-test method was preferred, due to its ability to attribute statistical significance, to …
A Multi-Objective Genetic Algorithm That Employs A Hybrid Approach For Isolating Codon Usage Bias Indicative Of Translational Efficiency, Douglas W. Raiford, Dan E. Krane, Travis E. Doom, Michael L. Raymer
A Multi-Objective Genetic Algorithm That Employs A Hybrid Approach For Isolating Codon Usage Bias Indicative Of Translational Efficiency, Douglas W. Raiford, Dan E. Krane, Travis E. Doom, Michael L. Raymer
Kno.e.sis Publications
Isolation of translational efficiency bias can have important applications in gene expression prediction and heterologous protein production. In some genomes the presence of a high GC(AT)-content bias can confound the isolation of translational efficiency bias. In other organisms translational efficiency bias is weak making it difficult to isolate. Described here is a multi-objective genetic algorithm that improves the isolation of translational efficiency bias in Streptomyces coelicolor A3(2) and Pseudomonas aeruginosa PAO1, two organisms shown to have high GC-content and weak translational efficiency bias.
Swashup: Situational Web Applications Mashups, E. Michael Maximilien, Ajith Harshana Ranabahu, Stefan Tai
Swashup: Situational Web Applications Mashups, E. Michael Maximilien, Ajith Harshana Ranabahu, Stefan Tai
Kno.e.sis Publications
Distributed programming has shifted from private networks to the Internet using heterogeneous Web APIs. This enables the creation of situational applications of composed services exposing user interfaces, i.e., mashups. However, this programmable Web lacks unified models that can facilitate mashup creation, reuse, and deployments. This poster demonstrates a platform to facilitate Web 2.0 mashups.
Integrating Game Technology And Discrete Event Simulation To Analyze Mass Casualty Scenarios, Jason Loveland
Integrating Game Technology And Discrete Event Simulation To Analyze Mass Casualty Scenarios, Jason Loveland
Computational Modeling & Simulation Engineering Theses & Dissertations
In the last 10 years, video games have become complex simulation environments with high resolution 3D graphics enabled by powerhouse rendering engines, multi-player client server networks, user friendly displays and graphical user interface , while remaining relatively inexpensive. There is a critical need for systems engineering analysis and rapid trade studies due to changes in operations caused by current events such as terrorist attacks, asymmetric threats, natural disasters, etc. Modem games provide a unique way to visualize and interact with these complex environments, scenarios, missions, and operations. A discrete event simulator (DES) provides an environment to model system architecture behavior, …
Mining Web-Functional Dependencies For Flexible Information Access, Saverio Perugini, Naren Ramakrishnan
Mining Web-Functional Dependencies For Flexible Information Access, Saverio Perugini, Naren Ramakrishnan
Computer Science Faculty Publications
We present an approach to enhancing information access through Web structure mining in contrast to traditional approaches involving usage mining. Specifically, we mine the hardwired hierarchical hyperlink structure of Web sites to identify patterns of term-term co-occurrences we call Web functional dependencies (FDs). Intuitively, a Web FD ‘x y’ declares that all paths through a site involving a hyperlink labeled x also contain a hyperlink labeled y. The complete set of FDs satisfied by a site help characterize (flexible and expressive) interaction paradigms supported by a site, where a paradigm is the set of explorable sequences therein. …
Realizing The Relationship Web: Morphing Information Access On The Web From Today's Document- And Entity-Centric Paradigm To A Relationship-Centric Paradigm, Amit P. Sheth
Kno.e.sis Publications
No abstract provided.
Comparing Disjunctive Well-Founded Semantics, Matthias Knorr, Pascal Hitzler
Comparing Disjunctive Well-Founded Semantics, Matthias Knorr, Pascal Hitzler
Computer Science and Engineering Faculty Publications
While the stable model semantics, in the form of Answer Set Programming, has become a successful semantics for disjunctive logic programs, a corresponding satisfactory extension of the well-founded semantics to disjunctive programs remains to be found. The many current proposals for such an extension are so diverse, that even a systematic comparison between them is a challenging task. In order to aid the quest for suitable disjunctive well-founded semantics, we present a systematic approach to a comparison based on level mappings, a recently introduced framework for characterizing logic programming semantics, which was quite successfully used for comparing the major semantics …
Description Logic Programs: Normal Forms, Pascal Hitzler, Andreas Eberhart
Description Logic Programs: Normal Forms, Pascal Hitzler, Andreas Eberhart
Computer Science and Engineering Faculty Publications
The relationship and possible interplay between different knowledge representation and reasoning paradigms is a fundamental topic in artificial intelligence. For expressive knowledge representation for the Semantic Web, two different paradigms - namely Description Logics (DLs) and Logic Programming - are the two most successful approaches. A study of their exact relationships is thus paramount. An intersection of OWL with (function-free non-disjunctive) Datalog, called DLP (for Description Logic Programs), has been described in [1,2]. We provide normal forms for DLP in Description Logic syntax and in Datalog syntax, thus providing a bridge for the researcher and user who is familiar with …
Sa-Rest And (S)Mashups: Adding Semantics To Restful Services, Jonathan Lathem, Karthik Gomadam, Amit P. Sheth
Sa-Rest And (S)Mashups: Adding Semantics To Restful Services, Jonathan Lathem, Karthik Gomadam, Amit P. Sheth
Kno.e.sis Publications
The evolution of the Web 2.0 phenomenon has led to the increased adoption of the RESTful services paradigm. RESTful services often take the form of RSS/Atom feeds and AJAX based light weight services. The XML based messaging paradigm of RESTful services has made it possible to compose various services together. Such compositions of RESTful services is widely referred to as Mashups. In this paper, we outline the limitations in current approaches to creating mashups. We address these limitations by proposing a framework called as SA-REST. SA-REST adds semantics to RESTful services. Our proposed framework builds upon the original ideas in …
The Programmable Web: Agile, Social, And Grassroots Computing, E. Michael Maximilien, Ajith Harshana Ranabahu
The Programmable Web: Agile, Social, And Grassroots Computing, E. Michael Maximilien, Ajith Harshana Ranabahu
Kno.e.sis Publications
Web services, the semantic Web, and Web 2.0 are three somewhat separate movements trying to make the Web a programmable substrate. While each has achieved some level of success on their own right, it is becoming apparent that the grassroots approach of the Web 2.0 is gaining greater success than the other two. In this paper we analyze each movement, briefly describing its main traits, and outlining its primary assumptions. We then frame the common problem of achieving a programmable Web within the context of distributed computing and software engineering and then attempt to show why Web 2.0 is closest …
Any-World Access To Owl From Prolog, Tobias Matzner, Pascal Hitzler
Any-World Access To Owl From Prolog, Tobias Matzner, Pascal Hitzler
Computer Science and Engineering Faculty Publications
The W3C standard OWL provides a decidable language for representing ontologies. While its use is rapidly spreading, efforts are being made by researchers worldwide to augment OWL with additional expressive features or by interlacing it with other forms of knowledge representation, in order to make it applicable for even further purposes. In this paper, we integrate OWL with one of the most successful and most widely used forms of knowledge representation, namely Prolog, and present a hybrid approach which layers Prolog on top of OWL in such a way that the open-world semantics of OWL becomes directly accessible within the …
Anonymous And Authenticated Key Exchange For Roaming Networks, Guomin Yang, Duncan S. Wong, Xiaotie Deng
Anonymous And Authenticated Key Exchange For Roaming Networks, Guomin Yang, Duncan S. Wong, Xiaotie Deng
Research Collection School Of Computing and Information Systems
User privacy is a notable security issue in wireless communications. It concerns about user identities from being exposed and user movements and whereabouts from being tracked. The concern of user privacy is particularly signified in systems which support roaming when users are able to hop across networks administered by different operators. In this paper, we propose a novel construction approach of anonymous and authenticated key exchange protocols for a roaming user and a visiting server to establish a random session key in such a way that the visiting server authenticates the user's home server without knowing exactly who the user …
Sensor Data Management, Cory Andrew Henson
Sensor Data Management, Cory Andrew Henson
Kno.e.sis Publications
No abstract provided.
Csi Revisited: The Science Of Forensic Dna Analysis, Michael L. Raymer
Csi Revisited: The Science Of Forensic Dna Analysis, Michael L. Raymer
Kno.e.sis Publications
No abstract provided.
Relationship Web: Spinning The Semantic Web From Trailblazing To Complex Hypothesis Evaluation, Amit P. Sheth
Relationship Web: Spinning The Semantic Web From Trailblazing To Complex Hypothesis Evaluation, Amit P. Sheth
Kno.e.sis Publications
No abstract provided.
Trailblazing, Complex Hypothesis Evaluation, Abductive Reasoning And Semantic Web - Exploring Possible Synergy, Amit P. Sheth
Trailblazing, Complex Hypothesis Evaluation, Abductive Reasoning And Semantic Web - Exploring Possible Synergy, Amit P. Sheth
Kno.e.sis Publications
No abstract provided.
Space Adaptation: Privacy-Preserving Multiparty Collaborative Mining With Geometric Perturbation, Keke Chen, Ling Liu
Space Adaptation: Privacy-Preserving Multiparty Collaborative Mining With Geometric Perturbation, Keke Chen, Ling Liu
Kno.e.sis Publications
The service-oriented infrastructure has become popular for collaboratively mining data distributed over organizations [3], where the participants are the data providers who submit their perturbed datasets to the designated data mining service provider (the data miner) for mining commonly interested models.
Semantic Web: Promising Technologies And Current Applications In Health Care & Life Sciences, Amit P. Sheth
Semantic Web: Promising Technologies And Current Applications In Health Care & Life Sciences, Amit P. Sheth
Kno.e.sis Publications
No abstract provided.
Efficient Computation Of Iceberg Cubes By Bounding Aggregate Functions, Xiuzhen Zhang, Pauline Lienhua Chou, Guozhu Dong
Efficient Computation Of Iceberg Cubes By Bounding Aggregate Functions, Xiuzhen Zhang, Pauline Lienhua Chou, Guozhu Dong
Kno.e.sis Publications
The iceberg cubing problem is to compute the multidimensional group-by partitions that satisfy given aggregation constraints. Pruning unproductive computation for iceberg cubing when nonantimonotone constraints are present is a great challenge because the aggregate functions do not increase or decrease monotonically along the subset relationship between partitions. In this paper, we propose a novel bound prune cubing (BP-Cubing) approach for iceberg cubing with nonantimonotone aggregation constraints. Given a cube over n dimensions, an aggregate for any group-by partition can be computed from aggregates for the most specific n--dimensional partitions (MSPs). The largest and smallest aggregate values computed this way become …