ppxscal/embedding_network huggingface dataset:
An approach to reverse engineering of C programs to simulink models with conformance testing
Authors: Indranil Saha Saha, Kuntal Chakraborty, Suman Roy, B. VishnuVardhan Reddy, Venkatappaiah Kurapati, Vishesh Sharma
Venue: Proceedings of the 2nd India software engineering conference (2009)

To reuse legacy C code effectively in Model Based Development process, it is highly desirable that the code be converted to Simulink model, a de facto standard in many industrial application domains, such as avionics and automotive control. In this paper we present the design methodology of a tool that translates a C code to equivalent Simulink model with proper correctness assurance.
HTab: a Terminating Tableaux System for Hybrid Logic
Authors: Guillaume Hoffmann, Carlos Areces
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Hybrid logic is a formalism that is closely related to both modal logic and description logic. A variety of proof mechanisms for hybrid logic exist, but the only widely available implemented proof system, HyLoRes, is based on the resolution method. An alternative to resolution is the tableaux method, already widely used for both modal and description logics. Tableaux algorithms have also been developed for a number of hybrid logics, and the goal of the present work is to implement one of them. In this article we present the implementation of a terminating tableaux algorithm for the hybrid logic H(@,A). The performance of the tableaux algorithm is compared with the performances of HyLoRes, HyLoTab (a system based on a different tableaux algorithm) and RacerPro. HTab is written in the functional language Haskell, using the Glasgow Haskell Compiler (GHC). The code is released under the GNU GPL and can be downloaded from http://hylo.loria.fr/intohylo/htab.php.
Model-based Decentralized Control of Time-delay Teleoperation Systems
Authors: Ali Shahdi, Shahin Sirouspour
Venue: International Journal of Robotics Research (2009)

Recently, within a centralized control framework, the authors proposed a time-delay reduction method to achieve improved transparency in time-delay teleoperation. In this paper, a decentralized version of the controller is introduced that can further enhance the teleoperation transparency and robust stability by allowing the use of local delay-free measurements in local master/slave controllers. State/observation transformations are proposed that produce delay-free dynamics/measurements from the perspective of the local controllers at the master and slave stations. It is shown that the use of local suboptimal linear quadratic Gaussian master and slave controllers results in a delayed state perturbation term in the closed-loop dynamics. The stability of the system is then analyzed using a delay-dependent frequency sweeping test. The controllers employ a simple switching logic to handle large variations in the environment dynamics from free motion to rigid contact. The performance and robustness of the new decentralized controller are compared with those of the centralized controller using numerical analysis. Experimental results demonstrate the effectiveness of the proposed approach.
Demonstration of interactive teleolfaction with movie
Authors: N. Choh, B. Wyszynsky, H. Takushima, N. Nitikarn, M. Kinoshita, T. Nakamoto
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Recently, delivery technologies of visual and auditory information have been established. When movie together with smell information is available, people have more real reality. Our group has studied odor presentation with visual and auditory information using an olfactory display [1]. In VR2007, we have demonstrated the game of cooking with scent using olfactory display. In addition, we have studied smell sensing and reproduction system simultaneously with visual information. However, the function of transmitting sensory information to remote site has not been realized. Recently, we developed the teleolfaction system synchronized with tele-vision system using odor sensor and olfactory display. Moreover, the interactivity is included in this creative showcase. The system consists of recording system and reproduction system as is shown in Fig. 1. In the recording system, an output pattern from an array of QCM (Quartz Crystal Microbalance) sensors with partially overlapped specificities is recognized using a neural network implemented into a PC. An odor concentration is also measured using one of sensors. Moreover, a web camera simultaneously captures vision of odor sources. In reproduction system located away from the recording system, the olfactory display emits the smell synchronized with movie on the computer screen after the data from the recording system are received via the Internet. A user at remote site can control the position of the sensing nozzle using mobile stage via the Internet. The web camera mounted on that stage captures the image around the sensing nozzle. The user can perceive sensation interactively when he/she controls the position of the mobile stage. An example of the sensor response to orange flavor during the stage movement is shown in Fig. 2. When the sensing nozzle is located just above the odor source, the response has the peak and the user sniffs the strongest smell at the remote site.
Constraint BasedWorld Modeling
Authors: Daniel Göhring, Heinrich Mellmann, Kataryna Gerasymova, Hans-Dieter Burkhard
Venue: Fundamenta Informaticae (2008)

Common approaches for robot navigation use Bayesian filters like particle filters, Kalman filters and their extended forms. We present an alternative and supplementing approach using constraint techniques based on spatial constraints between object positions. This yields several advantages. The robot can choose from a variety of belief functions, and the computational complexity is decreased by efficient algorithms. The paper investigates constraint propagation techniques under the special requirements of navigation tasks. Sensor data are noisy, but a lot of redundancies can be exploited to improve the quality of the result. We introduce two quality measures: The ambiguity measure for constraint sets defines the precision, while inconsistencies are measured by the inconsistency measure. The measures can be used for evaluating the available data and for computing best fitting hypothesis. A constraint propagation algorithm is presented.
Shopping search engine technology based on services
Authors: Lihailong Lihailong, Liuyu Liuyu
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Focused on shopping website and e-commerce area, this article discusses the technology of specific search engine service platform. The overall goal of the platform is to provide a new web shopping pattern that is more convenient, powerful, and swift for consumers. This effort promotes the flat structure development to e-commerce platform. At the same time, the search engine service platform will strive to provide a Service-based Integration Bus, which combines the shopping-information services and shopping-process services together for consumers, suppliers and delivery companies.
Research on Grid-based Short-term Traffic Flow Forecast Technology
Authors: Wang Xinying, Juan Zhicai, Liu Xin, Mei Fang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Short-term traffic flow forecast is an important topic in the research field of intelligent transportation systems. The article analyses the preliminary results in the short-term traffic flow forecast, takes full advantage of the characteristics of grid technology, and builds a model based on chaos theory and neural network. It uses grid resource management mechanisms and migration strategies to solve issues of effectiveness, and proposes the algorithm of minimum price for Self-Governing Domain on the aspect of resource management to improve the efficiency and performance.
Matrix Order Reduction by Nodal Analysis Formulation and Relaxation-Based Fast Simulation for Power/Ground Plane
Authors: Tadatoshi Sekine, Yuichi Tanji, Hideki Asai
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper describes the matrix order reduction method by the nodal analysis formulation and the application of relaxation-based simulation technique to interconnect and plane networks. First, the characteristics of the power/ground plane networks are considered. Next, the formulation of the plane network by nodal analysis (NA) method is suggested. Furthermore, application and estimation results of the relaxation-based numerical analyses are shown. Finally, it is confirmed that the relaxation-based methods improved by the suggested formulation are much more efficient than the conventional direct-based methods.
Finding canonical behaviors in user protocols
Authors: Walter C. Mankowski, Peter Bogunovich, Ali Shokoufandeh, Dario D. Salvucci
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

While the collection of behavioral protocols has been common practice in human-computer interaction research for many years, the analysis of large protocol data sets is often extremely tedious and time-consuming, and automated analysis methods have been slow to develop. This paper proposes an automated method of protocol analysis to find canonical behaviors --- a small subset of protocols that is most representative of the full data set, providing a reasonable "big picture" view of the data with as few protocols as possible. The automated method takes advantage of recent algorithmic developments in computational vision, modifying them to allow for distance measures between behavioral protocols. The paper includes an application of the method to web-browsing protocols, showing how the canonical behaviors found by the method match well to sets of behaviors identified by expert human coders.
Context for Models of Concurrency
Authors: Peter Bubenik
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Many categories have been used to model concurrency. Using any of these, the challenge is to reduce a given model to a smaller representation which nevertheless preserves the relevant computer-scientific information. That is, one wants to replace a given model with a simpler model with the same directed homotopy-type. Unfortunately, the obvious definition of directed homotopy equivalence is too coarse. This paper introduces the notion of context to refine this definition.
Signs: Lettering in the Environment
Authors: Phil Baines
Venue:  (2008)

This book focuses on the letterforms and typography in public places from road signs to building names that help us to navigate cities and countryside and contribute to a sense of place. Featuring examples from around the world the book discusses the function and execution of signage. Visually led Signs contains 700 color images grouped together thematically and described in extended captions showing the best current examples alongside historical material. Part resource part celebration the book forms an exciting visual compendium.
A supply chain application of fuzzy set theory to inventory control models - DRP system analysis
Authors: Jui-Lin Wang
Venue: Expert Systems with Applications: An International Journal (2009)

As competition abounds, the efficient solution on inventory control of a DRP's (Distribution Requirement Planning) supply chain management is a vital success factor for companies in today's business world. A stochastic program of market distribution and its deterministic equivalent control program is approximated by a multi-echelon lot-sizing model based on ''risk inflated effective demands''. The DRP-decomposition of this approximate model, which can be used with allocation application of Fuzzy Set Theory, is then introduced. The aim of this paper is to find methods to address traditional DRP's weaknesses and to improve the performances of DRP systems. In this paper, the field of continuous review model will be focused in, and a new method on the model with triangular fuzzy numbers (input data) will be presented. By using the method, the maximum of order quantity under a minimum of total cost can be obtained. In many previous research, authors take a precise number approximately as the representative of a fuzzy number. But the precise number can not reflect the property of fuzzy inventory control number fully. Therefore, in a numerical example of this paper, in addition to providing a transformation for reducing a fuzzy number into a closed interval by introducing the interval mean value concept proposed by Dubios and Prude, this fuzzy system can be transformed into a more precise diagnosis system for channel members in the supply chain distribution organization.
WSMO-MX: A hybrid Semantic Web service matchmaker
Authors: Matthias Klusch, Frank Kaufer
Venue: Web Intelligence and Agent Systems (2009)

The WSMO-MX service matchmaker applies different matching filters to retrieve Semantic Web services written in a dialect of the prominent service description language WSML-Rule. For this purpose, WSMO-MX recursively computes logic-based and syntactic similarity-based matching degrees and returns a ranked set of services that are semantically relevant to a given query. The matching filters perform ontology-based type matching, logical constraint matching, and syntactic matching. In this paper, we present the service description language WSML-MX, the hybrid matchmaker WSMO-MX for WSML services converted to WSML-MX, and the results of our experimental evaluation of its performance in terms of recall and precision over the test collection WSML-TC2.
On UML modeling of computational interfaces & interactions in the UML4oDP computational language
Authors: Oussama Reda, Bouabid El Ouahidi, Daniel Bourget
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

We analyze in this work computational interfaces and interactions signatures in order to consistently model them within the UML4ODP computational metamodel. Computational interfaces in the computational language are of three kinds (signals, operations and streams). We show that computational interfaces are classified in two main classes instead of three: Functional and stream interfaces. We also demonstrate that interactions are of two kinds, namely; Parameterized and flowing interactions. Then, we show that only two kinds of parameterized interactions have to be taken into account, Primitive and Compound interactions, primitives are being incoming or outgoing interactions. Based on these, we provide a UML metamodel of interfaces and interactions signatures. Finally, we show how our modeling choices prove to be pertinent to specify OCL constraints on refinements of interactions to define end-to-end QoS and bindings between computational interfaces.
Autonomic Computing in Medical Informatics: Accessing and Retrieval of EMR
Authors: K. Chandrasekharan, Ashwini Rao, B. Sruthi
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Medical informatics is an interdisciplinary field of research, where a great deal of collaboration is required to achieve efficient solutions. In this paper we bring in the concept of implementing autonomic computing in medical informatics. The work is in the aspect of maintaining and accessing patient’s medical records and/or further retrieval of data in an efficient way with the role of autonomic computing in it. We exhibit a solution in the form of an automated system for EMR (electronic medical record), in this context.
Simulating pandemic influenza preparedness plans for a public university: a hierarchical system dynamics approach
Authors: Tim Lant, Megan Jehn, Cody Christensen, Ozgur M. Araz, John W. Fowler
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Pandemic influenza preparedness plans strongly focus on efficient mitigation strategies including social distancing, logistics and medical response. These strategies are formed by multiple decisions-makers before pandemic outbreak and during the disaster by decision makers in local communities, states and nationwide. Depending on the community that will be affected by pandemic influenza, different strategies should be employed to decrease the severity of the disaster in multiple dimensions of social life. In this paper, a system dynamics methodology is applied to model the population behaviors and the effects of pandemic influenza on a public university community. The system is simulated for multiple non-pharmaceutical interventions with several policies that can be employed by local decision makers. System components are constructed from the pandemic influenza preparedness plan of one of the largest universities in the country. The policies and the decisions are tested by simulation runs and evaluations of the mitigation strategies are presented.
Nearest neighbor editing aided by unlabeled data
Authors: Donghai Guan, Weiwei Yuan, Young-Koo Lee, Sungyoung Lee
Venue: Information Sciences: an International Journal (2009)

This paper proposes a novel method for nearest neighbor editing. Nearest neighbor editing aims to increase the classifier's generalization ability by removing noisy instances from the training set. Traditionally nearest neighbor editing edits (removes/retains) each instance by the voting of the instances in the training set (labeled instances). However, motivated by semi-supervised learning, we propose a novel editing methodology which edits each training instance by the voting of all the available instances (both labeled and unlabeled instances). We expect that the editing performance could be boosted by appropriately using unlabeled data. Our idea relies on the fact that in many applications, in addition to the training instances, many unlabeled instances are also available since they do not need human annotation effort. Three popular data editing methods, including edited nearest neighbor, repeated edited nearest neighbor and All k-NN are adopted to verify our idea. They are tested on a set of UCI data sets. Experimental results indicate that all the three editing methods can achieve improved performance with the aid of unlabeled data. Moreover, the improvement is more remarkable when the ratio of training data to unlabeled data is small.
Design of Sparse Concentric Multi-circular Array Using Micro-Genetic Optimum Algorithm
Authors: Sun Xuejun, Gan Quan, Tang Bin
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

On the condition that the aperture and the element number of the array are given and the array is azimuthally symmetric required, using high-performance micro-genetic optimum algorithm, the radius of each circle subarray of the sparse concentric multi-circular array is optimised to reduce the sidelobe level (SLL) of the array pattern. Computer simulations show the SLLs of the optimised 7-arm concentric circular array and the optimised 5-arm concentric circular array have been improved greatly compared to the proportional spacing condition and the angle ambiguities have not been generated.
Semantic Domains for Combining Probability and Non-Determinism
Authors: Regina Tix, Klaus Keimel, Gordon Plotkin
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We present domain-theoretic models that support both probabilistic and nondeterministic choice. In [A. McIver and C. Morgan. Partial correctness for probablistic demonic programs. Theoretical Computer Science, 266:513-541, 2001], Morgan and McIver developed an ad hoc semantics for a simple imperative language with both probabilistic and nondeterministic choice operators over a discrete state space, using domain-theoretic tools. We present a model also using domain theory in the sense of D.S. Scott (see e.g. [G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. W. Mislove, and D. S. Scott. Continuous Lattices and Domains, volume 93 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2003]), but built over quite general continuous domains instead of discrete state spaces. Our construction combines the well-known domains modelling nondeterminism - the lower, upper and convex powerdomains, with the probabilistic powerdomain of Jones and Plotkin [C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pages 186-195. IEEE Computer Society Press, 1989] modelling probabilistic choice. The results are variants of the upper, lower and convex powerdomains over the probabilistic powerdomain (see Chapter 4). In order to prove the desired universal equational properties of these combined powerdomains, we develop sandwich and separation theorems of Hahn-Banach type for Scott-continuous linear, sub- and superlinear functionals on continuous directed complete partially ordered cones, endowed with their Scott topologies, in analogy to the corresponding theorems for topological vector spaces in functional analysis (see Chapter 3). In the end, we show that our semantic domains work well for the language used by Morgan and McIver.
Comparing human and automatic thesaurus mapping approaches in the agricultural domain
Authors: Boris Lauser, Gudrun Johannsen, Caterina Caracciolo, Willem Robert van Hage, Johannes Keizer, Philipp Mayr
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

Knowledge organization systems (KOS), like thesauri and other controlled vocabularies, are used to provide subject access to information systems across the web. Due to the heterogeneity of these systems, mapping between vocabularies becomes crucial for retrieving relevant information. However, mapping thesauri is a laborious task, and thus big efforts are being made to automate the mapping process. This paper examines two mapping approaches involving the agricultural thesaurus AGROVOC, one machine-created and one human created. We are addressing the basic question "What are the pros and cons of human and automatic mapping and how can they complement each other?" By pointing out the difficulties in specific cases or groups of cases and grouping the sample into simple and difficult types of mappings, we show the limitations of current automatic methods and come up with some basic recommendations on what approach to use when.
Real-time FFT with pre-calculation
Authors: Wen-Fang Yen, Shingchern D. You, Yung-Chao Chang
Venue: Computers and Electrical Engineering (2009)

The technique of pre-calculation process for real-time FFT is presented in this paper. The real-time FFT algorithm simultaneously constructs and computes the butterfly modules while the incoming data is collected. Thus, the time to complete the FFT calculation is shorter when compared to the conventional FFT. The proposed pre-calculation process that can further reduce this time is verified. Furthermore, depending on the computing capability of the processor, different number of pre-calculation stages for better performance is also suggested in the paper. For a critical mission requiring a shorter time to complete the FFT calculation, the proposed approach is a better choice.