ppxscal/embedding_network huggingface dataset:
Algorithms for a realistic variant of flowshop scheduling
Authors: B. Naderi, Rubén Ruiz, M. Zandieh
Venue: Computers and Operations Research (2010)

This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and parallel machine problems by considering stages with parallel machines instead of having one single machine per stage. We also investigate the flexible version where stage skipping might occur, i.e., not all stages must be visited by all jobs. Lastly, we also consider job sequence dependent setup times per stage. The optimization criterion considered is makespan minimization. While many approaches for hybrid flowshops have been proposed, hybrid flexible flowshops have been rarely studied. The situation is even worse with the addition of sequence dependent setups. In this study, we propose two advanced algorithms that specifically deal with the flexible and setup characteristics of this problem. The first algorithm is a dynamic dispatching rule heuristic, and the second is an iterated local search metaheuristic. The proposed algorithms are evaluated by comparison against seven other high performing existing algorithms. The statistically sound results support the idea that the proposed algorithms are very competitive for the studied problem.
Client-side event processing for personalized web advertisement
Authors: Roland Stühmer, Darko Anicic, Nenad Stojanovic, Sinan Sen
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

In this demo we show the current state of our client-side rule engine for the Web. The engine is accompanied by a rule language for event-condition-action expressions especially tailored to be run on JavaScript-enabled clients. Rules may contain complex event patterns, complex condition predicates and several types of actions. Our goal is to establish the presented rule engine as a framework to enable context-driven, personalized advertising on the Web.
Clustering of the Human Skeletal Muscle Fibers Using Linear Programming and Angular Hilbertian Metrics
Authors: Radhouène Neji, Ahmed Besbes, Nikos Komodakis, Jean-François Deux, Mezri Maatouk, Alain Rahmouni, Guillaume Bassez, Gilles Fleury, Nikos Paragios
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

In this paper, we present a manifold clustering method for the classification of fibers obtained from diffusion tensor images (DTI) of the human skeletal muscle. Using a linear programming formulation of prototype-based clustering, we propose a novel fiber classification algorithm over manifolds that circumvents the necessity to embed the data in low dimensional spaces and determines automatically the number of clusters. Furthermore, we propose the use of angular Hilbertian metrics between multivariate normal distributions to define a family of distances between tensors that we generalize to fibers. These metrics are used to approximate the geodesic distances over the fiber manifold. We also discuss the case where only geodesic distances to a reduced set of landmark fibers are available. The experimental validation of the method is done using a manually annotated significant dataset of DTI of the calf muscle for healthy and diseased subjects.
An Optimal Approach to Collaborative Target Tracking with Performance Guarantees
Authors: Jason Derenick, John Spletzer, Ani Hsieh
Venue: Journal of Intelligent and Robotic Systems (2009)

In this paper, we present a discrete-time optimization framework for target tracking with multi-agent systems. The "target tracking" problem is formulated as a generic semidefinite program (SDP) that when paired with an appropriate objective yields an optimal robot configuration over a given time step. The framework affords impressive performance guarantees to include full target coverage (i.e. each target is tracked by at least a single team member) as well as maintenance of network connectivity across the formation. Key to this work is the result from spectral graph theory that states the second-smallest eigenvalue--¿ 2--of a weighted graph's Laplacian (i.e. its inter-connectivity matrix) is a measure of connectivity for the associated graph. Our approach allows us to articulate agent-target coverage and inter-agent communication constraints as linear-matrix inequalities (LMIs). Additionally, we present two key extensions to the framework by considering alternate tracking problem formulations. The first allows us to guarantee k-coverage of targets, where each target is tracked by k or more agents. In the second, we consider a relaxed formulation for the case when network connectivity constraints are superfluous. The problem is modeled as a second-order cone program (SOCP) that can be solved significantly more efficiently than its SDP counterpart--making it suitable for large-scale teams (e.g. 100's of nodes in real-time). Methods for enforcing inter-agent proximity constraints for collision avoidance are also presented as well as simulation results for multi-agent systems tracking mobile targets in both ¿2 and ¿3.
Topology Control in Large-Scale High Dynamic Mobile Ad-Hoc Networks
Authors: Mohamed El-Habbal, Ulrich Rückert, Ulf Witkowski
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

We present our contribution in projects related to ad-hoc networking using different routing protocols and hardware platforms, showing our results and new solutions regarding topology control and routing protocols. We mainly focus on our work in the GUARDIANS EU-project, where as a main disaster scenario a large industrial warehouse on fire is assumed. The paper presents the simulation results for the routing protocols ACR, DSR and EDSR, as well as the implementation of down-scaled demos for supporting the autonomous team of robots as well as the human squad team with robust communication coverage. Various hardware platforms were used in the demos for distance measurement, based on laser range finder and radio communication with time of flight analysis.
Computing differential invariants of hybrid systems as fixedpoints
Authors: André Platzer, Edmund M. Clarke
Venue: Formal Methods in System Design (2009)

We introduce a fixedpoint algorithm for verifying safety properties of hybrid systems with differential equations whose right-hand sides are polynomials in the state variables. In order to verify nontrivial systems without solving their differential equations and without numerical errors, we use a continuous generalization of induction, for which our algorithm computes the required differential invariants. As a means for combining local differential invariants into global system invariants in a sound way, our fixedpoint algorithm works with a compositional verification logic for hybrid systems. With this compositional approach we exploit locality in system designs. To improve the verification power, we further introduce a saturation procedure that refines the system dynamics successively with differential invariants until safety becomes provable. By complementing our symbolic verification algorithm with a robust version of numerical falsification, we obtain a fast and sound verification procedure. We verify roundabout maneuvers in air traffic management and collision avoidance in train control and car control.
Using Higher-Order Dynamic Bayesian Networks to Model Periodic Data from the Circadian Clock of Arabidopsis Thaliana
Authors: Rónán Daly, Kieron D. Edwards, John S. O'Neill, Stuart Aitken, Andrew J. Millar, Mark Girolami
Venue: Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics (2009)

Modelling gene regulatory networks in organisms is an important task that has recently become possible due to large scale assays using technologies such as microarrays. In this paper, the circadian clock of Arabidopsis thaliana is modelled by fitting dynamic Bayesian networks to luminescence data gathered from experiments. This work differs from previous modelling attempts by using higher-order dynamic Bayesian networks to explicitly model the time lag between the various genes being expressed. In order to achieve this goal, new techniques in preprocessing the data and in evaluating a learned model are proposed. It is shown that it is possible, to some extent, to model these time delays using a higher-order dynamic Bayesian network.
An Intelligence Audio Watermarking Based on DWT- SVD Using ATS
Authors: Sartid Vongpraphip, Mahasak Ketcham
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

All three, Discrete Wavelet Transform (DWT) - Singular Value Decomposition (SVD) and Adaptive Tabu Search (ATS) have been used as mathematical tools for embedding data into an audio signal. In this paper, we present a new robust audio watermarking scheme based on DWT-SVD and ATS. After applying the DWT to the cover audio signal, we map the DWT coefficients, and apply the SVD, we search for the optimal intensity of audio watermarking by using the ATS. Experimental results show that the watermarking method performs well in both security and robustness to many digital signals processing, such as filtering, cropping, mp3 and random noise.
The Adaptive Control Method for Preheating and Stretching Process of Geogrid
Authors: Wang Qiang, Long Wei, Wu Chong
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Preheating and stretching process is the key step of the product process of geogrid. To improve temperature control effect, a single parameter PID adaptive control algorithm is used in this article, which can easily be realized by software, and a temperature-speed double control system is brought in which based on the temperature-speed relation in the process of stretching. The temperature and speed can be kept at a best joint point by the way of adjusting the temperature and speed automatically in this system. It can largely improve the stability of the system and the stretching speed.
Using Multicast Transfers in the Replica Migration Problem: Formulation and Scheduling Heuristics
Authors: Nikos Tziritas, Thanasis Loukopoulos, Petros Lampsas, Spyros Lalis
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Performing replica migrations in the minimum possible time, also called the Replica Migration Problem (RMP), is crucial in distributed systems using replication. In this paper we tackle RMP when multicast transfers are available. We give a formal problem statement as a Mixed Integer Programming problem. It turns out that the problem is NP-hard. Therefore, we resolve to scheduling heuristics in order to find good solutions. Through simulations we identify different tradeoffs between performance and execution time and conclude on the most attractive approaches.
Early development of graphical user interface (GUI) in agile methodologies
Authors: Caroline Labib, Ehab Hasanein, Osman Hegazy
Venue: Journal of Computational Methods in Sciences and Engineering (2009)

The Agile methodologies have shown success over plan-driven methodologies especially in web development due to their ability to adapt to new requirement changes. Agile methodologies are based on a set of values, principles and practices. However, the development of Graphical User Interface (GUI) is not well addressed in the agile methodologies. In this paper we introduce a practice that aims at early development of GUI in agile methodologies. The proposed practice supports agile principles and values by helping in getting early customer feedback on the user interface.
Extending a Software Component Repository to Provide Services
Authors: Anderson Marinho, Leonardo Murta, Cláudia Werner
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

A Software Component Repository is a tool that supports component based development (CBD). Generally, most of the existing repositories only provide components physically, not considering another important way of pro viding them: as services. Therefore, this paper presents an infrastructure for providing component services in a component repository. This infrastructure deals with access control, utilization monitoring, components to services con version, and composite services generation issues.
Three-Party Quantum Secret Sharing Based on Secure Direct Communication
Authors: Liu Yanyan, Xu Chengqian
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Inspired by quantum secure direct communication and quantum dense coding, we present a three-party quantum secret sharing (QSS) scheme by quantum teleportation. After performing the rectilinear basis or diagonal basis measurement randomly for the eavesdropping check to ensure the security of the quantum channel, the sender encodes the secret messages directly on a series of Einstein-Podolsky-Rosen (EPR) pairs and transmits them to the receivers by quantum teleportation. Neither of the receivers can decode the secret messages on his own even if they collaborate. Only the two receivers combine their measurement results with the sender's result, can they recover the secret messages. In this scheme, one qubit can encode two bits of classical information because quantum dense coding is introduced. Using quantum teleportation, the distinct advantage of this scheme is that there is not the transmission of qubits carrying the secret messages in the quantum channel, it is absolutely secure for QSS if a perfect channel is used.
Design and Tool Flow of Multimedia MPSoC Platforms
Authors: Bjorn De Sutter, Diederik Verkest, Erik Brockmeyer, Eric Delfosse, Arnout Vandecappelle, Jean-Yves Mignolet
Venue: Journal of Signal Processing Systems (2009)

This paper surveys components that are useful to build programmable, predictable, composable, and scalable multiprocessor-system-on-a-chip (MPSoC) multimedia platforms that can deliver high performance at high power-efficiency. A design-time tool flow is proposed to exploit all forms of parallelism on such platforms. As a first proof of concept, the flow is used to parallelize a relatively simple video standard on a platform consisting of off-the-shelf components. As a second proof of concept, we present the design of a high-performance platform with state-of-the-art components. This platform targets real-time H.264 high-definition video encoding at an estimated power consumption of 700 mW.
Approximate controllability of semilinear partial functional differential systems
Authors: Xianlong Fu, Kaidong Mei
Venue: Journal of Dynamical and Control Systems (2009)

In this paper, we study the approximate controllability of semilinear neutral functional-differential systems and impulsive functional-differential systems with finite delay. Since the considered equations admit nonlinear terms involving spatial derivatives, the fraction power theory and ¿-norm is used to discuss the problem so that the established results can be applied to them. An example is provided to illustrate the application of the obtained results.
A GPU-Based Simulation of Tsunami Propagation and Inundation
Authors: Wen-Yew Liang, Tung-Ju Hsieh, Muhammad T. Satria, Yang-Lang Chang, Jyh-Perng Fang, Chih-Chia Chen, Chin-Chuan Han
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

Tsunami simulation consists of fluid dynamics, numerical computations, and visualization techniques. Nonlinear shallow water equations are often used to model the tsunami propagation. By adding the friction slope to the conservation of momentum, it also can model the tsunami inundation. To solve these equations, we use the second order finite difference MacCormack method. Since it is a finite difference method, it brings the possibility to be parallelized. We use the parallelism provided by GPU to speed up the computations. By loading data as textures in GPU memory, the computation processes can be written as shader programs and the operations will be done by GPU in parallel. The results show that with the help of GPU, the simulation can get a significant improvement in the execution time for each of the computation steps.
A boundary element method for the Dirichlet eigenvalue problem of the Laplace operator
Authors: O. Steinbach, G. Unger
Venue: Numerische Mathematik (2009)

The solution of eigenvalue problems for partial differential operators by using boundary integral equation methods usually involves some Newton potentials which may be resolved by using a multiple reciprocity approach. Here we propose an alternative approach which is in some sense equivalent to the above. Instead of a linear eigenvalue problem for the partial differential operator we consider a nonlinear eigenvalue problem for an associated boundary integral operator. This nonlinear eigenvalue problem can be solved by using some appropriate iterative scheme, here we will consider a Newton scheme. We will discuss the convergence and the boundary element discretization of this algorithm, and give some numerical results.
Cross Sensitivity Study for Ammonia Detection in Ultra Violet Region Using an Optical Fibre Sensor
Authors: Hadi Manap, Gerald Dooly, Razali Muda, Sinead O'Keeffe, Elfed Lewis
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

This paper describes an optical fibre sensor for the monitoring of ammonia gas. An open path optical technique is used to analyze the absorption lines of ammonia within the ultra violet region. A cross sensitivity study mainly regarding water vapor and the advantage of using ultra violet light have been discussed. Experimental results describing the operation of the sensor are presented and are compared with theory. The optical sensor for ammonia shows very promising results and are very close to the theoretical spectrum.
Activity recognition through goal-based segmentation
Authors: Jie Yin, Dou Shen, Qiang Yang, Ze-Nian Li
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

A major issue in activity recognition in a sensor network is how to automatically segment the low-level signal sequences in order to optimize the probabilistic recognition models for goals and activities. Past efforts have relied on segmenting the signal sequences by hand, which is both time-consuming and error-prone. In our view, segments should correspond to atomic human activities that enable a goal-recognizer to operate optimally; the two are intimately related. In this paper, we present a novel method for building probabilistic activity models at the same time as we segment signal sequences into motion patterns. We model each motion pattern as a linear dynamic model and the transitions between motion patterns as a Markov process conditioned on goals. Our EM learning algorithm simultaneously learns the motion-pattern boundaries and probabilistic models for goals and activities, which in turn can be used to accurately recognize activities in an online phase. A major advantage of our algorithm is that it can reduce the human effort in segmenting and labeling signal sequences. We demonstrate the effectiveness of our algorithm using the data collected in a real wireless environment.
Bloggers' Social Presence Framing and Blog Visitors' Responses
Authors: Hsiu-Ju Chen
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Recently, blogs boom with easy publishing tools to lager popularity on the internet. And with broad links, blogs become important information sources. Some enterprises even have chosen blogs as a channel for products/services promotion. Bloggers introduce news and goods to blog visitors and present related information. However, when receiving diversely framed information, people react differently. According to the social presence perspective, communications perceived of higher social presence are easier to make people interpersonally impressed, and are more pervasive. Therefore, this study clarifies the impact of bloggers’ social presence framing on the replies of blog visitors. This study adopted content analysis to analyze bloggers’ posts and blog visitors’ reply posts on popular websites. After content analysis, the regression results showed that bloggers’ social presence framing attracted larger popularity of blog visitors’ replies and affected their positive reply attitude toward specific product/service in positive events. Besides, the framings both showed significantly positive impact in goods of search type and experience type.
Numbering of Nodes in a Communication Network
Authors: Kamalesh V. N., S. K. Srivatsa
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

The link deficit algorithm proposed by Steigletiz, Weiner and Kletman is a heuristic to generate a potential network topology.This heuristic begins by numbering the nodes at random.If the nodes are numbered in a systematic manner, the link deficit algorithm yields a starting network which needs relatively lesser amount of perturbation before an acceptable network is found.Few methods for systematic numbering of nodes in a computer communication network have been proposed in the literature. Earlier we have proposed two graph theory based method for systematic numbering of nodes in a computer communication network. The nodes are numbered based on the eccentricity values. However the nodes having the same eccentricity values will end up in a tie. This article aims at resolving the eccentricity tie.
A multi-agent simulator for teaching police allocation
Authors: Vasco Furtado, Eurico Vasconcelos
Venue: Proceedings of the 17th conference on Innovative applications of artificial intelligence - Volume 3 (2005)

This article describes the ExpertCop tutorial system, a simulator of the crime in an urban region. In ExpertCop, the students (police officers) configure and allocate an available police force according to a selected geographic region and then interact with the simulation. The student interprets the results with the help of an intelligent tutor, the Pedagogical Agent, observing how the crime behaves in the presence of the allocated preventive policing. The interaction between domain agents representing social entities as criminals and police teams drives the simulation. ExpertCop induces students to reflect on resource allocation. The pedagogical agent implents interaction strategies between the student and the geosimulator, designed to make simulated phenomena better understood. In particular, the agent uses a machine learning algorithm to identify patterns on simulation data and to formulate questions to the student about these patterns. Moreover, it explores the reasoning process of the domain agents by providing explanations that help the student to understand simulation events.
Expropriation of the Biggest Shareholdings Based on Principal Component Analysis in Neural Networks
Authors: Haisheng Li
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

The neural networks may play an important role in statistical model building. As the basic model building tool of the mathematics and economics neural networks can help specialist and researcher. The neural networks will improve the financial research work. The expropriation is a kind of extra interest, which exceeds the income of the biggest shareholdings normally, illegally occupied by the biggest ones. After the true repayment of control power and social expenditure, it should be shared originally by the small ones commonly. The empirical evidence results indicate that the expropriation of extra interest from the primary power is negatively related to the income per share. Consequently, we provide theoretical and practical evidence for neural networks as a standard approach.