ppxscal/embedding_network huggingface dataset:
Legal ontology of sales law application to ecommerce
Authors: John Bagby, Trachy Mullen
Venue: Artificial Intelligence and Law (2007)

Legal codes, such as the Uniform Commercial Code (UCC) examined in this article, are good points of entry for AI and ontology work because of their more straightforward adaptability to relationship linking and rules-based encoding. However, approaches relying on encoding solely on formal code structure are incomplete, missing the rich experience of practitioner expertise that identifies key relationships and decision criteria often supplied by experienced practitioners and process experts from various disciplines (e.g., sociology, political economics, logistics, operations research). This research focuses on the UCC because it transcends the limitations of a formal code, functioning essentially as a composite. AI work can benefit from real-world codes like the UCC, which are essentially formal codes enlightened from a more realistic experience-base from centuries of development in international commercial transactions settings. This paper then describes our initial work in converting an expert system on the U.S. law governing the sale of goods from Article II of the Uniform Commercial Code (UCC), into a knowledge-based system using the Web Ontology Language OWL.
Exception Handling Policies for Composite Web Services and their Formal Description
Authors: Qin Lu, Weishi Zhang, Bo Su, Xiuguo Zhang
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

This paper presents seven exception handling policies for composite Web services and their formal description method, which aims to formally describe events, conditions and states associated with exception handling during composite Web services execution, further to facilitate the implementation of exception handling for composite Web services. The description method is based on the predication logic and statechart. Predication is used to define concepts and statechart is used to describe the execution process of composite Web services. The exception handling policies are described formally according to how and when the exception handling actions are executed. ECA (Event-Condition-Action) rules are used to express the events, conditions and exception handling actions during exception handling. An application case is presented to show how to describe the exception handling policies using our description method.
A parameterized model transformations approach for automating middleware QoS configurations in distributed real-time and embedded systems
Authors: Amogh Kavimandan, Aniruddha Gokhale
Venue: Proceedings of the 2007 workshop on Automating service quality: Held at the International Conference on Automated Software Engineering (ASE) (2007)

Model transformation is a key requirement of model-based software development processes, such as middleware quality of service (QoS) configuration which involves mapping domain-specific requirements onto the right set of middleware-specific configuration options. There exists a significant opportunity to factor out commonality patterns from individual platform-specific transformation mappings to develop general-purpose transformations. Although existing model transformation tools provide support for developing, testing and debugging transformation rules using a variety of approaches, the development of templatized, reusable (patterns of) model transformations is not well supported. We introduce the concept of transformation template specialization that:(1) allows developers to specify variability points in their transformation project, (2) automatically creates a modeling language that captures middleware platform variabilities, and (3) accommodates these varabilities in the transformation project such that platform-specific model transformations can be instantiated.
Fast Placement Optimization of Power Supply Pads
Authors: Yu Zhong
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Power grid networks in VLSI circuits are required to provide adequate input supply to ensure reliable performance. In this paper, we propose algorithms to find the placement of power pads that minimize not only the worst voltage drop but also the voltage deviation across the power grid. Our algorithm uses simulated annealing to minimize the total cost of voltage drops. The key enabler for efficient optimization is a fast localized node-based iterative method to compute the voltages after each movement of pads. Experimental results show that our algorithm demonstrates good runtime characteristics for power grids with large numbers of pad candidates in multi-million-size circuits. For a 16-million-node power grid with 646 thousand pad candidates, our algorithm took 72 minutes to improve the worst voltage drop from 0.398V to 0.196V and reduce the deviation of voltages on the power grid from 0.134V to 0.0241V.
A DHT-based Infrastructure for Content-based Publish/Subscribe Services
Authors: Xiaoyu Yang, Yiming Hu
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Publish/Subscribe model has become a prevalent paradigm for building distributed event delivering systems. Content-based publish/subscribe allows high expresses in subscriptions and thus is more appropriate for content dissemination. However, the scalability has remained a challenge in the design of distributed content-based pub- lish/subscribe systems due to the expensive matching and delivering cost of content-based events. In this paper we propose an infrastructure built on top of distributed hash table for efficient content-based data distribution. Based on efficient subscription installation, event publication and event delivery mechanisms, the proposed infrastructure can simultaneously support any numbers of pub/sub schemas with different number of attributes. There are three key features in our design: (1) a locality-preserving hashing mechanism which partitions and maps the content space to nodes. Subscriptions and events are mapped to the corre- sponding node for efficiently matching; (2) an efficient event delivery algorithm which exploits the embedded trees in the underlying DHT to deliver events to the corresponding sub- scribers; (3) light-weighted load balancing mechanisms to adjust the load among peers and ensure that no peer is un- duly loaded.
A dual-view approach to interactive network visualization
Authors: Galileo Mark Namata, Brian Staats, Lise Getoor, Ben Shneiderman
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network data, users not only have to visualize the attributes specific to each data item, but also the links specifying how those items are connected to each other. Past approaches to resolving these difficulties focus on zooming, clustering, filtering and applying various methods of laying out nodes and edges. Such approaches, however, focus only on optimizing a network visualization in a single view, limiting the amount of information that can be shown and explored in parallel. Moreover, past approaches do not allow users to cross reference different subsets or aspects of large, complex networks. In this paper, we propose an approach to these limitations using multiple coordinated views of a given network. To illustrate our approach, we implement a tool called DualNet and evaluate the tool with a case study using an email communication network. We show how using multiple coordinated views improves navigation and provides insight into large networks with multiple node and link properties and types.
A comparison of statistical significance tests for information retrieval evaluation
Authors: Mark D. Smucker, James Allan, Ben Carterette
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Information retrieval (IR) researchers commonly use three tests of statistical significance: the Student's paired t-test, the Wilcoxon signed rank test, and the sign test. Other researchers have previously proposed using both the bootstrap and Fisher's randomization (permutation) test as non-parametric significance tests for IR but these tests have seen little use. For each of these five tests, we took the ad-hoc retrieval runs submitted to TRECs 3 and 5-8, and for each pair of runs, we measured the statistical significance of the difference in their mean average precision. We discovered that there is little practical difference between the randomization, bootstrap, and t tests. Both the Wilcoxon and sign test have a poor ability to detect significance and have the potential to lead to false detections of significance. The Wilcoxon and sign tests are simplified variants of the randomization test and their use should be discontinued for measuring the significance of a difference between means.
Back to the Holodeck: new life for virtual reality?
Authors: Andrew Hutchison
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

This paper examines the gap between optimistic 1990s predictions of "immersive" Virtual Reality and the fact that these systems are not in widespread use today (2007). In particular, Janet Murray's 1997 adoption of the science fiction device "The Holodeck" as a model for compelling interactive narrative is re-examined in light of a decade of digital technology development. Comparison is made between the rise of games as "desktop VR", and the development of other media forms. Alternative definitions of Virtual Reality are discussed as a means of revealing possible technical and societal reasons for the lack of commonplace "immersive" systems. This paper then presents the global changes that might trigger the development of practical 1990s style "immersive" VR for commonplace games and other entertainment systems. The conclusion then examines the technical and cultural feasibility of various possible directions for VR systems design, and calls for a new realization by designers of the limitations they are currently working with.
Inverse functions in the AquaLogic Data Services Platform
Authors: Nicola Onose, Vinayak Borkar, Michael J. Carey
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

When integrating data from heterogeneous sources, it is often necessary to transform both the schemas and the data from the underlying sources in order to present the integrated data in the form desired by its consuming applications. Unfortunately, these transformations---particularly if implemented by custom code---can block query optimization and updates, leading to potentially severe performance and functionality limitations. To circumvent these problems, the BEA AquaLogic Data Services Platform provides support for user-defined inverse functions. This paper describes the motivation, design, user experience, and implementation associated with inverse functions in ALDSP. This functionality debuted in version 2.1 of ALDSP in March 2006.
A Research for Quality Preservation Methodology for SOA Environment
Authors: Youngkon Lee, Gwyduk Yeom
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

WSQM TC, an OASIS technical committee for web service quality model, published the Web Services Quality Model (WSQM) which models and explains the quality factor, quality action, and quality associates for Web services. WSQM focuses on the classification and definition of quality factors and activities of associates conceptually. As the coverage of Web services expands and implementation cases of them increase, the importance of the method which applies the quality model to real world practically grows up to make it easy communicating the information of quality of Web services. This research report presents the method describing the quality factors of Web services and SOA normally and quantitatively. For this, we adopt the standard XML schema as the framework for describing Web services quality. This report provides briefly the WSQM which is basis of WSQDL (Web Services Quality Description Language) and explains the considerations, the concept of quality chain, the overall structure of WSQDL, and items of WSQDL. The followings are the summary of the report.
Improving the Efficiency of Digital Forensic Search by Means of the Constrained Edit Distance
Authors: Slobodan Petrovic, Katrin Franke
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

A new search procedure is presented that makes use of the constrained edit distance in the pre-selection of the areas of the digital forensic search space that are interesting for the investigation. The constraints regard the maximum numbers of consecutive deletions and insertions. The original algorithm for computing the constrained edit distance is modified in order to be used in forensic search. The modification removes the constraints before the first substitution and after the last substitution. The advantage of the new method over the use of the unconstrained edit distance in the same procedure lies in the possibility of eliminating the need for finer exhaustive search in the fragments of the search space, in which the detected subsequence is too distorted. It also enables better control over the search process in the case of deliberate distortion of the evidence strings. Experimental results show that the proposed method offers data set reduction in the typical cases of as much as 80% compared to the method that uses unconstrained edit distance.
Temporal constraints for rule-based event processing
Authors: Karen Walzer, Alexander Schill, Alexander Löser
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

Complex event processing (CEP) is an important technology for event-driven systems with a broad application space ranging from supply chain management for RFID, systems monitoring, and stock market analysis to news services. The purpose of CEP is the identification of patterns of events with logical, temporal or causal relationships out of single occurring events. The Rete algorithm is commonly used in rule-based systems to trigger certain actions if a corresponding rule holds. It allows for a high number of rules and is therefore ideally suited for event processing systems. However, traditional Rete networks are limited to operations such as unification and the extraction of predicates from a knowledge base. There is no support for temporal operators. We propose an extension of the Rete algorithm for support of temporal operators. Thereby, we are using interval time semantics. We present the issues created by this extension as well as our pursued methodology to address them. A description language is used to specify the patterns of interest. This specification is also called subscription to a complex event. On the occurrence of the specified event pattern, an action such as the creation of a new event or the execution of certain function is performed.
Optimal packet scheduling in output-buffered optical switches with limited-range wavelength conversion
Authors: Lin Liu, Yuanyuan Yang
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Ran-dom Access Memory, the traditional Virtual Output Queue (VOQ) based input-queued switches are difficult to implement in optical domain. In this paper we consider output-buffered optical packet switches. We focus on packet scheduling in an output-buffered optical packet switch with limited-range wavelength conversion, aiming at maximizing throughput and minimizing average queuing delay simultaneously. We show that it can be converted to a minimum cost maximum network flow problem. To cope with the high complexity of general network flow algorithms, we further present a new algorithm that can determine an optimal scheduling in O (min {W2,BW}) time, where W is the number of wave-length channels in each fiber and B is the length of the output buffer. We also conduct simulations to test the performance of the proposed scheduling algorithm under different traffic models.
GWiQ-P: an efficient decentralized grid-wide quota enforcement protocol
Authors: K. Karmon, L. Liss, A. Schuster
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Mega grids span several continents and may consist of millions of nodes and billions of tasks executing at any point in time. This setup calls for scalable and highly available resource utilization control that adapts itself to dynamic changes in the grid environment as they occur. In this paper, we address the problem of enforcing upper bounds on the consumption of grid resources. We propose a grid-wide quota enforcement system, called GWiQ-P. GWiQ-P is light-weight, and in practice is infinitely scalable, satisfying concurrently any number of resource demands, all within the limits of a global quota assigned to each user. GWiQ-P adapts to dynamic changes in the grid as they occur, improving future performance by means of improved locality. This improved performance does not impair the system's ability to respond to current requests, tolerate failures, or maintain the allotted quota levels.
Towards personalized feedback in educational computer games for children
Authors: Ekaterina Vasilyeva
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Educational games as well as other computer games become an important part of children's life and modern education. One of the crucial components of the educational game is the feedback that is provided to the child by the system during the interaction. In this paper the framework for analyzing the concept of feedback in the context of learning and entertainment applications is briefly introduced. The paper provides a review of feedback studies and discusses the problems of feedback personalization in educational computer games for children. Recent studies in user adaptive interfaces show that personalization of interface parameters according to a user model can facilitate the increase of effectiveness in interacting and learning processes. The similar ideas are considered in this paper with respect to feedback personalization to a child in educational computer games. Personalization can play even more important role in this context because of varying cognitive abilities, reading and elementary math skills among different children. We believe that this paper will contribute to better understanding of the challenges in the development of the educational computer games for children and attract attention of the educational computer games developers to the problem of feedback.
MobiSim: A Framework for Simulation of Mobility Models in Mobile Ad-Hoc Networks
Authors: S. M. Mousavi, H. R. Rabiee, M. Moshref, A. Dabirmoghaddam
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

of wireless mobile nodes forming a self-configuring network without using any existing infrastructure. Since MANETs are not currently deployed on a large scale, research in this area is mostly simulation based. Among other simulation parameters, the mobility model plays a very important role in determining the protocol performance in MANET. Thus, it is essential to study and analyze various mobility models and their effect on MANET protocols. In this paper we introduce a new framework for simulation of mobility models in mobile Ad-Hoc networks. This simulator can generate mobility traces in various mobility models. The mobility traces can be customized for different network simulators using XML and text output formats. User friendly graphical interface and batch processing ability makes our simulator one of the most efficient and useful mobility simulators in this field of research. We also propose some new features and parameters in mobility models to make the behavior of our simulator supported mobility models more similar to real world mobile node motions and fix some problems in last proposed methods to generate mobility models.
Time Series Analysis Using GA Optimized Neural Networks
Authors: Cheng-Xiang Yang, Yi-Fei Zhu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Time series has been one of the most important data used in system analysis. However, the underlying relationship usually conceals itself deeply in large data sets and is difficult to identify using conventional tools. To deal with the inherent complexities of real world systems, this paper presents a hybrid evolutionary-neural modeling approach to model the time series and extrapolate them to the future to make prediction. In this method, a back-propagation neural network is trained to mapping the underlying relationship. To improve the training efficiency, a genetic algorithm is employed to optimize the input series of the model as well as the network topology; the genetic algorithm is also used to search the global optimal initial weights for the local gradient-descent training algorithm. The genetic-algorithm optimized neural learning algorithm is applied to a landslide dynamic system and the results show the great performance of the proposed hybrid approach, both in learning and generalization.
Concgramming: A computer driven approach to learning the phraseology of English
Authors: Chris Greaves, Martin Warren
Venue: ReCALL (2007)

This study introduces a new computer-based methodology, ‘concgramming’, that has as its primary aim the automatic identification of the phraseological profile and hence the ‘aboutness’, of a text or corpus. It is argued that this methodology can be employed by language learners and teachers to raise awareness of the importance of the phraseological tendency in language. The methodology is outlined, and examples of its potential for use by language learners in a data-driven learning mode are described. The wider implications of concgramming, and the concgrams so generated, are also discussed with regard to CALL.
The Convergence of Realistic Distributed Load-Balancing Algorithms
Authors: F. Cedo, A. Cortes, A. Ripoll, M. A. Senar, E. Luque
Venue: Theory of Computing Systems (2007)

We give a general model of partially asynchronous, distributed load-balancing algorithms for the discrete load model in parallel computers, where the processor loads are treated as non-negative integers. We prove that all load-balancing algorithms in this model are finite. This means that all load-balancing algorithms based on this model are guaranteed to reach a stable situation at a certain time (which depends on the particular algorithm) at which no load will be sent from one processor to another. With an additional assumption, we prove that the largest load difference between any two processors, in the final stable situation of the load-balancing algorithms in this model, is upper-bounded by the diameter of the topology.