ppxscal/embedding_network huggingface dataset:
Intrusion Tolerance and Anti-Traffic Analysis Strategies For Wireless Sensor Networks
Authors: Jing Deng, Richard Han, Shivakant Mishra
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Wireless sensor networks face acute security concerns inapplications such as battlefield monitoring. A central pointof failure in a sensor network is the base station, which actsas a collection point of sensor data. In this paper, we investigatetwo attacks that can lead to isolation or failure ofthe base station. In one set of attacks, the base station is isolatedby blocking communication between sensor nodes andthe base station, e.g. by DOS attacks. In the second attack,the location of the base station is deduced by analyzing datatraffic towards the base station, which can lead to jammingand/or discovery and destruction of the base station. To defendagainst these attacks, two secure strategies are proposed.First, secure multi-path routing to multiple destinationbase stations is designed to provide intrusion toleranceagainst isolation of a base station. Second, anti-traffic analysisstrategies are proposed to help disguise the location ofthe base station from eavesdroppers. A performance evaluationis provided for a simulated sensor network, as wellas measurements of cryptographic overhead on real sensornodes.
An efficient heuristic for the expansion problem of cellular wireless networks
Authors: Steven Chamberland
Venue: Computers and Operations Research (2004)

In this paper we propose a model for the expansion problem of the network subsystem (NSS) of a universal mobile telecommunication system (UMTS) wireless cellular network considering an update in the base station subsystem (BSS). The objective is to minimize the expansion cost of the network subsystem while considering network performance (e.g., call and handover blocking). Since the network expansion problem is a generalization of the design problem, the proposed model can also be used for designing networks. In order to find good solutions, we propose a heuristic based on the tabu search principle. Finally, we present a performance analysis of the proposed heuristic. The analysis shows that quasi-optimal solutions are found with the proposed heuristic.
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Authors: Luca Becchetti, Stefano Leonardi
Venue: Journal of the ACM (JACM) (2004)

Scheduling a sequence of jobs released over time when the processing time of a job is only known at its completion is a classical problem in CPU scheduling in time sharing operating systems. A widely used measure for the responsiveness of the system is the average flow time of the jobs, that is, the average time spent by jobs in the system between release and completion.The Windows NT and the Unix operating system scheduling policies are based on the Multilevel Feedback algorithm. In this article, we prove that a randomized version of the Multilevel Feedback algorithm is competitive for single and parallel machine systems, in our opinion providing one theoretical validation of the goodness of an idea that has proven effective in practice along the last two decades.The randomized Multilevel Feedback algorithm (RMLF) was first proposed by Kalyanasundaram and Pruhs for a single machine achieving an O(log n log log n) competitive ratio to minimize the average flow time against the on-line adaptive adversary, where n is the number of jobs that are released. We present a version of RMLF working for any number m of parallel machines. We show for RMLF a first O(log n log n/m) competitiveness result against the oblivious adversary on parallel machines. We also show that the same RMLF algorithm surprisingly achieves a tight O(log n) competitive ratio against the oblivious adversary on a single machine, therefore matching the lower bound for this case.
A Geometric Approach to Multi-Criterion Reinforcement Learning
Authors: Shie Mannor, Nahum Shimkin
Venue: The Journal of Machine Learning Research (2004)

We consider the problem of reinforcement learning in a controlled Markov environment with multiple objective functions of the long-term average reward type. The environment is initially unknown, and furthermore may be affected by the actions of other agents, actions that are observed but cannot be predicted beforehand. We capture this situation using a stochastic game model, where the learning agent is facing an adversary whose policy is arbitrary and unknown, and where the reward function is vector-valued. State recurrence conditions are imposed throughout. In our basic problem formulation, a desired target set is specified in the vector reward space, and the objective of the learning agent is to <it>approach</it> the target set, in the sense that the long-term average reward vector will belong to this set. We devise appropriate learning algorithms, that essentially use multiple reinforcement learning algorithms for the standard scalar reward problem, which are combined using the geometric insight from the theory of approachability for vector-valued stochastic games. We then address the more general and optimization-related problem, where a nested class of possible target sets is prescribed, and the goal of the learning agent is to approach the smallest possible target set (which will generally depend on the unknown system parameters). A particular case which falls into this framework is that of stochastic games with average reward constraints, and further specialization provides a reinforcement learning algorithm for constrained Markov decision processes. Some basic examples are provided to illustrate these results.
An experimental debugger in a limited programming environment
Authors: Zen Kishimoto
Venue: ACM SIGPLAN Notices (1983)

This paper describes a debugger feature of a system that supports a limited programming environment for program validation, revalidation and debugging. The debugger in this system is tightly coupled with other tools through a database which is used as a central repository. The execution by this system is based on the hardware independent intermediate codes and, thus, the system has the potential to be multilingual. The debugger supports backward execution, provides both normal and symbolic execution results, and allows source-level debugging.
A Novel Geometric Algorithm for Fast Wire-Optimized Floorplanning
Authors: Peter G. Sassone, Sung K. Lim
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

As the size and complexity of VLSI circuits increase, the needfor faster floorplanning algorithms also grows.In this work weintroduce Traffic, a new method for creating wire- and area-optimizedfloorplans.Through the use of connectivity groupling,simple geometry, and efficient data structures, Traffic achieveshigher result quality than Simulated Annealing (SA) in afraction of the time.This speed allows designers to explore alarge circuit design space in a reasonable amount of time,rapidly evaluate small changes to big circuits, and quicklyproduce initial solutions for other floorplanning algorithms.
Dynamic Platform Management for Configurable Platform-Based System-on-Chips
Authors: Krishna Sekar, Kanishka Lahiri, Sujit Dey
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

General-purpose System-on-Chip platforms consistingof configurable components are emerging as an attractivealternative to traditional, customized solutions (e.g., ASICs,custom SoCs), owing to their flexibility, time-to-market advantage,and low engineering costs. However, the adoptionof such platforms in many high-volume markets (e.g, wirelesshandhelds) is limited by concerns about their performance andenergy-efficiency. This paper addresses the problemof enablingthe use of configurable platforms in domains where custom approacheshave traditionally been used. We introduce DynamicPlatform Management, a methodology for customizing a configurablegeneral-purpose platform at run-time, to help bridgethe performance and energy efficiency gap with custom approaches.The proposed technique uses a software layer that detectstime-varying processing requirements imposed by a set ofapplications, and dynamically optimizes architectural parametersand platform components. Dynamic platform managementenables superior application performance, more efficient utilizationof platform resources, and improved energy efficiency,as compared to a statically optimized platform, without requiringany modifications to the underlying hardware.We illustrate dynamic platform management by applying itto the design of a dual-access UMTS/WLANsecurity processingsystem, implemented on a general-purpose configurable platform.Experiments demonstrate that, compared to a staticallyoptimized design (on the same platform), the proposed techniquesenable upto 33% improvements in security processingthroughput, while achieving 59% savings in energy consumption(on average).
Triana: A Graphical Web Service Composition and Execution Toolkit
Authors: Shalil Majithia, Matthew Shields, Ian Taylor, Ian Wang
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Service composition refers to the aggregation ofservices to build complex applications to achieve clientrequirements. It is an important challenge to make itpossible for users to construct complex workflowstransparently and thereby insulating them from thecomplexity of interacting with numerousheterogeneous services. We present an extension to theTriana PSE to facilitate graphical Web servicediscovery, composition and invocation. Our frameworkhas several novel features which distinguish it fromother work in this area. First, users can graphicallycreate complex service compositions. Second, Trianaallows the user to share the composite service as aBPEL4WS graph or expose it as a service in a one-clickmanner. Third, Triana allows the user to easilycarry out "what-if" analysis by altering existingworkflows. Fourth, Triana allows the user to recordprovenance data for a workflow. Finally, ourframework allows the user to execute the composedgraph on a Grid or P2P network. Triana is a part ofthe GridLab and GridOneD projects and is used in theGEO 600 project.
Squeak in Spain as Part of the LinEx Project
Authors: Diego Gómez Deck, José L. Redrejo Rodriguez
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

Extremadura regional government [1] has startedto use Squeak [2] within the LinEx [3] project.Cooperation from the group Small-Land [4], devotedto spread the use of Squeak in the Spanish-speakingcommunity all over the world, has allowed us to installSqueak in all secondary education classrooms.
Features Extraction Based on Fuzzy Clustering and Segmentation onto the Motion Region for Medium Field Surveillance Application
Authors: Mohamad Nansah Maliki, Syed Abdul Rahman Abu Bakar Al-Attas
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Fuzzy-based clustering algorithm is becoming popular in image processing, especially in image segmentation. Based on the degree of the membership function, each pixel can be grouped into "natural group" of pixels according to the spatial coordinate using their values. In this work we present features extraction based on fuzzy clustering and segmentation onto the motion region for medium field surveillance application. Instead of using blob analysis, we believe that fuzzy based clustering algorithm, can also be used to generate different clusters. Incorporating the motion-based segmentation the complexity of the fuzzy clustering will also be reduced because only the motion region will be processed to the clustering algorithm.
A bi-level Bernoulli scheme for database sampling
Authors: Peter J. Haas, Christian König
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Current database sampling methods give the user insufficient control when processing ISO-style sampling queries. To address this problem, we provide a bi-level Bernoulli sampling scheme that combines the row-level and page-level sampling methods currently used in most commercial systems. By adjusting the parameters of the method, the user can systematically trade off processing speed and statistical precision---the appropriate choice of parameter settings becomes a query optimization problem. We indicate the SQL extensions needed to support bi-level sampling and determine the optimal parameter settings for an important class of sampling queries with explicit time or accuracy constraints. As might be expected, row-level sampling is preferable when data values on each page are homogeneous, whereas page-level sampling should be used when data values on a page vary widely. Perhaps surprisingly, we show that in many cases the optimal sampling policy is of the "bang-bang" type: we identify a "page-heterogeneity index" (PHI) such that optimal sampling is as "row-like" as possible if the PHI is less than 1 and as "page-like" as possible otherwise. The PHI depends upon both the query and the data, and can be estimated by means of a pilot sample. Because pilot sampling can be nontrivial to implement in commercial database systems, we also give a heuristic method for setting the sampling parameters; the method avoids pilot sampling by using a small number of summary statistics that are maintained in the system catalog. Results from over 1100 experiments on 372 real and synthetic data sets show that the heuristic method performs optimally about half of the time, and yields sampling errors within a factor of 2.2 of optimal about 93% of the time. The heuristic method is stable over a wide range of sampling rates and performs best in the most critical cases, where the data is highly clustered or skewed.
Implementation of an MPI-I/O Mechanism Using PVFS in Remote I/O to a PC Cluster
Authors: Yuichi Tsujita
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

A flexible intermediate library named Stampi realizes seamless MPI operations on a heterogeneous computing environment. With the help of a flexible communication mechanism of this library, users can execute MPI functions without awareness of underlying communication mechanism. Although Stampi supports MPI-I/O among different platforms, UNIX I/O functions are used when a vendor-supplied MPI-I/O library is not available. To realize distributed I/O operations, a Parallel Virtual File System (PVFS) has been implemented in the MPI-I/O mechanism. Primitive MPI-I/O functions of Stampi have been evaluated and sufficient performance has been achieved.
Theory and applications of inverting functions as folds
Authors: Shin-Cheng Mu, Richard Bird
Venue: Science of Computer Programming (2004)

This paper is devoted to the proof, applications, and generalisation of a theorem, due to Bird and de Moor, that gave conditions under which a total function can be expressed as a relational fold. The theorem is illustrated with three problems, all dealing with constructing trees with various properties. It is then generalised to give conditions under which the inverse of a partial function can be expressed as a relational hylomorphism. Its proof makes use of Doornbos and Backhouse's theory on well-foundedness and reductivity. Possible applications of the generalised theorem is discussed.
A Capacity Sizing Tool for a Business Process Integration Middleware
Authors: Te-Kai Liu, Hui Shen, Santhosh Kumaran
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Capacity sizing of business process integration (BPI) solutions deals with finding the lowest cost hardware configuration that can satisfy the performance requirements of a BPI solution being planned. Accurate sizing can help control the cost of a proposed BPI project while minimizing the risk of deploying a solution that will fail to meet the performance requirements later on. This paper proposes a model driven approach for predicting the performance of BPI solutions. The approach separates the application and middleware aspects of BPI solutions, and thus allows users to predict the performance of different BPI applications deployed on the same middleware. Using this approach, a sizing tool prototype for the Websphere InterChange Server is developed. Preliminary evaluation shows that the tool is able to recommend the hardware configuration with minimum cost while satisfying the performance objective of the applications. As a by-product, the sizes of the various thread pools of the middleware are also recommended by the sizing tool.
Automated System Design for Availability
Authors: G. (John) Janakiraman, Jose Renato Santos, Yoshio Turner
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Large-scale systems experience frequent failures whichcan result in unacceptably high service downtime or applicationexecution time. To meet performance and availabilityrequirements, the user must perform a complex design task includingthe selection and configuration of hardware and softwarecomponents and mechanisms for handling failures. Webelieve users should be relieved of this burden by automatingthe design process in order to generate cost-effective solutionsfrom high-level application requirements. In this paper,we present Aved, a proof of concept design automation enginewhich is a first step toward this goal. We describe how infrastructurechoices, application models, and user requirementsare represented with Aved to automate design space searchand reason about design alternatives. We additionally presentexamples to illustrate how Aved can generate a complete pictureof the cost-availability and cost-performance tradeoffsfor the infrastructure design.
Edge-Valued Decision Diagrams for Multiple-Valued Functions
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

In this paper, we provide a brief review of various decisiondiagrams (DDs) with attributed edges, and then wepropose a method for construction of various edge-valueddiagrams for multiple-valued logic functions. We considerconstruction of both edge-valued diagrams with the additiveand the multiplicative attributes at the edges. We illustratethe application of related algorithms by constructing examplesof decision diagrams for quaternary functions.
Surface Denoising Using a Tight Frame
Authors: I. A. Kakadiaris, L. Shen, M. Papadakis, I. Konstantinidis, D. Kouri, D. Hoffman
Venue: Proceedings of the Computer Graphics International (2004)

In this paper, we propose a new method to denoise a surface.This method is motivated by the Laplacian flow and thetheory of tight frames. Mesh denoising is achieved by buildinglocal Wiener filtering into the detail representation ofthe surface. We have performed a number of experiments toassess the accuracy, advantages and limitations of our approachwith very encouraging results.
Depicting Shape Features with Directional Strokes and Spotlighting
Authors: Mario Costa Sousa, Faramarz Samavati, Meru Brunn
Venue: Proceedings of the Computer Graphics International (2004)

This paper presents a new algorithm and technique forrendering triangular surfaces in pen-and-ink edge-basedstrokes. Our technique integrates two very important illustrationstrategies for depicting shape features: selectionof drawing direction and the use of light. Drawing directionis given by four stroke directional fields. For lighting,we introduce the idea of "spotlight silhouettes" forfast illumination computation, with target tone matched byadaptive stroke length adjustment. Stroke style is achievedby path perturbation and noise-based weight control. Ourtechnique also allows visual effects of reverse tone valuesand depth cueing. Examples with models from anatomy andarcheology demonstrate the capabilities of our system.
Graph Connectivity After Path Removal
Authors: Guantao Chen, J. Gould, Xingxing Yu
Venue: Combinatorica (2003)

Let G be a graph and u, v be two distinct vertices of G. A u&#x2014;v path P is called nonseparating if G&#x2014;V(P) is connected. The purpose of this paper is to study the number of nonseparating u&#x2014;v path for two arbitrary vertices u and v of a given graph. For a positive integer k, we will show that there is a minimum integer &#x03b1;(k) so that if G is an &#x03b1;(k)-connected graph and u and v are two arbitrary vertices in G, then there exist k vertex disjoint paths P1[u,v], P2[u,v], . . ., Pk[u,v], such that G&#x2014;V (Pi[u,v]) is connected for every i (i = 1, 2, ..., k). In fact, we will prove that &#x03b1;(k) &#x2264; 22k+2. It is known that &#x03b1;(1) = 3.. A result of Tutte showed that &#x03b1;(2) = 3. We show that &#x03b1;(3) = 6. In addition, we prove that if G is a 5-connected graph, then for every pair of vertices u and v there exists a path P[u, v] such that G&#x2014;V(P[u, v]) is 2-connected.
The potential in energy efficiency of a speculative chip-multiprocessor
Authors: Yuu Tanaka, Toshinori Sato, Takenori Koushiro
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

While lower supply voltage is effective for energy reduction, it suffers performance loss. To mitigate the loss, we propose to execute only the part, which does not have any influence on execution speed, with low-speed and low-voltage. We are investigating a multithreaded execution, named Contrail Architecture, which divides an instruction stream into two streams using trace-level value prediction. One is the speculation stream, which is the main part of a program and is applied value predictions. The other is the verification stream, which verifies the predictions. The energy consumption is reduced by the decrease in the execution time in the speculation stream and by the low-speed execution in the verification stream. This paper evaluates its potential in energy efficiency.
Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
Authors: Darinka Dentcheva, Andrzej Ruszczy&#x0144;ski
Venue: Mathematical Programming: Series A and B (2004)

We consider a new class of optimization problems involving stochastic dominance constraints of second order. We develop a new splitting approach to these models, optimality conditions and duality theory. These results are used to construct special decomposition methods.
Introduction to the IBM 3800 printing subsystem models 3 and 8
Authors: Robert C. Miller,  Jr.
Venue: IBM Journal of Research and Development (1984)

The IBM 3800 Printing Subsystem Models 3 and 8 are high-speed, non-impact, electrophotographic printers which are designed for system printing, text, and graphics applications requiring flexibility and high print quality. Features such as their print density of 240 × 240 pels/in2, and all-point addressability extend substantially their printing capabilities beyond those of the Models 1 and 2.
Intensional theory of granular computing
Authors: V. Nov&#x00e1;k
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

This paper presents a new idea how the concept of granule can be modeled in formal fuzzy logic. The basic mathematical theory is fuzzy logic in narrow sense with evaluated syntax, which is based on &#x0141;ukasiewicz algebra of truth values extended by the product. We have introduced the concepts of intension and extension of granules, internal and external operations on them, various kinds of relations, motion of granules, and others. The paper also outlines construction of some important examples of granules. At its end, we also introduce a more complex concept of association, which is formed of granules of various kinds.