ppxscal/embedding_network huggingface dataset:
Modeling product engineer and manufacturing activity in automobile industry
Authors: João Ferreira, André Carvalho, João Pimentel, Marco Guedes, Francesco Furini, Nuno Silva
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

Designing and consequent assembling of a new vehicle is a complex process as it requires close coordination and inputs from a number of disciplines in developing a number of systems and sub-systems in the vehicle that should fit within the confined vehicle space, function and provide the customers an acceptable combination of all relevant vehicle attributes. Understanding how these processes interact and how they are aligned with other while they should support the tasks involved in the conception of a new vehicle at a minimum time and cost is a difficult task. The first step to achieve this goal is the definition of a new UML profile (called VDML, Vehicle Development Modeling Language) based on the extension mechanics of UML (industry standard language) to assist business process description and profit consequent from the improvements achieved by the high level vision. To show the benefits of this new language applied to this specific business we model the engineer and manufacturing activity processes using VDML
A probabilistic method to determine the minimum leakage vector for combinational designs in the presence of random PVT variations
Authors: Kanupriya Gulati, Nikhil Jayakumar, Sunil P. Khatri, D. M. H. Walker
Venue: Integration, the VLSI Journal (2008)

The control of leakage power consumption is a growing design challenge for current and future CMOS circuits. Among existing techniques, 'parking' a circuit in a minimum leakage state during its standby mode of operation requires minimal circuit modification and results in significant leakage reduction. In this paper we present a heuristic approach (referred to as MLVC) to determine the input vector which minimizes leakage for a combinational design. This approach utilizes approximate signal probabilities of internal nodes to aid in finding the minimum leakage vector. We utilize a probabilistic heuristic to select the next gate to be processed as well as to select the best state of the selected gate. A fast SAT solver is employed to ensure the consistency of the assignments that are made in this process. A variant of MLVC, referred to as MLVC-VAR, is also presented. MLVC-VAR includes the effect of random variations in leakage values due to process, voltage and temperature (PVT) variations. Including the effect of PVT variations for determining minimum leakage vector is crucial because leakage currents have an exponential dependence on power supply, threshold voltage and temperature. To the best of the authors' knowledge, no other minimum leakage vector determination work has to date included the effect of PVT variations. Experimental results indicate that our MLVC method has very low runtimes, with excellent accuracy compared to existing approaches. Further, the comparison of the mean and standard deviation of the circuit leakage values for MLVC with MLVC-VAR and an existing random vector generating approach proves the need for considering these variations while determining the minimum leakage vector. MLVC-VAR reports, on average, about 9.69% improvement over MLVC with similar runtimes and 5.98% improvement over the random vector generation approach with significantly lower runtimes.
Teaching and building humanitarian open source software
Authors: Ralph Morelli, Trishan de Lanerolle, Janardhan Lyengar
Venue: Journal of Computing Sciences in Colleges (2008)

This hands-on workshop will introduce participants to the world of free and open source software (FOSS) development and how to incorporate FOSS into undergraduate computing curricula. We will focus on existing humanitarian FOSS projects that the presenters are involved with. Participants will learn how FOSS projects are organized and how to set up a small scale project at their own schools. Introduction will be provided to FOSS development tools, including Eclipse, Subversion, Media WIKI, and Trac. Participants will install a development environment on their laptops and build a simple module for an existing humanitarian FOSS project. See http://www.hfoss.org for further details.
Embedding nearly-spanning bounded degree trees
Authors: Noga Alon, Michael Krivelevich, Benny Sudakov
Venue: Combinatorica (2007)

We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 &#x2212; &#x03b5;)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d &#x2265; 2 and 0 < &#x03b5; < 1, there exists a constant c = c(d, &#x03b5;) such that a random graph G(n, c/n) contains almost surely a copy of every tree T on (1 &#x2212; &#x03b5;)n vertices with maximum degree at most d. We also prove that if an (n, D, &#x03bb;)-graph G (i.e., a D-regular graph on n vertices all of whose eigenvalues, except the first one, are at most &#x03bb; in their absolute values) has large enough spectral gap D/&#x03bb; as a function of d and &#x03b5;, then G has a copy of every tree T as above.
Setplays: achieving coordination by the appropriate use of arbitrary pre-defined flexible plans and inter-robot communication
Authors: Luís Mota, Luís Paulo Reis
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

Multi-agent coordination and strategic planning are two of the major research topics in the context of RoboCup. However, innovations in these areas are often developed and applied to only one domain and a single RoboCup league, without proper generalization. Also, although the importance of the concept of Setplay, to structure the team's behaviour, has been recognized by many researchers, no general framework for the development and execution of generic Setplays has been presented in the context of RoboCup. This paper presents such a framework for high-level setplay definition and execution, applicable to any RoboCup cooperative league and similar domains. The framework is based in a standard, league-independent and flexible language that defines setplays which may be interpreted and executed at run-time through the use of inter-robot communication. The implementation of this framework in the 3D simulation league is also described with concrete examples of Setplay definition, management and execution. The first results achieved show the usefulness of this approach and motivate us to use it as the main coordination of all our teams participating in the simulation, small-size, middle-size and legged leagues of RoboCup.
Understanding mesh-based peer-to-peer streaming
Authors: Nazanin Magharei, Reza Rejaie
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

A common approach to peer-to-peer (P2P) streaming is to form a tree-based overlay coupled with push content delivery. This approach cannot effectively utilize the outgoing bandwidth of participating peers, and therefore it is not self-scaling. In contrast, swarm-like content delivery mechanisms exhibit the self-scaling property but incorporating them into live P2P streaming applications are challenging for two reasons: (i) in-time requirement of content delivery and (ii) the limited availability of future content. In this paper, we examine the key design issues and tradeoffs in incorporating swarm-like content delivery into mesh-based P2P streaming of live content. We show how overlay properties and the global pattern of content delivery could lead to the bandwidth and content bottlenecks among peers, respectively. Leveraging an organized view of the overlay, we present a global pattern for streaming content over a mesh-based overlay that can effectively utilize the outgoing bandwidth of most participating peers. We conduct ns simulation to explore the impact of overlay properties on the global pattern of content delivery and thus delivered quality to individual peers. In particular, we show that for a given scenario, there is a sweet range for peer degree in the overlay that maximizes delivered quality to individual peers with minimum buffer requirement at each peer.
Low-Cost VC Allocator Design for Virtual Channel Wormhole Routers in Networks-on-Chip
Authors: Min Zhang, Chiu-Sing Choy
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

Through low-level simulation and analysis, we find that the virtual channel allocator (VA) consumes large area and power while it is not critical in the performances of a NoC. Thus, it is possible to reduce the costs of VA with only a small penalty in network performances. This paper proposes two low-cost VA architectures: look-ahead VA and unfair VA. Compared with a general VA, the look-ahead VA reduces the number of both input VC arbiters and output VC arbiters while the unfair VA decreases the size of the output VC arbiters. Our experiments based on UMC 130 nm SP library show that the two architectures jointly save area cost by 70.95% and power consumption by 76.21% with nearly no adverse effect on network latency and throughput. To the best of our knowledge, it is the first time a VC allocator design is optimized in the context of NoC.
I/o-efficient efficient algorithms for computing contours on a terrain
Authors: Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

A terrain M is the graph of a bivariate function. We assume that M is represented as a triangulated surface with N vertices. A contour (or isoline) of M is a connected component of a level set of M. Generically, each contour is a closed polygonal curve; at "critical" levels these curves may touch each other or collapse to a point. We present I/O efficient algorithms for the following two problems related to computing contours of M: (i) Given a sequence l1 ls of real numbers, we present an I/O-optimal algorithm that reports all contours of M at heights l1 , ... , ls using O(sort(N) + T/B) I/Os, where T is the total number edges in the output contours, B is the "block size," and sort(N) is the number of I/Os needed to sort N elements. The algorithm uses O(N/B) disk blocks. Each contour is generated individually with its composing segments sorted in clockwise or counterclockwise order. Moreover, our algorithm generates information on how the contours are nested. (ii) We can preprocess M, using O(sort(N)) I/Os, into a linear-size data structure so that all contours at a given height can be reported using O(logB N + T/B) I/Os, where T is the output size. Each contour is generated individually with its composing segments sorted in clockwise or counterclockwise order.
Location Fingerprint Analyses Toward Efficient Indoor Positioning
Authors: Nattapong Swangmuang, Prashant Krishnamurthy
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Analytical models to evaluate and predict “precision”performance of indoor positioning systems based onlocation fingerprinting are lacking. Such models can be used to improve the design of positioning systems, for example by eliminating some fingerprints and reducing the size of the location fingerprint database. In this paper, we develop a new analytical model that employs proximity graphs for predicting performance of indoor positioning systems based on location fingerprinting. The model allows computation of an approximate probability distribution of error distance given a location fingerprint database based on received signal strength and its associated statistics. The performance results from the simulation and the analytical model are found to be congruent. This model alsoallows us to perform analysis of the internal structure of location fingerprints. We employ the analysis of the internal structure to identify and eliminate unnecessary location fingerprints stored in the database, thereby saving on computation while performing location estimation.
Microarray Image Converted Database - Genetic Algorithm Application in Bioinformatics
Authors: C. Y. Jiao, D. G. Li
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Genetic Algorithm in the bioinformatic can be categorised into many differet groups by the implementations they were instructed. Each approach has its own pros and cons. When making a choice between GA approaches to data mining, it is important that the scientist knows the advantages and disadvantages of each approach. In this project a suitable GA strategy will be identified and refined, based on microarray data mining.The research applies the improved GA approach to a life microarray database, provided by a biological research institution to analyse and visualise the results so as to assist further development of biological strategies for identifying disease and evaluating drug applications.
ORM in Dynamic Languages
Authors: Chris Richardson
Venue: Queue (2008)

A major component of most enterprise applications is the code that transfers objects in and out of a relational database. The easiest solution is often to use an ORM (object-relational mapping) framework, which allows the developer to declaratively define the mapping between the object model and database schema and express database-access operations in terms of objects. This high-level approach significantly reduces the amount of database-access code that needs to be written and boosts developer productivity.
Organizational Performance Measures for Business Process Management: A Performance Measurement Guideline
Authors: Vesna Bosilj-Vuksic, Ljubica Milanovic, Rok Skrinjar, Mojca Indihar-Stemberger
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This paper focuses on organizational performance measurement. It offers an overview of the literature on organizational performance measures, approaches and frameworks. Analysis indicates that organizational performance measurement is well recognized as an important part of the business process management literature. The purpose of this paper is to propose a performance measurement guideline. Defining an appropriate guideline helps to clarify and systemize this field, but also represents a critical step for business practitioners since it could influence the success of organizational performance measurement system development.
Improvement of transient stability by variation generator parameters and high speed fault clearing
Authors: S. Jalilzadeh, S. Jadid
Venue: Proceedings of the 9th International Conference on Circuits (2005)

In recent years, power systems have been operated under more stressed conditions and close to their stability limits. Due to recent blackouts, power system security has become a major concern. Under these circumstances, an important problem that is frequently considered for secure operation is the severity of transient stability. This paper presents a study on transient stability of two IEEE test systems. The influence of bus loads, generation changes, network changes and generator parameters variation on transient stability are investigated in this paper. It is shown that transient stability is improved by various parameter changes such as increase in generation, inertia constant, open circuit transient time constant, decrease in transient reactance and decrease in line reactance.
Building a National Telemedicine Network
Authors: Jader Wallauer, Douglas Macedo, Rafael Andrade, Aldo von Wangenheim
Venue: IT Professional (2008)

Motivated by the need to reduce the cost of patient transport to health centers, the authors designed a prototype national telemedicine network in Brazil.
Improved glass-PDMS-glass device technology for accurate measurements of electro-osmotic mobilities
Authors: Adrien Plecis, Yong Chen
Venue: Microelectronic Engineering (2008)

We demonstrate an improved glass-PDMS-glass device technology based on reactive ion etch of a thin PDMS layer for microfluidic channel forming and glass to glass bonding. Reactive ion etch process has been optimised to achieve a high etch rate and a minimum surface roughness. Typically, microfluidic channels of 2.5@mm height and 50@mm width are obtained on a wafer scale, providing a patternable glass-liquid interface larger than 95% of the total channel wall surface. To illustrate the capability of this technique, electrokinetic characterization of soda-lime glass (D-263) surfaces are presented.
Efficient Key Pre-distribution for Sensor Nodes with Strong Connectivity and Low Storage Space
Authors: Hung Yu Chien, Rung-Ching Chen, Annie Shen
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

One of the challenges to secure Wireless Sensor Networks (WSNs) is to design secure pair-wise key agreement between any pair of resources-limited sensors while keeping strong connectivity. In this paper, we point out the fatal security weaknesses of Cheng-Agrawal’s pair-wise key agreement scheme for WSNs, and then propose a new scheme. Compared to the existing schemes, the proposed scheme owns two outstanding merits- assurance of connectivity between any pair of nodes and security robustness against node capture attack.
Comparison of Schemes for Provision of Differentiated Availability-Guaranteed Services Using Dedicated Protection
Authors: Anders Mykkeltveit, Bjarne E. Helvik
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In the coming Next Generation Network, the introduction of new services with different Quality of Service (QoS) requirements combined with cost conscious customers who make cost/utility trade-offs, yields a need for the network operators to be able to offer different levels of guaranteed availability. Protection techniques are used to provide alternative paths to a connection in case of failure of the working path. This paper considers dedicated protection, where the bandwidth of the protection paths is reserved exclusively. The challenge is to find schemes that can provide the guaranteed availability level requested by each connection while at the same time use bandwidth efficiently. This may be achieved by applying availability-aware protection schemes that allocate only the minimum amount of backup resources needed to meet the availability requirement of each connection. In the literature, some schemes for providing differentiated availability-guaranteed services have been proposed. There has, however, been no studies that quantitatively compare different schemes. The main contribution of this paper is to provide the first comparison of schemes for differentiated availability-guaranteed services. In this paper, three schemes which vary in complexity, flexibility and bandwidth-efficiency are compared. The schemes are compared by simulation through case studies, where the common path protection scheme serves as a reference.
Construction of highly stable parallel two-step Runge-Kutta methods for delay differential equations
Authors: Z. Bartoszewski, Z. Jackiewicz
Venue: Journal of Computational and Applied Mathematics (2008)

It is shown that any A-stable two-step Runge-Kutta method of order p@? and stage order q=p@? for ordinary differential equations can be extended to the P-stable method of uniform order p=p@? for delay differential equations.
A pattern language for data warehouse schema
Authors: Hany M. Harb
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

This paper provides an overall architecture to support all levels of data access and analysis against internal and external data in a variety of formats (any data, any where). This star architecture promotes interoperability between applications and databases. It promotes query optimized data warehouse. A star schema pattern language is presented to support data ware house building. The patterns are split into four main sub models: the conceptual, the logical, the physical, and the summary sub model. The model is composed of three layers: the virtual data warehouse layer (VDW), virtual data warehouse engine (VDWE), and the end user layer (EUL). The VDW layer combines all the internal and external databases as a one virtual data warehouse. The intelligent VDWE layer provides intelligent analytical processing to the decision makers. This layer also offers administrative tools for data administration. There is a dynamic metadata repository associated with the engine to support the heterogeneous joins between these different internal and external data stores. There are associated software agents to notify the engine the exception conditions occurrences. The business rules and constraints are enforced by the engine. The end user layer (EUL) encapsulates access code and allows information technology personnel to manage and optimize the model. A case study is presented to demonstrate the paper concepts.
A Trust Management Model for P2P File Sharing System
Authors: Huafeng Wu, Chaojian Shi, Haiguang Chen, Chuanshan Gao
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Peer-to-Peer (P2P) network systems have an open and dynamic nature for sharing files and real-time data transmission. While P2P systems have already many existing and envisioned applications, the security issue of P2P systems is still worth deeply researching. Some traditional approaches mainly rely on cryptography to ensure data authentication and integrity. These approaches, however, only addressed part of the security issues in P2P systems. In this paper, we propose a trust management model for P2P file-sharing systems. We use the incomplete experience to get the trust rating in P2P systems, and use aggregation mechanism to indirectly combine and obtain other node’s trust rating. Simulation results and analysis show that our proposed trust management model can quickly detect the misbehavior peers and limit the impacts of them in a P2P file-sharing system.
Extending H-anim and X3D for advanced animation control
Authors: Yvonne Jung, Johannes Behr
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

In this paper we describe a layered approach to simplify character animation in X3D. Therefore, we present an interface and control language for specifying and synchronizing animations and similar actions at a higher level. Because this requires to have the accordant features on the lower X3D-based levels, we furthermore propose a set of nodes for realizing these demands. This includes for instance an audio node for text-to-speech that automatically calculates the actual phonemes and weighting factors for the corresponding visemes in order to achieve lip synchronization. To bridge the gap between these layers we also propose nodes for controlling animations, which are capable to convert the scripted schedules, and to mix an arbitrary number of interpolation based animations, whilst still being extensible to new concepts of on-line motion generation.
Convergent and divergent solutions of singular partial differential equations with resonance or small denominators
Authors: Masafumi Yoshino
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

We show the solvability and nonsolvability of a singular nonlinear system of partial differential equations with resonance in a class of functions holomorphic in some neighborhood of the origin. These results are applied to the normal form theory of a singular vector field.