ppxscal/embedding_network huggingface dataset:
Service Discovery with Higher Order Services in Mobile Hospitals
Authors: Michael Kreutzer, Martin Kahmer, Heiko Falk
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

German Red Cross mobile hospitals must be operational in areas of war or disaster withina few days. In the ARDOR project, we collaborate with the German Red Cross in order toaccelerate the work ows in these hospitals by developing and deploying a con gurationlessdistributed information technology on top of a mobile ad hoc network [Cooperation Agreement of the German Red Cross with the Department of Telematics of the University of Freiburg and Requirements Specification for the Use of Pervasive Computing in Mobile Hospitals]. The main applications are scheduling of resources and their allocation.The computer-supported scheduling must enable the planning sta to query the currently available resources and services and the respective booking information.To achieve this, we introduce service discovery on the middleware layer. However, service discovery has to handle higher order (medical or logistic) services, as an entry in the schedule typically consists of the simultaneous allocation of many resources. Furthermore, service discovery must be scalable as the mobile ad hoc network might be highly dynamic and large in size. This paper claims that our self-organizing and scalable service discovery approach provides a way to enable reliable access to higher order services.
Space- and time-bounded nondeterminism for cellular automata
Authors: Martin Kutrib, Jan-Thomas Löwe
Venue: Fundamenta Informaticae (2003)

Nondeterministic cellular language acceptors are investigated. The nondeterminism is regarded as limited resource. For parallel devices it is natural to bound the nondeterminism in time and/or space. Depending on the length of the input, the number of allowed nondeterministic state transitions as well as the number of nondeterministic cells at all, is limited. For space-bounded nondeterminism it is shown that k + 1 cells are not better than k, in case of one-way information flow. In the two-way case, one cell gains the power of unlimited nondeterminism. For the important real-time one-way arrays the range between deterministic and one guess per cell computations is studied. It is proved that there exists an infinite hierarchy of properly included families. By considering the relations with context-free languages, several relations between the devices in question are implied. Finally, a diagram is presented that summarizes relations between many cellular classes.
The impact of programming styles on debugging efficiency
Authors: Peter R. Newsted, Wing-Keen Leong, Joanna Yeung
Venue: ACM SIGSOFT Software Engineering Notes (1981)

Experimental results are presented indicating that programming techniques with identation, documentation, mnemonic variable names, modular design, as well as external design aids (i.e. structure charts, data flow diagrams, but not flow charts), correlate with fewer errors. Results also indicate that programmers who use these techniques take less time to detect and solve program bugs, suggesting that efficiency is increased.
Predicting the disulfide bonding state of cysteines with combinations of kernel machines
Authors: Alessio Ceroni, Paolo Frasconi, Andrea Passerini, Alessandro Vullo
Venue: Journal of VLSI Signal Processing Systems (2003)

Cysteines may form covalent bonds, known as disulfide bridges, that have an important role in stabilizing the native conformation of proteins. Several methods have been proposed for predicting the bonding state of cysteines, either using local context or using global protein descriptors. In this paper we introduce an SVM based predictor that operates in two stages. The first stage is a multi-class classifier that operates at the protein level, using either standard Gaussian or spectrum kernels. The second stage is a binary classifier that refines the prediction by exploiting local context enriched with evolutionary information in the form of multiple alignment profiles. At both stages, we enriched profile encoding with information about cysteine conservation. The prediction accuracy of the system is 85% measured by 5-fold cross validation, on a set of 716 proteins from the September 2001 PDB Select dataset.
Performance aware tasking for environmentally powered sensor networks
Authors: Aman Kansal, Dunny Potter, Mani B. Srivastava
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

The use of environmental energy is now emerging as a feasible energy source for embedded and wireless computing systems such as sensor networks where manual recharging or replacement of batteries is not practical. However, energy supply from environmental sources is highly variable with time. Further, for a distributed system, the energy available at its various locations will be different. These variations strongly influence the way in which environmental energy is used. We present a harvesting theory for determining performance in such systems. First we present a model for characterizing environmental sources. Second, we state and prove two harvesting theorems that help determine the sustainable performance level from a particular source. This theory leads to practical techniques for scheduling processes in energy harvesting systems. Third, we present our implementation of a real embedded system that runs on solar energy and uses our harvesting techniques. The system adjusts its performance level in response to available resources. Fourth, we propose a localized algorithm for increasing the performance of a distributed system by adapting the process scheduling to the spatio-temporal characteristics of the environmental energy in the distributed system. While our theoretical intuition is based on certain abstractions, all the scheduling methods we present are motivated solely from the experimental behavior and resource constraints of practical sensor networking systems.
A new natural structural congruence in the pi-calculus with replication
Authors: Joost Engelfriet, Tjalling Gelsema
Venue: Acta Informatica (2004)

In the $\pi$-calculus with replication, a new structural congruence called &#x201c;middle&#x201d; congruence is investigated: a notion of structural equivalence of processes in which replication of a process is viewed as a potential rather than an actual infinite number of copies of the process, in the sense that copies are spawned at need rather than produced all at once. It is slightly weaker than standard congruence (which is also of the potential type) but stronger than the extended congruence investigated before by the authors (which is of the actual type). It is shown that middle congruence has the same desirable properties as extended congruence: it is decidable and it has a concrete multiset semantics. Thus, these properties do not depend on the distinction between potential and actual replication.
Welcome
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2004)

Welcome to the third issue of the ACM Computers in Entertainment online magazine!In this exciting issue we present two interviews and eight articles on a diversity of entertainment technology topics including nomadic computing, digital cinema, Internet movie piracy, performing arts, animatronics, robotics, music, games, and interactive television. Enjoy! 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
A Goal-based Approach to Policy Refinement
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

As the interest in using policy-based approaches forsystems management grows, it is becoming increasinglyimportant to develop methods for performing analysisand refinement of policy specifications. Although this isan area that researchers have devoted some attention to,none of the proposed solutions address the issue ofderiving implementable policies from high-level goals. Akey part of the solution to this problem is having theability to identify the operations, available on theunderlying system, which can achieve a given goal.This paper presents an approach by which a formalrepresentation of a system, based on the Event Calculus,can be used in conjunction with abductive reasoningtechniques to derive the sequence of operations that willallow a given system to achieve a desired goal.Additionally it outlines how this technique might be usedfor providing tool support and partial automation forpolicy refinement. Building on previous work on usingformal techniques for policy analysis, the approachpresented here applies a transformation of both policyand system behaviour specifications into a formalnotation that is based on Event Calculus. Finally, itshows how the overall process could be used inconjunction with UML modelling and illustrates this bymeans of an example.
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
Authors: Shie Mannor, John N. Tsitsiklis
Venue: The Journal of Machine Learning Research (2004)

We consider the multi-armed bandit problem under the PAC ("probably approximately correct") model. It was shown by Even-Dar et al. (2002) that given n arms, a total of O((n/&epsilon;2)log(1/&delta;)) trials suffices in order to find an &epsilon;-optimal arm with probability at least 1-&delta;. We establish a matching lower bound on the expected number of trials under any sampling policy. We furthermore generalize the lower bound, and show an explicit dependence on the (unknown) statistics of the arms. We also provide a similar bound within a Bayesian setting. The case where the statistics of the arms are known but the identities of the arms are not, is also discussed. For this case, we provide a lower bound of &Theta;((1/&epsilon;2)(n+log(1/&delta;))) on the expected number of trials, as well as a sampling policy with a matching upper bound. If instead of the expected number of trials, we consider the maximum (over all sample paths) number of trials, we establish a matching upper and lower bound of the form &Theta;((n/&epsilon;2)log(1/&delta;)). Finally, we derive lower bounds on the expected regret, in the spirit of Lai and Robbins.
Some problems concerning the Smarandache square complementary function (I)
Authors: Maohua Le
Venue: Smarandache Notions Journal (2004)

For any positive integer n, let SSC(n) denote the Smarandache square complementary function of n. In this paper we prove that the difference |SSC(n + 1) - SSC(n)| is unbounded.
Energy-Aware Traffic Shaping for Wireless Real-Time Applications
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Sleep modes of wireless network cards are used to switchthese cards into low-power state when idle, but large time-outperiods and frequent wake-ups can reduce the utilityof this approach. Modern processors offer the ability toswitch CPU voltages or clock frequencies and therefore reduceCPU energy consumption, however, that can reducethe sleep durations of a network device, adversely affectingthe achievable energy savings. This paper describes an approachin which multiple resource managers cooperate toreduce a mobile device's energy consumption. This system-levelapproach is based on the integrated management ofa real-time CPU scheduler, the frequency scaling capabilitiesof a modern processor, a QoS packet scheduler, and thelow-power sleep mode of a wireless network card.
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
Authors: Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun
Venue: SIAM Journal on Discrete Mathematics (2005)

Let G be an n-node planar graph. In a visibility representation of G, each node of G is represented by a horizontal line segment such that the line segments representing any two adjacent nodes of G are vertically visible to each other. In the present paper we give the best known compact visibility representation of G. Given a canonical ordering of the triangulated G, our algorithm draws the graph incrementally in a greedy manner. We show that one of three canonical orderings obtained from Schnyder's realizer for the triangulated G yields a visibility representation of G no wider than $\left\lfloor{\frac{22n-40}{15}}\right\rfloor$. Our easy-to-implement O(n)-time algorithm bypasses the complicated subroutines for four-connected components and four-block trees required by the best previously known algorithm of Kant. Our result provides a negative answer to Kant's open question about whether $\left\lfloor{\frac{3n-6}{2}}\right\rfloor$ is a worst-case lower bound on the required width. Also, if G has no degree-three (respectively, degree-five) internal node, then our visibility representation for G is no wider than $\left\lfloor{\frac{4n-9}{3}}\right\rfloor$ (respectively, $\left\lfloor{\frac{4n-7}{3}}\right\rfloor$). Moreover, if G is four-connected, then our visibility representation for G is no wider than n-1, matching the best known result of Kant and He. As a by-product, we give a much simpler proof for a corollary of Wagner's theorem on realizers due to Bonichon, Le Saëc, and Mosbah.
Clustering Large Graphs via the Singular Value Decomposition
Authors: P. Drineas, A. Frieze, R. Kannan, S. Vempala, V. Vinay
Venue: Machine Learning (2004)

We consider the problem of partitioning a set of m points in the n-dimensional Euclidean space into k clusters (usually m and n are variable, while k is fixed), so as to minimize the sum of squared distances between each point and its cluster center. This formulation is usually the objective of the k-means clustering algorithm (Kanungo et al. (2000)). We prove that this problem in NP-hard even for k &equals; 2, and we consider a continuous relaxation of this discrete problem: find the k-dimensional subspace V that minimizes the sum of squared distances to V of the m points. This relaxation can be solved by computing the Singular Value Decomposition (SVD) of the m &times; n matrix A that represents the m points&semi; this solution can be used to get a 2-approximation algorithm for the original problem. We then argue that in fact the relaxation provides a generalized clustering which is useful in its own right.Finally, we show that the SVD of a random submatrix&mdash;chosen according to a suitable probability distribution&mdash;of a given matrix provides an approximation to the SVD of the whole matrix, thus yielding a very fast randomized algorithm. We expect this algorithm to be the main contribution of this paper, since it can be applied to problems of very large size which typically arise in modern applications.
An Agenda- and Justification-Based Framework for Discovery Systems
Authors: R. Livingston, M. Rosenberg, G. Buchanan
Venue: Knowledge and Information Systems (2003)

We propose and evaluate an agenda- and justification-based architecture for discovery systems that selects the next tasks to perform, as well as heuristics for use in discovery systems. This framework has many desirable properties: (1) it selects its own tasks to perform based upon how plausible they are judged to be; (2) it facilitates the encoding of general discovery strategies using a variety of background knowledge; and (3) it tailors its behavior toward a user&#x2019;s interests. Many experiments with a prototype discovery program called HAMB demonstrate that both reasons and estimates of interestingness contribute to performance in the domains of protein crystallization and patient rehabilitation data. The program&#x2019;s heuristics provide good initial solutions to problems encountered when implementing fully autonomous discovery systems.
An intelligent system for customer targeting: a data mining approach
Authors: YongSeog Kim, W. Nick Street
Venue: Decision Support Systems (2004)

We propose a data mining approach for market managers that uses artificial neural networks (ANNs) guided by genetic algorithms (GAs). Our predictive model allows the selection of an optimal target point where expected profit from direct mailing is maximized. Our approach also produces models that are easier to interpret by using a smaller number of predictive features. Through sensitivity analysis, we also show that our chosen model significantly outperforms the baseline algorithms in terms of hit rate and expected net profit on key target points.
Symbolic computation in the homogeneous geometric model with clifford algebra
Authors: Hongbo Li
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

Clifford algebra provides nice algebraic representations for Euclidean geometry via the homogeneous model, and is suitable for doing geometric reasoning through symbolic computation. In this paper, we propose various symbolic computation techniques in Clifford algebra. The content includes representation, elimination, expansion and simplification. Simplification includes contraction, combination and factorization. We apply the techniques to automated geometric deduction, and derive the conclusion in completely factored form in which every factor is a basic invariant. The efficiency of Clifford algebra in doing geometric reasoning is reflected in the short and readable procedure of deriving it sincere geometric factorization.
High-order schemes for Hamilton-Jacobi equations on triangular meshes
Authors: Xiang-Gui Li, C. K. Chan
Venue: Journal of Computational and Applied Mathematics (2004)

In this paper, two weighted essentially nonoscillatory (ENO) schemes are presented on triangular meshes. By combining quadratic polynomials with weights on the ENO stencil, we construct a scheme with second-order accuracy and another scheme with third-order accuracy. Numerical results show the accuracy and stability of the weighted ENO schemes and resolution for discontinuity.
Accurate conjugate gradient methods for families of shifted systems
Authors: Jasper van den Eshof, Gerard L. G. Sleijpen
Venue: Applied Numerical Mathematics (2004)

We consider the solution of the linear system (ATA + σI)Xσ = ATb, for various real values of σ. This family of shifted systems arises, for example, in Tikhonov regularization and computations in lattice quantum chromodynamics. For each single shift σ this system can be solved using the conjugate gradient method for least squares problems (CGLS). In literature various implementations of the, so-called, multishift CGLS methods have been proposed. These methods are mathematically equivalent to applying the CGLS method to each shifted system separately but they solve all systems simultaneously and require only two matrix-vector products (one by A and one by AT) and two inner products per iteration step. Unfortunately, numerical experiments show that, due to roundoff errors, in some cases these implementations of the multishift CGLS method can only attain an accuracy that depends on the square of condition number of the matrix A. In this paper we will argue that, in the multishift CGLS method, the impact on the attainable accuracy of rounding errors in the Lanczos part of the method is independent of the effect of roundoff errors made in the construction of the iterates. By making suitable design choices for both parts, we derive a new (and efficient) implementation that tries to remove the limitation of previous proposals. A partial roundoff error analysis and various numerical experiments show promising results.
A Min-Cost Flow Based Detailed Router for FPGAs
Authors: Seokjin Lee, Yongseok Cheon, Martin D. F. Wong
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Routing for FPGAs has been a very challenging problem dueto the limitation of routing resources. Although the FPGArouting problem has been researched extensively, most algorithms route one net at a time, and it can cause the net-ordering problem.In this paper, we present a detailed routing algorithm forFPGAs based on min-cost flow computations. Using themin-cost flow approach, our algorithm routes all the netsconnected to a common logic module simultaneously. Ateach stage of the network flow computation, we guaranteeoptimal result in terms of routability and delay cost. For further improvement, we adopt an iterative re nement scheme based on the Lagrangian relaxation technique. The Lagrangian relaxation approach transforms the routing problem into a sequence of Lagrangian subproblems. At each iteration of the algorithm, Lagrangian subproblems are solvedby our min-cost flow based routing algorithm. Any violationof congestion constraints is reflected in the value of corresponding Lagrangian multiplier. The Lagrangian multipliers are incorporated into the cost of each routing rosource nodeand guide the router.Because our min-cost flow based algorithm minimizes costfunction while it maximizes the flow, our algorithm findscongestion-free routing solutions with minimum total delay.Comparison with VPR router shows that our router usesless or equal number of routing tracks with smaller criticalpath delay as well as total routing delay.
Prophet/Critic Hybrid Branch Prediction
Authors: Ayose Falcon, Jared Stark, Alex Ramirez, Konrad Lai, Mateo Valero
Venue: ACM SIGARCH Computer Architecture News (2004)

This paper introduces the prophet/critic hybrid conditionalbranch predictor, which has two component predictorsthat play the role of either prophet or critic.Theprophet is a conventional predictor that uses branch historyto predict the direction of the current branch.Further accessesof the prophet yield predictions for the branches followingthe current one.Predictions for the current branchand the ones that follow are collectively known as thebranch's future.They are actually a prophecy, or predictedbranch future.The critic uses both the branch's history andfuture to give a critique of the prophet's prediction fo thecurrent branch.The critique, either agree or disagree, isused to generate the final prediction for the branch.Our results show an 8K + 8K byte prophet/critic hybridhas 39% fewer mispredicts than a 16K byte 2Bc-gskewpredictor-a predictor similar to that of the proposed Compaq*Alpha* EV8 processor-across a wide range of applications.The distance between pipeline flushes due to mispredictsincreases from one flush per 418 micro-operations(uops) to one per 680 uops.For gcc, the percentage of mispredictedbranches drops from 3.11% to 1.23%.On a machinebased on the Intel® Pentium® 4 processor, this improvesuPC (Uops Per Cycle) by 7.8% (18% for gcc) andreduces the number of uops fetched (along both correct andincorrect paths) by 8.6%.
Clock Scheduling and Clocktree Construction for High Performance ASICS
Authors: Stephan Held, Bernhard Korte, Jens Maβberg, Matthias Ringe, Jens Vygen
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In this paper we present a new method for clock schedulingand clocktree construction that improves the performance ofhigh-end ASICs significantly.First, we compute a clock schedule that yields the optimumcycle time and the best possible clock distribution with respectto early and late mode; in particular the number of criticaltests is minimized. Second, individual arrival time intervalsare computed for all endpoints of the clocktree. Finally, weconstruct a clocktree that realizes arrival times within theseintervals and exploits positive slacks to save power consumption.We demonstrate the superiority of our method to previousapproaches by experimental results on industrial ASICs withup to 194 000 registers and more than 160 clock domains. Weimproved the clock frequencies by 5-28% up to 1.033 GHz (in hardware).