ppxscal/embedding_network huggingface dataset:
Robot-directed speech as a means of exploring conceptualizations of robots
Authors: Sarah Kriz, Gregory Anderson, Magdalena Bugajska, J. Gregory Trafton
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Decades of research have shown that speakers adapt the way in which they speak to meet the needs of listeners, and that speech modifications can illuminate speakers' conceptualizations of their listeners' cognitive and communicative abilities. The present study extends this line of research into human-robot communication by analyzing the linguistic features of commands given to a robotic dog. The results indicate that males and females differed in the way in which they spoke to the robot, suggesting that there was not a uniform expectation of the robot's communicative capacities.
Designing user interface adaptation rules with T: XML
Authors: Víctor López-Jaquero, Francisco Montero, Fernando Real
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

The specification of model adaptation and generation rules is a topic of great interest for the user interface development community, since there are more and more approaches supporting the model-based approach. The ubiquitousness in interaction and the different user profiles are not the only challenges when designing interactive systems. Furthermore, the context of use evolves over time. In this situation, there is a strong need to provide a set of adaptation rules to make the user interface evolve according to the context of use evolution. This paper contributes a metamodel for the definition of adaptation rules in a systematic approach, pursuing engineer adaptation. Moreover, a tool called T:XML is presented that supports the specification of adaptation rules using a visual notation that greatly simplifies the process of designing adaptation for model-based user interface environments.
Automatic generation of Cycle Accurate and Cycle Count Accurate transaction level bus models from a formal model
Authors: Chen Kang Lo, Ren Song Tsay
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This paper proposes the first automatic approach to simultaneously generate Cycle Accurate and Cycle Count Accurate transaction level bus models. Since TLM (Transaction Level Modeling) is proven as an effective design methodology for managing the ever-increasing complexity of system level designs, researchers often exploit various abstraction levels to gain either simulation speed or accuracy. Consequently, designers repeatedly perform the time-consuming task of re-writing and performing consistency checks for different abstraction level models of the same design. To ease the work, we propose a correct-by-construction method that automatically and simultaneously generates both fast and accurate transaction level bus models for system simulation. The proposed approach relieves designers from the tedious and error-prone process of refining models and checking for consistency.
An interdependent infrastructure risk analysis framework using parallel and distributed simulation
Authors: Yan Gu, Yue Li
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

A system-based risk simulation and analysis methodology is needed to evaluate the vulnerability of interdependent infrastructure systems in order to increase the system resilience, reduce the probability of system failure and consequences of such failure, and reduce time to system recovery. These interdependent infrastructure systems are usually highly interconnected, mutually dependent on multiple levels and may be subjected to a spectrum of natural hazards. Although research has been performed in the area of infrastructure interdependency modeling and analysis, not enough work has been done to address the issues of simulating the interdependent infrastructure systems efficiently at a large scale and quantitatively characterize the impact and risks of multiple natural hazards on these interdependent systems. In this paper a risk assessment framework is proposed to model interdependent infrastructure using parallel and distributed simulation and probabilistic hazard models to characterize the impact of the occurrence and intensity of various disasters.
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
Authors: Seok-Hee Hong, Martin Mader
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

In this paper we present a generalization of the shift method algorithm [4,6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a certain specified size. We propose vertex representations having a rectangular shape. Additionally, one may demand maintainance of the criterion of strong visibility, that is, any possible line segment connecting two adjacent vertices cannot cross another vertex' representation. We prove that the proposed method produces a straight-line grid drawing of a graph in linear time with an area bound, that is only extended by the size of the rectangles, compared to the bound of the original algorithm.
On the Stretch Factor of Convex Delaunay Graphs
Authors: Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel Smid
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph $\mathord{\it DG}_C(S)$ of S is defined to be the dual of the Voronoi diagram of S with respect to the convex distance function defined by C. We prove that $\mathord{\it DG}_C(S)$ is a t-spanner for S, for some constant t that depends only on the shape of the set C. Thus, for any two points p and q in S, the graph $\mathord{\it DG}_C(S)$ contains a path between p and q whose Euclidean length is at most t times the Euclidean distance between p and q.
A permutation approach for testing heterogeneity in two-sample categorical variables
Authors: Rosa Arboretti Giancristofaro, Stefano Bonnini, Fortunato Pesarin
Venue: Statistics and Computing (2009)

In many sciences researchers often meet the problem of establishing if the distribution of a categorical variable is more concentrated, or less heterogeneous, in population P 1 than in population P 2. An approximate nonparametric solution to this problem is discussed within the permutation context. Such a solution has similarities to that of testing for stochastic dominance, that is, of testing under order restrictions, for ordered categorical variables. Main properties of given solution and a Monte Carlo simulation in order to evaluate its degree of approximation and its power behaviour are examined. Two application examples are also discussed.
Single-message denial-of-service attacks against voice-over-internet protocol terminals
Authors: Jan Seedorf, Kristian Beckers, Felipe Huici
Venue: International Journal of Electronic Security and Digital Forensics (2009)

The session initiation protocol (SIP) is widely used for signalling in multimedia communications. However, many SIP implementations are still in their infancy and vulnerable to malicious messages. We investigate flaws in the SIP implementations of eight phones, showing that the deficient verification of SIP dialogs further aggravates the problem by making it easier for attacks to succeed. Our results show that the majority of the phones we tested are susceptible to these attacks.
Goal-Equivalent Secure Business Process Re-engineering
Authors: Hugo A. López, Fabio Massacci, Nicola Zannone
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

The introduction of information technologies in health care systems often requires to re-engineer the business processes used to deliver care. Obviously, the new and re-engineered processes are observationally different and thus we cannot use existing model-based techniques to argue that they are somehow "equivalent". In this paper we propose a method for passing from SI*, a modeling language for capturing and modeling functional, security, and trust organizational and system requirements, to business process specifications and vice versa. In particular, starting from an old secure business process, we reconstruct the functional and security requirements at organizational level that such a business process was supposed to meet (including the trust relations that existed among the members of the organization). To ensure that the re-engineered business process meets the elicited requirements, we employ a notion of equivalence based on goal-equivalence. Basically, we verify if the execution of the business process, described in terms of the trace it generates, satisfies the organizational model. We motivate and illustrate the method with an e-health case study.
Complexity results for minimum sum edge coloring
Authors: Dániel Marx
Venue: Discrete Applied Mathematics (2009)

In the Minimum Sum Edge Coloring problem we have to assign positive integers to the edges of a graph such that adjacent edges receive different integers and the sum of the assigned numbers is minimal. We show that the problem is (a) NP-hard for planar bipartite graphs with maximum degree 3, (b) NP-hard for 3-regular planar graphs, (c) NP-hard for partial 2-trees, and (d) APX-hard for bipartite graphs.
P2PMP2: A Peer-to-Peer Leveraged Mobile Streaming System Based-on Push and Pull
Authors: Niu Jianwei, Tang Yunqi, Ma Jian, Zhou Bing
Venue: International Journal of Distributed Sensor Networks (2009)

In a traditional mobile streaming system, all users pull streams from the server. This model would cause users a high communication cost and heavy burden to the base station. At the same time, the low bandwidth of the cellular network cannot meet the requirements of high quality video, which greatly limits the large-scale deployment of the mobile multimedia streaming service. In this paper, we propose a fully distributed, scalable, and cost-effective system called Peer-to-Peer leveraged Mobile streaming based on Pull and Push (P2PMP2). Under this solution, a novel network architecture based-on “pull-push” transmission strategy is proposed, which makes use of the secondary free local channels already available in mobile devices today to form a peer-to-peer network. There are two roles in the local network: seed and passive receiver, as shown in Fig. 1. Seeds in P2PMP2 download video contents through the cellular channel, and share them with its nearby neighbors by broadcasting using the secondary wireless channel. Regarding the lost data, passive receivers use another local wireless channel to request from their neighbors. The way that seeds broadcast video data to passive receivers is called “push.” While the way that passive receivers request lost data from neighbors using another channel is called “pull.” This architecture aims at “few users download video data from base station, and most users can get a high quality video.”  [image omitted]Figure 1. The network architecture of P2PMP2 In our paper, an important issue about seed selection strategy under this network architecture is addressed. It consists of two parts: Seed-selection. In dynamic networks, in order to get a high video quality, we should find out the nodes which are more suitable to be a seed. Fairness in cost sharing. This problem is equal to the problem of the minimum connected dominating set which has been proved to be NP-Hard. A heuristic algorithm called Adaptive Role-Switching Algorithm (ARSA) is presented. ARSA decides the role of a peer by its weight according to the principle of “the higher priority a peer owns, the greater probability to be a seed.” The weight of a peer is calculated using the following parameters: the available bandwidth, the number of a node's neighbors, capability, and mobility of a node. As to the fairness of the system, we use the strategy such as “the weight of a seed decreases with the time, and the weight of a passive receiver increases with the time.” Finally, we simulate P2PMP2 using Visual C++ under Windows XP. The simulation results show that the system can not only reduce the communication cost and cellular bandwidth requirement, but also improve the system performance obviously.
The Influence of Corporate Culture Alienation to IT- Outsourcing
Authors: Leo P. Bruhin
Venue:  (2008)

Ten years ago, the information technology outsourcing market was in its infancy. Today it is a multibillion-dollar industry. Analysts expect this rapid growth to continue as companies move beyond the outsourcing of information technology systems to the business processes they support. Successful integration is critical to a successful outsourcing relationship for three reasons. Firstly, it prevents the loss of key staff, knowledge, and productivity by addressing people issues in a timely and sensitive manner. Secondly, it minimizes disruptions to the business by focusing on a seamless transfer of resources and services. Thirdly, it frees executive management and allows them to focus on the strategic issues that will return long-term value (beyond simple cost savings) to the organization. This book aims to provide an answer to the question regarding the influences corporate culture alienation has on people's participation, loyalty and commitment and how far corporate culture affects a successful transition/integration of employees into the new organization.
A Dynamic Buffer Management Technique for Minimizing the Necessary Buffer Space in a Continuous Media Server
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

We develop a dynamic buffer management technique called WBM considering VBR compression in a continuous media server. WBM divides the service duration of clients into several small time intervals called window and reallocates the buffer space every window period. WBM could incur relatively high run-time overhead because it reallocates the buffer space periodically. To reduce the run-time overhead, WBM maintains the admitted clients by groups and manages groups in a round-robin fashion. We present a case study which shows a significant improvement in the buffer utilization and the necessary amount of buffer space. 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
Modelling and segmenting subunits for sign language recognition based on hand motion analysis
Authors: Junwei Han, George Awad, Alistair Sutherland
Venue: Pattern Recognition Letters (2009)

Modelling and segmenting subunits is one of the important topics in sign language study. Many scholars have proposed the functional definition to subunits from the view of linguistics while the problem of efficiently implementing it using computer vision techniques is a challenge. On the other hand, a number of subunit segmentation work has been investigated for the task of vision-based sign language recognition whereas their subunits either somewhat lack the linguistic support or are improper. In this paper, we attempt to define and segment subunits using computer vision techniques, which also can be basically explained by sign language linguistics. A subunit is firstly defined as one continuous visual hand action in time and space, which comprises a series of interrelated consecutive frames. Then, a simple but efficient solution is developed to detect the subunit boundary using hand motion discontinuity. Finally, temporal clustering by dynamic time warping is adopted to merge similar segments and refine the results. The presented work does not need prior knowledge of the types of signs or number of subunits and is more robust to signer behaviour variation. Furthermore, it correlates highly with the definition of syllables in sign language while sharing characteristics of syllables in spoken languages. A set of comprehensive experiments on real-world signing videos demonstrates the effectiveness of the proposed model.
twodee-2: A shallow layer model for dense gas dispersion on complex topography
Authors: A. Folch, A. Costa, R. K. S. Hankin
Venue: Computers Geosciences (2009)

twodee-2 is a Fortran 90 code based on previous code (twodee). It is designed to solve the shallow water equations for fluid depth, depth-averaged horizontal velocities and depth-averaged fluid density. The shallow layer approach used by twodee-2 is a compromise between the complexity of CFD models and the simpler integral models. It can be used for forecasting gas dispersion near the ground and/or for hazard assessment over complex terrains. The inputs to the model are topography, terrain roughness, wind measurements from meteorological stations and gas flow rate from the ground sources. Optionally the model can be coupled with the output of a meteorological processor which generates a zero-divergence wind field incorporating terrain effects. Model outputs are gas concentration, depth-averaged velocity, averaged cloud thickness and dose. The model can be a useful tool for gas hazard assessment by evaluating where and when lethal concentrations for humans and animals can be reached.
Topic-specific analysis of search queries
Authors: Judit Bar-Ilan, Zheng Zhu, Mark Levene
Venue: Proceedings of the 2009 workshop on Web Search Click Data (2009)

The analysis of search engine logs is important in order to understand how users interact with a search engine. Conventional analysis of search engine log data looks at various metrics such as query and session length aggregated over the full data set. Here we segment the data according to a top-level ontology of web search and compute the metrics on a topic by topic basis. Our results show that although for a given metric, such as query length, the statistics of most classes are similar to the aggregate statistic; there are usually some outlier classes which exhibit deviant behavior.
Computer-based detection of bleeding and ulcer in wireless capsule endoscopy images by chromaticity moments
Authors: Baopu Li, Max Q. -H. Meng
Venue: Computers in Biology and Medicine (2009)

The wireless capsule endoscopy (WCE) invented by Given Imaging has been gradually used in hospitals due to its great breakthrough that it can view the entire small bowel for gastrointestinal diseases. However, a tough problem associated with this new technology is that too many images to be examined by eyes cause a huge burden to physicians, so it is significant if we can help physicians do diagnosis using computerized methods. In this paper, a new method aimed for bleeding and ulcer detection in WCE images is proposed. This new approach mainly focuses on color feature, also a very powerful clue used by physicians for diagnosis, to judge the status of gastrointestinal tract. We propose a new idea of chromaticity moment as the features to discriminate normal regions and abnormal regions, which make full use of the Tchebichef polynomials and the illumination invariant of HSI color space, and we verify performances of the proposed features by employing neural network classifier. Experimental results on our present image data of bleeding and ulcer show that it is feasible to exploit the proposed chromaticity moments to detect bleeding and ulcer for WCE images.
Performance evaluation of memetic approaches in 3D reconstruction of forensic objects
Authors: J. Santamar&#x00ed;a, O. Cord&#x00f3;n, S. Damas, J. M. Garc&#x00ed;a-Torres, A. Quirin
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

Different tasks in forensics require the use of 3D models of forensic objects (skulls, bones, corpses, etc.) captured by 3D range scanners. Since a whole object cannot be completely scanned in a single image using a range scanner, multiple acquisitions from different views are needed to supply the information to construct the 3D model by a range image registration method. There is an increasing interest in adopting evolutionary algorithms as the optimization technique for image registration methods. However, the image registration community tends to separate global and local searches in two different stages, named sequential hybridization approach, which is opposite to the scheme adopted by the memetic framework. In this work, we aim to analyze the capabilities of memetic algorithms (Moscato in On evolution, search, optimization, genetic algorithms and martial arts: towards memeticalgorithms. Report 826, Caltech Concurrent Computation Program, Pasadena, 1989) for tackling a really complex and challenging real-world problem as the 3D reconstruction of forensic objects. Our intention is threefold: firstly, designing new memetic-based methods for tackling a real-world problem and subsequently carrying out a performance and behavioral analysis of the results; secondly, comparing their performance with the one achieved by other methods based on the classical sequential hybridization approach; and thirdly, concluding the experimental study by highlighting the outcomes achieved by the best method in tackling the real-world problem. Several real-world 3D reconstruction problems from the Physical Anthropology Lab at the University of Granada, Spain, were used to support the evaluation study.
KNOPPIX/Math: a live system for enjoying mathematics with computer
Authors: Tatsuyoshi Hamada, KNOPPIX/Math committers
Venue: ACM Communications in Computer Algebra (2009)

KNOPPIX/Math offers many documents and mathematical software packages. Once you run the live system, you can enjoy a wonderful world of mathematical software without needing to install anything yourself. We will demonstrate how to boot and use this system.
Towards Correctness Assurance in Adaptive Service-Based Applications
Authors: Raman Kazhamiakin, Andreas Metzger, Marco Pistore
Venue: Proceedings of the 1st European Conference on Towards a Service-Based Internet (2008)

Service-based applications (SBAs) increasingly have to become adaptive in order to operate and evolve in highly dynamic environments. Research on SBAs thus has already produced a range of adaptation techniques and strategies. However, adaptive SBAs are prone to specific failures that would not occur in "static" applications. Examples are faulty adaptation behaviours due to changes not anticipated during design-time, or conflicting adaptations due to concurrently occurring events. For adaptive SBAs to become reliable and thus applicable in practice, novel techniques that ensure the correctness of adaptations are needed. To pave the way towards those novel techniques, this paper identifies different kinds of adaptation-specific failures. Based on a classification of existing adaptation approaches and generic correctness assurance techniques, we discuss how adaptation-specific failures can be addressed and where new advanced techniques for correctness assurance of adaptations are required.