ppxscal/embedding_network huggingface dataset:
Robust RSA distributed signatures for large-scale long-lived ad hoc networks
Authors: Giorgio Zanin, Roberto Di Pietro, Luigi V. Mancini
Venue: Journal of Computer Security (2007)

Ad hoc environments are subject to tight security and architectural constraints, which call for distributed, adaptive, robust and efficient solutions. In this paper we propose a distributed signature protocol for large-scale long-lived ad hoc networks. The proposed protocol is based on RSA and a new (t,t)-secret sharing scheme. The nodes of the network are uniformly partitioned into t classes, and the nodes belonging to the same class are provided with the same share. Any t nodes, belonging to different classes, can collectively issue a signature, without any interaction. The scheme is at least as secure as any (t,n)-threshold scheme, i.e., an adversary can neither forge a signature nor disrupt the computation, unless it has compromised at least t nodes, belonging to different classes. Moreover, an attempt to disrupt the distributed service, by providing a fake signature share, would reveal the cheating node. Further, it is possible to easily increase the level of security, by shifting from a (t,t) to a (t+k,t+k) scheme, for a reasonable choice of parameter k, involving just a fraction of the nodes, so that the scheme is adaptive to the level of threat that the ad hoc network is subject to. Finally, the distributed signature protocol is efficient: the number of messages sent and received for generating a signature, as well as to increase the level of security, is small and both computations and memory required are small as well. All the authors have been partially funded by the WEB-MINDS project, supported by the Italian MIUR under the FIRB program. Roberto Di Pietro is also partially supported by the CNR-ISTI, Pisa, in the framework of the &ldquo;SatNEx-II&rdquo; NoE project (contract N. 27393).
A Clustering Analysis Based Trust Model in Grid Environment Supporting Virtual Organizations
Authors: Xudong Ni, Junzhou Luo
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Grid computing is to enable coordinated resource sharing in dynamic, distinct virtual organizations, which are consisted of different grid entities from traditional organizations. Grid security must ensure secure and authorized access to grid services in such dynamic, heterogeneous and unpredictable gird environment. The main current security solution is applying trust as an important factor to the gird computing to realize cooperation between unknown entities.However, most of the research work inherites the conception of trust from Peer-to-Peer network and is not accurately satsified the requirements in grid environemnt. In this paper, we propose a multi-virtual organizations trust evaluation method. The unique feature of our trust model is that introducing VO trust relationship into traditional grid entities, with which we can more effectively and dynamically share grid resources. In addition,the new method uses clustering analysis to evaluate grid entities’ trust in VOs and a weighted path to compute transitivity of trust.The simulation result shows that it improves the overall performance of grid system.
A PSO-Based Clustering Algorithm for Manufacturing Cell Design
Authors: Orlando Duran, Nibaldo Rodriguez, Luiz Airton Consalter
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

have been used to solve clustering problems. This paper addresses the problem of manufacturing Cell Formation using a modified particle swarm optimisation (PSO) algorithm. The main modification made to the original PSO algorithm consists on that in this work it is not used the vector of velocities as the standard PSO algorithm does. The proposed algorithm uses the concept of proportional likelihood with modifications, a technique that is used in data mining techniques. Some simulations are presented and compared. The criterion used to group the machines in cells is based on the minimization of inter-cell movements. The computational results show that the PSO algorithm is able to find the optimal solutions on almost all instances. Keywords: Manufacturing cells, machine grouping, particle swarm optimization I.
Efficient Resource Management for Game Server Hosting
Authors: Dan Martin, Aad van Moorsel, Graham Morgan
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

This paper describes work to ease the resource allocation problem in the domain of game server hosting. A solution was sought that required no alteration to game server code and would not inhibit a player’s gaming experience. Although an academic work, the problem is tackled in a commercial setting.
Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks
Authors: Xueyan Tang, Jianliang Xu
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Communication is a primary source of energy consumption in wireless sensor networks. Due to resource constraints, the sensor nodes may not have enough energy to report every reading to the base station over a required network lifetime. This paper investigates data collection strategies in lifetime-constrained wireless sensor networks. Our objective is to maximize the accuracy of data collected by the base station over the network lifetime. Instead of sending sensor readings periodically, we propose to consider their relative importance. The key idea is to let the sensor nodes send data updates to the base station when the new readings differ more substantially from the previous ones. We analyze the optimal update strategy and develop adaptive update strategies for both individual and aggregate data collections. We also present two methods to cope with message losses in wireless transmission. Experimental results using real data traces show that, compared with periodic data collection, adaptive data collection significantly improves the accuracy of data collected by the base station.
Strategies for Cross-Organizational Service Composition
Authors: Christoph Schroth, Till Janner, Volker Hoyer
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

The automation of cross-organizational business processes bears great potential for companies to extend their market reach, save time, cut costs and respond to customer queries more agilely. However, technological support for the efficient organization of providing and consuming services across corporate boundaries is still not mature enough to allow for a large-scale adoption particularly among small-and medium-sized enterprises. In this article, we propose and evaluate different strategies with regard to architectures supporting the organization of service interconnections: In case of rather standardized and stable business relationships and interactions, a central service orchestration architecture, a hybrid orchestration approach with hub support and finally a fully decentralized peer-to-peer solution without any central control entity are proposed and compared in detail. In cases where business processes are highly complex, variable and dependent on situational factors, we propose a more implicit, declarative service orchestration methodology which builds upon Event-Driven Architectures (EDAs). For the different architectural strategies, we provide real-world exemplary implementations to prove their applicability and to investigate their strengths and weaknesses.
Monitoring of carrier lifetime distribution in high power semiconductor device technology
Authors: J. Kozisek, Z. Machacek, V. Benda
Venue: Microelectronics Journal (2008)

Non-uniform distribution of carrier lifetime over the area of power bipolar semiconductor devices results in a non-uniform distribution of on-state current density and switching loses. Consequently, it results in non-uniform temperature distribution which can negatively influence the device reliability. Several methods can be used for measuring carrier lifetime distribution both in starting single crystal material and in device structures after high-temperature processes. Advantages and disadvantages of individual methods and an optimum area of applications are discussed in this paper. This paper is mostly oriented on a possibility to use LBIC method for measuring carrier lifetime distribution in the bulk of high voltage large-area devices, especially N^+NPP^+ diode structures.
Spectral Characteristics of Nonlinear Systems Approximated by Piecewise Linear Function
Authors: Jiri Schimmel, Ivan Koula, Jiri Misurec, Zdenek Smekal
Venue: Proceedings of the Seventh International Conference on Networking (2008)

This paper deals with an analytic solution of spectrum changes that appear in nonlinear discrete systems without memory whose transfer characteristics can be approximated via piecewise linear function. The paper also deals with relations between the mutual harmonics ratio and the approximation parameters. Furthermore, the dependence of the harmonics ratio on the amplitude of a harmonic input signal is presented for the most common systems whose transfer characteristics are approximated via piecewise linear function.
Anstreicher-Terlaky type monotonic simplex algorithms for linear feasibility problems
Authors: Filiz Bilen, Zsolt Csizmadia, Tibor Illés
Venue: Optimization Methods Software (2007)

Based on the pivot selection rule [Anstreicher, K.M. and Terlaky, T., 1994, A monotonic build-up simplex algorithm for linear programming. Operations Research, 42, 556-561.] we define a new monotonic build-up (MBU) simplex algorithm for linear feasibility problems. An mK upper bound for the iteration bound of our algorithm is given under a weak non-degeneracy assumption, where K is determined by the input data of the problem and m is the number of constraints. The constant K cannot be bounded in general by a polynomial of the bit length of the input data since it is related to the determinants (of the pivot tableau) with the highest absolute value. An interesting local property of degeneracy led us to construct a new recursive procedure to handle strongly degenerate problems as well. Analogous complexity bounds for the linear programming versions of MBU and the first phase of the simplex method can be proved under our weak non-degeneracy assumption.
Utilizing User Behaviors with Semantic Metadata
Authors: Lili Jiang, Jian Zhan, Lian Li, Changxian Shi, Ning An
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

With the explosion of digital information, many people are overwhelmed by the sheer amount of information available to them. How to tailor the information to cater to individual needs becomes an important issue for many information systems. One promising approach is to capture an individual user behavior in order to facilitate this user to navigate through existing information and notify this user when relevant new information becomes available. Some online services have started to utilize this approach, for example the recommender system used by Amazon.
Competitions @ WCCI-2008: simulated car racing competition
Authors: Daniele Loiacono, Julian Togelius
Venue: ACM SIGEVOlution (2007)

The Simulated Car Racing Competition was organized in conjunction with WCCI-2008, the IEEE World Congress on Computational Intelligence. The competition was the spiritual successor of the previous car racing competition held at CIG-2007 (the IEEE Conference on Computational Intelligence and Games) and CEC-2007 (the IEEE Congress on Evolutionary Computation). The goal of this year's competition was to learn, or otherwise design a controller for The Open Racing Car Simulator (TORCS), a state-of-the-art, open source, car racing simulator, which could be able to race for a certain number of laps on a set of three unknown tracks, alone or against other drivers.
Hands-On Training for Chemistry Laboratory in a Ubiquitous Computing Environment
Authors: Mune-aki Sakamoto, Masakatsu Matsuishi
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

To build an ubiquitous and interactive practical-learning environment in science laboratory at advanced education, educational materials will consist of a large amount of electronic data. With the increase of information in the materials, volumes of data become huge and bandwidth of the network would be oppressed. In order to advance a practical approach, we have to make clear a condition of compatibility between data size and educational effect of the materials. In this paper, we shed a light on minimum requirements for e-Learning in chemistry laboratory. A relationship between degree of understanding and quality of video materials were investigated using a sample of 1023 first year university students in 8 classes in Japan. Although the students discriminate a frame rate of a video material, they recognized handling and peripheral operation in chemistry laboratory on all rates.
A generalized network flow based algorithm for power-aware FPGA memory mapping
Authors: Tien-Yuan Hsu, Ting-Chi Wang
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In this paper, we present a generalized network flow based algorithm for power-aware FPGA memory mapping. Our algorithm not only maps user-defined logical memories to physical embedded memory blocks under the memory resource constraint but also achieves minimum power consumption. The experimental results show that our algorithm was always able to efficiently generate optimal solutions for all test cases while an existing greedy method could do so only for about one third of the test cases.
Chromatic-index-critical graphs of even order
Authors: Stefan Grünewald, Eckhard Steffen
Venue: Journal of Graph Theory (1999)

A k-critical (multi-) graph G has maximum degree k, chromatic index &chi;2(G) = k + 1, and &chi;2(G - e) < k + 1 for each edge e of G. For each k &ge; 3, we construct k-critical (multi-) graphs with certain properties to obtain counterexamples to some well-known conjectures. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 30: 2736, 1999
SOA Testing
Venue: Queue (2007)

As developers move to build applications that span service-oriented architectures, many of them underestimate the testing challenges associated with building and maintaining applications that can comprise hundreds of different Web services. Developers need a robust set of testing tools and a systematic approach to testing to prevent errors from being introduced or, worse yet, propagated throughout the system. Wayne Ariola, vice president of corporate development for Parasoft, in a conversation with Queuecast host Mike Vizard, highlights some of the more common miscues associated with SOA and discusses best practices for building SOA applications. 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
SARBAU Towards Highly Self-Configuring IP-Fieldbus Based Building Automation Networks
Authors: S. Knauth, R. Kistler, D. Kaslin, A. Klapproth
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

The SARBAU project is a study on a highly self configuring building automation and control network using IP as field level protocol. UPnP will be used for device operation and control. The paper gives an overview on the SARBAU approach. Current work-in-progress including wired and wireless experimental device hardware is presented.A focus of this paper is "nearly automatic configuration''. Using intelligent commissioning software and optional device localisation, we propose highly automated device commissioning and binding schemes.
Safety of nöcker's strictness analysis
Authors: Manfred Schmidt-schauss, David Sabel, Marko SchÜtz
Venue: Journal of Functional Programming (2008)

This paper proves correctness of Nöcker's method of strictness analysis, implemented in the Clean compiler, which is an effective way for strictness analysis in lazy functional languages based on their operational semantics. We improve upon the work Clark, Hankin and Hunt did on the correctness of the abstract reduction rules in two aspects. Our correctness proof is based on a functional core language and a contextual semantics, thus proving a wider range of strictness-based optimizations as correct, and our method fully considers the cycle detection rules, which contribute to the strength of Nöcker's strictness analysis. Our algorithm SAL is a reformulation of Nöcker's strictness analysis algorithm in a functional core language LR. This is a higher order call-by-need lambda calculus with <monospace>case</monospace>, constructors, <monospace>letrec</monospace>, and <monospace>seq</monospace>, which is extended during strictness analysis by set constants like <monospace>Top</monospace> or Inf, denoting sets of expressions, which indicate different evaluation demands. It is also possible to define new set constants by recursive equations with a greatest fixpoint semantics. The operational semantics of LR is a small-step semantics. Equality of expressions is defined by a contextual semantics that observes termination of expressions. Basically, SAL is a nontermination checker. The proof of its correctness and hence of Nöcker's strictness analysis is based mainly on an exact analysis of the lengths of evaluations, i.e., normal-order reduction sequences to WHNF. The main measure being the number of “essential” reductions in evaluations. Our tools and results provide new insights into call-by-need lambda calculi, the role of sharing in functional programming languages, and into strictness analysis in general. The correctness result provides a foundation for Nöcker's strictness analysis in Clean, and also for its use in Haskell.
Constraint Programming in Structural Bioinformatics
Authors: Pedro Barahona, Ludwig Krippahl
Venue: Constraints (2008)

Bioinformatics aims at applying computer science methods to the wealth of data collected in a variety of experiments in life sciences (e.g. cell and molecular biology, biochemistry, medicine, etc.) in order to help analysing such data and eliciting new knowledge from it. In addition to string processing bioinformatics is often identified with machine learning used for mining the large banks of bio-data available in electronic format, namely in a number of web servers. Nevertheless, there are opportunities of applying other computational techniques in some bioinformatics applications. In this paper, we report the application of constraint programming to address two structural bioinformatics problems, protein structure prediction and protein interaction (docking). The efficient application of constraint programming requires innovative modelling of these problems, as well as the development of advanced propagation techniques (e.g. global reasoning and propagation), which were adopted in Chemera, a system that is currently used to support biochemists in their research.
Proposal of Multimodal Communications System Using Tele-Immersion Technology
Authors: Tomoyuki Ishida, Akihiro Miyakawa, Yoshitaka Shibata
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, it proposes the Multimodal Communications System that uses three information on Verbal Information, Non-verbal Information, and Sensitivity Information. In this research, universities and research institutes that have Immersive Displays and Tiled Displays are interconnected over the ultrahigh-speed network, and cooperative Tele-Immersion environments are constructed. A new human community is created by using Tele-Immersion Technology of this research. The facial expression and the gesture are the critical factors in person's communications, and enough communications might not be approved in present video phone and teleconference system. The multimodal communications system achieves new communications in interconnected large screen system by using the video communication technology and the sensibility information processing technology.
Total Least-Squares Solution of Active Target Localization Using TDOA and FDOA Measurements in WSN
Authors: Xiaoyan Sun, Jiandong Li, Pengyu Huang, Jiyong Pang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Active target localization is one of the study emphases in wireless sensor network(WSN). When time difference of arrival (TDOA) and frequency difference of arrival (FDOA) measurements are used to target localization, the measurements are nonlinearly related to the target location parameters. By the analysis of TDOA and FDOA linearized equations, when there exists sensor location error, active target localization using TDOA and FDOA measurements is a typical total least-squares (TLS) problem. The TLS solution for active target localization is presented in this paper. Its Minimum Square Error ( MSE) is compared with Cramer-Rao lower bound (CRLB) through the simulation results.
Improving Emergency Response to Mass Casualty Incidents
Authors: Marcus Lucas da Silva, Vassilis Kostakos, Mitsuji Matsumoto
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Mass casualty incidents generate a sequence of response events from the emergency services, requiring the allocation and use of resources in a timely fashion. In this paper we describe a pervasive system that helps emergency services optimize their efficiency and coordination. The system emulates a multiple casualty emergency response environment in which contextual information, retrieved from victims’ wearable or mobile devices, guides early assessments on the health condition of the affected population. Additionally, we analyze the behavior of our system under different conditions and derive the necessary parameters for achieving accurate estimations. Our main contribution is the enhancement of the existing emergency response process for mass casualty incidents through the use of Pervasive Computing technology.
A base function for generating contour traversal paths in stereolithography apparatus applications
Authors: Shuo-Yan Chou, Chang-Chien Chou, Yu-Kumg Chen
Venue: Expert Systems with Applications: An International Journal (2008)

The technique of layered manufacturing in rapid prototyping is to fabricate product prototype by scanning the cross-sectional contours of the product using a laser beam layer by layer. The outlines of geometrical objects on each layer are different, and each layer may contain several geometrical objects. In order to simplify the problem, each geometrical object on the same plane is approximating by its own minimum circumscribed circle. Therefore, the minimum traversal path of circles can be the based model of the minimum traversal path of scanning geometrical objects. Furthermore, the minimum traversal path of three circles is the degenerated case of the minimum traversal path of plural circles. And the problem of the minimum traversal path of three circles can be transferred to the problem of the minimum traversal path of one circle and two points in this paper. By using the concepts of reflection of light in physics and geometrical mathematics, the equation of the minimum traversal path of three circles is derived in this paper. This equation can be easily implemented in many areas of application, including robotic motion planning and path planning for submarine, ship, and airplane.