ppxscal/embedding_network huggingface dataset:
A next step towards automated modelling of sources of law
Authors: Emile de Maat, Radboud Winkels
Venue: Proceedings of the 12th International Conference on Artificial Intelligence and Law (2009)

The ultimate goal of the research line described here is support for automated modelling of sources of law. One of the first steps is the automatic recognition of norms. In earlier work we presented a categorization of norms or provisions in legislation. We claimed that the categories are characterized by the use of typical sentence structures and that this would enable automatic detection and classification. In this paper we present the results of experiments in such automatic classification of provisions. We have defined fourteen different categories of provisions, and compiled a list of 88 sentence structures for those categories from twenty Dutch laws. Based on these structures, a parser was used to classify the sentences in fifteen different Dutch laws, classifying 91% of 592 sentences correctly. It compares well with other, statistical approaches. An important improvement of our classifier will be the distinction of principal and auxiliary sentences.
Satisfiability of downward XPath with data equality tests
Authors: Diego Figueira
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

In this work we investigate the satisfiability problem for the logic XPath(↓*, ↓,=), that includes all downward axes as well as equality and inequality tests. We address this problem in the absence of DTDs and the sibling axis. We prove that this fragment is decidable, and we nail down its complexity, showing the problem to be ExpTime-complete. The result also holds when path expressions allow closure under the Kleene star operator. To obtain these results, we introduce a new automaton model over data trees that captures XPath(↓*, ↓,=) and has an ExpTime emptiness problem. Furthermore, we give the exact complexity of several downward-looking fragments.
A Performance Model for Maintenance Tasks in an Environment of Virtualized Servers
Authors: Tien Do, Udo R. Krieger
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

This paper introduces the CPP/M/c model with working vacations to describe queueing phenomena that arise in an advanced computing environment of virtualized servers operated by the infrastructure owners. In the proposed queue the inter-arrival times of jobs requesting servers follow a Generalized Exponential distribution. To model a maintenance activity, we assume that a certain number of servers simultaneously goes to a maintenance state for a random period when they complete the service of requests and find no further jobs in the waiting line. We derive an expression for the steady-state probabilities and prove a conditional stochastic decomposition property. By a relatively simple model we are able to prove a property which has a significant impact on the organization of maintenance activities of virtualized servers. It means that instead of migrating virtual servers to expensive physical backup servers during software maintenance, a wise and simple strategy based on the vacation approach can be used. Moreover, it is theoretically proved that the system is not overloaded if we organize the maintenance according to the vacation model. We believe that our model can be useful for administrators to choose an appropriate parameter set for the maintenance activities.
A method of specification of fractal sets
Authors: L. P. Lisovik, T. A. Karnaukh
Venue: Cybernetics and Systems Analysis (2009)

The so-called R-systems are proposed for specifying sets. Formal properties of such a system are studied. The case of a bounded linear R-system is discussed and relations between R-systems and R *-transducers are established. In particular, it is shown that a bounded linear R-system specifies a bounded closed set.
Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays
Authors: Simon Gog
Venue: Proceedings of the 8th International Symposium on Experimental Algorithms (2009)

The suffix array of a string s of length n over the alphabet Σ is the permutation that gives us the lexicographic order of all suffixes of s. This popular index can be used to solve many problems in sequence analysis. In practice, one limitation of this data structure is its size of n logn bits, while the size of the text is n log|Σ| bits. For this reason compressed suffix arrays (CSAs) were introduced. The size of these CSAs is asymptotically less than or equal to the text size if the text is compressible, while maintaining O(log ¿ n) access time to the elements (0 < ¿ ≤ 1). The goal of a good CSA implementation is to provide fast access time to the elements while using minimal space for the CSA. Both access time and space depend on the choice of a self-delimiting code for compression. We show that the Fibonacci code is superior to the Elias ¿ code for strings that are low compressible. Our second contribution are two new broadword methods that support the decoding of Fibonacci encoded numbers on 64 bit architectures. Furthermore, our experiments show that the use of known broadword methods speed up the decoding of Elias ¿ code for strings that are high compressible, like XML. Finally, we provide a new efficient C++ library for succinct data structures which includes a generic CSA for further experiments. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Incorporating cost analysis in a multi disciplinary design environment for aircraft movables
Authors: A. H. van der Laan, M. J. L. van Tooren
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

The design and production of aircraft structures is a highly cost driven industrial activity. Advanced, more reliable cost estimation techniques can help to improve competitiveness and reduce risk in the bidding phase. In this paper a design support framework will be presented that offers improved information and knowledge about new designs in an early stage of the development. The paper focuses on aircraft movables like rudders, elevators or flaps, but similar frameworks can be built for other product families. The framework is based on the Design and Engineering Engine (DEE) architecture. The DEE formalizes the basic design cycle and comprises a Multi-Model-Generator (MMG) based on Knowledge Based Engineering principles that creates a smooth link between a parametric product model and different analysis tools, including a cost analysis tool. It will be shown that such an MMG can support the extraction of a cost engineering view on the product model that can be used in combination with proper Cost Estimation Relations to have more reliable cost information in an early stage of the design process.
RFID and privacy: what consumers really want and fear
Authors: Sarah Spiekermann
Venue: Personal and Ubiquitous Computing (2009)

This article investigates the conflicting area of user benefits arising through item level radio frequency identification (RFID) tagging and a desire for privacy. It distinguishes between three approaches feasible to address consumer privacy concerns. One is to kill RFID tags at store exits. The second is to lock tags and have user unlock them if they want to initiate reader communication (user model). The third is to let the network access users' RFID tags while adhering to a privacy protocol (network model). The perception and reactions of future users to these three privacy enhancing technologies (PETs) are compared in the present article and an attempt is made to understand the reasoning behind their preferences. The main conclusion is that users do not trust complex PETs as they are envisioned today. Instead, they prefer to kill RFID chips at store exits even if they appreciate after sales services. Enhancing trust through security and privacy `visibility' as well as PET simplicity may be the road to take for PET engineers in UbiComp.
Bilateral matching of frequency tuning in neural cross-correlators of the owl
Authors: Brian J. Fischer, Jos&#x00e9; Luis Pe&#x00f1;a
Venue: Biological Cybernetics (2009)

Sound localization requires comparison between the inputs to the left and right ears. One important aspect of this comparison is the differences in arrival time to each side, also called interaural time difference (ITD). A prevalent model of ITD detection, consisting of delay lines and coincidence-detector neurons, was proposed by Jeffress (J Comp Physiol Psychol 41:35&#x2013;39, 1948). As an extension of the Jeffress model, the process of detecting and encoding ITD has been compared to an effective cross-correlation between the input signals to the two ears. Because the cochlea performs a spectrotemporal decomposition of the input signal, this cross-correlation takes place over narrow frequency bands. Since the cochlear tonotopy is arranged in series, sounds of different frequencies will trigger neural activity with different temporal delays. Thus, the matching of the frequency tuning of the left and right inputs to the cross-correlator units becomes a &#x2018;timing&#x2019; issue. These properties of auditory transduction gave theoretical support to an alternative model of ITD-detection based on a bilateral mismatch in frequency tuning, called the &#x2018;stereausis&#x2019; model. Here we first review the current literature on the owl&#x2019;s nucleus laminaris, the equivalent to the medial superior olive of mammals, which is the site where ITD is detected. Subsequently, we use reverse correlation analysis and stimulation with uncorrelated sounds to extract the effective monaural inputs to the cross-correlator neurons. We show that when the left and right inputs to the cross-correlators are defined in this manner, the computation performed by coincidence-detector neurons satisfies conditions of cross-correlation theory. We also show that the spectra of left and right inputs are matched, which is consistent with predictions made by the classic model put forth by Jeffress.
Safe-commit analysis to facilitate team software development
Authors: Jan Wloka, Barbara Ryder, Frank Tip, Xiaoxia Ren
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

Software development teams exchange source code in shared repositories. These repositories are kept consistent by having developers follow a commit policy, such as “Program edits can be committed only if all available tests succeed.” Such policies may result in long intervals between commits, increasing the likelihood of duplicative development and merge conflicts. Furthermore, commit policies are generally not automatically enforceable. We present a program analysis to identify committable changes that can be released early, without causing failures of existing tests, even in the presence of failing tests in a developer's local workspace. The algorithm can support relaxed commit policies that allow early release of changes, reducing the potential for merge conflicts. In experiments using several versions of a non-trivial software system with failing tests, 3 newly enabled commit policies were shown to allow a significant percentage of changes to be committed.
Medical Librarian 2.0: Use of Web 2.0 Technologies in Reference Services, 1st edition
Authors: M. Sandra Wood
Venue:  (2007)

Widespread use and acceptance of the World Wide Web in the home and office has eclipsed many other technological advances. Next-generation tools like Web 2.0 sit on the cutting edge of profound changes that willand have already begun totransform librarianship. Medical Librarian 2.0 is a vital resource for understanding and implementing these revolutionary technologies. The essays in this groundbreaking collection offer a comprehensive look at the potential uses and effects of Web 2.0 in reference services. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Planar Double-Gate Transistor: From technology to circuit, 1st edition
Authors: Amara Amara, Amara Amara, Olivier Rozeau
Venue:  (2009)

This book on Double-Gates devices and circuit is unique and aims to reinforce the synergy between the research activities on CMOS sub-32nm devices and the design of elementary cells. The goal is to point out how we can take advantage of new transistor structures to come up with new basic cells and concepts that exploit the electrical features of these new devices and the breakthrough they bring. Planar Double-Gate Transistor will mainly focus on SOI CMOS transistors, fully depleted with double independent planar Gates (Independent Planar Double Gates Transistors: IPDGT), a potential candidate for the sub-32 nm technological nodes as planned by the current ITRS Roadmap.
Theoretical validation of object-oriented lack-of-cohesion metrics
Authors: Jehad Al Dallal
Venue: Proceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems (2009)

Class cohesion refers to the degree of relatedness of class attributes and methods. Software developers use class cohesion measure to assess the quality of their products and to guide the restructuring of poorly designed classes. Several class cohesion metrics are proposed in the literature, and a few of them are theoretically validated against the class cohesion necessary properties. Metrics that violate class cohesion properties are not well defined, and their utility as indictors of the relatedness of class members is questionable. The purpose of this paper is to theoretically validate six lack-of-cohesion based metrics. Results show that most of the metrics considered satisfy the majority of the class cohesion necessary properties.
A Customized Python Module for CFD Flow Analysis within VisTrails
Authors: Joel E. Tohline, Jinghya Ge, Wesley Even, Erik Anderson
Venue: Computing in Science and Engineering (2009)

The authors have constructed a relatively simple, customized Python module that plugs smoothly into an otherwise standard workflow within VisTrails. This has resulted in the capability to quantitatively analyze complex fluid flows in simulations of merging binary stars. The resulting visualization tool permits researchers to identify values of key rotational frequencies associated with such flows and how these frequencies change over time.
Individual and social behavior in tagging systems
Authors: Elizeu Santos-Neto, David Condon, Nazareno Andrade, Adriana Iamnitchi, Matei Ripeanu
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

In tagging systems users can annotate items of interest with free-form terms. A good understanding of usage characteristics of such systems is necessary to improve the design of current and next generation of tagging systems. To this end, this work explores three aspects of user behavior in CiteULike and Connotea, two systems that include tagging features to support online personalized management of scientific publications. First, this study characterizes the degree to which users re-tag previously published items and reuse tags: 10 to 20% of the daily activity can be characterized as re-tagging and about 75% of the activity as tag reuse. Second, we use the pairwise similarity between users' activity to characterize the interest sharing in the system. We present the interest sharing distribution across the system, show that this metric encodes information about existing usage patterns, and attempt to correlate interest sharing levels to indicators of collaboration such as co-membership in discussion groups and semantic similarity of tag vocabularies. Finally, we show that interest sharing leads to an implicit structure that exhibit a natural segmentation. Throughout the paper we discuss the potential impact of our findings on the design of mechanisms that support tagging systems.
Parallel Simulation of Seismic Wave Propagation
Authors: Takashi Furumura
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

A dense seismic network of strong ground motion instruments in Japan allows a detailed characterization of regional wave propagation during destructive earthquakes. Steadily improving computer power associated with sophisticated parallel algorithms enables a large scale computer simulation of seismic waves in 3D heterogeneous structure. This is illustrated by the 2000 Tottori-ken Seibu earthquake, southwestern Japan. With the aid of assessing potential impact at urban cities expected for future earthquake scenarios (e.g. Nankai earthquake). A close link between strong motion seismology and high-performance computing technology becomes indispensable. The newly developing high performance parallel computer, Earth Simulator, would provide a key to realistic simulations of strong ground motion.
The experimental and numerical studies of laminar mixing in stirred tanks
Authors: Z. Yaakob, S. K. Kamarudin, U. A. Hasran
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

The objective of this paper is to look into some of the more popular techniques used in studying the flow field generated in the laminar regime by mechanical impellers in reactor tanks. It is shown that the study of laminar mixing has moved from the intrusive to the non-intrusive experimental techniques aided by processing tools that help obtain qualitative and quantitative solutions directly. Numerical simulations, developed to overcome the physical limitations faced by the experimental techniques, have generally proved to be capable in predicting flow. Most used commercial software that can be applied to the different problems encountered in the process industry, as well as in the research field.
Network bargaining: algorithms and structural results
Authors: Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
Venue: Proceedings of the tenth ACM conference on Electronic commerce (2009)

We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. Each deal yields some fixed wealth if its two players can agree on how to divide it; otherwise it yields no wealth. In such a setting, Chakraborty and Kearns (WINE 2008) introduced a simple axiomatic model that stipulates an equilibrium concept in which all players are rationally satisfied with their shares. We further explore that equilibrium concept here. In particular, we give an FPTAS to compute approximate equilibrium in bipartite graphs. We also show that equilibrium is not unique, and give conditions that ensure uniqueness on regular graphs. Finally, we explore the effect of network structure on solutions given by our model, using simulation methods and statistical analysis.
Sparse Representation for Video-Based Face Recognition
Authors: Imran Naseem, Roberto Togneri, Mohammed Bennamoun
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

In this paper we address for the first time, the problem of video-based face recognition in the context of sparse representation classification (SRC). The SRC classification using still face images, has recently emerged as a new paradigm in the research of view-based face recognition. In this research we extend the SRC algorithm for the problem of temporal face recognition. Extensive identification and verification experiments were conducted using the VidTIMIT database [1,2]. Comparative analysis with state-of-the-art Scale Invariant Feature Transform (SIFT) based recognition was also performed. The SRC algorithm achieved 94.45% recognition accuracy which was found comparable to 93.83% results for the SIFT based approach. Verification experiments yielded 1.30% Equal Error Rate (EER) for the SRC which outperformed the SIFT approach by a margin of 0.5%. Finally the two classifiers were fused using the weighted sum rule. The fusion results consistently outperformed the individual experts for identification, verification and rank-profile evaluation protocols.
The interior proximal extragradient method for solving equilibrium problems
Authors: Thi Thu Nguyen, Jean-Jacques Strodiot, Van Hien Nguyen
Venue: Journal of Global Optimization (2009)

In this article we present a new and efficient method for solving equilibrium problems on polyhedra. The method is based on an interior-quadratic proximal term which replaces the usual quadratic proximal term. This leads to an interior proximal type algorithm. Each iteration consists in a prediction step followed by a correction step as in the extragradient method. In a first algorithm each of these steps is obtained by solving an unconstrained minimization problem, while in a second algorithm the correction step is replaced by an Armijo-backtracking linesearch followed by an hyperplane projection step. We prove that our algorithms are convergent under mild assumptions: pseudomonotonicity for the two algorithms and a Lipschitz property for the first one. Finally we present some numerical experiments to illustrate the behavior of the proposed algorithms.
A survey on P2P streaming clients: looking at the end-user
Authors: Alexandro Sentinelli, Luca Celetto, Damien Lefol, Claudio Palazzi, Giovanni Pau
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

Internet home users -- through the diffusion of xDSL connections -- represent the potential market of IPTV channels that Content Generators may distribute at reduced costs thanks to Peer To Peer (P2P). This work describes the state of the art of P2P streaming clients and poses some questions about the end-user perspective which is still a non-trivial problem: expectations, content popularity, system's responsiveness and requirements. To this aim, a set of experiments has been performed on a successful P2P system. The new trend seems to investigate flexible solutions in order to get closer to the user's needs and requirements. Unexpected cross-layer optimisations may overcome, like the synergic effect integrating video encoding techniques in a P2P environment. This work is aimed at getting a better comprehension of the issues and metrics that have to be considered in the design of P2P streaming applications.
An approach for designing management support systems: the design science research process and its outcomes
Authors: Sven A. Carlsson, Stefan Henningsson, Stefan Hrastinski, Christina Keller
Venue: Proceedings of the 4th International Conference on Design Science Research in Information Systems and Technology (2009)

Design science research involves creating and evaluating innovative methods and approaches to be used in design practice. We present an approach to be used in the process of designing Management Support Systems (MSS). The nature of managerial work makes the design, development, and implementation of MSS a major challenge. The MSS literature suggests that determining MSS requirements and specification of MSS are the most critical phases in MSS design and development. We present an approach that can be used as a guide for MSS design, with a primary focus on MSS requirements determination and how requirements can be fulfilled using information and communication technologies (ICT). The approach builds on Quinn and associates' competing values model (CVM) of organizational effectiveness. The approach can guide MSS designers in designing MSS that support different managerial roles, i.e., the development of MSS that support managerial cognition, decision, and action.