ppxscal/embedding_network huggingface dataset:
Learning Chinese bracketing knowledge based on a bilingual language model
Authors: Yajuan Lü, Sheng Li, Tiejun Zhao, Muyun Yang
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

This paper proposes a new method for automatic acquisition of Chinese bracketing knowledge from English-Chinese sentence-aligned bilingual corpora. Bilingual sentence pairs are first aligned in syntactic structure by combining English parse trees with a statistical bilingual language model. Chinese bracketing knowledge is then extracted automatically. The preliminary experiments show automatically learned knowledge accords well with manually annotated brackets. The proposed method is particularly useful to acquire bracketing knowledge for a less studied language that lacks tools and resources found in a second language more studied. Although this paper discusses experiments with Chinese and English, the method is also applicable to other language pairs.
Physical Rate Based Admission Control for HCCA in IEEE 802.11e WLANs
Authors: Deyun Gao, Jianfei Cai, Liren Zhang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

The IEEE 802.11 working group is currently working on the support of quality of service (QoS) in a new standard called IEEE 802.11e which introduces the so-called hybrid coordination function (HCF). A simple admission control unit has already been developed as a reference for HCF controlled channel access (HCCA) in a recent TGe draft [3]. However, this reference scheme is inefficient because it is implemented based on the minimum physical rate from which the mobile stationsý actual physical rates deviate greatly at most of the time. In this paper, we propose a physical rate based admission control scheme (PRBAC) which enhances the reference scheme by taking account of both the wireless channel characteristics and the stationsý mobility. Numerical analysis and simulation results show the significant improvement of the proposed admission control scheme.
Low-Complexity Distributed Issue Queue
Authors: Jaume Abella, Antonio Gonzalez
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

As technology evolves, power density significantly increases and cooling systems become more complex and expensive. The issue logic is one of the processor hotspots and, at the same time, its latency is crucial for the processor performance. This paper presents a low-complexity FP issue logic (MB_distr) that achieves high performance with small energy requirements. The MB_distr scheme is based on classifying instructions and dispatching them into a set of queues depending on their data dependences. These instructions are selected for issuing based on an estimation of when their operands will be available, so the conventional wakeup activity is not required. Additionally, the functional units are distributed across the different queues. The energy required by the proposed scheme is substantially lower than that required by a conventional issue design, even if the latter has the ability of waking-up only unready operands. MB_distr scheme reduces the energy-delay2 product by 35% and the energy-delay product by 18% with respect to a state-of-the-art approach.
Optimal Oblivious Path Selection on the Mesh
Authors: Costas Busch, Malik Magdon-Ismail, Jing Xi
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent of the traffic distribution. The quality of the paths is determined by the congestion C, the maximum number of paths crossing an edge, and the dilation D, the maximum path length. So far, the oblivious algorithms studied in the literature have focused on minimizing the congestion while ignoring the dilation. An open question is whether C and D can be controled simultaneously. Here, we answer this question for the d-dimensional mesh. We present an online algorithm for which C and D are both within O(d^2 ) of optimal. The algorithm uses randomization, and we show that the number of random bits required per packet is within O(d) of the minimum number of random bits required by any algorithm that obtains near-optimal congestion. For fixed d, our algorithm is asymptotically optimal.
Tool support for just-in-time architecture reconstruction and evaluation: an experience report
Authors: Ian Gorton, Liming Zhu
Venue: Proceedings of the 27th international conference on Software engineering (2005)

The need for software architecture evaluation has drawn considerable attention in recent years. In practice, this is a challenging exercise for two main reasons. First, in deployed projects, software architecture documentation is often not readily available, and may not be a correct representation of the as built architecture. Second, large software systems have numerous potential views of the various architecturally significant structures in the system. In this paper we assess the capabilities of software reverse engineering and architecture reconstruction tools to support just-in-time architecture reconstruction. If an application's architecture can be reconstructed efficiently, this could promote more effective architecture reviews and evaluations. We describe our experiences in leveraging multiple reconstruction tools and how these guided the choice of design artifacts to construct. We discovered that the tools complemented each other in identifying reconstruction scope, critical architectural elements, potential design irregularities and creating useful architectural views for different evaluation tasks. With the help of these tools, the reconstruction and evaluation effort was significantly streamlined and productive. Finally, we also report some potential improvements these tools could make.
Application of fuzzy ARTMAP and fuzzy c-means clustering to pattern classification with incomplete data
Authors: Peng Lim, Ming Kuan, F. Harrison
Venue: Neural Computing and Applications (2005)

In this paper, a hybrid neural network that is capable of incremental learning and classification of patterns with incomplete data is proposed. Fuzzy ARTMAP (FAM) is employed as the constituting network for pattern classification while fuzzy c-means (FCM) clustering is used as the underlying algorithm for processing training as well as test samples with missing features. To handle an incomplete training set, FAM is first trained using complete samples only. Missing features of the training samples are estimated and replaced using two FCM-based strategies. Then, network training is conducted using all the complete and estimated samples. To handle an incomplete test set, a non-substitution FCM-based strategy is employed so that a predicted output can be produced rapidly. The performance of the proposed hybrid network is evaluated using a benchmark problem, and its practical applicability is demonstrated using a medical diagnosis task. The results are compared, analysed and quantified statistically with the bootstrap method. Implications of the proposed network for pattern classification tasks with incomplete data are discussed.
The Thrifty Barrier: Energy-Aware Synchronization in Shared-Memory Multiprocessors
Authors: Jian Li, Jose F. Martinez, Michael C. Huang
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

Much research has been devoted to making microprocessors energy-efficient. However, little attention has been paid to multiprocessor environments where, due to the co-operative nature of the computation, the most energy-efficient execution in each processor may not translate into the most energy-efficient overall execution. We present the thrifty barrier, a hardware-software approach to saving energy in parallel applications that exhibit barrier synchronization imbalance. Threads that arrive early to a thrifty barrier pick among existing low-power processor sleep states based on predicted barrier stall time and other factors. We leverage the coherence protocol and propose small hardware extensions to achieve timely wake-up of these dormant threads, maximizing energy savings while minimizing the impact on performance.
Probabilistically Constrained Linear Programs and Risk-Adjusted Controller Design
Authors: Constantino M. Lagoa, Xiang Li, Mario Sznaier
Venue: SIAM Journal on Optimization (2005)

The focal point of this paper is the probabilistically constrained linear program (PCLP) and how it can be applied to control system design under risk constraints. The PCLP is the counterpart of the classical linear program, where it is assumed that there is random uncertainty in the constraints and, therefore, the deterministic constraints are replaced by probabilistic ones. It is shown that for a wide class of probability density functions, called log-concave symmetric densities, the PCLP is a convex program. An equivalent formulation of the PCLP is also presented which provides insight into numerical implementation. This concept is applied to control system design. It is shown how the results in this paper can be applied to the design of controllers for discrete-time systems to obtain a closed loop system with a well-defined risk of violating the so-called property of superstability. Furthermore, we address the problem of risk-adjusted pole placement.
Combinatorics and algorithms for low-discrepancy, roundings of a real sequence
Authors: Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
Venue: Theoretical Computer Science (2005)

We discuss the problem of computing all the integer sequences obtained by rounding an input sequence of n real numbers such that the discrepancy between the input sequence and each output binary sequence is less than one. The problem arises in the design of digital halftoning methods in computer graphics. We show that the number of such roundings is at most n + 1 if we consider the discrepancy with respect to the set of all subintervals, and give an efficient algorithm to report all of them. Then, we give an optimal method to construct a compact graph to represent the set of global roundings satisfying a weaker discrepancy condition.
Autonomous mobile agent based fair exchange
Authors: Ning Zhang, Qi Shi, Madjid Merabti, Robert Askwith
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

This paper aims to present a novel protocol suited to a new scenario of fair signature exchange in the context of autonomous mobile agent based e/m-commerce applications, to which existing fair exchange protocols do not offer an appropriate solution. The new protocol allows a party to delegate to a mobile agent the power of digitally signing a document on its behalf without disclosing its private key, offers the protection of private information related to an exchange, and provides simple off-line signature recovery with the enforcement of misbehaviour penalisation. The protocol analysis is also carried out to prove its security and fairness.
Vibrotactile Spatial Acuity on the Torso: Effects of Location and Timing Parameters
Authors: Jan B. F. van Erp
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The processing of spatio-temporal vibrotactile patterns by the torso was examined in two experiments. The first investigated the spatial acuity as function of location on the torso. A uniform acuity between 2 and 3 cm was found, except on the body midline where acuity was about 1 cm. This favorable effect was hypothesized to be caused by specific processing characteristics of the central nervous system. The second experiment focussed on the effect of timing parameters in a localization task. The results indicated that localization performance was closely related to both temporal ordering and apparent motion. The results can be used to optimize torso display design and the patterns presented on those displays. Also, they demonstrate that even the most advanced displays have not reached the borders of the processing capacities of the torso.
Non-Cooperation in Competitive P2P Networks
Authors: Beverly Yang, Tyson Condie, Sepandar Kamvar, Hector Garcia-Molina
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Large-scale competitive P2P networks are threatened by the non-cooperation problem,¹ where peers do not forward queries to potential competitors. Non-cooperation will be a growing problem in such applications as pay-per-transaction file-sharing, P2P auctions, and P2P service discovery networks, where peers are in competition with each other to provide services. Here, we show how non-cooperation causes unacceptable degradation in quality of results, and present an economic protocol to address this problem. This protocol, called the RTR protocol, is based on the buying and selling of the right-to-respond (RTR) to each query in the network. Through simulations we show how the RTR protocol not only overcomes non-cooperation by providing proper incentives to peers, but also results in a network that is even more effective and efficient through intelligent, incentive-compatible routing of messages.
Improving user interaction with spoken dialog systems via shaping
Authors: Stefanie Tomko
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Speech-based interfaces offer the promise of simple human-computer communication, yet the current state-of-the-art often produces inefficient interactions. Many inefficiencies are caused by understanding or recognition errors. Such errors can be minimized by designing interaction protocols in which users are required to speak in a standardized way, but this requirement presents additional difficulties: this way of speaking can be unnatural for users, and in order to learn the standardized interface, users must spend time in tutorial mode rather than in task mode. I propose a strategy of shaping that helps users adapt their interaction to match what the system understands best, thereby reducing the chance for misunderstandings and improving interaction efficiency.
Reliability assessment in embryonics inspired by fault-tolerant quantum computation
Authors: Lucian Prodan, Mihai Udrescu, Mircea Vladutiu
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

The Embryonics (embryonic electronics) project aims at implementing Nature's structural redundancy mechanisms in digital electronics in order to attain superior reliability in aggressive, critical environments. It offers a hierarchically reconfigurable framework, whose effectiveness was assessed only for some particular cases [8]. This paper proposes a complete and original approach to the reliability analysis for Embryonics, by adopting the accuracy threshold measure, taken from fault-tolerant quantum computing theory, as the main parameter for our qualitative evaluation. We also start a plea for the concatenated coding technique, which is suitable for the multiple-level organization in Embryonics, and preserves an arbitrary long fault-tolerant computation
Quality of service challenges for wireless mobile ad hoc networks: Research Articles
Authors: Satyabrata Chakrabarti, Amitabh Mishra
Venue: Wireless Communications Mobile Computing (2004)

Wireless mobile ad hoc networks consist of mobile nodes interconnected by wireless multi-hop communication paths. Unlike conventional wireless networks, ad hoc networks have no fixed network infrastructure or administrative support. The topology of such networks changes dynamically as mobile nodes join or depart the network or radio links between nodes become unusable. Supporting appropriate quality of service for mobile ad hoc networks is a complex and difficult issue because of the dynamic nature of the network topology and generally imprecise network state information, and has become an intensely active area of research in the last few years. This paper presents the basic concepts of quality of service support in ad hoc networks for unicast communication, reviews the major areas of current research and results, and addresses some new issues. The principal focus is on routing and security issues associated with quality of service support. The paper concludes with some observations on the open areas for further investigation. Copyright &copy; 2004 John Wiley & Sons, Ltd.This article, except for some minor changes, is essentially the same as one that appears in [103]. The latter is a revised and updated version of [51].
Microbenchmarks for determining branch predictor organization
Authors: Milena Milenkovic, Aleksandar Milenkovic, Jeffrey Kulick
Venue: Software&mdash;Practice Experience (2004)

In order to achieve an optimum performance of a given application on a given computer platform, a program developer or compiler must be aware of computer architecture parameters, including those related to branch predictors. Although dynamic branch predictors are designed with the aim of automatically adapting to changes in branch behavior during program execution, code optimizations based on the information about predictor structure can greatly increase overall program performance. Yet, exact predictor implementations are seldom made public, even though processor manuals provide valuable optimization tips.This paper presents an experimental flow with a series of microbenchmarks that determine the organization and size of a branch predictor using on-chip performance monitoring registers. Such knowledge can be used either for manual code optimization or for design of new, more architecture-aware compilers. Three examples illustrate how insight into exact branch predictor organization can be directly applied to code optimization. The proposed experimental flow is illustrated with microbenchmarks tuned for Intel Pentium III and Pentium 4 processors, although they can easily be adapted for other architectures. The described approach can also be used during processor design for performance evaluation of various branch predictor organizations and for testing and validation during implementation. Copyright &copy; 2004 John Wiley & Sons, Ltd.
R-sequences: Relative indicators for the rhythm of science: Book Reviews
Authors: Liming Liang
Venue: Journal of the American Society for Information Science and Technology (2005)

Like most activities in the world, scientific evolution has its own rhythm. How can this evolutionary rhythm be described and made visible? Do different fields have different rhythms, and how can they be measured? In order to answer these questions a relative indicator, called R-sequence, was designed. This indicator is time dependent, derived from publication and citation data, but independent of the absolute number of publications, as well as the absolute number of citations, and can therefore be used in a comparison of different scientific fields, nations, institutes, or journals. Two calculation methods of the R-sequence&mdash;the triangle method and the parallelogram method&mdash;are introduced. As a case study JASIS(T)'s R-sequence has been obtained. &copy; 2005 Wiley Periodicals, Inc.
Multilevel generalized force-directed method for circuit placement
Authors: Tony Chan, Jason Cong, Kenton Sze
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

Automatic circuit placement has received renewed interest recently given the rapid increase of circuit complexity, increase of interconnect delay, and potential sub-optimality of existing placement algorithms [13]. In this paper we present a generalized force-directed algorithm embedded in mPL2's [12] multilevel framework. Our new algorithm, named mPL5, produces the shortest wirelength among all published placers with very competitive runtime on the IBM circuits used in [29]. The new contributions and enhancements are: (1) We develop a new analytical placement algorithm using a density constrained minimization formulation which can be viewed as a generalization of the force-directed method in [16]; (2) We analyze and identify the advantages of our new algorithm over the force-directed method; (3) We successfully incorporate the generalized force-directed algorithm into a multilevel framework which significantly improves wirelength and speed. Compared to Capo9.0, our algorithm mPL5 produces 8% shorter wirelength and is 2X faster. Compared to Dragon3.01, mPL5 has 3% shorter wirelength and is 12X faster. Compared to Fengshui5.0, it has 5% shorter wirelength and is 2X faster. Compared to the ultra-fast placement algorithm: FastPlace, mPL5 produces 8% shorter wirelength but is 6X slower. A fast mode of mPL5 (mPL5-fast) can produce 1% shorter wirelength than Fast-Place1.0 and is only 2X slower. Moreover, mPL5-fast has demonstrated better scalability than FastPlace1.0.
An Experiment with High Performance Components for Grid Applications
Authors: Massimo Coppola, Marco Pasquali, Luigi Presti, Marco Vanneschi
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

In this paper we describe an experiment in building Grid-aware software components as basic blocks for highperformance, adaptive Grid computations. Within the Grid.it project we are working to the enhancement of the coordination language approach of the ASSIST parallel programming environment to support high-performance software components, that can react to the changes occurring on dynamic execution platforms. We are currently evaluating expressiveness and performance issues also by integrating ASSIST compilation tools with various component frameworks. In the paper we discuss results about a graphical application made up of four CCM components, each one produced by automatic encapsulation of a parallel program. We evaluate performance behaviour by comparing the composite application with the equivalent ASSIST one, on three different testbeds: homogeneous and heterogeneous clusters, and a small Grid over a WAN. We also report first results about an Application Manager component that applies a simple adaptive policy, reacting to pipeline unbalance, to vary the amount of employed computational resources.
Compositional competitiveness for distributed algorithms
Authors: James Aspnes, Orli Waarts
Venue: Journal of Algorithms (2005)

We define a measure of competitive performance for distributed algorithms based on throughput, the number of tasks that an algorithm can carry out in a fixed amount of work. This new measure complements the latency measure of Ajtai et al. [A theory of competitive analysis for distributed algorithms, in: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, IEEE, 1994, pp. 401-411]. which measures how quickly an algorithm can finish tasks that start at specified times. The novel feature of the throughput measure, which distinguishes it from the latency measure, is that it is compositional: it supports a notion of algorithms that are competitive relative to a class of subroutines, with the property that an algorithm that is k-competitive relative to a class of subroutines, combined with an l-competitive member of that class, gives a combined algorithm that is kl-competitive.In particular, we prove the throughput-competitiveness of a class of algorithms for collect operations, in which each of a group of n processes obtains all values stored in an array of n registers. Collects are a fundamental building block of a wide variety of shared-memory distributed algorithms, and we show that several such algorithms are competitive relative to collects. Inserting a competitive collect in these algorithms gives the first examples of competitive distributed algorithms obtained by composition using a general construction.