ppxscal/embedding_network huggingface dataset:
Covariance Matrix Adaptation Revisited --- The CMSA Evolution Strategy ---
Authors: Hans-Georg Beyer, Bernhard Sendhoff
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

The covariance matrix adaptation evolution strategy (CMA-ES) rates among the most successful evolutionary algorithms for continuous parameter optimization. Nevertheless, it is plagued with some drawbacks like the complexity of the adaptation process and the reliance on a number of sophisticatedly constructed strategy parameter formulae for which no or little theoretical substantiation is available. Furthermore, the CMA-ES does not work well for large population sizes. In this paper, we propose an alternative --- simpler --- adaptation step of the covariance matrix which is closer to the "traditional" mutative self-adaptation. We compare the newly proposed algorithm, which we term the CMSA-ES, with the CMA-ES on a number of different test functions and are able to demonstrate its superiority in particular for large population sizes.
Externalizing the Multiple Sequence Alignment Problem with Affine Gap Costs
Authors: Stefan Edelkamp, Peter Kissmann
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

Multiple sequence alignment (MSA) is a problem in computational biology with the goal to discover similarities between DNA or protein sequences. One problem in larger instances is that the search exhausts main memory. This paper applies disk-based heuristic search to solve MSA benchmarks. We extend iterative-deepening dynamic programming, a hybrid of dynamic programming and IDA*, for which optimal alignments with respect to similarity metrics and affine gap cost are computed. We achieve considerable savings of main memory with an acceptable time overhead. By scaling buffer sizes, the space-time trade-off can be adapted to existing resources.
Secure and Efficient Trust Negotiation
Authors: Fuchun Guo, Zhide Chen, Yi Mu, Li Xu, Shengyuan Zhang
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

The notion of Hidden Credentials can be applied to protection of sensitive credentials, resources and policies in Trust Negotiation. It allows the server to encrypt a resource so that only the client with the correct credentials can decrypt it. The existing scheme of hidden credentials requires that the server grant access to the encrypted resource directly to the client during the negotiation without knowing whether or not the client can decrypt it. It would be a burden if the resources were very large. We found that when the server grants access to services rather than resources, the existing hidden credentials schemes are insecure under our policy attacks, since the server can illegally learn the client's credentials from the attack. In this paper, we propose a scheme to stop the server from mounting a policy attack.
A Hybrid Quantum-Inspired Evolutionary Algorithm for Capacitated Vehicle Routing Problem
Authors: Jing-Ling Zhang, Yan-Wei Zhao, Dian-Jun Peng, Wan-Liang Wang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

A hybrid Quantum-Inspired Evolutionary Algorithm (HQEA) with 2-OPT sub-routes optimization for capacitated vehicle routing problem (CVRP) is proposed. In the HQEA, 2-OPT algorithm is used to optimize sub-routes for convergence acceleration. Moreover, an encoding method of converting Q-bit representation to integer representation is designed. And genetic operators of quantum crossover and quantum variation are applied to enhance exploration. The proposed HQEA is tested based on classical benchmark problems of CVRP. Simulation results and comparisons with genetic algorithm show that the proposed HQEA has much better exploration quality and it is an effective method for CVRP.
Acquisition of Off-Screen Object by Predictive Jumping
Authors: Kazuki Takashima, Sriram Subramanian, Takayuki Tsukitani, Yoshifumi Kitamura, Fumio Kishino
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

We propose predictive jumping (PJ), a fast and efficient algorithm that enables user navigation to off-screen targets. The algorithm is inspired by Delphian Desktop [1] and the off-screen visualization technique---Halo [2]. The Halos represented at the edge of the viewport help users estimate off-screen target distance and encourage them to make a single fluid mouse movement toward the target. Halfway through the user's motion, the system predicts the user's intended target and quickly moves the cursor towards that predicted off-screen location. In a pilot study we examine the user's ability to select off-screen targets with predictive models based on user's pointing kinematics for off-screen pointing with Halo. We establish a linear relationship between peak velocity and target distance for PJ. We then conducted a controlled experiment to evaluate PJ against other Halo-based techniques, Hop [8] and Pan with Halo. The results of the study highlight the effectiveness of PJ.
Simulating the dynamical friction force on ions due to a briefly co-propagating electron beam
Authors: George I. Bell, David L. Bruhwiler, Alexei Fedotov, Andrey Sobol, Richard S. Busby, Peter Stoltz, Dan T. Abell, Peter Messmer, Ilan Ben-Zvi, Vladimir Litvinenko
Venue: Journal of Computational Physics (2008)

We present two algorithms for accurate beam-frame simulations of the dynamical friction force on a non-relativistic ion moving for a short time in a low-density electron distribution, in the presence of arbitrary external fields. A special-purpose 4th-order predictor-corrector (''Hermite'') algorithm, taken from the astrophysical dynamics community, has been generalized to work with charged particles in the presence of a constant magnetic field. An alternative algorithm uses operator splitting techniques to solve binary Coulomb collisions (BCC) in the presence of arbitrary external fields. We discuss the close mathematical relationship between the Hermite and BCC algorithms, and their order of convergence. We discuss the parallel efficiency of the BCC algorithm and use it in the parallel simulation framework VORPAL to study problems in a parameter regime relevant to the electron cooling section for the proposed luminosity upgrade of the Relativistic Heavy Ion Collider. In particular, we simulate the field-free case to show how finite time effects strongly modify the traditional Coulomb logarithm, resulting in a significant reduction of the dynamical friction force as calculated by standard theoretical formulas. We show that diffusive dynamics can be correctly simulated, but that it must be artificially suppressed in order to accurately obtain the friction force. We discuss the proposed use of a helical undulator magnet to focus the electron beam and inhibit electron-ion recombination, showing that this device reduces the friction force.
Tools for Consistency Management between Design Products
Authors: S. Becker, A. Körtgen, M. Nagl
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

The results of the IMPROVE subproject B2 (cf. Sect. 3.2) are to be transferred to industry. The corresponding transfer subproject T5 is described in this section. The main goal is to provide a universal integrator platform for the engineering solution Comos PT of our industrial partner innotec. The core results to be transferred are the integration rule definition formalism and the integrator framework including the execution algorithm.Besides evaluation in practice, the transfer subproject will also deal with major extensions. For instance, the integration rule definition formalism will be extended and repair actions to restore consistency of damaged links will be incorporated into the framework. The transfer is intended to be bidirectional, i.e. our partner's knowledge will influence our research as well.
Implementing Software Measurement Programs in Non Mature Small Settings
Authors: María Díaz-Ley, Félix García, Mario Piattini
Venue: Software Process and Product Measurement: International Conference, IWSM-Mensura 2007, Palma de Mallorca, Spain, November 5-8, 2007. Revised Papers (2007)

Although measurement has been successfully applied in various areas, it has proved to be a complex and difficult undertaking in the field of software and especially in the context of small and medium enterprises (SMEs). Measurement programs in SMEs with a low maturity level should be tailored to their limitations (limited resources, experts, etc.) in order to carry out the measurement initiatives efficiently. In this paper we report the method, principles and practices followed in our experience for defining and implementing a measurement program in the development department of Sistemas Técnicos de Loterías del Estado (STL). We also show the characteristics of this company which guided our approach towards tackling the problem, and the resulting software measurement program. As a result of the application of certain practices in the company, some significant benefits were obtained, which could be replicated in similar environments.
A 4---Vector MDM Algorithm for Support Vector Training
Authors: Álvaro Barbero, Jorge López, José R. Dorronsoro
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

While usually SVM training tries to solve the dual of the standard SVM minimization problem, alternative algorithms that solve the Nearest Point Problem (NPP) for the convex hulls of the positive and negative samples have been shown to also provide effective SVM training. They are variants of the Mitchell---Demyanov---Malozemov (MDM) algorithm and although they perform a two vector weight update, they must compute 4 possible updating vectors before deciding which ones to use. In this work we shall propose a 4---vector version of the MDM algorithm that requires substantially less iterations than the previous 2---vector MDM algorithms and leads to faster training if kernel operations are cached.
Revelator Game of Inquiry: A Peircean Challenge for Conceptual Structures in Application and Evolution
Authors: Mary Keeler
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

In unpublished manuscripts from Peirce"s last decade, he emphasizes his dialogic and interactive view of logic-as-semeotic, exemplified by the Existential Graphs. Recently published research of these manuscripts solidly supports the project of creating a game for instituting his pragmatic methodology to demonstrate his full semeotic logic. Revelator is my conception of that game, to pursue Peirce"s ideas for improving the economy of inquiry. Revelator"s design somewhat resembles many well-known games, such as bridge, chess, crossword puzzles, and even poker, but its core purpose is to reveal complex relations among the conditional propositions, by which players represent their conjectures as plays in the game. The game design invites the application and evolution of Conceptual Structures technology to aggregate, integrate, and display the complex logical behavior of these propositions. Plays are treated as rule-defined agents that can adapt in complex conceptual environments to form multi-agents, promoting the emergence of collaboratively formulated and selected models of possible knowledge (or robust hypotheses). Peirce"s full vision of a dynamic logic continues to challenge Conceptual Structures to become an engine of inquiry.
Context Model for Multi-Agent System Reconfiguration
Authors: Krzysztof Stebel, Dariusz Choiński
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

This paper presents a reconfigurable multi-agent system (MAS) applied to distributed control system (DCS). Agents co-operate, evaluating the system on different levels of information abstraction. Context-based statistical remote expert agent or local supervisory agent are used to evaluate control agent performance. Using expert-selected period of good performance the reference distribution function is proposed. Periodically, for any monitoring period, a sample of observations is taken for local or remote system performance monitoring. Because evaluation may also be carried out remotely two cases should be considered. Remote expert observes changes of parameters that come from process performance degradation. Second case refers to communication problems when data transmission is corrupted and can not be used for system evaluation. Because of that application, context model is necessary to inform the remote expert about transmission quality. For evaluation of transmission channel, the idea of a context tree is utilised. Number of nodes and leaves taken into considerations depends on the expert's knowledge.
Combs Method Used in an Intuitionistic Fuzzy Logic Application
Authors: Jon E. Ervin, Sema E. Alptekin
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In this paper, we describe the optimization of membership functions in an Intuitionistic Fuzzy Logic application developed in the Matlab software environment. A unique formulation, known as Combs method, is used to control the problem of `exponential rule expansion' in the rule base. The optimization is performed using a Particle Swarm Optimization (PSO) algorithm to adjust the geometry of trapezoidal membership functions. The technique is tested against the Wisconsin Breast Cancer Database. The use of Combs method shows great promise in significantly expanding the range and complexity of problems that can be addressed using Intuitionistic Fuzzy Logic.
Nilpotency and Limit Sets of Cellular Automata
Authors: Pierre Guillon, Gaétan Richard
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

A one-dimensional cellular automaton is a dynamical system which consisting in a juxtaposition of cells whose state changes over discrete time according to that of their neighbors. One of its simplest behaviors is nilpotency: all configurations of cells are mapped after a finite time into a given "null" configuration. Our main result is that nilpotency is equivalent to the condition that all configurations converge towards the null configuration for the Cantor topology, or, equivalently, that all cells of all configurations asymptotically reach a given state.
Driver Destination Models
Authors: John Krumm, Eric Horvitz
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Predictive models of destinations represent an opportunity in the context of the increasing availability and sophistication of in-car driving aids. We present analyses of drivers' destinations based on GPS data recorded from 180 volunteer subjects. We focus on the probability of observing drivers visit previously unobserved destinations given time of day and day of week, and the rate of decline of observing such new destinations with time. For the latter, we discover a statistically significant difference based on gender.
Jag-Free Images on Raster Displays
Authors: Akira Fujimoto, Kansei Iwata
Venue: IEEE Computer Graphics and Applications (1983)

A subpixel addressability feature allows this algorithm to address vector end points between pixel centers and helps it eliminate the Achilles' heel of raster displays¿jaggies.
On the Domain Attraction of Fuzzy Neural Networks
Authors: Tingwen Huang, Xiaofeng Liao, Hui Huang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

In this paper, we study qualitative properties of equilibrium points in a class of interval fuzzy neural networks and obtain an estimate on the domain of robust attraction of locally exponentially stable equilibrium points. Both the conditions and the estimate are formulated in terms of the parameter intervals, so they are verifiable easily.
Semi-supervised Clustering Using Incomplete Prior Knowledge
Authors: Chao Wang, Weijun Chen, Peipei Yin, Jianmin Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Clustering algorithms incorporated with prior knowledge have been widely studied and many nice results were shown in recent years. However, most existing algorithms implicitly assume that the prior information is complete, typically specified in the form of labeled objects with each category. These methods decay and behave unstably when the labeled classes are incomplete. In this paper a new type of prior knowledge which bases on partially labeled data is proposed. Then we develop two novel semi-supervised clustering algorithms to face this new challenge. An empirical study performed on benchmark dataset shows that our proposed algorithms produce better results with limited labeled examples comparing with existing baselines.
Evaluation of Continuous Direction Encoding with Tactile Belts
Authors: Martin Pielot, Niels Henze, Wilko Heuten, Susanne Boll
Venue: Proceedings of the 3rd international workshop on Haptic and Audio Interaction Design (2008)

Tactile displays consisting of tactors located around the user's waist are a proven means for displaying directions in the horizontal plane. These displays use the body location of tactors to express directions. In current implementations the number of directions that can be expressed is limited to the number of tactors. However, the required number of tactors might not be available or their configuration requires too much effort. This paper describes the design and the evaluation of a presentation method that allows displaying direction between tactors by interpolated their intensity. We compare this method with the prevalent one by letting participants determine directions and having them navigate along tactile waypoints in a virtual environment. The interpolated direction presentation significantly improved the accuracy of perceived directions. Discrete direction presentation, however, proved to be better suited for waypoint navigation and was found easier to process.
On the Power of Bitslice Implementation on Intel Core2 Processor
Authors: Mitsuru Matsui, Junko Nakajima
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

This paper discusses the state-of-the-art fast software implementation of block ciphers on Intel's new microprocessor Core2, particularly concentrating on "bitslice implementation". The bitslice parallel encryption technique, initially proposed by Biham for speeding-up DES, has been successful on RISC processors with many long registers, but on the other side bitsliced ciphers are not widely used in real applications on PC platforms, because in many cases they were actually not very fast on previous PC processors. Moreover the bitslice mode requires a non-standard data format and hence an additional format conversion is needed for compatibility with an existing parallel mode of operation, which was considered to be expensive.This paper demonstrates that some bitsliced ciphers have a remarkable performance gain on Intel's Core2 processor due to its enhanced SIMD architecture. We show that KASUMI, a UMTS/GSM mobile standard block cipher, can be four times faster when implemented using a bitslice technique on this processor. Also our bitsliced AES code runs at the speed of 9.2 cycles/byte, which is the performance record of AES ever made on a PC processor. Next we for the first time focus on how to optimize a conversion algorithm between a bitslice format and a standard format on a specific processor. As a result, the bitsliced AES code can be faster than a highly optimized "standard AES" code on Core2, even taking an overhead of the conversion into consideration. This means that in the CTR mode, bitsliced AES is not only fast but also fully compatible with an existing implementation and moreover secure against cache timing attacks, since a bitsliced cipher does not use any lookup tables with key/data-dependent address.
Timeline Analysis of Web News Events
Authors: Jiangtao Qiu, Chuan Li, Shaojie Qiao, Taiyong Li, Jun Zhu
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

With a large number of news available on the internet everyday, it is an interesting work to automatically organize news events by time order and dependencies between events. The work may help users to conveniently and quickly browse news event evolution. This paper defines an Event Timeline Analysis (ETA) task to meet the need. Compared with existing works, ETA presents event evolution in graph manner, and incrementally updates the process of events evolving so as to better fit feature of stream of news on the internet. In order to complete ETA task, this paper proposes an Event Evolving Graph (EEG) structure and building and tidying algorithm of EEG. Experiments demonstrate the utility and feasibility of the method.
Negabent Functions in the Maiorana---McFarland Class
Authors: Kai-Uwe Schmidt, Matthew G. Parker, Alexander Pott
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

Boolean functions which are simultaneously bent and negabent are studied. Transformations that leave the bent-negabent property invariant are presented. A construction for infinitely many bent-negabent Boolean functions in 2mn variables (m > 1) and of algebraic degree at most n is described, this being a subclass of the Maiorana---McFarland class of bent functions. Finally it is shown that a bent-negabent function in 2n variables from the Maiorona---McFarland class has algebraic degree at most n ¿ 1.
A Mechanism for Solving the Unencoded Chinese Character Problem on the Web
Authors: Te-Jun Lin, Jyun-Wei Huang, Christine Lin, Hung-Yi Li, Hsiang-An Wang, Chih-Yi Chiu
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

The unencoded Chinese character problem that occurs when digitizing historical Chinese documents makes digital archiving difficult. Expanding the character coding space, such as by using the Unicode Standard, does not solve the problem completely due to the extensibility of Chinese characters. In this paper, we propose a mechanism based on a Chinese glyph structure database, which contains glyph expressions that represent the composition of Chinese characters. Users can search for Chinese characters through our web interface and browse the search results. Each Chinese character can be embedded in a web document using a specific Java Script code. When the web document is opened, the Java Script code will load the image of the Chinese character in an appropriate font size for display. Even if the Chinese characters are not available in the database, their images can be generated through the dynamic character composition function. As the proposed mechanism is cross-platform, users can easily access unencoded Chinese characters without installing any additional font files in their personal computers. A demonstration system is available at http://char.ndap.org.tw.
A Link-Load Balanced Low Energy Mapping and Routing for NoC
Authors: Zhou Wenbiao, Zhang Yan, Mao Zhigang
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

The paper presents a novel mapping and routing technique for the mesh based NoC design problem with an objective of minimizing the energy consumption and normalized worst link-load. The proposed algorithm is a particle swarm optimization (PSO) based two phases process, one is mapping core onto NoC, and another is the allocation of routing path. The proposed algorithm uses a novel representation for PSO particle. Experimental results show that the proposed technique can reduce the normalized worst link-load by 20% on average while guarantee a low energy consumption.