ppxscal/embedding_network huggingface dataset:
What Can Programmer Questions Tell Us About Frameworks?
Authors: Daqing Hou, Kenny Wong, H. James Hoover
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

In order to make frameworks easier to use we need to better understand the difficulties that programmers have with them. The questions that programmers ask give clues to the quality of design, documentation, and programmer practice We describe the method and results of a study on the Java Swing framework. We collected and analyzed a sample of 300 newsgroup questions asked about two Swing components (JButton and JTree), and classified the questions according to the design features of the components. This process revealed key insights that can improve a framework's design, its tutorials, and programmer practice.
Performance Comparison of MPI Implementations over InfiniBand, Myrinet and Quadrics
Authors: Jiuxing Liu, Balasubramanian Chandrasekaran, Jiesheng Wu, Weihang Jiang, Sushmitha Kini, Weikuan Yu, Darius Buntinas, Peter Wyckoff, D K. Panda
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

In this paper, we present a comprehensive performance comparison of MPI implementations over Infini-Band, Myrinet and Quadrics. Our performance evaluation consists of two major parts. The first part consists of a set of MPI level micro-benchmarks that characterize different aspects of MPI implementations. The second part of the performance evaluation consists of application level benchmarks. We have used the NAS Parallel Benchmarks and the sweep3D benchmark. We not only present the overall performance results, but also relate application communication characteristics to the information we acquired from the micro-benchmarks. Our results show that the three MPI implementations all have their advantages and disadvantages. For our 8-node cluster, InfiniBand can offer significant performance improvements for a number of applications compared with Myrinet and Quadrics when using the PCI-X bus. Even with just the PCI bus, InfiniBand can still perform better if the applications are bandwidth-bound.
The Open Runtime Platform: a flexible high-performance managed runtime environment: Research Articles
Authors: Michal Cierniak, Marsha Eng, Neal Glew, Brian Lewis, James Stichnoth
Venue: Concurrency and Computation: Practice Experience (2005)

The Open Runtime Platform (ORP) is a high-performance managed runtime environment (MRTE) that features exact generational garbage collection, fast thread synchronization, and multiple coexisting just-in-time compilers (JITs). ORP was designed for flexibility in order to support experiments in dynamic compilation, garbage collection, synchronization, and other technologies. It can be built to run either Java or Common Language Infrastructure (CLI) applications, to run under the Windows or Linux operating systems, and to run on the IA-32 or Itanium processor family (IPF) architectures. Achieving high performance in a MRTE presents many challenges, particularly when flexibility is a major goal. First, to enable the use of different garbage collectors and JITs, each component must be isolated from the rest of the environment through a well-defined software interface. Without careful attention, this isolation could easily harm performance. Second, MRTEs have correctness and safety requirements that traditional languages such as C++ lack. These requirements, including null pointer checks, array bounds checks, and type checks, impose additional runtime overhead. Finally, the dynamic nature of MRTEs makes some traditional compiler optimizations, such as devirtualization of method calls, more difficult to implement or more limited in applicability. To get full performance, JITs and the core virtual machine (VM) must cooperate to reduce or eliminate (where possible) these MRTE-specific overheads. In this paper, we describe the structure of ORP in detail, paying particular attention to how it supports flexibility while preserving high performance. We describe the interfaces between the garbage collector, the JIT, and the core VM; how these interfaces enable multiple garbage collectors and JITs without sacrificing performance; and how they allow the JIT and the core VM to reduce or eliminate MRTE-specific performance issues. Copyright &copy; 2005 John Wiley & Sons, Ltd.An earlier version of this paper was published online [1].
Fault hamiltonicity of augmented cubes
Authors: Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu
Venue: Parallel Computing (2005)

In this paper, we consider the fault hamiltonicity and the fault hamiltonian connectivity of the augmented cubes AQ"n. Assume that F@?V(AQ"n)@?E(AQ"n) and n>=4. We prove that AQ"n-F is hamiltonian if |F|=
Review of "Artificial Intelligence: An MIT Perspective, Volume 2: Understanding Vision, Manipulation, Computer Design, Symbol Manipulation by Patrick Henry Winston and Richard Henry Brown"; The MIT Press, Cambridge, Massachusetts, Second printing, 1980, ISBN 0-262-23097-6.
Authors: Varol Akman
Venue: Issue 85 (July 1983) (1983)

Artificial Intelligence: An MIT Perspective consists of two volumes. In my previous review of Volume I (which has sections on Expert Problem Solving, Natural Language Understanding, Intelligent Computer Coaches, and Representation and Learning) I evaluated this set from a general perspective. For brevity, I will not repeat my comments here. Instead, I refer the reader who has not seen the first part of this article to the preceding issue of the Sigart Newsletter. Nevertheless, for the anxious reader I present my point of view concisely: These two volumes make up an excellent set of references and belong to the library of every serious Al researcher.
Parallel algorithms of the scanning mask method for primary images processing
Authors: Atanaska Bosakova-Ardenska, Naiden Vasilev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper discusses the possibility of parallel images processing. It proposes several parallel algorithms for primary processing of grey and colour images by method of scanning mask. An evaluation of proposed algorithms has been made here.
Bisectored unit disk graphs
Venue: Networks (2004)

Unit disk graphs form a natural model for cellular radio channel assignment problems under the assumption of equally powerful, omnidirectional transmitters located on a uniform, flat plane. Here, we introduce and give motivation for an extension of this model, namely, sectorization at transmitter sites. We define and analyze properties of one case of sectorization, bisectored unit disk graphs, in particular, investigating properties concerning their chromatic number. Finally, we provide some experimental evidence to draw comparisons between graphs of this model and other classes of graphs. &copy; 2004 Wiley Periodicals, Inc.
Shape and size regularization in expectation maximization and fuzzy clustering
Authors: Christian Borgelt, Rudolf Kruse
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

The more sophisticated fuzzy clustering algorithms, like the Gustafson-Kessel algorithm [11] and the fuzzy maximum likelihood estimation (FMLE) algorithm [10] offer the possibility of inducing clusters of ellipsoidal shape and different sizes. The same holds for the EM algorithm for a mixture of Gaussians. However, these additional degrees of freedom often reduce the robustness of the algorithm, thus sometimes rendering their application problematic. In this paper we suggest shape and size regularization methods that handle this problem effectively.
A Behavioral Model Based on Meme and Qualia for Multi-Agent Social Behavior
Authors: Yusuke Mizuno, Shohei Kato, Atsuko Mutoh, Hidenori Itoh
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, we propose a new behavioral model based on the concept of "meme" and "qualia" for multi-agent system. We, then, implement the model, and perform multi-agent simulations of cultural transmission. In the simulations, we construct an artificial society, where agents behave for food objects collectively. An agent transmits meme, the object to eat and its preference as a culture, to other agents. As the results of the simulations, we have observed some cultural transmissions in the artificial society.
Principles of Fusion of Inertial Navigation and Dynamic Vision
Authors: Stevica Graovac
Venue: Journal of Robotic Systems (2004)

The possibility of fusion of navigation data obtained by two separate navigation systems (strap-down inertial one and dynamic vision based one) is considered in this paper. The attention is primarily focused on principles of validation of separate estimates before their use in a combined algorithm. The inertial navigation system (INS) based on sensors of medium level quality has been analyzed on one side, while a visual navigation method is based on the analysis of a sequence of images of ground landmarks produced by an on-board TV camera. The accuracy of INS estimations is being improved continuously by optimal estimation of a flying object's angular orientation while the visual navigation system offers discrete corrections during the intervals of presence of landmarks inside the camera's field of view. The concept is illustrated by dynamic simulation of a realistic flight scenario. &copy; 2004 Wiley Periodicals, Inc.
Integer sets with prescribed pairwise differences being distinct
Authors: Béla Bollobás, Oleg Pikhurko
Venue: European Journal of Combinatorics (2005)

We label the vertices of a given graph G with positive integers so that the pairwise differences over its edges are all distinct. Let D(G) be the smallest value that the largest label can have.For example, for the complete graph Kn, the labels must form a Sidon set. Hence, D(Kn) = (1 + o(1))n2. Rather surprisingly, we demonstrate that there are graphs with only n3/2 + o(1) edges achieving this bound.More generally, we study the maximum value of D(G) that a graph G of the given order n and size m can have. We obtain bounds which are sharp up to a logarithmic multiplicative factor. The analogous problem for pairwise sums is considered as well. Our results, in particular, disprove a conjecture of Wood.
Vector quantization algorithms for one-dimensional and two-dimensional time series
Authors: Svetla Radeva, Dimitar Radev, Vladimir Yakov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The purpose of this investigation is determining the parameters of non-stationary models for different kind of non-stationary processes. With the help of neural network and vector quantization is suggested an approach for modelling one-dimensional and two-dimensional time series. The parameters of vector quantization are determined for describing probability density function. Programs on MATLAB 6.5 and Visual C++ were created for modelling of time series and receiving their probability density function. These models can be used for describing and analyses the seismic waves behaviour, for queuing models in communication systems and for different kind of models of time series with long-range dependences.
Proceedings of the 15th ACM Great Lakes symposium on VLSI
Venue: Great Lakes Symposium on VLSI (2005)

We would like to welcome you to Chicago for the 2005 Great Lakes Symposium on VLSI! This is the 15th edition of GLSVLSI and marks a return to the Great Lakes after successful conferences in New York City, Washington D.C., and Boston over the last three years. During this time, GLSVLSI has expanded into an international conference with submissions from all over the United States and the world. It has emerged as a premier conference for publishing innovations in VLSI.GLSVLSI continues to grow, as does the quality of the submissions and the resulting technical program. 239 papers were submitted this year (up 350% from 2002), of which 102 were accepted for presentation at the Symposium and publication in the proceedings. 22 papers will be presented as regular presentations, 32 as short presentations, and 48 as poster presentations.Congratulations to Mikhail Popovich, Eby G. Friedman, Michael Sotman, and Avinoam Kolodny for receiving the GLSVLSI 2005 Best Student Paper Award! Their paper "On-Chip Power Distribution Grids with Multiple Supply Voltages for High Performance Integrated Circuits" will be the first presentation of the conference. As first author, Mikhail Popovich will be awarded the prize from Intel.This year's tutorial is on "Variability Modeling and Variability-Aware Design in Deep Submicron Integrated Circuits" and will be conducted by Florentin Dartu (Intel), Anirudh Devgan (IBM), and Noel Menezes (Intel).A keynote presentation will be given during Monday's dinner banquet by Vida Ilderem, Vice President and Director of the Center of Excellence for Embedded Systems and Physical Sciences Research at Motorola Labs. Dr. Ilderem will present her vision for "Research and Development for Seamless Mobility."For the first time this year, GLSVLSI will hold a student/company recruiting session. Following the last technical sessions on Monday afternoon, representatives from various companies will be available to visit with student attendees about job and internship opportunities.
Web accessibility for people with cognitive disabilities
Authors: Jeon Small, Pamela Schallau, Karen Brown, Richard Appleyard
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This pilot study investigated individuals with developmental cognitive disabilities (DCD) navigating W3C accessibility-compliant Web sites and the impact of four cognitive determinants: situation awareness, spatial awareness, task-set switching, and anticipated system response. Participants were placed into one of two search conditions and were asked to complete information-finding tasks. The usability evaluation demonstrated that the majority of users with DCD were able to access the Web but they were unable to successfully use the W3C accessibility-compliant Web sites/. The use of navigation aids was examined, different Web navigation problems were identified as well as user satisfaction and perceived usability. It is clear from this study that current Web accessibility guidelines do not sufficiently address the needs of people with cognitive disabilities. Additional research is needed to understand how cognitive disabilities affect using Web-based media.
Description of the UMass system as used for MUC-6
Authors: David Fisher, Stephen Soderland, Fangfang Feng, Wendy Lehnert
Venue: Proceedings of the 6th conference on Message understanding (1995)

Information extraction research at the University of Massachusetts is based on portable, trainable language processing components. Some components are more effective than others, some have been under development longer than others, but in all cases, we are working to eliminate manual knowledge engineering. Although UMass has participated in previous MUC evaluations, all of our information extraction software has been redesigned and rewritten since MUC-5, so we are evaluating a completely new system this year.
Numerical mathematics at Boeing computer services
Authors: J. L. Phillips, W. G. Poole
Venue: ACM SIGNUM Newsletter (1982)

The Energy Technology Applications (ETA) Division of Boeing Computer Services consists of over 200 professionals providing analytical and computing support to The Boeing Company and government and private industry, with particular emphasis on the energy industry. The Mathematics and Modeling staff in ETA, headed by A1 Erisman, includes over 90 mathematicians, statisticians, engineers, and physicists engaged in statistical modeling and applications, operations research, optimization, dynamic simulation, stochastic modeling, mathematical physics, and numerical analysis.
BondFlow: A System for Distributed Coordination of Workflows over Web Services
Authors: Janaka Balasooriya, Mohini Padhye, Sushil K. Prasad, Shamkant B. Navathe
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02 (2005)

Today's collaborative applications over the web span domains as diverse as enterprise e-commerce applications and biomedical applications. We have previously developed and formally investigated "Web Coordination Bonds," a theoretically powerful artifact for interconnecting autonomous web objects for control and data flows, and for enforcing dependencies. Here, we describe BondFlow, a system that enables the configuration and execution of workflows using web bonds over heterogeneous web objects. The system automatically generates lightweight proxy wrapper objects to enable encapsulated web services to be interconnected through web bonds. The small footprint wrappers (less than 10 KB) can reside on Java-enabled handheld devices. We describe the design, architecture and performance of the Bond-Flow system. Our initial performance results indicate that both wrapper creation time and web bond related execution time are small. In contrast to our BondFlow system, existing systems need expert programming to create workflows, do not easily allow distributed coordination of workflows, and usually do not support heterogeneity of device, data and network. The system is preliminary, and further research is ongoing to extend its configuration and execution platforms.
A multi-dimensional fuzzy decision support strategy
Authors: Qimi Jiang, Chun-Hsien Chen
Venue: Decision Support Systems (2005)

Based on the theory of fuzzy pattern recognition and fuzzy optimization, this paper presents a kind of multi-dimensional fuzzy decision support strategy for multi-objective and multi-layer fuzzy decision support systems. Compared with conventional strategies of fuzzy optimization that just considers the relative membership uj of decision j of down layer unit systems, this strategy also takes the relative bad membership ubj= 1 -- uj as the input of up layer unit systems. Besides, unlike conventional strategies of fuzzy optimization, this strategy can provide multi-dimensional information to the decision-maker. With these advantages, this strategy founds a new theoretical basis for the multi-dimensional decision making of large systems.
A Compiler Analysis of Interprocedural Data Communication
Authors: Yonghua Ding, Zhiyuan Li
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

This paper presents a compiler analysis for data communication for the purpose of transforming ordinary programs into ones that run on distributed systems. Such transformations have been used for process migration and computation offloading to improve the performance of mobile computing devices. In a client-server distributed environment, the efficiency of an application can be improved by careful partitioning of tasks between the server and the client. Optimal task partitioning depends on the tradeoff between the computation workload and the communication cost. Our compiler analysis, assisted by a minimum set of user assertions, estimates the amount of data communication between procedures. The paper also presents experimental results based on an implementation in the GCC compiler. The static estimates for several multimedia programs are compared against dynamic measurement performed using Shade, a SUN Microsystem's instruction-level simulator. The results show a high precision of the static analysis for most pairs of the procedures.
Parallel Strategies for Local Biological Sequence Alignment in a Cluster of Workstations
Authors: Azzedine Boukerche, Alba Cristina Magalhaes Alves de Melo, Mauricio Ayala-Rincon, Thomas Mailleux Santana
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

Sequence comparison is a basic operation in DNA sequencing projects, and most of sequence comparison methods used are based on heuristics, which are faster but there are no guarantees that the best alignments will be produced. On the other hand, the algorithm proposed by Smith-Waterman obtains the best local alignments at the expense of very high computing power and huge memory requirements. In this article, we present and evaluate our experiments with three strategies to run the Smith-Waterman algorithm in a cluster of workstations using a Distributed Shared Memory System. Our results on an eight-machine cluster presented very good speedups and indicate that impressive improvements can be achieved, depending on the strategy used. Also, we present some theoretical remarks on how to reduce the amount of memory used.
Spatial temporal adaptive direct mode coding on bidirectional motion compensation prediction
Authors: Hideaki Kimata, Masaki Kitahara, Yoshiyuki Yashima
Venue: Systems and Computers in Japan (2004)

Although bidirectional motion compensation reduces the coding distortion of a predictive image and improves prediction efficiency, the information indicating the spatial and temporal position of the predictive image is overhead and consumes more bits. Consequently, the coding efficiency is not always improved. The direct mode is widely used to improve coding efficiency with small overhead since it calculates the motion vectors of bidirectional prediction using the time continuity of motion. Such an improvement in prediction efficiency, however, is not achieved when the time continuity of motion does not exist. Therefore, the efficiency is highly dependent on the contents of a sequence. In this paper, we propose a spatial temporal adaptive direct mode, which is efficient even when there is no time continuity of motion. In this method, the time continuity of motion is predicted from the coding states of spatially or temporally adjacent blocks, and either a temporal direct mode or a spatial prediction mode is chosen as the coding mode. The spatial prediction mode calculates the motion vectors and the prediction direction from the motion vectors of the spatially adjacent blocks. This paper discusses the problem of the conventional direct mode, and proposes its solution. The results of computer simulations prove that this solution method can select the appropriate coding mode adaptively for the contents of a sequence, thus achieving high coding efficiency. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(14): 1&ndash;9, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20126