ppxscal/embedding_network huggingface dataset:
Sorting by exchanging elements at bounded distance
Authors: Xuerong Feng
Venue:  (2005)

We consider the problem of sorting an arbitrary permutation of length n by exchanging two elements at bounded distance k, this has been called &ldquo;short swap k&rdquo;. If k = 2, we are allowed to exchange two elements that are either adjacent or at distance 2. We show an upper bound of (3/16) n2+ O(n log n) for sorting on a linear permutation, improving the previous (1/4)n 2 upper bound. We also show that there is a short swap 2 sorting network with (1/4)n2+O(n log n) comparators and depth (3/4)n. We generalized the problem by giving an upper bound of (11/90)n2 + O(n log n) for the case k = 3 and an upper bound of (3/(8k))n 2 + O(n log n) for all k > 3, when k is even. We also show a way to build short swap k sorting network with (1/(2k)) n2 + O(n log n) comparators and depth (3/(2k))n. For the problem of sorting on cyclic permutations, we prove an upper bound of (1/4)n2 + O(n) for sorting by exchanging adjacent element. We show an upper bound of (5/32) n2 + O(n log n), a lower bound of (1/4)n2 + O(n) and a 2-approximation algorithm for sorting by short swap 2. Given two binary cyclic strings with equal length n and which have the same number of 1s and 0s, we consider the problem of transforming one into the other in the minimum number of steps by exchanging adjacent elements. We show this problem is polynomial solvable by giving an O(n 2) algorithm.
Computer Memory, Collective Memory: Recovering History through Chilean Computing
Authors: Eden Medina
Venue: IEEE Annals of the History of Computing (2005)

This essay argues that computer histories contribute to collective memory and are especially important in nations where knowledge of the past has been erased or suppressed. Computer histories also can enrich national understandings of the past and contribute to ongoing debates over history and its relation to the present.
ICT Development in North Korea: Changes and Challenges
Authors: Heejin Lee, Jaeho Hwang
Venue: Information Technologies and International Development (2004)

Conditions of ICT development in North Korea are among the least known in the world. This paper relies on interviews, documentary material, and other sources to analyze the potentials of and constraints on North Korea's ICT development. We find substantial interest in ICT diffusion at high levels in the government, which has consistently promoted economically focused ICT programs and projects, while severely constraining political uses of ICT. While North Korea can gain substantial benefits from its proximity to South Korea, nonetheless the future of ICT development in North Korea depends on geopolitical circumstances surrounding the Korean Peninsula.
Presence-Based Availability and P2P Systems
Authors: Richard J. Dunn, John Zahorjan, Steven D. Gribble, Henry M. Levy
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

The availability of a P2P service is a function of the individual peers¿ availabilities, and it is often desirable to estimate how available a particular P2P service will be given the availability of its peers. Prior work in this area has widely used the fraction of time the average peer is available as the basis for this estimate. We show here that this approach has serious drawbacks. We develop a different measure, which we call presence-based availability, which takes into account the availability of the individual peers. Using traces of live P2P systems taken from the literature, we demonstrate that presence-based availability is a more reliable indicator of potential performance than prior methods. We show that our metrics successfully estimate the availability of a P2P file-sharing system. Then, using presence-based measures to make a better estimate of a parameter in a highly-available system, we achieve a 75% decrease in resource usage relative to an existing technique relying on traditional metrics.
Online Documentation and Social Construction
Authors: Edward Barrett
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1993)

Designing and Writing Online Documentation: Help Files to Hypertext by William Horton is a valuable reference guide. This guide addresses designers and writers of various kinds of text that will appear in some fashion and for a variety of reasons on the display monitor of a computer. (The computer might also have a connection to a network.) This books presents the best of current research and commentary by experts from various fields about the subject of online documentation. I assume this is the opinion of all reviewers of this text. What I want to say in this commentary rests upon the assumption that this text belongs on your shelf.
Improved use of the carry-save representation for the synthesis of complex arithmetic circuits
Authors: A. K. Verma, P. Ienne
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

The increasing importance of datapath circuits in complex systems-on-chip calls for special arithmetic optimisations. The goal is to achieve automatically the handcrafted results which escape classic logic optimisations. Some work has been done in the recent years to infer the use of the carry-save representation in the synthesis of arithmetic circuits. Yet, many cases of practical interest cannot be handled due to the scattering of logic operations among the arithmetic ones - especially in arithmetic computations which are originally described at the bit level in high-level languages such as C. We therefore introduce an algorithm to restructure dataflow graphs so that they can be synthesized in high-quality arithmetic circuits, close, to those that an expert designer would conceive. On typical embedded software benchmarks which could be advantageously implemented with hardware accelerators, our technique always reduces tangibly the critical path by up to 46% and generally achieves the quality of manual implementations. In many cases, our algorithm also manages to reduce the cell area by up to 10-20%.
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Authors: Erik D. Demaine, Fedor V. Fomin, Mohammadtaghi Hajiaghayi, Dimitrios M. Thilikos
Venue: Journal of the ACM (JACM) (2005)

We introduce a new framework for designing fixed-parameter algorithms with subexponential running time---2O(&kradic;) nO(1). Our results apply to a broad family of graph problems, called bidimensional problems, which includes many domination and problems such as vertex cover, feedback vertex set, minimum maximal matching, dominating set, edge dominating set, disk dimension, and many others restricted to bounded-genus graphs (phrased as bipartite-graph problem). Furthermore, it is fairly straightforward to prove that a problem is bidimensional. In particular, our framework includes, as special cases, all previously known problems to have such subexponential algorithms. Previously, these algorithms applied to planar graphs, single-crossing-minor-free graphs, and/or map graphs; we extend these results to apply to bounded-genus graphs as well. In a parallel development of combinatorial results, we establish an upper bound on the treewidth (or branchwidth) of a bounded-genus graph that excludes some planar graph H as a minor. This bound depends linearly on the size &brvbar;V(H)&brvbar; of the excluded graph H and the genus g(G) of the graph G, and applies and extends the graph-minors work of Robertson and Seymour.Building on these results, we develop subexponential fixed-parameter algorithms for dominating set, vertex cover, and set cover in any class of graphs excluding a fixed graph H as a minor. In particular, this general category of graphs includes planar graphs, bounded-genus graphs, single-crossing-minor-free graphs, and any class of graphs that is closed under taking minors. Specifically, the running time is 2O(&kracic;) nh, where h is a constant depending only on H, which is polynomial for k &equals; O(log2 n). We introduce a general approach for developing algorithms on H-minor-free graphs, based on structural results about H-minor-free graphs at the heart of Robertson and Seymour's graph-minors work. We believe this approach opens the way to further development on problems in H-minor-free graphs.
Feedback Scheduling for Resource-Constrained Real-time Control Systems
Authors: Pingfang Zhou, Jianying Xie
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Subject to limited computational resource, feedback scheduling aims to improve, or to optimize, the global control performance of real-time control systems. For the system that consists of simple control tasks, a feedback scheduling scheme is presented to shorten tasks' deadlines online as much as possible, so as to reduce jitter and to improve the performance. For the system that consists of complex control tasks, another feedback scheduling scheme is presented to adjust the reserved processor time for each task dynamically, and thus to optimize the performance, if these tasks can be implemented as anytime algorithm. The general feedback scheduling architecture is introduced. The control strategy in both schemes is model predictive control. The designs of feedback controllers are discussed. And the stability conditions are also analyzed.
Using additive expert ensembles to cope with concept drift
Authors: Jeremy Z. Kolter, Marcus A. Maloof
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We consider online learning where the target concept can change over time. Previous work on expert prediction algorithms has bounded the worst-case performance on any subsequence of the training data relative to the performance of the best expert. However, because these "experts" may be difficult to implement, we take a more general approach and bound performance relative to the actual performance of any online learner on this single subsequence. We present the additive expert ensemble algorithm AddExp, a new, general method for using any online learner for drifting concepts. We adapt techniques for analyzing expert prediction algorithms to prove mistake and loss bounds for a discrete and a continuous version of AddExp. Finally, we present pruning methods and empirical results for data sets with concept drift.
On Symplectic and Multisymplectic Schemes for the KdV Equation
Authors: U. M. Ascher, R. I. Mclachlan
Venue: Journal of Scientific Computing (2005)

We examine some symplectic and multisymplectic methods for the notorious Korteweg---de Vries equation, with the question whether the added structure preservation that these methods offer is key in providing high quality schemes for the long time integration of nonlinear, conservative partial differential equations. Concentrating on second order discretizations, several interesting schemes are constructed and studied. Our essential conclusions are that it is possible to design very stable, conservative difference schemes for the nonlinear, conservative KdV equation. Among the best of such schemes are methods which are symplectic or multisymplectic. Semi-explicit, symplectic schemes can be very effective in many situations. Compact box schemes are effective in ensuring that no artificial wiggles appear in the approximate solution. A family of box schemes is constructed, of which the multisymplectic box scheme is a prominent member, which are particularly stable on coarse space---time grids
Accurate autonomous accounting in peer-to-peer Grids
Authors: Robson Santos, Alisson Andrade, Walfredo Cirne, Francisco Brasileiro, Nazareno Andrade
Venue: Proceedings of the 3rd international workshop on Middleware for grid computing (2005)

We here present and evaluate an autonomous accounting scheme that provides accurate results even when the parties (consumer and provider) do not trust each other. Our accounting scheme relies on the observed relative performance among the parties. It is totally autonomous in the sense that it uses only local information, i.e. there is no exchange of information between the parties. This allows for the deployment of the autonomous accounting without requiring any sort of identification infrastructure, such as certificate authorities. The no need of trust or sophisticated infrastructure make our accounting scheme a perfect fit for peer-to-peer grids, which aim to scale much further than traditional grids by allowing free unidentified entry into the grid. Our results show that the proposed scheme performs very close to a perfect accounting scheme whose implementation is infeasible in most systems, including those we target. Although our autonomous accounting scheme was developed to work with OurGrid, it can also be useful for other systems. The basic requirement to use our accounting scheme is that resource consumers must also be resource providers.
Sonar sensor interpretation for ectogeneous robots
Authors: Mark Hinders
Venue:  (2005)

We have developed four generations of sonar scanning systems to automatically interpret surrounding environment. The first two are stationary 3D air-coupled ultrasound scanning systems and the last two are packaged as sensor heads for mobile robots. Template matching analysis is applied to distinguish simple indoor objects. It is conducted by comparing the tested echo with the reference echoes. Important features are then extracted and drawn in the phase plane. The computer then analyzes them and gives the best choices of the tested echoes automatically. For cylindrical objects outside, an algorithm has been presented to distinguish trees from smooth circular poles based on analysis of backscattered sonar echoes. The echo data is acquired by a mobile robot which has a 3D air-coupled ultrasound scanning system packaged as the sensor head. Four major steps are conducted. The final Average Asymmetry-Average Squared Euclidean Distance phase plane is segmented to tell a tree from a pole by the location of the data points for the objects interested. For extended objects outside, we successfully distinguished seven objects in the campus by taking a sequence scans along each object, obtaining the corresponding backscatter vs. scan angle plots, forming deformable template matching, extracting interesting feature vectors and then categorizing them in a hyper-plane. We have also successfully taught the robot to distinguish three pairs of objects outside. Multiple scans are conducted at different distances. A two-step feature extraction is conducted based on the amplitude vs. scan angle plots. The final Slope1 vs. Slope2 phase plane not only separates the rectangular objects from the corresponding cylindrical.
Publish-Subscribe for High-Performance Computing
Authors: Greg Eisenhauer, Karsten Schwan, Fabian Bustamante
Venue: IEEE Internet Computing (2006)

High-performance computing could significantly benefit from publish-subscribe communication, but current systems don't deliver the kind of performance required by applications in that domain. In response to these needs, the authors developed Echo, a high-performance event-delivery middleware designed to scale to the data rates of grid environments. Echo delivers advanced functionality, including event filtering at near network speeds. This article provides an overview of ECho, the infrastructure upon which it is built and the techniques used to implement it.
Towards declarative characterisation and negotiation of bindings
Authors: Øyvind Hanssen
Venue: Proceedings of the 4th workshop on Reflective and adaptive middleware systems (2005)

This paper addresses negotiation of bindings in open systems, and in particular how to characterise the capabilities of heterogeneous platforms, and communication channels. Based on a middleware architecture supporting policy-governed binding, negotiation is about selecting suitable policies for bindings at run-time. We propose a model for declarative expressions based on a hybrid of declared and rule-based conformance, and composition operators. We also propose a scheme for how the middleware can support automatic characterisation of resources or other relevant capabilities and composition of these, based on the declarative expression model.
Individual Recognition Using Gait Energy Image
Authors: Ju Han, Bir Bhanu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

In this paper, we propose a new spatio-temporal gait representation, called Gait Energy Image (GEI), to characterize human walking properties for individual recognition by gait. To address the problem of the lack of training templates, we also propose a novel approach for human recognition by combining statistical gait features from real and synthetic templates. We directly compute the real templates from training silhouette sequences, while we generate the synthetic templates from training sequences by simulating silhouette distortion. We use a statistical approach for learning effective features from real and synthetic templates. We compare the proposed GEI-based gait recognition approach with other gait recognition approaches on USF HumanID Database. Experimental results show that the proposed GEI is an effective and efficient gait representation for individual recognition, and the proposed approach achieves highly competitive performance with respect to the published gait recognition approaches.
Organiza&ccedil;&atilde;o conversacional: inspe&ccedil;&atilde;o das representa&ccedil;&otilde;es na WikiPedia
Authors: Adéle Malta Pontes, Clarisse Sieckenius de Souza, Simone Diniz Junqueira Barbosa
Venue: Proceedings of the 2005 Latin American conference on Human-computer interaction (2005)

Neste trabalho analisamos uma ferramenta do tipo Wiki, chamada WikiPedia. Nesta an&aacute;lise mostramos como os designers desta ferramenta criam seus sistemas de significa&ccedil;&atilde;o e como os usu&aacute;rios apropriam-se deste sistema de signos e criam, a partir das suas interpreta&ccedil;&otilde;es e das restri&ccedil;&otilde;es impostas pelos designers, seus pr&oacute;prios sistemas de significa&ccedil;&atilde;o. O foco da an&aacute;lise recaiu na representa&ccedil;&atilde;o de signos voltados &agrave; caracteriza&ccedil;&atilde;o de uma conversa. Esta caracteriza&ccedil;&atilde;o permitiu, al&eacute;m de um olhar mais especifico em rela&ccedil;&atilde;o aos sistemas de signos da WikiPedia, uma classifica&ccedil;&atilde;o gen&eacute;rica de sistemas de apoio &agrave; participa&ccedil;&atilde;o em discuss&otilde;es (SAPD's).
Modular modeling for planning hospital emergency facilities
Authors: G. Miles Johnson, James A. Winter
Venue: ACM SIGSIM Simulation Digest (1977)

The emergency facility is the entry point for different classifications of patients, various types of treatments are carried out, and some of the patients are hospitalized, although most are treated and sent home.Processing procedures are modeled under specific sets of assumptions to assess relative advantages of alternative design configurations. Parameters such as mean service times and resulting queues are examined and recommendations made. To assist hospital planners without specialized knowledge of simulation techniques, a tutorial account presents how to utilize recently developed modular modeling techniques in terms of model development. A step-by-step discussion details how modular modeling can pinpoint design-induced bottlenecks in planned facilities prior to implementation. Specific attributes modeled are:&bull; Patient arrivals, by classification.&bull; Patient waiting line, due to registration procedures.&bull; Registration procedures (delays).&bull; Patient waiting line, prior to treatment.&bull; Treatment service times.&bull; Total patient transit times.
A Fast Algorithm for the Electromagnetic Scattering from a Large Cavity
Authors: Gang Bao, Weiwei Sun
Venue: SIAM Journal on Scientific Computing (2005)

A fast algorithm is presented for solving electromagnetic scattering from a rectangular open cavity embedded in an infinite ground plane. The medium inside the cavity is assumed to be (vertically) layered. By introducing a transparent (artificial) boundary condition, the problem in the open cavity is reduced to a bounded domain problem. A simple finite difference method is then applied to solve the model Helmholtz equation. The fast algorithm is designed for solving the resulting discrete system in terms of the discrete Fourier transform in the horizontal direction, a Gaussian elimination in the vertical direction, and a preconditioning conjugate gradient method with a complex diagonal preconditioner for the indefinite interface system. The existence and uniqueness of the finite difference solution are established for arbitrary wave numbers. Our numerical experiments for large numbers of mesh points, up to 16 million unknowns, and for large wave numbers, e.g., between 100 and 200 wavelengths, show that the algorithm is extremely efficient. The cost for calculating the radar cross section, which is of significant interest in practice, is O(M2) for an $M \times M$ mesh. The proposed algorithm may be extended easily to solve discrete systems from other discretization methods of the model problem.
Bounded linear regularity of convex sets in Banach spaces and its applications
Authors: Wen Song, Rui. Zang
Venue: Mathematical Programming: Series A and B (2006)

This paper deals with bounded linear regularity, linear regularity and the strong conical hull intersection property (CHIP) of a collection of finitely many closed convex intersecting sets in Banach spaces. It is shown that, as in finite dimensional space setting (see [6]), the standard constraint qualification implies bounded linear regularity, which in turn yields the strong conical hull intersection property, and that the collection of closed convex sets {C1, . . . ,Cn} is bounded linearly regular if and only if the tangent cones of {C1, . . . ,Cn} has the CHIP and the normal cones of {C1, . . . ,Cn} has the property (G)(uniformly on a neighborhood in the intersection C). As applications, we study the global error bounds for systems of linear and convex inequalities.
"Engineering accessible design": W4A -- international crossdisciplinary workshop on web accessibility 2005 workshop report
Authors: Simon Harper, Yeliz Yesilada, Carole Goble
Venue: Issue 83 (September 2005) (2005)

Previous engineering approaches seem to have precluded the engineering of accessible systems. This is plainly unsatisfactory. Designers, authors, and technologist are at present playing 'catch-up' with a continually moving target in an attempt to retrofit systems. Infact engineering accessible interfaces is as important as their functionality's and should be an indivisible part of the development. We should be engineering accessibility as part of the development and not as afterthought or because government restrictions and civil law requires us to. Our workshop brought together a cross section of the Web design and engineering communities; to report on developments, discuss the issues, and suggest cross-pollinated solutions.Conventional workshops on accessibility tended to be single disciplinary in nature. However, we were concerned that a single disciplinary approach prevents the cross-pollination of ideas, needs, and technologies from other related but separate fields. The workshop was therefore, decidedly cross disciplinary in nature and brought together users, accessibility experts, graphic designers, and technologists from academia and industry to discuss how accessibility could be supported. We also encouraged the participation of users and other interested parties as an additional balance to the discussion. Views often bridged academia, commerce, and industry and arguments encompassed a range of beliefs across the design-accessibility spectrum. Our aim was to focus on accessibility by encouraging participation from many disciplines; represented in the following discussion and paper abstracts.