ppxscal/embedding_network huggingface dataset:
Verification of grid workflows
Authors: P. Kurdel, J. Sebestyénová
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Grids are being adopted and developed in several scientific disciplines that deal with large-scale collaboration, massive distributed data, and distributed computing problems. The service orchestration is a problem of making multiple services coordinate themselves and communicate in an orderly fashion so as to accomplish a task more complex than the single tasks provided by the individual composing services. A Grid workflow system is a type of application-level Grid middleware that is supposed to support modelling, redesign and execution of large-scale processes. Grid workflow verification and validation must be conducted so that we can identify any violations of the correctness in workflow specification and consequently remove them in time.
60 Tips on Object Oriented Programming
Authors: S G Ganesh
Venue:  (2008)

Do you wish to get through IT interviews? Do you wish to excel as a programmer? Do you want to effectively use object oriented programming in your projects?Help is at hand! 60 Tips for Object Oriented Programming is an invaluable guide for programmers. The tips focus on the truly tough stuff proven techniques learnt through experience. By uniquely combining the concepts and practical applications of three important programming languages, C++, Java and C#, the author provides a comprehensive coverage of the domain including the semantics. Anyone with a basic understanding of programming can become a competent object oriented programmer after reading this book. Instead of syntactic issues, it helps you understand semantic and pragmatic details of the programming. Browse through it for your last-minute preparation for cracking IT interviews successfully.Should be on the bookshelf of every object oriented programming professional!
Keynote speaker - turing award 2007: embedded systems - scientific challenges and work directions
Authors: Joseph Sifakis
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Embedded systems are components integrating software and hardware that are jointly and specifically designed to provide given functionalities, which are often critical. They are used in a very wide array of application areas - including transport, consumer electronics/electrical appliances, energy distribution, manufacturing systems, etc. Designing embedded systems requires techniques taking into account extra-functional requirements regarding optimal use of resources such as time, memory and energy while ensuring autonomy, reactivity and robustness. Jointly taking into account these requirements raises a grand scientific and technical challenge: extending Computer Science with paradigms and methods from Control Theory and Electrical Engineering. Computer Science is based on discrete computation models, which are by their nature are very different from the analytic models used in other engineering disciplines, because they do not encompass physical time and resources. We discuss the main aspects of this challenge and their associated research directions for different areas such as modelling, programming, compilers, operating systems and networks.
Comics, robots, fashion and programming: outlining the concept of actDresses
Authors: Ylva Fernaeus, Mattias Jacobsson
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

This paper concerns the design of physical languages for controlling and programming robotic consumer products. For this purpose we explore basic theories of semiotics represented in the two separate fields of comics and fashion, and how these could be used as resources in the development of new physical languages. Based on these theories, the design concept of actDresses is defined, and supplemented by three example scenarios of how the concept can be used for controlling, programming, and predicting the behaviour of robotic systems.
API design matters
Authors: Michi Henning
Venue: Communications of the ACM (2009)

Bad application programming interfaces plague software engineering. How do we get things right?
A switching system in the on-board processor for the mobile satellite communication
Authors: Shinichi Taira, Osamu Takeda, Yoichi Kawakami
Venue: Space Communications (1998)

An on-board processor makes efficient use of the channel capacities in a satellite communications system employing multibeam technology, and an on-board processor has been developed for the Engineering Test Satellite Eight (ETS-VIII) which is an experimental satellite for a multibeam mobile satellite communications system. This communications system uses multicarrier TDMA. Such multiple access systems are, however, in certain cases subject to on-board processor internal congestion. This paper describes the results of computer simulation studies of the traffic capacity obtained using three baseband switching methods: carrier switching, slot switching, and simultaneous-slot switching, when beams for mobile links are allocated into two dimensions. The studies indicate that the probability of internal congestion due to the TDMA system is very small when the simultaneous-slot switching method is used, and that simultaneous-slot switching is beneficial for the on-board processor of the multicarrier TDMA system.
A new approach to the giant component problem
Authors: Svante Janson, Malwina J. Luczak
Venue: Random Structures Algorithms (2009)

We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n &rarr; &infin;. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the degree sequence that imply that with high probability all the components are small, and other conditions that imply that with high probability there is a giant component and the sizes of its vertex and edge sets satisfy a law of large numbers; under suitable assumptions these are the only two possibilities. In particular, we recover the results by Molloy and Reed on the size of the largest component in a random graph with a given degree sequence. We further obtain a new sharp result for the giant component just above the threshold, generalizing the case of G(n,p) with np = 1 + &omega;(n)n-1-3, where &omega;(n) &rarr; &infin; arbitrarily slowly. Our method is based on the properties of empirical distributions of independent random variables, and leads to simple proofs. &copy; 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009
Application of an emotional neural network to facial recognition
Authors: Adnan Khashman
Venue: Neural Computing and Applications (2009)

In our attempts to model human intelligence by mimicking the brain structure and function, we overlook an important aspect in human cognition, which is the emotional factor. It may currently sound unthinkable to have emotional machines; however, it is possible to simulate certain artificial emotions with the aim of improving machine learning. This paper investigates the efficiency of an emotional neural network, which uses a modified back propagation learning algorithm. The modifed algorithm, namely the emotional BP learning algorithm, has two emotional parameters, anxiety and confidence, that are modeled during machine learning and decision making. The emotional neural network will be implemented to a facial recognition problem using images of faces with different orientations and contrast levels, and its performance will be compared to that of a conventional neural network. Experimental results suggest that artificial emotions can be successfully modeled and efficiciently implemented to improve neural networks learning and generaliztion.
Compiler validation: an assessment
Authors: George N. Baird, L. Arnold Johnson
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The Federal COBOL Compiler Testing Service (FCCTS) was transferred from the Department of the Navy to the General Services Administration (GSA) in May, 1979. GSA renamed it the Federal Compiler Testing Center (FCTC) and expanded its functions beyond that of COBOL compiler validation. This paper discusses (1) the effect of the FCCTS/FCTC in the area of COBOL over the past eight years, mainly in the area of the standardization of COBOL; (2) the quality of COBOL compilers today contrasted with those of six and 10 years ago; and (3) the effect of this work on the ADP procurement process and ultimately the end user. Today's COBOL 74 compiler, on the average, is far superior to its predecessors, developed for COBOL 68.
Demonstration of wide-angle beam steering optics in wavelength-division-multiplexing indoor optical wireless LAN with dedicated CMOS imager
Authors: Keiichiro Kagawa, Jun Tanida
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

We are developing a new indoor optical wireless LAN system, in which dedicated CMOS imagers are utilized to offer location-aware visually-intuitive wireless communications, wavelength- or space-division-multiplexing high-speed data transfer, and compact hardware. This paper focuses on a wide-angle beam steering optics, which is a key component to realize a compact and wide-angle optical transmitter accessible to the network from anywhere in a room with 5 m by 5 m size. A prototype beam steering lens designed for a near-infrared wavelength of an 850-nm band was fabricated and demonstrated. Experimental results show that the maximum output beam angle was about &plusmn;60 degrees, which covers the 5m-by-5m room (when the vertical distance between a hub and a node was 2.0 m), and the optical power efficiency was higher than 0.8 which equals to about 1dB loss.
On the Equilibria and Efficiency of the GSP Mechanism in Keyword Auctions with Externalities
Authors: Ioannis Giotis, Anna R. Karlin
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

In the increasingly important market of online search advertising, a multitude of parameters affect the performance of advertising campaigns and their ability to attract users' attention enough to produce clicks. Thus far, the majority of the relevant literature assumed an advertisement's probability of receiving a click to be dependent on the advertisement's quality and its position in the sponsored search list, but independent of the other advertisements shown on the same webpage.We examine a promising new model [1, 16] that incorporates the externalities effect based on the probabilistic behavior of a typical user. We focus on the Generalized Second Price mechanism used in practice and examine the Nash equilibria of the model. We also investigate the performance of this mechanism under the new model by comparing the efficiency of its equilibria to the optimal efficiency.
A K-Nearest-Neighbors Pareto Rank Assignment Strategy and Compound Crossover Operator Based NSGA-II and Its Applications on Multi-objective Optimization Functions
Authors: Weiya Guo, Zhenhua Li, Dan Zhao, Tim Wong
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

We try to improve the NSGA-II, one of the most classical MOP algorithms, in two ways. To measure individual crowding distance by edge weight of minimum spanning tree and k-nearest-neighbors Pareto rank assignment strategy is helpful on diversity of population; A compound crossover operator increases the extent and the ability of search. Experimental results on ZDTs and DTLZs, suggest that A K-Nearest-Neighbors Pareto Rank Assignment Strategy and Compound Crossover Operator Based NSGA-II (KC NSGA-II) works faster and has more diverse solutions than its origins.
Iterative Set Expansion of Named Entities Using the Web
Authors: Richard C. Wang, William W. Cohen
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Set expansion refers to expanding a partial set of "seed" objects into a more complete set. One system that does set expansion is SEAL (Set Expander for Any Language), which expands entities automatically by utilizing resources from the Web in a language independent fashion. In a previous study, SEAL showed good set expansion performance using three seed entities; however, when given a larger set of seeds (e.g., ten), SEAL's expansion method performs poorly. In this paper, we present Iterative SEAL (iSEAL), which allows a user to provide many seeds. Briefly, iSEAL makes several calls to SEAL, each call using a small number of seeds. We also show that iSEAL can be used in a "bootstrapping" manner, where each call to SEAL uses a mixture of user-provided and self-generated seeds. We show that the bootstrapping version of iSEAL obtains better results than SEAL even when using fewer user-provided seeds. In addition, we compare the performance of various ranking algorithms used in iSEAL, and show that the choice of ranking method has a small effect on performance when all seeds are user-provided, but a large effect when iSEAL is bootstrapped. In particular, we show that Random Walk with Restart is nearly as good as Bayesian Sets with user-provided seeds, and performs best with bootstrapped seeds.
Graph searching with advice
Authors: Nicolas Nisse, David Soguet
Venue: Theoretical Computer Science (2009)

Fraigniaud et al. [L. Blin, P. Fraigniaud, N. Nisse, S. Vial, Distributing chasing of network intruders, in: 13th Colloquium on Structural Information and Communication Complexity, SIROCCO, in: LNCS, vol. 4056, Springer-Verlag, 2006, pp. 70-84] introduced a new measure of difficulty for a distributed task in a network. The smallest number of bits of advice of a distributed problem is the smallest number of bits of information that has to be available to nodes in order to accomplish the task efficiently. Our paper deals with the number of bits of advice required to perform efficiently the graph searching problem in a distributed setting. In this variant of the problem, all searchers are initially placed at a particular node of the network. The aim of the team of searchers is to clear a contaminated graph in a monotone connected way, i.e., the cleared part of the graph is permanently connected, and never decreases while the search strategy is executed. Moreover, the clearing of the graph must be performed using the optimal number of searchers, i.e. the minimum number of searchers sufficient to clear the graph in a monotone connected way in a centralized setting. We show that the minimum number of bits of advice permitting the monotone connected and optimal clearing of a network in a distributed setting is @Q(nlogn), where n is the number of nodes of the network. More precisely, we first provide a labelling of the vertices of any graph G, using a total of O(nlogn) bits, and a protocol using this labelling that enables the optimal number of searchers to clear G in a monotone connected distributed way. Then, we show that this number of bits of advice is optimal: any distributed protocol requires @W(nlogn) bits of advice to clear a network in a monotone connected way, using an optimal number of searchers.
Image-based path planning for outdoor mobile robots
Authors: Wesley H. Huang, Mark Ollis, Michael Happold, Brian A. Stancil
Venue: Journal of Field Robotics (2009)

Mobile robots operating in natural terrain need some sort of long-range perception in order to navigate efficiently. Whereas LADAR is a commonly used sensor on such systems, providing range data out to 25 m and beyond, we have instead focused on what information can be extracted from vision. Our robot has only two stereo camera pairs for terrain sensing; they provide reliable stereo data up to 5 m away, but this is not enough to prevent myopic behavior. To overcome this problem, we have developed a novel approach to navigation using monocular imagery by planning a path in the image space. We take a monocular image and apply a learned color-to-cost mapping to transform the raw image into a cost image. Then, after a pseudo-configuration-space transform, we search for a pixel-to-pixel path from a point in front of the robot to the projected goal point in the cost image. Our implementation has been shown to react to obstacles at a range of 93 m, far beyond the range of our stereo perception. We describe the details of our method and results from testing under the DARPA Learning Applied to Ground Robots (LAGR) program and discuss the characteristics and trade-offs of our approach. &copy; 2009 Wiley Periodicals, Inc.
Complex Position Code Parallel Combinatory Spread Spectrum Communication System with FEC Technique
Authors: Li Bei-Ming, Guo Li-Li, Qi Xiao-Dong
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Complex Position Code Parallel Combinatory Spread Spectrum (CPC/PC/SS) communication system with forward error correction (FEC) coding scheme is proposed in this paper, and performances are analyzed. CPC/PC/SS system with FEC coding scheme can be designed to have higher data transmission capability, even several times compared to ordinary PC/SS system on Gaussian channel.The proposed FEC coding is separately applied to the combination data of orthogonal codes and the state data of their transmitting orthogonal code, and less redundant FEC code is enough to the state data of orthogonal codes by this coding scheme. Therefore, the total information rate exceeds that offered by the conventional overall FEC coding is applied. Simulation results show that the error rate performance of the CPC/PC/SS systems equipped with the proposed FEC coding is lower than conventional PC/SS system.
Teach Yourself VISUALLY MacBook Air
Authors: Brad Miser
Venue:  (2008)

The foundation of Teach Yourself VISUALLY MacBook Air is "to read less, learn more." In this book the focus is on the visual approach to learning---maximum illustrations with minimum text--to show visual learners how to get up and running with their sleek new laptop. The book includes topics of keen interest to new MacBook Air users, such as configuring and using the new multi-touch trackpad, installing applications from CDs/DVDs inserted in other Macs, and personalizing their MacBook Air. Teach Yourself VISUALLY MacBook Air covers all the vital information and provides the help and support visual learners need it's like having a Mac expert showing them the fast and easy way to get up to speed.
Design of fractional-order PIλDµ controllers with an improved differential evolution
Authors: Arijit Biswas, Swagatam Das, Ajith Abraham, Sambarta Dasgupta
Venue: Engineering Applications of Artificial Intelligence (2009)

Differential evolution (DE) has recently emerged as a simple yet very powerful technique for real parameter optimization. This article describes an application of DE to the design of fractional-order proportional-integral-derivative (FOPID) controllers involving fractional-order integrator and fractional-order differentiator. FOPID controllers' parameters are composed of the proportionality constant, integral constant, derivative constant, derivative order and integral order, and its design is more complex than that of conventional integer-order proportional-integral-derivative (PID) controller. Here the controller synthesis is based on user-specified peak overshoot and rise time and has been formulated as a single objective optimization problem. In order to digitally realize the fractional-order closed-loop transfer function of the designed plant, Tustin operator-based continuous fraction expansion (CFE) scheme was used in this work. Several simulation examples as well as comparisons of DE with two other state-of-the-art optimization techniques (Particle Swarm Optimization and binary Genetic Algorithm) over the same problems demonstrate the superiority of the proposed approach especially for actuating fractional-order plants. The proposed technique may serve as an efficient alternative for the design of next-generation fractional-order controllers.
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
Authors: J. Black, M. Cochran, T. Shrimpton
Venue: Journal of Cryptology (2009)

Fix a small nonempty set of blockcipher keys . We say a blockcipher-based hash function is highly-efficient if it makes exactly one blockcipher call for each message block hashed, and all blockcipher calls use a key from . Although a few highly-efficient constructions have been proposed, no one has been able to prove their security. In this paper we prove, in the ideal-cipher model, that it is impossible to construct a highly-efficient iterated blockcipher-based hash function that is provably secure. Our result implies, in particular, that the Tweakable Chain Hash (TCH) construction suggested by Liskov, Rivest, and Wagner (Advances in CryptologyCRYPTO 02, Lecture Notes in Computer Science, vol. 2442, pp. 3146, Springer, Berlin, 2002) is not correct under an instantiation suggested for this construction, nor can TCH be correctly instantiated by any other efficient means.
Efficient skyline computation in metric space
Authors: David Fuhry, Ruoming Jin, Donghui Zhang
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Given a set of n query points in a general metric space, a metric-space skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consider for any point p, if there are no other points in the database which have less or equal distance to all the query points, then p is denoted as one of the closest points to the query points. This problem is a direct generalization of the recently proposed spatial-skyline query problem, where all the points are located in two or three dimensional Euclidean space. It is also closely related with the nearest neighbor (NN) query, the range query and the common skyline query problem. In this paper, we have developed new algorithms to aggressively prune non-skyline points from the search space. We also contribute two new optimization techniques to reduce the number of distance computations and dominance tests. Our experimental evaluation has shown the effectiveness and efficiency of our approach.
Data Locality Aware Strategy for Two-Phase Collective I/O
Authors: Rosa Filgueira, David E. Singh, Juan C. Pichel, Florin Isaila, Jesús Carretero
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

This paper presents Locality-Aware Two-Phase (LATP) I/O, an optimization of the Two-Phase collective I/O technique from ROMIO, the most popular MPI-IO implementation. In order to increase the locality of the file accesses, LATP employs the Linear Assignment Problem (LAP) for finding an optimal distribution of data to processes, an aspect that is not considered in the original technique. This assignment is based on the local data that each process stores and has as main purpose the reduction of the number of communication involved in the I/O collective operation and, therefore, the improvement of the global execution time. Compared with Two-Phase I/O, LATP I/O obtains important improvements in most of the considered scenarios.