ppxscal/embedding_network huggingface dataset:
Research and Implementation of LFB-Resources Registration Management Method
Authors: Lixia Zhang, Weiming Wang, Chuanhuang Li
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The next generation networks demand the router to be more open, flexible and programmable. As an important part of ForCES router software, an extensible LFB management and development model based on ForCES router software was illustrated, which enhances extensibility of the software. In this paper the ForCES router software structure was first discussed. Based on that, some of the key technologies were discussed for implementation of the model, including LFB resources construction of data, LFB registration function model and so on. This paper compares two methods about the LFB-resources registration. And according to a series of tests, a better method has been found. The implementation of the model was presented in the paper, which is testified to be usable in ForCES. And the impact on traffic flows and applications is evaluated.
Monitoring of Environmentally Hazardous Exhaust Emissions from Cars Using Optical Fibre Sensors
Authors: Elfed Lewis, John Clifford, Colin Fitzpatrick, Gerard Dooly, Weizhong Zhao, Tong Sun, Ken Grattan, James Lucas, Martin Degner, Hartmut Ewald, Steffen Lochmann, Gero Bramann, Edoardo Merlone-Borla, Flavio Gili
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

Results are presented for on board sensing of the Gases NO, NO2, SO2 and CO2. The optical fibre sensor was connected downstream of the Diesel Particle Filter (DPF) of a Fiat Croma and the measurements from the optical fibre sensors were recorded simultaneously using high specification reference instrumentation mounted in the boot of the car. In this way the results from the optical fibre sensors and the reference instrumentation could be directly compared. The results from the optical fibre sensors indicate that they are capable of measuring single ppm values of NO, NO2 and SO2 as required by the EURO IV standards and CO2 up to a concentration of 15% which is more than adequate for in car monitoring. The optical fibre sensors therefore performed well when compared to the reference instrumentation in tests conducted on a rolling road and during "free driving" on an urban road.
Annotation Framework Validation Using Domain Models
Authors: Carlos Noguera, Laurence Duchien
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

Frameworks and libraries that use annotations are becoming popular. However, there is not enough software engineering support for annotation development. In particular, the validation of constraints in the use of annotations requires further support. In this paper we postulate that annotation frameworks are a projection of the domain model into a programming language model. Using this idea, we have developed a tool that allows the annotation programmer to specify, and then validate the constraints of the annotation framework regarding a given annotated application using a domain model. To validate our approach to the validation of constraints using models, we apply it to the Fraclet annotation framework and compare it to the previous implementation.
A hybrid fuzzy-neural approach to job completion time prediction in a semiconductor fabrication factory
Authors: Toly Chen
Venue: Neurocomputing (2008)

Job completion time prediction is a critical task to a semiconductor fabrication factory. To further enhance the accuracy of job completion time prediction, the concept of input classification is applied to the back propagation network (BPN) approach in this study by pre-classifying a job with the fuzzy c-means (FCM) classifier before predicting the completion time with the BPN predictor. The data of jobs belonging to different categories are then learnt with different BPNs but with the same topology. After learning, these BPNs form a BPN ensemble that can be applied to predict the completion time of a new job. The output of the BPN ensemble determines the completion time forecast, and it is obtained by aggregating the outputs from the component BPNs with another BPN for nonlinear aggregation. Further, to improve the suitability of the FCM and BPN combination for the data, the prediction error by the BPN is also fed back to adjust the classification result by the FCM. On the other hand, the future release plan of the factory, which is influential but has been ignored in traditional approaches, is also incorporated in the proposed methodology with up to eight future discounted workloads. Production simulation is also applied in this study to generate test data. According to experimental results, the prediction accuracy of the proposed methodology was significantly better than those of some existing approaches.
RFID System Security Using Identity-Based Cryptography
Authors: Yan Liang, Chunming Rong
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

RFID was first proposed as a technology for the automatic identification of objects. However, some recent RFID devices can provide additional information and can be used in other applications. Security requirement is essential in most of the applications. An essential research challenge is to provide efficient protection for RFID systems. Identity-based cryptography can provide encryption and digital signature and convenience in key management compared with traditional certificate-based PKI solution. In this paper, a security management solution for the RFID system is proposed by using identity-based cryptography.
Interactive Constrained Deformations of NURBS Surfaces: N-SCODEF
Authors: Marcos Clapés, Manuel González-Hidalgo, Arnau Mir-Torres, Pere A. Palmer-Rodríguez
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

In this paper we propose a generalized SCODEF deformation method in order to deform NURBS surface. The deformation method propose a wide class of deformation functions applied to a set of select-user constraints and a wide range of influence zones, expanding the used one for the original SCODEF method. Also, we propose the use of several norms and distances in order to define and compute the deformation function and the constraint influence zone, ensuring a wide range of deformed shapes.
A Performance Model of Dense Matrix Operations on Many-Core Architectures
Authors: Guoping Long, Dongrui Fan, Junchao Zhang, Fenglong Song, Nan Yuan, Wei Lin
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Current many-core architectures (MCA) have much larger arithmetic to memory bandwidth ratio compared with traditional processors (vector, superscalar, and multi-core, etc). As a result, bandwidth has become an important performance bottleneck of MCA. Previous works have demonstrated promising performance of MCA for dense matrix operations. However, there is still little quantitative understanding of the relationship between performance of matrix computation kernels and the limited memory bandwidth. This paper presents a performance model for dense matrix multiplication (MM), LU and Cholesky decomposition. The input parameters are memory bandwidth B and on-chip SRAM capacity C, while the output is maximum core number Pmax. We show that $P_{max}=\Theta(B\ast \sqrt{C})$. Pmax indicates that when the problem size is large enough, the given memory bandwidth will not be a performance bottleneck as long as the number of cores P < Pmax. The model is validated by a comparison between the theoretical performance and experimental data of previous works.
Versioning of Topic Map Templates and Scalability
Authors: Markus Ueberall, Oswald Drobnik
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

Major issues for development environments are version management and scalability support. In this contribution, we discuss design guidelines for building a scalable, Topic Maps based prototype for software development process support, based on our work in [11,12]. Particular attention is paid to the versioning of both Topic Map Templates, i.e., patterns used for making multiple copies of a set of topic map objects, and their instances.In combination with faceted classification of the resulting hierarchical structures and a generic meta process model, it is shown that the intrinsic traits of Topic Maps can be used to reduce the complexity of the management of large topic maps, e.g., by filtering.
Exit problems for the difference of a compound Poisson process and a compound renewal process
Authors: Victor Kadankov, Tetyana Kadankova
Venue: Queueing Systems: Theory and Applications (2008)

In this paper we solve a two-sided exit problem for a difference of a compound Poisson process and a compound renewal process. More specifically, we determine the Laplace transforms of the joint distribution of the first exit time, the value of the overshoot and the value of a linear component at this time instant. The results obtained are applied to solve the two-sided exit problem for a particular class of stochastic processes, i.e. the difference of the compound Poisson process and the renewal process whose jumps are exponentially distributed. The advantage is that these results are in a closed form, in terms of resolvent sequences of the process.We determine the Laplace transforms of the busy period of the systems M ¿ |G ¿ |1|B, G ¿ |M ¿ |1|B in case when ¿~exp¿(¿). Additionally, we prove the weak convergence of the two-boundary characteristics of the process to the corresponding functionals of the standard Wiener process.
On handshakes in random graphs
Authors: Akka Zemmari
Venue: Information Processing Letters (2008)

In [Y. Metivier, N. Saheb, A. Zemmari, Analysis of a randomized rendezvous algorithm, Inform. and Comput. 184 (2003) 109-128], the authors introduce and analyze a randomized procedure to implement handshakes in graphs. In this paper, we investigate the same problem in random graphs. We prove results on the probability of success and we study the distribution of the random variable which counts the number of handshakes in the graph.
SOF: A Slight Ontology Framework Based on Meta-modeling for Change Management
Authors: Li Na Fang, Sheng Qun Tang, Ru Liang Xiao, Ling Li, You Wei Xu, Yang Xu, Xin Guo Deng, Wei Qing Chen
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

The importance of efficient E-Government services change management system is increasingly due to the evolution of it. But, the most system management tasks are still performed manually. This can be easier error-made, high time-consuming and more human-needed. So we present a Slight-Ontology-Framework (SOF) to perform the semi-automatic change management. The main ideas can be shown as the following aspects: One, it uses a set of ontologies to describe E-Government services and introduces meta-modeling theory to analyze the features of changes. Two, according to these services' characters, it reduces the description capability of OWL-S and combined itself with Business Process Modeling theory to make it higher pliability and easier system-implemented. Even though we use E-Government domain as the example, the approach is a general solution in other domains.
Dependency Parsing by Transformation and Combination
Authors: Jens Nilsson, Joakim Nivre
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

This study presents new language and treebank independent graph transformations that improve accuracy in data-driven dependency parsing. We show that individual generic graph transformations can increase accuracy across treebanks, but especially when they are combined using established parser combination techniques. The combination experiments also indicate that the presumed best way to combine parsers, using the highest scoring parsers, is not necessarily the best approach.
The simulation of the adaptive systems using the MIT rule
Authors: Coman Adrian, Axente Corneliu, Boscoianu Mircea
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

In order to simulate the adaptive systems, we've chosen to simulate the adaptive control with reference model, also known as Model Reference Adaptive Control - MRAC. The general idea behind Model Reference Adaptive Control (MRAC, also know as an MRAS or Model Reference Adaptive System) is to create a closed loop controller with parameters that can be updated to change the response of the system. The output of the system is compared to a desired response from a reference model. The control parameters are updated based on this error. The goal is for the parameters to converge to ideal values that cause the plant response to match the response of the reference model.
Cluster Recovery for Fault Tolerance of Spatial Database Cluster in Sensor Networks
Authors: Byeong-Seob You, Gyung-Bae Kim, Hae-Young Bae
Venue: Proceedings of the 5th international symposium on Parallel and Distributed Processing and Applications (2007)

In sensor networks, a huge amount of data is collected by millions of sensors and small mobile devices need to be processed fast. And database which stores those data always should be able to response for any requirement. Spatial database cluster provides high performance and high availability. That suits sensor networks because spatial database cluster can efficiently manage and process much amount of data. The previous system, however, should write external logs every transaction for high availability in all nodes. So, all of update transactions are slowly processed because of writing external logs. Also, recovery time of the failed node is increased because external logs for all of database are written in only single storage. In this paper, we propose the cluster recovery of spatial database cluster. The proposed method has cluster logs in each table unit for consistency among nodes. Also, the cluster log is written just in case any node is failed. Therefore the proposed method is processed more fast because all update transactions don't write cluster logs. And the proposed method provides fast recovery because each table can be recovered concurrently.
Non-negative Matrix Factorization for Endoscopic Video Summarization
Authors: Spyros Tsevas, Dimitris Iakovidis, Dimitris Maroulis, Emmanuel Pavlakis, Andreas Polydorou
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

Wireless Capsule Endoscopy (WCE) has been introduced as a non-invasive colour imaging technique for the inspection of the small intestin along with the rest of the gastrointestinal tract. Each WCE examination results in a 50,000-frames video that has to be visually inspected frame-by-frame by the doctor and this may be a highly time-consuming task even for the experienced gastroenterologist. In this paper we propose a novel approach that leads to a summarized version of the original video enabling significant reduction in the video assessment time without losing any critical information. It is based on symmetric non-negative matrix factorisation initialized by the fuzzy c-means algorithm and it is supported by non-negative Lagrangian relaxation to extract a subset of video frames containing the most representative scenes from an entire examination. The experimental evaluation of the proposed approach was performed using previously annotated endoscopic videos from various sites of the small intestine.
Implicit learning as a design strategy for learning games: Alert Hockey
Authors: Chad Ciavarro, Mike Dobson, David Goodman
Venue: Computers in Human Behavior (2008)

Concussion education and prevention for youth hockey players has been an issue of recent concern amongst sport medicine practitioners and hockey's administrative bodies. This article details the assessment of a sports-action hockey video game that aims to reduce the aggressive and negligent behaviours that can lead to concussions. The game, termed Alert Hockey, was designed to modify game playing behaviour by embedding an implicit teaching mechanism within the gameplay. In Alert Hockey, participants were expected to learn by simply playing to win, in contrast to playing to learn. We studied learning in an experimental simulated environment where the possibility to win the game was exaggerated as a consequence of desirable safety behaviours (positive learning group) and effectively reduced as a consequence of undesirable (negative learning group) behaviour. The positive learning group significantly improved their mean score on a composite behavioural indicator compared with no significant change amongst control group participants. The results demonstrate that implicit learning embedded in a sports-action game can lead to changes in game-play behaviour.
Boosting the Performance of Inference Algorithms for Transcriptional Regulatory Networks Using a Phylogenetic Approach
Authors: Xiuwei Zhang, Bernard M. Moret
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

Inferring transcriptional regulatory networks from gene-expression data remains a challenging problem, in part because of the noisy nature of the data and the lack of strong network models. Time-series expression data have shown promise and recent work by Babu on the evolution of regulatory networks in E. coli and S. cerevisiae opened another avenue of investigation. In this paper we take the evolutionary approach one step further, by developing ML-based refinement algorithms that take advantage of established phylogenetic relationships among a group of related organisms and of a simple evolutionary model for regulatory networks to improve the inference of these networks for these organisms from expression data gathered under similar conditions.We use simulations with different methods for generating gene-expression data, different phylogenies, and different evolutionary rates, and use different network inference algorithms, to study the performance of our algorithmic boosters. The results of simulations (including various tests to exclude confounding factors) demonstrate clear and significant improvements (in both specificity and sensitivity) on the performance of current inference algorithms. Thus gene-expression studies across a range of related organisms could yield significantly more accurate regulatory networks than single-organism studies.
A Method for Collaborative Development of Systems of Systems in the Office Domain
Authors: Ralf Carbon, Gregor Johann, Dirk Muthig, Matthias Naab
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

Seamless interoperability across system boundaries and optimally tailored solutions for customers are dominating concerns in the vision of future office in-frastructures. This means to change the way how office systems are developed from today’s ad-hoc integration of independent systems towards a collaborative ap-proach for adequate systems of systems. In this paper, we propose a development method based on product line engineering to support the efficient production of customized solutions. The interoperability issues are tackled by a collaboration model separating solution providers and suppliers and by a reference architec-ture defining clear specifications of the components to be integrated. Together with our production method, interoperability in complex systems of systems is sup-ported by construction.
A Sequent Calculus for Bilattice-Based Logic and Its Many-Sorted Representation
Authors: Ekaterina Komendantskaya
Venue: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (2007)

We introduce a sequent calculus for bilattice-based annotated logic (BAL). We show that this logic can be syntactically and semantically translated into a fragment MSL* of conventional many-sorted logic MSL. We show deductive equivalence of sequent calculus for BAL and sequent calculus for MSL*.
CLEF 2007: Ad Hoc Track Overview
Authors: Giorgio M. Nunzio, Nicola Ferro, Thomas Mandl, Carol Peters
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

We describe the objectives and organization of the CLEF 2007 Ad Hoc track and discuss the main characteristics of the tasks offered to test monolingual and cross-language textual document retrieval systems. The track was divided into two streams. The main stream offered mono- and bilingual tasks on target collections for central European languages (Bulgarian, Czech and Hungarian). Similarly to last year, a bilingual task that encouraged system testing with non-European languages against English documents was also offered; this year, particular attention was given to Indian languages. The second stream, designed for more experienced participants, offered mono- and bilingual "robust" tasks with the objective of privileging experiments which achieve good stable performance over all queries rather than high average performance. These experiments re-used CLEF test collections from previous years in three languages (English, French, and Portuguese). The performance achieved for each task is presented and discussed.
A Neuro-interface with fuzzy compensator for controlling nonholonomic mobile robots
Authors: Rafiuddin Syam, Keigo Watanabe, Kiyotaka Izumi
Venue: Neural Computing and Applications (2008)

This paper describes a control method for mobile robots represented by a nonlinear dynamical system, which is subjected to an output deviation caused by drastically changed disturbances. We here propose some controllers in the framework of neuro-interface. It is assumed that a neural network (NN)-based feedforward controller is construcetd by following the concept of virtual master-slave robot, in which a virtual master robot as a feedforward controller is used to control the slave (i.e., actual) robot. The whole system of the present neuro-interface consists of an NN-based feedforward controller, a feedback PD controller and an adaptive fuzzy feedback compensator. The NN-based feedforward controller is trained offline by using a gradient method, the gains of the PD controller are to be chosen constant, and the adaptive fuzzy compensator is constructed with a simplified fuzzy reasoning. Some simulations are presented to confirm the validity of the present approach, where a nonholonomic mobile robot with two independent driving wheels is assmued to have a disturbance due to the change of mass for the robot.
An Architecture for Supporting Network Fault Recovery Management
Authors: Feng Liu, Antonis M. Hadjiantonis, Ha Manh Tran, Mina Amin
Venue: Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services (2008)

Highly available and resilient networks play a decisive role in today's networked world. As network faults are inevitable and networks are becoming constantly intricate, finding effective fault recovery solutions in a timely manner is becoming a challenging task for administrators. Therefore, an automated mechanism to support fault resolution is essential towards efficient fault handling process. In this paper we propose an architecture to support automated fault recovery in terms of traffic engineering, recovery knowledge discovery and automated recovery planning. We base our discussion on an application scenario for recovery from border router failure to maintain optimized configuration of outbound inter-domain traffic.