ppxscal/embedding_network huggingface dataset:
IKE context transfer in an IPv6 mobility environment
Authors: Fabien Allard, Jean-Michel Combes, Jean-Marie Bonnin, Julien Bournelle
Venue: Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture (2008)

Internet Security is a major goal for both ISPs1 and their customers but security provisioning has a cost in terms of bandwidth consumption and cryptographic material computation. In a mobility context this security must be set up from scratch after each handover and for each customer. The context transfer mechanism provides an efficient way to re-establish security parameters. This mechanism aims to transfer suitable information between equipments in order to reduce handover time. The benefits for an operator would be to maintain the same security level during and after a handover while keeping costs as lower as possible. In this paper, we use context transfer in order to transfer the IPsec and IKE contexts related to a mobile node from a previous security gateway to a new one. The first purpose of this paper is to define the IKEv2 context and to provide a solution for handling SPIs2 collisions using MOBIKE. The second aim of this paper is to set out an implementation of the Context Transfer Protocol for IPsec/IKEv1 in an IPv6 mobility environment and to provide performance results of such an optimisation.
Removing Noises Similar to Dots from Persian Scanned Documents
Authors: M. Hassan Shirali-Shahreza, Sajad Shirali-Shahreza
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

Nowadays, computer is being used in many aspects of human life. A consequence of computer is electronic documents. Computers cannot understand written documents. So, we need to convert written documents to electronic documents in order to be able to process them with computers. One of the common methods for converting written texts to electronic text is Optical Character Recognition (OCR). A lot of work has been done on English OCR, but Persian/Arabic OCR is still under development.One of the major problems in Persian/Arabic OCR is noise removal. Because dots are very important in Persian and Arabic languages and they are very similar to noises, so noise removal from Persian/Arabic documents is more difficult than Latin documents. In this paper, we propose a new method for removing noises similar to dots from Persian/Arabic printed documents. In this method, the size of the dots is estimated in each region after page segmentation. Then the noises which are similar to dots are removed using the estimated size of the dots. This method is implemented as a part of page segmentation phase and the experimental results are well. Some advantages of our method are high speed and strong resistance to skew.
A Multi-Microprocessor GKS Workstation
Authors: Martin Goebel, Detlef Kroemker
Venue: IEEE Computer Graphics and Applications (1986)

Implementers of graphical application sytems hesitate to interface their applications to the GKS standard not only because GKS functionality seems to be less suffcient for a particular application but also because the use of GKS-as it is offered in portable software implementions-uaually means a loss of system performance. This article describes an installation of GKS on a multi-microprocessor that is based on functional distribution principles as well as on the object-oriented distribution of a graphics system. The main concepts and advantages of a GKS workstation using more than one processing unit with at least one output pipeline are described. The flexibility of this approach opens a perspective view to a GKS workststion that is configurable to application requirements.
Cognitively Inspired Anticipatory Adaptation and Associated Learning Mechanisms for Autonomous Agents
Authors: Aregahegn Negatu, Sidney D'Mello, Stan Franklin
Venue: Anticipatory Behavior in Adaptive Learning Systems: From Brains to Individual and Social Behavior (2007)

This paper describes the integration of several cognitively inspired anticipation and anticipatory learning mechanisms in an autonomous agent architecture, the Learning Intelligent Distribution Agent (LIDA) system. We provide computational mechanisms and experimental simulations for variants of payoff, state, and sensorial anticipatory mechanisms. The payoff anticipatory mechanism in LIDA is implicitly realized by the action selection dynamics of LIDA's decision making component, and is enhanced by importance and discrimination factors. A description of a non-routine problem solving algorithm is presented as a form of state anticipatory mechanism. A technique for action driven sensational and attentional biasing similar to a preafferent signal and preparatory attention is offered as a viable sensorial anticipatory mechanism. We also present an automatization mechanism coupled with an associated deautomatization procedure, and an instructionalist based procedural learning algorithm as forms of implicit and explicit anticipatory learning mechanisms.
Generator for Multimedia Presentations
Authors: Gheorghe Marian, Nicolae Iulian Enescu, Marius Marian, Eugen Dumitrascu
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

It can be observed that from the offered facilities for certain products, just a very small percent is used by users for reasons such as the difficulty in understanding the technical guide that accompanies the product. The utilization of specialty terms makes it difficult the understanding of the 'how to use' instructions. In this article, we want to realize a software program that permits the user, presumably not having programming knowledge, to describe the functionality of a product from a certain category of products. The resulted multimedia presentation will have to accompany the user manual of a product.
Generating Correct Protocols from Contracts: A Commitment-Based Approach
Authors: Nanjangud C. Narendra
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Business contracts are used to govern inter-service interactions. These contracts are often designed by hand and typically adopted by the contract participants after manual analysis. Usually, these contracts are quite complex and involved. Additionally, manual analysis cannot guarantee to the participants whether they would financially benefit from (or at least, not suffer from) participating in the contract. As an initial attempt towards addressing this issue, our earlier work formally defined two notions of contract correctness, wherein a contract is beneficial (resp. safe) for a participant if participating in the contract would leave the participant better off (resp. not worse off) than before. In this paper, we extend our earlier work by analyzing more closely the issues involved in actually generating a contract execution(i.e., operationalization) that is beneficial and/or safe, i.e, correct, from a participant’s perspective. After doing so, we present an algorithm for semi-automatically generating such a family of safe and/or beneficial contract executions.
Study on the Optimum Mixing Throat Length for Drive Nozzle Position of the Central Jet Pump
Authors: C. Prabkeao, K. Aoki
Venue: Journal of Visualization (2005)

The present paper describes a numerical prediction of optimum mixing throat length for various drive nozzle positions of the central jet pump. The flow pattern and pressure distribution in the pump for various positions of the drive nozzle are investigated by three-dimensional numerical analysis using the RNG k-ε turbulent flow model. Numerical analysis was carried out for values of the nozzle throat ratio d/D of the jet pump of 0.5, 0.6 and 0.7, respectively. The static pressure in the flow field of the jet pump is calculated for the following conditions: (1) drive nozzle position from the entrance of the throat l/D=0&sim;2.0, (2) flow rate ratio M=0&sim;1.2, and (3) Reynolds number Re=3.6&times;10$^5$. These calculations revealed that (1) the optimum length of the mixing throat for l/D=0&sim;1.0 is Lm/D=2.0&sim;3.5, (2) the length of the mixing throat for l/D=0 and M=0 (suction flow rate ratio=0) is approximately Lm/D=3.5, and (3) the maximum efficiency is obtained for d/D=0.6 at l/D=0.5. Moreover, the flow pattern in the mixing throat is clarified through a spark tracing experiment. The results obtained in the visualization experiment and the numerically obtained mixing length agreed well.
GIS for the public sector&colon; Experiences from the city of Belo Horizonte, Brazil
Authors: Karla Albuquerque de V. Borges, Sundeep Sahay
Venue: Information Polity (2000)

Belo Horizonte was one of the first Brazilian municipal administrations to develop an urban Geographic Information System. Situated within the local government tradition of local government, the development and implementation of the Geographic Information System (GIS) commenced in 1989 and has proceeded significantly to the extent that it has become the most complete experience of its kind throughout Brazil, with applications covering areas such as education, health, sanitation, urban planning, transportation and traffic, among others. This article reflects on the experiences of this GIS project, from the technology acquisition and team formation phases, through the creation of the geographic database, to the development of applications and dissemination among users. Current perspectives for the continuing expansion of GIS technology usage in Belo Horizonte are also presented. This &ldquo;successful&rdquo; experience of GIS implementation is contrasted with some GIS projects in India to highlight probable areas of emphasis in future GIS projects in developing countries.
Modeling Change Without Breaking Promises
Authors: Alva L. Couch, Hengky Susanto, Marc Chiarini
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Promise theory defines a method by which static service bindings are made in a network, but little work has been done on handling the dynamic case in which bindings must change over time due to both contingencies and changes in policy. We define two new kinds of promises that provide temporal scope for a conditional promise. We show that simple temporally-scoped promises can describe common network behaviors such as leasing and failover, and allow an agent to completely control the sequence of sets of promises to which it commits with another agent, over time. This allows agents to adapt to changing conditions by making short-term bilateral agreements rather than the long-term unilateral agreements provided by previous promise constructions.
Separating Models of Learning with Faulty Teachers
Authors: Vitaly Feldman, Shrenik Shah, Neal Wadhwa
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

We study the power of two models of faulty teachers in Angluin's exact learning model. The first model we consider is learning from equivalence and incomplete membership query oracles introduced by Angluin and Slonim [1]. In this model, the answers to a random subset of the learner's membership queries may be missing. The second model we consider is random persistent classification noise in membership queries introduced by Goldman et al. [2]. In this model, the answers to a random subset of the learner's membership queries are flipped.We show that the incomplete membership query oracle is strictly stronger than the membership query oracle with persistent noise under the assumption that the problem of PAC learning parities with noise is intractable.We also show that under the standard cryptographic assumptions the incomplete membership query oracle is strictly weaker than the perfect membership query oracle. This strengthens the result of Simon [3] and resolves an open question of Bshouty and Eiron [4].Our techniques are based on ideas from coding theory and cryptography.
Product Schemes Evaluation Method Based on Improved BP Neural Network
Authors: Weiwei Chen, Xiaopeng Wei, Tingting Zhao
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Improved back propagation (BP) neural network evaluation method for product schemes took the main index data as input vector, took the sample comprehensive scores as output by using the analytic hierarchy process (AHP). The network was separately trained by momentum factorial algorithm, Gauss---Newton algorithm and Levenberg-Marquardt algorithm. With the application and verification in Haier refrigerator schemes, the comparison of speed and mean absolute error show that the BP neural network trained by Levenberg-Marquardt algorithm is reliable.
Improving Robustness in Jacobian Adaptation for Noisy Speech Recognition
Authors: Yongjoo Jung
Venue: Proceedings of the 4th IEEE tutorial and research workshop on Perception and Interactive Technologies for Speech-Based Systems: Perception in Multimodal Dialogue Systems (2008)

A method to improve the robustness of the Jacobian adaptation (JA) is proposed. Although it is a usual idea that the reference hidden Markov model (HMM) in the JA is constructed by using the model composition methods like the parallel model combination (PMC), we propose to train the reference HMM directly with the noisy speech and then select the appropriate reference HMM based on the noise types and signal to noise ratio (SNR) values obtained from the input noisy speech. For the estimation of Jacobian matrices and other statistical information for the JA, a data driven method is employed during the training. 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
An Architecture for Learning Agents
Authors: Bartłomiej Śnieżyński
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

This paper contains a proposal of an architecture for learning agents. The architecture supports centralized learning. Learning may be performed by several agents in the system, but it should be independent (without communication or cooperation connected with the learning process). An agent may have several learning modules for different aspects of its activity. Each module can use different learning strategy. Application of the architecture is studied on example of Fish-Banks game simulator.
A Digital Signal Generator
Authors: Tracy Kinsel, John Wuorinen
Venue: IEEE Micro (1981)

Implemented on a single-chip microcomputer, this digital signal generator can provide low-distortion waveforms ofprecise frequency in the low-frequency audio spectrum.
University of Waterloo at INEX2007: Adhoc and Link-the-Wiki Tracks
Authors: Kelly Y. Itakura, Charles L. Clarke
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

In this paper, we describe University of Waterloo's approaches to adhoc and Link-the-Wiki tracks. For the adhoc track, we submitted runs for the focused and the best-in-context tasks. We again show that Okapi BM25 works well for XML retrieval. We also analyze why our element-based best entry point result is better than our passage-based counterpart. Finally, we present our baseline algorithm for embedding incoming and outgoing links in Link-the-Wiki track.
Evolving Expression of Emotions in Virtual Humans Using Lights and Pixels
Authors: Celso Melo, Jonathan Gratch
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

An intelligent virtual human should not be limited to gesture, face and voice for the expression of emotion. The arts have shown us that complex affective states can be expressed resorting to lights, shadows, sounds, music, shapes, colors, motion, among many others [1]. Thus, we previously proposed that lighting and the pixels in the screen could be used to express emotions in virtual humans [2]. Lighting expression inspires in the principles of lighting, which are regularly explored in theatre or film production [3]. Screen expression acknowledges that, at the meta level, virtual humans are no more than pixels in the screen which can be manipulated to convey emotions, in a way akin to the visual arts [4]. In particular, we explore the filtering technique where the scene is rendered to a temporary texture, modified using shaders and, then, presented to the user. Now, having defined the expression channels, how should we express emotions through them? We are presently exploring an evolutionary approach which relies on genetic algorithms (GAs) to learn mappings between emotions and lighting and screen expression. The GAs' clear separation between generation and evaluation of alternatives is convenient for this problem. Alternatives can be generated using biologically inspired operators --- selection, mutation, crossover, etc. Evaluation, in turn, can rely on artificial critics, which define fitness functions from art theory, or on human critics. Humans can be used to fill in the gaps in the literature as well as accommodate the individual, social and cultural values with respect to the expression of emotion in art [1].
Forward Secure Threshold Signature Scheme from Bilinear Pairings
Authors: Jia Yu, Fanyu Kong, Rong Hao
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

A forward secure threshold signature scheme from bilinear pairings is presented in this paper. Compared with previous forward secure threshold signature schemes against malicious adversary, this scheme needs very few interactions and is very efficient. A new interactive zero-knowledge proof protocol is presented and its non-interactive version can verify the validity of part signatures in this scheme. At last, we prove that the scheme is robust and forward secure in the random oracle model.
Providing Naïve Bayesian Classifier-Based Private Recommendations on Partitioned Data
Authors: Cihan Kaleli, Huseyin Polat
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Data collected for collaborative filtering (CF) purposes might be split between various parties. Integrating such data is helpful for both e-companies and customers due to mutual advantageous. However, due to privacy reasons, data owners do not want to disclose their data. We hypothesize that if privacy measures are provided, data holders might decide to integrate their data to perform richer CF services. In this paper, we investigate how to achieve naïve Bayesian classifier (NBC)-based CF tasks on partitioned data with privacy. We perform experiments on real data, analyze our outcomes, and provide some suggestions.
SPI Consulting in a Level 1 Company: An Experience Report
Authors: Tomas Schweigert, Michael Philipp
Venue: Proceedings of the 8th international conference on Product-Focused Software Process Improvement (2007)

It has been demonstrated by several case studies that SPI programs generate a substantial benefit, especially for organizations with immature processes. However, experience shows, that there is little buy in to SPI programs from these organizations. The reason is the step by step approach in ISO 15504 and as well in CMMi (Staged) especially the lack of ability to deliver sufficient data for planning and confirming improvements. In these cases a measurement oriented approach might work better because it increases the probability of senior management commitment by focusing aspects which are in the range of management perception.
Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor
Authors: Daniil Ryabko
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

We consider the problem of sequence prediction in a probabilistic setting. Let there be given a class $\mathcal C$ of stochastic processes (probability measures on the set of one-way infinite sequences). We are interested in the question of what are the conditions on $\mathcal C$ under which there exists a predictor (also a stochastic process) for which the predicted probabilities converge to the correct ones if any of the processes in $\mathcal C$ is chosen to generate the data. We find some sufficient conditions on $\mathcal C$ under which such a predictor exists. Some of the conditions are asymptotic in nature, while others are based on the local (truncated to first observations) behaviour of the processes. The conditions lead to constructions of the predictors. In some cases we obtain rates of convergence that are optimal up to an additive logarithmic term. We emphasize that the framework is completely general: the stochastic processes considered are not required to be i.i.d., stationary, or to belong to some parametric family.
Decision making in multi-issue e-market auction using fuzzy techniques and negotiable attitudes
Authors: Madhu Goyal, Jie Lu, Guang Zhang
Venue: Journal of Theoretical and Applied Electronic Commerce Research (2008)

Online auctions are one of the most effective ways of negotiation of salable goods over the internet. Software agents are increasingly being used to represent humans in online auctions. These agents can systematically monitor a wide variety of auctions and can make rapid decisions about what bids to place in what auctions. To be successful in open multi-agent environments, agents must be capable of adapting different strategies and tactics to their prevailing circumstances. This paper presents a software test-bed for studying autonomous bidding strategies in simulated auctions for procuring goods. It shows that agents' bidding strategy explore the attitudes and behaviors that help agents to manage dynamic assessment of prices of goods given the different criteria and scenario conditions. Our agent also uses fuzzy techniques for the decision making: to make decisions about the outcome of auctions, and to alter the agent's bidding strategy in response to the different criteria and market conditions.
Bone Glow: An Improved Method for the Assignment of Weights for Mesh Deformation
Authors: Rich Wareham, Joan Lasenby
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

Many real-time algorithms for mesh deformation driven by animation of an underlying skeleton make use of a set of per-bone weights associated with each vertex. There are few unguided algorithms for the assignment of these weights with a recent proposed solution being bone heat [1]. In this paper, we briefly discuss bone heat and provide examples where it performs poorly. We then develop a refinement of bone heat, termed bone glow, which, in our validation, performed as well as bone heat in simple cases while not suffering from bone heat's observed weaknesses.