ppxscal/embedding_network huggingface dataset:
Comparing Exact and Heuristic Methods for Site Location Based on Multiple Attributes: An Afforestation Application
Authors: Pablo Vanegas, Dirk Cattrysse, Jos Orshoven
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

This paper presents a mathematical formulation and a heuristic solution method in order to locate optimal sites for afforestation of agricultural land. These sites must maximize levels of environmental performance, and must fulfill shape and size requirements. Since the criteria involved in the problem are represented by means of raster structures, the sites are composed by a given number of cells. The ultimate objective of this work is the development of a high performance heuristic able to find near to optimal afforestation sites. For validating the heuristic approach, a comparison with the mathematical method is carried out in limited sized areas within The Netherlands, Denmark, and Flanders. The comparison reveals that the heuristic is considerably faster than the mathematical method, and that the objective values obtained with the two approaches are significantly similar.
Bilateral Control Architecture for Telerobotics Systems in Unknown Environments
Authors: José M. Azorín, Rafael Aracil, Carlos Pérez, Nicolás M. García, José M. Sabater
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

This paper presents a bilateral control architecture for teleoperation systems where the environment must not be identified to design the control gains. In this control scheme, the interaction force of the slave with the environment is an external input. This force is not modeled by gains inside the control architecture. In the paper, the state convergence methodology is used to design the control gains of the teleoperation system. The control system allows that the slave state follows the master state and to establish the desired dynamics of the teleoperation system. Several simulation results are shown to verify the performance of the control scheme.
A Proposal of Building an Early-Stage Diagnosis System of First-Aid through Wireless Internet
Authors: Randy S. Tolentino, Jung-Hwan Hwang, Sun-Ho Kim, Yong-Tae Kim, Gil-Cheol Park, Dae-Joon Hwang
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

It is generally accepted that early and specialized pre-hospital patient treatment improves outcome in terms of mortality and morbidity, in emergency cases. The focus of this paper is to propose a telemedicine system for pre-hospital patient treatment. One of the primary emphases of the propose system is on the transmission of patient vital signs from the accident site or the moving ambulance to the consultation site, using Internet and wireless mobile network, at the hospital the medical experts evaluate the patient data, decides about the treatment protocol and provide directions to the medical staff on the accident site or to the ambulance's, concerning on handling the patient until the arrival to the hospital. The propose system has a database including (1) patient medical record, (2) lists of disease, general procedure of diagnosis and prescription treatment, and (3) lists doctor's with their corresponding specialties.
SGML results in computational topology
Authors: G. Tourlakis, J. Mylopoulos
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

It is the object of this paper to study the topological properties of finite graphs that can be imbedded in the n-dimensional integral lattice (denoted Nn). The basic notion of deletability of a node is first introduced. A node is deletable with respect to a graph if certain computable conditions are satisfied on its neighborhood. An equivalence relation on graphs called reducibility and denoted by "∼" is then defined in terms of deletability and it is shown that (a) most important topological properties of the graph (homotopy, homology and cohomology groups) are ∼-invariants, (b) for graphs imbedded in N3 different knot types belong to different ∼-equivalence classes, (c) it is decidable whether two graphs are reducible to each other in N2 but this problem is undecidable in Nn for n ≥ 4. Finally, it is shown that two different methods of approximating an n-dimensional closed manifold with boundary by a graph of the type studied here lead to graphs whose corresponding homology groups are isomorphic.
Attacks and Solutions of Yang et al.'s Protected Password Changing Scheme
Authors: Eun-Jun Yoon, Eun-Kyung Ryu, Kee-Young Yoo
Venue: Informatica (2005)

Recently, Yang et al. proposed an improvement to Tseng et al.'s protected password changing scheme that can withstand denial of service attack. However, the improved scheme is still susceptible to stolen-verifier attack and denial of service attack. Accordingly, the current paper demonstrates the vulnerability of Yang et al.'s scheme to two simple attacks and presents an improved protected password change scheme to resolve such problems. In contrast to Yang et al.'s protected password changing scheme and the existing password change schemes using server's public key, the proposed scheme can securely update user passwords without a complicated process and server's public key.
Simple low-level real-time threading semantics to enable portability, efficiency, analyzability, and generality
Authors: Kelvin Nilsen
Venue: Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems (2008)

Among the key reasons why the Java platform has become the most popular programming language for traditional non-real-time development are its portability across a wide variety of popular operating systems and architectures and its built-in language support for threading and synchronization [1, 2]. These are both critical enablers for the creation of a vibrant after market for commercial off the shelf and open source software components. And they are key reasons why software maintenance and reuse of Java software is typically five to ten times less expensive than comparable activities for software implemented in C or C++ [3, 4]. The portable thread model defined by the Java Language Specification [5] does not specify behavior that is important to real-time developers. Though the Real-Time Specification for Java (RTSJ) [6] improves upon standard edition semantics, it still leaves many aspects of threading behavior imprecisely specified and/or implementation defined. This hinders software reuse and adds complexity and costs to software maintenance activities. This paper suggests an alternative approach that improves portability and efficiency, without sacrificing important analyzability and generality requirements.
Prediction of Binding Sites in the Mouse Genome Using Support Vector Machines
Authors: Yi Sun, Mark Robinson, Rod Adams, Alistair Rust, Neil Davey
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

Computational prediction of cis-regulatory binding sites is widely acknowledged as a difficult task. There are many different algorithms for searching for binding sites in current use. However, most of them produce a high rate of false positive predictions. Moreover, many algorithmic approaches are inherently constrained with respect to the range of binding sites that they can be expected to reliably predict. We propose to use SVMs to predict binding sites from multiple sources of evidence. We combine random selection under-sampling and the synthetic minority over-sampling technique to deal with the imbalanced nature of the data. In addition, we remove some of the final predicted binding sites on the basis of their biological plausibility. The results show that we can generate a new prediction that significantly improves on the performance of any one of the individual prediction algorithms.
Analysis of Linear Group GF(2p) Cellular Automata
Authors: Un-Sook Choi, Sung-Jin Cho, Yoon-Hee Hwang, Han-Doo Kim
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Cellular Automata(CA) has been used as modeling and computing paradigm for a long time. And CA has been used to model many physical systems. While studying the models of such systems, it is seen that as the complexity of the physical system increase, the CA based model becomes very complex and difficult to track analytically. Also such models fail to recognize the presence of inherent hierarchical nature of a physical system. In this paper we give the characterization of linear group GF(2 p ) CA. Especially we analyze the relationship between characteristic polynomial and transition rule of linear group GF(2 p ) CA.
Evaluating Switching Neural Networks for Gene Selection
Authors: Francesca Ruffino, Massimiliano Costacurta, Marco Muselli
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

A new gene selection method for analyzing microarray experiments pertaining to two classes of tissues and for determining relevant genes characterizing differences between the two classes is proposed. The new technique is based on Switching Neural Networks (SNN), learning machines that assign a relevance value to each input variable, and adopts Recursive Feature Addition (RFA) for performing gene selection.The performances of SNN-RFA are evaluated by considering its application on two real and two artificial gene expression datasets generated according to a proper mathematical model that possesses biological and statistical plausibility. Comparisons with other two widely used gene selection methods are also shown.
ValiPVM - A Graphical Tool for Structural Testing of PVM Programs
Authors: Paulo Lopes Souza, Eduardo T. Sawabe, Adenilso Silva Simão, Silvia R. Vergilio, Simone Rocio Senger De Souza
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

This work presents ValiPVM, a testing tool for C/PVM parallel programs. This tool implements structural coverage criteria, using an architecture already employed for MPI programs. It supports generation and evaluation of test sets and considers the control, data and communication flows of PVM programs. ValiPVM has a graphical user interface, designed to facilitate the test execution, analysis of results and to guide the user during the execution of the testing activity.
Statistical Neurodynamics for Sequence Processing Neural Networks with Finite Dilution
Authors: Pan Zhang, Yong Chen
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

We extend the statistical neurodynamics to study transient dynamics of sequence processing neural networks with finite dilution, and the theoretical results are supported by extensive numerical simulations. It is found that the order parameter equations are completely equivalent to those of the Generating Functional Method, which means that crosstalk noise follows normal distribution even in the case of failure in retrieval process. In order to verify the gaussian assumption of crosstalk noise, we numerically obtain the cumulants of crosstalk noise, and third- and fourth-order cumulants are found to be indeed zero even in non-retrieval case.
An Intelligent Traffic Light Control Based on Extension Neural Network
Authors: Kuei-Hsiang Chao, Ren-Hao Lee, Meng-Hui Wang
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This paper presents an intelligent traffic light control method based on extension neural network (ENN) theory for crossroads. First, the number of passing vehicles and passing time of one vehicle within green light time period are measured in the main-line and sub-line of a selected crossroad. Then, the measured data are adopted to construct an estimation method based on ENN for recognizing the traffic flow of a standard crossroad. Some experimental results are made to verify the effectiveness of the proposed intelligent traffic flow control method. The diagnostic results indicate that the proposed estimated method can discriminate the traffic flow of a standard crossroad rapidly and accurately.
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
Authors: Arpita Patra, Ashish Choudhary, Kannan Srinathan, Chandrasekharan Pandu Rangan
Venue: Proceedings of the 21st international symposium on Distributed Computing (2007)

We characterize Perfectly Secure Message Transmission (PSMT) between two nodes S and R in directed wire model, assuming that n wires are directed from S to R (also termed as top band) and u wires are directed from R to S (also termed as bottom band). A mixed adversary (tb, tf ) controls tb wires in Byzantine fashion and tf in fail-stop fashion among these u+n wires with unbounded computing power. S wishes to send a message m from a finite field $\mathbb{F}$ in a perfectly secure manner to R such that the adversary gets no information whatsoever on m, though he has unbounded computing power. Our characterization is the first ever characterization for PSMT considering mixed adversary and reveals more fault tolerance than the existing results [1]. Our protocols terminates in constant number of phases, performs polynomial computation and have polynomial communication complexity.
Solving the Preserving Reversal Median Problem
Authors: Matthias Bernt, Daniel Merkle, Martin Middendorf
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2008)

Genomic rearrangement operations can be very useful to infer the phylogenetic relationship of gene orders representing species. We study the problem of finding potential ancestral gene orders for the gene orders of given taxa, such that the corresponding rearrangement scenario has a minimal number of reversals, and where each of the reversals has to preserve the common intervals of the given input gene orders. Common intervals identify sets of genes that occur consecutively in all input gene orders. The problem of finding such an ancestral gene order is called the preserving reversal median problem (pRMP). A tree-based data structure for the representation of the common intervals of all input gene orders is used in our exact algorithm TCIP for solving the pRMP. It is known that the minimum number of reversals to transform one gene order into another can be computed in polynomial time, whereas the corresponding problem with the restriction that common intervals should not be destroyed is already NP-hard. It is shown theoretically that TCIP can solve a large class of pRMP instances in polynomial time. Empirically we show the good performance of TCIP on biological and artificial data.
Motion Planning for Cooperative Multi-robot Box-Pushing Problem
Authors: Ezra Federico Parra-González, Gabriel Ramírez-Torres, Gregorio Toscano-Pulido
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

The multi-robot box-pushing problem in cluttered environments has demonstrated to be a very complex problem with multiple practical applications. In this document we present a new strategy to solve it, inspired in the wavefront algorithm which it also includes some pertinent modifications to obtain trajectories that facilitate the box displacement for non-holonomic mobile robots. The proposed method obtains its benefits by the reduction of route distances, reducing the direction changes in the routes, and by searching the best pushing points for robots.
Manipulatives in the History of Teaching: Fast Forward to AutOMathic Blocks for the Blind
Authors: Arthur I. Karshmer, Daryoush Farsi
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The use of manipulative objects in the teaching of younger children has been a well know and accepted educational practice for over 200 years. The use of manipulative blocks have been valuable in the teaching of subjects such as the alphabet, linear and multidimensional measurements and early mathematics to name a few. In the current work, we present a brief overview of the traditional use of these tools as a basis for the discussion of the the AutOMathic Blocks system --- a systems that integrates the physical manipulative object with a computer to deliver personal math instruction to young students with visual impairments.
The Effects of Users' Background Diagram Knowledge and Task Characteristics upon Information Display Selection
Authors: Beate Grawemeyer, Richard Cox
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

This paper explores factors associated with effective external representation (ER) use. We describe an information-processing approach to the assessment of ER knowledge. We also present findings from a study that examined the effects of users' background knowledge of ERs upon performance and their preferences for particular information display forms across a range of database query types that differed in their representational specificity. A representationally specific task is one which can only be performed effectively with one type of representation (or a narrow range of representations). On highly representationally specific tasks, optimal ER selection is crucial. Both ER selection performance and reasoning performance are, in turn, predicted by an individual's prior knowledge of ERs. On representationally nonspecific tasks, participants performed well with any of several different ER types regardless of their level of prior ER knowledge. It is argued that ER effectiveness crucially depends upon a three-way interaction between user characteristics (e.g. prior knowledge), the cognitive properties of an ER, and task characteristics.
A Tool Chain for Quality-Driven Software Architecting
Authors: Antti Evesti, Eila Niemelä, Katja Henttonen, Marko Palviainen
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

The Quality-driven Architecture Design and quality Analysis (QADA ) methodology uses quality requirements as a driving force when selecting software structures. In QADA, the family architecture contains qualitative quality requirements as architectural style(s) and patterns and the quantitative quality requirements as the properties of individual architectural elements. Our tool chain covers all the phases of QADA and contributes to software family engineering by providing methods to select an appropriate approach for family architecture (Stylebase), to capture and map requirements to the architecture (Protégé, QPE, TOPCASED), to evaluate the maturity and quality of the architecture (Stylebase, RAP), a technique to represent variation points in the family architecture (QPE, TOPCASED), and a testing approach that can test final software components, ensure the achieved quality level, and produce feedback for the architect (ComponentBee). These tools work under the Eclipse platform and utilise free open source components.
Design and development of embedded control system for a lime delivery machine
Authors: George K. Adam, Georgia Garani, Nicholas Samaras, Vilem Srovnal, Jiri Koziorek, Vladimir Kasik, Jiri Kotzian
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

This paper presents the methodology of developing a microprocessor-based embedded application for a distributed control system. The control system is realized for the operation of a mechatronic lime storage and delivery machine, intended for lime production plants. At the design stage, simulations were carried out in order to verify and reconfirm the functionality of the analytical model of the controller. The simulation results were satisfactory close to those derived by the further on experimental investigation. The proposed flow control system was experimentally verified and evaluated upon a specific prototype of a lime slurry storage and delivery machine. The control system is based upon the Intel 80C188EB microprocessor.
Validating High-Level Synthesis
Authors: Sudipta Kundu, Sorin Lerner, Rajesh Gupta
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

The growing design-productivity gap has made designers shift toward using high-level languages like C, C++ and Java to do system-level design. High-Level Synthesis (HLS) is the process of generating Register Transfer Level (RTL) design from these initial high-level programs. Unfortunately, this translation process itself can be buggy, which can create a mismatch between what a designer intends and what is actually implemented in the circuit. In this paper, we present an approach to validate the result of HLS against the initial high-level program using insights from translation validation, automated theorem proving and relational approaches to reasoning about programs. We have implemented our validating technique and have applied it to a highly parallelizing HLS framework called SPARK. We present the details of our algorithm and experimental results.
Does 'Notice' Prompt Noticing? Raising Awareness in Language Learning with an Open Learner Model
Authors: Gheida Shahrour, Susan Bull
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

Open learner models (OLM) are learner models that are accessible to the learner they represent. Many examples now exist, often with the aim of prompting learner reflection on their knowledge. In language learning, this relates to research on noticing and awareness-raising. We here introduce an open learner model to investigate the potential of OLMs to facilitate noticing. Results suggest that an OLM could be a useful way of helping students to notice language features, with all students noticing some of the features tested, a result that was maintained in a delayed post-test one week after the experimental session.
Towards an optimized and secure cascade for data aggregation in vanets
Authors: Khaled Ibrahim, Michele C. Weigle
Venue: Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking (2008)

We present an analysis of and security extensions to the CASCADE (Cluster-based Accurate Syntactic Compression of Aggregated Data in VANETs) data aggregation technique. CASCADE organizes known vehicles into clusters, the size of which determines both the frame size used to distribute aggregated data and the distance ahead that vehicles are aware of (local view). We determine the optimal cluster size to balance the trade-off between local view length and expected frame size. The original CASCADE description does not consider security issues, so we present our framework for a secure CASCADE by employing received signal strength and laser rangefinders for position verification.