ppxscal/embedding_network huggingface dataset:
Core fusion: accommodating software diversity in chip multiprocessors
Authors: Engin Ipek, Meyrem Kirman, Nevin Kirman, Jose F. Martinez
Venue: ACM SIGARCH Computer Architecture News (2007)

This paper presents core fusion, a reconfigurable chip multiprocessor(CMP) architecture where groups of fundamentally independent cores can dynamically morph into a larger CPU, or they can be used as distinct processing elements, as needed at run time by applications. Core fusion gracefully accommodates software diversity and incremental parallelization in CMPs. It provides a single execution model across all configurations, requires no additional programming effort or specialized compiler support, maintains ISA compatibility, and leverages mature micro-architecture technology.
Automatic Detection and Classification of Traffic Signs
Authors: Carlos Filipe Paulo, Paulo Lobato Correia
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

This paper proposes algorithms for the automatic detection of traffic signs from photo or video images and their classification to provide a driver alert system. Several examples taken from Portuguese roads are used to demonstrate the effectiveness of the proposed system. Traffic signs are detected by analyzing color information, notably red and blue, contained on the images. The detected signs are then classified according to their shape characteristics, as triangular, squared and circular shapes. Combining color and shape information, traffic signs are classified into one of the following classes: danger, information, obligation or prohibition. Both the detection and classification algorithms include innovative components to improve the overall system performance.
An Experiment on the Effects of Interruptions on Individual Work Trajectories and Performance in Critical Environments
Authors: Suzanne P. Weisband, Kelly J. Fadel, Elisa Mattarelli
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Interruptions are a central characteristic of work in critical environments such as hospitals, airlines, and security agencies. Often, interruptions occur as notifications of some event or circumstance that requires attention. Notifications may be delivered actively as disruptions requiring immediate attention, or passively as unobtrusive background messages. This research hypothesizes that the way notifications are delivered can have an impact on how work unfolds over time, which in turn can affect performance. Based on theories of interruption and observations in an actual operating room, a computer-based role-playing game simulating the scheduling of surgeries in an operating room unit was developed. An experiment was conducted using the game to examine the effects of different types of notification delivery on work trajectories and performance. Results indicate that the way notifications are delivered can indeed influence work trajectories and, consequently, performance.
Using random subsets to build scalable network services
Authors: Dejan Kostić, Adolfo Rodriguez, Jeannie Albrecht, Abhijeet Bhirud, Amin Vahdat
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participants. Key to this approach is ensuring that membership in the subset changes periodically and with uniform representation over all participants. Random subsets could help overcome inherent scaling limitations to services that maintain global state and perform global network probing. It could further improve the routing performance of peer-to-peer distributed hash tables by locating topologically-close nodes. This paper presents the design, implementation, and evaluation of RanSub, a scalable protocol for delivering such state. As a first demonstration of the RanSub utility, we construct SARO, a scalable and adaptive application-layer overlay tree. SARO uses RanSub state information to locate appropriate peers for meeting application-specific delay and bandwidth targets and to dynamically adapt to changing network conditions. A large-scale evaluation of 1000 overlay nodes participating in an emulated 20,000- node wide-area network topology demonstrate both the adaptivity and scalability (in terms of per-node state and network overhead) of both RanSub and SARO. Finally, we use an existing streaming media server to distribute content through SARO running on top of the PlanetLab Internet testbed.
Hierarchical evolution of heterogeneous neural networks
Authors: D. Weingaertner, V. K. Tatai, R. R. Gudwin, F. J. Von Zuben
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper describes a hierarchical evolutionary technique developed to design and train feedforward neural networks with different activation functions on their hidden-layer neurons (heterogeneous neural networks). At the upper level, a genetic algorithm is used to determine the number of neurons in the hidden layer and the type of the activation function of those neurons. At the second level, neural nets compete against each other across generations so that the nets with the lowest test errors survive. Finally, on the third level, a co-evolutionary approach is used to train each of the created networks by adjusting both the weights of the hidden-layer neurons and the parameters for their activation functions.
A prototype of a social and economic based resource allocation system in grid computing
Authors: Gabriele Pierantoni, Eamonn Kenny, Brian Coghlan
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

Nowadays the grid community is facing complex challenges. Among them three are particularly interesting: the existence of many different grid middlewares; the increasing complexity of the submitted jobs; and the many different ways in which actors and resources can be arranged. In this paper we propose a combined solution to these problems which is based on the union of two concepts: a metagrid concept that tackles the issues posed by the variety of differentmiddlewares and the complexity of jobs, and a concept of Social Grid Agents that tackles the issue of resource sharing and allocation.
Time-Optimal Multiple Rank Computations on Meshes with Multiple Broadcasting
Authors: D. Bhagavathi, V. Bokka, H. Gurla, R. Lin, S. Olariu, J. L. Schwing, W. Shen, L. Wilson
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Consider arbitrary collections A = a_1,a_2,.. .,a_n of items and Q = q_1,q_2,...,q_m (1 \leqslant mn \leqslant n) of queries from a totally ordered universe. The multiple rank problem involves computing for every query qi the number of items in A that have a lesser value. Our contribution is to show that the problem at hand can be solved time-optimally on meshes with multiple broadcasting. More specifically, if the collection A is siored in some order one item per processor and if Q is stored one query per processor in the leftmost \frac{m} {{\sqrt n }} columns of a mesh with multiple broadcasting of size \sqrt n x /sqrt n, the corresponding instance of the multiple rank problem can be solved in \Theta \left( {m^{\frac{1} {3}} n^{\frac{1} {6}} } \right) time. As an application we present a time-optimal algorithm to compute the histogram of a m-level gray image of size \sqrt n x \sqrt n in \Theta \left( {m^{\frac{1} {3}} n^{\frac{1} {6}} } \right) time.
Lossless 2D discrete Walsh-Hadamard transform
Authors: K. Komatsu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The 64-point separable lossless two dimensional (2D) WHT is composed of the 8-point lossless one dimensional WHT. The latter is obtained by first decomposing the 8-point WHT into 2-point WHTs and then replacing every 2-point WHT by a ladder network. Since the coefficients in the ladder network then become real, the advantage of being multiplier-free vanishes. This paper therefore proposes a 64-point nonseparable lossless 2D WHT without multiplication as follows. First, the 64-point separable 2D WHT is decomposed into 4-point 2D WHTs. Second, every 4-point 2D WHT is replaced by a 2D ladder network which is multiplier-free. It is also shown that the transform coefficients of the proposed transform are closer to those of the 64-point lossy 2D WHT than those of the 64-point separable lossless 2D WHT.
Globally Optimal Estimates for Geometric Reconstruction Problems
Authors: Fredrik Kahl, Didier Henrion
Venue: International Journal of Computer Vision (2007)

We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or non-optimality--or a combination of both--we pursue the goal of achieving global solutions of the statistically optimal cost-function.Our approach is based on a hierarchy of convex relaxations to solve non-convex optimization problems with polynomials. These convex relaxations generate a monotone sequence of lower bounds and we show how one can detect whether the global optimum is attained at a given relaxation. The technique is applied to a number of classical vision problems: triangulation, camera pose, homography estimation and last, but not least, epipolar geometry estimation. Experimental validation on both synthetic and real data is provided. In practice, only a few relaxations are needed for attaining the global optimum.
Using the Delaunay Triangulation/ Voronoi Diagram to extract Building Information from Raw LIDAR Data
Authors: Rebecca (O. C. ). Tse, Chris Gold, Dave Kidner
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

An increasing need for automated 3D city reconstruction models is being driven by a variety of applications, from tourism to disaster management. The arrival of LIDAR (Light Detection and Ranging) - airborne laser altimetry - now provides rapid elevation models of terrain and buildings. LIDAR data contains X, Y and Z coordinates only, it does not provide any building information. The challenge is to convert the data into CAD-type models containing walls, roof planes and terrain which can be rapidly displayed from any 3D viewpoint. This paper shows an alternative method to locate building blocks and identify the roof structures with the use of the Delaunay Triangulation and its dual Voronoi diagram.
A Novel CMOS Full Adder
Authors: Keivan Navi, Omid Kavehie, Mahnoush Rouholamini, Amir Sahafi, Shima Mehrabi
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper proposes a high-speed adder cell using a new design style called "bridge". The bridge design style offers more regularity and higher density than conventional CMOS design style, by using some transistors, named bridge transistors. Results show 4.4% (@ Vdd=3 volt) to 34.1% (@ Vdd=1 volt) improvement in speed over conventional CMOS adder. HSPICE is the circuit simulator used, and the technology being used for simulations is BSIM3v3 0.18ìm technology.
I-Navigate: Intelligent, Self-adapting Navigation Maps
Authors: Herwig Mayr
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

In the frame of our "I-Navigate" project, we create a software system that allows to extend digital navigation maps automatically and, thus, to improve their quality continuously. In order to achieve this, a track is gathered through tracing the paths of users (on foot, by car or by bicycle, for instance) via GPS. This track is converted into a route, which is merged with the current map graph and supplied to the user as an updated, navigable map. Areas of application comprise the continuous extension of car navigation systems (last mile integration), the addition of off-road features to navigation maps (e.g. for outdoor and leisure activities, like mountain biking or off-track skiing), but also the surveillance of users navigating such a track in order to enable better targeted rescues in emergency cases (e.g. for mountaineers).
IFIP educational activities
Authors: A. Joe Turner
Venue: ACM SIGCSE Bulletin (2007)

This is the second in a series of columns about IFIP, the International Federation for Information Processing. In the previous (December 2006) column, we discussed the general organization and scope of IFIP. IFIP's members are computing societies, one per country except for the USA, where both ACM and the IEEE Computer Society are members.
A New Algorithm in Geometry of Numbers
Authors: Mathieu Dutour, Konstantin Rybnikov
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the previously used method [Du05]. We have implemented and used our algorithm for finding perfect Delaunay polytopes in dimensions 6, 7, 8. Our findings lead to a new conjecture that sheds light on the structure of lattice Delaunay tilings.
An alternative formulation for low rank transform domain adaptive filtering
Authors: T. E. Hunter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Linebarger et al. (see Proceedings of Thirty-First Asilomar Conference on Signals, Systems & Computers, Pacific Grove, California, USA, vol.1, p.123-27, 1997) introduced a new, optimal approach to low rank transform domain adaptive filtering is , using a least squares, matrix based framework. Further, Raghothaman (see Proceedings of 8th IEEE DSP Workshop, Utah, USA, 1998) provides a computationally efficient algorithm to solve the formulation of the problem proposed by Linebarger. In this paper, we examine an alternative method for applying an optimal low rank transform, within the framework derived by Linebarger, to convert an overdetermined, full rank system into a low rank system. In addition, we propose a computationally efficient algorithm for the implementation of our method, using the DCT as the unitary transformation. Finally, we evaluate the performance of our algorithm via simulation in an acoustic echo canceller application, and show that the performance of our method is superior to existing low rank methods, NLMS and affine projection.
An Automated Signature-Based Approach against Polymorphic Internet Worms
Authors: Yong Tang, Shigang Chen
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Capable of infecting hundreds of thousands of hosts, worms represent a major threat to the Internet. However, the defense against them is still an open problem. This paper attempts to answer an important question: How can we distinguish polymorphic worms from normal background traffic? We propose a new worm signature, called the position-aware distribution signature (PADS), which fills the gap between traditional signatures and anomaly-based intrusion detection systems. The new signature is a collection of position-aware byte frequency distributions. It is more flexible than the traditional signatures of fixed strings while it is more precise than the position-unaware statistical signatures. We propose two algorithms based on Expectation-Maximization (EM) and Gibbs Sampling to efficiently compute PADS from a set of polymorphic worm samples. We also discuss how to separate a mixture of different polymorphic worms such that their respective PADS signatures can be calculated. We perform extensive experiments to demonstrate the effectiveness of PADS in separating new worm variants from normal background traffic.
FastReplica: efficient large file distribution within content delivery networks
Authors: Ludmila Cherkasova, Jangwon Lee
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

In this work, we consider a large-scale distributed network of servers and a problem of content distribution across it. We propose a novel algorithm, called FastReplica, for an efficient and reliable replication of large files in the Internet environment. There are a few basic ideas exploited in FastReplica. In order to replicate a large file among n nodes (n is in the range of 10-30 nodes), the original file is partitioned into n subfiles of equal size and each subfile is transferred to a different node in the group. After that, each node propagates its subfile to the remaining nodes in the group. Thus instead of the typical replication of an entire file to n nodes by using n Internet paths, connecting the original node to the replication group, FastReplica exploits n × n Internet paths within the replication group where each path is used for transferring 1/n -th of the file. We design a scalable and reliable FastReplica algorithm which can be used for replication of large files to a large group of nodes. The new method is simple and inexpensive. It does not require any changes or modifications to the existing Internet infrastructure, and at the same time, it significantly reduces the file replication time as we demonstrate through experiments on a prototype implementation of FastReplica in a wide-area testbed.
Three-dimensional face recognition across pose and expression
Authors: Anil K. Jain
Venue:  (2006)

Face analysis and recognition has a large number of applications, such as security, communication, and entertainment. Current two-dimensional image based face recognition systems encounter difficulties with large facial appearance variations due to pose, illumination, and expression changes. We have developed a face recognition system that utilizes three-dimensional shape information to make the system more robust to large head pose changes. Two different modalities provided by a facial scar; namely, shape and intensity, are utilized and integrated for face matching. While the 3D shape of a face does not change due to head pose (rigid) and lighting changes, it is not invariant to non-rigid facial movement, such as expressions. Collecting and storing multiple templates to account for various expressions for each subject in a, large database is not practical. We have designed a hierarchical geodesic-based resampling scheme to derive a facial surface representation for establishing correspondence across expressions and subjects. Based on the developed representation, we extract and model three-dimensional non-rigid facial deformations such as expression changes for expression transfer and synthesis. For 3D face matching purposes, a userspecific 3D deformable model is built driven by facial expressions. An alternating optimization scheme is applied to fit the deformable model to a test facial scan, resulting in a matching distance. To make the matching system fully automatic, an automatic facial feature point extractor was developed. The resulting 3D recognition system is able to handle large head pose changes and expressions simultaneously. In summary, a fully automatic system has been developed to address the problems of 3D face matching in the presence of simultaneous large pose changes and expression variations, including automatic feature extraction, integration of two modalities, and deformation analysis to handle non-rigid facial movement (e.g., expressions).
Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges
Authors: David J. Abraham, Avrim Blum, Tuomas Sandholm
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

In barter-exchange markets, agents seek to swap their items with one another, in order to improve their own utilities. These swaps consist of cycles of agents, with each agent receiving the item of the next agent in the cycle. We focus mainly on the upcoming national kidney-exchange market, where patients with kidney disease can obtain compatible donors by swapping their own willing but incompatible donors. With over 70,000 patients already waiting for a cadaver kidney in the US, this market is seen as the only ethical way to significantly reduce the 4,000 deaths per year attributed to kidney diseas. The clearing problem involves finding a social welfare maximizing exchange when the maximum length of a cycle is fixed. Long cycles are forbidden, since, for incentive reasons, all transplants in a cycle must be performed simultaneously. Also, in barter-exchanges generally, more agents are affected if one drops out of a longer cycle. We prove that the clearing problem with this cycle-length constraint is NP-hard. Solving it exactly is one of the main challenges in establishing a national kidney exchange. We present the first algorithm capable of clearing these markets on a nationwide scale. The key is incremental problem formulation. We adapt two paradigms for the task: constraint generation and column generation. For each, we develop techniques that dramatically improve both runtime and memory usage. We conclude that column generation scales drastically better than constraint generation. Our algorithm also supports several generalizations, as demanded by real-world kidney exchanges. Our algorithm replaced CPLEX as the clearing algorithm of the Alliance for Paired Donation, one of the leading kidney exchanges. The match runs are conducted every two weeks and transplants based on our optimizations have already been conducted.
Toys are us: presenting mathematical concepts in CS1/CS2
Authors: P. Bucci
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Presentation and use of formally-specified software components in CS1/CS2 presents interesting pedagogical challenges. Specifications may involve unfamiliar mathematical concepts and notation. We have found that the use of toys, such as stacking plastic cups and Lego(C) blocks, to be amazingly effective in helping students develop mental models for mathematical concepts. With the aid of these mental models, students are able to understand the behavior of software components through cover stories (their specifications), without knowing the implementations of the components.
Multiplicative Updates for Nonnegative Quadratic Programming
Authors: Fei Sha, Yuanqing Lin, Lawrence K. Saul, Daniel D. Lee
Venue: Neural Computation (2007)

Many problems in neural computation and statistical learning involve optimizations with nonnegativity constraints. In this article, we study convex problems in quadratic programming where the optimization is confined to an axis-aligned region in the nonnegative orthant. For these problems, we derive multiplicative updates that improve the value of the objective function at each iteration and converge monotonically to the global minimum. The updates have a simple closed form and do not involve any heuristics or free parameters that must be tuned to ensure convergence. Despite their simplicity, they differ strikingly in form from other multiplicative updates used in machine learning. We provide complete proofs of convergence for these updates and describe their application to problems in signal processing and pattern recognition.