ppxscal/embedding_network huggingface dataset:
Impact of IP mobility on Skype session quality in IEEE 802.11 networks
Authors: Jen-Yi Pan, Liang-Wei Huang, Pei-Yuen Chiu
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Prevalent among Voice over Internet Protocol (VoIP) applications, Skype provides high quality voice communication and firewall transparency. To enhance its mobility, particular handheld devices and software on cellular phones designed for Skype have already appear on the market. Therefore, Skype over 802.11 networks is a consequential tendency. Presently, there are some researches about the effects on the voice quality of Skype heterogeneous network mobility, but they didn't probe into the mobility within the homogeneous network, such as Wi-Fi. IP mobility technologies do provide mobility for Skype, but some bottlenecks exist, and may degrade the voice quality seriously. This paper is the first to discuss Skype and IP mobility over homogeneous Wi-Fi network based on subscribers' point of view, by employing Network-based Localized Mobility Management (NetLMM) and measuring voice quality both in and out of handoff processes. This paper had proved NetLMM can reform the long transport path problem, by comparing to Mobile IP. Besides, by observing handoff procedures, key factors which cause long delays were addressed, and also their effects upon voice quality.
Video-Based Motion Capturing for Skeleton-Based 3D Models
Authors: Liang-Yu Shih, Bing-Yu Chen, Ja-Ling Wu
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In this paper, a semi-automatic method to capture motion data from a single-camera video is proposed. The input video is first segmented and analyzed, and a 3D character model with skeleton rigged is used as a reference model. Then, the reference model is modified to fit the subject's contour in the starting frame, and the body's and limbs' contours of the subject are also specified by the user. Our system then extracts the motion from the video by estimating the reference model's poses automatically in each video frame forwardly. Finally, the user can help to refine the result through a friendly user interface.
Energy consumption analysis of reputation-based trust management schemes of wireless sensor networks
Authors: Riaz Ahmed Shaikh, Young-Koo Lee, Sungyoung Lee
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Energy consumption is one of the most important parameters for evaluation of a scheme proposed for WSNs because of their resource constraint nature. Comprehensive comparative analysis of proposed reputation-based trust management schemes of WSNs from this perspective is currently not available in the literature. In this paper, we have filled this gap by first proposing Generic Communication Protocol (GCP) that is used to exchange trust values. Based on this proposed GCP protocol, we have presented a theoretical energy consumption analysis and evaluation of three state-of-the-art reputation-based trust management schemes of WSNs.
Network Formation and Routing by Strategic Agents Using Local Contracts
Authors: Elliot Anshelevich, Gordon Wilfong
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

In the Internet, Autonomous Systems (ASes) make contracts called Service Level Agreements (SLAs) between each other to transit one another's traffic. ASes also try to control the routing of traffic to and from their networks in order to achieve efficient use of their infrastructure and to attempt to meet some level of quality of service globally. We introduce a game theoretic model in order to gain understanding of this interplay between network formation and routing. Player strategies allow them to make contracts with one another to forward traffic, and to re-route traffic that is currently routed through them. This model extends earlier work of [3] that only considered the network formation aspect of the problem. We study the structure and quality of Nash equilibria and quantify the prices of anarchy and stability, that is, the relative quality of a centralized optimal solution versus that of the Nash equilibria.
New achievements for Romanian engineering training in modelling power systems
Authors: Stefania Popadiuc, Frangiskos Topalis, Cristiana Geambasu
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

The evolution of electric power system analysis methods followed the present technical problems and business needs of electric utilities in Romania, before EU integration. Present technical requirements and the current stage of power system analysis tools - are major subjects of the Romanian electric power engineering training. Training in Power Systems Transients and HV Electric Equipment requires a rich collection of computer applications on: transients and harmonic pollution on high- voltage transmission lines; non-linear equipment; non-linear consumers, etc. Such problems can only be taught to power engineers using due computer resources (hardware and software). The paper describes co-operation results between University POLITEHNICA of Bucharest and NTUA in up-dating applications of computer programming for successfully use in electric power engineering training. Ministry of Public Finance of Romania, through the Managing Authority for Community Support Framework, is guiding the training requirements, in order to accomplish the task of integration.
Euclid: a language for compiling quality software
Authors: David B. Wortman, Richard C. Holt, James R. Cordy, David R. Crowe, Ian H. Griggs
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

This paper discusses the design and implementation of a production-quality compiler for the programming language Euclid. Euclid is a Pascal-based system implementation language that has features to aid in the production of well-modularized, verifiable system software. The emphasis in this paper is on the insights that were gained in programming language design and implementation as a result of implementing this compiler.
Frugal event dissemination in a mobile environment
Authors: Sébastien Baehni, Chirdeep Singh Chhabra, Rachid Guerraoui
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

This paper describes an event dissemination algorithm that implements a topic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is frugal in two senses. First, it reduces the total number of duplicates and parasite events received by the subscribers. Second, both the mobility of the publishers and the subscribers, as well as the validity periods of the events, are exploited to achieve a high level of dissemination reliability with a thrifty usage of the memory and bandwidth. Besides, our algorithm is inherently portable and does not assume any underlying routing protocol. We give simulation results of our algorithms in the two most popular mobility models: city section and random waypoint. We highlight interesting empirical lower bounds on the minimal validity period of any given event to ensure its reliable dissemination.
The control data STAR-100: performance measurements
Authors: Charles J. Purcell
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The CONTROL DATA STAR-100 (STring-ARray) Computer is a very large, general purpose, high speed computing system. The STAR-100 computer utilizes integrated circuitry, ferrite core memory, 400 hz power and freon cooling in the hardware implementation. The logical design of the computer combines stream processing, virtual addressing, hardware macro instructions, segmented (pipeline) arithmetic units and a 256-word high speed register file to perform arithmetic and logical operation on discrete or structured data elements (Figure 1).
Balancing Academic and Industrial Needs in RE Courses
Authors: Lin Liu, Zhi Jin
Venue: Proceedings of the 2008 Requirements Engineering Education and Training (2008)

As people start to realize how poorly documented and managed requirements can affect the success of a software project, requirements engineering education start to attract growing attention in software institutes and companies in China. This paper reports our considerations regarding course materials selection, course projects design and evaluation to better balance the needs of training future requirements engineering researchers and software engineering professionals at undergraduate and graduate-level, as well as software professionals.
Multi-view Shape Recognition Based on Principal Component Analysis
Authors: Kosorl Thourn, Yuttana Kitjaidure
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In this paper, the principal component analysis (PCA)for multi-view shape recognition is proposed. Our algorithm presents the signed enclosed area signature as the shape representation. In our method, the barycenter contour is used for decomposing the shape boundary into multiscale level. At each scale level, the signed enclosed area signatures are obtained. After that, the principal component analysis (PCA) is used as the recognition strategy. This method is independent to starting point of the contour by exploiting the property of the discrete Fourier transform (DFT). In the experimentation, the various number of the sample shapes are used as the training set and the rest are used as the testing set. The experimental results indicate that the recognition accuracy are high enough even one sample shape per class is used as the training set. As the more training sample shapes per class are used, the higher recognition will be.
Speedy Detection Algorithm of Underwater Moving Targets Based on Image Sequence
Authors: Fa-quan Zhang, Yong Zhang, Li-ping Lu, Li-ying Jiang, Guang-zhao Cui
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

A real-time algorithm is presented to detect moving targets in underwater complex environment. The difference image is obtained by subtraction operation in frames of image sequence. An appropriate threshold is selected and the binary image of the difference image is obtained. Every part of the binary image is segmented into one single image by image segment algorithm. A definition of linear level is given based on the shape of objects formed by motion of targets in the difference image. The actual sizes of the original moving targets are inferred from linear level and area of the formed objects. The function of real-time detecting underwater moving targets is implemented using this algorithm. The algorithm has been used in underwater intelligent monitoring system in some large international games and meets the requirement of real-time. In practice, it is proved a fast and stable algorithm.
Decentralised H∞ control for singular systems
Authors: Yuepeng Chen, Chunnian Zeng, Zude Zhou, Qingling Zhang
Venue: International Journal of Systems Science (2009)

In this article, considering the design problem of decentralised H∞ controller of singular systems, the two cases of controllers via measurement feedback are designed: one is precise controller, and the other is additive controller gain variation. The design procedures of the two cases of controllers are presented in terms of the solutions to generalised algebraic Riccati inequalities. The designed controllers in each case guarantee that closed-loop singular systems are admissible and with H∞-norm bound on disturbance attenuation. Finally, a numerical example to demonstrate the validity of the proposed approach is given.
Chosen-Ciphertext Security via Correlated Products
Authors: Alon Rosen, Gil Segev
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs (x 1, ..., x k ), so that the function (f(x 1), ..., f(x k )) is one-way. The main motivation of this study is the construction of public-key encryption schemes that are secure against chosen-ciphertext attacks (CCA). We show that any collection of injective trapdoor functions that is secure under a very natural correlated product can be used to construct a CCA-secure encryption scheme. The construction is simple, black-box, and admits a direct proof of security.We provide evidence that security under correlated products is achievable by demonstrating that lossy trapdoor functions (Peikert and Waters, STOC '08) yield injective trapdoor functions that are secure under the above mentioned correlated product. Although we currently base security under correlated products on existing constructions of lossy trapdoor functions, we argue that the former notion is potentially weaker as a general assumption. Specifically, there is no fully-black-box construction of lossy trapdoor functions from trapdoor functions that are secure under correlated products.
AIR Bible, Pap/Onl edition
Authors: Benjamin Gorton
Venue:  (2008)

Adobe AIR is a revolutionary technology that blurs the line between the desktop and the web. The AIR Bible will get developers up and running building simple AIR application, then take them through all aspects of the new API. The authors have a wealth of experience in building Rich Internet Applications using Flex, Flash, HTML, and Ajax. They will bring their experience to the table walking the reader through application programming topics and demystifying the techniques developers use to build the kind of complex application that readers are sure to want to build with this exciting new technology.
An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing
Authors: Tong-Xiang Gu, Xian-Yu Zuo, Xing-Ping Liu, Pei-Lu Li
Venue: Journal of Computational and Applied Mathematics (2009)

An improved parallel hybrid bi-conjugate gradient method (IBiCGSTAB(2) method, in brief) for solving large sparse linear systems with nonsymmetric coefficient matrices is proposed for distributed parallel environments. The method reduces five global synchronization points to two by reconstructing the BiCGSTAB(2) method in [G.L.G. Sleijpen, H.A. van der Vorst, Hybrid bi-conjugate gradient methods for CFD problems, in: M. Hafez, K. Oshima (Eds.), Computational Fluid Dynamics Review 1995, John Wiley & Sons Ltd, Chichester, 1995, pp. 457-476] and the communication time required for the inner product can be efficiently overlapped with useful computation. The cost is only slightly increased computation time, which can be ignored, compared with the reduction of communication time. Performance and isoefficiency analysis shows that the IBiCGSTAB(2) method has better parallelism and scalability than the BiCGSTAB(2) method. Numerical experiments show that the scalability can be improved by a factor greater than 2.5 and the improvement in parallel communication performance approaches 60%.
Nonblocking k-Compare-Single-Swap
Authors: Victor Luchangco, Mark Moir, Nir Shavit
Venue: Theory of Computing Systems (2008)

The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based on single-location operations such as compare-and-swap (CAS), and general-purpose multilocation transactional memory implementations. While the former are sometimes efficient, they are invariably hard to extend and generalize. The latter are flexible and general, but costly. This paper aims at a middle ground: reasonably efficient multilocation operations that are general enough to reduce the design difficulties of algorithms based on CAS alone. We present an obstruction-free implementation of an atomic k -location-compare single-location-swap (KCSS) operation. KCSS allows for simple nonblocking manipulation of linked data structures by overcoming the key algorithmic difficulty in their design: making sure that while a pointer is being manipulated, neighboring parts of the data structure remain unchanged. Our algorithm is efficient in the common uncontended case: A successful k-location KCSS operation requires only two CAS operations, two stores, and 2k noncached loads when there is no contention. We therefore believe our results lend themselves to efficient and flexible nonblocking manipulation of list-based data structures in today&#x2019;s architectures.
Cooperation in Multiorganization Matching
Authors: Laurent Gourvès, Jérôme Monnot, Fanny Pascual
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

We study a problem involving a set of organizations. Each organization has its own pool of clients who either supply or demand one unit of an indivisible product. Knowing the profit induced by each buyer-seller pair, an organization's task is to conduct such transactions within its database of clients in order to maximize the amount of the transactions. Inter-organizations transactions are allowed: in this situation, two clients from distinct organizations can trade and their organizations share the induced profit. Since maximizing the overall profit leads to unacceptable situations where an organization can be penalized, we study the problem of maximizing the overall profit such that no organization gets less than it can obtain on its own. Complexity results, an approximation algorithm and a matching inapproximation bound are given.
Computing approximate Fekete points by QR factorizations of Vandermonde matrices
Authors: Alvise Sommariva, Marco Vianello
Venue: Computers Mathematics with Applications (2009)

We propose a numerical method (implemented in Matlab) for computing approximate Fekete points on compact multivariate domains. It relies on the search of maximum volume submatrices of Vandermonde matrices computed on suitable discretization meshes, and uses a simple greedy algorithm based on QR factorization with column pivoting. The method gives also automatically an algebraic cubature formula, provided that the moments of the underlying polynomial basis are known. Numerical tests are presented for the interval and the square, which show that approximate Fekete points are well suited for polynomial interpolation and cubature.
Comparison of Feature Construction Methods for Video Relevance Prediction
Authors: Pablo Bermejo, Hideo Joho, Joemon M. Jose, Robert Villa
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

Low level features of multimedia content often have limited power to discriminate a document's relevance to a query. This motivated researchers to investigate other types of features. In this paper, we investigated four groups of features: low-level object features, behavioural features, vocabulary features, and window-based vocabulary features, to predict the relevance of shots in video retrieval. Search logs from two user studies formed the basis of our evaluation. The experimental results show that the window-based vocabulary features performed best. The behavioural features also showed a promising result, which is useful when the vocabulary features are not available. We also discuss the performance of classifiers.
Motion capture system using single-track gray code
Authors: Tomoko Fujii, Hideaki Nii, Takuji Tokiwa, Maki Sugimoto, Masahiko Inami
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In this paper, we describe a high speed optical motion capture method that has a simple mechanism. We use a light shielding filter using a pattern of Single-Track Gray Code (STGC) [1] absolute encoder to take location of IR light marker tags instead of high-speed camera or row of binary coded masks. Therefore, this system can convert the position coordinate of tags into the digital signal directly, and it can track faster than the traditional method, with only the combination of inexpensive optical parts.
Introducing functional classification theory to land use planning by means of decision tables
Authors: Frank Witlox, Marc Antrop, Peter Bogaert, Philippe De Maeyer, Ben Derudder, Tijs Neutens, Veronique Van Acker, Nico Van de Weghe
Venue: Decision Support Systems (2009)

This paper contributes to the conceptualisation and analysis of double-sided matching problems, taking the land use planning problem as an example. It does so by introducing functional classification theory at the knowledge level, the symbol level and the system level of a DSS. This theory explicitly expresses the methodological viewpoint of relational realism. At the knowledge level this implies defining knowledge on the basis of matching the intension and extension of concepts. At the symbol level it deals with knowledge representation and here decision tables are advanced and formally introduced. At the system level the formalism used at the symbol level is implemented to develop a relational matching DSS.
Electronic mail: evolving from intracompany to intercompany
Authors: H. Paris Burstyn
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The roots of electronic mail technology go back to the first facsimile systems, but most people today think of electronic mail as computer-based message systems (CBMS)---either remote electronic mail services or electronic mail software packages running on in-house computers. Systems and services providing access to databases and data processing as well as simple command and menu structures will attract new users. Over the next five years, as electronic mail use grows, the people who communicate within companies (intracorporate communications) will want to contact people outside their company (intercorporate communications). Value-added services that provide private messaging systems must begin providing access between organizations' private networks and the value-added networks. They must also make possible user-transparent access between organizations that subscribe to their services. Today only a few services provide this facility, and then only by special arrangement. Eventually it will not matter which network a user signs onto to receive mail; gateways will provide transparent access between the networks to make it possible to have internetwork and international electronic mail. 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
Rapid Software Prototyping Using Ajax and Google Map API
Authors: Francis Rousseaux, Kevin Lhoste
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

Nowadays, when the evolution of IT tools is faster than ever, the user's needs are evolving even faster. For a software company such a context is difficult to be handled because, within a classical development cycle, the development of an application takes several months or years delivery. A rapid software prototyping could be very useful in those cases helping the user to rethink its needs in terms of functionalities and interfaces. We study how the emergence of new web tools, which allow developers to use a large predefined set of data and functionalities through free public APIs (e.g., Google maps) can help to achieve rapid software prototyping.This article will use a real-time example of rapid software prototyping for military applications. In the first part, we show past difficulties for designing such systems. In the second part, we show how the rapid prototyping strategy becomes relevant with the emergence of web tools. In the third part we present the technical implementation of the project. Finally we conclude about perspectives and limitations of this method.