ppxscal/embedding_network huggingface dataset:
The upper connected geodetic number and forcing connected geodetic number of a graph
Authors: A. P. Santhakumaran, P. Titus, J. John
Venue: Discrete Applied Mathematics (2009)

For a connected graph G of order p>=2, a set S@?V(G) is a geodetic set of G if each vertex v@?V(G) lies on an x-y geodesic for some elements x and y in S. The minimum cardinality of a geodetic set of G is defined as the geodetic number of G, denoted by g(G). A geodetic set of cardinality g(G) is called a g-set of G. A connected geodetic set of G is a geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected geodetic set of G is the connected geodetic number of G and is denoted by g"c(G). A connected geodetic set of cardinality g"c(G) is called a g"c-set of G. A connected geodetic set S in a connected graph G is called a minimal connected geodetic set if no proper subset of S is a connected geodetic set of G. The upper connected geodetic number g"c^+(G) is the maximum cardinality of a minimal connected geodetic set of G. We determine bounds for g"c^+(G) and determine the same for some special classes of graphs. For positive integers r,d and n>=d+1 with r@?d@?2r, there exists a connected graph G with radG=r, diamG=d and g"c^+(G)=n. Also, for any positive integers 2@?a
Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks
Authors: Santosh Ghosh, Monjur Alam, Dipanwita Roy Chowdhury, Indranil Sen Gupta
Venue: Computers and Electrical Engineering (2009)

All elliptic curve cryptographic schemes are based on scalar multiplication of points, and hence its faster computation signifies faster operation. This paper proposes two different parallelization techniques to speedup the GF(p) elliptic curve multiplication in affine coordinates and the corresponding architectures. The proposed implementations are capable of resisting different side channel attacks based on time and power analysis. The 160, 192, 224 and 256 bits implementations of both the architectures have been synthesized and simulated for both FPGA and 0.13@m CMOS ASIC. The final designs have been prototyped on a Xilinx Virtex-4 xc4vlx200-12ff1513 FPGA board and performance analyzes carried out. The experimental result and performance comparison show better throughput of the proposed implementations as compared to existing reported architectures.
Solving μ-Calculus Parity Games by Symbolic Planning
Authors: Marco Bakera, Stefan Edelkamp, Peter Kissmann, Clemens D. Renner
Venue: Model Checking and Artificial Intelligence: 5th International Workshop, MoChArt 2008, Patras, Greece, July 21, 2008. Revised Selected and Invited Papers (2009)

This paper applies symbolic planning to solve parity games equivalent to μ-calculus model checking problems. Compared to explicit algorithms, state sets are compacted during the analysis. Given that $\mbox{\it diam}(G)$ is the diameter of the parity game graph G with node set V, for the alternation-free model checking problem with at most one fixpoint operator, the algorithm computes at most $O(\mbox{\it diam}(G))$ partitioned images. For d alternating fixpoint operators, $O(d \cdot \mbox{\it diam}(G) \cdot (\frac{|V|+(d-1)}{d-1})^{d-1})$ partitioned images are required in the worst case.Practical models and properties stem from data-flow analysis, with problems transformed to parity game graphs, which are then compiled to a general game playing planner input.
Combining distinct graduate and undergraduate HCI courses: an experiential and interactive approach
Authors: Christopher Brown, Robert Pastel
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

We developed combined graduate and undergraduate courses in which undergraduates created a prototype based on user-centered design, and graduate students worked with them to evaluate those prototypes based on common usability principles. It provided undergraduate students experience practicing user centered design, while providing graduate students experience with usability evaluation. It also provided graduate students the opportunity to introduce current HCI research areas to students who may be considering graduate school. The course successfully engaged both graduate and undergraduate students while providing a beneficial experience through their interactions.
A3: HCI Coding Guideline for Research Using Video Annotation to Assess Behavior of Nonverbal Subjects with Computer-Based Intervention
Authors: Joshua Hailpern, Karrie Karahalios, James Halle, Laura Dethorne, Mary-Kelsey Coletto
Venue: ACM Transactions on Accessible Computing (TACCESS) (2009)

HCI studies assessing nonverbal individuals (especially those who do not communicate through traditional linguistic means: spoken, written, or sign) are a daunting undertaking. Without the use of directed tasks, interviews, questionnaires, or question-answer sessions, researchers must rely fully upon observation of behavior, and the categorization and quantification of the participant&rsquo;s actions. This problem is compounded further by the lack of metrics to quantify the behavior of nonverbal subjects in computer-based intervention contexts. We present a set of dependent variables called A3 (pronounced A-Cubed) or Annotation for ASD Analysis, to assess the behavior of this demographic of users, specifically focusing on engagement and vocalization. This paper demonstrates how theory from multiple disciplines can be brought together to create a set of dependent variables, as well as demonstration of these variables, in an experimental context. Through an examination of the existing literature, and a detailed analysis of the current state of computer vision and speech detection, we present how computer automation may be integrated with the A3 guidelines to reduce coding time and potentially increase accuracy. We conclude by presenting how and where these variables can be used in multiple research areas and with varied target populations.
Wireless Communications Using Millimeter-Wave Beams Carrying Orbital Angular Momentum
Authors: Yuesong Jiang, Yuntao He, Fang Li
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Over distances propagation of millimeter-wave beams in atmosphere is less affected by weather conditions (e. g. clouds, fog, smoke, snow, et al.) and turbulent atmosphere than optical beams does. So free-space information transfer using millimeter-wave beams has superiority over optical beams. In this paper, a new notion of millimeter-wave beams carrying orbital angular momentum (OAM) used for free-space wireless communications (WC), was presented, which is a efficient solutions for issues of security and obstruction of line of sight of WC. The basic description and conception of OAM in a millimeter-wave beam was given. Encoding information as the OAM states in a single millimeter-wave beam with OAM were discussed and analyzed. Using OAM to encode the data offers an inherent security enhancement.
Metric based testability model for object oriented design (MTMOOD)
Authors: R. A. Khan, K. Mustafa
Venue: ACM SIGSOFT Software Engineering Notes (2009)

This paper does an extensive review on testability of object oriented software, and put forth some relevant information about class-level testability. Testability has been identified as a key factor to software quality, and emphasis is being drawn to predict class testability early in the software development life cycle. A Metrics Based Model for Object Oriented Design Testability (MTMOOD) has been proposed. The relationship from design properties to testability is weighted in accordance with its anticipated influence and importance. A suit of adequate object-oriented metrics useful in determining testability of a system has been proposed, which may be used to locate parts of design that could be error prone. Identification of changes in theses parts early could significantly improve the quality of the final product and hence decrease the testing effort. The proposed model has been further empirically validated and contextual interpretation has been drawn using industrial software projects.
We need more standards like IEEE 1500
Authors: Miron Abramovici, Al Crouch
Venue: IEEE Design Test (2009)

The authors lightheartedly discuss the importance of standards like IEEE 1500, emphasizing a few "side benefits," such as the positive impact on the economy from all the traveling involved in discussing and debating a standard. Perhaps, the authors suggest, the IEEE could reverse the current economic downturn by starting up dozens of new standards.
Note: A complete classification of ternary self-dual codes of length 24
Authors: Masaaki Harada, Akihiro Munemasa
Venue: Journal of Combinatorial Theory Series A (2009)

Ternary self-dual codes have been classified for lengths up to 20. At length 24, a classification of only extremal self-dual codes is known. In this paper, we give a complete classification of ternary self-dual codes of length 24 using the classification of 24-dimensional odd unimodular lattices.
Reheating cold topics (in networking)
Authors: Jon Crowcroft
Venue: ACM SIGCOMM Computer Communication Review (2009)

It has been proposed that research in certain areas is to be avoided when those areas have gone cold. While previous work concentrated on detecting the temperature of a research topic, this work addresses the question of changing the temperature of said topics. We make suggestions for a set of techniques to re-heat a topic that has gone cold. In contrast to other researchers who propose uncertain approaches involving creativity, @lateral thinking and imagination, we concern ourselves with deterministic approaches that are guaranteed to yield results1.
Robots in the wild: understanding long-term use
Authors: JaYoung Sung, Henrik I. Christensen, Rebecca E. Grinter
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

It has long been recognized that novelty effects exist in the interaction with technologies. Despite this recognition, we still know little about the novelty effects associated with domestic robotic appliances and more importantly, what occurs after the novelty wears off. To address this gap, we undertook a longitudinal field study with 30 households to which we gave Roomba vacuuming robots and then observed use over six months. During this study, which spans over 149 home visits, we encountered methodological challenges in understanding households' usage patterns. In this paper we report on our longitudinal research, focusing particularly on the methods that we used 1) to understand human-robot interaction over time despite the constraints of privacy and temporality in the home, and 2) to uncover information when routines became less conscious to the participants themselves.
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
Authors: Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for commitment schemes have been proposed in the literature: concurrent non-malleability with respect to commitment and concurrent non-malleability with respect to decommitment (i.e., opening).After the original notion of non-malleability introduced by [Dolev, Dwork and Naor STOC 91] that is based on the independence of the committed messages, a new and stronger simulation-based notion of non-malleability has been proposed with respect to openings or with respect to commitment [1,2,3,4] by requiring that for any man-in-the-middle adversary there is a stand-alone adversary that succeeds with the same probability. When commitment schemes are used as sub-protocols (which is often the case) the simulation-based notion is much more powerful and simplifies the task of proving the security of the larger protocols.The main result of this paper is a commitment scheme that is simulation-based concurrent non-malleable with respect to both commitment and decommitment. This property protects against cMiM attacks mounted during both commitments and decommitments which is a crucial security requirement in several applications, as in some digital auctions, in which players have to perform both commitments and decommitments. Our scheme uses a constant number of rounds of interaction in the plain model and is the first scheme that enjoys all these properties under the simulation-based definitions.
Robust Time-Referenced Segmentation of Moving Object Trajectories
Authors: Hyunjin Yoon, Cyrus Shahabi
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Trajectory segmentation is the process of partitioning a given trajectory into a small number of homogeneous segments w.r.t. some criteria. Conventional segmentation techniques only focus on the spatial features of the movement and could lead to spatially homogeneous segments but with presumably dissimilar temporal structures. Furthermore, trajectories could be over-segmented in the presence of outliers. In this paper, we propose a family of three trajectory segmentation methods that takes into account both geospatial and temporal structures of movement for the segmentation and is also robust with respect to time-referenced spatial outliers. The effectiveness of our methods is empirically demonstrated over three real-world datasets.
What are the benefits of adaptation when applied in the domain of child-robot interaction?
Authors: Tamie Salter, Francois Michaud, Dominic Létourneau
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

There is great potential for robotic devices when being applied with children. They can be used from play to assistive applications. We develop robotic devices for a diverse range of children that differ in age, gender and ability, which includes children that are diagnosed with cognitive difficulties such as autism. Every child is an individual and they vary in their personalities and styles of interaction. Therefore, being able to adjust the robot's behaviour to the type of interaction it is receiving was believed to be essential. In this abstract we examine a series of trials which investigated how adaptation (through changes in motion and sound) on a fully autonomous rolling robot could help gain and sustain the interest of five different children. We discovered surprising benefits to having adaptation on-board Roball.
An analysis and implementation study on a robust congestion controller for the internet
Authors: Li Yu, Yantai Shu, Maode Ma, Ming Tang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We proposed a parameter-tunable robust proportional-integral-differential (PID) controller for active queue management (AQM) based on modern H&infin; optimal control theory in [12]. Our robust PID controller can be tuned only by one parameter unlike traditional PID controllers, which are tuned by three or more. Additionally, this new parameter assignment method can be extended to other controller designed for AQM scheme based on classical control theory or optimal control theory. In this paper, we present an analysis and implementation study on it. Taken both robustness and closed loop performance into considerations, most desirable parameters value can be identified by the analytical formulas derived by us. Theoretical analysis shows that the proposed controller can converge to the reference value in steady state. Simulation results confirm our expectation that our PID controller for AQM outperforms the existing well-known congestion controllers, such as RED and PI controller, on keeping the router queue size at the target value without queue vibration. Further, the most important feature is that the controller is robust to the network dynamics and traffic load changes.
Integrating heterogeneous ATM systems with an IP-based networking architecture
Authors: Chang-tseh Hsieh, Binshan Lin
Venue: International Journal of Mobile Communications (2009)

This paper presents strategies for integrating heterogeneous Automatic Teller Machines (ATMs) at two merged banking systems. The IP-based networking and telecommunication technology is proposed with a special emphasis on its impact on the ATM architecture at a typical commercial bank. Problems associated with current Systems Network Architecture (SNA) networks in the bank selected as the target of this study and the proposed new networking architecture are presented. The advantages and disadvantages of IP-enabled ATMs are also discussed, along with some preventive measures.
A unified framework for multipath routing for unicast and multicast traffic
Authors: Tuna Güven, Richard J. La, Mark A. Shayman, Bobby Bhattacharjee
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the gradient of the network cost function is not available and needs to be estimated. Multiple paths are provided between a source and a destination using application-layer overlay. We propose a novel algorithm that is based on what is known as simultaneous perturbation stochastic approximation and utilizes only noisy measurements collected and reported to the sources, using an overlay architecture. We consider three network models that reflect different sets of assumptions regarding multicast capabilities of the network. Using an analytical model we first prove the almost sure convergence of the algorithm to a corresponding optimal solution under each network model considered in this paper with decreasing step sizes. Then, we establish the weak convergence (or convergence in distribution) with a fixed step size. In addition, we investigate the benefits acquired from implementing additional multicast capabilities by studying the relative performance of our algorithm under the three network models.
Proceedings of the 2nd Bangalore Annual Compute Conference
Venue: Annual Bangalore Compute Conference (2009)

With the growth of IT industry in India, there has been a long felt need for a forum where active researchers in CS and IT from academia and industry can interact with aim of extracting abstractions from a plethora of applications using rigorous methods. Extracting abstractions and refining them are the basic necessities for the next generation scalable applications that would aid serving global clients satisfactorily. ACM Bangalore Compute 2009 is the second in the series of such attempts by ACM Bangalore Chapter at providing an integrated forum for such an endeavor. The aim of Compute 2009 conference, sponsored and organized by ACM Bangalore chapter, has been to provide a forum for researchers in CS and IT to engage in a symbiotic relationship, with benefits for the Indian IT industry, entrepreneurs, investors and Academia (CS and interdisciplinary) alike. The key focus areas for Compute 2009 are: 1. Next Generation Information Management - Search in both enterprise and internet context, information/data management, Business Intelligence, Data Warehousing, structured-unstructured information integration, Semantic Web, text/data mining, and analytics, data services, Enterprise Information Integration, Latest Database Trends, XML databases, XML information management etc. --- Track Chair --- Dr. Umeshwar Dayal, HP Labs, USA 2. Distributed Systems - Grid Computing, High Performance Computing, Cluster Computing, Cloud Computing, Virtualization, etc. --- Track Chair --- Dr. Rajkumar Buyya, University of Melbourne and Manjrasoft Pty Ltd, Australia 3. Contemporary Internet Trends including Web 2.0 , Social Computing, Service Architectures, Hosted Models, etc. 4. Green Technological Systems (Environmental, Power saving, Energy efficient, and Eco-Friendly systems)
Selective Querying for Adapting Web Service Compositions Using the Value of Changed Information
Authors: John Harney, Prashant Doshi
Venue: IEEE Transactions on Services Computing (2008)

Web service composition (WSC) techniques assume that the parameters used to model the environment remain static and accurate throughout the composition's execution. However, WSCs often operate in environments where the parameters of its component services are volatile. To remain optimal, WSCs must adapt to these changes. Adaptation requires up-to-date knowledge about the revised parameters of each of the services. One way of obtaining this knowledge is to query services for their revised parameters. Querying services for their parameters is time-consuming and expensive. We must therefore carefully manage how queries are conducted. Specifically, an adaptive WSC must know when to query for revised information, and from which service(s) to obtain information. We present a method to selectively query services using the value of changed information (VOC). VOC measures the value of the change that revised information may potentially introduce to the composition. We reduce the complexity of computing the VOC, first by anticipating values of the service parameters that do not change the WSC, and second by using parameter expiration times obtained from predefined service-level agreements. Using two scenarios, we illustrate our approach and demonstrate the computational savings theoretically and experimentally.
junii2 and AIRway: an application profile for scholarly works and its application for link resolvers
Authors: Kunie Horikoshi, Shigeki Sugita, Yuji Nonaka, Satsuki Kamiya, Izumi Sugita, Haruo Asoshina
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

A large number of scholarly works is self-archived at the university's Open Access repositories.
Sharing empty moments: design for remote couples
Authors: Danielle Lottridge, Nicolas Masson, Wendy Mackay
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Many couples are forced to live apart, for work, school or other reasons. This paper describes our study of 13 such couples and what they lack from existing communication technologies. We explored what they wanted to share (presence, mood, environment, daily events and activities), how they wanted to share (simple, lightweight, playful, pleasant interaction), and when they wanted to share ('empty moments' such as waiting, walking, taking a break, waking up, eating, and going to sleep). 'Empty moments' provide a compelling new opportunity for design, requiring subtlety and flexibility to enable participants to share connection without explicit messages. We designed MissU as a technology probe to study empty moments in situ. Similar to a private radio station, MissU shares music and background sounds. Field studies produced results relevant to social science, technology and design: couples with established routines were comforted; characteristics such as ambiguity and 'movable' technology (situated in the home yet portable) provide support. These insights suggest a design space for supporting the sharing of empty moments.