ppxscal/embedding_network huggingface dataset:
An On-Line LearningAlgorithm of Parallel Mode for MLPN Models
Authors: D. L. Yu, T. K. Chang, D. W. Yu
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

An on-line learning algorithm in parallel mode for multi-layer perceptron network (MLPN) model is proposed. The MLPN is on-line trained directly in a parallel mode. The on-line learning algorithm is based on the Extended Kalman Filter (EKF) algorithm. This network is able to learn the non-linear dynamic behaviour of unknown time-varying systems and perform multi-step-ahead prediction for control purpose. The performance of this model is evaluated in modelling a multi-variable non-linear continuous stirred tank reactor (CSTR).
Multi-agent ERA Model Based on Belief Interaction Solves Wireless Sensor Networks Routing Problem
Authors: Yanbin Liu, Chunguang Zhou, Kangping Wang, Dan Li, Dongwei Guo
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

ERA is the acronym of environment, reactive rules and agent. The model is a new effective multi-agent cooperation framework, which has been successfully applied in a wide range of fields. This paper presents the concept of belief into multi agent system. Each agent stands for a feasible routing, it moves according to its own belief matrix in the sensor networks environment. Agent has the ability to evaluate and adjust its belief matrix according to the historical routing. Agents will interact their believes to each other when they meet at the same sensor node. This paper employs a large number of data and other classical models to evaluate the algorithm, the experimental results show that this model prolongs the lifetime of wireless sensor network by reducing energy dissipation, which validates the algorithm's feasibility and availability.
Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy
Authors: Danny Z. Chen, Shuang Luan, Chao Wang
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

The couple path planning (CPP) problem seeks the motion paths of the leaves of a multileaf collimator, to optimally reproduce the prescribed dose in intensity-modulated radiation therapy (IMRT). We study two versions of the CPP problem, constrained and unconstrained CPP, based on whether the starting and ending locations of the sought paths are prespecified. The unconstrained CPP problem models the leaf sequencing problem in dynamic IMRT delivery, while the set of all constrained CPP problem instances, in which all combinations of the starting and ending locations are considered, plays a key role in an emerging IMRT technique called arc-modulated radiation therapy. We give efficient algorithms for both the constrained and unconstrained CPP problems, and for computing the set of all constrained CPP problem instances. Our results are based on several new ideas and geometric observations, and substantially improve the solutions based on standard techniques. Implementation results show that our CPP algorithms run fast and produce better IMRT treatment plans than current methods.
Kalman Filtering for Frame-by-Frame CT to Ultrasound Rigid Registration
Authors: Haydar Talib, Matthias Peterhans, Jaime García, Martin Styner, Miguel A. González Ballester
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

This paper presents a method for CT-US rigid registration in minimally-invasive computer-assisted orthopaedic surgery, whereby the registration procedure is reformulated to enable effectively real-time registrations. A linear Kalman filter based algorithm is compared to an Unscented Kalman filter based method in simulated and experimental scenarios. The validation schemes demonstrate that the linear Kalman filter is more accurate, more robust, and converges quicker than the UKF, yielding an effectively real-time method for rigid registration applications, circumventing surgeons' waiting times.
On the Research of BDD Based Simulation of Grover's Algorithm
Authors: Xiling Xue, Hanwu Chen, Kaizhong Chen, Zhiqiang Li
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

In this paper, we adopt an efficient data structure called the Binary Decision Diagram (BDD) that exploits the structure displayed in quantum computing to simulate Grover's quantum search algorithm. First we adapt the original BDD and implement a series of algorithms to represent and manipulate matrices and vectors. Then instances of Grover's algorithm are simulated using our programme written in C++. In the last part we present an intensive analysis of the counter-intuitive experimental results in quantum mechanism, which may help understand the essence of quantum algorithms.
European e-commerce policies in the pioneering days, the gold rush and the post-hype era
Authors: Kim Viborg Andersen, Roman Beck, Rolf T. Wigand, Niels Bjørn-Andersen, Eric Brousseau
Venue: Information Polity (2004)

The emergence of e-commerce in Europe is a fascinating policy study with key actors in all EU countries firmly assured that digitalization of the economy is the key to the magic kingdom of strong economic growth and the facilitation of global commerce. Moreover, the digital economy would require asserted policy responses to ensure that European jobs would not be taken over by the dominant US IT industry and the global, multinational industry players utilizing the technology. In this contribution we reveal how Denmark, Germany and France had rather similar policies furthering knowledge diffusion but were rather reluctant to use direct economic incentives, normative instruments, or e-government initiatives such as e-tendering and e-procurement. Yet the three countries pursued very different paths on the route towards the digital economy both when it comes to the responsiveness of government and to the implementation in society.
Computer Game for Small Pets and Humans
Authors: Roger Thomas Tan, Adrian David Cheok, Roshan Lalintha Peiris, I. J. Wijesena, Derek Bing Tan, Karthik Raveendran, Khanh Dung Nguyen, Yin Ping Sen, Elvin Zhiwen Yio
Venue: Proceedings of the 6th international conference on Entertainment Computing (2007)

Interactive media not only should enhance human-to-human communication, but also human-to-animal communication. We promote a new type of media interaction allowing human users to interact and play with their small pets (like hamsters) remotely via Internet through a mixed-reality-based game system "Metazoa Ludens". To examine the system's effectiveness: Firstly, the positive effects to the hamsters are established using Body Condition Score study. Secondly, the method of Duncan is used to assess the strength of preference of the hamsters towards Metazoa Ludens. Lastly, the effectiveness of this remote interaction, with respect to the human users as an interactive gaming system with their pet hamsters, is examined based on Csikszentmihalyi's Flow theory [1]. Results of these studies have shown positive remote interaction between human user and their pet friends. This paper provides specific experimental results on the implemented research system, and a framework for human-to-animal interactive media.
Information technology education for k-12 students and teachers: from sensor network to comprehensive and customized web interaction
Authors: Lei He, Ashraf Saad, Joy Reed, Patrick Hannigan, Ed Strauser
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

This paper presents an e-learning system to provide comprehensive and customized information technology (IT) education for K-12 students and teachers across science and mathematics disciplines. Supported by a current three-year NSF ITEST grant, we have designed and developed the system with the goal to provide students with education pathways leading to IT careers. The proposed system includes two IT tracks: sensor network track and field guide track. Different from current IT education systems and activities, our project is specifically tailored for K-12 students and teachers through a series of systematic IT-related activities conducted on a unique local barrier island. Preliminary project activities and user feedback indicate that our project is rather effective to give students the knowledge, encouragement, and self confidence to gain further IT competencies later on in high school and beyond.
Challenge for Info-plosion
Authors: Masaru Kitsuregawa
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

Information created by people has increased rapidly since the year 2000, and now we are in a time which we could call the "information-explosion era." The project "Cyber Infrastructure for the Information-explosion Era" is a six-year project from 2005 to 2010 supported by Grant-in-Aid for Scientific Research on Priority Areas from the Ministry of Education, Culture, Sports, Science and Technology (MEXT) of Japan. The project aims to establish the following fundamental technologies in this information-explosion era: novel technologies for efficient and trustable information retrieval from explosively growing and heterogeneous information resources; stable, secure, and scalable information systems for managing rapid information growth; and information utilization by harmonized human-system interaction. It also aims to design a social system that cooperates with these technologies. Moreover, it maintains the synergy of cutting-edge technologies in informatics.
How Polish Mathematicians Broke the Enigma Cipher
Authors: Marian Rejewski
Venue: IEEE Annals of the History of Computing (1981)

The paper gives a personal view of work in the Polish Cipher Bureau from 1932 to 1939 as mathematicians worked to decipher the codes of the military version of the Enigma. The author, who was a participant, relates details of the device and the successes and frustrations involved in the work. He also describes mathematical principles that enabled him and his colleagues to break successive versions of the Enigma code and to construct technical devices (cyclometers and "bombs") that facilitated decipherment of Enigma-coded messages. 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
Nearest neighbor queries with peer-to-peer data sharing in mobile environments
Authors: Wei-Shinn Ku, Roger Zimmermann
Venue: Pervasive and Mobile Computing (2008)

Nearest neighbor queries, such as determining the proximity of stationary objects (e.g., restaurants and gas stations) are an important class of inquiries for supporting location-based services. We present a novel approach to support nearest neighbor queries from mobile hosts by leveraging the sharing capabilities of wireless ad-hoc networks. We illustrate how previous query results cached in the local storage of neighboring mobile users can be leveraged to either fully or partially compute and verify nearest neighbor queries at a local host. The feasibility and appeal of our technique is illustrated through extensive simulation results that indicate a considerable reduction of the query load on the remote database. Furthermore, the scalability of our approach is excellent because a higher density of mobile hosts increases its effectiveness.
An Implementation of Target Motion Estimation Based on Target Edge Segment Features for Vehicle Monitoring Applications
Authors: Tan Liu, Mei Xie
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

In this paper we present an implementation of a novel motion estimation algorithm for vehicle targets. The algorithm is based on the analysis of inter-frame correlations of the target edge segments, and is capable of estimating both translational and rotational motions. Through the analysis of the edge segment feature correlations, the distributions of the inter-frame motion probability are calculated and accumulated into the global motion spaces, from which the inter-frame target motion can be estimated. This paper introduces the theory, the implementation, the full experimental results and the advantages of this algorithm. Experiments show that it may be a potential approach to the motion estimation of vehicle for applications in some situations.
A Vector Similarity Measure for Type-1 Fuzzy Sets
Authors: Dongrui Wu, Jerry M. Mendel
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

Comparing the similarity between two fuzzy sets (FSs) is needed in many applications. The focus herein is linguistic approximation using type-1 (T1) FSs, i.e. associating a T1 FS A with a linguistic label from a vocabulary. Because each label is represented by an T1 FS B i , there is a need to compare the similarity of A and B i to find the B i most similar to A. In this paper, a vector similarity measure (VSM) is proposed for T1 FSs, whose two elements measure the similarity in shape and proximity, respectively. A comparative study shows that the VSM gives best results. Additionally, the VSM can be easily extended to interval type-2 FSs.
From Cultural to Individual Adaptive End-User Interfaces: Helping People with Special Needs
Authors: Rüdiger Heimgärtner, Andreas Holzinger, Ray Adams
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Culture heavily influences human---computer interaction (HCI) since the end-user is always within a cultural context. Cultural and informational factors correlate to jointly influence the look and feel of interactive systems, e.g. widget position or information density. Every single individual also develops a specific culture (eating style, walking style etc.), i.e. characteristics and behavior as well as attitudes and values. Consequently, individual adaptability can be essential to cover individual needs of the culturally but uniquely imprinted end-users with special needs e.g. reducing the workload by recognizing and knowing the individual expectances of the end-user. This improves usability and leads to shorter training and improves universal access.
On Isomorphisms of Intersection Types
Authors: Mariangiola Dezani-Ciancaglini, Roberto Cosmo, Elio Giovannetti, Makoto Tatsuta
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

The study of type isomorphisms for different ¿-calculi started over twenty years ago, and a very wide body of knowledge has been established, both in terms of results and in terms of techniques. A notable missing piece of the puzzle was the characterization of type isomorphisms in the presence of intersection types. While at first thought this may seem to be a simple exercise, it turns out that not only finding the right characterization is not simple, but that the very notion of isomorphism in intersection types is an unexpectedly original element in the previously known landscape, breaking most of the known properties of isomorphisms of the typed ¿-calculus. In particular, types that are equal in the standard models of intersection types may be non-isomorphic.
Building Extraction Using Fast Graph Search
Authors: Dong-Min Woo, Dong-Chul Park, Seung-Soo Han, Quoc-Dat Nguyen
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

This paper presents a new building rooftop extraction method from aerial images. In our approach, we extract the useful building location information from the generated disparity map to segment the interested objects and consequently reduce unnecessary line segments extracted in low level feature extraction step. Hypothesis selection is carried out by using undirected graph, in which close cycles represent complete rooftops hypotheses. We test the proposed method with the synthetic images generated from Avenches dataset of Ascona aerial images. The experiment result shows that the extracted 3D line segments of the reconstructed buildings have an average error of 1.69m and our method can be efficiently used for the task of building detection and reconstruction from aerial images.
Imagistic Digital Library for Hybrid Medical Learning
Authors: Liana Stanescu, Dan Burdescu, Anca Ion, Andrei Panus, Ligia Florea
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

The paper presents an e-learning platform (TESYS) that enhances the possibilities of the traditional medical teaching. It allows students to use modern tools for information access and continuously testing their knowledge. Although medical learning cannot replace direct transfer of knowledge performed during hospital practice hours, when the teacher presents to students different medical cases with all complementary information (medical investigations, diagnosis, applied treatment, disease evolution), the e-learning solution can offer significant advantages It can be said that the hybrid learning is the best solution for the medical teaching. An element of originality brought by the TESYS platform is a medical imagistic database that can be updated by the specialists with images acquired from different patients in the diagnosis and treatment process. A series of alphanumerical information: diagnosis, treatment and patient evolution can be added for each image. The second element of originality is the content-based visual query that uses characteristics that were automatically extracted from medical images (color, texture, regions). It can be used both in the training process and e-testing process. Using content-based visual query with other access methods (text-based, hierarchical methods) on a teaching image database allows students to see images and associated information from database in a simple and direct manner. This method stimulates learning, by comparing similar cases along with their particularities, or by comparing cases that are visually similar, but with different diagnoses.
Formal and Experimental Foundations of a New Rank Quality Measure
Authors: Steven Bogaerts, David Leake
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

In previous work, Bogaerts and Leake [1,2] introduced the rank quality measure for the evaluation of conversational case-based reasoning (CCBR) systems. Rank quality assesses how well a system copes with the limited problem information available in an ongoing dialog, giving useful evaluation information not readily available from standard precision and efficiency measures. However, that work also revealed surprising challenges for developing rank quality measures, restricting the proposed measures' applicability. This paper explores two open questions from that work: 1) how to define a rank quality measure immune to the previous pitfalls, and 2) how to assess the meaningfulness of any proposed rank quality measure. The paper establishes formal requirements for a rank quality measure, presents a new formulation of the measure, and provides a formal proof and empirical evidence to support that the new measure avoids previous pitfalls and meets the formal requirements.
Human Hand Gesture Recognition Using Motion Orientation Histogram for Interaction of Handicapped Persons with Computer
Authors: Maryam Vafadar, Alireza Behrad
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

Some groups of handicapped persons cannot reliably move the mouse and do the necessary operation on it to control the computer. However they can do some 3-d hand motions. Variety of tools has been presented for these users to interact with computer. Hand gesture recognition is one of the proper methods for this purpose. This paper presents a new algorithm for hand gesture recognition. In this algorithm, after constructing motion history image of video frames for each gesture and applying necessary processing on this image, motion orientation histogram vector is extracted. These vectors are then used for the training of Hidden Markov Model and hand gesture recognition. We tested the proposed algorithm with different hand gestures and results showed the correct gesture recognition rate of 90 percent. Comparing the results of proposed method with those of other methods showed that in addition to eliminating traditional problems in this area, recognition rate has been improved up to 4 percent.
Analysing Flight Data Using Clustering Methods
Authors: Christopher Jesse, Honghai Liu, Edward Smart, David Brown
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This paper reviews existing forms of density-based, partitional and hierarchical clustering methods in the context of flight data analysis. Advantages and disadvantages are fully explored with a focus on proposing a clustering-based ensemble framework for monitoring flight data in order to search for anomalies during flight operation. Case studies in selected flight scenarios are provided to demonstrate the potential of clustering methods and their integration with reasoning techniques in detecting abnormal flights.
Time Complexity and Convergence Analysis of Domain Theoretic Picard Method
Authors: Amin Farjudian, Michal Konečný
Venue: Proceedings of the 15th international workshop on Logic, Language, Information and Computation (2008)

We present an implementation of the domain-theoretic Picard method for solving initial value problems (IVPs) introduced by Edalat and Pattinson [1]. Compared to Edalat and Pattinson's implementation, our algorithm uses a more efficient arithmetic based on an arbitrary precision floating-point library. Despite the additional overestimations due to floating-point rounding, we obtain a similar bound on the convergence rate of the produced approximations. Moreover, our convergence analysis is detailed enough to allow a static optimisation in the growth of the precision used in successive Picard iterations. Such optimisation greatly improves the efficiency of the solving process. Although a similar optimisation could be performed dynamically without our analysis, a static one gives us a significant advantage: we are able to predict the time it will take the solver to obtain an approximation of a certain (arbitrarily high) quality.
Digital administration and the role of trust
Authors: Kris Snijkers
Venue: Information Polity (2004)

In this article we will argue that trust is an important factor in establishing new forms of digital administration. ICT is an enabler for the innovation of boundary-crossing processes. However, the more public administrations collaborate and integrate their processes through the use of ICT, the more interdependent and vulnerable they will become. In order to accept a growing interdependence and vulnerability administrations have to trust each other. Two Belgian cases, the Crossroads Bank for Social Security and the Crossroads Bank for Companies show the role that trust plays in a context of digital administration. The attention that was given to the creation of trust between the different administrations involved made or broke the success of the two projects.