ppxscal/embedding_network huggingface dataset:
Three-dimensional anisotropic mesh adaptation for phase change problems
Authors: Youssef Belhamadia, André Fortin, Éric Chamberland
Venue: Journal of Computational Physics (2004)

A three-dimensional adaptive strategy for the finite element simulation of phase change problems is presented, discussed and validated. A semi-phase-field formulation is used for the solution of the Stefan problem. The adaptive method is based on the definition of edge length using a solution dependent metric and produces strongly anisotropic meshes. Numerical results illustrating the performance and accuracy of the proposed method are presented.
Scheduling of MPI-2 One Sided Operations over InfiniBand
Authors: Wei Huang, Gopalakrishnan Santhanaraman, Hyun-Wook Jin, Dhabaleswar K. Panda
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 9 - Volume 10 (2005)

MPI-2 provides interfaces for one sided communication, which is becoming increasingly important in scientific applications. MPI-2 semantics provide the flexibility to reorder the one sided operations within an access epoch. Based on this flexibility, in this paper we try to improve the performance of one sided communication by scheduling one sided operations. We have come up with several re-ordering and aggregating schemes to achieve better network utilization. We have evaluated these schemes on both PCI-X and PCI-Express platforms. With re-ordering scheme, we see an improvement in the throughput up to 76%, latency up to 40%. With aggregation scheme, we observe an improvement of 44% and 42% for MPI_Put and MPI_Get latency respectively on PCI-Express platform.
Tri-view morphing
Authors: Jiangjian Xiao, Mubarak Shah
Venue: Computer Vision and Image Understanding (2004)

This paper presents an efficient image-based approach to navigate a scene based on only three wide-baseline uncalibrated images without the explicit use of a 3D model. After automatically recovering corresponding points between each pair of images, an accurate trifocal plane is extracted from the trifocal tensor of these three images. Next, based on a small number of feature marks using a friendly GUI, the correct dense disparity maps are obtained by using our trinocular-stereo algorithm. Employing the barycentric warping scheme with the computed disparity, we can generate an arbitrary novel view within a triangle spanned by three camera centers. Furthermore, after self-calibration of the cameras, 3D objects can be correctly augmented into the virtual environment synthesized by the tri-view morphing algorithm. Three applications of the tri-view morphing algorithm are demonstrated. The first one is 4D video synthesis, which can be used to fill in the gap between a few sparsely located video cameras to synthetically generate a video from a virtual moving camera. This synthetic camera can be used to view the dynamic scene from a novel view instead of the original static camera views. The second application is multiple view morphing, where we can seamlessly fly through the scene over a 2D space constructed by more than three cameras. The last one is dynamic scene synthesis using three still images, where several rigid objects may move in any orientation or direction. After segmenting three reference frames into several layers, the novel views in the dynamic scene can be generated by applying our algorithm. Finally, the experiments are presented to illustrate that a series of photo-realistic virtual views can be generated to fly through a virtual environment covered by several static cameras.
Using a hybrid method for accessing broadcast data
Authors: Xu Yang, Athman Bouguettaya
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Broadcasting is an important means of data dissemination in wireless environments. Data access methods are used to provide power efficient access to broadcast channels. In this paper, we propose a hybrid data access method which is built on the combination of an existing index tree based data access method and hashing techniques. Cost models are derived for the proposed method. Simulation experiments are also conducted to compare the hybrid method with the index tree based methods. We show that under a range of parameters the hybrid method exhibits better performance over the index tree based methods.
Base Noun Phrase translation using web data and the EM algorithm
Authors: Yunbo Cao, Hang Li
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

We consider here the problem of Base Noun Phrase translation. We propose a new method to perform the task. For a given Base NP, we first search its translation candidates from the web. We next determine the possible translation(s) from among the candidates using one of the two methods that we have developed. In one method, we employ an ensemble of Na&iuml;ve Bayesian Classifiers constructed with the EM Algorithm. In the other method, we use TF-IDF vectors also constructed with the EM Algorithm. Experimental results indicate that the coverage and accuracy of our method are significantly better than those of the baseline methods relying on existing technologies.
Supplementary terminology for nonlinear iterative methods
Authors: J. E. Dennis, R. A. Tapia
Venue: ACM SIGNUM Newsletter (1976)

The purpose of this note is to suggest a supplement to the terminology of [7] and [9] for nonlinear iterative methods for solving F(x) = 0. We feel such a supplement is needed because it is now clear that the so-called <u>quasi-Newton</u> [1], or <u>variable metric</u> [2], or <u>modification</u> [7] methods are here to stay. Furthermore, the current working terminology for these methods is separate, non-standard and not sufficiently suggestive of their proper place in an overview of nonlinear iterative methods. This is borne out by the comments one always encounters when explaining the subject to the uninitiated. One explanation for this dilemma could be that these methods have essentially arrived after the last systematic attempt to standardize nomenclature [7].
Refereeing and the single author
Authors: James Hartley
Venue: Journal of Information Science (2005)

The reported refereeing times taken from submission to acceptance for psychology journal articles were assessed in three separate studies, and the results then pooled. The pooled data suggested (i) that the papers of single authors were refereed faster than were those of pairs or larger groups, and (ii) that the papers of single authors that contained portions that had previously been delivered at conferences were refereed fastest of all. Some limitations of these studies that might have a bearing on these conclusions are considered.
Comments on Competitive Responsiveness
Authors: Steven M. Shugan
Venue: Marketing Science (2005)

Marketing Science features many and diverse articles that analyze competitive responsiveness. Although recentMarketing Science editorials (e.g., Shugan 2002) suggest that competitive responsiveness is only a part of a comprehensive competitive marketing strategy, it remains a vital part. For that reason and many others,Marketing Science is particularly proud of this special issue edited by David J. Reibstein and Dick R. Wittink.Before introducing and vigorously applauding both the editors and authors of this excellent special issue, we emphasize that competitive responsiveness raises numerous issues, including whether one can forecast outcomes of new policies based on past observations made under old policies (i.e., the Lucas critique) and decisions regarding which variables should be considered endogenous (Shugan 2004), i.e., determined within the model.Perhaps, normative models are inherently perishable--evolution in market structure requires modifications over time. Also, although complete consistency within the world of the model is aesthetically pleasing, imposing industry-specific exogenous constraints (that might appear unrelated to the modeling assumptions) is sometimes necessary.
An overview of methods for determining OWA weights: Research Articles
Authors: Zeshui Xu
Venue: International Journal of Intelligent Systems (2005)

The ordered weighted aggregation (OWA) operator has received more and more attention since its appearance. One key point in the OWA operator is to determine its associated weights. In this article, I first briefly review existing main methods for determining the weights associated with the OWA operator, and then, motivated by the idea of normal distribution, I develop a novel practical method for obtaining the OWA weights, which is distinctly different from the existing ones. The method can relieve the influence of unfair arguments on the decision results by weighting these arguments with small values. Some of its desirable properties have also been investigated. &copy; 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 843&ndash;865, 2005.
The early history of Smalltalk
Authors: Alan C. Kay
Venue: History of programming languages---II (1996)

Most ideas come from previous ideas. The sixties, particularly in the ARPA community, gave rise to a host of notions about "human-computer symbiosis" through interactive time-shared computers, graphics screens, and pointing devices. Advanced computer languages were invented to simulate complex systems such as oil refineries and semi-intelligent behavior. The soon to follow paradigm shift of modern personal computing, overlapping window interfaces, and object-oriented design came from seeing the work of the sixties as something more than a "better old thing." That is, more than a better way: to do mainframe computing; for end-users to invoke functionality; to make data structures more abstract. Instead the promise of exponential growth in computing/$/volume demanded that the sixties be regarded as "almost a new thing" and to find out what the actual "new things" might be. For example, one would compute with a handheld "Dynabook" in a way that would not be possible on a shared main-frame; millions of potential users meant that the user interface would have to become a learning environment along the lines of Montessori and Bruner; and needs for large scope, reduction in complexity, and end-user literacy would require that data and control structures be done away with in favor of a more biological scheme of protected universal cells interacting only through messages that could mimic any desired behavior.Early Smalltalk was the first complete realization of these new points of view as parented by its many predecessors in hardware, language, and user interface design. It became the exemplar of the new computing, in part, because we were actually trying for a qualitative shift in belief structures---a new Kuhnian paradigm in the same spirit as the invention of the printing press---and thus took highly extreme positions that almost forced these new styles to be invented.
Tangible social interfaces: critical theory, boundary objects and interdisciplinary design methods
Authors: Pamela Jennings
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The Constructed Narratives project has been designed for use in public spaces where there is the opportunity for individuals and groups of people, who are not acquainted with each other, to encounter the game and subsequently each other. The goal is to provide a platform that supports discourse in environments where "keeping comfortable distance" between oneself and others is the norm. The system framework developed for this project can be applied for use in computer supported collaborative learning (CSCL), and collaborative design activities in the tradition of computer supported collaborative work (CSCW). The current domain explored in the Constructed Narratives project is computer systems designed to enable shared experience through play, or computer supported collaborative play (CSCP). This paper examines the theories that influenced and design methodologies used by an interdisciplinary team of artists, designers and technologists used to develop solutions for multiple wicked design problems that can arise during the development of the system architecture for a tangible social interface.
Motor Skill Training Assistance Using Haptic Attributes
Authors: Govindarajan Srimathveeravalli, Kesavadas Thenkurussi
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper we describe our efforts to develop a new strategy for providing assistance using haptics in a virtual environment when training for a motor skill. Using a record and play strategy, the proposed assistance method will provide closest possible replication of expertýs skill. We have defined a new paradigm called "Haptic Attributes" where we relate a unique haptic force profile to every task performed using motor skills. This has been combined with an earlier concept called Sympathetic Haptic to develop a new paradigm in training complex skill based tasks such as writing, surgery or playing musical instruments. As a demonstration, a virtual environment that can be used for training handwriting was designed and implemented. Position based feedback assistance and training with no assistance were tested against our method in a series of human subject tests. Results prove our method to be superior to training methods tested which use position based or no assistance.
Panoramic view system for extracting key sentences based on viewpoints and application to a search engine
Authors: Wataru Sunayama, Masahiko Yachida
Venue: Journal of Network and Computer Applications (2005)

The many resources on the World Wide Web have made it natural for us to extract available information from them. In order to get useful information, it is desirable to review many sources. Though summaries are useful, documents contain various viewpoints that should be summarized. Therefore, if the viewpoint of a summary is different from the user's, the user cannot grasp the contents of the document correctly, and the user has to read through the document to the end. In this paper, we present a system that summarizes a document based on a user's viewpoint according to the user's search keywords.
Finite Field Elements with Specified Order and Traces
Authors: Stephen D. Cohen
Venue: Designs, Codes and Cryptography (2005)

Results of F. Özbudak on the existence of elements in a finite extension of a finite field with specified order and at which given rational functions have specified traces over the ground field are obtained by the method of character sums. There are significant applications to the construction of ordered arrays.
Information-based nonlinear approximation: an average case setting
Authors: Mark Kon, Leszek Plaskota
Venue: Journal of Complexity (2005)

Nonlinear approximation (NA) has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partial information, e.g., function values at some points, and we are interested in the average case error and complexity of NA. We show that the problem can be essentially decomposed in two independent problems related to average case nonlinear (restricted) approximation from complete information, and to average case unrestricted approximation from partial information. The results are then applied to average case piecewise polynomial approximation on C([0, 1]) based on function values with respect to r-fold Wiener measure. In this case, to approximate with error ε it is necessary and sufficient to know the function values at Θ ((ε-1In1/2(1/ε))1/(r+1/2)) equidistant points and use Θ (ε-1/(r+1/2)) adaptively chosen break points in piecewise polynomial approximation.
A formal language-based approach in biology: Conference Reviews
Authors: Marian Gheorghe, Victor Mitrana
Venue: Comparative and Functional Genomics (2004)

This paper presents an overview of computational biology approaches and surveys some of the natural computing models using, in both cases, a formal language-based approach. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Summary of workshop on lexicons for text extraction
Authors: James Pustejovsky
Venue: Proceedings of the 5th conference on Message understanding (1993)

This workshop discussed the problems with lexicon development in the context of MUC-style application programs. The topics ranged from general issues in lexicon portability (Cahill), to Japanese lexicons (Mauldin) and problems encountered with MRDs in sublanguage domains (Pustejovsky).
Review of "Linear Optimization and Extensions -- Problems and Solutions by Dimitris Alevas and Manfred Padberg", Springer-Verlag, 450 pages, $54.95
Authors: Carlos A. S. Oliveira
Venue: ACM SIGACT News (2004)

Linear Optimization and Extensions -- Problems and Solutions - is a solution manual for another book, released in 2000, by the second author [1]. The original book is a comprehensive introduction to the topics of linear programming and combinatorial optimization. The current book, therefore, has the initial goal of providing hints, and solutions for the problems there stated.
Computation of exact confidence intervals from discrete data using studentized test statistics
Authors: Paul Kabaila
Venue: Statistics and Computing (2005)

A new area of research interest is the computation of exact confidence limits or intervals for a scalar parameter of interest ¿ from discrete data by inverting a hypothesis test based on a studentized test statistic. See, for example, Chan and Zhang (1999), Agresti and Min (2001) and Agresti (2003) who deal with ¿ a difference of binomial probabilities and Agresti and Min (2002) who deal with ¿ an odds ratio. However, neither (1) a detailed analysis of the computational issues involved nor (2) a reliable method of computation that deals effectively with these issues is currently available. In this paper we solve these two problems for a very broad class of discrete data models. We suppose that the distribution of the data is determined by (¿,¿) where ¿ is a nuisance parameter vector. We also consider six different studentized test statistics. Our contributions to (1) are as follows. We show that the P-value resulting from the hypothesis test, considered as a function of the null-hypothesized value of ¿, has both "jump" and "drop" discontinuities. Numerical examples are used to demonstrate that these discontinuities lead to the failure of simple-minded approaches to the computation of the confidence limit or interval. We also provide a new method for efficiently computing the set of all possible locations of these discontinuities. Our contribution to (2) is to provide a new and reliable method of computing the confidence limit or interval, based on the knowledge of this set.
Unsupervised Learning in Radiology Using Novel Latent Variable Models
Authors: Luke Carrivick, Sanjay Prabhu, Paul Goddard, Jonathan Rossiter
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper we compare a variety of unsupervised probabilistic models used to represent a data set consisting of textual and image information. We show that those based on Latent Dirichlet Allocation (LDA) out perform traditional mixture models in likelihood comparison. The data set is taken from radiology; a combination of medical images and consultants reports. The task of learning to classify individual tissue, or disease types, requires expert hand labeled data. This is both: expensive to produce and prone to inconsistencies in labeling. Here we present methods that require no hand labeling and also automatically discover sub-types of disease. The learnt models can be used for both prediction and classification of new unseen data.
Robotic cell scheduling with operational flexibility
Authors: M. Selim Akturk, Hakan Gultekin, Oya Ekin Karasan
Venue: Discrete Applied Mathematics (2005)

In this paper, we study the problem of two-machine, identical parts robotic cell scheduling with operational flexibility. We assume that every part to be processed has a number of operations to be completed in these two machines and both machines are capable of performing all of the operations. The decision to be made includes finding the optimal robot move cycle and the corresponding optimal allocation of operations to these two machines that jointly minimize the cycle time. We prove that with this definition of the problem 1-unit robot move cycles are no longer necessarily optimal and that according to the given parameters either one of the 1-unit robot move cycles or a 2-unit robot move cycle is optimal. The regions of optimality are presented.
ASIC Implementation of a Unified Hardware Architecture for Non-Key Based Cryptographic Hash Primitives
Authors: T. S. Ganesh, T. S. B. Sudarshan
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Hash algorithms are a class of cryptographic primitives used for fulfilling the requirements of integrity and authentication in cryptography. In this paper, we propose and present the ASIC implementation of 'HashChip', a hardware architecture aimed at providing a unified solution for three different commercial MDC (Manipulation Detection Codes) hash primitives, namely MD5, SHA1 and RIPEMD160. The novelty of the work lies in the exploitation of the similarities in the structure of the three algorithms to obtain an optimized architecture. The performance analysis of a 0.18µ ASIC implementation of the architecture has also been done.
High-performance ULSI: the real limiter to interconnect scaling
Authors: Ron Ho
Venue: Proceedings of the 2005 international workshop on System level interconnect prediction (2005)

In a classic paper at the 1995 IEEE Electron Devices Meeting, Mark Bohr outlined how interconnect scaling --- specifically, resistance scaling --- will ultimately limit the performance of future ULSI circuits [1]. Looking ahead, we see the reverse: constraints imposed by high-performance VLSI systems will limit how we can design and scale wires.In the ten years since, Bohr's prediction has been borne out by the vast efforts of designers to overcome wire RC delay. Tactics such as inserting repeaters, predicting wire routing and integrating optics have all been analyzed, published, and sometimes even used. As a result, wire latency is manageable using repeaters and wire bandwidth is unparalleled, though wire power can be a problem.However, two important trends in high-performance systems will affect our ability to scale on-chip wire latency and bandwidth. First, VLSI complexity and design costs will increasingly push designers towards modular systems such as multi-core architectures. Second, power density trends stemming from flat voltage scaling constrain how many of our transistors we can use at once, again leading to machines built from selectively-enabled modular units.Such systems present different challenges to on-chip wiring and scaling its latency, power, and bandwidth. Recent work in three-dimensional integration shows promise in these areas but creates problems with system assembly. We will examine characteristics and trends of on-chip interconnects and discuss Proximity Communication, a wireless chip-to-chip communication technology.