ppxscal/embedding_network huggingface dataset:
An XACML Extension for Business Process-Centric Access Control Policies
Authors: Christian Wolter, Christian Weiss, Christoph Meinel
Venue: Proceedings of the 2009 IEEE International Symposium on Policies for Distributed Systems and Networks (2009)

Administrative controls exist to ensure that business activities are correctly managed and controlled according to corporate and legal regulations. With many organisations reliant on complex IT solutions these controls relate to functionality of software. In this paper we present an extension for business process models to express administrative controls, such as role-based, mandatory or dynamic separation of duty access control policies on the abstraction level of business process models. A model-driven approach is applied to generate platform-specific policies. As an example we utilise the eXtensible Access Control Markup Language (XACML).
Reference Model for Quality Assurance of Speech Applications
Authors: Cornelia Hipp, Matthias Peissner
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

The acceptance of speech applications is still very low in Germany. The German market of speech industry identified this problem and makes an effort to improve the quality of speech applications, which should lead to higher user acceptance. To ensure higher quality standards, a reference model has been developed with special regard to the needs of interactive voice response systems (IVR). This model includes instructions to improve the process quality of the development process as well as methods, measurements and quality criteria to evaluate the product quality. Furthermore, the presented reference model differentiates between eight application types of IVR and describes which methods, measurements and quality criteria are especially important for each application type.
Embedding Ratio Estimating for Each Bit Plane of Image
Authors: Chunfang Yang, Xiangyang Luo, Fenlin Liu
Venue: Information Hiding: 11th International Workshop, IH 2009, Darmstadt, Germany, June 8-10, 2009, Revised Selected Papers (2009)

MSLB replacement steganography has attracted researchers' attentions. However, existing steganalysis methods for MLSB replacement steganography have been just designed under the assumption that the embedding ratios in all stego bit planes are equal. Therefore, when the messages are embedded into different bit planes with different lengths independently, a new, principled method is introduced to estimate the embedding ratio in each stego bit plane based on a sample pair model. The new method estimates the embedding ratio in each bit plane in sequence according to the priority of each bit plane's significance. A series of experiments show that the presented steganalysis method has significantly smaller bias than applying SPA method, a typical steganalysis for LSB steganography, to estimate the embedding ratio in each bit plane directly.
Chaos and Graphics: An IFS-based method for modelling horns, seashells and other natural forms
Authors: C. Stpień
Venue: Computers and Graphics (2009)

This paper presents a new method of modelling natural forms such as horns, seashells and beaks by means of iterated function systems (IFSs). The characteristic feature of these forms is that one can divide them into parts (called modules) similar to each other in the geometric sense. Starting from a description of the growth process, appropriate transformations are defined, which make it possible to generate sequences of three-dimensional sets. Consequently, a model consisting of modules is obtained. Using accurate transformations results in a precise arrangement of modules in space. It is possible to apply a similarity transformation to a single module or to whole groups, which simplifies and speeds up the modelling process. The way the modules are defined leads to great freedom in modelling, which is confirmed by the presented examples. Therefore the method is more efficient than the hitherto existing methods.
Partially supervised sense disambiguation by learning sense number from tagged and untagged corpora
Authors: Zheng-Yu Niu, Dong-Hong Ji, Chew Lim Tan
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

Supervised and semi-supervised sense disambiguation methods will mis-tag the instances of a target word if the senses of these instances are not defined in sense inventories or there are no tagged instances for these senses in training data. Here we used a model order identification method to avoid the misclassification of the instances with undefined senses by discovering new senses from mixed data (tagged and untagged corpora). This algorithm tries to obtain a natural partition of the mixed data by maximizing a stability criterion defined on the classification result from an extended label propagation algorithm over all the possible values of the number of senses (or sense number, model order). Experimental results on SENSEVAL-3 data indicate that it outperforms SVM, a one-class partially supervised classification algorithm, and a clustering based model order identification algorithm when the tagged data is incomplete.
Procedural and conceptual knowledge acquisition in mathematics: where is collaboration helpful?
Authors: Dejana Diziol, Nikol Rummel, Hans Spada
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

While research has generally shown that collaboration may facilitate student learning in mathematics, such positive effects are not always found. We argue that the effectiveness of collaboration may depend on the type of knowledge the instruction targets: The interaction with a partner can slow down students and may thus decrease the amount of practice necessary for procedural skill fluency. On the other hand, collaboration could be particularly useful for conceptual knowledge acquisition, as here, the elaborative meaning-making activities ascribed to collaboration may facilitate learning. To evaluate the differential effects of collaborative learning, we compared four conditions: individual versus collaborative learning with procedural instruction, and individual versus collaborative learning with conceptual instruction. The study results support our hypotheses: Students who learned individually showed higher test scores in a procedural far transfer test. However, a combination test requiring both knowledge types revealed a positive impact of collaboration om stidents' conceptual knowledge acquisition.
Selective Breeding Analysed as a Communication Channel: Channel Capacity as a Fundamental Limit on Adaptive Complexity
Authors: Chris Watkins
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Abstract-Selective breeding is considered as a communication channel, in a novel way. The Shannon informational capacity of this channel is an upper limit on the amount of information that can be put into the genome by selection: this is a meaningful upper limit to the adaptive complexity of evolved organisms. We calculate the maximum adaptive complexity achievable for a given mutation rate for simple models of sexual and asexual reproduction. A new and surprising result is that, with sexual reproduction, the greatest adaptive complexity can be achieved with very long genomes, so long that genetic drift ensures that individual genetic elements are only weakly determined. Put another way, with sexual reproduction, the greatest adaptive complexity can in principle be obtained with genetic architectures that are, in a sense, error correcting codes. For asexual reproduction, for a given mutation rate, the achievable adaptive complexity is much less than for sexual reproduction, and depends only weakly on genome length. A possible implication of this result for genetic algorithms is that the greatest adaptive complexity is in principle achievable when genomes are so long that mutation prevents the population coming close to convergence. 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
A Haptic-Enhanced System for Molecular Sensing
Authors: Sara Comai, Davide Mazza
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

The science of haptics has received an enormous attention in the last decade. One of the major application trends of haptics technology is data visualization and training. In this paper, we present a haptically-enhanced system for manipulation and tactile exploration of molecules.The geometrical models of molecules is extracted either from theoretical or empirical data using file formats widely adopted in chemical and biological fields. The addition of information computed with computational chemistry tools, allows users to feel the interaction forces between an explored molecule and a charge associated to the haptic device, and to visualize a huge amount of numerical data in a more comprehensible way. The developed tool can be used either for teaching or research purposes due to its high reliance on both theoretical and experimental data.
Quick shaving
Authors: Olivier Lhomme
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Arc-consistency plays such a key role in constraint programming for solving real life problems that it is almost the only algorithm used for reducing domains. There are a few specific problems for which a stronger form of propagation, often called shaving, is more efficient. Nevertheless, in many cases. shaving at each node of the search tree is not worth doing: arc-consistency filtering is much faster, and the additional domain reductions inferred by shaving do not pay off. In this paper, we propose a new kind of shaving called QuickShaving, which is guided by the search. As QuickShaving may infer some additional domain reductions compared with arc-consistency, it can improve the search for a solution by an exponential ratio. Moreover, the advantage of Quick Shaving is that in practice, unlike a standard form of shaving, the additional domain reductions deduced by QuickShaving come at a very low overhead compared with arc-consistency.
DTN over aerial carriers
Authors: Ari Keränen, Jörg Ott
Venue: Proceedings of the 4th ACM workshop on Challenged networks (2009)

Delay-tolerant Networking has been discussed for mobile environments, both with predictable (e.g., between buses) and unpredictable opportunistic (e.g., between people) contact schedules. While some research projects have envisioned the larger scale use of DTNs to perform message forwarding based upon social interactions between humans, the geographic dimension of simulations has mostly been limited to rather local areas such as (parts of) cities or modestly sized areas covered by public transportation. In this paper, we explore how messages could be carried over a realistic large scale global network, between airports based upon scheduled flight connections. We investigate the interaction with different routing protocols, the impact of scheduling uncertainties, and the limiting factors by means of simulations and analysis. While we do not consider in depth the integration of aerial-carrier-based DTN message delivery into regional and local social networks, we provide some initial approximation on this subject and discuss some potential roles for message forwarding based upon mass transportation.
Cohesive constraints in a beam search phrase-based decoder
Authors: Nguyen Bach, Stephan Vogel, Colin Cherry
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

Cohesive constraints allow the phrase-based decoder to employ arbitrary, non-syntactic phrases, and encourage it to translate those phrases in an order that respects the source dependency tree structure. We present extensions of the cohesive constraints, such as exhaustive interruption count and rich interruption check. We show that the cohesion-enhanced decoder significantly outperforms the standard phrase-based decoder on English&rarr;Spanish. Improvements between 0.5 and 1.2 BLEU point are obtained on English&rarr;Iraqi system.
SPIRIX: A Peer-to-Peer Search Engine for XML-Retrieval
Authors: Judith Winter, Oswald Drobnik
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

At INEX 2008 we presented SPIRIX, a Peer-to-Peer search engine developed to investigate distributed XML-Retrieval. Such investigations have been neglected by INEX so far: while there is a variety of successful and effective XML-Retrieval approaches, all current solutions are centralized search engines. They do not consider distributed scenarios, where it is undesired or impossible to hold the whole collection on one single machine. Such scenarios include search in large-scale collections, where the load of computations and storage consumption is too high for one server. Other systems consist of different owners of heterogeneous collections willing to share their documents without giving up full control over their documents by uploading them on a central server. Currently, there are research solutions for distributed text-retrieval or multimedia-retrieval. With INEX and innovative techniques for exploiting XML-structure, it is now time to extend research to distributed XML-Retrieval. This paper reports on SPIRIX' performance at INEX'08.
Simulation of Ultrasound Propagation in Cancellous Bone by Solving Elastic Wave Equation Using Finite Difference Time Domain Method
Authors: Nima Hemmati, Mohammad Djavad Abolhassani
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Ultrasound waves can evaluate the parameters related to bone structure and elasticity. For accurate recognizing of bone condition using the Ultrasonic methods, the wave propagation phenomenon must be cleared. We simulated the cancellous bone based on porosity and thickness and also Ultrasound waves based on frequency, amplitude and bandwidth. Then the interaction of the ultrasound waves and the simulated bone had been checked with the wave equations and the effects of different bone parameters on results were evaluated. The obtained results from the simulation of elastic waves propagation in bone tissue by solving the wave equations with FDTD method illustrates suitable correlation with the experimental results of bone densitometry system. The anisotropic 2-dimensional bone model that is covered in this paper and solving the elastic wave in the time domain is suitable for simulation. However for more accurate simulation we can implement three dimensional models and analysis methods in frequency domain.
HOP: an environment for developing web 2.0 applications
Authors: Manuel Serrano
Venue: Proceedings of the 2007 International Lisp Conference (2007)

Hop is a language dedicated to programming reactive and dynamic applications for the web, such as web agendas, web galleries, web mail clients, etc. In this presentation, we highlight the linguistic novelties introduced by Hop and its execution environment by describing Hop's user libraries, its extensions to the HTML-based standards, and its execution platform, the Hop web broker. There will be several live demonstrations during the presentation.
A market-oriented programming environment and its application to distributed multicommodity flow problems
Authors: Michael P. Wellman
Venue: Journal of Artificial Intelligence Research (1993)

Market price systems constitute a well-understood class of mechanisms that under certain conditions provide effective decentralization of decision making with minimal communication overhead. In a market-oriented programming approach to distributed problem solving, we derive the activities and resource allocations for a set of computational agents by computing the competitive equilibrium of an artificial economy. WALRAS provides basic constructs for defining computational market structures, and protocols for deriving their corresponding price equilibria. In a particular realization of this approach for a form of multicommodity flow problem, we see that careful construction of the decision process according to economic principles can lead to efficient distributed resource allocation, and that the behavior of the system can be meaningfully analyzed in economic terms.
The Use of Dynamic Interactive 3D Images of Biomedical Devices in Education
Authors: Octavian Ciobanu, Stefano Tornincasa
Venue: Proceedings of the 2009 Second International Conference in Visualisation (2009)

The paper approaches an educational application of 3D dynamic interactive images of medical devices. Manuals containing 3D images are considered more efficient than classic manuals. Combination of 3D interactive images with World Wide Web technologies makes the educational activities and especially the e-learning more attractive. Some web technologies used in creation of 3D interactivity were compared in order to choose a suitable environment for learning in the field of medical devices. Results of the study were used in the elaboration of an international e-learning platform in the frame of the Leonardo da Vinci educational program. The originality of the project consists in the interactivity of 3D images used in lessons.
Spatial Distribution of Social Benefit Given by Urban Attractions: A Test of UrAD Model
Authors: Luca D'Acci
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Important urban transformations can strongly alter the image of a city from different points of view, concerning aesthetical, functional, social and economic aspects. In this paper the model UrAD is tested and used for showing and evaluating the impact of the transformations in the city of Turin during the last years. The city appears a perfect opportunity for this kind of analysis because of its recent numerous and deep transformations, mainly on the occasion of the Olympic Games 2006. Then, we studied the consequent impact analysing the spatial distribution of the social benefit given by amenities and beauties improving the urban life quality of an ordinary citizen. The testing of the model consists of a comparison between the social benefit simulated by UrAD and the real estate value observed, both before and after the biggest urban transformations.
Receiver Operating Characteristic (ROC) Graph to Determine the Most Suitable Pairs Analysis Threshold Value
Authors: Emelia Akashah P. A., Savita K. Sugathan, Anthony T. S. Ho
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

Steganography is the art of hiding the information that is going to be sent from one party to another. Information can be hidden into image, text, audio or video. Steganography allowed communication to happen without other people notice there is transmission of message except the intended party. This paper explains the implementation of Receiver Operating Characterictic (ROC) graph addressing the incorrect classification of images for stegogramme and non-stegogramme classes using Pairs Analysis detection technique. The threshold value to discriminate between the two classes is identified, to reduce the rate of False Negative (FN).
Complex RFID event processing
Authors: Fusheng Wang, Shaorong Liu, Peiya Liu
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2009)

Advances of sensor and radio frequency identification (RFID) technology provide significant new power for humans to sense, understand and manage the world. RFID provides fast data collection with precise identification of objects with unique IDs without line of sight, thus it can be used for identifying, locating, tracking and monitoring physical objects. Despite these benefits, RFID poses many challenges for data processing and management: (i) RFID observations have implicit meanings, which have to be transformed and aggregated into semantic data represented in their data models; and (ii) RFID data are temporal, streaming, and in high volume, and have to be processed on the fly. Thus, a general RFID data processing framework is needed to automate the transformation of physical RFID observations into the virtual counterparts in the virtual world linked to business applications. In this paper, we take an event-oriented approach to process RFID data, by devising RFID application logic into complex events. We then formalize the specification and semantics of RFID events and rules. We discover that RFID events are highly temporal constrained, and include non-spontaneous events, and develop an RFID event detection engine that can effectively process complex RFID events. The declarative event-based approach greatly simplifies the work of RFID data processing, and can significantly reduce the cost of RFID data integration.
Robust textual inference via learning and abductive reasoning
Authors: Rajat Raina, Andrew Y. Ng, Christopher D. Manning
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

We present a system for textual inference (the task of inferring whether a sentence follows from another text) that uses learning and a logical-formula semantic representation of the text. More precisely, our system begins by parsing and then transforming sentences into a logical formula-like representation similar to the one used by (Harabagiu et al., 2000). An abductive theorem prover then tries to find the minimum "cost" set of assumptions necessary to show that one statement follows from the other. These costs reflect how likely different assumptions are, and are learned automatically using information from syntactic/semantic features and from linguistic resources such as WordNet. If one sentence follows from the other given only highly plausible, low cost assumptions, then we conclude that it can be inferred. Our approach can be viewed as combining statistical machine learning and classical logical reasoning, in the hope of marrying the robustness and scalability of learning with the preciseness and elegance of logical theorem proving. We give experimental results from the recent PASCAL RTE 2005 challenge competition on recognizing textual inferences, where a system using this inference algorithm achieved the highest confidence weighted score.
The Logical Consequence Role in LPNMR: A Parameterized Computation Approach
Authors: Mauricio Osorio Galindo, Simone Pascucci
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We present results about the logical consequence test under classical logic w.r.t. the Theory of Parameterized Complexity and Computation [1]. We show how a normal logic program P can partitioned in subset of clauses such that we can define an algorithm proving sets of atoms which complexity is bounded by a relation exponential in terms of a fixed parameter k and polynomial on the original size of the problem, namely the size of P. As example of application we study the model checking problem w.r.t. the P-Stable semantics.