ppxscal/embedding_network huggingface dataset:
JavaScript Demystified, 1 edition
Authors: James Keogh
Venue:  (2005)

Even if you have no programming experience, you'll learn to create dynamic, interactive Web pages with help from this easy-to-use, self-teaching guide. Author and programming instructor Jim Keogh covers the basics of this leading Web development language and explains how to write cross-browser JavaScript programs in no time.
Message delay in MANET
Authors: Robin Groenevelt, Philippe Nain, Ger Koole
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

A generic stochastic model with only two input parameters is introduced to evaluate the message delay in mobile ad hoc networks (MANETs) where nodes may relay messages. The Laplace-Stieltjes transform (LST) of the message delay is obtained for two protocols: the two-hop and the unrestricted multicopy protocol. From these results we deduce the expected message delays. It is shown that, despite its simplicity, the model accurately predicts the message delay under both relay strategies for a number of mobility models (the random waypoint, random direction and the random walker mobility models).
Experiences with a Requirements-Based Programming Approach to the Development of a NASA Autonomous Ground Control System
Authors: James L. Rash, Michael G. Hinchey, Christopher A. Rouff, Denis Gracanin, John Erickson
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Requirements-to-Design-to-Code (R2D2C) is an approach to the engineering of computer-based systems that embodies the idea of requirements-based programming in system development. It goes further, however, in that the approach offers not only an underlying formalism, but full formal development from requirements capture through to the automatic generation of provably-correct code. As such, the approach has direct application to the development of systems requiring autonomic properties. We describe a prototype tool to support the method, and illustrate its applicability to the development of LOGOS, a NASA autonomous ground control system, which exhibits autonomic behavior. Finally, we briefly discuss other areas where the approach and prototype tool are being considered for application.
Playing Mastermind more logically or writing Prolog more efficiently
Authors: David M. W. Powers
Venue: Issue 89 (July 1984) (1984)

In the last few issues of SIGART there have appeared (#82, 83 & 85) three articles on Mastermind programmes, the latest of which, by Ehud Shapiro [1], presents a PROLOG version of the best known algorithm for the oldest form of the game-Bull-cow. This paper presents some improvements to this programme and uses it as an example in making some general points about PROLOG. Shapiro's programme is simple and demonstrates the power of PROLOG for implementing a quick solution using a well understood algorithm. My comments concern some changes to assist readability, to improve generality, and to develop a different, more efficient derivative of the algorithm.
JSAPI speech recognition with Sphinx4 and SAPI5
Authors: Tony Ayres, Brian Nolan
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

In this paper we evaluate and test the performance of the Java Speech API under two speech processing engines, namely Microsoft SAPI and Sphinx4 (alpha). The tests are carried out in the context of developing a distributed speech recognition system for the command and control of a remote device. The test software simulates this deployment with a subset of the final command grammar and we measure the recognition performance of both speech engines under this premise. The test environment consists of Windows XP and 2000 based systems running the Java Runtime Environment v1.4 and v1.5 (beta). We present our performance benchmark findings, draw a number of important conclusions and discuss future research and upcoming development, particularly in the Linux environment.
Adaptive distribution-based handover scheme for cellular communication networks: Research Articles
Authors: Ali F. Almutairi, Awatef K. Ali, Mehmet Hakan Karaata
Venue: Wireless Communications Mobile Computing (2005)

In this paper, we propose a new Generalized Distribution-Based Handover (DBHO) to deal with the inefficient utilization of spectral resources due to the non-uniform cell loads. The DBHO scheme is different from the existing adaptive schemes since it uses a new criterion to initiate handover when moving from&#x002F;to a congested cell. Two risk factors are used to dynamically change handover boundaries according to the distribution of traffic loads. This controls the handover initiation process such that a user in a congested cell that is moving to a free cell is allowed to initiate a handover to a new cell earlier, as long as the signal received from the target cell is higher than a certain threshold. While delaying the handover initiation process for a user moving in the opposite direction, as long as the signal received from the serving cell is not lower than a certain threshold. Our results show a substantial reduction in the handover and call dropouts rates. Our scheme is complementary to the existing adaptive schemes proposed in the literature. The proposed scheme also gives cellular system designers a new tool to optimize the overall network performance by initiating handovers based on the traffic intensities.Frequent handovers increase the load on switching networks, which consequently degrades the Quality of Service (QoS). Existing handover schemes usually use parameters such as the received signal strength for initiating a handover with some additional measurements to reduce unnecessary handovers and call dropouts. These schemes perform well when cell loads are somewhat evenly distributed, but fail to account for nonuniform traffic, as is often the case in microcells. Hence, it is desirable to design efficient handover schemes to avoid unnecessary handovers, reduce call dropouts and yet dynamically adapt to the variation of traffic among cells. In this paper, we present a new adaptive handover scheme that dynamically changes the handover boundaries to balance cell loads and to effectively reduce the average number of handovers. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Global multimedia collaboration system: Research Articles
Authors: Geoffrey Fox, Wenjun Wu, Ahmet Uyar, Hasan Bulut, Shrideep Pallickara
Venue: Concurrency and Computation: Practice Experience (2004)

In order to build an integrated collaboration system over heterogeneous collaboration technologies, we propose a global multimedia collaboration system (Global-MMCS) based on XGSP A&#x002F;V Web-Services framework. This system can integrate multiple A&#x002F;V services, and support various collaboration clients and communities. Now the prototype is being developed and deployed across many universities in U.S.A. and China. Copyright &copy; 2004 John Wiley & Sons, Ltd.
LiveWatch: The interactive live casting system
Authors: Kiyoshi Tanaka, Takahisa Taura, Akihito Akutsu, Hiroshi Jinzenji, Yoshinobu Tonomura
Venue: Systems and Computers in Japan (2004)

This paper proposes a viewer support service in which user-initiative value is added to livecasting programs, including livecasting with real-time properties such as sportscasting. For example, a viewer support service in which the desired scene is provided on the basis of user settings is realized by using live information, consisting of the scene descriptions in livecasting, corresponding to the meta-data of the video. In the LiveWatch system, the live information is input quickly and precisely by a manual procedure using an input support tool. The user application service is realized by aligning the video distribution to the live information, which involves delaying the distribution slightly. User applications, which differ for each type of casting and service, can be constructed in a simple way by using a newly developed authoring system. This paper describes the architecture of the LiveWatch system and reports the results of testing of a notification service using LiveWatch in an Internet netcasting experiment. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(6): 31&ndash;41, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10595
Generic methodology for open source software development
Authors: Keith A. Roberts
Venue: ACM SIGSOFT Software Engineering Notes (2005)

This is the outline proposal for a CASE tool and associated methodology for Open Source software development.
Meta-EAH: an adaptive encoder based on adaptive codes. Moving between adaptive mechanisms
Authors: Dragoş Trincǎ
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Adaptive codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. This class of codes has been introduced in [6] as a new class of non-standard variable-length codes. New algorithms for data compression, based on adaptive codes of order one and Huffman codes, have been presented in [7], where we have behaviorally shown that for a large class of input data strings, these algorithms substantially outperform the Lempel-Ziv universal data compression algorithm [12]. EAH has been introduced in [8], as an improved generalization of these algorithms. In this paper, we introduce Meta-EAH, an adaptive version of the EAH algorithm. Some comparisons between Meta-EAH and the Lempel-Ziv universal data compression algorithm are reported.
A Switched Ethernet Protocol for Hard Real-Time Embedded System Applications
Authors: Alimujiang Yiming, Toshio Eisaka
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This paper presents a protocol to support traffic for hard real-time applications over non real-time LAN technology, with a switched Ethernet based network concept without any modifications of existing Ethernet hardware. Simulation results demonstrate the proposed Ethernet protocol has better real-time performances, higher bandwidth and a larger data frame, and meets the requirements of reliability for hard real-time systems.
Testing Polymorphic Interactions in UML Sequence Diagrams
Authors: Siros Supavita, Taratip Suwannasart
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Nowadays UML based testing becomes more and more noteworthy, as UML is broadly accepted as de facto standard for object-oriented modeling language. A lot of researches propose test approaches for several types of UML diagrams, focusing on various viewpoints. An approach for testing polymorphic interactions, which are defined in UML Sequence Diagrams, is presented in this paper. From our observation, there are several forms of polymorphic interactions, which have their polymorphic behavior controlled by distinct factors. A method to test each form is determined from these factors. If an interaction is in one of the polymorphic forms defined in this paper, the factors that affect polymorphic behavior of the interaction can be addresses. Finally test cases for the interaction can be created for testing its polymorphic behavior.
Virtual reality for small colleges
Authors: Daniel C. Cliburn
Venue: Journal of Computing Sciences in Colleges (2004)

The popularity of Virtual Reality (VR) display systems has increased dramatically in recent years. VR applications are characterized by a virtual world into which users are immersed, providing interactivity and sensory feedback [1]. These superior sensory environments make virtual reality a popular medium for many types of applications, ranging from exploration of severe thunderstorm and tornado data [2], to architecture from ancient times [5]. Proponents of virtual reality feel that the VR experience enhances learning, since participants utilize more of their senses than with typical computer applications. VR systems generally provide displays to users in stereo projection that give a sense of 3D viewing. Traditionally, the cost of implementing virtual reality environment has been very high, limiting VR to only those institutions with large research budgets. However, with recent advances in commodity hardware capabilities and the reduction in cost of typical LCD projectors, a low cost VR system can now be constructed at any institution, even those with significant budget restrictions. This paper discusses our experiences with the construction of a stereo projection display environment at Hanover College, and some projects my students and I have done with this system. Several potential research projects in virtual reality, which could be done with little funding, are also proposed.
Does Active Exploration Suppress Tactile Flow Perception?
Authors: Davide Dente, Enzo Pasquale Scilingo, Nicola Sgambelluri, Antonio Bicchi
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper we report on results of a set of tests in which a group of subjects were asked to trace a straight line with the forefinger while actively scanning over a textured surface. A pattern of bumped dots, randomly distributed, and a diagonal striped pattern were used in order to investigate the occurrence of misleading perceptions based on the aperture problem of tactile flow during an active exploration. Obtained results are compared with findings achieved from a previous experiment based on passive exploration.
An augmented reality system to guide radio-frequency tumour ablation: Research Articles
Authors: S. Nicolau, A. Garcia, X. Pennec, L. Soler, N. Ayache
Venue: Computer Animation and Virtual Worlds (2005)

Radio-frequency ablation is a difficult operative task that requires a precise needle positioning in the centre of the pathology. This article presents an augmented reality system for hepatic therapy guidance that superimposes in real-time 3D reconstructions (from CT acquisition) and a virtual model of the needle on external views of a patient. The superimposition of reconstructed models is performed with a 3D&#x002F;2D registration based on radio-opaque markers stuck on to the patient's skin. The characteristics of the problem (accuracy, robustness and time processing) led us to develop automatic procedures to extract and match the markers and to track the needle in real time. Experimental studies confirmed that our algorithms are robust and reliable. Preliminary experiments conducted on a human abdomen phantom showed that our system is highly accurate (needle positioning error within 3&thinsp;mm) and enables the surgeon to reach a target in less than 1 minute on average. Our next step will be to perform an in vivo evaluation. Copyright &copy; 2005 John Wiley & Sons, Ltd.
X3D-UML: enabling advanced UML visualisation through X3D
Authors: Paul McIntosh, Margaret Hamilton, Ron van Schyndel
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

The Unified Modelling Language (UML) has become a commercially accepted standard for visualising software systems. Much of this success can be attributed to the computer aided software engineering (CASE) tools, which enable the UML to be effectively integrated into the software development life cycle. The UML is designed to be tool independent, however, in practice it would not be possible to manage the complexities of developing a large software system with "pencil and paper" UML diagrams. The UML is also designed to be extensible, allowing advanced use of visualisation such as 3D, however, in practice this extensibility is limited by the CASE tool used. With X3D-UML we present a means of using eXtensible 3D (X3D) as a visualisation medium for UML, enabling both standard and advanced visualisation to occur independent of CASE tools. We discuss the means, problems and benefits of transforming existing software system information into UML within an X3D environment.
A hybrid multicommodity routing algorithm for traffic engineering
Venue: Networks (2004)

Traffic engineering seeks to route traffic demands in data networks to guarantee certain quality of service &lpar;QoS&rpar; parameters while efficiently utilizing network resources. MPLS, for example, provides the essential capabilities to achieve this with explicit routing. Finding paths for all the demands which meet QoS requirements is a nontrivial task. Indeed, guaranteeing just bandwidth is known to be &Nscr;&Pscr;-hard. In this paper, we propose a new complete &lpar;exact&rpar; algorithm for solving this problem, which is a hybrid that tightly integrates Lagrangian optimization and Constraint Programming search. We evaluate its performance on a set of benchmark tests, based on a large well-provisioned commercial backbone. The tests involve demand sets of varying size, mostly between 100 and 600 demands. We compare the results with those achieved by several other well-known algorithms, some complete and some heuristic. This reveals that the hybrid algorithm typically yields the most informative results in the most effective way. It resolves most of the test cases either by finding a solution or by proving infeasibility, each taking only a few seconds. Moreover, the solutions found for solvable problems are provably near-optimal. The results show, perhaps surprisingly, that the routing task can be difficult even in a very well-provisioned network. &copy; 2004 Wiley Periodicals, Inc.
Book Review: Common Lisp: A Tutorial by Wendy Milner (Prentice-Hall)
Venue: Issue 107 (January 1989) (1989)

According to the author, this book is intended to be used by people that are interested in learning Common Lisp. A prior knowledge of Common Lisp programming is not assumed. 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
Large-vocabulary continuous speech recognition using linear lexicon search and 1-best approximation tree-structured lexicon search
Authors: Norihide Kitaoka, Nobutoshi Takahashi, Seiichi Nakagawa
Venue: Systems and Computers in Japan (2005)

The computational cost of a large-vocabulary continuous speech recognition system based on HMM is proportional to its vocabulary size. A tree-structured lexicon is generally used to reduce the number of HMM states. An approximation of the dependence of word boundaries and likelihoods on word histories is also used to limit the increase in the number of hypotheses in the forward decoding procedure. We first compared search algorithms with a tree-structured lexicon using certain approximation methods and algorithms with a linear lexicon. The algorithm based on 1-best approximation with a tree-structured lexicon is efficient but frequently misses the optimal sentence hypothesis. Linear lexicon search can find the optimal hypothesis but has a high computational cost. Thus, we propose a search method using 1-best approximation tree-structured lexicon search and linear lexicon search. The words expanded in the linear lexicon are dynamically selected according to likelihood. We evaluated this new search algorithm using read speech, broadcast news speech, and lecture speech, and obtained significant improvement of recognition performance, expanding only 250 to 500 words out of 20,000 words in the linear lexicon. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(7): 31&ndash;39, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20252
A Unified Framework for Tracking through Occlusions and across Sensor Gaps
Authors: Robert Kaucic, A. G. Amitha Perera, Glen Brooksby, John Kaufhold, Anthony Hoogs
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

A common difficulty encountered in tracking applications is how to track an object that becomes totally occluded, possibly for a significant period of time. Another problem is how to associate objects, or tracklets, across non-overlapping cameras, or between observations of a moving sensor that switches fields of regard. A third problem is how to update appearance models for tracked objects over time. As opposed to using a comprehensive multi-object tracker that must simultaneously deal with these tracking challenges, we present a novel, modular framework that handles each of these problems in a unified manner by the initialization, tracking, and linking of high-confidence tracklets. In this track/suspend/match paradigm, we first analyze the scene to identify areas where tracked objects are likely to become occluded. Tracking is then suspended on occluded objects and re-initiated when they emerge from behind the occlusion. We then associate, or match, suspended tracklets with the new tracklets using full kinematic models for object motion and Gibbsian distributions for object appearance in order to complete the track through the occlusion. Sensor gaps are handled in a similar manner, where tracking is suspended when the sensor looks away and then re-initiated when the sensor returns. Changes in object appearance and orientation during tracking are also seamlessly handled in this framework. Tracklets with low lock scores are terminated. Tracking then resumes on untracked movers with corresponding updated appearance models. These new tracklets are then linked back to the terminated ones as appropriate. Fully automatic tracking results from a moving sensor are presented.
Personalization versus Privacy: An Empirical Examination of the Online Consumer's Dilemma
Authors: Ramnath K. Chellappa, Raymond G. Sin
Venue: Information Technology and Management (2005)

Personalization refers to the tailoring of products and purchase experience to the tastes of individual consumers based upon their personal and preference information. Recent advances in information acquisition and processing technologies have allowed online vendors to offer varieties of web-based personalization that not only increases switching costs, but also serves as important means of acquiring valuable customer information. However, investments in online personalization may be severely undermined if consumers do not use these services due to privacy concerns. In the absence of any empirical evidence that seeks to understand this consumer dilemma, our research develops a parsimonious model to predict consumers' usage of online personalization as a result of the tradeoff between their value for personalization and concern for privacy. In addition to this tradeoff, we find that a consumer's intent to use personalization services is positively influenced by her trust in the vendor. Our findings suggest that: 1. online vendors can improve their abilities to acquire and use customer information through trust building activities; 2. it is of critical importance that vendors understand and evaluate the different values consumers may place in enjoying various types of personalization.
Analysis of high performance packet switch with input smoothing
Authors: Evgeniya Gospodinova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper presents high performance packet switch with input smoothing. The arriving packets are merged into frame, which enters simultaneously to input ports and reduce the latency through the switch. In this paper is shown that increasing the frame size lead to decreasing the probability of packets loss. As result the throughput of switch is increased. For research of this switch is developed simulation model in terms of packet loss probability and mean waiting time (time slots).