ppxscal/embedding_network huggingface dataset:
A QMC approach for high dimensional Fokker-Planck equations modelling polymeric liquids
Authors: G. Venkiteswaran, M. Junk
Venue: Mathematics and Computers in Simulation (2005)

A classical model used in the study of dynamics of polymeric liquids is the bead-spring chain representation of polymer molecules. The chain typically consists of a large number of beads and thus the state space V of its configuration, which is essentially the position of all the constituent beads, turns out to be high dimensional. The distribution function governing the configuration of a bead-spring chain undergoing shear flow is a Fokker-Planck equation on V. In this article, we present QMC methods for the approximate solution of the Fokker-Planck equation which are based on the time splitting technique to treat convection and diffusion separately. Convection is carried out by moving the particles along the characteristics and we apply the algorithms presented in [G. Venkiteswaran, M. Junk, QMC algorithms for diffusion equations in high dimensions, Math. Comput. Simul. 68 (2005) 23-41.] for diffusion. Altogether, we find that some of the QMC methods show reduced variance and thus slightly outperform standard MC.
The method of successive approximations for calculating the probability of bankruptcy of a risk process in a Markovian environment
Authors: B. V. Norkin
Venue: Cybernetics and Systems Analysis (2005)

A generalized model of a classical risk process describing the evolution of the capital of an insurance company in a random environment is considered. A system of integral equations for the bankruptcy probability if a function of initial state. The possibility of applying the method of successive approximation to solve the system is analyzed. The method generates approximations that converge from above and below to the solution.
Topic tracking using subject templates and clustering positive training instances
Authors: Yoshimi Suzuki, Fumiyo Fukumoto, Yoshihiro Sekiguchi
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

Topic tracking, which starts from a few sample stories and finds all subsequent stories that discuss the same topic, is a new challenge for the text categorization task and is useful for timeline-based IR systems. Much previous research on topic tracking use machine learning techniques. However, the small size of the training data, especially positive training stories, presents difficulties in training the parameters of the topic tracking system to produce optimal results. In this paper, we present a method for topic tracking using subject templates and <u>k</u>-means clustering algorithm to select a suitable training set. The method was tested on the TDT1 corpus, and the result shows the effectiveness of the method.
Error-resilient transmission of 3D models
Authors: Ghassan Alregib, Yucel Altunbasak, Jarek Rossignac
Venue: ACM Transactions on Graphics (TOG) (2005)

In this article, we propose an error-resilient transmission method for progressively compressed 3D models. The proposed method is scalable with respect to both channel bandwidth and channel packet-loss rate. We jointly design source and channel coders using a statistical measure that (i) calculates the number of both source and channel coding bits, and (ii) distributes the channel coding bits among the transmitted refinement levels in order to maximize the expected decoded model quality. In order to keep the total number of bits before and after applying error protection the same, we transmit fewer triangles in the latter case to accommodate the channel coding bits. When the proposed method is used to transmit a typical model over a channel with a 10&percnt; packet-loss rate, the distortion (measured using the Hausdorff distance between the original and the decoded models) is reduced by 50&percnt; compared to the case when no error protection is applied.
Shared lexicon for distributed annotations on the Web
Authors: Paolo Avesani, Marco Cova
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

The interoperability among distributed and autonomous systems is the ultimate challenge facing the semantic web. Heterogeneity of data representation is the main source of problems. This paper proposes an innovative solution that combines lexical approaches and language games. The benefits for distributed annotation systems on the web are twofold: firstly, it will reduce the complexity of the semantic problem by moving the focus from the full-featured ontology level to the simpler lexicon level; secondly, it will avoid the drawback of a centralized third party mediator that may become a single point of failure.The main contributions of this work are concerned with: providing a proof of concept that language games can be an effective solution to creating and managing a distributed process of agreement on a shared lexicon,describing a fully distributed service oriented architecture for language games,providing empirical evidence on a real world case study in the domain of ski mountaineering.
Illumination Normalization for Face Recognition and Uneven Background Correction Using Total Variation Based Image Models
Authors: Terrence Chen, Wotao Yin, Xiang Sean Zhou, Dorin Comaniciu, Thomas S. Huang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present a new algorithm for illumination normalization and uneven background correction in images, utilizing the recently proposed TV+L¹ model: minimizing the total variation of the output cartoon while subject to anL¹-norm fidelity term. We give intuitive proofs of its main advantages, including the well-known edge preserving capability, minimal signal distortion, and scale-dependent but intensity-independent foreground extraction. We then propose a novel TV-based quotient image model (TVQI) for illumination normalization, an important preprocessing for face recognition under different lighting conditions. Using this model, we achieve 100% face recognition rate on Yale face database B if the reference images are under good lighting condition and 99.45% if not. These results, compared to the average 65% recognition rate of the quotient image model and the average 95% recognition rate of the more recent self quotient image model, show a clear improvement. In addition, this model requires no training data, no assumption on the light source, and no alignment between different images for illumination normalization. We also present the results of the related applications - uneven background correction for cDNA microarray films and digital microscope images. We believe the proposed works can serve important roles in the related fields.
Parallel Multilevel Sparse Approximate Inverse Preconditioners in Large Sparse Matrix Computations
Authors: Kai Wang, Jun Zhang, Chi Shen
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. We do not use independent set ordering, but a diagonal dominance based matrix permutation to build a multilevel structure. The purpose of introducing multilevel structure into SAI is to enhance the robustness of SAI for solving difficult problems. Forward and backward preconditioning iteration and two Schur complement preconditioning strategies are proposed to improve the performance and to reduce the storage cost of the multilevel preconditioners. One version of the parallel multilevel SAI preconditioner based on the MSP strategy is implemented. Numerical experiments for solving a few sparse matrices on a distributed memory parallel computer are reported.
Survey of bioinformatics programs in the United States: Research Articles
Authors: Bradley M. Hemminger, Trish Losi, Anne Bauers
Venue: Journal of the American Society for Information Science and Technology (2005)

Bioinformatics is a rapidly growing field, and educational programs for bioinformatics are increasing at a similar pace to answer the demand for qualified professionals. Here we survey currently available bioinformatics programs. We have compiled summaries of these programs, including university, state, degree type, department, entrance requirements, degree requirements, links to course Web pages, research interests, and funding. Complete details are presented in the Web version, and an abbreviated listing of the primary attributes of all programs is included in this article. &copy; 2005 Wiley Periodicals, Inc.
Value type-based smart proxies: a concept for adaptable distributed applications
Authors: Markus Aleksy, Ralf Gitzel
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Distributed applications often require the ability to dynamically adapt to new and changing environmental factors. For example, nodes offering a specific service can fail, requiring the client to reroute its messages to another instance offering the same service. In this paper, we describe how to use the concept of value types for the realization of smart proxies. After a brief introduction to the basic concepts, we present our solution and discuss possible application scenarios. CORBA, a common and well-established distributed objects middleware, is used as a practical foundation for our approach.
Using standard internet protocols and applications in space
Authors: Keith Hogie, Ed Criscuolo, Ron Parise
Venue: Computer Networks and ISDN Systems (2005)

This paper discusses approaches for using standard Internet technologies to meet the communication needs of future space missions. It summarizes work done by the Operating Missions as Nodes on the Internet (OMNI) project at NASA/GSFC since 1997. That project arose from a small group of engineers who had been involved with building NASA communication systems for over 20 years. Since NASA needed communication systems for space long before the Internet evolved, NASA developed many custom protocols and communication techniques to meet its "space specific" communication needs. However, as the Internet evolved, it needed to address all of the same communication issues of errors, delays, and intermittent links. Those challenges may not have seemed space related, but the solutions developed can be used to address space communication issues. The key is to select the appropriate Internet Protocols that can support space communication while also providing direct interoperability with the terrestrial Internet.This paper uses a layered approach to discuss all aspects of using Internet technologies in space. It starts with the low-level physical, data link and data routing issues related to using Internet Protocols to support basic spacecraft communications. After identifying options for supporting basic datagram delivery in space, the paper describes issues for selecting transport protocols and applications to meet various mission data delivery needs. Information is provided throughout the paper to identify key implementation issues and provide information on the current status of products in each area. Finally, current implementation and usage of these protocols in both spacecraft and ground systems are discussed.
Locally Divergence-preserving Upwind Finite Volume Schemes for Magnetohydrodynamic Equations
Authors: Manuel Torrilhon
Venue: SIAM Journal on Scientific Computing (2005)

A main issue in nonstationary, compressible magnetohydrodynamic (MHD) simulations is controlling the divergence of the magnetic flux. This paper presents a general procedure showing how to modify the intercell fluxes in a conservative MHD finite volume code such that the scheme becomes locally divergence preserving. That is, a certain discrete divergence operator vanishes exactly during the entire simulation, which results in the suppression of any divergence error. The procedure applies to arbitrary finite volume schemes provided they are based on intercell fluxes. We deduce the necessary modifications for numerical methods based on rectangles and triangles and present numerical experiments with the new schemes.The theoretical justification of the schemes is given in two independent ways. One way starts with the discrete divergence operator that has to be preserved and modifies the fluxes accordingly. The second way uses a finite element reconstruction via Nedelec elements. Both methods lead to equivalent numerical methods.
Convolutional Compaction-Driven Diagnosis of Scan Failures
Authors: Grzegorz Mrugalski, Artur Pogiel, Janusz Rajski, Jerzy Tyszer, Chen Wang
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

This paper describes a fault diagnosis technique for scan-based designs with convolutional test response compaction. The proposed approach allows a time-efficient and accurate identification of failing scan cells using Gauss-Jordan elimination method.
Improved pseudo-chaotic time hopping scheme for UWB impulse radio
Authors: Minhua Qiu, Qianming Shao
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

Pseudo-chaotic time hopping is a modulation method which is suitable for ultra wide-bandwidth impulse radio communication systems. In this paper, we present an improved pseudo-chaotic time hopping scheme for UWB impulse radio. This scheme utilizes multi-tent map, a kind of chaotic map. We find that compared to original tent-map, multi-tent map has some advantages such as flexibility of data rate to satisfy different users' needs and adaptability to channel status. A comparison of encoder and decoder between tent map scheme and multi-tent map scheme is given. After simulation, including estimation of the power spectral density and BER performance of the system, we further present a fractral algorithm in data recovery at receiver.
Genomic analyses of transport proteins in Ralstonia metallidurans: Research Papers
Authors: Torsten von Rozycki, Dietrich H. Nies, Milton H. Saier
Venue: Comparative and Functional Genomics (2005)

Ralstonia (Wautersia, Cupriavidus) metallidurans (Rme) is better able to withstand high concentrations of heavy metals than any other well-studied organism. This fact renders it a potential agent of bioremediation as well as an ideal model organism for understanding metal resistance phenotypes. We have analysed the genome of Rme for genes encoding homologues of established and putative transport proteins; 13&percnt; of all genes in Rme encode such homologues. Nearly one-third of the transporters identified (32&percnt;) appear to function in inorganic ion transport with three-quarters of these acting on cations. Transporters specific for amino acids outnumber sugar transporters nearly 3 : 1, and this fact plus the large number of uptake systems for organic acids indicates the heterotrophic preferences of these bacteria. Putative drug efflux pumps comprise 10&percnt; of the encoded transporters, but numerous efflux pumps for heavy metals, metabolites and macromolecules were also identified. The results presented should facilitate genetic manipulation and mechanistic studies of transport in this remarkable bacterium. Copyright &copy; 2005 John Wiley & Sons, Ltd.
A Hierarchical 3-D Direct Helmholtz Solver by Domain Decomposition and Modified Fourier Method
Authors: E. Braverman, M. Israeli, A. Averbuch
Venue: SIAM Journal on Scientific Computing (2005)

The paper contains a noniterative solver for the Helmholtz and the modified Helmholtz equations in a hexahedron. The solver is based on domain decomposition. The solution domain is divided into mostly parallelepiped subdomains. In each subdomain a particular solution of the nonhomogeneous Helmholtz equation is first computed by a fast spectral 3-D method which was developed in our earlier papers (see, for example, SIAM J. Sci. Comput., 20 (1999), pp. 2237--2260). This method is based on the application of the discrete Fourier transform accompanied by a subtraction technique. For high accuracy the subdomain boundary conditions must be compatible with the specified inhomogeneous right-hand side at the edges of all the interfaces. In the following steps the partial solutions are hierarchically matched. At each step pairs of adjacent subdomains are merged into larger units. The paper describes in detail the matching algorithm for two boxes which is a basis for the domain decomposition scheme. The hierarchical approach is convenient for parallelization and can minimize the global communication. The algorithm requires O(N3, log,N) operations, where N is the number of grid points in each direction.
Real-Time Multiple Objects Tracking with Occlusion Handling in Dynamic Scenes
Authors: Tao Yang, Stan Z. Li, Quan Pan, Jing Li
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This work presents a real-time system for multiple objects tracking in dynamic scenes. A unique characteristic of the system is its ability to cope with long-duration and complete occlusion without a prior knowledge about the shape or motion of objects. The system produces good segment and tracking results at a frame rate of 15-20 fps for image size of 320 x 240, as demonstrated by extensive experiments performed using video sequences under different conditions indoor and outdoor with long-duration and complete occlusions in changing background.
How to Do Everything with PHP and MySQL, 1 edition
Authors: Vikram Vaswani
Venue:  (2005)

This new release in the popular How to Do Everything series explains how to build open source web applications with MySQL and PHP 5. Using these two tools, you’ll be able to create highly functional, interactive web sites easily. Follow along with a step-by-step sample application and, as a bonus, download three full-length case studies complete with code trees.Table of contentsPart I: Learning The Basics of PHP and MySQL1. Introducing PHP and MySQL2. Setting up a PHP-MySQL Development Environment3. Getting Started with PHP Basics4. Getting Started with MySQL Basics5. Connecting PHP to MySQLPart II: Achieving Results6. Input Validation and Output Formatting7. Working with Binary Data8. Performing Transactions9. Authenticating Users10. Porting Your Application Using Database AbstractionPart III: Putting It Together in the Real World11. Creating a Voting System12. Tracking Time-and-Materials13. Managing Information ResourcesAppendices:A. PHP/MySQL API ReferenceB. MySQL Command and Function ReferenceC. Online and Offline ResourcesD. Glossary
An evaluation corpus for temporal summarization
Authors: Vikash Khandelwal, Rahul Gupta, James Allan
Venue: Proceedings of the first international conference on Human language technology research (2001)

In recent years, a lot of work has been done in the field of Topic Tracking. The focus of this work has been on identifying stories belonging to the same topic. This might result in a very large number of stories being reported to the user. It might be more useful to a user if a summary of the main events in the topic rather than the entire collection of stories related to the topic were presented. Though work on such a fine-grained level has been started, there is currently no standard evaluation testbed available to measure the accuracy of such techniques. We describe a scheme for developing a testbed of user judgments which can be used to evaluate the above mentioned techniques. The corpus that we have created can also be used to evaluate single or multi-document summaries.
Alias analysis method for object-oriented programs using alias flow graphs
Authors: Fumiaki Ohata, Kazuhiro Kondou, Katsuro Inoue
Venue: Systems and Computers in Japan (2004)

When a pair of expressions (or partial expressions) on a program text point to the same object (memory area), these expressions are said to be in an alias relation. These occur by indirect references etc. via a parameter passing with delivery, reference variable, pointer, etc. The existing alias analysis methods are insufficient in terms of reusability of analysis results, not allowing the reusability of object-oriented programs in the alias analyses. Furthermore, although various proposals of alias analysis methods have been published in the past, practical tools have not yet been available. This study proposes an alias analysis method for object-oriented programs that considers moduling and reutilization of alias analysis results. The Java alias analysis tool that realizes the proposed method can analyze a large-scale program such as a class library attached to the JDK (Java Developer's Kit) in a practical time. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(4): 49&ndash;59, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.1231
Conversion of a French surface expression into its semantic representation according to the RESEDA metalanguage centre: National de la Recherche Scientifique, Paris, France
Authors: Gian Piero Zarri, Jacqueline Leon, Monique Ornato, Joanna Pomian
Venue: Issue 79 (January 1982) (1982)

The research work that we intend to present here represents a feasibility study concerning the automatic translation of natural language statements -- which describe the biographies of historical personages taken into account by the RESEDA system -- into the RESEDA semantic metalanguage.
Teaching an introductory computer graphics course using OpenGL
Authors: Daniel C. Cliburn
Venue: Journal of Computing Sciences in Colleges (2004)

In the past, introductory graphics courses focused traditionally on algorithms for drawing points, lines and polygons using low-level or system specific commands. This approach has become dated with the introduction of OpenGL and other high level 3D graphics application programming interfaces (API). OpenGL is an API that provides access to graphics hardware through functions common to 3D graphical applications. This tutorial focuses on using OpenGL to teach a junior/senior level elective course in computer graphics. Both OpenGL programming techniques and the design of a high level 3D graphics API such as OpenGL will be covered.
Combinatorial Constructions for Optimal Splitting Authentication Codes
Authors: Gennian Ge, Ying Miao, Lihua Wang
Venue: SIAM Journal on Discrete Mathematics (2005)

The notion of a splitting authentication code is very important in the context of an authentication code with arbitration. Ogata et al. [Discrete Math., 279 (2004), pp. 383--405] characterized an optimal splitting authentication code in terms of a splitting balanced incomplete block design (BIBD). A $(v,u \times c,1)$-splitting BIBD is a pair $({\cal V}, {\cal B})$, where ${\cal V}$ is a $v$-set of points and ${\cal B}$ is a collection of $u \times c$ arrays, called blocks, with entries from ${\cal V}$, such that any point of ${\cal V}$ can occur at most once in any block, and for any two distinct points $x$ and $y$ of ${\cal V}$, there is exactly one block of ${\cal B}$ in which $x$ and $y$ occur in different rows. In this paper, we describe various combinatorial constructions for splitting BIBDs (or, equivalently, optimal splitting authentication codes). We show that the necessary conditions for the existence of a $(v,u \times c,1)$-splitting BIBD (or, equivalently, an optimal c-splitting authentication code with u source states and v messages) are also sufficient for (u,c) = (2,2t) for any positive integer t, (u,c) = (2,3) with a definite exception of v = 10, (u,c) = (3,2) with a definite exception of v =9, and (u,c) = (4,2) with two possible exceptions of v = 49,385.
A Preliminary Study on Negative Correlation Learning via Correlation-Corrected Data (NCCD)
Authors: Zeke S. Chan, Nikola Kasabov
Venue: Neural Processing Letters (2005)

This letter presents a novel cooperative neural network ensemble learning method based on Negative Correlation learning. It enables easy integration of various network models and reduces communication bandwidth significantly for effective parallel speedup. Comparison with the best Negative Correlation learning method reported demonstrates comparable performance at significantly reduced communication overhead.