ppxscal/embedding_network huggingface dataset:
Exploiting the ASM Method for Validation & Verification of Embedded Systems
Authors: Angelo Gargantini, Elvinia Riccobene, Patrizia Scandurra
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

SystemC (built upon C++) [2] is an IEEE industry-standard language for system-level models, specifically targeted at architectural, algorithmic, transaction-level modelling. Recently, a further improvement has been achieved by trying to combine SystemC with lightweight software modelling languages like UML to describe system specifications. In accordance with the design principles of the OMG's Model-driven architecture (MDA), we defined a model-driven design methodology for embedded systems [3] based on the UML 2, a SystemC UML profile (for the HW side), and a multi-thread C UML profile (for the SW side), which allows UML modelling of the system at higher levels of abstraction (from a functional level down to RTL level).
Case Based Interpretation of Soil Chromatograms
Authors: Deepak Khemani, Minu Mary Joseph, Saritha Variganti
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

This paper focuses on the application of CBR to soil analysis from chromatograms. The shape, size and colour of the chromatogram image are hypothesized to contain important information of the mineral content in the soil. Since chromotogram preparation is cheaper than chemical analysis the goal is to predict the nutrients from the chromatogram image features in the future rather than by direct chemical analysis. The method proposed in this paper will be new, as the current process of chemical analysis of soil is done manually, which is an expensive, time consuming and laborious process. This method of analysis will benefit farmers all across the globe, who are looking for innovative means to obtain their soil characteristics during the process of farming. In this application, the key assumption is that --- similar chromatograms have similar soil properties. This paper focuses on the definition of similarity measure and determining the weight model for the feature set needed for the application.
Survey of Distance Measures for NMF-Based Face Recognition
Authors: Yun Xue, Chong Sze Tong, Weipeng Zhang
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Non-negative matrix factorization (NMF) is an unsupervised learning algorithm that can extract parts from visual data. The goal of this technique is to find intuitive basis such that training examples can be faithfully reconstructed using linear combination of basis images which are restricted to non-negative values. Thus NMF basis images can be understood as localized features that correspond better with intuitive notions of parts of images. However, there has not been any systematic study to identify suitable distance measure for using NMF basis images for face recognition.In this article we evaluate the performance of 17 distance measures between feature vectors based on the result of the NMF algorithm for face recognition. Recognition experiments are performed using the MIT-CBCL database, CMU AMP Face Expression database and YaleB database.
FPGA Implementation of an Adaptive Noise Canceller
Authors: Tian Lan, Jinlin Zhang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

This paper proposes an FPGA implementation of an Adaptive Noise Canceller using the Least Mean Square (LMS) algorithm. The hardware architecture is synthesized using the Xilinx Spartan-3e Starter Kit as the target board. The experimental result of the hardware implementation shows the performance of LMS algorithm under different conditions and the feasibility of our architecture. A comparison between hardware and pure software implementation is then made with different filter taps.
Classification of High-Resolution Satellite Images Using Supervised Locality Preserving Projections
Authors: Yen-Wei Chen, Xian-Hua Han
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

We proposed a new method based on supervised locality preserving projections (SLPP) for classification of high resolution satellite images. Compared with other subspace methods such as PCA and ICA, SLPP can preserve local geometric structure of data and enhance within-class local information. The proposed method has been successfully applied to IKONOS images and experimental results show that the proposed SLPP based method outperform ICA-based method. The proposed method can be practically incorporated into a GIS system.
Model-Driven Development of a Mediation Service
Authors: Dick Quartel, Stanislav Pokraev, Rodrigo Mantovaneli Pessoa, Marten van Sinderen
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

Although service-oriented architectures offer real benefits when pursuing application integration and business flexibility, there are still no satisfactory solutions for dealing with existing systems that need to cooperate while their services have no perfect match. In the case of incompatible services, a 'mediator' may be introduced which resolves (semantic) interoperability problems by intervening in the cooperation between systems. Building mediators is currently often a manual process, resulting in dedicated IT-driven solutions. This paper presents a framework to guide the development of mediators, with the following objectives: (i) uncover and capture the actual interoperability problem that needs to be solved; (ii) allow the involvement of non-IT (i.e., business) experts in the development of the solution; (iii) support evolution of the solution and re-use of results in case of changing interoperability requirements; (iv) facilitate automation of parts of the process. The framework is based on service-oriented, model-driven and semantic web techniques. Available tool support for the different steps in the framework is indicated.
Microbenchmark Performance Comparison of High-Speed Cluster Interconnects
Authors: Jiuxing Liu, Balasubramanian Chandrasekaran, Weikuan Yu, Jiesheng Wu, Darius Buntinas, Sushmitha Kini, Dhabaleswar K. Panda, Pete Wyckoff
Venue: IEEE Micro (2004)

High-speed cluster interconnects Myrinet, Quadrics, and InfiniBand achieve low latency and high bandwidth with low host overhead. However, they show quite different performance behaviors when handling communication buffer reuse patterns.
On a Generalization of Standard Episturmian Morphisms
Authors: Michelangelo Bucci, Aldo Luca, Alessandro Luca
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

In a recent paper with L. Q. Zamboni the authors introduced the class of ¿-episturmian words, where ¿ is an involutory antimorphism of the free monoid A *. In this paper, we introduce and study ¿-characteristic morphisms, that is, morphisms which map standard episturmian words into standard ¿-episturmian words. They are a natural extension of standard episturmian morphisms. The main result of the paper is a characterization of these morphisms when they are injective.
Experience in Developing a High Availability and Continuous TCP Using OpenAIS and TCPCP
Authors: Ying-Yu Chen, Chien Chen, Chia-Yuan Huang
Venue: Proceedings of the 4th international symposium on Service Availability (2007)

It has become one of the basic requirements for the service providers to deliver highly available services to meet the customers' critical needs. However, a highly available service does not guarantee that the service is delivered continuously from the user's point of view. In this paper, we share the experience of developing high-availability and continuous TCP using open source OpenAIS and TCPCP/TCPCP2. We describe the main system design for building such systems. We specifically discuss two of the problems that need to be overcome under this kind of design model. For each problem and its corresponding resolution, we show a simulation using ns2 simulator, which provides a deeper insight into the problems for further studies. We also develop a simple application which uses OpenAIS and TCPCP2 to achieve its high availability and service continuity. The results indicate that a high availability and service continuity service can be obtained with minor degradation in performance.
Proposal of a new computational method for the analysis of the systematic differences in star catalogues
Authors: J. A. Lopez Orti, F. J. Marco Castillo, M. J. Martinez Uso
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

The aim of this paper is the analysis of the bias contained in star catalogues, these errors can be obtained by means of kinematics or dynamical methods. In this paper a general method, suitable when the sample is not homogeneous is presented.
Hidden-Vector Encryption with Groups of Prime Order
Authors: Vincenzo Iovino, Giuseppe Persiano
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

Predicate encryption schemes are encryption schemes in which each ciphertext Ct is associated with a binary attribute vector and keys K are associated with predicates. A key K can decrypt a ciphertext if and only if the attribute vector of the ciphertext satisfies the predicate of the key. Predicate encryption schemes can be used to implement fine-grained access control on encrypted data and to perform search on encrypted data.Hidden vector encryption schemes [Boneh and Waters --- TCC 2007] are encryption schemes in which each ciphertext is associated with a binary vector and each key K is associated with binary vector with "don't care" entries (denoted with ¿). Key K can decrypt ciphertext if and only if and agree for all i for which $y_i\ne \star$.Hidden vector encryption schemes are an important type of predicate encryption schemes as they can be used to construct more sophisticated predicate encryption schemes (supporting for example range and subset queries).We give a construction for hidden-vector encryption from standard complexity assumptions on bilinear groups of prime order. Previous constructions were in bilinear groups of composite order and thus resulted in less efficient schemes. Our construction is both payload-hiding and attribute-hiding meaning that also the privacy of the attribute vector, besides privacy of the cleartext, is guaranteed.
Sofic Trace Subshift of a Cellular Automaton
Authors: Julien Cervelle, Enrico Formenti, Pierre Guillon
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. In this paper we study conditions for a sofic subshift to be the trace of a cellular automaton.
Observing the Impact of QoS Negotiation on the Signaling Load of the IMS
Authors: Juan Miguel Espinosa Carlín
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

Defined by the 3GPP, the IP Multimedia Subsystem (IMS) is becoming the de facto overlay architecture for enabling service delivery in converged environments. In such scenarios, the QoS requirements of the delivered services vary from user to user, and from service to service. To cope with this necessity, the IMS allows subscribers to personalize the QoS settings of the session that they want to establish. In order to know the impact that the requested QoS parameters have on the available network resources, it is of paramount importance to know how the signaling load in the core network is influenced by them. With this goal in mind, this paper shows how the IMS SIP signaling load is affected when users change their QoS parameters when negotiating a session. The observations were done on a testbed based on the Open IMS Core implementation of the Fraunhofer FOKUS Institute at Berlin and on the IMS Client developed at the University of Cape Town. 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
PLS prediction of hyperpolarizabilities for donor-bridge-acceptor organic systems
Authors: A. E. de A. Machado, B. de Barros Neto, A. A. de S. da Gama
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

Elevated magnitudes of the first and second static hyperpolarizabilities (AM1/TDHF), respectively, of organic molecules having electron-donation (D) and electron-accepting (A) groups can be obtained through of selection of molecular systems with appropriate structural and electronic parameters. The Homo-Lumo energy gap, the total number of &pi;-electrons of the molecule, the Homo energy, and the ground state dipole moment were the parameters considered in this work. The designed D-A organic molecules investigated have polyenic/mesoionic bridge, which afford large &beta; and &gamma; hyperpolarizabilities, associated for different strength of donor-acceptor pairs. Large data sets of these parameters for the molecules, obtained from quantum chemistry semiempirical calculations with AM1 hamiltonian, were submitted to a principal components analysis (PCA). In addition, a model was proposed based in a principal components regression (PCR), having in mind the prevision and selection of organic molecules with potential applications in nonlinear optics.
Analysis of a Redundant Architecture for Critical Infrastructure Protection
Authors: Alessandro Daidone, Silvano Chiaradonna, Andrea Bondavalli, Paulo Veríssimo
Venue: Architecting Dependable Systems V (2008)

Critical infrastructures like the power grid are emerging as collection of existing separated systems of different nature which are interconnected together. Their criticality becomes more and more evident as the damage and the risks deriving from wrong behaviors (both accidental and intentionally caused) are increasing. It is becoming evident that existing (legacy) subsystem must be interconnected together following some disciplined and controlled way. This is one of the challenges taken by the European Project CRUTIAL, where an infrastructure architecture seen as a WAN of LANs is being proposed, where LANs confine existing sub-systems, protected by special interconnection and filtering devices (CIS - CRUTIAL Information Switches). Previous work led to the definition of the CIS internal and interconnection architecture, so that a set of CIS can collectively ensure that the computers controlling the physical process correctly exchange information despite accidents and malicious attacks. CIS resilience is achieved thanks to replication for intrusion tolerance and replica recovery for self-healing.This chapter analyzes the redundant architecture of the CIS, with a set of objectives: identifying the relevant parameters of the architecture; evaluating how effective is the trade-off between proactive and reactive recoveries; and finding the best parameter setup. Two measures of interest were identified, a model of the recovery strategy was constructed and the quantitative behavior of the recovery strategy was analyzed. The impact of the detection coverage, of the intrusions and of the number of CIS replicas was analyzed and discussed. The directions for refining and improving the recovery strategy were proposed.
Pose Estimation for Sensors Which Capture Cylindric Panoramas
Authors: Fay Huang, Reinhard Klette, Yun-Hao Xie
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

We show that there exist linear models for sensor pose estimation for multi-view panoramas defined by a symmetric or leveled pair of cylindric images. We assume that pairs of corresponding points have been detected already in those pairs of panoramas. For the first time a cost function is formulated whose minimization solves the pose estimation problem for these two general cases of multi-view panoramas, specified by unconstrained sensor parameter values but only minor constraints on sensor poses. (Note that due to the non-linearity of the panoramic projection geometry, the modeling of sensor pose estimation typically results into non-linear forms which incur numerical instability.)
Electromagnetic Actuation Based on MEMS Technology for Tactile Display
Authors: Jeremy Streque, Abdelkrim Talbi, Philippe Pernod, Vladimir Preobrazhensky
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

This paper presents a highly integrated tactile display which is being conceived using Micro-Electro-Mechanical Systems (MEMS). This device provides great assets in terms of process repeatability and integration of actuation mechanisms. This tactile interface is based on an array of 4x4 vibrating micro-actuators with 2 mm spatial resolution, providing a discrete stimulation of skin mechanoreceptors by vertical vibration. The actuation mechanism is based on the deflection of polymer or metallic membranes of various shapes. The concept we designed is mainly aimed to give back tactile sensations similar to textures, with possible applications for e-commerce and entertainment, or for the medical world. The actuation mechanism of this device is magnetostatic, based on the interaction between Copper coils and small-sized NdFeB magnets. Realization aspects and actual developments are also presented in this article.
Complexity and Succinctness Issues for Linear-Time Hybrid Logics
Authors: Laura Bozzelli, Ruggero Lanotte
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

Full linear-time hybrid logic (HL) is a non-elementary and equally expressive extension of standard LTL + past obtained by adding the well-known binder operators ¿ and ¿. We investigate complexity and succinctness issues for HL in terms of the number of variables and nesting depth of binder modalities. First, we present direct automata-theoretic decision procedures for satisfiability and model-checking of HL, which require space of exponential height equal to the nesting depth of binder modalities. The proposed algorithms are proved to be asymptotically optimal by providing matching lower bounds. Second, we show that for the one-variable fragment of HL, the considered problems are elementary and, precisely, Expspace-complete. Finally, we show that for all 0 ≤ h < k, there is a succinctness gap between the fragments HL k and HL h with binder nesting depth at most k and h, respectively, of exponential height equal to k ¿ h.
Root-Labeling
Authors: Christian Sternagel, Aart Middeldorp
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

In 2006 Jambox, a termination prover developed by Endrullis, surprised the termination community by winning the string rewriting division and almost beating AProVE in the term rewriting division of the international termination competition. The success of Jambox for strings is partly due to a very special case of semantic labeling. In this paper we integrate this technique, which we call root-labeling, into the dependency pair framework. The result is a simple processor with help of which T T T 2 surprised the termination community in 2007 by producing the first automatically generated termination proof of a string rewrite system with non-primitive recursive complexity (Touzet, 1998). Unlike many other recent termination methods, the root-labeling processor is trivial to automate and completely unsuitable for producing human readable proofs.
Modeling Business within a UML-Based Rigorous Software Development Approach
Authors: Egidio Astesiano, Gianna Reggio, Filippo Ricca
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

We share the viewthat software systemdevelopment and business modeling have to be aligned. In our opinion that means not only that theremust be a strict correlation between the two, but thatwe should adopt both the same conceptual frame and notation, enforcing a seamless activity flow between them. In this paper we offer an attempt at showing that such an easy bridge can be provided. To that end we present an approach, fully integrated within a UML-based rigorousmodel-drivenmethod, where business processes are viewed in the context of the overall business structure and may be modeled hierarchically at various levels of detail.
The Influence of the Faculty Attitude on the Adoption of ICTs' Innovations for Learning Purposes: Analysis of a Shared Web
Authors: María Bermúdez-Edo, Nuria Hurtado-Torres, Eulogio Cordón-Pozo
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

This work proposes that faculty attitude explains the satisfaction and using of the students of a shared web. Using a sample of 253 students, the work shows that the emotional support of faculty's member to the platform is influencing the satisfaction and usage of this platform. Meanwhile, students' background and technical support are not relevant for our sample.
A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity
Authors: Raymond Ros, Nikolaus Hansen
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

This paper proposes a simple modification of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for high dimensional objective functions, reducing the internal time and space complexity from quadratic to linear. The covariance matrix is constrained to be diagonal and the resulting algorithm, sep-CMA-ES, samples each coordinate independently. Because the model complexity is reduced, the learning rate for the covariance matrix can be increased. Consequently, on essentially separable functions, sep-CMA-ES significantly outperforms CMA-ES . For dimensions larger than a hundred, even on the non-separable Rosenbrock function, the sep-CMA-ES needs fewer function evaluations than CMA-ES .
Classification of multivariate time series using two-dimensional singular value decomposition
Authors: Xiaoqing Weng, Junyi Shen
Venue: Knowledge-Based Systems (2008)

Multivariate time series (MTS) are used in very broad areas such as multimedia, medicine, finance and speech recognition. A new approach for MTS classification using two-dimensional singular value decomposition (2dSVD) is proposed. 2dSVD is an extension of standard SVD, it captures explicitly the two-dimensional nature of MTS samples. The eigenvectors of row-row and column-column covariance matrices of MTS samples are computed for feature extraction. After the feature matrix is obtained for each MTS sample, one-nearest-neighbor classifier is used for MTS classification. Experimental results performed on five real-world datasets demonstrate the effectiveness of our proposed approach.