ppxscal/embedding_network huggingface dataset:
On Reconfiguration of Disks in the Plane and Related Problems
Authors: Adrian Dumitrescu, Minghui Jiang
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We revisit two natural reconfiguration models for systems of disjoint objects in the plane: translation and sliding. Consider a set of n pairwise interior-disjoint objects in the plane that need to be brought from a given start (initial) configuration S into a desired goal (target) configuration T, without causing collisions. In the translation model, in one move an object is translated along a fixed direction to another position in the plane. In the sliding model, one move is sliding an object to another location in the plane by means of an arbitrarily complex continuous motion (that could involve rotations). We obtain several combinatorial and computational results for these two models:(I) For systems of n congruent disks in the translation model, Abellanas et al.[1] showed that 2n ¿ 1 moves always suffice and $\lfloor 8n/5 \rfloor$ moves are sometimes necessary for transforming the start configuration into the target configuration. Here we further improve the lower bound to $\lfloor 5n/3 \rfloor -1$, and thereby give a partial answer to one of their open problems.(II) We show that the reconfiguration problem with congruent disks in the translation model is NP-hard, in both the labeled and unlabeled variants. This answers another open problem of Abellanas et al.[1].(III) We also show that the reconfiguration problem with congruent disks in the sliding model is NP-hard, in both the labeled and unlabeled variants.(IV) For the reconfiguration with translations of n arbitrary convex bodies in the plane, 2n moves are always sufficient and sometimes necessary.
A Routing Algorithm for ZigBee Network Based on Dynamic Energy Consumption Decisive Path
Authors: Fenghui Zhang, Huiling Zhou, Xiaoguang Zhou
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

The energy-efficiency usage is relative to each layer of wireless sensor networks. In order to improve the ZigBee mesh routing protocol for energy-efficiency usage, we propose a routing algorithm combining AODVjr with the node residual energy. To reduce the energy consumption of bottleneck nodes and extend network lifetime, the improved routing algorithm aims to build a new balancing method between the energy-aware routing metric and the shortest path. Based on the energy model of CC2430 RF transceiver, the implemented routing protocol is simulated using NS2 (Network Simulator version 2). Simulation result shows that this improved protocol can extend the network lifetime very efficiently.
Anomaly-Based Detection of IRC Botnets by Means of One-Class Support Vector Classifiers
Authors: Claudio Mazzariello, Carlo Sansone
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

The complexity of modern cyber attacks urges for the definition of detection and classification techniques more sophisticated than those based on the well known signature detection approach. As a matter of fact, attackers try to deploy armies of controlled bots by infecting vulnerable hosts. Such bots are characterized by complex executable command sets, and take part in cooperative and coordinated attacks. Therefore, an effective detection technique should rely on a suitable model of both the envisaged networking scenario and the attacks targeting it.We will address the problem of detecting botnets, by describing a behavioral model, for a specific class of network users, and a set of features that can be used in order to identify botnet-related activities. Tests performed by using an anomaly-based detection scheme on a set of real network traffic traces confirmed the effectiveness of the proposed approach.
Active contours driven by local Gaussian distribution fitting energy
Authors: Li Wang, Lei He, Arabinda Mishra, Chunming Li
Venue: Signal Processing (2009)

This paper presents a new region-based active contour model in a variational level set formulation for image segmentation. In our model, the local image intensities are described by Gaussian distributions with different means and variances. We define a local Gaussian distribution fitting energy with a level set function and local means and variances as variables. The energy minimization is achieved by an interleaved level set evolution and estimation of local intensity means and variances in an iterative process. The means and variances of local intensities are considered as spatially varying functions to handle intensity inhomogeneities and noise of spatially varying strength (e.g. multiplicative noise). In addition, our model is able to distinguish regions with similar intensity means but different variances. This is demonstrated by applying our method on noisy and texture images in which the texture patterns of different regions can be distinguished from the local intensity variance. Comparative experiments show the advantages of the proposed method.
Research on Coordination Mechanism of Two-Stage Transaction in Supply Chain
Authors: Guangshu Chang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

With increasingly intense competition between enterprises, the realization of advanced supply chain management has become an exquisite premise for the survival of firms. Procurement management is an important means to reduce costs and to enhance the competitive advantage. In this paper, the effect of information technology (IT) cost was considered completely, and the coordination mechanism in two-stage transaction between the members of supply chain was analyzed and compared by utilizing continuous newsvendor model, so as to quantify the effect of the Internet on supply chain relationship coordination. Finally, the validity of the model was verified through a case study.
Learning from Risk Assessment in Radiotherapy
Authors: Enda F. Fallon, Liam Chadwick, Wil Putten
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

The lessons learned from completing a risk assessment of a radiotherapy information system in a public hospital are presented. A systems engineering perspective with respect to the risk assessment was adopted. Standard engineering tools modified for application in healthcare environments were applied, e.g. HFMEATM. It was found that there was a complete absence of the application of systems engineering at the development stage of the radiotherapy system, however aspects of quality systems, i.e. process improvement, were present at the operating stage. Team work played a significant role in the successful operation of the system. However, in contrast to most engineering systems, team composition was highly heterogeneous as roles were clearly defined by professional qualification. There were strong boundaries between the radiotherapy team and other teams in the hospital. This was reflected by their lack of concern regarding the availability of patient information beyond their own department.
Brief paper: Design and implementation of an autonomous flight control law for a UAV helicopter
Authors: Kemao Peng, Guowei Cai, Ben M. Chen, Miaobo Dong, Kai Yew Lum, Tong H. Lee
Venue: Automatica (Journal of IFAC) (2009)

In this paper, we present the design and implementation of an autonomous flight control law for a small-scale unmanned aerial vehicle (UAV) helicopter. The approach is decentralized in nature by incorporating a newly developed nonlinear control technique, namely the composite nonlinear feedback control, together with dynamic inversion. The overall control law consists of three hierarchical layers, namely, the kernel control, command generator and flight scheduling, and is implemented and verified in flight tests on the actual UAV helicopter. The flight test results demonstrate that the UAV helicopter is capable of carrying out complicated flight missions autonomously.
ITIL V3 Service Lifecycle Service Design (SD) Certification Exam Preparation Course in a Book for Passing the ITIL V3 Service Lifecycle Service Design ... on Your First Try Certification Study Guide
Authors: Ivanka Menken, Gerard Blokdijk
Venue:  (2009)

This self-study exam preparation guide for the ITIL V3 Service Lifecycle Service Design (SD) certification exam contains everything you need to test yourself and pass the Exam, including all the processes, and inputs and outputs. Exam topics are covered and insider secrets, complete explanations of all ITIL V3 subjects, test tricks and tips, numerous highly realistic sample questions, and exercises designed to strengthen understanding of ITIL V3 concepts and prepare you for exam success on the first attempt are provided. Can you imagine valuing a book so much that you send the author a "Thank You" letter? Tens of thousands of people understand why the material by The Art of Service is a worldwide best-seller. Is it their years of ITIL experience? The endless hours of ongoing research? The interviews with those who failed the exam, to identify gaps in their knowledge? Or is it the razor-sharp focus on making sure you don't waste a single minute of your time studying any more than you absolutely have to? Actually, it's all of the above. This book includes new exercises and sample questions never before in print. Offering numerous sample questions, critical time-saving tips plus information available nowhere else, this book will help you pass the ITIL V3 Service Lifecycle Service Design (SD) exam on your FIRST try. Done the ITIL V3 Service Lifecycle Service Design (SD) course, up to speed with the theory? Buy this. Read it. And Pass the ITIL V3 Service Lifecycle Service Design (SD) Exam.
Hierarchies and Characterizations of Stateless Multicounter Machines
Authors: Oscar H. Ibarra, Ömer Eğecioğlu
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

We investigate the computing power of stateless multi- counter machines with reversal-bounded counters. Such a machine can be deterministic, nondeterministic, realtime (the input head moves right at every step), or non-realtime. The deterministic realtime stateless multicounter machines has been studied elsewhere [1]. Here we investigate non-realtime machines in both deterministic and nondeterministic cases with respect to the number of counters and reversals. We also consider closure properties and relate the models to stateless multihead automata and show that the bounded languages accepted correspond exactly to semilinear sets.
VOF Method for Fluids and Solids on Octree Structure
Authors: Roman Durikovic, Milan Kupka
Venue: Proceedings of the 2009 Second International Conference in Visualisation (2009)

Fluid simulation, proposed here, runs on an unrestricted octree data structure which uses mesh refinement techniques to enable higher level of detail and solves Navier Stokes equations for multiple fluids. We also show our solution for floating objects and unmoving obstacles by setting up the boundry conditions and solving the velocity of objects using a simple rigid body solver.We propose technique for discretizing the Poisson equation on octree grid. The resulting linear system is symmetric positive definite enabling the use of fast solution methods. The standard approximation to the Poisson equation on an octree grid results in a non-symmetric linear system which is more computationally challenging. To solve the advection of fluid we use the semi-Lagrangian characteristic tracing technique. To track the fluid surface we use Volume of Fluid (VOF) method.
Active Disturbance Rejection Control of Servo Systems with Friction
Authors: Zhou Tao, Weiqun Shu, Wang Lei, Zhou Yang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Friction exists in all motions, and friction is the key factor that influences the low velocity performance of servo systems. It usually caused the steady-state error of servo systems and resulted in the creeping phenomenon in low velocity motions. Friction is complicated nonlinear process with time-varying uncertainties. The traditional PID controller of servo systems with fricition was not satisfactory in control precision. The algorithms and principles of a new ADRC (active disturbance rejection controller) were analyzed in the paper. Then the ADRC of the high precision servo system was designed. Moreover the effects of estimating and compensating the friction force in the ADRC servo system were studied through simulation tests using Matlab and Simulink in the paper. The results of simulation tests showed that ADRC algorithms had higher position tracking precision. It could eliminate the oscillation and steady-state error of the servo system completely.
CoreSec: an ontology of security aplied to the business process of management
Authors: Ryan Ribeiro de Azevedo, Fred Freitas, Silas Cardoso de Almeida, Marcelo José S. C. Almeida, Edson C. de Barros C. Filho, Wendell Campos Veras
Venue: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems (2008)

The different environments of human performance need transparent ways to plan and manage related problems for security. There is a significant increase in the complexity project and plan security, it needs that means of manipulation of the information has been adopted. In this paper we present the CoreSec an CoreOntology for the Security domain. Our proposal considers that the security will be more efficient if this will be based on a formal information model of the domain, as an ontology. The architecture presented here intends to be the most generic possible, facilitating the development of security solutions.
Clustering Algorithm Based on Semantic Distance for XML Documents
Authors: Lingxian Yang, Jinguang Gu, Heping Chen
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

As the information grows exponentially, it has become a new and basic requirement to reduce the querying area efficiently and accurately for information querying. This paper proposes a semantic distance based clustering algorithm for XML documents. It discusses the algorithm in two steps, Firstly, it forms some DTD clusters with all heterogeneous DTD documents by using the global semantic dictionary, Secondly, it computes the semantic distance between XML documents which corresponded certain DTD cluster, then build some finally XML clusters according threshold value given beforehand. Users can locate document cluster and query within this area without extending all over XML documents, and the querying results satisfying the users' requirements can be returned rapidly. The experiments show that this algorithm has good categorization function, and can facilitate information querying.
Example-based rescoring of statistical machine translation output
Authors: Michael Paul, Eiichiro Sumita, Seiichi Yamamoto
Venue: Proceedings of HLT-NAACL 2004: Short Papers on XX (2004)

Conventional statistical machine translation (SMT) approaches might not be able to find a good translation due to problems in its statistical models (due to data sparseness during the estimation of the model parameters) as well as search errors during the decoding process. This paper1 presents an example-based rescoring method that validates SMT translation candidates and judges whether the selected decoder output is good or not. Given such a validation filter, defective translations can be rejected. The experiments show a drastic improvement in the overall system performance compared to translation selection methods based on statistical scores only.
Ubiquitous Personal Study: a framework for supporting information access and sharing
Authors: Hong Chen, Qun Jin
Venue: Personal and Ubiquitous Computing (2009)

The information resources on the Web are diversified, the amount of which is increasing rapidly. Demands for selecting useful information from the Internet, managing personal contents, and sharing contents under control have risen. In this study, we propose the Ubiquitous Personal Study, a framework of personalized virtual study to support accessing, managing, organizing, sharing and recommending information. In this paper, we focus on discussing the framework, and design and implementation issues on how to implement it with Web 2.0 mash-up technology and Open Source Software.
How to be cute on all desktops with qt
Authors: Johan Thelin
Venue: Linux Journal (2009)

It's not called Qt for nuttin. 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
Comparing rule-based and data-driven selection of facial displays
Authors: Mary Ellen Foster
Venue: Proceedings of the Workshop on Embodied Language Processing (2007)

The non-verbal behaviour of an embodied conversational agent is normally based on recorded human behaviour. There are two main ways that the mapping from human behaviour to agent behaviour has been implemented. In some systems, human behaviour is analysed, and then rules for the agent are created based on the results of that analysis; in others, the recorded behaviour is used directly as a resource for decision-making, using data-driven techniques. In this paper, we implement both of these methods for selecting the conversational facial displays of an animated talking head and compare them in two user evaluations. In the first study, participants were asked for subjective preferences: they tended to prefer the output of the data-driven strategy, but this trend was not statistically significant. In the second study, the data-driven facial displays affected the ability of users to perceive user-model tailoring in synthesised speech, while the rule-based displays did not have any effect.
Privacy-Preserving Distributed k-Nearest Neighbor Mining on Horizontally Partitioned Multi-Party Data
Authors: Feng Zhang, Gansen Zhao, Tingyan Xing
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

k -Nearest Neighbor (k -NN) mining aims to retrieve the k most similar objects to the query objects. It can be incorporated into many data mining algorithms, such as outlier detection, clustering, and k -NN classification. Privacy-preserving distributedk -NN is developed to address the issue while preserving the participants' privacy. Several two-party privacy-preserving k -NN mining protocols on horizontally partitioned data had been proposed, but they fail to deal with the privacy issue when the number of the participating parties is greater than two. This paper proposes a set of protocols that can address the privacy issue when there are more than two participants. The protocols are devised with the probabilistic public-key cryptosystem and the communicative cryptosystem as the core privacy-preserving infrastructure. The protocols' security is proved based on the Secure Multi-party Computation theory.
A smoothed two- and three-dimensional interface reconstruction method
Authors: Stewart Mosso, Christopher Garasi, Richard Drake
Venue: Computing and Visualization in Science (2009)

The Patterned Interface Reconstruction algorithm reduces the discontinuity between material interfaces in neighboring computational elements. This smoothing improves the accuracy of the reconstruction for smooth bodies. The method can be used in two- and three-dimensional Cartesian and unstructured meshes. Planar interfaces will be returned for planar volume fraction distributions. The algorithm is second-order accurate for smooth volume fraction distributions.
Zeros and logarithmic asymptotics of Sobolev orthogonal polynomials for exponential weights
Authors: C. Díaz Mendoza, R. Orive, H. Pijeira Cabrera
Venue: Journal of Computational and Applied Mathematics (2009)

We obtain the (contracted) weak zero asymptotics for orthogonal polynomials with respect to Sobolev inner products with exponential weights in the real semiaxis, of the form x^@ce^-^@f^(^x^), with @c>0, which include as particular cases the counterparts of the so-called Freud (i.e., when @f has a polynomial growth at infinity) and Erdos (when @f grows faster than any polynomial at infinity) weights. In addition, the boundness of the distance of the zeros of these Sobolev orthogonal polynomials to the convex hull of the support and, as a consequence, a result on logarithmic asymptotics are derived.
Data Compression on Multisets. Submultiset-Free Codes
Authors: Cosmin Bonchis, Gabriel Ciobanu, Graiela Ghergu, Cornel Izbasa
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Regular data compression converts a sequence of symbols into a sequence of strings (descriptions), assigning the shortest descriptions to the most frequent symbols produced by the data source. By contrast, here we consider the compression of a sequence of symbols to a sequence of multisets. This is relevant if the communication channel does not preserve order (positioning) of the transmitted letters, as is the case in many biological contexts; for example, if you regard the passage of a multiset of molecules through a blood vessel as an information transfer. We introduce the concept of submultiset-free codes, a counterpart to the existing concept of prefix-free codes. We derive a theorem about the structure of optimal submultiset codes for uniform random variables and we describe an algorithm for constructing them.
Reasoning by regression: pre-and postdiction procedures for logics of action and change with nondeterminism
Authors: Marcus Bjareland, Lars Karlsson
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

In this paper we introduce regression-based pre- and postdiction procedures for PMON, a nonmonotonic logic for action and change with explicit time. We also provide an in depth analysis of problems with regression that occur when nondeterministic actions are introduced. We do this by employing Dijkstra's weakest liberal precondition operator, wlp. The presented work is related to recent work by Lin in the situation calculus, and we identify and deal with three problems with his approach. Our conjecture is that our approach can be mapped back to the situation calculus.