ppxscal/embedding_network huggingface dataset:
On deconvolution problems: numerical aspects
Authors: Alexander G. Ramm, Alexandra B. Smirnova
Venue: Journal of Computational and Applied Mathematics (2005)

An optimal algorithm is described for solving the deconvolution problem of the form ku := ∫01 k(t-s)u(s) ds = f(t) given the noisy data fδ,||f - fδ||≤δ. The idea of the method consists of the representation k = A (I + S), where S is a compact operator, I + S is injective, I is the identity operator, A is not boundedly invertible, and an optimal regularizer is constructed for A. The optimal regularizer is constructed using the results of the paper MR 40#5130.
Effect of stress on viral&ndash;bacterial synergy in bovine respiratory disease: novel mechanisms to regulate inflammation: Conference Papers
Authors: P. D. Hodgson, P. Aich, A. Manuja, K. Hokamp, F. M. Roche, F. S. L. Brinkman, A. Potter, L. A. Babiuk, P. J. Griebel
Venue: Comparative and Functional Genomics (2005)

The severity of bovine respiratory infections has been linked to a variety of factors, including environmental and nutritional changes, transportation, and social reorganization of weaned calves. Fatal respiratory infections, however, usually occur when a primary viral infection compromises host defences and enhances the severity of a secondary bacterial infection. This viral&ndash;bacterial synergy can occur by a number of different mechanisms and disease challenge models have been developed to analyse host responses during these respiratory infections. A primary bovine herpesvirus-1 (BHV-1) respiratory infection followed by a secondary challenge with Mannheimia haemolytica results in fatal bovine respiratory disease (BRD) and host responses to these two pathogens have been studied extensively. We used this disease model to demonstrate that stress significantly altered the viral&ndash;bacterial synergy resulting in fatal BRD. Functional genomic analysis revealed that BHV-1 infection enhanced toll-like receptors (TLR) expression and increased pro-inflammatory responses which contribute to the severity of a Mannheimia haemolytica infection. TLRs play a critical role in detecting bacterial infections and inducing pro-inflammatory responses. It is difficult to understand, however, how stress-induced corticosteroids could enhance this form of viral&ndash;bacterial synergy. Nuclear translocation of the glucocorticoid receptor activates cell signalling pathways which inhibit both TLR signalling and pro-inflammatory responses. The apparent conundrum between stress-induced corticosteroids and enhanced BRD susceptibility is discussed in terms of present data and previous investigations of stress and respiratory disease. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Software Review: The Great Theorem Prover Newborn Software 4874 Westmount St. Westmount, Quebec, Canada H3Y 1Y1; $30.00
Venue: ACM SIGART Bulletin (1991)

This product --- I'll refer to it as TGTP --- is a resolution theorem prover that runs on a standard IBM PC (not requiring anything like a 286, lots of memory, graphics, etc.). It contains several programs, some sample files and a manual of a little over 100 pages. It not only describes how to use the programs but also attempts to teach the reader how they work, and in the process, something about logic and resolution theorem provers in general. The preface says that, in addition to actually proving theorems, TGTP can be used for teaching theorem proving techniques. It is claimed to be understandable by high school students with a good mathematical background. I am not in a position to agree or disagree with this claim, but I have my doubts. It is also supposed to be of interest to mathematicians curious about progress in mechanical theorem proving, college students studying the subject and specialists in the area. TGTP evidently started out as a teaching aid for an AI course. For specialists I don't expect that it will be of more than passing interest, although it also has some entertainment value.
Group-SPMD programming with orthogonal processor groups: Research Articles
Authors: Thomas Rauber, Robert Reilein, Gudula Rünger
Venue: Concurrency and Computation: Practice Experience (2004)

Many programs for message-passing machines can benefit from an implementation in a group-SPMD programming model due to the potential to reduce communication overhead and to increase scalability. In this paper, we consider group-SPMD programs exploiting different orthogonal processor partitions in one program. For each program this is a fixed set of predefined processor partitions given by the parallel hyperplanes of a two- or multi-dimensional virtual processor organization. We introduce a library built on top of MPI to support the programming with those orthogonal processor groups. The parallel programming model is appropriate for applications with a multi-dimensional task grid and task dependencies mainly aligned in the dimensions of the task grid. The library can be used to specify the appropriate processor partitions, which are then created by the library, and to define the mapping of tasks to the processor hyperplanes. Examples from numerical analysis illustrate the programming style and show that the runtime on distributed memory machines can be considerably reduced by using the library. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A fine adventure
Authors: Flo Paroli
Venue: Issue 84 (April 1983) (1983)

I would like to thank Willie Crowther and Don Woods for their efforts. Without their work, this story could never have been written. 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
An Application Analysis Framework For Polymorphic Chip Multiprocessors
Authors: Ayodele Thomas, Kunle Olukotun
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The SAPIENT parallel analysis framework facilitates the efficient transformation of sequential applications into multilevel parallel applications that can be executed on polymorphic chip multiprocessor architectures. We demonstrate how application characteristics are used to detect thread and data level parallelism in sequential applications and estimate parallel performance. We further demonstrate how SAPIENT determines the combination of application parallelism and polymorphic architecture configuration that maximizes performance. As an example, we present a detailed analysis of parallelism for an MPEG-2 decoder. We further summarize results for six other multimedia applications, identifying the presence of data and thread level parallelism, evaluating performance, and suggesting architecture configurations for each.
Book review: A Computational Model of Metaphor Interpretation By James M. Martin (Academic Press, London, 1990)
Venue: ACM SIGART Bulletin (1991)

Over the past two decades, metaphor has grown to occupy a central position in artificial intelligence research [2]. In particular, natural language processing has set practical goals for understanding the ubiquitous metaphorical expressions in our daily language. George Lakoff and Mark Johnson wrote a provocative book [7] in 1980 on conventional metaphor that has further fueled research interest on conventional metaphor in computational linguistics. The present book is an effort in developing and applying a computational model for processing conventional metaphor.
Recent AI-Related Dissertations
Venue: ACM SIGART Bulletin (1990)

The following are citations selected by title and abstract as being related to AI, resulting from a computer search, using the BRS Information Technologies retrieval service, of the Dissertation Abstracts International (DAI) database produced by University Microfilms International. The online file includes abstracts, which are not published in this listing, but the citations below do include the DAI reference for finding the abstract in the published DAI. Other elements of the citation are author, university, degree, and, if available, number of pages; title; UM order number and year-month of DAI; and DAI subject category chosen by the author of the dissertation. References are sorted first by the initial DAI subject category and second by the author. In addition the database includes masters abstracts, denoted by MAI (Masters Abstracts International) instead of DAI as the reference to the abstract in the abstract in the published MAI.Unless otherwise specified, paper or microform copies of dissertations may be ordered from University Microfilms International, Dissertation Copies, Post Office Box 1764, Ann Arbor, MI 48106; telephone for U.S. (except Michigan, Hawaii, Alaska): 1-800-521-3042, for Canada: 1-800-268-6090. Price lists and other ordering and shipping information are in the introduction to the published DAI.
An (Architecture-Centric) Approach for Tracing, Organizing, and Understanding Events in Event-Based Software Architectures
Authors: Scott A. Hendrickson, Eric M. Dashofy, Richard N. Taylor
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Applications built in a strongly decoupled, eventbased interaction style have many commendable characteristics, including ease of dynamic configuration, accommodation of platform heterogeneity, and ease of distribution over a network. It is not always easy, however, to humanly grasp the dynamic behavior of such applications, since many threads are active and events are asynchronously (and profusely) transmitted. This paper presents a novel, complete approach that aids in the understanding, debugging, and visualization of the behaviors of event-based applications. It applies to real, implemented systems, without requiring the presence of component source code, and supports partial or incomplete, heuristic behavior specifications. A prototype implementation of our approach was applied to two systems, including the prototype itself, indicating that our approach is feasible, scalable, and shows promising results in terms of increasing the understandability of these types of systems.
Bartholdi zeta functions of graph bundles having regular fibers
Authors: Jin Ho Kwak, Jaeun Lee, Moo Young Sohn
Venue: European Journal of Combinatorics (2005)

As a continuation of computing the Bartholdi zeta function of a regular covering of a graph by Mizuno and Sato in J. Combin. Theory Ser. B 89 (2003) 27, we derive in this paper some computational formulae for the Bartholdi zeta functions of a graph bundle and of any (regular or irregular) covering of a graph. If the fiber is a Schreier graph or it is regular and the voltages to derive the bundle or the covering lie in an Abelian group, then the formulae can be simplified. As a byproduct, the Bartholdi zeta functions of Schreier graphs, Cayley graphs and the cartesian product of a graph and a regular graph are obtained.
Thermal via placement in 3D ICs
Authors: Brent Goplen, Sachin Sapatnekar
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

As thermal problems become more evident, new physical design paradigms and tools are needed to alleviate them. Incorporating thermal vias into integrated circuits (ICs) is a promising way of mitigating thermal issues by lowering the thermal resistance of the chip itself. However, thermal vias take up valuable routing space, and therefore, algorithms are needed to minimize their usage while placing them in areas where they would make the greatest impact. With the developing technology of three-dimensional integrated circuits (3D ICs), thermal problems are expected to be more prominent, and thermal vias can have a larger impact on them than in traditional 2D ICs. In this paper, thermal vias are assigned to specific areas of a 3D IC and used to adjust their effective thermal conductivities. The thermal via placement method makes iterative adjustments to these thermal conductivities in order to achieve a desired maximum temperature objective. Finite element analysis (FEA) is used in formulating the method and in calculating temperatures quickly during each iteration. As a result, the method efficiently achieves its thermal objective while minimizing the thermal via utilization.
Coresets in dynamic geometric data streams
Authors: Gereon Frahling, Christian Sohler
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space 1,…,Δd [26]. We develop streaming (1 + ε)-approximation algorithms for k-median, k-means, MaxCut, maximum weighted matching (MaxWM), maximum travelling salesperson (MaxTSP), maximum spanning tree (MaxST), and average distance over dynamic geometric data streams. Our algorithms maintain a small weighted set of points(a coreset) that approximates with probability 2/3 the current point set with respect to the considered problem during the m insert/delete operations of the data stream. They use poly (ε-1, log m, log Δ) space and update time per insert/delete operation for constant k and dimension dHaving a coreset one only needs a fast approximation algorithm for the weighted problem to compute a solution quickly. In fact, even an exponential algorithm is sometimes feasible as its running time may still be polynomial in n. For example one can compute in poly(log n, exp(O((1+log (1⁄ε)⁄ε)d-1))) time a solution to k-median and k-means [21] where n is the size of the current point set and k and d are constants. Finding an implicit solution to MaxCut can be done in poly(log n, exp((1⁄ε)O(1))) time. For MaxST and average distance we require poly(log n, ε-1) time and for MaxWM we require O(n3) time to do this.
Playing with fire: an unexpected collaboration
Authors: J. Anthony Allen
Venue: Organised Sound (2004)

Working with dancers to generate musical material has been the interest of many composers since such technologies became available. My work focuses on a particular kind of dance &ndash; a fire dancer &ndash; to generate sonic material. Working with a fire dancer in a collaborative environment creates a unique set of difficulties with rewarding outcomes.
Information flow using edge stress factor
Authors: Franco Salvetti, Savitha Srinivasan
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This paper shows how a corpus of instant messages can be employed to detect de facto communities of practice automatically. A novel algorithm based on the concept of Edge Stress Factor is proposed and validated. Results show that this approach is fast and effective in studying collaborative behavior.
Intemational Perspectives: THE ROLE OF SCENARIOS IN HCI PRACTICE AND RESEARCH
Authors: Clare-Marie Karat, John Karat
Venue: ACM SIGCHI Bulletin (1992)

How differently do human-computer interaction specialists from divergent cultures see issues in the field? In the previous two International Perspectives columns, we have provided reports on the status of HCI activities in various countries, and will continue to request and publish these sorts of reports as a means of communicating different views of cross-cultural issues. But in this issue we would like to experiment with another way of initiating international dialogue. We offer a short article by Robert Campbell on the role of scenarios in HCI practice and research, and ask for comments from anyone in the community. It is our hope that sharing responses from people with different perspectives on a central theme will create an enlightening and engaging experience for all of us.
Eliminating Conflict Misses Using Prime Number-Based Cache Indexing
Authors: Mazen Kharbutli, Yan Solihin, Jaejin Lee
Venue: IEEE Transactions on Computers (2005)

Using alternative cache indexing/hashing functions is a popular technique to reduce conflict misses by achieving a more uniform cache access distribution across the sets in the cache. Although various alternative hashing functions have been demonstrated to eliminate the worst-case conflict behavior, no study has really analyzed the pathological behavior of such hashing functions that often results in performance slowdown. In this paper, we present an in-depth analysis of the pathological behavior of cache hashing functions. Based on the analysis, we propose two new hashing functions, prime modulo and odd-multiplier displacement, that are resistant to pathological behavior and yet are able to eliminate the worst-case conflict behavior in the L2 cache. We show that these two schemes can be implemented in fast hardware using a set of narrow addition operations, with negligible fragmentation in the L2 cache. We evaluate the schemes on 23 memory intensive applications. For applications that have nonuniform cache accesses, both prime modulo and odd-multiplier displacement hashing achieve an average speedup of 1.27 compared to traditional hashing, without slowing down any of the 23 benchmarks. We also evaluate using odd-multiplier displacement function with multiple multipliers in conjunction with a skewed associative L2 cache. The skewed associative cache achieves a better average speedup at the cost of some pathological behavior that slows down four applications by up to 7 percent.
On An Equivalence Between Loss Rates And Cycle Maxima In Queues And Dams
Authors: René Bekker, Bert Zwart
Venue: Probability in the Engineering and Informational Sciences (2005)

We consider the loss probability of a customer in a single-server queue with finite buffer and partial rejection and show that it can be identified with the tail distribution of the cycle maximum of the associated infinite-buffer queue. This equivalence is shown to hold for the GI&#x002F;G&#x002F;1 queue and for dams with state-dependent release rates. To prove this equivalence, we use a duality for stochastically monotone recursions, developed by Asmussen and Sigman (1996). As an application, we obtain several exact and asymptotic results for the loss probability and extend Tak&aacute;cs' formula for the cycle maximum in the M&#x002F;G&#x002F;1 queue to dams with variable release rate.
Transformation of hexaedral finite element meshes into tetrahedral meshes according to quality criteria
Authors: T. Apel, N. Düvelmeyer
Venue: Computing (2003)

The paper is concerned with algorithms for transforming hexahedral finite element meshes into tetrahedral meshes without introducing new nodes. Known algorithms use only the topological structure of the hexahedral mesh but no geometry information. The paper provides another algorithm which is then extented such that quality criteria for the splitting of faces are respected.
Image Retrieval Based on Sugeno Fuzzy Integral
Authors: Junli Li, Zheru Chi, Gang Chen
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, we propose a fuzzy similarity measure based on Sugeno fuzzy integral and apply it to content-based image retrieval. Fuzzy measure is used to formulate the subjective feedback information. Experimental results show that the proposed method can improve the efficiency and reliability of image retrieval system. Our method of formulating the subjective feedback information performs better than the weighted average operator (WAO) and a Choquet-integral-based similarity measure.
Searching for mobile mice and elephants in GPRS networks
Authors: Roger Kalden, Hannes Ekström
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2004)

In this paper, we provide statistics on large-scale traffic measurements that have been made in a live cellular GPRS network. We show that the current GPRS traffic is dominated by HTTP- and WAP-based applications, and further show in what direction (uplink and/or downlink) the ensuing traffic is transmitted as well as statistics on the length of the flows on a per application basis. We find that the results differ compared to those found in similar measurement studies that have been carried out in the fixed Internet. In particular, our results suggest that flows are shorter in cellular networks, and that the so-called mice and elephant effect, whereby a small part of the flows make up a majority of the bytes transferred, is not prevalent in GPRS networks. Instead, extremely short flows account for the majority of the total flows and bytes transferred. We also discuss the impact of this finding on future research on TCP loss recovery.
Optimizing the number of search result categories
Authors: Mika Käki
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Automatically generated web search result categories were found to be beneficial in our previous study. In that study, we used 15 result categories and left the optimal number of categories issue deliberately untouched. To address this matter, we conducted a new experiment with 27 participants to compare search user interfaces with 10, 20, and 40 automatically generated categories. The results show that users prefer fewer categories. The use of fewer categories results in a slightly more accurate performance in result selection. In addition, the observed speed differences between the conditions were small. Although reading longer category lists requires more time, the users benefited from the increased descriptiveness, causing the overall speed to be almost equal. According to our results, the optimal number of categories is between 10 and 20.
Modeling VP operation: the Diwali Festival Problem
Authors: Rushikesh K. Joshi, Subash Rajaa
Venue: ACM SIGOPS Operating Systems Review (2005)

A new higher-level synchronization problem called Diwali Festival Problem (DFP) is presented. The problem captures the requirements for implementing the VP operation for semaphores outside the operating system kernel in presence of P and V operations, and shared variables with atomic reads and writes.
A model-theoretic coreference scoring scheme
Authors: Marc Vilain, John Burger, John Aberdeen, Dennis Connolly, Lynette Hirschman
Venue: Proceedings of the 6th conference on Message understanding (1995)

This note describes a scoring scheme for the coreference task in MUC6. It improves on the original approach by: (1) grounding the scoring scheme in terms of a model; (2) producing more intuitive recall and precision scores; and (3) not requiring explicit computation of the transitive closure of coreference. The principal conceptual difference is that we have moved from a syntactic scoring model based on following coreference links to an approach defined by the model theory of those links.
Dual and multiple token based approaches for load balancing
Authors: Parag Kulkarni, Indranil SenGupta
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

In distributed systems uneven arrivals of the tasks may overload a few hosts while some of the hosts may be lightly loaded. This load imbalance prevents distributed systems from delivering its performance to its capacity. Load balancing has been advocated as a means of improving performance and reliability of distributed systems. We propose a distributed load balancing algorithm LoGTra to deal with this problem. LoGTra uses load graph and token based policy. The extensions to LoGTra based on dual tokens DTLB and multiple tokens m-LoGTra are proposed in this paper. m-LoGTra allows host to generate multiple tokens. This allows system to search host for load balancing in multiple directions and can avoid starvation of remote hosts. Local maxima and local minima are responsible for initiating transfer and that limits the number of hosts generating tokens at a time. As overheads are kept under control by limiting number of tokens, the algorithm promises for improved performance.