ppxscal/embedding_network huggingface dataset:
Content Delivered on Internet - How Much Can We Trust?
Authors: Chi-Hung Chi, Lin Liu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

In this paper, we investigate the trust problem that the data retrieval and reuse processes bring to web content. We argue that this trust problem is due to the inappropriate setup of web server, heterogeneity and presentation demand of web clients, value-added functions (including caching) in the network, and insufficient trust-related support in current web architecture and protocols. To quantify our arguments on the trust issue of web content, modeling and monitoring of real data on Internet was conducted to quantify the seriousness of its error situation.
Relative stability analysis of multiple queues
Authors: Lam Sum, Rocky K. C. Chang, Yi Xie
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

In this paper we consider a general class of single-server multiqueue systems in which the stability of any single queue can be essentially determined by the queue's arrival rate and service rate. We refer such class of systems to as Rate Stability (RS) multiqueue systems. The RS-multiqueue system is general enough to admit different stability definitions and different models. We will present two sets of new results for the RS-multiqueue systems. These results extend many previous results on the stability analysis of multiqueue systems.In the first part, we report that the RS-multiqueue systems can be classified into three classes. In each class, any pair of queues exhibits different interaction properties in three aspects: the number of intersection points of their stability boundaries, their possible relative stability relation, and whether a queue can have guaranteed service once becoming unstable.In the second part, we present a relative stability analysis of two RS-multiqueue models: a polling model and a random access model. Moreover, the analysis facilities the absolute stability analysis of the models.
Identifying usability and fun problems in a computer game during first use and after some practice
Authors: W. Barendregt, M. M. Bekker, D. G. Bouwhuis, E. Baauw
Venue: International Journal of Human-Computer Studies (2006)

This paper describes an experiment to discover the change in the types of detected problems and the attitude of children towards a game when user testing a computer game for young children during first use and after they have practiced with a game. Both the numbers of different types of identified problems and the severity of the problems are investigated. Based on this knowledge, practitioners could adapt the set up of their user tests to effectively find as many aspects of the game as possible that merit change, according to the aims of the developers. The study shows that usability problems caused by a lack of knowledge were more often identified during first use. Furthermore, fun problems related to a too-high challenge level may disappear after some practice, whereas fun problems caused by the game taking over control for too long while the user wants to proceed playing the game were identified more often after some practice. The study shows that the impact severity of problems detected during first use was higher than when children had more practice with a game. As a result of these changes in experienced problems the commonly used measures efficiency, effectiveness and satisfaction increased when children had practiced with the game. Finally, the study also shows that the set of most severe problems identified during first use may be radically different from the set of most severe problems identified after some practice.
Multiplierless Realization of Modified Comb Filter by Using Xilinx Spartan FPGAs
Authors: Go-An Rau, Meng-Xin Guo
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

An efficient and inexpensive technique for implementing linear-phase filters that use a comb pattern that do not contain a multiplication unit is presented. The multiplierless Xilinx Spartan field programmable gate arrays (FPGAs) are used to implement the filtering algorithms. A barrel shifter and a pipeline adder are constructed to accelerate the processing speed. This FPGA-based approach is superior to the traditional method of using programmable digital signal processor (PDSP).
On bias in transfer functions estimated with stochastic excitation
Authors: P. M. T. Broersen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

In stationary stochastic processes, the input signal will already be present before the measurement interval starts and the response will continue after that interval. The unknown past inputs and the end effects cause inaccuracies in estimating a transfer function from the simultaneous frames of the input and output signals. The effect of the transient remainder terms is usually characterized with error bounds on the Fourier transform of the output signal. This paper presents a bias and a variance expression to describe the uncertainty in an estimated transfer function. The theoretical expressions are applied to different algorithms for transfer function estimation and their accuracy has been established in simulation experiments. 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
Are two rotational flows sufficient to calibrate a smooth non-parametric sensor?
Authors: Etienne Grossmann, Eun-Joo Lee, Peter Hislop, David Nister, Henrik Stewenius
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We present an attempt to determine whether the shape of a generic central-projection camera, such as the eye of an insect or a log-polar camera, can be determined from two motion flows resulting from purely rotational motions with non-collinear axes. Our first contribution is to write the smooth non-parametric calibration problem as a differential equation. It is unclear at present whether this problem has unique solution, up to an orthogonal transformation. Our second contribution is a discretized version of this smooth problem, for which we give a calibration algorithm - a third contribution. Using this algorithm, we explore numerically the properties of the discrete self-calibration problem, giving some insight on the nature of the problem. We show examples of successful self-calibration, but cannot give a definite affirmative answer to the question in the title.
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation
Authors: Tuomas Sandholm, Andrew Gilpin
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to retain much of their private valuation information, yet generates close-to-optimal expected utility for the seller. We show that if each buyer receives at most one offer, each buyer's dominant strategy is to act truthfully. In more general TLAs, the buyers' optimal strategies are more intricate, and we derive the perfect Bayesian equilibrium for the game. We develop algorithms for finding the equilibrium and also for optimizing the offers so as to maximize the seller's expected utility. In several example settings we show that the seller's expected utility already is close to optimal for a small number of offers. As the number of buyers increases, the seller's expected utility increases, and becomes increasingly (but not monotonically) more competitive with Myerson's expected utility maximizing auction.
Generalized trace formula and asymptotics of the averaged Turan determinant for polynomials orthogonal with a discrete Sobolev inner product
Authors: Boris P. Osilenker
Venue: Journal of Approximation Theory (2006)

Let µ be a finite positive Borel measure supported on [-1, 1] and introduce the discrete Sobolev-type inner product (f, g) = ∫-11 f(x)g(x)dµ(x) + Σk=1k Σi=0Nk Mk,i f(i)(ak)g(i)(ak), where the mass points ak belong to [-1, 1] , and Mk,i > 0(i = 0, 1 .....,Nk). In this paper, we obtain generalized trace formula and asymptotics of the averaged Turan determinant for the Sobolev-type orthogonal polynomials. Asymptotics of the recurrence coefficients for symmetric Gegenbauer-Sobolev orthogonal polynomials is obtained. Trace formula and asymptotics of Turan's determinant for Gegenbauer-Sobolev orthogonal polynomials are also given.
Comparing C++ and ERLANG for motorola telecoms software
Authors: Phil Trinder
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Erlang (2006)

There is considerable folklore suggesting that ERLANG aids the rapid production of robust distributed systems, but only a few rather general studies published. This talk reports the first systematic comparative evaluation of ERLANG in the context of substantial commercial products.Our research strategy is to re-engineer two C++/CORBA telecoms applications in ERLANG and make comparative measurements of both implementations. The first component is a medium-scale (15K line) Dispatch Call Controller (DCC), and the second a smaller (3K line) Data Mobility (DM) component that is closely integrated with five other components of a radio communications subsystem (RCS). To investigate interoperation costs we have constructed two DMs: a pure ERLANG implementation and an ER-LANG/C implementation that reuses some C DM libraries.We investigate the following six research questions, first considering the potential benefits of a high-level distributed language technology like ERLANG.
Sensitivity analysis for robust parameter design experiments
Authors: Joseph R. Litko
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Robust parameter design experiments lead to products and processes that are insensitive to the effects of noise. These experiments reveal the interaction of the noise sources with design or control factors usually allowing creation of products that are relatively immune to noise. Finding truly optimal settings for design factors depends on the noise in the lab being representative of the actual operating environment and assumes potential product users all see the same noise conditions. This paper shows how basic design solutions can be shaped when multiple populations see different noise conditions and when typical assumptions on noise sources are violated.
Exact solutions of interactive POMDPs using behavioral equivalence
Authors: Bharanee Rathnasabapathy, Prashant Doshi, Piotr Gmytrasiewicz
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We present a method for transforming the infinite interactive state space of interactive POMDPs (I-POMDPs) into a finite one, thereby enabling the computation of exact solutions. I-POMDPs allow sequential decision making in multi-agent environments by modeling other agents' beliefs, capabilities, and preferences as part of the interactive state space. Since beliefs are allowed to be arbitrarily nested and are continuous, it is not possible to compute optimal solutions using value iteration as in POMDPs. We present a method that transforms the original state space into a finite one by grouping the other agents' behaviorally equivalent models into equivalence classes. This enables us to compute the complete optimal solution for the I-POMDP, which may be represented as a policy graph. We illustrate our method using the multi-agent Tiger problem and discuss features of the solution.
Wavelet-packet identification of dynamic systems in frequency subbands
Authors: Henrique Mohallem Paiva, Roberto Kawakami Harrop Galvão
Venue: Signal Processing (2006)

This work presents a technique for linear system identification in frequency subbands by using wavelet packets. The wavelet-packet decomposition tree is used to establish frequency bands where subband models are created. An algorithm is proposed to adjust the tree structure, in order to achieve a compromise between accuracy and parsimony of the model. In a simulated example involving the identification of an aircraft model, the results of the proposed technique are favourably compared with those of a standard time-domain method.
Multi-facet Category for Cultural Digital Resources
Authors: Satoko Fujisawa, Frederic Andres
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

This paper points out a key issue related to the integration between cultural ontology based metadata management services and content management of digital resources. A multi-facet resource categorization approach is applied to metadata sets, allowing the metadata optimization of the description of cultural resources. It is part of the cultural ontology based metadata management system which supports interoperable semantic management.
Efficient Concurrency Control for Mobile Real-Time Transactions in Data Broadcast Environments
Authors: Guohui Li, Bing Yang, Jixiong Chen
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

In a wireless data broadcast environment, there is a limited upstream bandwidth from mobile clients to the fixed database server. Traditional concurrency protocols are unsuitable in such an asymmetric communication environment. In this paper, we introduce a concurrency control protocol which integrates optimistic concurrency control and timestamp ordering. A mobile read-only transaction is weak consistent and the serialization graph consisting of all update transactions and a mobile read-only transaction is acyclic. By using this protocol, mobile read-only transactions can execute autonomously and mobile update transactions can detect data conflicts earlier. Extensive simulation experiments are conducted and the result shows that compared with existing concurrency control protocols, more mobile real-time transactions can commit before their deadline expire.
LIFT: A Low-Overhead Practical Information Flow Tracking System for Detecting Security Attacks
Authors: Feng Qin, Cheng Wang, Zhenmin Li, Ho-seop Kim, Yuanyuan Zhou, Youfeng Wu
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Computer security is severely threatened by software vulnerabilities. Prior work shows that information flow tracking (also referred to as taint analysis) is a promising technique to detect a wide range of security attacks. However, current information flow tracking systems are not very practical, because they either require program annotations, source code, non-trivial hardware extensions, or incur prohibitive runtime overheads. This paper proposes a low overhead, software-only information flow tracking system, called LIFT, which minimizes run-time overhead by exploiting dynamic binary instrumentation and optimizations for detecting various types of security attacks without requiring any hardware changes. More specifically, LIFT aggressively eliminates unnecessary dynamic information flow tracking, coalesces information checks, and efficiently switches between target programs and instrumented information flow tracking code. We have implemented LIFT on a dynamic binary instrumentation framework on Windows. Our real-system experiments with two real-world server applications, one client application and eighteen attack benchmarks show that LIFT can effectively detect various types of security attacks. LIFT also incurs very low overhead, only 6.2% for server applications, and 3.6 times on average for seven SPEC INT2000 applications. Our dynamic optimizations are very effective in reducing the overhead by a factor of 5-12 times.
A survey of energy-efficient scheduling mechanisms in sensor networks
Authors: Lan Wang, Yang Xiao
Venue: Mobile Networks and Applications (2006)

Sensor networks have a wide range of potential, practical and useful applications. However, there are issues that need to be addressed for efficient operation of sensor network systems in real applications. Energy saving is one critical issue for sensor networks since most sensors are equipped with nonrechargeable batteries that have limited lifetime. To extend the lifetime of a sensor network, one common approach is to dynamically schedule sensors' work/ sleep cycles (or duty cycles). Moreover, in cluster-based networks, cluster heads are usually selected in a way that minimizes the total energy consumption and they may rotate among the sensors to balance energy consumption. In general, these energy-efficient scheduling mechanisms (also called topology configuration mechanisms) need to satisfy certain application requirements while saving energy. In this paper, we provide a survey on energy-efficient scheduling mechanisms in sensor networks that have different design requirements than those in traditional wireless networks. We classify these mechanisms based on their design assumptions and design objectives. Different mechanisms may make different assumptions about their sensors including detection model, sensing area, transmission range, failure model, time synchronization, and the ability to obtain location and distance information. They may also have different assumptions about network structure and sensor deployment strategy. Furthermore, while all the mechanisms have a common design objective to maximize network lifetime, they may also have different objectives determined by their target applications.
Guided model checking with a Bayesian meta-heuristic
Authors: Kevin Seppi, Michael Jones, Peter Lamborn
Venue: Fundamenta Informaticae (2005)

This paper presents a meta-heuristic for use in finding errors in models of complex concurrent systems using explicit guided model checking. The meta-heuristic improves explicit guided model checking by applying the empirical Bayes method to revise heuristic estimates of the distance from a given state to an error state. Guided search using the revised estimates finds errors with less search effort than the original estimates.
Mining Maximal Generalized Frequent Geographic Patterns with Knowledge Constraints
Authors: Vania Bogorny, Joao Valiati, Sandro Camargo, Paulo Engel, Bart Kuijpers, Luis O. Alvares
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

In frequent geographic pattern mining a large amount of patterns is well known a priori. This paper presents a novel approach for mining frequent geographic patterns without associations that are previously known as non-interesting. Geographic dependences are eliminated during the frequent set generation using prior knowledge. After the dependence elimination maximal generalized frequent sets are computed to remove redundant frequent sets. Experimental results show a significant reduction of both the number of frequent sets and the computational time for mining maximal frequent geographic patterns.
Are You Sure You Had a Privacy Incident?
Authors: John P. Tomaszewski
Venue: IEEE Security and Privacy (2006)

Whether it's lost laptops, misplaced backup tapes, or data posted to Web sites, data spills have become a fact of life. In the US, state governments and federal agencies have responded with a series of notification rules, which require companies to inform the affected individuals after security incidents. Yet, to determine whether an incident affects individuals' privacy and thus requires notice, organizations must uncover a fairly in-depth set of facts.
Compile-time planning for overhead reduction in software dynamic translators
Authors: Naveen Kumar, Bruce R. Childers, Daniel Williams, Jack W. Davidson, Mary Lou Soffa
Venue: International Journal of Parallel Programming (2005)

Software dynamic translation (SDT) is a technology for modifying programs as they are running. The overhead of monitoring and modifying a running program's instructions is often substantial in SDT systems. As a result, SDT can be impractically slow, especially in SDT systems that do not or can not employ dynamic optimization to offset overhead. This is unfortunate since SDT has many advantages in modern computing environments and interesting uses of SDT continue to emerge. In this paper, we describe techniques to reduce the overhead of SDT. In particular, we present a compile-time planning technique to reduce the overhead due to indirect branch handling. Our results show that this technique is very effective and can improve SDT performance by up to 36%, with an average of 20%.
Analysis of the Centralized Algorithm and the Distributed Algorithm for Parallel Packet Switch
Authors: Yufeng Li, Han Qiu, Julong Lan, Jianwen Yang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Centralized parallel packet switch algorithm and distributed parallel packet switch algorithm are two typical scheduling algorithms for parallel packet switch. This paper analyzes the two algorithms in detail, addresses several key problems in their implementation and finally presents several available methods and suggestions to make the parallel packet switch more practical.
A framework for fault-tolerance in HLA-based distributed simulations
Authors: Martin Eklöf, Farshad Moradi, Rassul Ayani
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The widespread use of simulation in future military systems depends, among others, on the degree of reuse and availability of simulation models. Simulation support in such systems must also cope with failure in software or hardware. Research in fault-tolerant distributed simulation, especially in the context of the High Level Architecture (HLA), has been quite sparse. Nor does the HLA standard itself cover fault-tolerance extensively. This paper describes a framework, named Distributed Resource Management System (DRMS), for robust execution of federations. The implementation of the framework is based on Web Services and Semantic Web technology, and provides fundamental services and a consistent mechanism for description of resources managed by the environment. To evaluate the proposed framework, a federation has been developed that utilizes time-warp mechanism for synchronization. In this paper, we describe our approach to fault tolerance and give an example to illustrate how DRMS behaves when it faces faulty federates.
Accurate Tracking of Monotonically Advancing Fronts
Authors: M. Sabry Hassouna, Aly A. Farag
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton-Jacobi (HJ) equation, known as the Eikonal equation. Although the fast marching method (FMM) is the most stable and consistent method among existing techniques for solving such equation, it suffers from large numerical error along diagonal directions as well as its computational complexity is not optimal. In this paper, we propose an improved version of the FMMthat is both highly accurate and computationally efficient for Cartesian domains. The new method is called the multi-stencils fast marching (MSFM), which computes the solution at each grid point by solving the Eikonal equation along several stencils and then picks the solution that satisfies the fast marching causality relationship. The stencils are centered at each grid point x and cover its entire nearest neighbors. In 2D space, 2 stencils cover the 8-neighbors of x, while in 3D space, 6 stencils cover its 26-neighbors. For those stencils that are not aligned with the natural coordinate system, the Eikonal equation is derived using directional derivatives and then solved using a higher order finite difference scheme.