ppxscal/embedding_network huggingface dataset:
Variability-Driven Selection of Services for Service Compositions
Authors: Kai Petersen, Johannes Maria Zaha, Andreas Metzger
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

In order to deliver services that realize their requirements at low cost, in short time, and with high quality, service engineers reuse existing services for building composite services. For each service that is part of such a composite service and which is offered by a service provider, a service level agreement has to be established and the quality of service has to be monitored. Therefore, in order to keep service management controllable, the overall number of services across all service compositions that are maintained by an organization should be as small as possible. However, currently there exists no technique that would support service engineers in selecting such a minimal set of services when building composite services. By drawing on research results from software product line engineering, we define a service selection process (SeVAR) that exploits the similarities in the requirements in order to select the minimal set of services that achieves the best coverage of those requirements.
MV-algebras with internal states and probabilistic fuzzy logics
Authors: Tommaso Flaminio, Franco Montagna
Venue: International Journal of Approximate Reasoning (2009)

In this paper we enlarge the language of MV-algebras by a unary operation @s equationally described so as to preserve the basic properties of a state in its original meaning. The resulting class of algebras will be called MV-algebras with internal state (or SMV-algebras for short). After discussing some basic algebraic properties of SMV-algebras, we apply them to the study of the coherence problem for rational assessments on many-valued events. Then we propose an algebraic treatment of the Lebesgue integral and we show that internal states defined on a divisible MV"@D-algebra can be represented by means of this more general notion of integral.
Prediction of Ship Pitching Based on Support Vector Machines
Authors: Li-hong Sun, Ji-hong Shen
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Ship pitching influences mostly ship motion, it's important to study ship pitching modeling and prediction in order to improve ship's seaworthiness. Based on the random character of ship movement, this paper put forward a method for prediction of ship pitching movement with SVM. Based on the phase-space reconstruction theory, the method, the characteristic, and the selecting of the key parameters in the modeling is discussed. Using support vector machine model to predict ship pitching series, the RBF kernel function is introduced, which simplified the course of solving non-linear problems, It is shown by the study case that the model proposed in the paper has better generalization and prediction accuracy.
A "CS 1.5" introduction to web programming
Authors: Marty Stepp, Jessica Miller, Victoria Kirst
Venue: ACM SIGCSE Bulletin (2009)

Web programming is increasing rapidly in importance at the university level, yet there is no consensus about when and how it should be incorporated into the computer science curriculum. This paper describes our results in teaching an experimental introductory web programming course at the University of Washington that has had great success in attracting large numbers of students from inside and outside the computer science major. The course requires CS1 as a prerequisite, striking a good balance between making the course open to non-majors but also more rigorous for students with programming background. We classify the course as "CS 1.5" because many of our students take it between CS1 and CS2. We use our evaluation data to argue that a web programming course at this level leads to a great deal of student interest and enthusiasm, broadens the reach of computer science, and provides a valuable service to other departments.
Evaluation of automatic guided vehicle systems
Authors: Sigal Berman, Edna Schechtman, Yael Edan
Venue: Robotics and Computer-Integrated Manufacturing (2009)

This paper presents a methodology for detailed evaluation of autonomous automated guided vehicles systems (AGVS) used for material handling. The methodology includes: stand-alone sub-module evaluation, including comprehensive simulations and statistical analysis of the system's sub-modules, along with hardware validation; quantitative system evaluation for integrated system performance investigation; and structured qualitative analyses for identifying strengths and weaknesses not readily apparent. The defined performance measures include aspects from both multi-robot and AGV fields. The developed methodology provides a systematic way to model, experiment with, analyze, and compare different AGVS control methods. To demonstrate the methodology, it was applied to evaluate a recently developed decentralized AGVS control method.
Internet Call Delay on Peer to Peer and Phone to Phone VoIP Network
Authors: Kashif Nisar, Halabi Hasbullah, Abas Md Said
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

VoIP (Voice over Internet Protocol) is a technology that enables the routing of voice conversations over any IPbased network such as the public Internet. Separate and distinct client, gateway and call control functions that ability to support Peer-to-Peer, PC-to-telephone, telephone-to-PC and telephone-to-telephone scenarios. During transmission, the traffic loading and other factors in the IP (Internet Protocol) network may cause packets to be lost. Three parameters emerge as the primary factors affecting voice quality within networks that offer VoIP technologies: clarity, end-to-end delay and echo delayed. The objective of this research is to check internet call delay over VoIP on Peer-to-Peer and telephone-to-telephone communication. The methodology used Sources of echo for test different type of call over VoIP. We used IPv4 (Internet Protocol Version 4), CISCO 3700 Series Router and telephone sets for experimentation. We checked QoS (Quality of Service) development on various sample signals. The tests were used templates varied in loudness,speech continuity, background noise and delay. We analyzed both male and female voices for results.
Do you need general principles or concrete heuristics?: a model for categorizing usability criteria
Authors: Stefan Cronholm, Vince Bruno
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

This paper analyses the character of usability criteria found in lists, which are used for interface design and evaluation. In order to understand usability criteria and relations between different criteria, a categorization of six usability criteria lists has been performed. The analysis has shown that the formulations of criteria reside on different abstraction levels. The results consist of two knowledge contribution. The first contribution is a hierarchical categorization model. The role of this multilevel abstraction hierarchy is to support practical problem solving processes by enabling and supporting the explicit articulation of criteria for a given context. The second contribution is a categorization of usability criteria. The aim of this categorization is to support the understanding of how different usability criteria relate (e.g. overlap or complement) to each other and highlight possible gaps.
Brief paper: Lyapunov-Krasovskii functional for uniform stability of coupled differential-functional equations
Authors: Keqin Gu, Yi Liu
Venue: Automatica (Journal of IFAC) (2009)

This article discusses the Lyapunov-Krasovskii functional approach for the stability problem of coupled differential-functional equations. Such systems include, as special cases, many types of time-delay systems, including the lossless propagation model, some neutral time-delay systems and singular time-delay systems. After the general stability theory, the special case of coupled differential-difference equations is discussed, and the necessity for the existence of quadratic Lyapunov-Krasovskii functional is established. Discretization is used to render the stability criterion to an LMI form.
Proceedings of the Second Workshop on Isolation and Integration in Embedded Systems
Authors: Michael Engel, Jörg Nolte
Venue: European Conference on Computer Systems (2009)

Embedded systems developers today are confronted with a large variety of challenges in the design and implementation of a system. Issues such as co-location of different applications on a single hard- or software platform ("co-habitation"), platform integration of different embedded operating environments as well as safety and protection of embedded software systems require novel approaches to embedded systems development as well as the adaptation of technologies from mainframe and desktop computing, like virtualization and emulation. This, in turn, will change traditional embedded design processes to include hardware and software of growing complexity. This workshop aims to bring together researchers and developers from all areas of embedded systems in order to create a lively discussion of these novel approaches in integration and isolation of embedded systems and the associated challenges and prospects.
Tunable frequency versatile filters implementation using minimum number of passive elements
Authors: Jinguang Jiang, Yigang He
Venue: Analog Integrated Circuits and Signal Processing (2009)

Two new universal active current-mode filters are proposed, one topology of which is with three inputs and one output, the other prototype is with single input and three outputs counterpart. One proposed circuit employs two current conveyors, two grounded capacitors and two resistors, wherever the other proposed circuit employs two current conveyors, two grounded capacitors and two multi-input, multi-output Operational Transconductance Amplifiers(OTA) as variable resistor for tuning the cutoff frequency of realized filters. Without changing the passive elements, the proposed circuits employ features of multifunctional, convenient for integration, low sensitivities and simple in structure.
Definition of the Constraint with Spatial Characters
Authors: Shiguang Ju, Yi Gu, Zhu Tang, Weihe Chen
Venue: International Journal of Distributed Sensor Networks (2009)

With the development of the RBAC applications, the spatial characters of those protected data objects have to be considered in many fields. In most cases, the permissions of the same user's access will be changed when the users' location changed. The roles played by the same user may be different since their spatial location is changing and then this user would have the different access authorizations in different spatial locations. Generally speaking, the permissions assigned to users depend on their position in a reference space: users often belong to well-defined categories; objects to which permissions must be granted are located in that space; access control policies must grant some privileges based on the positions of objects/users. Some considerable efforts have been recently devoted to the research of secure spatial database systems which guarantee high security and privacy. Especially the integration of the spatial dimension into RBAC-based models has been the hot topic as a consequence of the growing relevance of geo-spatial information in advanced GIS and mobile applications. In the context of mobile applications, spatial constraints are very important for supporting the definition and maintenance of access control policy. Constraint is an important matter of role-based access control policy. It is enforced on special roles in order to maintain the system security. There is only one constraint specified in the traditional RBAC, which is used to enforce the Separation of Duty (SoD) constraint. In this paper, according to the analysis of the spatial features of those protected spatial data object, combining the necessity of spatial constraints and the non-conflict conditions of spatial constraints with the satisfiability of spatial constraints sets and relevance between the different classes of constraints, the constraints with spatial characters are divided into three different classes: the constraints on spatial region, spatial separation of duty constraint, and constraints on cardinality of spatial role activation. We also present the relationship between the different constraints.
Soft lists: a native index structure for NOR-flash-based embedded devices
Authors: Li-Pin Chang, Chen-Hui Hsu
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Efficient data indexing is significant to embedded devices, because both CPU cycles and energy are very precious resources. Soft lists, a new index structure for embedded devices with NOR flash, are proposed. The challenge of data indexing over NOR flash is that data update and pointer update may recursively trigger each other. Our approach is to allow a bounded number of probes when a pointer is de-referenced. By this way update and garbage collection is largely simplified, because data can be moved around physical locations without invalidating any pointers. Even better, search with soft lists is very fast, because the probes provide opportunities of forward random skips. Soft lists are evaluated and compared against tree-based index, and soft lists are shown simple but efficient.
GPU acceleration of a production molecular docking code
Authors: Bharat Sukhwani, Martin C. Herbordt
Venue: Proceedings of 2nd Workshop on General Purpose Processing on Graphics Processing Units (2009)

Modeling the interactions of biological molecules, or docking, is critical to both understanding basic life processes and to designing new drugs. Here we describe the GPU-based acceleration of a recently developed, complex, production docking code. We show how the various functions can be mapped to the GPU and present numerous optimizations. We find which parts of the problem domain are best suited to the different correlation methods. The GPU-accelerated system achieves a speedup of at least 17.7x with respect to a single core and 6.1x with respect to four cores for all likely problems sizes. This makes it competitive with FPGA-based systems for small molecule docking, and superior for proteinprotein docking.
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
Authors: Morten Kühnrich, Stefan Schwoon, Jiří Srba, Stefan Kiefer
Venue: Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009 (2009)

We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes after a finite number of steps. Previously known approaches considered only bounded semirings where there are no infinite descending chains. The main novelty of our work is that we deal with semirings without the boundedness restriction. Our study is motivated by several applications from interprocedural dataflow analysis. We demonstrate how the reachability problem for weighted pushdown automata can be reduced to solving equations in the framework mentioned above and we describe a few applications to demonstrate its usability.
Real-time Rigid-body Visual Tracking in a Scanning Electron Microscope
Authors: Bradley E. Kratochvil, Lixin Dong, Bradley J. Nelson
Venue: International Journal of Robotics Research (2009)

Robotics continues to provide researchers with an increasing ability to interact with objects at the nanoscale. As microrobotic and nanorobotic technologies mature, more interest is given to computer-assisted or automated approaches to manipulation. Although actuators are currently available that enable displacement resolutions in the subnanometer range, improvements in feedback technologies have not kept pace. Thus, many actuators that are capable of performing nanometer displacements are limited in automated tasks by the lack of suitable feedback mechanisms. This paper proposes the use of a rigid-model-based method for end-effector tracking in a scanning electron microscope to aid in enabling more precise automated manipulations and measurements. These models allow the system to leverage domain-specific knowledge to improve performance in a challenging tracking environment.
Broadcasting in sensor networks: the role of local information
Authors: Sundar Subramanian, Sanjay Shakkottai, Ari Arapostathis
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Flooding based querying and broadcasting schemes have low hop-delays of Θ (1/R(n) to reach any node that is a unit distance away, where R(n) is the transmission range of any sensor node. However, in sensor networks with large radio ranges, flooding based broadcasting schemes cause many redundant transmissions leading to a broadcast storm problem. In this paper, we study the role of geographic information and state information (i.e., memory of previous messages or transmissions) in reducing the redundant transmissions in the network. We consider three broadcasting schemes with varying levels of local information where nodes have: (i) no geographic or state information, (ii) coarse geographic information about the origin of the broadcast, and (iii) no geographic information, but remember previously received messages. For each of these network models, we demonstrate localized forwarding algorithms for broadcast (based on geography or state information) that achieve significant reductions in the transmission overheads while maintaining hop-delays comparable to flooding based schemes. We also consider the related problem of broadcasting to a set of "spatially uniform" points in the network (lattice points) in the regime where all nodes have only a local sense of direction and demonstrate an efficient "sparse broadcast" scheme based on a branching random walk that has a low number of packet transmissions. Thus, our results show that even with very little local information, it is possible to make broadcast schemes significantly more efficient.
A scientific workflow construction command line
Authors: Paul T. Groth, Yolanda Gil
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Workflows have emerged as a common tool for scientists to express their computational analyses. While there are a multitude of visual data flow editors for workflow construction, to date there are none that support the input of workflows using natural language. This work presents the design of a hybrid system that combines natural language input through a command line with a visual editor.
Context-Aware Task Prompting: Sustaining of Supported Employment for People with Severe Mental Illness
Authors: Yao-Jen Chang, Hsin Yu Hsu, Wan Chih Chang, Shu-Min Peng, Yan-Ru Chen, Tsen Yun Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In collaboration with NGOs dedicated to supported employment programs, a novel Context-Aware Task Prompting system (CATPro) is presented in this research to increase work and life independence for cognitive-impaired patients such as people with traumatic brain injury, cerebral palsy, mental retardation, schizophrenia, dementia, and Alzheimer's disease. Preliminary results show the prototype is very reliable and accurate with 100% prompting success.
Project scheduling using a competitive genetic algorithm
Authors: J. Magalhães-Mendes
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.
Model-driven eGovernment interoperability: A review of the state of the art
Authors: Vassilios Peristeras, Konstantinos Tarabanis, Sotirios K. Goudos
Venue: Computer Standards Interfaces (2009)

This paper reviews the state of the art in the area of enhancing eGovernment interoperability by using common models and/or ontologies. This area has currently become a very active research field. We identify and present a significant number (>40) of relevant efforts. These initiatives are grouped into categories based on the owner, scope and modelling perspective of each project. We then focus on the cases that build generic and universal eGovernment representations and models. We analyse, evaluate and rate them using an additional set of criteria. We end up with conclusions and possible directions for the exploitation and usage of these models.
A methodology for the development of special-purpose function architectures
Authors: Raymond A. Liuzzi, P. Bruce Berra
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The research described in this paper concerns a generalized methodology for the development of special-purpose function architectures (SPFA). The development methodology can be used to introduce the concept of an SPFA approach to an organization. The methodology provides an organized set of processes that can be followed to tailor the development of SPFAs to specific applications. This methodology consists of processes for identification, creation, testing, evaluation, and substitution of SPFAs. It permits a user to carefully select sets of database management functions as candidates to be moved from software into hardware, develop one or more SPFAs that perform this function, and evaluate the consequences of having the function performed as a new hardware architecture. A set of tools/components with which to carry out this methodology are included in the environment of a proposed database machine architecture development facility.