ppxscal/embedding_network huggingface dataset:
A Way to Boost the Data Transfer Speed in Control and Information Systems
Authors: Ondrej Krejcar
Venue: Proceedings of the Third International Conference on Systems (2008)

Mobile computing devices and local-area wireless networks fostered a growing interest in location-aware systems and services. Main area of interest is in model of radio-frequency based system enhancement for locating and tracking users of our control system inside buildings. The developed framework described here joins the concepts of location and user tracking as an extension for new control system. The experimental framework prototype uses a WiFi network infrastructure to let a mobile device determine its indoor position. User location is used to data pre-buffering and pushing information from server to user’s PDA. All the server data are saved as artefacts with their position info in building.
Next-generation access networks: A preview
Authors: Marcus K. Weldon, Thierry van Landegem, Edward S. Szurkowski
Venue: Bell Labs Technical Journal (2008)

As we enter 2008, fixed line access networks are in a full state of flux or &ldquo;transformation,&rdquo; across many dimensions. For example, central office asymmetric digital subscriber line 2 (ADSL2)-centric copper networks are rapidly evolving to remote node-based very high speed digital subscriber line 2 (VDSL2)-based deployments as well as to direct fiber to the home (FTTH) networks, with an accompanying shift from asynchronous transfer mode (ATM)-based to native Ethernet-based transport. Coupled to these shifts is a manifest evolution in the services being provided, with voice service evolving from circuit-switched plain old telephone service (POTS) to consumer Voice over Internet Protocol (VoIP), data services evolving from highly asymmetric bandwidth services with downstream data rates of a few megabits per second to more symmetric bandwidth with 30 Mbps to 100 Mbps data rates, and a full array of video services supported. Furthermore, there is an increasing expectation on the part of the end user that these services will be easily accessible on any device, on any network, at any time, with a guaranteed quality of experience (QoE). In addition to a further evolution in the network infrastructure, these extended requirements give rise to the need for a next generation of network and service management, with dynamic management of the access network resources, sophisticated service-level diagnostics, as well as management of the network inside the home. This issue of the Bell Labs Technical Journal is dedicated to a discussion of these topics and the requirements they put on the access network in the near and long term. &copy; 2008 Alcatel-Lucent.
Fault-Tolerant Design of the IBM Power6 Microprocessor
Authors: Kevin Reick, Pia N. Sanda, Scott Swaney, Jeffrey W. Kellington, Michael Mack, Michael Floyd, Daniel Henderson
Venue: IEEE Micro (2008)

The IBM Power6 microprocessor extends the capabilities of the Power5, dramatically increasing its ability to recover from hard and soft errors without increasing system downtime. The Power6 adds new mainframe-like features for enhanced reliability, availability, and serviceability, including instruction retry and processor failover. Optimized for performance and power, the Power6 implements these RAS enhancements without compromising ultrahigh-frequency operation.
Tree Process Calculus
Authors: Mingren Chai, Nan Qu, Ying Jiang
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

We extend Robin Milner's sequential process calculus to tree process calculus in a way similar to that tree automata extend word automata. By this way, we establish a sound and complete inference system which describes the equivalence via bisimulation over tree processes. As a corollary, we obtain a new equivalence relation between tree automata, which is strictly finer than the classical equivalence over tree automata, and is strictly coarser than the equivalence relation via bisimulation defined in [Abdulla P.-A., L. Kaati, and J, Hogberg, Bisimulation Minimization of Tree Automata, CIAA (2006), 171-185.].
Model Selection Through Sparse Maximum Likelihood Estimation for Multivariate Gaussian or Binary Data
Authors: Onureena Banerjee, Laurent El Ghaoui, Alexandre d'Aspremont
Venue: The Journal of Machine Learning Research (2008)

We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to solve a maximum likelihood problem with an added l1-norm penalty term. The problem as formulated is convex but the memory requirements and complexity of existing interior point methods are prohibitive for problems with more than tens of nodes. We present two new algorithms for solving problems with at least a thousand nodes in the Gaussian case. Our first algorithm uses block coordinate descent, and can be interpreted as recursive l1-norm penalized regression. Our second algorithm, based on Nesterov's first order method, yields a complexity estimate with a better dependence on problem size than existing interior point methods. Using a log determinant relaxation of the log partition function (Wainwright and Jordan, 2006), we show that these same algorithms can be used to solve an approximate sparse maximum likelihood problem for the binary case. We test our algorithms on synthetic data, as well as on gene expression and senate voting records data.
A multi-objective nonlinear optimization approach to designing effective air quality control policies
Authors: Claudio Carnevale, Enrico Pisoni, Marialuisa Volta
Venue: Automatica (Journal of IFAC) (2008)

This paper presents the implementation of a two-objective optimization methodology to select effective tropospheric ozone pollution control strategies on a mesoscale domain. The objectives considered are (a) the emission reduction cost and (b) the Air Quality Index. The control variables are the precursor emission reductions due to available technologies. The nonlinear relationship linking air quality objective and precursor emissions is described by artificial neural networks, identified by processing deterministic Chemical Transport Modeling system simulations. Pareto optimal solutions are calculated with the Weighted Sum Strategy. The two-objective problem has been applied to a complex domain in Northern Italy, including the Milan metropolitan area, a region characterized by frequent and persistent ozone episodes.
Representation and Reasoning on ORBAC: Description Logic with Defaults and Exceptions Approach
Authors: Narhimene Boustia, Aicha Mokhtari
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In the Organization Based Access Control (ORBAC) model, to express security policy, it is necessary to make possible the system know which are the privileges of each user. The definition of permission should not be static, but it must depend on the requirement of the system, rules should be dynamic, depending on the context. Context is used to specify the concrete circumstances where user is given role permissions to perform activities on views. Formalization of ORBAC in a logical approach makes it feasible to reason about a specified policy and verifies its correctness. We propose a formal modelisation of ORBAC by the description logic language with default and exception ALde. We show how exception in information system security can be captured by ALde. We illustrate this approach by an example of a medical information system.
Discovering Multi-dimensional Major Medicines from Traditional Chinese Medicine Prescriptions
Authors: Chuan Li, Changjie Tang, Chunqiu Zeng, Jiang Wu, Yu Chen, Jiangtao Qiu, Li Dai, Jun Zhu, Yongguang Jiang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Multi-dimensional major medicines analysis is one of the most important tasks in the data analysis of Traditional Chinese Medicine (TCM) prescriptions. In this paper, an effective method is proposed to minemulti-dimensional major medicines from TCM prescriptions. The main contributions include: (1) proposing the concept of multi-dimensional major medicines, (2) borrowing the concept of multidimensional frequent patterns and improving the approach of Multi-dimensional Index Tree, (3 )applying it in the TCM major medicines mining, (4) implementing the algorithms in the major medicines discovery module of TCMiner 1.0. (5) Extensive experiments show the effectiveness and efficiency of the proposed approach.
A methodology to design arbitrary failure detectors for distributed protocols
Authors: Roberto Baldoni, Jean-Michel Hélary, Sara Tucci Piergiovanni
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

Nowadays, there are many protocols able to cope with process crashes, but, unfortunately, a process crash represents only a particular faulty behavior. Handling tougher failures (e.g. sending omission failures, receive omission failures, arbitrary failures) is a real practical challenge due to malicious attacks or unexpected software errors. This is usually achieved either by changing, in an ad hoc manner, the code of a crash resilient protocol or by devising a new protocol from scratch. This paper proposes an alternative methodology to detect processes experiencing arbitrary failures. On this basis, it introduces the notions of liveness failure detector and safety failure detector as two independent software components. With this approach, the nature of failures experienced by processes becomes transparent to the protocol using the components. This methodology brings a few advantages: it makes possible to increase the resilience of a protocol designed in a crash failure context without changing its code by concentrating only on the design of a few well-specified components, and second, it clearly separates the task of designing the protocol from the task of detecting faulty processes, a methodological improvement. Finally, the feasibility of this approach is shown, by providing an implementation of liveness failure detectors and of safety failure detectors for two protocols: one solving the consensus, and the second solving the problem of global data computation.
Intelligent sticky notes that can be searched, located and can send reminders and messages
Authors: Pranav Mistry, Pattie Maes
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

We present 'Quickies: Intelligent Sticky Notes', an attempt to bring one of the most useful inventions of the 20th century into the digital age: the ubiquitous sticky notes. Sticky notes help us manage our-to-do lists, tag our objects and documents and capture short reminders or information that we may need in the near future. 'Quickies' enrich the experience of using sticky notes by allowing them to be tracked and managed more effectively. Quickies are stickies that have intelligence and the ability to remind us about the task we ought to perform or to provide us at the right time with the information we captured in the past. The project explores how the use of Artificial Intelligence, RFID, and ink recognition technologies can make it possible to create intelligent sticky notes that can be searched, located, can send reminders and messages, and more broadly, can help us to seamlessly connect our physical and digital experiences.
Modeling in software engineering
Authors: Joanne M. Atlee, Robert France, Geri Georg, Ana Moreira, Bernhard Rumpe, Steven Völkel, Steffen Zschaler
Venue: Companion of the 30th international conference on Software engineering (2008)

The Modeling in Software Engineering (MiSE) workshops are a collaboration between the ICSE and MoDELS research communities, with a focus on using models to facilitate software development.
Enacting responsibility assignment in software development environments
Authors: Avi Yaeli, Tim Klinger
Venue: Proceedings of the 1st international workshop on Software development governance (2008)

In this paper we present the concept of responsibility assignment and its use as a governance mechanism in a software development environment. We review common representations of responsibility assignments, their relationship to the operational model of software engineering and the semantics required to automate their enactment in development tools. We also present a vision for enactment scenarios in tools and compare with the process extensibility mechanisms currently implemented in the Jazz Team Platform.
Rateless Deluge: Over-the-Air Programming of Wireless Sensor Networks Using Random Linear Codes
Authors: Andrew Hagedorn, David Starobinski, Ari Trachtenberg
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Over-the-air programming (OAP) is a fundamental service in sensor networksthat relies upon reliable broadcast for efficient dissemination. As such,existing OAP protocols become decidedly inefficient (with respect toenergy, communication or delay) in unreliable broadcast environments, suchas those with relatively high node density or noise. In this paper, weconsider OAP approaches based on rateless codes, which significantlyimprove OAP in such environments by drastically reducing the need forpacket rebroadcasting. We thus design and implement two rateless OAPprotocols, rateless Deluge and ACKless Deluge, both of which replace the datatransfer mechanism of the established OAP Deluge protocol with ratelessanalogs. Experiments with Tmote Sky motes on single-hop networks withpacket loss rates of 7\% show these protocols to save significantly incommunication over regular Deluge (roughly 15-30\% savings in the dataplane, and 50-80\% in the control plane), and multi-hop experimentsreveal similar trends. Simulations further shows that our newprotocols scale better than standard Deluge (in terms of communication and energy) tohigh network density. TinyOS code for our implementation can be found at http://nislab.bu.edu.
Type-preserving compilation for large-scale optimizing object-oriented compilers
Authors: Juan Chen, Chris Hawblitzel, Frances Perry, Mike Emmi, Jeremy Condit, Derrick Coetzee, Polyvios Pratikaki
Venue: ACM SIGPLAN Notices (2008)

Type-preserving compilers translate well-typed source code, such as Java or C#, into verifiable target code, such as typed assembly language or proof-carrying code. This paper presents the implementation of type-preserving compilation in a complex, large-scale optimizing compiler. Compared to prior work, this implementation supports extensive optimizations, and it verifies a large portion of the interface between the compiler and the runtime system. This paper demonstrates the practicality of type-preserving compilation in complex optimizing compilers: the generated typed assembly language is only 2.3% slower than the base compiler's generated untyped assembly language, and the type-preserving compiler is 82.8% slower than the base compiler.
An experimental study of sorting and branch prediction
Authors: Paul Biggar, Nicholas Nash, Kevin Williams, David Gregg
Venue: Journal of Experimental Algorithmics (JEA) (2008)

Sorting is one of the most important and well-studied problems in computer science. Many good algorithms are known which offer various trade-offs in efficiency, simplicity, memory use, and other factors. However, these algorithms do not take into account features of modern computer architectures that significantly influence performance. Caches and branch predictors are two such features and, while there has been a significant amount of research into the cache performance of general purpose sorting algorithms, there has been little research on their branch prediction properties. In this paper, we empirically examine the behavior of the branches in all the most common sorting algorithms. We also consider the interaction of cache optimization on the predictability of the branches in these algorithms. We find insertion sort to have the fewest branch mispredictions of any comparison-based sorting algorithm, that bubble and shaker sort operate in a fashion that makes their branches highly unpredictable, that the unpredictability of shellsort's branches improves its caching behavior, and that several cache optimizations have little effect on mergesort's branch mispredictions. We find also that optimizations to quicksort, for example the choice of pivot, have a strong influence on the predictability of its branches. We point out a simple way of removing branch instructions from a classic heapsort implementation and also show that unrolling a loop in a cache-optimized heapsort implementation improves the predicitability of its branches. Finally, we note that when sorting random data two-level adaptive branch predictors are usually no better than simpler bimodal predictors. This is despite the fact that two-level adaptive predictors are almost always superior to bimodal predictors, in general.
Halfspace Matrices
Authors: Alexander A. Sherstov
Venue: Computational Complexity (2008)

We introduce the notion of a halfspace matrix, which is a sign matrix A with rows indexed by linear threshold functions f, columns indexed by inputs x ¿ {¿ 1, 1} n , and the entries given by A f,x = f(x). We use halfspace matrices to solve the following problems.In communication complexity, we exhibit a Boolean function f with discrepancy ¿(1/n 4) under every product distribution but $$O(\sqrt{n}/2^{n/4})$$ under a certain non-product distribution. This partially solves an open problem of Kushilevitz and Nisan (1997).In learning theory, we give a short and simple proof that the statisticalquery (SQ) dimension of halfspaces in n dimensions is less than 2 $$(n + 1)^2$$ under all distributions. This improves on the $$n^{O(1)}$$ estimate from the fundamental paper of Blum et al. (1998). We show that estimating the SQ dimension of natural classes of Boolean functions can resolve major open problems in complexity theory, such as separating PSPACE $$^{cc}$$ and PH $$^{cc}$$ .Finally, we construct a matrix $$A \in \{-1, 1\}^{N \times N^{\text{log} N}}$$ with dimension complexity logN but margin complexity $$\Omega(N^{1/4}/\sqrt{\log N})$$ . This gap is an exponential improvement over previous work. We prove several other relationships among the complexity measures of sign matrices, omplementing work by Linial et al. (2006, 2007).
On the use of the consistent splitting scheme for double-diffusive convection flows in mixed finite element formulations
Authors: J. C. -F. Wong
Venue: International Journal of Computer Mathematics (2007)

This paper describes the so-called consistent splitting scheme (CSS) for solving unsteady double-diffusive convection (DDC) problems using the mixed finite element method. The CSS was chosen to numerically solve the primitive form of the unsteady governing equations for decoupling the velocity variables and the pressure. Both first-and second-order accurate temporal and spatial approximations have been implemented for unsteady DDC problems. The results obtained with the described numerical methods compare favourably with the existing numerical result.
Applying abstraction to master complexity
Authors: Jonathan H. Hill, Bernice J. Houle, Susan M. Merritt, Allen Stix
Venue: Proceedings of the 2nd international workshop on The role of abstraction in software engineering (2008)

Aptitude for managing abstraction may be a distinguishing characteristic of computer science majors. If this is so, and if this aptitude can be recognized among potential majors, those who are well suited for computer science but have not considered it as a major can be made aware of the possibility. Abstraction, as a human ability, is comprised of two complementary aspects: clearing away details to build simplifications and deriving generalizations that illuminate essentials. Agreement exists that this ability may be nurtured through instruction and experience, but that it rests upon a natural aptitude that is possessed by few. Agreement exists that this natural aptitude is assessable, although no instrument yet exists for measuring it efficiently among prospective computer science majors who have not begun computer science coursework. This paper deals with a study done at New York's Pace University to test undergraduate students across a range of majors for abstraction ability
Implications of autonomy for the expressiveness of policy routing
Authors: Nick Feamster, Ramesh Johari, Hari Balakrishnan
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain routing system enables each AS to express policy using rankings that determine how each router in the AS chooses among different routes to a destination, and filters that determine which routes are hidden from each neighboring AS. Because the Internet is composed of many independent, competing networks, the interdomain routing system should provide autonomy, allowing network operators to set their rankings independently, and to have no constraints on allowed filters. This paper studies routing protocol stability under these conditions. We first demonstrate that "next-hop rankings," commonly used in practice, may not ensure routing stability. We then prove that, when providers can set rankings and filters autonomously, guaranteeing that the routing system will converge to a stable path assignment imposes strong restrictions on the rankings ASes are allowed to choose. We discuss the implications of these results for the future of interdomain routing.
An Investigation of Distance-Based Proxy Mobile Client Selection Schemes for NetLMM
Authors: Jong-Hyouk Lee, Yeong-Deok Kim, Tai-Myoung Chung
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

One of recent efforts for mobile computing in IETF is a network-based localized mobility management (NetLMM) approach. In the NetLMM approach, Proxy Mobile IPv6 (PMIPv6) is one of proposed solutions to support a localized mobility management for a mobile node (MN). In PMIPv6, a PMIP client is a main entity responsible for sending messages on behalf of an MN whenever the MN hands off across access points (APs) within a local mobility domain (LMD). As multiple PMIP clients are configured in the LMD for redundancy and load balance concerns, a selection of PMIP client has to be carefully considered on the overall network performance. Thus, in this paper, we propose two distance-based PMIP client selection schemes - the nearest PMIP client selection scheme and the furthest PMIP client selection scheme. The proposed distance-based selection schemes, where an MN is registered via the nearest or the furthest PMIP client, announce the distance information of PMIP client, so that the PMIP selection is achieved by considering the distance between the PMIP client and the current attachment point.
Spectral bounds for the maximum cut problem
Authors: Walid Ben-Ameur, José Neto
Venue: Networks (2008)

The maximum cut problem is a classical combinatorial optimization problem that is known to be NP-hard in general. In the present article, we provide some new lower and upper bounds that are based on the eigenvalues of the weight matrix with modified diagonal entries. Namely, we show that some upper bounds presented here are generally better than the SDP bound introduced by Goemans and Williamson, JACM 42 (1995), 1115&ndash;1145. We also discuss the complexity of computing these bounds and provide some preliminary computational results. &copy; 2007 Wiley Periodicals, Inc. NETWORKS, 2008