ppxscal/embedding_network huggingface dataset:
Understanding Scheduling Replay Schemes
Authors: Ilhyun Kim, Mikko H. Lipasti
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

Modern microprocessors adopt speculative scheduling techniques where instructions are scheduled several clock cycles before they actually execute. Due to this scheduling delay, scheduling misses should be recovered across the multiple levels of dependence chains in order to prevent further unnecessary execution. We explore the design space of various scheduling replay schemes that prevent the propagation of scheduling misses, and find that current and proposed replay schemes do not scale well and require instructions to execute in correct data dependence order, since they track dependences among instructions within the instruction window as a part of the scheduling or execution process. In this paper, we propose token-based selective replay that moves the dependence information propagation loop out of the scheduler, enabling lower complexity in the scheduling logic and support for data-speculation techniques at the expense of marginal IPC degradation compared to an ideal selective replay scheme.
The past, present and future of web information retrieval
Authors: Monika Henzinger
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Web search engines have emerged as one of the central applications on the Internet. In fact, search has become one of the most important activities that people engage in on the the Internet. Even beyond becoming the number one source of information, a growing number of businesses are depending on web search engines for customer acquisition.The first generation of web search engines used text-only retrieval techniques. Google revolutionized the field by deploying the PageRank technology - an eigenvector-based analysis of the hyperlink structure - to analyze the web in order to produce relevant results. Moving forward, our goal is to achieve a better understanding of a page with a view towards producing even more relevant results.An exciting new form of search for the future is query-free search: While a user performs her daily tasks, searches are automatically performed to supply her with information that is relevant to her activity. We present one type of query-free search, namely query-free news search: While a user watches TV news the system finds in real-time web pages that are relevant to the news stories.
Optimising automatic tracking of multilayer boards
Authors: H. G. Adshead
Venue: ACM SIGDA Newsletter (1975)

The paper commences with a brief but critical appreciation of some known automatic tracking techniques for multilayer printed circuit boards, viz. Maze-Running, Line-Search and Channel-Allocation. The purpose here is to bring out their inherent similarity and to propound their specific superiority under different combinations of controlling criteria dictated by technological constraints. Consideration is given to the prohibitive core and time requirement for a real life environment involving an approximately 500 x 500 track matrix associated with the request for orthogonally connecting about 2500 pin-pairs, on each board. The paper then proceeds to discuss in detail the evolution of an effective algorithm and list-structure capable of successfully handling this problem. Finally several side issues of major significance are introduced. The efficient pre-sorting of the order in which wires are submitted to the main algorithm has been found to make a significant contribution to the efficiency of the entire system. Profile analysis is developed as a technique for comparing the relative merits of various topological placements of the logic network. The importance of the basic board layout and its relation to the algorithm employed is stressed.
Objects shared by Byzantine processes
Authors: Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld
Venue: Distributed Computing (2003)

Work to date on algorithms for message-passing systems has explored a wide variety of types of faults, but corresponding work on shared memory systems has usually assumed that only crash faults are possible. In this work, we explore situations in which processes accessing shared objects can fail arbitrarily (Byzantine faults).
Application-Level QoS Control for Video-on-Demand
Authors: Paolo Bellavista, Antonio Corradi, Cesare Stefanelli
Venue: IEEE Internet Computing (2003)

Using mobile agent technology, the ubiQoS middleware supports QoS tailoring and adaptation of video-on-demand flows in response to user preferences and terminal properties.
Guidelines for annotating temporal information
Authors: Inderjeet Mani, George Wilson, Lisa Ferro, Beth Sundheim
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper introduces a set of guidelines for annotating time expressions with a canonicalized representation of the times they refer to. Applications that can benefit from such an annotated corpus include information extraction (e.g., normalizing temporal references for database entry), question answering (answering "when" questions), summarization (temporally ordering information), machine translation (translating and normalizing temporal references), and information visualization (viewing event chronologies).
A TCP-Physical Cross-Layer Congestion Control Mechanism for the Multirate WCDMA System Using Explicit Rate Change Notification
Authors: Li-Chun Wang, Ching-Hao Lee
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, we propose an explicit rate change notification (ERCN) mechanism to improve the transmission control protocol (TCP) performance in the wideband code-division multiple-access (WCDMA) system. The base station in the WCDMA system dynamically adapts transmission data rates according to the wireless channel condition. Therefore, if the TCP sender can not be notified about the rate change in the wireless channel, congestion in the radio link between the base station and mobile terminal occurs quite often. In this work, we first derive the relation between the bandwidth in the physical layer and the maximum queue size in the TCP layer, and then obtain a closed-form expression for the average throughput in terms of average queue size, queue delay and channel capacity. We validate results by simulations. The analytical formula can facilitate the design of a cross-layer TCP-physical congestion control mechanism for the rate adaptive wireless system.
Avalanche Photodiode Gain and Impulse Response Calculation on a Public Computing Platform
Authors: S. Pellicer, Y. Pan, P. Sun, M. Hayat
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

Public computing shows promise as an architecture offering tremendous computational power to complex scientific problems. Calculation of the joint probability distribution function for avalanche photodiode gain and impulse response is one such problem. The BOINC architecture is a public computing platform used in this experiment to examine the performance offered by the platform for a specific scientific computation featuring intense computation, task independence, and heavy communication overhead. The large output data of this computation is shown to have a significant impact on the execution of this applicationresulting in a speedup gain of between 4.5 and 5 times the sequential version. Workload distribution favoring a participant node with rich communication resources in the public computing platform suggests greater performance gains available from the platform if communication resources are increased.
Feature article introduction
Authors: Craig Partridge
Venue: ACM SIGCOMM Computer Communication Review (2005)

Vint Cerf and Bob Kahn are this year's recipients of the ACM Turing Award (the highest award in Computer Science) for their pioneering work in internetworking. To commemorate their award, and with the gracious consent of IEEE (which originally published the paper) and the authors, SIGCOMM is reprinting their famous early paper on internetworking, "A Protocol for Packet Network Interconnection," from IEEE Transactions on Communications of May 1974.When the paper was written, Bob was early in his thirteen year-career at the US Defense Advanced Research Projects agency and Vint was a junior professor at Stanford. Bob eventually left DARPA and has continued in a distinguished career of nurturing research through the not-for-profit Corporation for National Research Initiatives (CNRI), which he founded in 1986 and has led ever since. Vint soon left Stanford to spend several years at DARPA. After DARPA, Vint worked at MCI, leading the development of MCI Mail, then worked with Bob at CNRI, then rejoined MCI in 1994, where he is senior vice president for technology strategy.Throughout this time, both Vint and Bob have been actively involved in Internet activities. For many years, Vint served on (and for some years, chaired) the Internet Activities Board. Vint is currently chairman of the board of the Internet Corporation for Assigned Names and Numbers (ICANN). Bob, Vint and CNRI have provided essential support services for the Internet Engineering Task Force (IETF) for many years.Closer to home, both Bob and Vint have served as chairs of SIGCOMM. And both have received the ACM SIGCOMM Award: Bob in 1993 and Vint in 1996.I continue to find reading this paper intellectually rewarding, both for what it contains and what it does not. What it contains, of course, is a lot of the ideas that eventually became TCP and IP. It is somewhat astonishing to see how much was known in 1974, only 5 years after ARPANET was turned on. Equally interesting are things that were missing, such as congestion coordination with routers (e.g. the TCP congestion window). And there are also a few (not many) ideas that turned out to be bad (such as shrinking the receiver window from the right). All in all a rewarding read and I hope you'll agree, worth reprinting 31 years later.
Embedding of cycles and wheels into arbitrary trees
Venue: Networks (2004)

We estimate and characterize the edge congestion-sum measure for embeddings of various graphs such as cycles, wheels, and generalized wheels into arbitrary trees. All embedding algorithms apply an interesting general technique based on the consecutive label property. Our algorithms produce optimal values of sum of dilations and sum of edge-congestions in linear time. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;3&rpar;, 173&ndash;178 2004
News in the age of the web
Authors: Krishna Bharat
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

One of the most exciting and successful examples of the Web impacting society is online news. The history of the news industry from print to the online medium is an interesting journey. Broadcast news transformed society by making news available instantly rather than once a day. While more channels became available, barriers to entry remained high and mainstream opinions continued to dominate. News on the net has brought in a number of valuable transformations, allowing news to be made (potentially) more accessible, diverse, democratic, personalized and interactive than before. Blogging has now made "citizen reporting" possible. As with any disruptive technology online news has both positive and negative implications, such as the threat of disinformation. Computer assisted news is a fun area of research that draws upon prior work in information retrieval, data mining and user interfaces. Given the volume of online news being generated today, the ability to find news and related facts quickly and with high relevance affects both readers and journalists. The talk will address the social implications as well as the technical challenges in the dissemination of online news, with a focus on Google News. Google News is an automated service that makes over 4,500 online, English sources searchable and browseable in real time, with an emphasis on breadth of coverage.
Scalability of hybrid programming for a CFD code on the earth simulator
Authors: K. Itakura, A. Uno, M. Yokokawa, T. Ishihara, Y. Kaneda
Venue: Parallel Computing (2004)

The Earth Simulator (ES) is an SMP cluster system. There are two types of parallel programming models available on the ES. One is a flat programming model, in which a parallel program is implemented by MPI interfaces only, both within an SMP node and among nodes. The other is a hybrid programming model, in which a parallel program is written by using thread programming within an SMP node and MPI programming among nodes simultaneously. It is generally known that it is difficult to obtain the same high level of performance using the hybrid programming model as can be achieved with the flat programming model.In this paper, we have evaluated scalability of the code for direct numerical simulation of the Navier-Stokes equations on the ES. The hybrid programming model achieves the sustained performance of 346.9 Gflop/s, while the flat programming model achieves 296.4 Gflop/s with 16 PNs of the ES for a DNS problem size of 2563. For small scale problems, however, the hybrid programming model is not as efficient because of microtasking overhead. It is shown that there is an advantage for the hybrid programming model on the ES for the larger size problems.
Living with Database Conflicts: A Temporal Branching Technique
Authors: Roy Gelbard, Israel Spiegler
Venue: Distributed and Parallel Databases (2005)

Heterogeneous as well as distributed databases make data conflicts inevitable. Both tolerate the entry of conflicting values in data objects, e.g., the value "female" may be entered by one user whereas another may put "male" in the same data object. Such inconsistencies in databases are common and are resolved routinely by built in structured mechanisms. Unresolved conflicts are typically quarantined till they can be resolved. But, there are situations for which there are no structured mechanisms to resolve conflicts while having to maintain application flow. Moreover, there are situations, i.e., medical or financial environments, in which conflicts must be stored so that their effects be analyzed for decision making. The current research proposes a model and a technique for living with database conflicts. The technique, named Temporal Branching, integrates and extends temporal oriented databases, temporal versioning, and log-file approaches and offers a solution and flexible structure readily accessible to retrieval and audits by standard DBMS software. A case study in health care delivery system is given to illustrate the problem and proposed solution.
Kraftwerk: a versatile placement approach
Authors: Bernd Obermeier, Hans Ranke, Frank M. Johannes
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

During the ispd05 placement contest, we employed the force-directed approach Kraftwerk for global placement complemented by the network-flow based final placer DOMINO. These powerful and exible tools for standard cell placement can cope with various placement objectives and design conditions.
Computer model for the Zebra fish brain
Authors: Paul Pedersen, Justin Schneider
Venue: Journal of Computing Sciences in Colleges (2005)

We are presenting an interdisciplinary Computer Science project (with the Biology Department at Wagner College). A group of faculty and a group of undergraduate students at Wagner College have been studying the microscopic structures of the Zebra-fish brain to better understand how the human brain is affected by the things we do.
Book review: Common Lisp: A Gentle Introduction to Sympolic Programming by David S. Touretzky (Benjamin Cummings Publishing Co.)
Venue: ACM SIGART Bulletin (1991)

Touretzky starts his book with the following statement: "This book is about learning to program in Lisp." He delivers his promise to his readers with clear instructions and many simple yet robust examples throughout the book. A partial list of features that separate this book from others are: emphasis on simplicity, use of evaltrace notation, description of several useful Lisp toolkits, and comprehensive representations for Lisp data structures. In addition, each chapter ends with a section on advanced topics. These sections have two purposes: to introduce advanced programming materials and to show computer programming in its broader mathematical and logical perspectives. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Biorobotic Investigation of Norway Rat Pups (Rattus norvegicus) in an Arena
Authors: Jeffrey C. Schank, Christopher J. May, Jonathan T. Tran, Sanjay S. Joshi
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2004)

Biorobotics research typically focuses on simulating specific aspects of animal biomechanics, sensory systems, and computational abilities. We have developed a novel methodology for integrating the study of biorobotics and animal behavior. We describe several metrics for characterizing and comparing rat pup and robot behavior without presupposing behavioral goal states. In the rat pup and robot experiments, we found that when 10-day-old Norway rats (Rattus Norvegicus) are placed in an arena, they typically follow walls to a single corner and stay there. However, our thigmotaxic robots followed walls but typically circumnavigated the entire arena, contacting all corners, and exhibiting asymmetric corner behavior. After observing the latter behavior in robots, we found that rat pups also exhibited asymmetric corner behavior. Thus, our robotic experiments, while not quantitatively matching pup behavior, led to the discovery of a previously unrecognized pattern of behavior in rat pups. This illustrates the value of models in leading to discovery of new patterns of behavior in the system modeled. Our results also show that simple thigmotaxic architectures alone may not explain pup behavior in an arena.
Load Balance Based Network Bandwidth Allocation for Delay Sensitive Services
Authors: Yan Shi, Zengji Liu, Zhiliang Qiu, Min Sheng
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Satisfying critical QoS requirements in next generation networks poses major challenges, due to its intrinsic complexity of network resource allocation. This paper considers the problem of load balance based bandwidth allocation for delay sensitive services. For satisfying deterministic end-to-end delay requirement, a simple and efficient algorithm for path level optimal bandwidth allocation, Path level Equal Ratio Allocation algorithm (P-ERA), is developed first. Based on P-ERA, another algorithm for network level optimized bandwidth allocation, Network level Equal Ratio Allocation algorithm (N-ERA), is also presented for much more complicated network circumstances. N-ERA algorithm features appropriate route selection and balanced bandwidth allocation, and can adaptively avoid, or at least delay, the emergence of network bottleneck when a network is heavily loaded. Extensive simulations indicate that N-ERA algorithm can make full use of network bandwidth and admit more services, even if they are delay critical, than other ones dealing with the same problem. And the less computation complexity of N-ERA algorithm makes it of great application value.
Maximum Likelihood Estimation and ModelComparison for Mixtures of Structural EquationModels with Ignorable Missing Data
Authors: Sik-Yum Lee, Xin-Yuan Song
Venue: Journal of Classification (2003)

The objective of this paper is to develop the maximum likelihood approach for analyzing a finite mixture of structural equation models with missing data that are missing at random. A Monte Carlo EM algorithm is proposed for obtaining the maximum likelihood estimates. A well-known statistic in model comparison, namely the Bayesian Information Criterion (BIC), is used for model comparison. With the presence of missing data, the computation of the observed-data likelihood function value involved in the BIC is not straightforward. A procedure based on path sampling is developed to compute this function value. It is shown by means of simulation studies that ignoring the incomplete data with missing entries gives less accurate ML estimates. An illustrative real example is also presented.
Improved algorithms for computing determinants and resultants
Authors: Ioannis Z. Emiris, Victor Y. Pan
Venue: Journal of Complexity (2005)

Our first contribution is a substantial acceleration of randomized computation of scalar, univariate, and multivariate matrix determinants, in terms of the output-sensitive bit operation complexity bounds, including computation modulo a product of random primes from a fixed range. This acceleration is dramatic in a critical application, namely solving polynomial systems and related studies, via computing the resultant. This is achieved by combining our techniques with the primitive-element method, which leads to an effective implicit representation of the roots. We systematically examine quotient formulae of Sylvestertype resultant matrices, including matrix polynomials and the u-resultant. We reduce the known bit operation complexity bounds by almost an order of magnitude, in terms of the resultant matrix dimension. Our theoretical and practical improvements cover the highly important cases of sparse and degenerate systems.
Spatial Decomposition of the Hough Transform
Authors: James Allan Heather, Xue Dong Yang
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In the field of image processing, it is a common problem to search for edges within an image, typically using the Hough Transform, and attempt to extract the end points of those edges. This paper discusses an improved technique for accomplishing this task. The idea is based on the observation of an additive property of the Hough Transform. That is, the global Hough Transform can be obtained by the summation of local Hough Transforms of disjoint subregions. The method discussed involves the recursive subdivision of the image into subimages, each with their own parameter space, and organized in a quadtree structure, which allows for implicit storage of arbitrary parameter space manifolds. This method results in improved efficiency in finding endpoints of line segments and improved robustness and reliability in extracting lines in noisy situations, at a slightly increased cost of memory. The new algorithm is presented in detail, along with a discussion of time and space complexities. The paper is concluded with proposed future research in this direction.
Topological Conditions for Uniqueness of Equilibrium in Networks
Authors: Igal Milchtaich
Venue: Mathematics of Operations Research (2005)

Equilibrium flow in a physical network with a large number of users (e.g., transportation, communication, and computer networks) need not be unique if the costs of the network elements are not the same for all users. Such differences among users may arise if they are not equally affected by congestion or have different intrinsic preferences. Whether or not, forall assignments of strictly increasing cost functions, each user's equilibrium cost is the same in all Nash equilibria can be determined from the network topology. Specifically, this paper shows that in a two-terminal network, the equilibrium costs are always unique if and only if the network is one of several simple networks or consists of several such networks connected in series. The complementary class of all two-terminal networks with multiple equilibrium costs forsome assignment of (user-specific) strictly increasing cost functions is similarly characterized by an embedded network of a particular simple type.