ppxscal/embedding_network huggingface dataset:
Applying Semantic Rules to Achieve Dynamic Service Oriented Architectures
Authors: Suzette Stoutenburg, Leo Obrst, Deborah Nichols, Ken Samuel, Paul Franklin
Venue: Proceedings of the Second International Conference on Rules and Rule Markup Languages for the Semantic Web (2006)

As the complexity and tempo of world events increase, Command and Control (C2) systems must move to a new paradigm that supports the ability to dynamically modify system behavior in complex, changing environments. Historically, the behavior of Department of Defense (DoD) C2 systems has been embedded in executable code, providing static functionality that is difficult to change. We propose the use of semantic models to represent system behaviors abstracted from procedural code, and we demonstrate that this provides a well-defined foundation for dynamic Service Oriented Architectures. This paper describes an implementation that models a military convoy traveling through an unsecured area under changing conditions. The W3C standard Web Ontology Language (OWL) was used to describe the battlespace domain, and the proposed W3C Semantic Web Rule Language (SWRL) was used to capture recommended operating procedures for convoys in theater. In our experiment, two sets of rules were used: one set models rules of engagement for favorable visibility conditions on the battlefield, and the other models rules of engagement for poor visibility conditions. Ontologies and rule sets were translated into integrated knowledge bases that could be consulted as a service to derive alerts and recommendations for the convoy commander. Messages injected over an enterprise service bus (ESB) provide the changing conditions that affect the battlespace. We then were able to show that a dynamic event, such as an unexpected sandstorm, causes the appropriate set of rules of engagement grounded in the ontologies to be applied to the service to guide the convoy to safety. This paper describes the overall approach and the challenges we encountered. We outline the architectural options for constructing dynamic services and describe the semantic-based approach selected. We conclude with our findings and recommendations, including a set of requirements for a standard rule language needed to support agile services.
Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness
Authors: Rafael Pass
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

Two long-standing open problems exist on the fringe of Complexity Theory and Cryptography: 1. Does there exist a reduction from an NP-Complete Problem to a one-way function? 2. Do parallelized versions of classical constant-round zero-knowledge proofs for NP conceal every "hard" bit of the witness to the statement proved?We show that, unless the Polynomial-Hierarchy collapses, black-box reductions cannot be used to provide positive answers to both questions.
Measuring dissimilarity in online health search activities
Authors: Daniel P. Lorence, Heeyoung Park
Venue: Technology and Health Care (2006)

There is growing evidence of the use of the Internet to obtain critical health information as well as increased diversity of user groups. While users of web-based information often report their reliance on healthcare providers for validation of information, it has yet to be determined if this is universally true across all types of information or user groups. In some cases consumers may aggregate in places where they trust web information (relative to provider-based information), such as areas of unsettled diagnostic methods or ambiguous treatment protocols. To date little research has been done to identify and differentiate clusters of health consumers and their similarities related to type of information sought. Data from a study of consumer Web search activity in a post-intervention era serves as a natural experiment, and can identify whether clusters of "digitally underserved groups" persist in the US, following national efforts to eliminate barriers to health information access. This exploratory technology assessment study seeks to differentiate and delineate specific information behaviors, across targeted healthcare subgroups. Doing so allows the design of more effective strategies to promote the use of the Web as a health education and health promotion tool, under the envisioned shared decisionmaking, consumer-centric health information model, critical to the proposed US national health information infrastructure.
Probabilistic Ranking Queries on Gaussians
Authors: Christian Bohm, Alexey Pryakhin, Matthias Schubert
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is modeled by probability distributions instead of exact feature values. A typical application of such an uncertainty model are moving objects where the exact position of each object can be determined only at discrete time intervals. Queries often involve the positions of objects between two such time stamps or after the last known time stamp. Then the objects are essentially uncertain unless the pattern of movement is very simple (e.g. linear). One of the most important probability density functions for those applications is the Gaussian or normal distribution which can be defined by a mean value and a standard deviation. In this paper, we examine a new type of queries on uncertain data objects, called probability ranking queries (PRQ). A PRQ retrieves those k objects which have the highest probability of being located inside a given query area. To speed up probabilistic queries on large sets of uncertain data objects described by Gaussians, we introduce a novel index structure called Gauss-tree. Furthermore, we provide an algorithm for employing the Gauss-tree to answer PRQs. In our experimental evaluation, we demonstrate that the Gauss-tree achieves a considerable efficiency advantage with respect to PRQs compared to other applicable methods.
A Large-scale Neurocomputational Model of Task-oriented Behavior Selection and Working Memory in Prefrontal Cortex
Authors: George L. Chadderdon, Olaf Sporns
Venue: Journal of Cognitive Neuroscience (2006)

The prefrontal cortex (PFC) is crucially involved in the executive component of working memory, representation of task state, and behavior selection. This article presents a large-scale computational model of the PFC and associated brain regions designed to investigate the mechanisms by which working memory and task state interact to select adaptive behaviors from a behavioral repertoire. The model consists of multiple brain regions containing neuronal populations with realistic physiological and anatomical properties, including extrastriate visual cortical regions, the inferotemporal cortex, the PFC, the striatum, and midbrain dopamine (DA) neurons. The onset of a delayed match-to-sample or delayed nonmatch-to-sample task triggers tonic DA release in the PFC causing a switch into a persistent, stimulus-insensitive dynamic state that promotes the maintenance of stimulus representations within prefrontal networks. Other modeled prefrontal and striatal units select cognitive acceptance or rejection behaviors according to which task is active and whether prefrontal working memory representations match the current stimulus. Working memory task performance and memory fields of prefrontal delay units are degraded by extreme elevation or depletion of tonic DA levels. Analyses of cellular and synaptic activity suggest that hyponormal DA levels result in increased prefrontal activation, whereas hypernormal DA levels lead to decreased activation. Our simulation results suggest a range of predictions for behavioral, single-cell, and neuroimaging response data under the proposed task set and under manipulations of DA concentration.
A high resolution scheme for Eulerian gas-solid two-phase isentropic flow
Authors: Justin Hudson, David Harris
Venue: Journal of Computational Physics (2006)

Numerical solutions of the equations governing two-phase isentropic flow of a solid granular material dispersed in a gas are investigated. Both the dispersed and continuous phases are treated as continua and an Eulerian description of the flow is adopted. We present an inviscid model with a general pressure term from which a number of variant models can be obtained. A high resolution scheme is presented to obtain numerical approximations of the equations in each of the models. We investigate whether the chosen numerical scheme is suitable for the equations governing the models and use the numerical results to obtain quantitative and qualitative insight into the predictions of each of the models. Three test cases, new to the literature, are considered, and the numerical results compared.
Improved Guided Position Scrambling for Digital Watermarking
Authors: Akiomi Kunisa, Kousuke Tsujita
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Two techniques which improve the guided position scrambling applied to digital watermarking are described. One is the correlation criterion which is used for deciding the most suitable marking position at the encoder. This criterion, whose hardware complexity is low, is equivalent to the one generally using watermark-to-document and noise ratio. The other is a method in which a watermark to have been embedded assumedly is not presented at the decoder. This can broaden the applications of guided position scrambling.
An Implementation Scheme of Relational Tables
Authors: Masayuki Kuroda, Naoki Amma, K. M. Azharul Hasan, Tatsuo Tsuji, Ken Higuchi
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

A new implementation scheme for relational tables is proposed, and a prototype system based on the scheme is evaluated. The scheme implements a relational table by employing a multidimensional array like in MOLAP systems. Using multidimensional arrays provides many advantages, however uses suffer from some problems. In our scheme, these problems are solved by an efficient scheme of record encoding based on the notion of extendible array. Our scheme exhibits good performance in space and time costs compared with conventional implementation.
Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
Authors: Yonatan Aumann, Michael A. Bender
Venue: Distributed Computing (2005)

We consider asynchronous consensus in the shared-memory setting. We present the first efficient low-contention consensus algorithm for the weak-adversary-scheduler model. The algorithm achieves consensus in O(n log2 n) total work and O(log n) (hot-spot) contention, both expected and with high probability. The algorithm assumes the value-oblivious scheduler, which is defined in the paper. Previous efficient consensus algorithms for weak adversaries suffer from Ω(n) memory contention.
An Electrophysiological Investigation of Factors Facilitating Strategic Recollection
Authors: J. E. Herron, E. L. Wilding
Venue: Journal of Cognitive Neuroscience (2005)

Episodic memory is thought to be mediated by executive processes that facilitate the retrieval of task-relevant information at the expense of irrelevant information. The exclusion task [A process dissociation framework: Separating automatic from intentional uses of memory. Journal of Memory and Language, 30, 513&ndash;541, 1991] can be used to explore these processes. In this task, studied items from one source ("targets") are endorsed on one response key, whereas new and studied items from another source ("nontargets") are rejected on another key. Herron and Rugg [Strategic influences on recollection in the exclusion task: Electrophysiological evidence. Psychonomic Bulletin and Review, 10, 703&ndash;710, 2003] reported that nontargets elicited the ERP correlate of recollection (the "left parietal old/new effect") when target accuracy was low, but not when it was high. Their explanation for this was that participants only focused exclusively on the recollection of target information when the likelihood of target recollection was high, as under these conditions this strategy is one that that will give rise to accurate task performance. The fact, however, that targets were encoded in different tasks in the high- and low-accuracy groups means that the results can also be explained in terms of the encoding operations performed at study rather than in terms of target accuracy. This study was designed to distinguish between these competing accounts. All targets were encoded elaboratively. Target accuracy was reduced in one condition with a 40-min study-test interval. Nontargets elicited no left parietal effect in either condition, suggesting that target-specific strategic retrieval is facilitated by certain classes of encoding operations rather than simply high target accuracy per se.
Load Indices - Past, Present and Future
Authors: Kalinka Regina Lucas Jaquie Castelo Regina, Edward David Moreno Ordonez
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

To achieve superior performance levels when working with heterogeneous distributed platforms, process-scheduling decisions must be based essentially on the platform's features and on the application's demands. A primary objective of computing systems is the efficient use of available resources. The effective use of these resources in this type of system therefore requires strategies to distribute process scheduling equally among the multiple processors available. An essential element of the scheduling policy is the measurement of loads, and an accurate load index is required to manage the load distribution efficiently. Therefore, this paper sought to compile and present a survey of the load indices contained in the literature, present a new one used to obtain better performance in heterogeneous systems and propose new investigation to the future of load indices and load metrics.
Resolving Spectrally Similar Landuse/Landcover Class Conflict in Remote Sensing Images Using Rough Sets
Authors: V. K. Panchal, P. C. Saxena, B. Deshmukh, Shaveta Shaveta
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Major source of the geospatial information for a variety of applications including mission critical analysis, land cover mapping, etc. is the satellite based sensors facilitating different manifestations of the terrain. Yet, the spectral signatures between distinct features may sometimes be too subtle to discriminate, given the spectral and radiometric resolution of the sensor systems. The human expert understands the presence of spectrally indiscernible distinct classes based on his/her expertise and that may be defined as the class conflict. We note that the class conflict problem is usually avoided in selecting the Landuse/Landcover. In this study, the results indicate that the model developed by rough sets facilitate us an insight into the expert's knowledge and provide an efficient and transparent mechanism to resolve such a real world problem of class conflict. Also, it speaks on the pointer to the extent to which the training dataset may be used.
Transport Services System Integration and Optimization in Agent Based Model
Authors: Hayfa ZGAYA, Slim HAMMADI
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Transport users require relevant, interactive and instantaneous information before and during their travels. For these needs, a Transport Multimodal Information System (TMIS) can propose a support tool adapted to the exponential growth of services and information available on large networks like the internet. In this context and even if many researchers have discussed for a long time its benefits, the mobile agent paradigm could be very efficient compared to the classical client server one if it is used through an optimization approach. In this paper, we propose an efficient model based on a multi-agent-system, using the mobile agent paradigm, in order to optimize the research and the composition of the transport business services.
A Vertex-Arc-United Bidirectional Adjustment Algorithm in Lifetime Optimization of Sensor Networks
Authors: Yantao Pan, Wei Peng, Xicheng Lu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Sensor networks are highly constrained by limited energy. It is reasonable to take energy efficient protocols to prolong the network lifetime, because communications consume the most energy. In addition, the influx of traffic is a main characteristic that distinguish sensor networks from others e.g. Internet and Manet. Therefore, optimal traffic distribution will maximize the lifetime of sensor networks. In this paper, we formalize the lifetime maximizing problem to a multi-source multi-sink flow-maximizing problem on a directed graph with arc and vertex capacity powers and propose a polynomial method to solve it.
Is externally-regulated learning by a human tutor effective in facilitating learning with hypermedia?
Authors: Roger Azevedo, Jeffrey A. Greene, Daniel C. Moos, Fielding I. Winters, Pragati Godbole-Chaudhuri, Jennifer G. Cromley
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

We examined the effectiveness of self-regulated learning (SRL) and externally regulated learning (ERL) on college students' learning about a science topic with hypermedia. Eighty-two (N = 82) college students with little knowledge of the topic were randomly assigned either to the SRL or ERL condition. Learners in the SRL condition regulated their own learning, while learners in the ERL condition had access to a human tutor who facilitated their self-regulated learning. We converged product (pretest to posttest declarative knowledge and qualitative shifts in participants' mental models) with process (think-aloud) data to examine the effectiveness of SRL and ERL on learning about the circulatory system during a 40-minute session. Analysis of the declarative knowledge measures showed that the ERL condition group means were statistically significantly higher than the group means for the SRL condition on the labeling and flow diagram tasks. There were no statistically significant differences between group means on the matching task, but both groups showed statistically significant increases in performance. Further analyses showed no statistically significant differences for the distribution of mental model shift between groups. In terms of self-regulatory processes, participants in the SRL condition engaged in more frequent use of sub-goals, self-questioning, selecting new information sources, re-reading, summarizing, free searching, and enacting control over the context of their learning. In comparison, the ERL participants engaged in more frequent activation of prior knowledge, utilization of feeling of knowing and judgment of learning, monitoring their progress toward goals, drawing, hypothesizing, coordination of information sources, and expressing task difficulty.
A Novel Time-Frequency Analysis Method for Mechanical Failure Detection
Authors: Zhuofu Liu
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

This research will attempt to analyze the effectiveness of the Empirical Mode Decomposition (EMD) in diagnostics of gearboxes operating under non-stationary rotational speed. For this, a simple software program for signal processing and extraction of mechanical failure detection was developed and tested. The primary aim is to reveal the nonlinear behavior of the system by using time frequency methods as an alternative to Fourier analysis methodology. Both simulated and experimental response data are analyzed by applying EMD and time-frequency analysis. The following examples demonstrate the improvements in the detection of gear faults.
A mobility monitoring based advance reservation protocol
Authors: Ian Featherstone, Ning Zhang
Venue: Proceedings of the 2nd ACM international workshop on Quality of service security for wireless and mobile networks (2006)

Future wireless cellular networks will be Internet Protocol (IP) based. Users of wireless devices in these networks will expect to run real-time applications that require guarantees of Quality of Service (QoS). Such a user will expect the same seamless QoS that he would receive if he were running real-time applications on a wired network. Achieving seamless QoS in a mobile environment implies that a reservation should be re-established at the new Base Station (BS) before hand-over occurs. However, making these advance reservations is wasteful of valuable bandwidth in the wireless network. This paper proposes a protocol, called the Mobility Monitoring Based Advance Reservation Protocol (M²BARP), which aims to reduce the bandwidth overhead of making advance reservations. The protocol makes use of information about a Mobile Node's (MN) mobility to make a single advance reservation when the MN is about to hand-over. Unlike previous work, M²BARP takes advantage of overlapping cells to help to provide a more seamless QoS by reducing the number of calls dropped at hand-over
Issues, Challenges, and Future Directions in Multimedia Research
Authors: Masahito Hirakawa, Max Muhlhauser, Susanto Rahardja, Phillip Sheu, Larry Smarr, Jeffrey Tsai
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

This panel is to discuss issues, challenges, and future directions in multimedia research, along the following three scale-oriented issues plus the one which is common to them.
Invariant Object Material Identification via Discriminant Learning on Absorption Features
Authors: Zhouyu Fu, Antonio Robles-Kelly, Robby T. Tan, Terry Caelli
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In this paper, we propose a novel approach to object material identification in spectral imaging by combining the use of absorption features and statistical machine learning techniques. We depart from the significance of spectral absorption features for material identification and cast the problem into a classification setting which can be tackled using support vector machines. Hence, we commence by proposing a novel method for the robust detection of absorption bands in the spectra. With these bands at hand, we show how those absorptions which are most relevant to the classification task in hand may be selected via discriminant learning. We then train a support vector machine for purposes of classification making use of an absorption feature representation scheme which is robust to varying photometric conditions. We perform experiments on real world data and compare the results yield by our approach with those recovered using an alternative. We also illustrate the invariance of the absorption features recovered by our method to different photometric effects.
Leader Election in the Timed Finite Average Response Time Model
Authors: Christof Fetzer, Martin Subkraut
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Leader Election is one of the fundamental problems in distributed systems. A leader is a correct process that can be used to coordinate the work of a set of processes. An algorithm has to implement two properties to solve the Leader Election problem: