ppxscal/embedding_network huggingface dataset:
Text entry for mobile devices and users with severe motor impairments: handiglyph, a primitive shapes based onscreen keyboard
Authors: Mohammed Belatar, Franck Poirier
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

In recent works, we have developed a text input method based on analogy with capital Latin characters and on the decomposition of characters into basic shapes. It has been designed to be universal and to allow for typing text with only one keystroke per character. In this paper we present a new implementation of this method for users with motor impairments. It uses the same principles in addition to some common techniques used in the Augmentative and Alternative Communication (AAC) domain. The new solution has been tested with a person with Locked-In Syndrome and the results are promising.
Molecular graphs of Li$_n$ clusters (n=2-6) from the density and the molecular electrostatic potential
Authors: Patrizia Calaminici, Victor Daniel Dominguez-Soria, Gerald Geudtner, Andreas M. Köster
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

The molecular graphs of the density and the molecular electrostatic potential of small lithium clusters up to the hexamer are presented. For the underlying topological analysis all-electron calculations were performed within the framework of Kohn-Sham density functional theory. The calculations employed the local level of theory. Ground state structures for small lithium clusters up to the hexamer are presented. A vibrational analysis was performed in order to characterize these clusters. Structural parameters, harmonic frequencies and molecular graphs of the density as well as the molecular electrostatic potential are reported. The differences in the topology of the electronic density, the molecular electrostatic potential and the corresponding molecular graphs of the studied lithium clusters are discussed.
A Middleware Improved Technology (MIT) to Mitigate Interdependencies between Critical Infrastructures
Authors: Claudio Balducelli, Antonio Pietro, Luisa Lavalle, Giordano Vicoli
Venue: Architecting Dependable Systems V (2008)

Public life, economy and society as a whole depend to a very large extend on the proper functioning of critical infrastructures (CIs) like energy supply or telecommunication. The extensive use of information and communication technologies (ICT) has pervaded the critical infrastructures, rendering them more intelligent but even increasingly interconnected, complex, interdependent, and therefore more vulnerable. In this paper a new technology (MIT - Middleware Improvement Technology) is proposed: it is based on a collection of software components aiming at enhancing the dependability, the survivability and the resilience of LCCIs (Large Complex Critical Infrastructures) by mitigating dependency and interdependency effects. It should prevent and limit cascading effects and/or support automated (if possible) recovery and service continuity in critical situations. The research activities and results described in the paper have been developed inside EU/FP6 Integrated Project IRRIIS - Integrated Risk Reduction of Information-based Infrastructure Systems.
Cryptanalysis of MOR and Discrete Logarithms in Inner Automorphism Groups
Authors: Anja Korsten
Venue: Research in Cryptology: Second Western European Workshop, WEWoRC 2007, Bochum, Germany, July 4-6, 2007, Revised Selected Papers (2008)

The MOR cryptosystem was introduced in 2001 as a new public key cryptosystem based on non-abelian groups. This paper demonstrates that the complexity of breaking MOR based on groups of the form $GL(n,q)\times_\theta \mathcal{H}$ ($\mathcal{H}$ a finite abelian group) is (with respect to polynomial reduction) not higher than the complexity of the discrete logarithm problem in small extension fields of . Additionally we consider the construction of a generic attack on MOR.
Intersystem Data Transfer Via IGES
Authors: M. H. Liewald
Venue: IEEE Computer Graphics and Applications (1982)

The IGES standard addresses CAD/CAM data-exchange problems the industry faces today. End users as well as developers will be responsible for its success or failure.
Combining Normal Communication with Ontology Alignment
Authors: Jurriaan Diggelen, Robbert Jan Beun, Frank Dignum, Rogier M. Eijk, John-Jules Meyer
Venue: Agent Communication II: International Workshops on Agent Communication, AC 2005 and AC 2006, Utrecht, Netherlands, July 25, 2005, and Hakodate, Japan, May 9, 2006, Selected and Revised Papers (2006)

This paper considers the combination of agent communication and ontology alignment within a group of heterogeneous agents. The agents align their ontologies by constructing a shared communication vocabulary. Because ontology alignment is not a goal in itself, the agents refrain from it unless they believe it to be inevitable. We discuss three protocols that all implement lazy ontology alignment, although they give rise to different communication vocabularies.
The Environmental Quality Evaluation of Qinhuangdao Port Regional Based on Fuzzy BP Neural Network and PSO
Authors: Dongxiao Niu, Weijun Wang, Qingchao Liu
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

A fuzzy BP neural network model based on particle swarm optimization (PSO) is proposed in this paper. The basic idea of this model is, firstly, the relative membership degrees of fuzzy mathematics are used for deal with the input sample, and then use the algorithm optimizing. Secondly, PSO is used to optimize the BP neural network's initialized weights, an optimized result is got. Then based on the optimized result, the BP neural network is used for further optimization and we give a practice. We can use this model for the environmental quality evaluation of Qinhuangdao Port regional. Finally we can get exactly appraise, this can be direct the environmental protection.
Conditions for Set Agreement with an Application to Synchronous Systems
Authors: François Bonnet, Michel Raynal
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

The k-set agreement problem is a generalization of the consensus problem: considering a system made up of n processes where each process proposes a value, each non-faulty process has to decide a value such that a decided value is a proposed value, and no more than k different values are decided. While this problem cannot be solved in an asynchronous system prone to t process crashes when t \geq k, it can always be solved in a synchronous system; \lfloor \frac{t}{k} \rfloor +1 is then a lower bound on the number of rounds (consecutive communication steps) for the non-faulty processes to decide. The {\it condition-based} approach has been introduced in the consensus context. Its aim was to both circumvent the consensus impossibility in asynchronous systems, and allow for more efficient consensus algorithms in synchronous systems. This paper addresses the condition-based approach in the context of the k-set agreement problem. It has two main contributions. The first is the definition of a framework that allows defining conditions suited to the \ell$-set agreement problem. More precisely, a condition is defined as a set of input vectors such that each of its input vectors can be seen as "encoding" \ell values, namely, the values that can be decided from that vector. A condition is characterized by the parameters t, \ell, and a parameter denoted d such that the greater d+\ell, the least constraining the condition (i.e., it includes more and more input vectors when d+\ell increases, and there is a condition that includes all the input vectors when d+\ell>t$). The conditions characterized by the triple of parameters t, d and \ell define the class of conditions denoted ${\cal S}_t^{d,\ell}$, $0\leq d\leq t$, $1\leq \ell \leq n-1 $. The properties of the sets ${\cal S}_t^{d,\ell}$ are investigated, and it is shown that they have a lattice structure. The second contribution is a generic synchronous k-set agreement algorithm based on a condition $C\in {\cal S}_t^{d,\ell}$, i.e., a condition suited to the $\ell$-set agreement problem, for $\ell \leq k$. This algorithm requires at most $\left\lfloor \frac{d-1+\ell}{k} \right\rfloor +1$ rounds when the input vector belongs to $C$, and $\left\lfloor \frac{t}{k} \right\rfloor +1 rounds otherwise. (Interestingly, this algorithm includes as particular cases the classical synchronous k-set agreement algorithm that requires $\left\lfloor \frac{t}{k} \right\rfloor+1 rounds (case $d=t$ and $\ell=1$), and the synchronous consensus condition-based algorithm that terminates in d+1 rounds when the input vector belongs to the condition, and in t+1 rounds otherwise (case $k=\ell=1$).)
A Delay Sensitive Feedback Control Data Aggregation Approach in Wireless Sensor Network
Authors: Peng Shao-Liang, Li Shan-Shan, Peng Yu-Xing, Zhu Pei-Dong, Xiao Nong
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In wireless sensor networks (WSN) real-time data delivery is a challenging issue, especially when bursty events happen and many emergent packets appear. The cluster-based data aggregation has emerged as a basic and general technique in sensor networks. However, there is a trade-off issue between aggregation waiting (AW) delay and aggregation accuracy. Therefore, we propose a Delay Sensitive Feedback Control (DSFC) model to solve the trade-off issue. Our goal is to decrease the AW delay on the condition of meeting the desired aggregation accuracy for emergent packets when emergent event occurs. Simulation results verify the performance of DSFC, and demonstrate their attraction.
IBM Speedcoding System (from IBM Manual)
Venue: IEEE Annals of the History of Computing (1983)

SPEEDCODE (also called SpeedCo I and Speedcoding) was a three-address system that provided for floating point calculations. 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
Fourier series of orthogonal polynomials
Authors: Nataniel Greene
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

Explicit formulas for the Fourier coeffcients of the Legendre polynomials can be found in the Bateman Manuscript Project. However, similar formulas for more general classes of orthogonal polynomials do not appear to have been worked out. Here we derive explicit formulas for the Fourier series of Gegenbauer, Jacobi, Laguerre and Hermite polynomials.
Electronic Institutions Infrastructure for e-Chartering
Authors: Manolis Sardis, George Vouros
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

The need of methodologies and software tools that ease the development of applications where distributed (human or software) agents search, trade and negotiate resources is great. On the other hand, electronic institutions of multiple agents can play a main role in the development of systems where normative specifications play a vital role. Electronic institutions define the rules of the game in agent societies, by fixing what agents are permitted and forbidden to do and under what circumstances. In this paper we present a case study on the use of specific tools, supporting the specification, analysis and execution of institutions for Maritime e-Chartering, proposing an infrastructure for Internet-based Virtual Chartering Markets (MAVCM).
Limits and Possibilities of BDDs in State Space Search
Authors: Stefan Edelkamp, Peter Kissmann
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential lower bounds on the number of BDD nodes for characteristic benchmark problems are derived and validated. In order to optimize the variable ordering, causal graph dependencies are exploited.
An Adaptive Algorithm Finding Multiple Roots of Polynomials
Authors: Wei Zhu, Zhe-Zhao Zeng, Dong-Mei Lin
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

An adaptive algorithm is proposed to find multiple roots of polynomials which were not well solved by the other methods. Its convergence was presented and proved. The computation is carried out by simple steepest descent rule with adaptive variable learning rate. The specific examples showed that the proposed method can find the multiple roots of polynomials at a very rapid convergence and very high accuracy with less computation.
Fully Automatic Heart Beat Rate Determination in Digital Video Recordings of Rat Embryos
Authors: M. Khalid Khan, Mats F. Nilsson, Bengt R. Danielsson, Ewert Bengtsson
Venue: Proceedings of the 3rd international conference on Advances in Mass Data Analysis of Images and Signals in Medicine, Biotechnology, Chemistry and Food Industry (2008)

Embryo cultures of rodents is an established technique for monitoring adverse effects of chemicals on embryonic development. The assessment involves determination of the heart rate of the embryo which is usually done visually, a technique which is tedious and error prone. We present a new method for fully automatic heart detection in digital videos of rat embryos. First it detects the heart location, and then it counts the number of heart beats for a predetermined period of time. Using this automated method many more embryos can be evaluated at reasonable cost.
Improved JPEG Scheme Based on Adaptive Block Encoding
Authors: Yuan-Hui Yu, Chin-Chen Chang, Yu-Chen Hu
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

In this paper, a new adaptive image compression scheme based on JPEG was proposed to improve the image quality of the JPEG baseline sequential image compression codec. In this scheme, the Hough transformation technique is employed as an edge-oriented classifier to categorize image blocks into four classes. Different types of image blocks are processed by different quantization and encoding ways for achieving an effective compression performance. In order to preserve edge information, the adaptive quantization tables based on the human visual system and zig-zag scan sequences are used. For both objective and subjective visual image quality, simulation results show that the performance of the proposed scheme is comparable to that of other compared schemes.
Coupled Adaptive Fuzzy Control of Nonlinear, Time-Varying Plant
Authors: Raimundas Liutkevičius
Venue: Informatica (2003)

This paper analyses coupled control of a nonlinear, time-varying plant. Uncoupled and coupled direct adaptive controllers, based on fuzzy logics, are synthesized to control the water level and the air pressure in a closed tank. The satisfactory efficiency of the controllers is experimentally demonstrated running the plant under the different working conditions. Coupled fuzzy controllers are compared with the uncoupled fuzzy controllers.
RV-CSMA/CA: Relative Velocity-CSMA/CA Mechanism for Inter-vehicle Network
Authors: Sungdae Jung, Xu Shenglei, Sangsun Lee
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The relative velocity between vehicles plays an important role in inter-vehicle network that has to support high mobility. The communication efficiency of the network is affected considerably by a rapid change of network topology depending on the relative velocity. A novel MAC scheme, RV-CSMA/CA (Relative Velocity-Carrier Sense Multiple Access with Collision Avoidance) is proposed in this paper. The MAC scheme can improve the efficiency, as compared to that of using the standard CSMA/CA of IEEE 802.11 MAC. The principal protocol of the MAC scheme is to update the RTS (Request To Send) threshold as a function of the relative velocity and the length of the data frames. The updated threshold is used to determine the MAC multiple-access mechanism. Simulation results using a Qualnet network simulator show that the proposed protocol exhibits superior performance to the extant protocol in inter-vehicle network.
Chinese Word Segmentation for Terrorism-Related Contents
Authors: Daniel Zeng, Donghua Wei, Michael Chau, Feiyue Wang
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

In order to analyze security and terrorism related content in Chinese, it is important to perform word segmentation on Chinese documents. There are many previous studies on Chinese word segmentation. The two major approaches are statistic-based and dictionary-based approaches. The pure statistic methods have lower precision, while the pure dictionary-based method cannot deal with new words and are restricted to the coverage of the dictionary. In this paper, we propose a hybrid method that avoids the limitations of both approaches. Through the use of suffix tree and mutual information (MI) with the dictionary, our segmenter, called IASeg, achieves a high accuracy in word segmentation when domain training is available. It can identify new words through MI-based token merging and dictionary update. In addition, with the Improved Bigram method it can also process N-grams. To evaluate the performance of our segmenter, we compare it with the Hylanda segmenter and the ICTCLAS segmenter using a terrorism-related corpus. The experiment results show that IASeg performs better than the two benchmarks in both precision and recall.
Bijective Digital Error-Control Coding, Part I: The Reversible Viterbi Algorithm
Authors: Anas N. Al-Rabadi
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

New convolution-based multiple-stream digital error-control coding and decoding schemes are introduced. The new digital coding method applies the reversibility property in the convolution-based encoder for multiple-stream error-control encoding and implements the reversibility property in the new reversible Viterbi decoding algorithm for multiple-stream error-correction decoding. It is also shown in this paper that the reversibility relationship between multiple-streams of data can be used for further correction of errors that are uncorrectable using the implemented decoding algorithm such as in triple-errors that are uncorrectable using the classical (irreversible) Viterbi algorithm.
Application of Fuzzy Classification in Bankruptcy Prediction
Authors: Zijiang Yang, Guojun Gan
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Classification refers to a set of methods that predict the class of an object from attributes or features describing the object. In this paper we present a fuzzy classification algorithm to predict bankruptcy. Our classification algorithm is modified from a subspace clustering algorithm called fuzzy subspace clustering (FSC). As our algorithm associates each feature of a class with a fuzzy membership, feature selection is not necessary. Our experiments show that the classification results produced by our algorithm can translate into large financial and other benefits to organizations through such activities as credit approval, and loan portfolio and security management.
An Improved Secure Authenticated Group Key Agreement Protocol for WMNs
Authors: Zhen-Ai Jin, Geum-Dal Park, Kee-Young Yoo
Venue: Proceedings of the 2008 International Conference on Advanced Language Processing and Web Information Technology (2008)

Recently, secure group-oriented applications have grown very rapidly. In order to provide secure group communication, WMNs (Wireless Mesh Network) are required to establish a secret key which is shared with all participants. Recently, Tseng proposed an authenticated group key agreement for regarding mobile networks. This mobile network is an asymmetric wireless network which includes many low-power nodes and several powerful nodes. However, this protocol does not satisfy some important security properties such a simplicit key authentication. In this paper, we conducted ananalysis of Tseng's protocol and propose a secure and efficient group key agreement protocol regarding WMNs which improved upon it. The proposed protocol not only reduces the computational cost, but also meets strong security requirements.
Modeling and Controlling Dynamic Service Compositions
Authors: Heiko Pfeffer, David Linner, Stephan Steglich
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

Service-oriented computing paradigms have considerably enhanced support for dynamic in modern computing environments by providing loosely coupled interactions between components. The key attainment is the ability to perform a late binding of service compositions, i.e., an allocation of actual services to service placeholders during runtime. However, this attainment is limited to the binding of services and cannot operate on the service composition plans itself. Moreover, many service composition representations do not consider the realtime behavior of single services, failing to address a key need of service compositions within dynamic environments that are characterized by a high node mobility.Within this paper, we introduce a service composition model based on a bipartite graph representation that enables the rapid modification of already existing service composition plans. Here, the workflow within a service composition is modeled with a timed automaton while a labeled digraph ensures the correct flow of data between the single services.
Consistency of synchronization nets using P and V operations
Authors: J. L. Bruno, E. G. Coffman, W. H. Hosken
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

In this paper we provide a formulation of the synchronized execution of a system of tasks using generalized P and V operations. We explore the properties of such processes and present as a main result a decision procedure for settling the consistency question.
An Introduction to Application Domain Modeling
Authors: J. Morbach, M. Theißen, W. Marquardt
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

This section serves as an introduction to application domain modeling. Firstly, we will motivate the objectives of modeling. Next, we will suggest definitions for different types of application domain models. Finally, a brief survey of the modeling languages applied throughout this chapter will be given.