ppxscal/embedding_network huggingface dataset:
A Hybrid Neural-Genetic Algorithm for the Frequency Assignment Problem in Satellite Communications
Authors: S. Salcedo-Sanz, C. Bousoño-Calzón
Venue: Applied Intelligence (2005)

A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel interference between satellite communication systems by rearranging the frequency assignments. Previous approaches to FAPSC show lack of scalability, which leads to poor results when the size of the problem grows. The NG algorithm consists of a Hopfield neural network which manages the problem constraints hybridized with a genetic algorithm for improving the solutions obtained. This separate management of constraints and optimization of objective function gives the NG algorithm the properties of scalability required.We analyze the FAPSC and its formulation, describe and discuss the NG algorithm and solve a set of benchmark problems. The results obtained are compared with other existing approaches in order to show that the NG algorithm is more scalable and performs better than previous algorithms in the FAPSC.
Analysing customer Churn in insurance data: a case study
Authors: Katharina Morik, Hanna Köpcke
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Designing a new application of knowledge discovery is a very tedious task. The success is determined to a great extent by an adequate example representation. The transformation of given data to the example representation is a matter of feature generation and selection. The search for an appropriate approach is difficult. In particular, if time data are involved, there exist a large variety of how to handle them. Reports on successful cases can provide case designers with a guideline for the design of new, similar cases. In this paper we present a complete knowledge discovery process applied to insurance data. We use the TF/IDF representation from information retrieval for compiling time-related features of the data set. Experimental reasults show that these new features lead to superior results in terms of accuracy, precision and recall. A heuristic is given which calculates how much the feature space is enlarged or shrinked by the transformation to TF/IDF.
Automating Content Extraction of HTML Documents
Authors: Suhit Gupta, Gail E. Kaiser, Peter Grimm, Michael F. Chiang, Justin Starren
Venue: World Wide Web (2005)

Web pages often contain clutter (such as unnecessary images and extraneous links) around the body of an article that distracts a user from actual content. Extraction of "useful and relevant" content from web pages has many applications, including cell phone and PDA browsing, speech rendering for the visually impaired, and text summarization. Most approaches to making content more readable involve changing font size or removing HTML and data components such as images, which takes away from a webpage's inherent look and feel. Unlike "Content Reformatting," which aims to reproduce the entire webpage in a more convenient form, our solution directly addresses "Content Extraction." We have developed a framework that employs an easily extensible set of techniques. It incorporates advantages of previous work on content extraction. Our key insight is to work with DOM trees, a W3C specified interface that allows programs to dynamically access document structure, rather than with raw HTML markup. We have implemented our approach in a publicly available Web proxy to extract content from HTML web pages. This proxy can be used both centrally, administered for groups of users, as well as by individuals for personal browsers. We have also, after receiving feedback from users about the proxy, created a revised version with improved performance and accessibility in mind.
Machine translation using recursive chain-link-type learning based on translation examples
Authors: Hiroshi Echizen-Ya, Kenji Araki, Yoshio Momouchi, Koji Tochinai
Venue: Systems and Computers in Japan (2004)

Rule-based machine translation analyzes source-language sentences using large-scale linguistic knowledge that is given by the developer beforehand. However, it is difficult to give complete linguistic knowledge to the system ex ante because natural language has various linguistic phenomena. Therefore, we worked to develop learning-based machine translation. In learning-based machine translation, a system acquires translation rules automatically from translation examples that are pairs of source and target language sentences. However, existing learning-based machine translation presents the problem that it requires a large number of similar translation examples. Consequently, it cannot acquire enough useful translation rules from sparse translation examples. This paper proposes a method of machine translation using Recursive Chain-Link-type Learning, which can acquire many useful translation rules from sparse translation examples. Our system, based on this method, efficiently acquires translation rules from each translation example without requiring two similar translation examples. Translation rules are acquired by extracting corresponding parts between source and target language sentences in translation examples. Our system determines those corresponding parts using previously acquired translation rules. Therefore, the system engenders a chain reaction in acquisition of new translation rules. Evaluation experiments using our system demonstrated an effective translation rate of 61.1&percnt;. Moreover, the effective translation rate was 85.0&percnt; when sufficient learning data were given to our system. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 1&ndash;15, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10511
Analyzing the statistical features of CIXL2 crossover offspring
Authors: C. Herv&#x00e1;s-Mart&#x00ed;nez, D. Ortiz-Boyer
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

We cannot deny the effort that the scientific community is devoting to the explanation of the features of the crossover operator of real-coded genetic algorithms and its effect over the evolutive process. This paper is another step in that direction, we analyze the behavior of the Confidence Interval Based Crossover using L2 Norm (CIXL2). This crossover is based on the learning of the statistical features of localization and dispersion of the best individuals of the population. The crossover obtains, by means of a L2 norm, the estimators of the parameters of localization and dispersion of the distributions of the fittest individuals. From this estimation three virtual parents are created using the localization parameter and the lower and upper bounds of the bilateral confidence intervals of the gene values of the best individuals of the population. This paper studies the statistical features of the offspring generated by this crossover and corroborates this study showing the behavior of the crossover in a set of test functions.
Test cost reduction for logic circuits: Reduction of test data volume and test application time
Authors: Yoshinobu Higami, Seiji Kajihara, Hideyuki Ichihara, Yuzo Takamatsu
Venue: Systems and Computers in Japan (2005)

We believe that reduction of the testing cost is becoming increasingly important as the size of VLSIs becomes larger. Moreover, as the structure of VLSIs becomes more complicated, test compaction, test compression, and test application time reduction for non-stuck-at faults, such as delay faults, bridging faults, crosstalk faults, and open faults, must be considered. In addition, new methods of fault diagnosis and high-level testing must be developed in order to reduce testing costs or diagnostic costs. In this paper we have surveyed recent research on the reduction of testing cost for logic circuits, including test compaction for combinational circuits and sequential circuits, test compaction under IDDQ testing, and test compression and test application time reduction for scan circuits. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(6): 69&ndash;83, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20240
Design evolution of the trinity college IGVC robot ALVIN
Authors: Michelle Bovard, Matthew Gillette, Trishan de Lanerolle, Bozidar Marinkovic, Nhon H. Trinh, Peter Votto, David J. Ahlgren, Kundan Nepal, Amir Tamrakar
Venue: Journal of Robotic Systems (2004)

In this paper we discuss the design and evolution of Trinity College's ALVIN robot, an autonomous ground vehicle that has participated in the Association for Unmanned Vehicle Systems International Intelligent Ground Vehicle Competition (IGVC) since 2000. The paper first discusses the Trinity Robot Study Team, which has been responsible for developing ALVIN. We then illustrate the four generations of ALVIN, focusing on improvements made as the result of performance shortcomings and outright failures. The discussion considers the robot's body design, drive system, sensors, navigation algorithms, and vision systems. We focus especially on the vision and navigation systems developed for Trinity's fourth-generation IGVC robot, ALVIN IV. The paper concludes with a plan for future work on ALVIN and with a discussion of educational outcomes resulting from the ALVIN project. &copy; 2004 Wiley Periodicals, Inc.
Genetic granular classifiers in modeling software quality
Authors: Witold Pedrycz, Giancarlo Succi
Venue: Journal of Systems and Software (2005)

Hyperbox classifiers are one of the most appealing and intuitively transparent classification schemes. As the name itself stipulates, these classifiers are based on a collection of hyperboxes--generic and highly interpretable geometric descriptors of data belonging to a given class. The hyperboxes translate into conditional statements (rules) of the form ''if feature"1 is in [a,b] and feature"2 is in [d,f] and ... and feature"n is in [w,z] then class @w'' where the intervals ([a,b],...,[w,z]) are the respective edges of the hyperbox. The proposed design process of hyperboxes comprises of two main phases. In the first phase, a collection of ''seeds'' of the hyperboxes is formed through data clustering (realized by means of the Fuzzy C-Means algorithm, FCM). In the second phase, the hyperboxes are ''grown'' (expanded) by applying mechanisms of genetic optimization (and genetic algorithm, in particular). We reveal how the underlying geometry of the hyperboxes supports an immediate interpretation of software data concerning software maintenance and dealing with rules describing a number of changes made to software modules and their linkages with various software measures (such as size of code, McCabe cyclomatic complexity, number of comments, number of characters, etc.).
Six language extensions to enhance the portability of mathematical software written in PL/I: background and justification
Authors: Kenneth W. Dritz
Venue: ACM SIGNUM Newsletter (1982)

As part of its revision of ANS PL/I, American National Standards Committee X3J1 is considering extensions like those described here to aid in the development of high-quality portable mathematical software.The new features include environmental enquiry functions, generalization of "restricted expressions" (compile-time expressions), liberalization of the contexts of restricted expressions, a named-literal declaration type, explicit, precision specification for constants, and a pragmatic statement for expressing conditions that an implementation must satisfy for acceptable compilation. Used together, these features will give numerical analysts access to properties of an implementation's floating-point arithmetic in exactly the ways required to ease the burden of tailoring a program's precision specifications to new environments. In many cases it will be possible to write PL/I programs that are completely self-adapting to their host environment.Effective definition of the environmental enquiry functions will require the incorporation of an explicitly parameterized model of floating-point arithmetic; the environmental enquiry functions and the results of arithmetic operations will then be consistently defined in terms of the same parameters. If an appropriate model (to be described in a future paper) is adopted by the Committee and properly integrated into the Standard, a significant advantage will be offered to numerical analysts: they will be able to state and prove theorems about their programs' error bounds by appealing directly to the Standard.In addition to describing the proposed extensions, this paper presents a careful justification and a detailed example of their intended use.None of these features has yet been adopted by X3J1. The Committee is interested in the reactions of the mathematical software community to these ideas and requests that comments be sent to the author. 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
Key Agreement Protocol Based on Weil Pairing
Authors: Sheng-Hua Shiau, Ren-Junn Hwang, Ming-Fuu Lin
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

We propose a group key agreement protocol in this paper. The key agreement protocol is a good solution to establish a common session key for communication. But in a group of memberýs communication, we not only need to establish a common session key, but also need to concern the member changing environment. The proposed protocol is based on weil pairing, ID-based authentication and a complete binary tree architecture. The users in the group will establish a common session key. If there are users want to join or leave the group, our protocol can reconstruct a new common session key for security considerations. Furthermore, our proposed protocol is efficiency when the group member is small and dynamic changing.
Fast Spatial Pattern Discovery Integrating Boosting with Constellations of Contextual Descriptors
Authors: Jaume Amores, Nicu Sebe, Petia Radeva
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present a novel approach for fast object class recognition incorporating contextual information into boosting. The object is represented as a constellation of generalized correlograms that integrate both information of local parts and their spatial relations. Incorporating the spatial relations into our constellation of descriptors, we show that an exhaustive search for the best matching can be avoided. Combining the contextual descriptors with boosting, the system simultaneously learns the information that characterize each part of the object along with their characteristic mutual spatial relations. The proposed framework includes a matching step between homologous parts in the training set, and learning the spatial pattern after matching. In the matching part two approaches are provided: a supervised algorithm and an unsupervised one. Our results are favorably compared against state-of-the-art results.
Numerical Analysis of Stochastic Schemes in Geophysics
Authors: Brian D. Ewald, Roger Témam
Venue: SIAM Journal on Numerical Analysis (2004)

We present and study the stability, convergence, and order of convergence of a numerical scheme used in geophysics, namely, the stochastic version of a deterministic "implicit leapfrog" scheme which has been developed for the approximation of the so-called barotropic vorticity model. Two other schemes which might be useful in the context of geophysical applications are also introduced and discussed.
From linear to interactive animation: how autonomous characters change the process and product of animating
Authors: Bill Tomlinson
Venue: Computers in Entertainment (CIE) (2005)

There are significant differences between the art of animating for linear media such as film and video and the art of animating for interactive media such as computer and video games. In particular, these differences arise from the shift from linear characters to autonomous interactive characters. This article describes differences between linear animation and interactive animation in several areas of character design -- character intelligence, emotional expressiveness, navigation, transitions among animations, and multi-character interaction. These differences provide insight into the processes of both forms of animation and the final products that they create, and may provide a starting point for linear animators interested in becoming familiar with interactive animation.
Semantic bootstrapping of type-logical grammar
Authors: Sean A. Fulop
Venue: Journal of Logic, Language and Information (2004)

A two-stage procedure is described which induces type-logical grammar lexicons from sentences annotated with skeletal terms of the simply typed lambda calculus. First, a generalized formulae-as-types correspondence is exploited to obtain all the type-logical proofs of the sample sentences from their lambda terms. The resulting lexicons are then optimally unified. The first stage constitutes the semantic bootstrapping (Pinker, Language Learnability and Language Development, Harvard University Press, 1984), while the unification procedure of Buszkowski and Penn represents a first attempt at structure-dependent distributional learning of the syntactic and semantic categories. This effort extends earlier induction procedures (Buszkowski and Penn, 1990, Studia Logica 49, 431--454; Kanazawa, 1998, CSLI Publications and the European Association for Logic, Language and Information) for classical categorial grammar to at first the non-associative Lambek calculus, and then to a large class of type logics enriched by modal operators and structural rules.
Reviewing 4-to-2 Adders for Multi-Operand Addition
Authors: Peter Kornerup
Venue: Journal of VLSI Signal Processing Systems (2005)

Recently there has been quite a number of papers discussing the use of redundant 4-to-2 adders for the accumulation of partial products in multipliers, claiming one type to be superior to other types. This paper analyses a recent proposal of various 3- and 4-element redundant digit sets for radix 2, signed and unsigned, and compare their implementations using various encodings of the digits and carries. It is shown that theoretically they are equivalent, and differences in their implementations need only be very marginal. Another recent proposal for the use of the digit-set {0,1,2,3}, with a special 3-bit encoding of digits, is analyzed and some optimizations are shown, including the possibility of using a 2-bit encoding, with a quite significant saving in the wiring of a multiplier tree. All these proposed designs are shown to be equivalent to a standard 4-to-2, carry-save adder, except possibly for a few signal inversions.
Musex: A system for supporting children's collaborative learning in a museum with PDAs
Authors: Koji Yatani, Mayumi Onuma, Masanori Sugimoto, Fusako Kusunoki
Venue: Systems and Computers in Japan (2004)

In recent years, handheld devices have been playing an important role in children's learning. How to utilize mobile devices such as handheld devices to support collaborative learning has been an important research topic of Computer-Supported Collaborative Learning (CSCL). Educators in Japan are seeking an educational system structure that supports &ldquo;integrated courses,&rdquo; which have been introduced due to the revision of National Curriculum Standards. We focused on a museum as one of the appropriate locations where &ldquo;integrated courses&rdquo; are held and constructed a system named Musex for supporting children's learning with two personal digital assistants (PDAs). Musex provides children with opportunities to answer questions related to exhibitions collaboratively. We performed an experiment on Musex in a science museum and discuss the results in this paper. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(14): 54&ndash;63, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10696
The halting problem on finite and infinite computers
Authors: Antti Ylikoski
Venue: ACM SIGACT News (2005)

This paper discusses some points originally raised by Robert L. Massey of Colorado, USA, and some consequences of that discussion. Firstly, earthly (ie. realistic) computers are finite because the number of atoms on Earth is finite. Secondly, and the main result of the paper is that, the famous Halting Problem is unsolvable only for infinite machines. In the end of the paper there are some thoughts about the consequences of these results, such as a suggestion to improve the classical Linear Bounded Automaton model.
Safe query objects: statically typed objects as remotely executable queries
Authors: William R. Cook, Siddhartha Rai
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Developers of data-intensive applications are increasingly using persistence frameworks such as EJB, Hibernate and JDO to access relational data. These frameworks support both transparent persistence for individual objects and explicit queries to efficiently search large collections of objects. While transparent persistence is statically typed, explicit queries do not support static checking of types or syntax because queries are manipulated as strings and interpreted at runtime. This paper presents Safe Query Objects, a technique for representing queries as statically typed objects while still supporting remote execution by a database server. Safe query objects use object-relational mapping and reflective metaprogramming to translate query classes into traditional database queries. The model supports complex queries with joins, parameters, existentials, and dynamic criteria. A prototype implementation for JDO provides a type-safe interface to the full query functionality in the JDO 1.0 standard.
Errata
Authors: Imre Farkas
Venue: ACM SIGNUM Newsletter (1975)

The fifth paragraph of the paper, "A Conjecture in Numerical Linear Algebra", SIGNUM Newsletter, Vol. 9, No. 4, p 10-11, was erroneous.
Secrecy and group creation
Authors: Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon
Venue: Information and Computation (2005)

We add an operation of group creation to the typed π-calculus, where a group is a type for channels. Creation of fresh groups has the effect of statically preventing certain communications, and can block the accidental or malicious leakage of secrets. Intuitively, no channel belonging to a fresh group can be received by processes outside the initial scope of the group, even if those processes are untyped. We formalize this intuition by adapting a notion of secrecy introduced by Abadi, and proving a preservation of secrecy property.
Quantum transport, quantum effects and circuit functionality of nanostructured electronic circuits: Research Articles
Authors: W. Mathis, F. Felgenhauer, S. Fabel
Venue: International Journal of Circuit Theory and Applications (2004)

This paper presents a discussion of the impact of quantum effects to classical circuits. We will provide you with a brief introduction to our developed numerical tools to simulate electron tunnelling and energy discretization in MOS structures. Regarding these results a few arguments for simulating circuits including these effects will be given. Copyright &copy; 2004 John Wiley & Sons, Ltd.