ppxscal/embedding_network huggingface dataset:
Rate-Distortion Optimized Slicing, Packetization and Coding for Error Resilient Video Transmission
Authors: Enrico Masala, Hua Yang, Kenneth Rose, Juan Carlos De Martin
Venue: Proceedings of the Conference on Data Compression (2004)

This paper presents an algorithm to optimize the tradeoff between rate and expectedend-to-end distortion of a video sequence transmitted over a packet network.The approach optimizes the source coding parameters, slicing, network QoS classselection and/or error control coding parameters, and accounts for the effects of compression,packetization, error propagation, and concealment at the decoder. It buildson, and substantially extends the applicability of, the recursive optimal per-pixel estimate(ROPE) technique for end-to-end distortion estimation. A trellis-based algorithmis introduced in order to overcome macroblock interdependencies in the estimationprocedure, and allow adaptive slicing. Moreover, we propose a complementary packetizationscheme to efficiently arrange the slices into packets for FEC protection whileminimizing rate loss due to padding. Simulations demonstrate consistent gains overcurrently used techniques.
Buddycache: high-performance object storage for collaborative strong-consistency applications in a wan
Authors: Magnus Edvald Bjornsson
Venue:  (2003)

The thesis explores BuddyCache, a novel caching technique to improve the performance of a system in which collaborating clients access shared data in an object repository over a Wide Area Network. We apply the technique to two general classes of fine-grained cache coherence protocols (detection and avoidance-based) and present an analytical model of the performance benefits of the technique. We designed and implemented a BuddyCache prototype with a detection based protocol and validated the model against measurements of the system. The performance results show improvements of up to 60% on typical Internet latencies.
We are not yet there!: in debate with Eevi Beck's 'P for political'
Authors: Yvonne Dittrich
Venue: Scandinavian Journal of Information Systems (2003)

This article argues that Participatory Design and what is outside known as 'Scandinavia Approach' to systems development implies a radical scientific and technology program: a change in the perception and implemetation of technology production and use. This implies not only to develop an understanding of the manifestation of power relations in and throug ICT and software. It also requires new ways of developing and deploying technology. Without methods and processes that are applicable in non-academic contexts, the democratisation of technology remains an unfullfilled claim.
A Methodological Analysis of User Technology Acceptance
Authors: Heshan Sun, Ping Zhang
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

The majority of research on user technology acceptance, e.g. technology acceptance model, focuses on individual users' beliefs, attitudes, and behavioral intentions toward technology use. In this paper, we attempt to examine prior research on user technology acceptance from a methodological angle by borrowing Markus and Robey's research framework (1988). Wefind that prior studies usually take technology imperative perspective, use variance theories, and emphasize the micro level of analysis. Therefore, we propose an "emergent perspective -- process theories -- mixed level of analysis" approach to analyze user technology acceptance. From this perspective, a new model is proposed and several propositions are derived and discussed. This study draws on several prior theories and models, such as the technology acceptance model, computer self-efficacy and the task-technology fit model, but reassembles them in a novel way. The paper concludes with the research and practical implications.
Power management
Authors: Srivatsa Vaddagir, Anand K. Santhanam, Vijay Sukthankar, Murali Iyer
Venue: Linux Journal (2004)

How the kernel makes your laptop battery outlast your next flight.
Poster abstract: online data cleaning in wireless sensor networks
Authors: Eiman Elnahrawy, Badri Nath
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

We present our ongoing work on data quality problems in sensor networks. Specifically, we deal with the problems of outliers, missing information, and noise. We propose an approach for modeling and online learning of spatio-temporal correlations in sensor net-works. We utilize the learned correlations to discover outliers and recover missing information. We also propose a Bayesian approach for reducing the effect of noise on sensor data online.
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks
Authors: Jamil A. Shaikh, Julio Solano, Ivan Stojmenovic, Jie Wu
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In a multi-hop wireless network, each node is able tosend a message to all of its neighbors that are locatedwithin its transmission radius. In a flooding task, a sourcesends the same message to all the network. Routingproblem deals with finding a route between a source anda destination. In the activity-scheduling problem, eachnode decides between active or passive state. We presenta scheme whose goal is to prolong network life whilepreserving connectivity. Each node is either active or hasan active neighbor node. Routing and broadcasting arerestricted to active nodes that create such dominating set.Activity status is periodically updated during a shorttransition period. The main contribution of this article isto propose new metrics for previously studied source - independent localized dominating sets, based on combinations of node degrees and remaining energylevels, for deciding activity status.
Some Domain Patterns in Web Application Framework
Authors: Liu Chao, He Keqing, Liu Jie, Ying Shi
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

In this paper, we first discuss Web Software Engineeringand its biggest problem. Reusing previously developedframeworks and patterns is a good way to resolve this problem.Then we introduce the structure of Web softwareEngineering and Struts Framework. And at last, we discusssome patterns we get from Order-manage System based onStruts Framework.
Improved CBP Neural Network Model with Applications in Time Series Prediction
Authors: Dai Qun, Chen Songcan, Zhang Benzhu
Venue: Neural Processing Letters (2003)

Circular back-propagation neural network (CBP) put forward by Sandro Ridella and Stefano Rovetta, a generalized model of multi-layer perceptron (MLP), possesses strong capabilities of generalization and adaptation to unknown inputs. And they can flexibly construct vector quantization (VQ) and radial basis function (RBF) networks under the CBP framework. With the original structure of CBP remaining unchanged, in this Letter a more generalized network model ICBP (Improved Circular Back-Propagation Neural Network) was designed by adding an extensive node with quadratic form to the original CBP inputs and endowing fixed values to the weights between this node and all the hidden nodes. An interesting property of ICBP is that although it has less adaptable weights, it is better in generalization and adaptability than CBP. Moreover, in order to partially solve the problem of local minima, we adopt the method of adding controlled noise to desired outputs. Finally, ithas been proved by experiments that ICBP is better than CBP in the capabilities of forecasting and function approximation.
Protocol for dynamic ad-hoc networks using distributed spanning trees
Authors: Sridhar Radhakrishnan, Gopal Racherla, Chandra N. Sekharan, Nageswara S. V. Rao, S. G. Batsell
Venue: Wireless Networks (2003)

A dynamic ad-hoc network consists of a collection of mobile hosts with frequently changing network topology. We propose a distributed algorithm that adapts to the topology by utilizing spanning trees in the regions where the topology is stable, and resorting to an intelligent flooding-like approach in highly dynamic regions of the network. Routing is performed using the spanning trees based a hold-and-forward or shuttling mechanisms. We introduce the notion of connectivity-through-time and the parameter holding-time as new fundamental concepts that can be used by ad-hoc routing algorithms. For various network connectivity scenarios we evaluate the impact of these concepts on the performance of ad-hoc routing algorithms. Using simulation, we study the throughput, reachability and message-reachability ratio of the proposed schemes under various connection/disconnection rates and holding times.
A Systematic Methodology to Compute the Architectural Vulnerability Factors for a High-Performance Microprocessor
Authors: Shubhendu S. Mukherjee, Christopher Weaver, Joel Emer, Steven K. Reinhardt, Todd Austin
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Single-event upsets from particle strikes have become akey challenge in microprocessor design. Techniques todeal with these transient faults exist, but come at a cost.Designers clearly require accurate estimates of processorerror rates to make appropriate cost/reliability trade-offs.This paper describes a method for generating theseestimates.A key aspect of this analysis is that some single-bit faults(such as those occurring in the branch predictor) will notproduce an error in a program's output. We define astructure's architectural vulnerability factor (AVF) as theprobability that a fault in that particular structure willresult in an error. A structure's error rate is the product ofits raw error rate, as determined by process and circuittechnology, and the AVF.Unfortunately, computing AVFs of complex structures,such as the instruction queue, can be quite involved. Weidentify numerous cases, such as prefetches, dynamicallydead code, and wrong-path instructions, in which a faultwill not affect correct execution. We instrument a detailedIA64 processor simulator to map bit-level microarchitecturalstate to these cases, generating per-structure AVFestimates. This analysis shows AVFs of 28% and 9% forthe instruction queue and execution units, respectively,averaged across dynamic sections of the entire CPU2000benchmark suite.
Equational properties of mobile ambients
Authors: Andrew D. Gordon, Luca Cardelli
Venue: Mathematical Structures in Computer Science (2003)

The ambient calculus is a process calculus for describing mobile computation. We develop a theory of Morris-style contextual equivalence for proving properties of mobile ambients. We prove a context lemma that allows derivation of contextual equivalences by considering contexts of a particular limited form, rather than all arbitrary contexts. We give an activity lemma that characterises the possible interactions between a process and a context. We prove several examples of contextual equivalence. The proofs depend on characterising reductions in the ambient calculus in terms of a labelled transition system.
Deterministic generators and games for Ltl fragments
Authors: Rajeev Alur, Salvatore La Torre
Venue: ACM Transactions on Computational Logic (TOCL) (2004)

Deciding infinite two-player games on finite graphs with the winning condition specified by a linear temporal logic (Ltl) formula, is known to be 2Exptime-complete. In this paper, we identify Ltl fragments of lower complexity. Solving Ltl games typically involves a doubly exponential translation from Ltl formulas to deterministic &omega;-automata. First, we show that the longest distance (length of the longest simple path) of the generator is also an important parameter, by giving an O(d log n)-space procedure to solve a B&uuml;chi game on a graph with n vertices and longest distance d. Then, for the Ltl fragment of the Boolean combinations of formulas obtained only by eventualities and conjunctions, we provide a translation to deterministic generators of exponential size and linear longest distance, show both of these bounds to be optimal, and prove the corresponding games to be Pspace-complete. Introducing next modalities in this fragment, we give a translation to deterministic generators still of exponential size but also with exponential longest distance, show both of these bounds to be optimal, and prove the corresponding games to be Exptime-complete. For the fragment resulting by further adding disjunctions, we provide a translation to deterministic generators of doubly exponential size and exponential longest distance, show both of these bounds to be optimal, and prove the corresponding games to be Expspace. We also show tightness of the double exponential bound on the size as well as the longest distance for deterministic generators of Ltl formulas without next and until modalities. Finally, we identify a class of deterministic B&uuml;chi automata corresponding to a fragment of Ltl with restricted use of always and until modalities, for which deciding games is Pspace-complete.
Linearisability on datalog programs
Authors: Foto Afrati, Manolis Gergatsoulis, Francesca Toni
Venue: Theoretical Computer Science (2003)

Linear Datalog programs are programs whose clauses have at most one intensional atom in their bodies. We explore syntactic classes of Datalog programs (syntactically non-linear) which turn out to express no more than the queries expressed by linear Datalog programs. In particular, we investigate linearisability of (database queries corresponding to) piecewise linear Datalog programs and chain queries: (a) We prove that piecewise linear Datalog programs can always be transformed into linear Datalog programs, by virtue of a procedure which performs the transformation automatically. The procedure relies upon conventional logic program transformation techniques. (b) We identify a new class of linearisable chain queries, referred to as pseudo-regular, and prove their linearisability constructively, by generating, for any given pseudo-regular chain query, the Datalog program corresponding to it.
A balanced approach to IT project management
Authors: Susan Brock, Danyal Hendricks, Stephen Linnell, Derek Smith
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

This research focuses on existing project management structured methods and practices for improving the design, implementation and success of projects, with a view to uncovering methodologies suited to address the particular needs and problems of IT project management. After identifying the Balanced Scorecard as a possible methodology, the research then develops a management model based on the Project Management Body of Knowledge. A web-based questionnaire, designed to measure the internal management of an IS project, was completed by IS project managers in the Western Cape. The results of this analysis highlighted a positive link between the degree of balance in project management based on the model and the overall level of success.
Pinhole density measurements of barriers deposited on low-k films
Authors: D. Shamiryan, T. Abell, Q. T. Le, K. Maex
Venue: Microelectronic Engineering (2003)

Evaluation of diffusion barrier integrity is an important issue in advanced interconnects. A diffusion barrier separating Cu from low-k must be as thin as possible and must not contain pinholes. We have developed a method for measuring pinhole density in diffusion barriers deposited on low-k materials. The method employs ellipsometric porosimetry for measuring diffusion of toluene in a porous low-k film beneath the barrier in question.
A new approach to scalable Linda-systems based on swarms
Authors: Ronaldo Menezes, Robert Tolksdorf
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Natural forming multi-agent systems (aka Swarms) have the ability to grow to enormous sizes without requiring any of the agents to oversee the entire system. The success of these systems comes from the fact that agents are simple and the interaction with the environment and neighboring agents is local in nature. In this paper we look at abstractions in the field of swarms and study their applicability in the context of coordination systems. In particular, we focus on the problematic issue of scalability of Linda systems.
On Synthesis of Easily Testable (k, K) Circuits
Authors: Srinath R. Naidu, Vijay Chandru
Venue: IEEE Transactions on Computers (2003)

A (k,K) circuit is one which can be decomposed into nonintersecting blocks of gates where each block has no more than K external inputs, such that the graph formed by letting each block be a node and inserting edges between blocks if they share a signal line, is a partial k-tree. (k,K) circuits are special in that they have been shown to be testable in time polynomial in the number of gates in the circuit, and are useful if the constants k and K are small. We demonstrate a procedure to synthesise (k,K) circuits from a special class of Boolean expressions.
Security Analysis of Electronic Business Processes
Authors: Susanne Röhrig, Konstantin Knorr
Venue: Electronic Commerce Research (2004)

This article introduces POSeM, a method that uses business process descriptions to derive appropriate security safeguards. This is achieved by assigning security levels to the components of a business process such as actors, artefacts, and activities with a specially developed description language. These levels are checked for consistency, and security measures are derived using a configurable rule base that maps security objectives to safeguards. POSeM in practice is illustrated by an application to electronic business, i.e., the publication process of information for a company's web-site. Both the advantages of POSeM and its possible refinements are discussed.
A Self-Tuning Cache Architecture for Embedded Systems
Authors: Chuanjun Zhang, Frank Vahid, Roman Lysecky
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Memory accesses can account for about half of a microprocessor system's power consumption. Customizing a microprocessor cache's total size, line size and associativity to a particular program is well known to have tremendous benefits for performance and power. Customizing caches has until recently been restricted to core-based flows, in which a new chip will be fabricated. However, several configurable cache architectures have been proposed recently for use in pre-fabricated microprocessor platforms. Tuning those caches to a program is still however a cumbersome task left for designers, assisted in part by recent computer-aided design (CAD) tuning aids. We propose to move that CAD on-chip, which can greatly increase the acceptance of configurable caches. We introduce on-chip hardware implementing an efficient cache tuning heuristic that can automatically, transparently, and dynamically tune the cache to an executing program. We carefully designed the heuristic to avoid any cache flushing, since flushing is power and performance costly. By simulating numerous Powerstone and MediaBench benchmarks, we show that such a dynamic self-tuning cache can reduce memory-access energy by 45% to 55% on average, and as much as 97%, compared with a four-way set-associative base cache, completely transparently to the programmer.
Recovering a Business Object Model from Web Applications
Authors: Giuseppe Antonio Di Lucca, Anna Rita Fasolino, Porfirio Tramontana, Ugo De Carlini
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

The growing market request for Web Applications is forcingsoftware industries to produce applications under the pressure ofa short time-to-market and a strong competition, with theconsequence that low quality and poor documented software isoften produced. Maintaining, evolving or comprehending theseapplications are not straightforward tasks, and reverseengineering processes should be defined and validated to supportthem.In this paper a reverse engineering approach for reconstructingan object-oriented conceptual model of the application domain ofa Web Application is presented. The proposed approach defines aprocess that reconstructs the model in three steps. In each step,heuristic criteria exploiting source code analysis are used for theidentification of objects and their relationships. Tools forimplementing this method have been produced, and experimentsfor validating it have been carried out with the support of casestudies. Experimental results showed the feasibility and theeffectiveness of the proposed approach.
Understanding captions in biomedical publications
Authors: William W. Cohen, Richard Wang, Robert F. Murphy
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

From the standpoint of the automated extraction of scientific knowledge, an important but little-studied part of scientific publications are the figures and accompanying captions. Captions are dense in information, but also contain many extra-grammatical constructs, making them awkward to process with standard information extraction methods. We propose a scheme for "understanding" captions in biomedical publications by extracting and classifying "image pointers" (references to the accompanying image). We evaluate a number of automated methods for this task, including hand-coded methods, methods based on existing learning techniques, and methods based on novel learning techniques. The best of these methods leads to a usefully accurate tool for caption-understanding, with both recall and precision in excess of 94% on the most important single class in a combined extraction/classification task.
eXFlow: A Web Services-Compliant System to Support B2B Process Integration
Authors: Nathan Chung-Nin Chung, Wen-Shih Huang, Tse-Ming Tsai, Seng-cho T. Chou
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

In the B2Bi scenario, Business Process Management certainly plays an essential role if anenterprise wants to integrate internal existing processes with trading partners' in a manageablemanner. ebXML, RosettaNet, and Web Services are among the emerging standards that will play a key role in the automation of B2Bi from the angles of both business and technology. How would these all be engineered together to bring this B2Bi into reality? A Web Services-compliant eXFlow solution is aimed at providing such an environment. This paper is to give a detailed account of this solution. We further illustrate the concepts behind with a typical B2Bi application scenario.
Mining Relevant Text from Unlabelled Documents
Authors: Daniel Barbará, Carlotta Domeniconi, Ning Kang
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Automatic classification of documents is an importantarea of research with many applications in the fields of documentsearching, forensics and others. Methods to performclassification of text rely on the existence of a sample of documentswhose class labels are known. However, in manysituations, obtaining this sample may not be an easy (oreven possible) task. In this paper we focus on the classificationof unlabelled documents into two classes: relevant andirrelevant, given a topic of interest. By dividing the set ofdocuments into buckets (for instance, answers returned bydifferent search engines), and using association rule miningto find common sets of words among the buckets, we can efficientlyobtain a sample of documents that has a large percentageof relevant ones. This sample can be used to trainmodels to classify the entire set of documents. We prove, viaexperimentation, that our method is capable of filtering relevantdocuments even in adverse conditions where the percentageof irrelevant documents in the buckets is relativelyhigh.