ppxscal/embedding_network huggingface dataset:
Simple Direct Reduction of String (1,2)-OT to Rabin's OT without Privacy Amplification
Authors: Kaoru Kurosawa, Takeshi Koshiba
Venue: Proceedings of the 3rd international conference on Information Theoretic Security (2008)

It is known that string (1,2)-OT and Rabin's OT are equivalent. Actually, there have been many reductions between them. Many of them use the privacy amplification technique as a basic tool. The privacy amplification technique essentially involves some post-processing of sending random objects (e.g., random indices of pairwise independent hash functions) per each invocation of Rabin's OT is necessary. In this paper, we show a simple direct reduction of string (1,2)-OT to Rabin's OT by using a deterministic randomness extractor for bit-fixing sources. Our reduction can be realized without privacy amplification and thus our protocol is simpler and more efficient with respect to the communication complexity than the previous reductions.
Large Population Size IGAs with Individuals' Fitness Not Assigned by User
Authors: Jie Yuan, Dunwei Gong
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

User fatigue problem in traditional interactive genetic algorithms restricts its population size. It is necessary to maintain a large population size to optimize complicated problems. We present a large population size interactive genetic algorithm with individuals' fitness not assigned by user in this paper. The algorithm divides the population into several clusters, and the maximum number of clusters is changeable with the evolution and distribution of the population. The user only evaluates a center individual in each cluster and others' fitness is estimated based on these ones. In addition, to assign a center individual's fitness, we record the time when the user evaluates it satisfactory or unsatisfactory according to his/her sensitiveness, and its fitness is automatically calculated based on the time. Finally, we apply the proposed algorithm to the one-max problem, and compare it with traditional interactive genetic algorithms. The experimental results validate its efficiency.
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
Authors: Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We discuss the problems to list, sample, and count the chordal graphs with edge constraints. The objects we look at are chordal graphs sandwiched by a given pair of graphs where we assume at least one of the input pair is chordal. The setting is a natural generalization of chordal completions and deletions. For the listing problem, we give an efficient algorithm running in polynomial time per output with polynomial space. As for the sampling problem, we give two clues that seem to imply that a random sampling is not easy. The first clue is that we show #P-completeness results for counting problems. The second clue is that we give an instance for which a natural Markov chain suffers from an exponential mixing time. These results provide a unified viewpoint from algorithms theory to problems arising from various areas such as statistics, data mining, and numerical computation.
Contracts for BIP: Hierarchical Interaction Models for Compositional Verification
Authors: Susanne Graf, Sophie Quinton
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

This paper presents an extension of the BIP component framework to hierarchical components by considering also port sets of atomic components to be structured (ports may be in conflict or ordered, where a larger port represents an interaction set with larger interactions). A composed component consisting of a set of components connected through BIP connectors and a set of ports representing a subset of the internal connectors and ports, has two semantics: one in terms if interactions as defined by the BIP semantics, and one in terms of the actions represented by external ports where the structure of the port set of the component is derived from the internal structure of the component.A second extension consists in the addition of implicit interactions which is done through an explicit distinction of conflicting and concurrent ports: interactions involving only non conflicting ports can be executed concurrently without the existence of an explicit connector.Finally, we define contract-based reasoning for component hierarchies.
Counting Polycubes without the Dimensionality Curse
Authors: Gadi Aleksandrowicz, Gill Barequet
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

A d-D polycube of size n is a connected set of n cells (hypercubes) of an orthogonal d-dimensional lattice, where connectivity is through (d ¿ 1)-dimensional faces of the cells. Computing A d (n), the number of distinct d-dimensional polycubes of size n, is a long-standing elusive problem in discrete geometry. In a previous work we described the generalization from two to higher dimensions of a polyomino-counting algorithm of Redelmeier. The main deficiency of the algorithm is that it keeps the entire set of cells that appear in any possible polycube in memory at all times. Thus, the amount of required memory grows exponentially with the dimension. In this paper we present a method whose order of memory consumption is a (very low) polynomial in both n and d. Furthermore, we parallelized the algorithm and ran it through the Internet on dozens of computers simultaneously. This enables us to find A d (n) for values of d and n far beyond any previous attempt.
Key Refreshing in Wireless Sensor Networks
Authors: Simon R. Blackburn, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson
Venue: Proceedings of the 3rd international conference on Information Theoretic Security (2008)

The problem of establishing symmetric keys in wireless sensor networks has been extensively studied, but other aspects of key management have received comparatively little attention. In this paper we consider the problem of refreshing keys that are shared among several nodes in a WSN, in order to provide forward security. We discuss several applications that lead to sensor networks with very different properties, and we propose key refreshing schemes that are useful in each of these environments, together with resynchronisation methods that allow nodes possessing different versions of a key to arrive at a common version.
Staying Well Grounded in Markerless Motion Capture
Authors: Bodo Rosenhahn, Christian Schmaltz, Thomas Brox, Joachim Weickert, Hans-Peter Seidel
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

In order to overcome typical problems in markerless motion capture from video, such as ambiguities, noise, and occlusions, many techniques reduce the high dimensional search space by integration of prior information about the movement pattern or scene. In this work, we present an approach in which geometric prior information about the floor location is integrated in the pose tracking process. We penalize poses in which body parts intersect the ground plane by employing soft constraints in the pose estimation framework. Experiments with rigid objects and the HumanEVA-II benchmark show that tracking is remarkably stabilized.
Understanding the Utility of Rationale in a Mixed-Initiative System for GUI Customization
Authors: Andrea Bunt, Joanna Mcgrenere, Cristina Conati
Venue: Proceedings of the 11th international conference on User Modeling (2007)

In this paper, we investigate the utility of providing users with the system's rationale in a mixed-initiative system for GUI customization. An evaluation comparing a version of the system with and without the rationale suggested that rationale is wanted by many users, leading to increased trust, understandability and predictability, but that not all users want or need the information.
Extended Fuzzy Knowledge Representation with Medium
Authors: Cen Wang, Zhenghua Pan
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Found on theories of Medium Logic the paper differentiates contradictory from opposition in knowledge representation, affirms that there exists medium concept between a pair of opposite fuzzy concepts and introduces fuzzy privative and opposition privative in traditional knowledge representation. It takes a financial decision-making program for example, adopts ratio function of distance to endow each fuzzy predicate expression with a truth value which belongs to interval [0, 1]. Found on infinite-valued model of MF, it gives a method to ascertain value of controlled variable ¿ in model according to specific case, from which the effect and meaning of ¿ are shown. Finally it discusses about fuzzy knowledge reasoning by a specific example.
Data sharing over mobile ad hoc networks
Authors: Hoa Hà Duong, Isabelle Demeure
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Mobile ad hoc networks offer new challenges for distributed applications designers, such as mobile and lightweight terminals, or the lack of a reliable network infrastructure. In this article we focus on the problem of data sharing in MANETs and we propose a peer to peer distributed shared memory for mobile ad hoc network. It uses data replication to prevent the users needs and the potential loss of data a terminal disparition could cause.These data are editable and we offer a mechanism to maintain consistency between the replicas in an efficient way.
Identifying beneficial teammates using multi-dimensional trust
Authors: Jaesuk Ahn, Xin Sui, David DeAngelis, K. Suzanne Barber
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Multi-agent teams must be capable of selecting the most beneficial teammates for different situations. Multi-dimensional trustworthiness assessments have been shown significantly beneficial to agents when selecting appropriate teammates to achieve a given goal. Reliability, quality, availability, timeliness and compatibility define the behavioral constraints of the multidimensional trust (MDT) model. Given the MDT model in this research, an agent learns to identify the most beneficial teammates by prioritizing each dimension differently. An agent's attitudes towards rewards, risks and urgency are used to drive an agent's prioritization of dimensions in a MDT model. Each agent is equipped with a Temporal-Difference (TD) learning mechanism with tile coding to identify its optimal set of attitudes and change its attitudes when the environment changes. Experimental results show that changing attitudes to give preferences for respective dimensions in the MDT offers a superior means to finding the best teammates for goal achievement.
Comparison of Classifiers for Human Activity Recognition
Authors: Óscar Pérez, Massimo Piccardi, Jesús García, José M. Molina
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

The human activity recognition in video sequences is a field where many types of classifiers have been used as well as a wide range of input features that feed these classifiers. This work has a double goal. First of all, we extracted the most relevant features for the activity recognition by only utilizing motion features provided by a simple tracker based on the 2D centroid coordinates and the height and width of each person's blob. Second, we present a performance comparison among seven different classifiers (two Hidden Markov Models (HMM), a J.48 tree, two Bayesian classifiers, a classifier based on rules and a Neuro-Fuzzy system). The video sequences under study present four human activities (inactive, active, walking and running) that have been manual labeled previously. The results show that the classifiers reveal different performance according to the number of features employed and the set of classes to sort. Moreover, the basic motion features are not enough to have a complete description of the problem and obtain a good classification.
An Integrated Environment for Heterogeneous Process Modeling and Simulation
Authors: L. Wedel, V. Kulikov, W. Marquardt
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

The development of chemical processes requires the consideration of different areas such as reaction, separation, or product conditioning from several perspectives such as the economic efficiency of the steady-state process or the performance of the control system during operation. Mathematical modeling and computer simulation have become vital tools in order to perform such studies. However, various applications are supported by a number of tools with different strengths and weaknesses. Unfortunately, the formulation of the mathematical model and the data structures underlying the implementations of these tools are incompatible. Their integration at runtime for chemical process development poses technical problems to the engineer who carries out the work. This section describes an environment that accounts for the differences of mathematical modeling and simulation tools, and facilitates modeling and simulation across the boundaries of incompatible tools. The use of this environment is illustrated in the context of the IMPROVE reference scenario, addressing the production of Polyamide-6 from ¿-caprolactam (cf. Subsect. 1.2.2); the simulation tools used in this case study are currently used in industrial design processes.
A Building an e-Agriculture Business Integration Platform with Web Services Composition
Authors: Jianqiang Hu, FengE Luo, Guiping Liao
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

In recent years, many government and private organization efforts have been devoted to bring e-business technologies to agricultural domain. It is quite possible in agriculture marketing scenario that for a complete business process, an agricultural marketing activity can make the use of various existing business applications with loosely coupled and open computing environment. However, there is a need to develop a proper underlying infrastructure that links legacy business applications and provides an environment for a competitive business. Web service is an internet-based software component that can shield all sorts of heterogeneous business applications on basis of Service-oriented Architecture standards. In this paper, a Web service composition framework (WSCF) is presented to offer the effective business integration for agriculture marketing. It models various business processes as Web services and the process-based Web services composition can be carried out a complete business process spanned across various existing business applications. We are following WSCF to achieve our objective in ongoing project e-agricultural business platform.
A Compass to Guide Genetic Algorithms
Authors: Jorge Maturana, Frédéric Saubion
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Parameter control is a key issue to enhance performances of Genetic Algorithms (GA). Although many studies exist on this problem, it is rarely addressed in a general way. Consequently, in practice, parameters are often adjusted manually. Some generic approaches have been experimented by looking at the recent improvements provided by the operators. In this paper, we extend this approach by including operators' effect over population diversity and computation time. Our controller, named Compass, provides an abstraction of GA's parameters that allows the user to directly adjust the balance between exploration and exploitation of the search space. The approach is then experimented on the resolution of a classic combinatorial problem (SAT).
The Caring Personal Agent
Authors: Susan Bull, Jim Greer, Gord Mccalla
Venue: International Journal of Artificial Intelligence in Education (2003)

Self (1999) argues that the essence of having a computer-based learning system that "cares" about its learners is that the system model its learners so as to be able to adapt to their needs. In this paper we discuss the notion of personal agents who care for their "owners" by representing the owners' interests in the learning system. We contextualise this discussion by showing how such personal agents are used in I-Help, a system that promotes caring and sharing by encouraging learners to help one another. In I-Help, personal agents themselves care for their learners by helping them to discover useful information and/or to find "ready, willing, and able" peer learners who can aid them in overcoming problems.
A Participative Digital Archiving Approach to University History and Memory
Authors: Jyishane Liu
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

As digital archiving is heading into the next level of development and influence, we must consider the need of connecting digital archiving with more people and more resources to enhance the continuing effort. In this paper, we address the issue of engaging users in digital archiving task and forming a community of collective content creation. We propose a conceptual architecture for participative digital archiving and report a pilot project to redesign and reconstruct the archiving process of a university history. It also serves the purpose of showcasing archived content and providing reminiscence of university life for all university members.
A Fuzzy Satisfying Method for Variable Coefficients Multi-objective Programming
Authors: Deguo Yuan, Yuejin Ma, Tingjin Lu, Xiaosong Mao
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

Focus on multi-objective linear optimizing problems with random variable coefficients in objective functions and/or constraints. Using the probability maximization model to maximize the probability that each objective function becomes a certain value under chance constrained conditions, the stochastic programming problems are transformed into deterministic ones. Assuming that the decision maker has a fuzzy goal for each of the objective functions, having determined the fuzzy goals of the decision maker, we present an interactive fuzzy satisfying method to derive a satisfying solution for the decision maker by updating the reference membership levels. An illustrative numerical example is provided to demonstrate the feasibility of the proposed method.
Intelligent Information System Based on a Speech Web Using Fuzzy Association Rule Mining
Authors: Hyeong-Joon Kwon, Kwang-Seok Hong
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

In this paper, we propose and implement an intelligent information system that is based on both a wired and a wireless telephone network-based speech Web using fuzzy association rule mining, and we present a session management method in a VXML-based speech Web. The proposed system collects voice content that is requested by the user, and it considers the user's listening time, which is an important data in speech applications. The system uses a reasoning process to identify the related contents from the collected transaction database by using fuzzy association rule mining, and then the system recommends it to the user. This method considers the user's listening time and it can explore the database with an accuracy that is made possible by the dynamic generation of the fuzzy membership function. The experimental results confirm that we are obtaining more accurate reasoning result than the speech Web applications that use the existing generic data mining algorithm.
ActiveRDF: Embedding Semantic Web data into object-oriented languages
Authors: Eyal Oren, Benjamin Heitmann, Stefan Decker
Venue: Web Semantics: Science, Services and Agents on the World Wide Web (2008)

Semantic Web applications share a large portion of development effort with database-driven Web applications. Existing approaches for development of these database-driven applications cannot be directly applied to Semantic Web data due to differences in the underlying data model. We develop a mapping approach that embeds Semantic Web data into object-oriented languages and thereby enables reuse of existing Web application frameworks. We analyse the relation between the Semantic Web and the Web, and survey the typical data access patterns in Semantic Web applications. We discuss the mismatch between object-oriented programming languages and Semantic Web data, for example in the semantics of class membership, inheritance relations, and object conformance to schemas. We present ActiveRDF, an object-oriented API for managing RDF data that offers full manipulation and querying of RDF data, does not rely on a schema and fully conforms to RDF(S) semantics. ActiveRDF can be used with different RDF data stores: adapters have been implemented to generic SPARQL endpoints, Sesame, Jena, Redland and YARS and new adapters can be added easily. We demonstrate the usage of ActiveRDF and its integration with the popular Ruby on Rails framework which enables rapid development of Semantic Web applications.
Structure and Visibility
Authors: John Barnes
Venue: Ada 2005 Rationale: The Language, The Standard Libraries (2008)

This chapter describes various improvements in the areas of structure and visibility for Ada 2005.The most important improvement is perhaps the introduction of limited with clauses which permit types in two packages to refer to each other. A related addition to context clauses is the private with clause which just provides access from a private part.There are also important improvements to limited types which make them much more useful; these include initialization with aggregates and composition using a new form of return statement. 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
Efficient K-Means Clustering Using Accelerated Graphics Processors
Authors: S. A. Shalom, Manoranjan Dash, Minh Tue
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

We exploit the parallel architecture of the Graphics Processing Unit (GPU) used in desktops to efficiently implement the traditional K-means algorithm. Our approach in clustering avoids the need for data and cluster information transfer between the GPU and CPU in between the iterations. In this paper we present the novelties in our approach and techniques employed to represent data, compute distances, centroids and identify the cluster elements using the GPU. We measure performance using the metric: computational time per iteration. Our implementation of k-means clustering on an Nvidia 5900 graphics processor is 4 to 12 times faster than the CPU and 7 to 22 times faster on the Nvidia 8500 graphics processor for various data sizes. We also achieved 12 to 64 times speed gain on the 5900 and 20 to 140 times speed gains on the 8500 graphics processor in computational time per iteration for evaluations with various cluster sizes.