ppxscal/embedding_network huggingface dataset:
Service specification in cloud environments based on extensions to open standards
Authors: Fermín Galán, Americo Sampaio, Luis Rodero-Merino, Irit Loy, Victor Gil, Luis M. Vaquero
Venue: Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE (2009)

Cloud computing technologies are changing the way in which services are deployed and operated nowadays, introducing advantages such as a great degree of flexibility (e.g. pay-peruse models, automatic scalability, etc.). However, existing offerings (Amazon EC2, GoGrid, etc.) are based on proprietary service definition mechanisms, thus introducing vendor lock-in to the customers who deploy their services on those clouds. On the other hand, there are open standards that address the problem of packaging and distributing virtual appliances (i.e. complete software stacks deployed in one or more virtual machines), but they have not been designed specifically for clouds. This paper proposes a service specification language for cloud computing platforms, based on the DMTF's Open Virtualization Format standard, extending it to address the specific requirements of these environments. In order to assess the feasibility of our proposal, we have implemented a prototype system able to deploy and scale service specifications using the proposed extensions. Additionally, practical results are presented based on an industrial case study that demonstrates using the software prototype how to automatically deploy and flexibly scale the Sun Grid Engine application.
Relative pose calibration of a spherical camera and an IMU
Authors: Jeroen D. Hol, Thomas B. Schony, Fredrik Gustafsson
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

This paper is concerned with the problem of estimating the relative translation and orientation of an inertial measurement unit and a spherical camera, which are rigidly connected. The key is to realize that this problem is in fact an instance of a standard problem within the area of system identification, referred to as a gray-box problem. We propose a new algorithm for estimating the relative translation and orientation, which does not require any additional hardware, except a piece of paper with a checkerboard pattern on it. The experimental results show that the method works well in practice.
Color Model for Human Visual Environment and Physical Interaction
Authors: Tsutomu Mutoh, Kazuo Ohno
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

The authors explored a method to control dynamic RGB light source in accordance with human visual environment and possibilities of physical interaction with light source of full color capabilities. We developed a color model composed of hue, grayscale, brightness components and an algorithm to transform RGB values into the color space of the model. We implemented the color model using full color light emitting diode (LED) in a light source device designed for people to interact with color physically. We set up an experimental environment for human color perception to prove visual and physical interaction effect of dynamic light source and object with color composition governed by the color model and the device.
SKEYP: AI Applied to SOHO Keyhole Operations
Authors: Nicola Policella, Henrique Oliveira, Tero Siili
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

The Solar and Heliospheric Observatory's (SOHO) mission operations team has - due to a spacecraft malfunction - had to deal with the Keyhole Periods problem since 2003. This combinatorial problem arises from the conflict between limited telemetry downlink capabilities during keyhole periods and the need to maximize the return of science data while respecting other constraints, such as limited on-board storage capacity. Until recently, this problem has been addressed by manually generating data production and downlink plans. This work presents the SOHO Keyhole Planner (SKEYP), a software tool designed to improve on the manual workflow for plan generation by shortening the time needed and reduce significance of the learning curve associated with this process.
Learning probabilistic paradigms for morphology in a latent class model
Authors: Erwin Chan
Venue: Proceedings of the Eighth Meeting of the ACL Special Interest Group on Computational Phonology and Morphology (2006)

This paper introduces the probabilistic paradigm, a probabilistic, declarative model of morphological structure. We describe an algorithm that recursively applies Latent Dirichlet Allocation with an orthogonality constraint to discover morphological paradigms as the latent classes within a suffix-stem matrix. We apply the algorithm to data preprocessed in several different ways, and show that when suffixes are distinguished for part of speech and allomorphs or gender/conjugational variants are merged, the model is able to correctly learn morphological paradigms for English and Spanish. We compare our system with Linguistica (Goldsmith 2001), and discuss the advantages of the probabilistic paradigm over Linguistica's signature representation.
Ontological Middleware for Dynamic Wireless Sensor Data Processing
Authors: Laurent Gomez, Annett Laube
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Wireless Sensor Networks (WSN) raise the interest of multiple business domains . Their ability to monitor and control large physical environment made them very attractive for many application domains. Nevertheless, Wireless Sensor Networks encounter several technical obstacles, which may hinder their integration within business applications. Considering the fact that Wireless Sensor Networks produce a large and diverse amount of data, business applications may have difficulties to select and process relevant information. We distinguish two approaches which address this issue: in-network processing and data processing within dedicated middleware. Whereas in-network processing mainly aims at resource saving in Wireless Sensor Networks, middlewares ease the definition and execution of Wireless Sensor Network data processing for business applications. In this paper, we propose to enhance the common middleware processing approach with the introduction of a contextual ontology. The purpose of this approach is two-fold:(i) to provide only information that match the business application interests, and (ii) to dynamically process Wireless Sensor Network information in order to provide higher semantic level of information to business application.
Looking for the 3D Picture: The Spatio-temporal Realm of Student Controllers
Authors: Monica Tavanti, Matthew Cooper
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Employing three-dimensional displays in Air Traffic Control (ATC) has been the object of study and debates for numerous years. Although empirical studies have often led to mixed results, some preliminary evidence suggests that training could be a suitable domain of application for 3D interfaces. Little evidence, however, is available to fully support this claim. We attempted to fill this gap with a project that aims at studying and evaluating 3D displays for ATC training purposes. This paper describes the first steps of this project, by reporting and discussing the results of a study aiming at understanding whether ATC trainees form a three-dimensional image of air traffic and at comprehending what the nature of this `3D picture' is.
Adaptive localization in a dynamic WiFi environment through multi-view learning
Authors: Sinno Jialin Pan, James T. Kwok, Qiang Yang, Jeffrey Junfeng Pan
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Accurately locating users in a wireless environment is an important task for many pervasive computing and AI applications, such as activity recognition. In a WiFi environment, a mobile device can be localized using signals received from various transmitters, such as access points (APs). Most localization approaches build a map between the signal space and the physical location space in a offline phase, and then using the received-signal-strength (RSS) map to estimate the location in an online phase. However, the map can be outdated when the signal-strength values change with time due to environmental dynamics. It is infeasible or expensive to repeat data calibration for reconstructing the RSS map. In such a case, it is important to adapt the model learnt in one time period to another time period without too much recalibration. In this paper, we present a location-estimation approach based on Manifold co-Regularization, which is a machine learning technique for building a mapping function between data. We describe LeManCoR, a system for adapting the mapping function between the signal space and physical location space over different time periods based on Manifold Co-Regularization. We show that LeManCoR can effectively transfer the knowledge between two time periods without requiring too much new calibration effort. We illustrate LeMan-CoR's effectiveness in a real 802.11 WiFi environment.
Study on Fuzzy Optimal Dynamic Partner Choice in Private Equity Investment
Authors: Xubo Zhang, Chengbo Zhang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

There are four types risk in private equity syndication partners’ choice: capability risk, organization risk, moral hazard and cooperation termination risk. This paper Use fuzzy optimal dynamic programming build a risk-weighted optimal return model to avoid the risk in the syndication partners choice in private equity. Get the multi-stage optimal syndication partners selection set. An example is used to demonstrate our risk avoiding model.
Generation of Percentile Values for Human Joint Torque Characteristics
Authors: Florian Engstler, Heiner Bubb
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

This pilot study presents an approach to generate percentile values for joint torque characteristics of digital human models. Detailed angle specific joint torque measurements of few subjects are set in relation to extensive measurements of external maximum forces including percentile values based on many subjects by using muti-body simulation. Results indicate the applicability of the approach but do not generate results of high validity due to some sources of errors along the process. More experiments solving these issues and generating valid results are being planned.
Construction of Filter Banks of Biorthogonal Vector-valued Compactly Supported Wavelets with Three-Scale
Authors: Qingjiang Chen, Ping-An Wang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

Wavelet analysis has become a popular subject in scientific research for twenty years. It has been a powerful tool for exploring and solvingmany complicated problems in natural science and engineering computation. In this paper, the notion of vector-valued multiresolution analysis is introduced and the definition of the biorthogonal vector-valued wavelets is given. The existence of biorthogonal vector-valued wavelets associated with a pair of biorthogonal vector-valued compactly supported scaling functions is investigated.An algorithm for constructing a class of biorthogonal vector-valued compactly supported wavelet functions is presented by virtue of multiresolution analysis and matrix theory.
Residential Design Using AutoCAD 2010
Authors: Daniel John Stine
Venue:  (2009)

Residential Design Using AutoCAD 2010 is an introductory level tutorial which uses residential design exercises as the means to teach AutoCAD 2010. After completing this book readers will have a well-rounded knowledge of Computer Aided Drafting that they can use in the industry and a feeling of satisfaction having completed a set of residential drawings. This textbook starts with an optional section that covers basic hand sketching techniques and concepts intended to increase your ability to sketch design ideas by hand and to think three-dimensionally. The lessons then begin with an introduction to AutoCAD 2010 starting with a house floor plan. Using step-by-step tutorial lessons, the residential project is followed through to create elevations, sections, details, etc. Throughout the project, new AutoCAD commands are covered at the appropriate time. Focus is placed on the most essential parts of a command rather than an exhaustive review of every sub-feature of a particular command. The Appendix contains a bonus section covering the fundamental principles of engineering graphics that relate to architecture. Each textbook is bundled with a CD containing video files and any necessary base files. Throughout the text the reader is presented with icons indicating that a video file is available on the CD for viewing. Each video is a short audio/video presentation on that particular subject. Table of Contents Introduction - Sketching Exercises 1. Getting started with AutoCAD 2010 2. Crash Course Introduction (The Basics) 3. Drawing Architectural Objects (Draw & Modify) 4. Residential Project: Floor Plans 5. Residential Project: Exterior Elevations 6. Residential Project: Sections 7. Residential Project: Plan Layout & Interior Elevations 8. Residential Project: Site Plan 9. Residential Project: Schedules & Sheet Setup 10. Residential Project: Lineweights & Plotting Appendix A: Engineering Graphics 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
A Technique to Identify and Substitute Faulty Nodes in Wireless Sensor Networks
Authors: Anas Abu Taleb, Dhiraj K. Pradhan, Taskin Kocak
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

In this paper, we propose a technique to identify and substitute faulty nodes to achieve fault tolerance in wireless sensor networks. The proposed technique divides the network into disjoint zones while having a master for each zone. The zone masters are used to identify faulty nodes by virtually dividing the zone into quadrants until a suspect node is found. Our fault model assumes both communication and sensing faults which are caused by a hardware failure in anode. To detect communication faults, the division process is based on calculating the throughput for each zone and comparing it to a predefined threshold. However, for sensing faults it is based on comparing the data a node senses to a predefined status and data ranges. In addition, we make use of anew technique, which was inspired by the Roll Forward Checkpointing Scheme, to activate sleeping nodes in order to validate the correctness of the suspected nodes. This is used to reconfigure the network using fault free nodes only.
Object Tracking with Appearance-based Kalman Particle Filter in Presence of Occlusions
Authors: Yan Wang, Tao Liu, Ming Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

In object tracking, one of the most challenging issues is occlusion handling. Without any adaptability to this variation, the tracker may fail. To cope with it and adapt too fast, the tracking process is performed using an appearance-based tracking algorithm. And the approach, in which kalman filtering is prepared to bring in particle filter to solve the heavy occlusion problems, can automatically select proper appearance models to track objects according to the current tracking situation. The pixel matching served as a occlusion coefficient is used in occlusion handling. These models are used to localize objects during partial occlusions, detect complete occlusions and track them robustly. The template update method is very strongly self-adaptive. The Experimental result shows that the appearance-based kalman particle filter algorithm is able to track objects in presence of heavy occlusions satisfactorily and the computational cost is decreased.
Relational Sequence Clustering for Aggregating Similar Agents
Authors: Grazia Bombini, Nicola Mauro, Stefano Ferilli, Floriana Esposito
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

Many clustering methods are based on flat descriptions, while data regarding real-world domains include heterogeneous objects related to each other in multiple ways. For instance, in the field of Multi-Agent System, multiple agents interact with the environment and with other agents. In this case, in order to act effectively an agent should be able to recognise the behaviours adopted by other agents. Actions taken by an agent are sequential, and thus its behaviour can be expressed as a sequence of actions. Inferring knowledge about competing and/or companion agents by observing their actions is very beneficial to construct a behavioural model of the agent population. In this paper we propose a clustering method for relational sequences able to aggregate companion agent behaviours. The algorithm has been tested on a real world dataset proving its validity.
Artificial Life Models in Software, 2nd edition
Authors: Maciej Komosinski, Andrew Adamatzky
Venue:  (2009)

The advent of powerful processing technologies and the advances in software development tools have drastically changed the approach and implementation of computational research in fundamental properties of living systems through simulating and synthesizing biological entities and processes in artificial media. Nowadays realistic physical and physiological simulation of natural and would-be creatures, worlds and societies becomes a low-cost task for ordinary home computers. The progress in technology has dramatically reshaped the structure of the software, the execution of a code, and visualization fundamentals. This has led to the emergence of novel breeds of artificial life software models, including three-dimensional programmable simulation environment, distributed discrete events platforms and multi-agent systems. This second edition reflects the technological and research advancements, and presents the best examples of artificial life software models developed in the World and available for users.
Numerical approximation of characteristic values of partial retarded functional differential equations
Authors: D. Breda, S. Maset, R. Vermiglio
Venue: Numerische Mathematik (2009)

The stability of an equilibrium point of a dynamical system is determined by the position in the complex plane of the so-called characteristic values of the linearization around the equilibrium. This paper presents an approach for the computation of characteristic values of partial differential equations of evolution involving time delay, which is based on a pseudospectral method coupled with a spectral method. The convergence of the computed characteristic values is of infinite order with respect to the pseudospectral discretization and of finite order with respect to the spectral one. However, for one dimensional reaction diffusion equations, the finite order of the spectral discretization is proved to be so high that the convergence turns out to be as fast as one of infinite order.
H-ACO Algorithm for the VRPTW with Re-used Vehicles
Authors: Tao Zhang, Song Song, Yue-jie Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

In this paper, the VRPTWRV (VRPTW with Re-used Vehicle) was presented and a mathematical programming model with multiple objects was constructed correspondingly. The heuristic information and Pseudo-random probability selection rule areimproved according to the principle of serving customers with earlier service beginning time, shorter service time and earlier ending time firstly based on Ant Colony System. Pheromone updating strategy is designed by combining the MAX-MIN and Rank-based Ant System. By adding a local search strategy into the improved Ant colony algorithm, a H-ACO algorithm is presented for the VRPTWRV. At last the algorithm is tested on the 8 data groups of Solmon C2. Numerical results show that the H-ACO can obtain the satisfying solutions quickly, and the global convergence performance of the algorithm is good.
Efficient O(N) integration for all-electron electronic structure calculation using numeric basis functions
Authors: V. Havu, V. Blum, P. Havu, M. Scheffler
Venue: Journal of Computational Physics (2009)

We consider the problem of developing O(N) scaling grid-based operations needed in many central operations when performing electronic structure calculations with numeric atom-centered orbitals as basis functions. We outline the overall formulation of localized algorithms, and specifically the creation of localized grid batches. The choice of the grid partitioning scheme plays an important role in the performance and memory consumption of the grid-based operations. Three different top-down partitioning methods are investigated, and compared with formally more rigorous yet much more expensive bottom-up algorithms. We show that a conceptually simple top-down grid partitioning scheme achieves essentially the same efficiency as the more rigorous bottom-up approaches.
Proximal Labeling for Oblivious Routing in Wireless Ad Hoc Networks
Authors: Edgar Chávez, Maia Fraser, Héctor Tejeda
Venue: Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks (2009)

For an adhoc network with n nodes, we propose a proactive routing protocol without routing tables which uses O(logn) bits per node for the location service tables. The algorithm is based on 1-dimensional virtual coordinates, which we call labels. The decision of where to forward a packet is oblivious and purely local, depending only on the labels of the immediate neighbours and the label of the destination: the packet is forwarded to the neighbour whose label is closest to that of the destination. The algorithm is based on mapping the network to an ordered list where each node has one or more integer labels. This labeling can be produced by any arbitrary traversal of the network visiting all the nodes, in particular by a depth-first search of a flood tree which gives a 2n length traversal. We show experimentally that, in terms of hop number, our routing algorithm is far superior to geographic protocols in randomly generated networks and for sparse networks produces routes of length very close to those of the shortest path.
Estimation of non-stationary delay for a linear discrete dynamic plant
Authors: A. Yu. Torgashov
Venue: Automation and Remote Control (2009)

A nonlinear recurrent gradient-type algorithm is proposed for estimation of nonstationary delay arising in finite impulse response of a linear discrete dynamic plant. Convergence of the algorithm is investigated. Using linear matrix inequalities, its optimal functioning is investigated in order to provide for the maximal rate of convergence of the estimation error to zero.