ppxscal/embedding_network huggingface dataset:
Interpreting Localized Computational Effects Using Operators of Higher Type
Authors: John Longley
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

We outline a general approach to providing intensional models for languages with computational effects, whereby the problem of interpreting a given effect reduces to that of finding an operator of higher type satisfying certain equations. Our treatment consolidates and generalizes an idea that is already implicit in the literature on game semantics. As an example, we work out our approach in detail for the case of fresh name generation, and discuss some particular models to which it applies.
Electron tube performance in some typical military environments
Authors: D. W. Sharp
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

The information presented in this paper is concerned with the performance of electron tubes in various types of military equipment. While these equipments do not include computers, some of them resemble computer applications to such a degree that I believe the tube data will be of interest, and perhaps helpful, to this audience. 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
MATLAB Simulation and Comparison of Zhang Neural Network and Gradient Neural Network for Online Solution of Linear Time-Varying Matrix Equation AXB - C = 0
Authors: Ke Chen, Shuai Yue, Yunong Zhang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Different from gradient neural networks (GNN), a special kind of recurrent neural networks has been proposed recently by Zhang et al for solving online linear matrix equations with time-varying coefficients. Such recurrent neural networks, designed based on a matrix-valued error-function, could achieve global exponential convergence when solving online time-varying problems in comparison with gradient neural networks. This paper investigates the MATLAB simulation of Zhang neural networks (ZNN) for real-time solution of linear time-varying matrix equation AXB - C = 0. Gradient neural networks are simulated and compared as well. Simulation results substantiate the theoretical analysis and efficacy of ZNN on linear time-varying matrix equation solving.
AIS-Based Bootstrapping of Bayesian Networks for Identifying Protein Energy Route
Authors: Sungwon Jung, Kyu-Il Cho, Doheon Lee
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

It is important to identify the mechanism of energy transfer in protein structures in understanding their functions. Highly enriched energy in some hot spots of protein structures is transferred to other residues during some functional activity such as binding. The transferred energy reaches at various residues and make them to change their three dimensional structures to make other functional effects. In this paper, we use Bayesian network learning in identifying the route of energy transfer from the estimated energy status of residues. Artificial immune systems (AIS) approach is used for bootstrapping the Bayesian network learning. The analyzed results give a quantitative map of route for energy transfer in 1be9 protein.
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
Authors: Pietro S. Oliveto, Carsten Witt
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Drift analysis is a powerful tool used to bound the optimization time of evolutionary algorithms (EAs). Various previous works apply a drift theorem going back to Hajek in order to show exponential lower bounds on the optimization time of EAs. However, this drift theorem is tedious to read and to apply since it requires two bounds on the moment-generating (exponential) function of the drift. A recent work identifies a specialization of this drift theorem that is much easier to apply. Nevertheless, it is not as simple and not as general as possible. The present paper picks up Hajek's line of thought to prove a drift theorem that is very easy to use in evolutionary computation. Only two conditions have to be verified, one of which holds for virtually all EAs with standard mutation. The other condition is a bound on what is really relevant, the drift. Applications show how previous analyses involving the complicated theorem can be redone in a much simpler and clearer way. Therefore, the simplified theorem is also a didactical contribution to the runtime analysis of EAs.
Geometric Spanner of Objects under L1 Distance
Authors: Yongding Zhu, Jinhui Xu, Yang Yang, Naoki Katoh, Shin-Ichi Tanigawa
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Geometric spanner is a fundamental structure in computational geometry and plays an important role in many geometric networks design applications. In this paper, we consider the following generalized geometric spanner problem under L 1 distance: Given a set of disjoint objects S, find a spanning network G with minimum size so that for any pair of points in different objects of S, there exists a path in G with length no more than t times their L 1 distance, where t is the stretch factor. Specifically, we focus on three types of objects: rectilinear segments, axis aligned rectangles, and rectilinear monotone polygons. By combining ideas of t-weekly dominating set, walls, aligned pairs and interval cover, we develop a 4-approximation algorithm (measured by the number of Steiner points) for each type of objects. Our algorithms run in near quadratic time, and can be easily implemented for practical applications.
DGSS: A Dependability Guided Job Scheduling System for Grid Environment
Authors: Yongcai Tao, Hai Jin, Xuanhua Shi
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Due to the diverse failures and error conditions in grid environments, node unavailability is increasingly becoming severe and poses great challenges to reliable job scheduling in grid environment. Current job management systems mainly exploit fault recovery mechanism to guarantee the completion of jobs, but sacrificing system efficiency. To address the challenges, in this paper, a node TTF (Time To Failure) prediction model and job completion prediction model are designed. Based on these models, the paper proposes a dependability guided job scheduling system, called DGSS, which provides failure avoidance job scheduling. The experimental results validate the improvement in the dependability of job execution and system resources utilization.
A Service Providing Awareness of Learning Object Evolutions in a Distributed Environment
Authors: Olivier Catteau, Philippe Vidal, Julien Broisin
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

In some previous works we suggested a mechanism that offers the opportunity to import, within courseware deployed within Learning Management System, some learning object stored into heterogeneous repositories. Works presented here allow teachers and curriculum managers to be aware of all divergences between the imported learning objects and their evolutions, releases and dependencies. It avoids collaboration between production stakeholders and teachers to spiral out of control by providing teachers with visualization techniques such as State Treemap and 3D relationships representation together with notification systems. The framework has been implemented in an open and LOM-based architecture that includes Moodle and the Ariadne Knowledge Pool System, thus validating our approach.
Body-Braille System for Disabled People
Authors: Satoshi Ohtsuka, Nobuyuki Sasaki, Sadao Hasegawa, Tetsumi Harakawa
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This paper introduces the Body-Braille system which has been developed as a new communication channel for deaf-blind people using 6 micro vibration motors to present a Braille character and describes the support system using the Japanese mobile communication system combined with Body-Braille. Body-Braille has several advantages compared to other Braille systems. The control device of Body-Braille is named "B-brll" and has several interfaces including RS-232C and DTMF. Some basic experiments to measure the speed of reading Braille were performed and the mean reading time for one Braille cell was 0.5-1.4 seconds, which is fast enough for some useful applications. Using Body-Braille, a Tele-support system was developed as an application and good results were obtained. Furthermore, a newly developed idea which presents Braille character using only 2 points instead of 6 points and new equipment corresponding to this idea which has significant possibility for a very practical products, are described.
Turkish Language Resources: Morphological Parser, Morphological Disambiguator and Web Corpus
Authors: Haşim Sak, Tunga Güngör, Murat Saraçlar
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

In this paper, we propose a set of language resources for building Turkish language processing applications. Specifically, we present a finite-state implementation of a morphological parser, an averaged perceptron-based morphological disambiguator, and compilation of a web corpus. Turkish is an agglutinative language with a highly productive inflectional and derivational morphology. We present an implementation of a morphological parser based on two-level morphology. This parser is one of the most complete parsers for Turkish and it runs independent of any other external system such as PC-KIMMO in contrast to existing parsers. Due to complex phonology and morphology of Turkish, parsing introduces some ambiguous parses. We developed a morphological disambiguator with accuracy of about 98% using averaged perceptron algorithm. We also present our efforts to build a Turkish web corpus of about 423 million words.
Optimal-in-expectation redistribution mechanisms
Authors: Mingyu Guo, Vincent Conitzer
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Many important problems in multiagent systems involve the allocation of multiple resources to multiple agents. If agents are self-interested, they will lie about their valuations for the resources if they perceive this to be in their interest. The well-known VCG mechanism allocates the items efficiently, is incentive compatible (agents have no incentive to lie), and never runs a deficit. Nevertheless, the agents may have to make large payments to a party outside the system of agents, leading to decreased utility for the agents. Recent work has investigated the possibility of redistributing some of the payments back to the agents, without violating the other desirable properties of the VCG mechanism. We study multi-unit auctions with unit demand, for which previously a mechanism has been found that maximizes the worst-case redistribution percentage. In contrast, we assume that a prior distribution over the agents' valuations is available, and try to maximize the expected total redistribution. We analytically solve for a mechanism that is optimal among linear redistribution mechanisms. The optimal linear mechanism is asymptotically optimal. We also propose discretization redistribution mechanisms. We show how to automatically solve for the optimal discretization redistribution mechanism for a given discretization step size, and show that the resulting mechanisms converge to optimality as the step size goes to zero. We also present experimental results showing that for auctions with many bidders, the optimal linear redistribution mechanism redistributes almost everything, whereas for auctions with few bidders, we can solve for the optimal discretization redistribution mechanism with a very small step size.
Smallest Formulas for Parity of 2k Variables Are Essentially Unique
Authors: Jun Tarui
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

For n = 2 k , we know that the size of a smallest AND/OR/ NOT formula computing the Boolean function is exactly n 2: For any n, it is at least n 2 by classical Khrapchenko's bound, and for n = 2 k we easily obtain a formula of size n 2 by writing and recursively expanding We show that for n = 2 k the formula obtained above is an essentially unique one that computes with size n 2. In the equivalent framework of the Karchmer-Wigderson communication game, our result means that an optimal protocol for Parity of 2 k variables is essentially unique.
Design of a Fuzzy PI Controller to Guarantee Proportional Delay Differentiation on Web Servers
Authors: Ka Ho Chan, Xiaowen Chu
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

Proportional Integral (PI) controller has attracted researchers in industrial control processes because of its simplicity and robust performance in a wide range of operating conditions. It has been used to provide proportional delay differentiation on web servers in previous work. However, PI controller cannot achieve satisfactory results due to (1) the web server's non-linearity properties, and (2) the difficulty of building an accurate model for the web server. To address these issues, a nonlinear fuzzy PI controller is proposed in this paper, which has the advantage of fuzzy controller while maintaining the simplicity and robustness of PI controller. The proposed controller are self-tuned according to the periodical online performance measurement. The experimental results demonstrate that our fuzzy PI controller outperforms the PI controller in several aspects.
Neural Control Applied to Time Varying Uncertain Nonlinear Systems
Authors: Dingguo Chen, Jiaben Yang, Ronald R. Mohler
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper presents a neural network based control design to handle the stabilization of a class of multiple input nonlinear systems with time varying uncertain parameters while assuming that the range of each individual uncertain parameter is known. The proposed design approach allows incorporation of complex control performance measures and physical control constraints whereas the traditional adaptive control techniques are generally not applicable. The desired system dynamics are analyzed, and a collection of system dynamics data, that represents the desired system behavior and approximately covers the region of stability interest, is generated and used in the construction of the neural controller based on the proposed neural control design. Furthermore, the theoretical aspects of the proposed neural controller are also studied, which provides insightful justification of the proposed neural control design. The simulation study is conducted on a single-machine infinity-bus (SMIB) system with time varying uncertainties on its parameters. The simulation results indicate that the proposed design approach is effective.
Improving Web Form Accessibility Using Semantic XForms for People with Cognitive Impairments
Authors: Amin Anjomshoaa, Muhammad Shuaib Karim, A Min Tjoa
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The Internet as the widest medium for business and communication can be effectively adapted to the requirements of differently-abled people. Large portion of Internet advances owes the human-computer interaction and data exchange via web forms. The current complex Internet applications are not easy to use for people with cognitive impairments and they usually use the Internet as a publication platform. To change this state, the web forms, as the basic block of Internet applications, should be made accessible for people with varying levels of cognitive abilities, especially for severely challenged users in this category. New technologies such as the Semantic Web and XForms can be combined to make the Web applications more accessible for these people. In this short paper, the possible application of XForms in combination with the Semantic Web technology is explored and a solution model for providing accessibility for people with cognitive impairments is presented.
KPCA Plus FDA for Fault Detection
Authors: Peiling Cui, Jiancheng Fang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

Kernel principal component analysis (KPCA) is widely used for fault detection. In this paper, a KPCA plus Fisher discriminant analysis (FDA) scheme is adopted to improve the fault detection performance of KPCA. Simulation results are given to show the effectiveness of the improvements for fault detection performance in terms of high fault detection rate.
Ultrafast Digital-Optical Arithmetic Using Wave-Optical Computing
Authors: Tobias Haist, Wolfgang Osten
Venue: Proceedings of the 1st international workshop on Optical SuperComputing (2008)

We propose a method for implementing digital-optical arithmetic with high accuracy at extremely high speed. To this end we use the superposition of photons running through a passive network of simple optical components. All possible solution are realized in parallel by superposition. Therefore, the overall computing time can be reduced to the sum of the time of flight through a very short optical path and the time needed for input and output.
Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division
Authors: Daniel Díaz-Pernil, Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustín Riscos-Núñez
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

Tissue P systems with cell division is a computing model in the framework of Membrane Computing based on intercellular communication and cooperation between neurons. The ability of cell division allows us to obtain an exponential amount of cells in linear time and to design cellular solutions to NP-complete problems in polynomial time. In this paper we present a solution to the Subset Sum problem via a family of such devices. This is the first solution to a numerical NP-complete problem by using tissue P systems with cell division.
On the Use of Shift Dynamics in Synthesizing Fractal Images
Authors: Jonas Valantinas, Tomas Žumbakis
Venue: Informatica (2004)

The contribution of this paper is a new version of the escape time algorithm adapted to synthesize fractal images, identified with attractors of iterated function systems (IFS). The proposed synthesis algorithm is based on the use of shift dynamics, associated with one or another IFS. The novelty of the algorithm is grounded on two factors. Firstly, the strategy for the separation of extended domains of the inverse affine transformations, specified by IFS, is developed. Secondly, the variable escape time for different points of a synthesized fractal image (IFS attractor) is proposed and explored. Experimental results show that the above two factors ensure uniform rendering of image points (pixels) in colour.
Proceeding of the eighth ACM symposium on Document engineering
Venue: Document Engineering (2008)

We welcome you to the Eighth ACM Symposium on Document Engineering -- DocEng 2008, which is being held September 16-19, 2008, in São Paulo, Brazil. Once again, the Document Engineering community has shown itself to be broad and diverse, spanning interests from high-level to low-level document modeling, generation, transformation and production. For DocEng 2008, we received 62 full paper submissions of which 21 were accepted (34%) and 44 short paper submissions of which 19 were accepted (43%). This has made 2008 one of the most competitive edition of the Symposium to date. All of these contributions were thoroughly refereed, with an average of more than three reviews for the full and short paper submissions. Moreover, 14 papers detailing demonstrations have been submitted: 6 were accepted after receiving three reviews each. A new aspect in this year's Symposium is the introduction of a Best Paper competition, the outcome of which is determined both by a panel of past DocEng program chairs and the audience at the Symposium. This is the first time that the ACM DocEng symposium has been held in South America, and we are thus especially pleased to have attracted two keynote speakers who deal with complementary facets of document engineering. Michal Shilman, from industry, will discuss his research leading to basic principles for aggregating a diverse set of documents into a coherent and useful summary. Alberto Laender, from academia, will discuss his solutions to problems usually faced when managing multiple digital libraries of scientific publications.
On the Computational Capacity of Parallel Communicating Finite Automata
Authors: Henning Bordihn, Martin Kutrib, Andreas Malcher
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

Systems of parallel finite automata communicating by states are investigated. We consider deterministic and nondeterministic devices and distinguish four working modes. It is known that systems in the most general mode are as powerful as one-way multihead finite automata. Here we solve some open problems on the computational capacity of systems working in the remaining modes. In particular, it is shown that deterministic returning and non-returning devices are equivalent, and that there are languages which are accepted by deterministic returning and centralized systems but cannot be accepted by deterministic non-returning centralized systems. Furthermore, we show that nondeterministic centralized systems are strictly more powerful than their deterministic variants. Finally, incomparability with the class of (deterministic) (linear) context-free languages as well as the Church-Rosser languages is derived.
Applying SIFT Descriptors to Stellar Image Matching
Authors: Javier Ruiz-Del-Solar, Patricio Loncomilla, Pablo Zorzi
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Stellar image matching allows to verify if a given pair of images belongs to the same stellar object/area, or knowing that they correspond to the same sky area, to verify if there are some changes between them due to an stellar event (supernova event, changes in the object position, etc). Some applications are stellar photometry, telescope tracking and pointing, robot telescopes, and sky monitoring. However, the matching of stellar images is a hard problem because normally the images are taken using different telescopes, image sensors and settings, as well as from different places, which produces variability in the image's resolution, orientation, and field of view. In this context, the aim of this paper is to propose a robust SIFT-based wide baseline matching technique for stellar images. The proposed technique was evaluated in a new database composed by 100 pairs of galaxies, nebulas and star clusters images, achieving a true positive rate of 87% with a false positive rate of 1.7%.