ppxscal/embedding_network huggingface dataset:
A Flexible Evolutionary Agent: cooperation and competition among real-coded evolutionary operators
Authors: G. Winter, B. Galvan, S. Alonso, B. Gonzalez, J. I. Jimenez, D. Greiner
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

Since it has currently became essential to design more efficient and robust alternative techniques to solve hard optimisation problems in industry or science, and of easy use for practitioners, here a new way of developing simple Artificial Intelligence based Evolutionary Algorithms will be introduced. Our evolutionary computational implementation is a new idea in optimisation. Any evolutionary operators and their associated parameters from well-established evolutionary methods can be considered in such a way that the entire algorithm or intelligent agent-based software performs with very high efficiency without a prior need to investigate which method will be the best for a given optimisation problem.The implementation presented, named Flexible Evolution (FE), has capacity to adapt the operators, the parameters and the algorithm to the circumstances faced at each step of every optimisation run and is able to take into account lessons learned by different research works in the adaptation of operators and parameters. The FE uses Artificial Intelligence concepts to manage internal procedures to adopt decisions and correct the wrong ones. Our aim in this paper will be to give the keys to design these types of procedures, and more specifically, to find the way of achieving an optimum performance of the operators involved in the search, in our case by means of a function included in our algorithm called Sampling Engine. An early implementation has been already developed and tested in our previous works [66&#x2013;68], so in this paper, new results of a second software implementation are presented comparing the results with those obtained by other methods, using well-known hard test functions.
An investigation of cloning in web applications
Authors: Damith C. Rajapakse, Stan Jarzabek
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Cloning (ad hoc reuse by duplication of design or code) speeds up development, but also hinders future maintenance. Cloning also hints at reuse opportunities that, if exploited systematically, might have positive impact on development and maintenance productivity. Unstable requirements and tight schedules pose unique challenges for Web Application engineering that encourage cloning. We are conducting a systematic study of cloning in Web Applications of different sizes, developed using a range of Web technologies, and serving diverse purposes. Our initial results show cloning rates up to 63% in both newly developed and already maintained Web Applications. Expected contribution of this work is two-fold: (1) to confirm potential benefits of reuse-based methods in addressing clone related problems of Web engineering, and (2) to create a framework of metrics and presentation views to be used in other similar studies.
A tensor artificial viscosity for SPH
Authors: J. Michael Owen
Venue: Journal of Computational Physics (2004)

A tensor generalization of the Monaghan-Gingold artificial viscosity for smoothed particle hydrodynamics (SPH) is formulated. We also develop a new limiter to restrict the effects of the artificial viscosity to the direction of shock travel, while maintaining enough of the artificial viscous dissipation to keep the SPH technique stable. We present a series of test problems comparing the new viscosity formalism with the standard method for fluid flows in two and three dimensions, such as shearing systems undergoing shocks. We also present tests of the conservation and transport of angular momentum, since total angular momentum conservation is not guaranteed with the new viscosity formalism.
Three dimensional model: an analyzing sketch for e-commerce theories and applications
Authors: Qi Li, Xianfeng Zhang
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

The sundry e-commerce related theoretic researches and practical application cases appear to have limitations in stressing the essence of e-commerce, depositing profound theories, and well guiding practices. Consequently, there still exists an urgent necessity for an integrated analyzing sketch of e-commerce. After clarifying such vital concepts like commerce (deal), commerce chain (deal chain), six flows, and application dimensions, the paper solves the problem through introducing a conceptual analyzing sketch: three dimensional model for e-commerce researches and applications. It then provides several sample expansions, deriving commerce chain based expansion, and commerce mode and commerce chain based expansion, and commerce chain and application dimension based expansion. Though the advancement has been the most significant contribution, detailed indexes designing may still require more efforts later.
Introducing multimodal character agents into existing web applications
Authors: Kimihito Ito
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This paper proposes a framework in which end-users can instantaneously modify existing Web applications by introducing multimodal user-interface. The authors use the IntelligentPad architecture and MPML as the basis of the framework. Example applications include character agents that read the latest news on a news Web site. The framework does not require users to write any program codes or scripts to introduce multimodal user-interface to existing Web applications.
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
Venue: Networks (2004)

The fleet assignment model &lpar;FAM&rpar; for an airline assigns fleet types to a set of flight legs that satisfies a variety of constraints and minimizes the cost of the assignment. The through assignment model matches inbound flight legs into a city with the outbound flight legs at the same city that are flown by the same plane types and creates through connections &lpar;that is, flight connections with one stopover&rpar;. The combined through and fleet assignment model &lpar;ctFAM&rpar; integrates both the models into a single model and obtains optimal fleet and through assignments by varying both sets of decision variables simultaneously. In a recent article, Ahuja et al. [2001] proposed a very large-scale neighborhood &lpar;VLSN&rpar; search algorithm for the ctFAM. In this article, we generalize this approach to incorporate time windows. In the model considered in this article, each flight leg has a time window associated with its departure time. The objective is to determine fleet assignment, departure time of all flight legs, and through connections between flights to minimize the total cost of fleet assignment and through connections. We call this model ctFAM with time windows or ctFAM-TW. Allowing flexibility in the flight departure time creates greater opportunities for fleet assignment and through connections, and can reduce costs substantially. We describe the details of a VLSN search algorithm for ctFAM-TW and also present computational results of our algorithm on the data provided by a large U.S. airline. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;2&rpar;, 160&ndash;171 2004
Determining recurrent sound correspondences by inducing translation models
Authors: Grzegorz Kondrak
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

I present a novel approach to the determination of recurrent sound correspondences in bilingual wordlists. The idea is to relate correspondences between sounds in wordlists to translational equivalences between words in bitexts (bilingual corpora). My method induces models of sound correspondence that are similar to models developed for statistical machine translation. The experiments show that the method is able to determine recurrent sound correspondences in bilingual wordlists in which less than 30% of the pairs are cognates. By employing the discovered correspondences, the method can identify cognates with higher accuracy than the previously reported algorithms.
Smooth switching problem in buffered crossbar switches
Authors: Simin He, Shutao Sun, Wei Zhao, Yanfeng Zheng, Wen Gao
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Scalability considerations drive the switch fabric design to evolve from output queueing to input queueing and further to combined input and crosspoint queueing (CICQ). However, few CICQ switches are known with guaranteed quality of service, and credit-based flow control induces a scalability bottleneck. In this paper, we propose a novel CICQ switch called the smoothed buffered crossbar or sBUX, based on a new design objective of smoothness and on a new rate-based flow control scheme called the smoothed multiplexer or sMUX. It is proved that with a buffer of just four cells at each crosspoint, sBUX can utilize 100% of the switch capacity to provide deterministic guarantees of bandwidth and fairness, delay and jitter bounds for each flow. In particular, neither credit-based flow control nor speedup is used, and arbitrary fabric-internal latency is allowed between line cards and the switch core.
Automated Eye Motion Using Texture Synthesis
Authors: Zhigang Deng, J. P. Lewis, Ulrich Neumann
Venue: IEEE Computer Graphics and Applications (2005)

Modeling and animating human eyes requires special care, because, as the "windows to the soul", the eyes are particularly scrutinized by human observers.Our goal in this article is to simultaneously synthesize realistic eye gaze and blink motion, accounting for any possible correlations between the two. This problem of synthesizing signals that appear similar (but not identical) to a given sample is essentially the same problem as texture synthesis, but in a one-dimensional (vector) context. We demonstrate that texture synthesis methods can be applied to this animation problem, providing an effective method for capturing both perceptible movement and blink statistics, and any correlations between them. The resulting method is simple to implement yet produces life-like and lively eye motion for applications where automated movement (for example, for game characters) or voiceless eye motions (such as listening avatars) is a requirement.
Supporting the Conceptual Modeling of Web Applications: The MODE Project
Authors: Mario Bochicchio, Nicola Fiore
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Web application designers should be able to integrate different methods and techniques in order to correctly organize the overall design-implementation-test process. The conceptual model plays an important part in the development process [1]. Considering that no model can be exploited to its maximum potential unless it is supported by a proper set of development tools, in this paper we present MODE, a tool for conceptual modeling of web applications based on UWA methodology and on the related HDM2000 model. In MODE the designer can work simultaneously at different levels and on different parts of the design in accordance with UWA methodology. After a first off-line version of MODE based on Microsoft Visio a second it is available a new on-line editor based on Microsoft .Net framework. Both these versions allow the production of well-organized design documents using the Microsoft office automation features. In particular the on-line version, introduced in this paper, open new ways to the cooperative design. According to Rational Rose that has demonstrated the benefits derived from the adoption of a design tools with prototyping features, MODE can be used in conjunction with WARP, a fast prototyping system for Web applications. A real life experience of the use of the methodology and of the MODE are reported.
Automatic generation of CHR constraint solvers
Authors: Slim Abdennadher, Christophe Rigotti
Venue: Theory and Practice of Logic Programming (2005)

In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tabled resolution for constraint logic programming, in order to check the validity of the rules. Compared to previous work (Apt and Monfroy 1999; Ringeissen and Monfroy 2000; Abdennadher and Rigotti 2000; Abdennadher and Rigotti 2001a), where different methods for automatic generation of constraint solvers have been proposed, our approach enables the generation of more expressive rules (even recursive and splitting rules) that can be used directly as CHR solvers.
NIPPERS: Network of InterPolated PeERS for Web Service Discovery
Authors: Ch. Makris, E. Sakkopoulos, S. Sioutas, P. Triantafillou, A. Tsakalidis, B. Vassiliadis
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Web services are becoming an important enabler of the Semantic Web. Besides the need for a rich description mechanism, Web Service information should be made available in an accessible way for machine processing. In this paper, we propose a new P2P basedapproach for Web Services discovery. Peers that store Web Services information, such as data item descriptions, are efficiently located using a scalable and robust data indexing structure for Peer-to-Peer data networks, NIPPERS. We present a theoretical analysis which shows that the communication cost of the query and update operations scale double-logarithmically with the number of NIPPERS nodes. Furthermore, we show that the network is robust with respect to failures fulfilling quality of web services requirements.
Analysis of search and replication in unstructured peer-to-peer networks
Authors: Saurabh Tewari, Leonard Kleinrock
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

This paper investigates the effect of the number of file replicas on search performance in unstructured peer-to-peer networks. We observe that for a search network with a random graph topology where file replicas are uniformly distributed, the hop distance to a replica of a file is logarithmic in the number of replicas. Using this observation we show that flooding-based search is optimized when the number of replicas is proportional to the file request rates. This replica distribution is also optimal for download time and since flooding has logarithmically better search time than random walk under its optimal replica distribution, we investigate the query-processing load using this distribution.
Evaluation of multimodal input for entering mathematical equations on the computer
Authors: Lisa Anthony, Jie Yang, Kenneth R. Koedinger
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Current standard interfaces for entering mathematical equations on computers are arguably limited and cumbersome. Mathematics notations have evolved to aid visual thinking and yet text-based interfaces relying on keyboard-and-mouse input do not take advantage of the natural two-dimensional aspects of math. Due to its similarities to paper-based mathematics, pen-based handwriting input may be faster, more efficient, and more preferable for entering mathematics on computers. This paper presents an empirical study that tests this hypothesis. We also explored a multimodal input method combining handwriting and speech because we hypothesize that it may enhance computer recognition and aid user cognition. Novice users were indeed faster, more efficient and enjoyed the handwriting modality more than a standard keyboard-and-mouse mathematics interface, especially as equation length and complexity increased. The multimodal handwriting-plus-speech method was faster and better liked than the keyboard-and-mouse method and was not much worse than handwriting alone.
Exploring the energy efficiency of cache coherence protocols in single-chip multi-processors
Authors: Mirko Loghi, Martin Letis, Luca Benini, Massimo Poncino
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

The performance of the various cache coherence protocols proposed in the literature have been extensively analyzed in the context of high-performance multi-processor systems.A similar analysis for Multi-Processor Systems-on-Chips (MP-SoCs), where energy is at least as important as performace, and for which strict constraints on hardware and software resources do exist, has not been done yet.This work provides an effort in that sense, showing energy/performance tradeoffs for different snoop-based protocols on a realistic MPSoC architecture. The analysis leverage a multi-processor simulation platform, augmented with accurate power models, that allows cycle-accurate simulations.Our analysis show that (i) cache write policy is actually more important than the actual cache coherence protocol, and (ii) matching the programming model and style to the architecture may have dramatic effects on the energy and performance of the system.
Looking back at plan AHEAD™: exercising user- centered design in emergency management
Authors: Leo Frishberg
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Plan AHEAD™- All Hazard Exercise Development and Administration is a usability test development tool designed for emergency management agencies focused on disaster preparedness. Several user- centered design principles employed to develop Plan AHEAD are discussed including ethnographic research, rapid prototyping and iterative design. Specific design decisions that rely on these approaches are highlighted. Alternative design approaches that failed to meet user requirements are included. Plan AHEAD™ incorporated design elements that were novel to the Emergency Exercise Development domain. In part because of the intensive user- centered design approaches, Plan AHEAD continues to be used by emergency managers worldwide; even with the approaches described, the application can benefit from several usability improvements.
Total leakage optimization strategies for multi-level caches
Authors: Robert Bai, Nam-Sung Kim, Dennis Sylvester, Trevor Mudge
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Gate leakage current is fast becoming a major contributor to total leakage and will become the dominant leakage mechanism as gate oxide is scaled below 10Å. This has special relevance for caches, because they are often the largest component by area in state-of-the-art microprocessors, and leakage is their major contribution to overall chip power. In this paper, we investigate the impact of Tox and Vth on power performance trade-offs for on-chip caches. We examine the optimization of the various components of a single level cache and then extend this to two level cache systems. In addition to leakage, our studies also account for the dynamic power expended as a result of cache misses. Our results show that, surprisingly, one can often reduce overall power by increasing the size of the L2 cache if we only allow one pair of Vth/Tox in L2. We further show that two Vth's and two Tox's are sufficient to get close to an optimal solution and that Vth is generally a better design knob than Tox for leakage optimization, thus it is better to restrict the number of Tox's rather than Vth's if cost is a concern. Finally, we show that optimal power performance points are remarkably robust to wide changes in ambient temperature.
Kinematic path-tracking of mobile robot using iterative learning control
Authors: Min K. Kang, Jin S. Lee, Kyoung L. Han
Venue: Journal of Robotic Systems (2005)

This paper develops a kinematic path-tracking algorithm for a nonholonomic mobile robot using an iterative learning control (ILC) technique. The proposed algorithm produces a robot velocity command, which is to be executed by the proper dynamic controller of the robot. The difference between the velocity command and the actual velocity acts as state disturbances in the kinematic model of the mobile robot. Given the kinematic model with state disturbances, we present an ILC-based path-tracking algorithm. An iterative learning rule with both predictive and current learning terms is used to overcome uncertainties and the disturbances in the system. It shows that the system states, outputs, and control inputs are guaranteed to converge to the desired trajectories with or without state disturbances, output disturbances, or initial state errors. Simulations and experiments using an actual mobile robot verify the feasibility and validity of the proposed learning algorithm. &copy; 2005 Wiley Periodicals, Inc.
Asymptotic Stability for Intermittently Controlled Second-Order Evolution Equations
Authors: A. Haraux, P. Martinez, J. Vancostenoble
Venue: SIAM Journal on Control and Optimization (2005)

Motivated by several works on ordinary differential equations, we are interested in the asymptotic stability of intermittently controlled partial differential equations. We give a condition of asymptotic stability for second-order evolution equations uniformly damped by an on/off feedback. This result extends to the case of partial differential equations a previous result of R. A. Smith concerning ordinary differential equations.
An Energy-Efficient Reconfigurable Circuit-Switched Network-on-Chip
Authors: Pascal T. Wolkotte, Gerard J. M. Smit, Gerard K. Rauwerda, Lodewijk T. Smit
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Network-on-Chip (NoC) is an energy-efficient on-chip communication architecture for multi-tile System-on-Chip (SoC) architectures. The SoC architecture, including its run-time software, can replace inflexible ASICs for future ambient systems. These ambient systems have to be flexible as well as energy-efficient. To find an energy-efficient solution for the communication network we analyze three wireless applications. Based on their communication requirements we observe that revisiting of the circuit switching techniques is beneficial. In this paper we propose a new energy-efficient reconfigurable circuit-switched Network-on-Chip. By physically separating the concurrent data streams we reduce the overall energy consumption. The circuit-switched router has been synthesized and analyzed for its power consumption in 0.13 µm technology. A 5-port circuit-switched router has an area of 0.05 mm^2 and runs at 1075 MHz. The proposed architecture consumes 3.5 times less energy compared to its packet-switched equivalent.
An AES S-Box to Increase Complexity and Cryptographic Analysis
Authors: Jingmei Liu, Baodian Wei, Xiangguo Cheng, Xinmei Wang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

It is well known that the algebraic expression of the Advanced Encryption Standard (AES) Rijndael S-box is very simple and only 9 terms are involved. In this paper a new algebraic method is proposed to illustrate the reason why AES S-box algebraic expression is very simple, which corrects all the available inaccurate illustrations. An improved AES S-box is also presented to improve the complexity of AES S-box algebraic expression with terms increasing from 9 to 255 and algebraic degree invariable. The improved AES S-box also has good properties of Boolean functions in SAC and balance, and is capable of attacking against differential cryptanalysis with high reliable security.