ppxscal/embedding_network huggingface dataset:
Towards an end-to-end delay analysis of wireless multihop networks
Authors: Min Xie, Martin Haenggi
Venue: Ad Hoc Networks (2009)

In wireless multihop networks, end-to-end (e2e) delay is a critical parameter for quality of service (QoS) guarantees. We employ discrete-time queueing theory to analyze the end-to-end (e2e) delay of wireless multihop networks for two MAC schemes, m-phase TDMA and slotted ALOHA. In one-dimensional (1-D) networks, due to the lack of sufficient multiplexing and splitting, a space-time correlation structure exists, the nodes are spatially correlated with each other, and the e2e performance cannot be analyzed as in general two-dimensional networks by assuming all nodes independent of each other. This paper studies an 1-D network fed with a single flow, an extreme scenario in which there is no multiplexing and splitting. A decomposition approach is used to decouple the whole network into isolated nodes. Each node is modeled as a GI/Geo/1 queueing system. First, we derive the complete per-node delay distribution and departure characterization, accounting for both the queueing delay and access delay. Second, based on the departure process approximation, we define a parameter to measure the spatial correlation and its influence on the e2e delay variance. Our study shows that traffic burstiness of the source flow and MAC together determines the sign of the correlation.
The Bird
Authors: Sang-Won Han, Sung-Gil Kim, Na-Kyoung Kim
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

Husum is a very small village on an island. Every few years, the residents have to leave the village because it is always under the threat of bombing by a mysterious aircraft.
CT2008: Tomography Confluence An International Conference on the Applications of Computerized Tomography (AIP Conference Proceedings), 1st edition
Authors: Prabhat Munshi
Venue:  (2008)

Inverse measurements are gaining importance in all areas of science and engineering. Computerized Tomography (CT) is a powerful tool that can be applied in a variety of situations for making such measurements. These CT images thus produced give internal structures (in case of solids) of the object with breaking them. In case of fluids, gases, plasmas and multiphase flows, CT techniques give cross sectional measurement in a non-invasive manner thus not disturbing the flow field. CT2008 was aimed at bringing together various experimental groups (in diverse areas) together on the same platform. Crosstalk, thus generated, will go a long way in improving the current experimental methodologies in a significant way.
A Route Optimization Technique for LFN-CN in NEMO
Authors: Dinakaran M, P. Balasubramanie
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Nowadays, the requirement of Internet is increasing in more and more heterogeneous scenarios; especially in mobile platforms, such as Planes, trains and buses. NEMOWG (NEtwork MObility Workging Group) a new working group in IETF (Internet Engineering Task Force) is formed to provide mechanisms to manage the mobility of a network as a whole, enabling that network to change its point of attachment to an IP-based fixed infrastructure without disturbing the ongoing communications or sessions. This article describes the IPv6 Network Mobility (NEMO) basic support protocol, analysis its limitation and suggesting a solution for one of the problem.
Computational Processing of the Portuguese Language: 8th International Conference, PROPOR 2008 Aveiro, Portugal, September 8-10, 2008, Proceedings (Lecture ... / Lecture Notes in Artificial Intelligence), 1 edition
Authors: A. Joaquim da Silva Teixeira, Vera Lcia Strube de Lima, Lus Caldas de Oliveira, Paulo Quaresma
Venue:  (2008)

This book constitutes the thoroughly refereed proceedings of the 8th International Workshop on Computational Processing of the Portuguese Language, PROPOR 2008, held in Aveiro, Portugal, in September 2008. The 21 revised full papers and 16 revised short papers presented were carefully reviewed and selected from 63 submissions. The papers are organized in topical sections on speech analysis; ontologies, semantics and anaphora resolution; speech synthesis; machine learning applied to natural language processing; speech recognition and applications; natural language processing tools and applications; posters.
Web-Client Based Distributed Generalization and Geoprocessing
Authors: Eric B. Wolf, Kevin Howe
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

Generalization and geoprocessing operations on geospatial information were once the domain of complex software running on high-performance workstations. Currently, these computationally intensive processes are the domain of desktop applications. Recent efforts have been made to move geoprocessing operations server-side in a distributed, web accessible environment. This paper initiates research into portable client-side generalization and geoprocessing operations as part of a larger effort in user-centered design for the US Geological Survey's The National Map. An implementation of the Ramer-Douglas-Peucker (RDP) line simplification algorithm was created in the open source OpenLayers geoweb client. This algorithm implementation was benchmarked using differing data structures and browser platforms. The implementation and results of the benchmarks are discussed in the general context of client-side geoprocessing.
The Human-Provided Services Framework
Authors: Daniel Schall, Hong-Linh Truong, Schahram Dustdar
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

The collaboration landscape evolves rapidly by allowing people to participate in ad-hoc and process-centric collaborations. Thus, it is important to support humans in managing highly dynamic and complex interactions. The problem currently with managing interactions is that humans are unable to specify different interaction interfaces for various collaborations, nor able to indicate their availability to participate in collaborations. This paper introduces the Human-provided Services (HpS) framework, which allows users to provide services based on their skills and expertise. Such services can be used by human actors and software services in both ad-hoc and process-centric collaborations. With the HpS framework, people can offer multiple services and manage complex interactions, while requesters can find the right experts and available users for performing specific tasks. In this paper, we present the HpS middleware, which is the core of the HpS framework. We show how HpS services can be used in Web-scale ad-hoc collaboration scenarios.
A novel mechanism to dynamically switch speed and accuracy in systemC based transaction level models
Authors: Zhu Zhou, Dharmin Parikh, Pradnyesh Gudadhe, Arunabha Sen
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

OSCI's TLM-2.0 standard enables the simulation of functionality and timing of a system by defining two coding styles namely Loosely-timed (LT) and approximately timed (AT). Without dynamic switching between the two modes, a user interested in performance analysis is forced to execute the model in AT mode for the entire duration of simulation. A run-time switching mechanism enables user to execute uninteresting simulation portions (e.g. operating system boot) in the high speed LT mode and switch to detailed AT model only when one needs to carry out detailed micro-architectural analysis (e.g. benchmark execution). In this paper, we introduce a comprehensive switching mechanism that addresses all the potential issues during LT-to-AT and AT-to-LT transitions. We test this switching methodology on one Intel proprietary Interconnect Bus model and demonstrate a 24X speedup over AT-only simulations.
Efficient covariance matrix update for variable metric evolution strategies
Authors: Thorsten Suttorp, Nikolaus Hansen, Christian Igel
Venue: Machine Learning (2009)

Randomized direct search algorithms for continuous domains, such as evolution strategies, are basic tools in machine learning. They are especially needed when the gradient of an objective function (e.g., loss, energy, or reward function) cannot be computed or estimated efficiently. Application areas include supervised and reinforcement learning as well as model selection. These randomized search strategies often rely on normally distributed additive variations of candidate solutions. In order to efficiently search in non-separable and ill-conditioned landscapes the covariance matrix of the normal distribution must be adapted, amounting to a variable metric method. Consequently, covariance matrix adaptation (CMA) is considered state-of-the-art in evolution strategies. In order to sample the normal distribution, the adapted covariance matrix needs to be decomposed, requiring in general ¿(n 3) operations, where n is the search space dimension. We propose a new update mechanism which can replace a rank-one covariance matrix update and the computationally expensive decomposition of the covariance matrix. The newly developed update rule reduces the computational complexity of the rank-one covariance matrix adaptation to ¿(n 2) without resorting to outdated distributions. We derive new versions of the elitist covariance matrix adaptation evolution strategy (CMA-ES) and the multi-objective CMA-ES. These algorithms are equivalent to the original procedures except that the update step for the variable metric distribution scales better in the problem dimension. We also introduce a simplified variant of the non-elitist CMA-ES with the incremental covariance matrix update and investigate its performance. Apart from the reduced time-complexity of the distribution update, the algebraic computations involved in all new algorithms are simpler compared to the original versions. The new update rule improves the performance of the CMA-ES for large scale machine learning problems in which the objective function can be evaluated fast.
Target Localization for Autonomous Soccer Robot Based on Vision Perception
Authors: Guifang Shao, Yuhua Wen, Fang Yu, Zushu Li
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

In order to solve the target localization question for autonomous soccer robot, a coordinate space transformation model was developed. Based on the characteristic analysis of camera, we use panoramic vision to adjust robot posture, use foreground vision to count the exact distance between object and robot, and calculate the vertically distance and horizontal distance through transform frame coordinate system to world coordinate system. Contrastive experiment results prove that this algorithm is accurate and reliable, it also be successfully used for object reorganization and position judgment at RoboCup competition.
New directions for micro- and system architectures in the 1980s
Authors: Harold W. Lawson,  Jr.
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

After approximately 30 years experience with microprogrammed control concepts, we find ourselves at an interesting turning point leading into the 1980s. Experience with various microprogrammed control techniques has been obtained, some experience has been obtained in recent years in the redistribution of functions between various software and microarchitectural levels and we have a better idea of methods of timing and synchronization. This knowledge together with the possibilities brought on by VLSI will meet in the 1980s and have several interesting effects upon system architecture at microarchitecture and higher architectural levels. We shall consider some of the opportunities and limitations of VLSI and their potential effects upon microarchitecture followed by a view of the future utilization of "programmed logic." More specifically, we shall be considering the organization of logic, synchronization, microarchitecture characteristics, target machine properties and special purpose microprogrammed machines. Further, we shall touch upon relationships to function distribution, computer aided design and the possibilities for architectural synthesis.
A reverse-encoding-based on-chip AHB bus tracer for efficient circular buffer utilization
Authors: Fu-Ching Yang, Cheng-Lung Chiang, Ing-Jer Huang
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

The post-T/pre-T trace refers to the trace captured before/after a target point is reached, respectively. Real time compression of the post-T trace in a circular buffer is a challenging problem since the initial state of the trace being compressed might be corrupted when wrapping around occurs and thus, makes it difficult to reconstruct the trace from the incomplete information stored in the circular buffer. This paper proposes an efficient compression algorithm which is capable of compressing both pre-T and post-T traces. The algorithm is based on an innovative reverse encoding scheme by reversing the order of the datum being encoded and the datum being referred. This algorithm has been successfully implemented in a realtime on-chip AHB bus tracer and has been embedded in a 3D graphics SoC as an application example. The bus tracer costs only 44K gates and runs at 500MHz on 0.13um technology. Experiments have shown that this bus tracer achieves 100% circular buffer utilization and captures 1.2x and 4.86x trace depths than state-of-the-art related work and conventional industrial approaches, respectively.
Content-Based Mining of Query Replacements
Authors: Hung V Nguyen
Venue:  (2008)

This book introduces the problem of content-based query replacement. It motivates the term correlation modeled using MRFs and the sampling based technique to learn the search phrase definitions. These definitions are used as alternative queries to achieve higher accuracy in several retrieval tasks. Retrieving relevant documents while eliminating irrelevant documents for an users query is a challenging task which involves a good understanding of the relation between the data and the query as well as developing algorithms that can efficiently measure the relevance of the data to the query. As part of this dissertation, we have developed a hypothesis to reduce the problem of mining search phrase definitions significantly by modeling the joint distribution of terms as a product of conditional distributions, modeled as a Markov Random Field. We assume that there exists an underlying joint distribution among terms that are used to describe the search phrase. The modeling we propose is a condensed representation of inter- term relationship and it appears to capture insight statistics among terms. describes a target phrase.
Technical communique: D-stability and D-stabilization of linear discrete time-delay systems with polytopic uncertainties
Authors: Wei-Jie Mao, Jian Chu
Venue: Automatica (Journal of IFAC) (2009)

Sufficient conditions for D-stability and D-stabilization of linear discrete time-delay systems with polytopic uncertainties are proposed in this paper. The results are based on parameter-dependent Lyapunov functions obtained from the feasibility of a set of linear matrix inequalities defined at the vertices of polytopic systems. These conditions guarantee all the poles of a corresponding system in a specified circular region. Finally, an illustrative example shows that the proposed conditions are effective to check the D-stability and to design the D-stabilizing controller for linear discrete time-delay systems.
Automatic formal verification of block cipher implementations
Authors: Eric Whitman Smith, David L. Dill
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

This paper describes an automatic method for proving equivalence of implementations of block ciphers (and similar cryptographic algorithms). The method can compare two object code implementations or compare object code to a formal, mathematical specification. In either case it proves that the computations being compared are bit-for-bit equivalent. The method has two steps. First the computations are represented as large mathematical terms. Then the two terms are proved equivalent using a phased approach that includes domain-specific optimizations for block ciphers and relies on a careful choice of both word-level and bit-level simplifications. The verification also relies on STP [5], a SAT-based decision procedure for bit-vectors and arrays. The method has been applied to verify real, widely-used Java code from Sun Microsystems and the open source Bouncy Castle project. It has been applied to implementations of the block ciphers AES, DES, Triple DES (3DES), Blowfish, RC2, RC6, and Skipjack as well as applications of the cryptographic hash functions SHA-1 and MD5 on fixed-length messages.
Web Source Evaluation and Selection by Mass Collaboration
Authors: Yanhui Ding, Qingzhong Li, Yongquan Dong
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Web has already become the richest information resource of the world. Web sources are open, dynamic, and autonomous. Evaluating and selecting high quality Web source is a key for the success of Web-based applications. Currently, most of the web source evaluation and selection are performed by web experts. However, there are too many Web sources in any field, this process has proved to be very time consuming and costly. In this paper, we propose a novel approach which evaluates web source quality by mass collaboration. The approach shifts the enormous endeavor from the expert to the consumers and promotes web source quality to be evaluated quickly and effectively.
Research Challenges for Achieving Healthcare Business Process Interoperability
Authors: Dimitrios Alexandrou, Gregoris Mentzas
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

E-Health systems' interoperability constitutes one of the main challenges of the IT society. E-Health interoperability will not occur without a shared policy and a process framework that will support appropriate business collaboration models and provide a sustainable environment in which interoperable solutions can be created, deployed, and managed. Coordinated business interactions require a common understanding of business function even though alternative delivery mechanisms and channels may be employed. In the healthcare context, a patient visits various organizations or units within organizations to get proper treatment. The role of "healthcare workflow-management by use of IT" is to adjust the contributions of those organizations or units in terms of effective service provision, appropriate timing, and best quality. Workflow management technology can play an important role, for it helps to organize, automate and improve business processes. Supporting clinical processes with information technology requires workflow specification (i.e., the identification of tasks, procedural steps, input and output information, people and departments involved, and the management of information flow according to this specification).
The Social Service Network - Web 2.0 Can Make Semantic Web Services Happen
Authors: Khaled El-Goarany, Iman Saleh, Gregory Kulczycki
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Despite the evident benefits of semantic Web services, their widespread adoption by the industry is hindered by practicality issues. We see great promise in using proven Web 2.0 techniques to enable semantic Web services technologies to rise to their potential. We propose the Social Service Network (SSN) – a framework integrating Web 2.0 social aspects to automatically enrich Web services with semantic meanings based on community consensus. Additionally, we propose an innovative Web service recommendation system within the SSN that makes use of generated ontologies to discover similar and complementary Web services. We demonstrate the usefulness of our approach with a practical use case scenario.
An Efficient Fast Inter Mode Decision Algorithm for H.264/AVC
Authors: Huaibin Huang, Dong Hu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

An efficient fast inter mode decision algorithm for the baseline H.264/AVC video coding is proposed in this paper. The main idea of the algorithm is to reduce the number of candidate modes for Rate Distortion Optimization(RDO) by using early mode detection in four different levels, viz. SKIP mode detection, type detection at macroblock-level, type detection at submacroblock-level and intra modes detection. In addition, the correlation of cost of current MB and the one of previous frame, as well as the cost's monotonous property are both used to help the mode decision. Compared to JM8.6 reference software, our algorithm can save encoding time 71.743% on average with negligible PSNR loss, which is very helpful for H.264/AVC inter frame encoding.
Usefulness States in New P System Communication Architectures
Authors: Juan Alberto Frutos, Fernando Arroyo, Alberto Arteta
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

Dealing with distributed implementations of P systems, the bottleneck communication problem has arisen. When the number of membranes grows up, the network get congested. In agreement with this, several published works have presented an analysis for different architectures, which implement P systems in a distributed cluster of processors, allocating several membranes to the same processor. The purpose of these architectures is to reach a compromise between the massively parallel character of the system and the needed evolution step time to transit from one configuration of the system to the next one, solving the bottleneck communication problem.The work presented here carries out an analysis of semantics of the P systems, in several distributed architectures. It will be shown how to restructure P systems when dissolutions or inhibitions take place in membranes. Moreover, it will be also determined the extra information necessary at every communication step in order to allow all objects to arrive at their targets without penalizing the communication cost. This will be based on usefulness states, presented in a previous work, which allow each membrane of the system to know the set of membranes with which communication is possible at any time.
Deblocking Filter Algorithm with Low Complexity for H.264 Video Coding
Authors: Jung-Ah Choi, Yo-Sung Ho
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In H.264, block-based discrete cosine transform (DCT) and block-based motion compensated prediction are used to reduce both spatial and temporal redundancies. Due to the block-based coding, discontinuities at block boundaries, referred to blocking artifacts are created. To reduce these blocking artifacts, H.264 employs a deblocking filter. However, it causes a significant amount of complexity; therefore, the deblocking filter occupies one-third of the computational complexity of the decoder. In this paper, we propose a deblocking filtering algorithm with low complexity. Using boundary strength (BS) of the first Line-of-Pixel (LOP), we determine BS of successive LOP in advance. Then, we apply deblocking filters including newly designed filters. Experimental results show that the proposed algorithm provides an average computations reduction of 73.45 % in the BS decision. In the filter implementation, it reduces an average 57.52 % of additions, 100 % of multiplications, and 5.66 % of shift operations compared to the deblocking filter in H.264 with comparable objective quality.