ppxscal/embedding_network huggingface dataset:
Single-Holed Regions: Their Relations and Inferences
Authors: Maria Vasardani, Max J. Egenhofer
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

The discontinuities in boundaries and exteriors that regions with holes expose offer opportunities for inferences that are impossible for regions without holes. A systematic study of the binary relations between single-holed regions shows not only an increase in the number of feasible relations (from eight between two regions without holes to 152 for two single-holed regions), but also identifies the increased reasoning power enabled by the holes. A set of quantitative measures is introduced to compare various composition tables over regions with and without holes. These measures reveal that inferences over relations for holed regions are overall crisper and yield more unique results than relations over regions without holes. Likewise, compositions that involve more holed regions than regions without holes provide crisper inferences, which supports the need for relation models that capture holes explicitly.
A New Solution to Changes of Business Entities in Hospital Information Systems
Authors: Zhijun Rong, Jinsong Xiao, Binbin Dan
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

A Hospital information system (HIS) has been proposed to respond to some challenges of the complex business process in a hospital. The business processes undergo constant change and the HIS needs to swiftly adapt to reflect these changes. This paper proposes an approach, which is used to define services and solutions for hospital applications according to the business-entity changes in the hospital business processes. The objective of this approach is to minimize the effect of business requirement changes on the system development. Focusing on the transition from the process-oriented to the application-oriented perspectives, some central development considerations are also presented, which can be used to guide the design of service-based interoperability and illustrate these aspects with examples from our current work. This solution will improve the robustness and extensibility of HIS.
Automatic spatial analysis and pedestrian flow control for&#x00a0;real-time crowd simulation in an urban environment
Authors: M. Haciomeroglu, R. G. Laycock, A. M. Day
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Distributing a collection of virtual humans throughout a large urban environment, where limited semantic information is available, poses a problem when attempting to create a visually realistic real-time environment. Randomly positioning agents within an urban environment will not cover the environment with virtual humans in a plausible way. For example, areas of the urban space that are more frequently used should have a higher population density both at the start and during the simulation. It is infeasible to manually identify all the areas in the urban environment which should be crowded or sparsely populated when considering a scalable method, suitable for large environments. Consequently, this paper combines and extends techniques from spatial analysis and virtual agent behaviour simulations to develop a system capable of automatically distributing pedestrians in an urban environment. In particular, it extends the Point-Based Space Syntax technique to enable the automatic analysis of a large urban environment in the presence of limited contextual information. This analysis specifies a set of population densities for areas in the environment and these values are used to initialise the locations of all the virtual humans in the environment. In addition to the initialisation stage the population densities in each area are consulted to ensure that the correct distribution of virtual humans is maintained throughout the simulation. The system is tested on an arbitrary section of a real city and comparisons of the characteristic parts of the test environment are correlated with the pedestrian movements.
Reinforcement learning for appearance based visual servoing in robotic manipulation
Authors: Umar Khan, Liaquat Ali Khan, S. Zahid Hussain
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

The objective of this paper is to develop a new appearance based visual servoing method that needs no prior structuring of the environment and also eliminates the correspondence problem associated with conventional visual servoing methods. Detailed description of object appearance and its generation are provided in this paper. In addition, owing to the non-linear and high dimensional nature of the object appearance a Machine Learning method known as Reinforcement Learning is to generate the controller.
Adaptive Solutions for Access Control within Pervasive Healthcare Systems
Authors: Dana Al Kukhun, Florence Sedes
Venue: Proceedings of the 6th international conference on Smart Homes and Health Telematics (2008)

In the age of mobile computing and distributed systems, healthcare systems are employing service-oriented computing to provide users with transparent accessibility to reach their distributed resources at anytime, anywhere and anyhow. Meanwhile, these systems tend to strengthen their security shields to ensure the limitation of access to authorized entities. In this paper, we examine mobile querying of distributed XML databases within a pervasive healthcare system. In such contexts, policies - as XACML - are needed to enforce access control. We study the reactivity of this policy in the case of a user demanding access to unauthorized data sources showing that the policy will respond negatively to user demands. Thus, we propose to employ an adaptive mechanism that would provide users with reactive and proactive solutions. Our proposal is accomplished by using the RBAC scheme, the user profile and some predefined semantics in order to provide users with alternative and relevant solutions without affecting the system's integrity.
Plenary lecture five: fundamental theory of controllability and observability of first-order matrix difference systems
Authors: Yan Wu
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

The theory of difference equations is much wealthier than its counterpart in differential equations. With the emergence of digital signal processing technology, the theory of difference equations assumes great importance in areas such as digital control, image processing, and digital filter design. In this talk, a first-order matrix Sylvester difference system with a control structure is discussed in view of the existence and uniqueness of its general solution. Results are used in the study of controllability and observability of the matrix difference system coupled with an output structure. More general criteria, such as the one-sided controllability and observability matrices, are obtained for complete controllability and complete observability of time-invariant systems.
The Macro Design as an Own Task in WBT Production: Ideas, Concepts and a Tool
Authors: Abdelhak Aqqal, Christoph Rensing, Ralf Steinmetz
Venue: Proceedings of the 2nd European conference on Technology Enhanced Learning: Creating New Learning Experiences on a Global Scale (2007)

The conception and production of Web Based Training (WBT) is still too difficult for instructors. Semantic and didactic features are diluted during WBT development by teachers, due to the technical focus of the production task and the corresponding tools. Therefore, we claim a collaborative production as way to meet instructors' skills for an efficient WBT production. In addition to the content modeling and authoring, the proposed methodology points out so called "macro design" as an independent task to be supported. The macro design is innovative in two ways. First, it extends the existing way of content design by supporting instructors in expliciting their intentions and instructional design. Second, it demonstrates the possibility to use the Rhetorical Structure Theory (RST) as a communicative mechanism for the instructional design in order to give an explicit perception of the expected content.
SYMIAN: A Simulation Tool for the Optimization of the IT Incident Management Process
Authors: Claudio Bartolini, Cesare Stefanelli, Mauro Tortonesi
Venue: Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment (2008)

Incident Management is the process through which IT support organizations manage to restore normal service operation after a service disruption. The complexity of IT support organizations makes it extremely hard to understand the impact of organizational, structural and behavioral components on the performance of the currently adopted incident management strategy and, consequently, which actions could improve it. This paper presents SYMIAN, a decision support tool for the improvement of incident management performance. SYMIAN is a discrete event simulator that permits to test possible corrective measures for the IT support organization before the expensive actual implementation. SYMIAN models the IT support organization as a queuing system, considering both the time spent by operators working on incidents and the time spent when waiting for operator's availability. Experimental results show the SYMIAN effectiveness in the performance analysis and optimization of the incident resolution time for a fictitious organization designed according to real-life experiences.
Cryptanalysis of the TRMC-4 Public Key Cryptosystem
Authors: Xuyun Nie, Lei Hu, Jintai Ding, Jianyu Li, John Wagner
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

In 2006, the inventors of TRMC public key cryptosystem proposed a new variant of TRMC, TRMC-4, which can resist the existing attack, in particular, the Joux et al attack. In this paper, we show that the new version is vulnerable to attack via the linearization equations (LE) method. For any given valid ciphertext and its corresponding TRMC-4 public key, we can derive the corresponding plaintext within 224 $\mathbb{F}_{2^8}$-operations, after performing once for the public key a computation of complexity less than 234. Our results are confirmed by computer experiments.
DAISY --- Universally Designed? Prototyping an Approach to Measuring Universal Design
Authors: Miriam Eileen Nes, Kirsten Ribu, Morten Tollefsen
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The DAISY system is currently used as the alternative reading format for print-disabled students in Norway. DAISY is denoted by many as universally designed. This is an important claim, ensuring suited learning opportunities for all students. Thus, to be able to determine this aspect of DAISY is important --- as is the case for many information systems. However, methods for evaluating whether a software product is universally designed are lacking. This text builds on previous work investigating the use of DAISY in Norwegian primary- and secondary education, now looking into strategies to evaluate whether DAISY is universally designed. We argue that the term universally designed needs to be more strictly defined in order to become applicable to systems development. Further, we propose two related methods that measure to what degree DAISY is universally designed, using feature analysis methodology.
Note: On complete subsets of the cyclic group
Authors: Y. O. Hamidoune, A. S. Lladó, O. Serra
Venue: Journal of Combinatorial Theory Series A (2008)

A subset X of an abelian G is said to be complete if every element of G can be expressed as a nonempty sum of distinct elements from X. Let A@?Z"n be such that all the elements of A are coprime with n. Solving a conjecture of Erdos and Heilbronn, Olson proved that A is complete if n is a prime and if |A|>2n. Recently Vu proved that there is an absolute constant c, such that for an arbitrary large n, A is complete if |A|>=cn, and conjectured that 2 is essentially the right value of c. We show that A is complete if |A|>1+2n-4, thus proving the last conjecture.
A Lightweight Approach to Partially Reuse Existing Component-Based System in Service-Oriented Environment
Authors: He Yuan Huang, Hua Fang Tan, Jun Zhu, Wei Zhao
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

A fundamental derailment factor for reusing today's business applications is the tight coupling among program components. While SOA advocates an architecture with loose coupling among components, the invocation dependencies among components are still tangled with implementation code traditionally. SCA (Service Component Architecture) - an emerging service-oriented component model - uses a standard and declarative way to handle inter-component dependencies. Thus, SCA components have better reusability from this perspective. This paper proposes a lightweight approach to partially reuse existing components by wrapping them as SCA components. Several challenges are identified and addressed in this paper, especially the one of externalizing component dependencies without changing source code. The proposed approach addresses the challenges systematically, with a supporting system implemented. Moreover, an example scenario is given to better illustrate the usage of the approach. Finally, some future directions of the work are pointed out.
Why neighbourhood matters: interests-driven opportunistic data diffusion schemes
Authors: Iacopo Carreras, Francesco De Pellegrini, Daniele Miorandi, David Tacconi, Imrich Chlamtac
Venue: Proceedings of the third ACM workshop on Challenged networks (2008)

Opportunistic communications have been extensively studied in the last few years, with special emphasis on the optimal trade-offs between the resources needed to operate such systems and the performance experienced by the end-users. We focus in this work on application scenarios, in which users exploit opportunistic communications to exchange and diffuse data of potential interest. We assume a data-centric architecture, in which users would like to receive messages whose content matches a set of interests they expressed. We propose a data diffusion scheme based on the combination of two features: (i) interest-driven one-hop data exchange (upon a transmission opportunity, a node requests data matching a set of interests) (ii) neighbourhood-based data conveyance (each node maintains a list of the most interesting contents for its nearest neighbours and looks actively for such kind of data). An algorithmic solution is proposed, together with a protocol implementing it. The performance of the proposed scheme is evaluated by simulating the data diffusion process, exploiting contact traces and interests lists gathered through real-life experiments.
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
Authors: Tomáš Brázdil, Vojtěch Forejt, Antonín Kučera
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We show that the controller synthesis and verification problems for Markov decision processes with qualitative PECTL* objectives are 2-EXPTIME complete. More precisely, the algorithms are polynomial in the size of a given Markov decision process and doubly exponential in the size of a given qualitative PECTL* formula. Moreover, we show that if a given qualitative PECTL* objective is achievable by some strategy, then it is also achievable by an effectively constructible one-counter strategy, where the associated complexity bounds are essentially the same as above. For the fragment of qualitative PCTL objectives, we obtain EXPTIME completeness and the algorithms are only singly exponential in the size of the formula.
Improvements in Formula Generalization
Authors: Markus Aderhold
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

For proofs by induction it is often necessary to generalize statements to strengthen the induction hypotheses. This paper presents improved heuristics to generalize away subterms, unnecessary conditions and function symbols in a formula. This resolves shortcomings that we encountered within an experimental evaluation of generalization heuristics from the literature. Our generalization method has been implemented in the verification tool $\checkmark$ eriFun . An evaluation with examples from the literature as well as several case studies of our own demonstrates the success of our development.
Event-Based Service Coordination
Authors: Gian-Luigi Ferrari, Roberto Guanciale, Daniele Strollo, Emilio Tuosto
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

In this paper we tackle the problem of designing and implementing a framework for programming service coordination policies. In particular, we illustrate the design and the prototype implementation of Java Signal Core Layer (JSCL), a coordination middleware for services based on the event notification paradigm. We formally motivate the design choices of the JSCL middleware by exploiting a variant of the ¿-calculus specifically tailored to deal with event notification and distribution. We demonstrate how service coordination polices can be precisely programmed in JSCL by some simple but illustrative case studies.
Towards a new isolation abstraction for OSGi
Authors: Nicolas Geoffray, Gaël Thomas, Bertil Folliot, Charles Clément
Venue: Proceedings of the 1st workshop on Isolation and integration in embedded systems (2008)

The Open Service Gateway Initiative (OSGi) specification defines a dynamic Java-based service oriented architecture for networked environments such as home service gateways. To provide isolation between different services, it relies on the Java class loading mechanism. While class loaders have many advantages beside isolation, they are poor in protecting the system against malicious or buggy services. In this paper, we propose a new approach for service isolation. It is based on the Java isolate technology, without a task-oriented architecture. Our approach is more tailored to service-oriented architectures and in particular offers a complete isolation abstraction to the OSGi platform. It is currently under development, hence we do not provide in this paper any technical details nor results.
A File Fetching Method to Reduce the Redundant Traffic on BitTorrent-Like P2P Networks
Authors: Junichi Funasaka, Akihiko Ishidu, Kenji Ishida
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

When dividing a file into many pieces and fetching different pieces from many peers on P2P systems, if the piece is requested from a slow peer whose upload throughput is low, the download time for the whole system may increase because of this slow download. End-game mode, which requests the last piece from all the connected peers at the same time, has been proposed to solve this problem, while the duplicated requests generate redundant traffic. In this paper, we propose a method to avoid requesting a piece from slow peers without the duplicated requests, which can alleviate the increase in download time and generates no redundant traffic. The proposed method and the existing method with End-game mode are evaluated through simulation experiments using BitTorrent as a typical instance of the parallel retrieving method of a file from many peers. As a result, we confirm that our proposal can fetch files in similar length of time as the existing method with End-game mode, with trimming down redundant traffic generated by the existing method, whether or not some peers leave from the network after completion of the file retrieval. We believe that this proposal enhances network assurance absorbing the difference in the peer performance and providing the steady download time without redundancy in traffic.
A Force Sensor Made by Diaphragm Pattern Mounted on a Deformable Circular Plate
Authors: Alberto Tarizzo, Giuseppe Rella
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

Measurement of the real distribution of pressure under the foot is an important challenge to obtain an efficacious stability control and a real dynamic walk. This paper is the result of the work of two students in mechanical and mechatronic engineering who have built a force sensor using a diaphragm pattern mounted on a deformable circular plate. The result of this study is a cheaper but accurate force sensor that will be mounted on the humanoid robot "I-2" of Politecnico di Torino. The design of the sensor in centred to analyse the deformation of a circular plate loaded at the center considering various edge conditions. It begin from the structural analyse of the plates considering different loads and edge conditions to obtain a deformation model as near as possible to reality. Final goal will be to obtain an output voltage proportional to the deformation of the plate.
Design and Implement of Game Speech Interaction Based on Speech Synthesis Technique
Authors: Xujie Wang, Ruwei Yun
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

Game speech interaction is an fantastic interactive mode but hasn't received enough attention. This study first summarizes features of game speech interaction. And Then, based on speech synthesis technique, we design a speech interaction module which also supported by speech conversion technique. The ultima purpose is to strengthen the interaction between game and player.
Animating Human Locomotion with Inverse Dynamics
Authors: Hyeongseok Ko, Norman I. Badler
Venue: IEEE Computer Graphics and Applications (1996)

We present an efficient technique that animates human locomotion using balance and comfort control based on inverse dynamics and strength data. Loads or 3D external forces can be applied to any body point. Inverse dynamics using the Newton-Euler method is applied to a 97 DOF human model to compute the joint forces and torques in real time. Balance is maintained by rotating or translating the pelvis and torso. The required torque at each joint is kept below a given fraction of the available torque based on actual human strength data. This "comfort" control adjusts the knee angle or the figure base parameters such as the step length and foot angle. The combination of balance and comfort controls ensures that dynamically sound walking motion is created in each frame. Several visualization techniques are applied to validate and display the result of the dynamics computation, such as the degree of imbalance, the ground reaction force on the foot sole, and the required versus available joint torques. The algorithm also encompasses any walking gait, any figure scale, and any motion path.