ppxscal/embedding_network huggingface dataset:
Blending surface generation using a fast and accurate analytical solution of a fourth-order PDE with three shape control parameters
Authors: Lihua You, Jian J. Zhang, Peter Comninos
Venue: The Visual Computer: International Journal of Computer Graphics (2004)

In this paper, we propose to use a fourth-order partial differential equation (PDE) to solve a class of surface-blending problems. This equation has three vector-valued shape control parameters. It incorporates all the previously published forms of fourth-order PDEs for surface blending and can generate a larger class of blending surfaces than existing equations. To apply the proposed PDE to the solution of various blending problems, we have developed a fast and accurate resolution method. Our method modifies Navier&#x2019;s solution for the elastic bending deformation of thin plates by making it satisfy the boundary conditions exactly. A comparison between our method, the closed-form solution method, and other existing analytical methods indicates that the developed method is able to generate blending surfaces almost as quickly and accurately as the closed-form solution method, far more efficiently and accurately than the numerical methods and other existing analytical methods. Having investigated the effects that the vector-valued shape parameters and the force function of the proposed equation have on the blending surface, we have found that they have a significant influence on its shape. They provide flexible user handles that surface designers can use to adjust the blending surface to acquire the desired shape. The developed method was employed in the investigation of surface-blending problems where the primary surfaces were expressed in parametric, implicit, and explicit forms.
Information retrieval using word senses: root sense tagging approach
Authors: Sang-Bum Kim, Hee-Cheol Seo, Hae-Chang Rim
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Information retrieval using word senses is emerging as a good research challenge on semantic information retrieval. In this paper, we propose a new method using word senses in information retrieval: root sense tagging method. This method assigns coarse-grained word senses defined in WordNet to query terms and document terms by unsupervised way using co-occurrence information constructed automatically. Our sense tagger is crude, but performs consistent disambiguation by considering only the single most informative word as evidence to disambiguate the target word. We also allow multiple-sense assignment to alleviate the problem caused by incorrect disambiguation.Experimental results on a large-scale TREC collection show that our approach to improve retrieval effectiveness is successful, while most of the previous work failed to improve performances even on small text collection. Our method also shows promising results when is combined with pseudo relevance feedback and state-of-the-art retrieval function such as BM25.
Device architecture and reliability aspects of a novel 1.22 µm2 EEPROM cell in 0.18 µm node for embedded applications
Authors: G. Tao, A. Scarpa, K. van Dijk, L. van Marwijk, D. Dormans, J. Garbe, D. Boter, R. Verhaar
Venue: Microelectronic Engineering (2004)

The device architecture and operation conditions of a novel 1.22 µm2 EEPROM cell in 0.18 µm technology node have been revealed. With such a novel cell, the traditional scaling barrier of FLOTOX EEPROM cell has been broken. Reliability aspects of such a cell and the related memory matrix have been extensively studied: the cell endurance. programming and erase disturbs, the stress induced leakage current in the cells, the reliability of sector select gates and the reliability of byte-select gates.
CMA-Based Channel Estimation for Space-Time Block Coding Transmission Systems
Authors: Changjiang Xu, Tho Le-Ngoc
Venue: Wireless Personal Communications: An International Journal (2004)

In this paper, we present channel estimation methods for space-time block coding (STBC) transmissions using constant modulus algorithm (CMA). The channel estimates are directly calculated from the convergence value of the CMA. Two algorithms using the channel-vector-based and channel-gain-based constant modulus (CM) criteria are proposed. An approximation of the CM cost function is introduced to allow the use of the recursive least-square (RLS) technique in designing fast RLS-CMA's. Performance of the proposed schemes is evaluated and compared with others using simulation. Illustrative results show that the proposed scheme outperforms the cross-correlated method and can approach the performance of the training-based method.
Closed form solutions of linear odes having elliptic function coefficients
Authors: Reinhold Burger, George Labahn, Mark van Hoeij
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

We consider the problem of finding closed form solutions of linear differential equations having coefficients which are elliptic functions. For second order equations we show how to solve such an ode in terms of doubly periodic functions of the second kind. The method depends on two procedures, the first using a second symmetric power of an ode along with a decision procedure for determining when such equations have elliptic function solutions while the second involves the computation of exponential solutions.
Short note: computational proteomics on the grid
Authors: Eduardo Huedo, Ugo Bastolla, Ruben S. Montero, Ignacio M. Llorente
Venue: New Generation Computing (2004)

The large number of protein sequences, provided by genomic projects at an increasing pace, constitutes a challenge for large scale computational studies of protein structure and thermodynamics. Grid technology is very suitable to face this challenge, since it provides a way to access the resources needed in compute and data intensive applications. In this work, we concentrate on the grid-aware implementation of a protein structure prediction algorithm.
Online event-driven subsequence matching over financial data streams
Authors: Huanmei Wu, Betty Salzberg, Donghui Zhang
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online subsequence similarity matching over massive data streams. With a simultaneous on-line segmentation and pruning algorithm over the incoming stream, the resulting piecewise linear representation of the data stream features high sensitivity and accuracy. The similarity definition is based on a permutation followed by a metric distance function, which provides the similarity search with flexibility, sensitivity and scalability. Also, the metric-based indexing methods can be applied for speed-up. To reduce the system burden, the event-driven similarity search is performed only when there is a potential event. The query sequence is the most recent subsequence of piecewise data representation of the incoming stream which is automatically generated by the system. The retrieved results can be analyzed in different ways according to the requirements of specific applications. This paper discusses an application for future data movement prediction based on statistical information. Experiments on real stock data are performed. The correctness of trend predictions is used to evaluate the performance of subsequence similarity matching.
New Concepts in Sensory System and Immunosensory System
Authors: Shigeo Kobayashi, Kiyoshi Matsumura
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

We describe new concepts in sensory system andimmunosensory system.Sensory system: Sensory receptors have been assumedto be sensors that send information of outer world tothe brain. However, cooling the skin evokes coldsensation, but not temperature. Hence, informationmay not be sent to the brain. Instead, we have proposedthat receptors are comparators, which evoke impulsesas drive signals when stimulus is adequate. When theseimpulses activate information stored in the brain,sensation of outer world would appear.Immunosensory system: Immunosensing represents theability of the central nervous system (CNS) to respondto microbial infection occurring outside the CNS inspite of the presence of blood-brain barrier. Recentstudies revealed cellular and molecular cascade ofimmunosensory system, in which immune cells,endothelial cells, and neurons are functionallyconnected by 2 types of soluble mediators, i.e, cytokinesand prostaglandin E_2.
Algorithms for polynomial GCD computation over algebraic function fields
Authors: Mark van Hoeij, Michael Monagan
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

Let L be an algebraic function field in k ≥ 0 parameters t;1;, ..., t;k;. Let f;1;, f;2; be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first, a modular GCD algorithm, is an extension of the modular GCD algorithm of Brown for Z[x;1;,...,x;n;] and Encarnacion for Q(α)[x] to function fields. It is uses rational number and rational function reconstruction and trial division. The second, a fraction-free algorithm, is a modification of the Moreno Maza and Rioboo algorithm for computing gcds over triangular sets. The modification reduces coefficient growth in L to be linear. We show how to extend the modular GCD algorithm to work when the minimal polynomial for L is not irreducible. We give an empirical comparison of the two algorithms using implementations in Maple.
The two possible values of the chromatic number of a random graph
Authors: Dimitris Achlioptas, Assaf Naor
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

For every d > 0, let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n,d/n) is either kd or kd+1 almost surely. If d ∈ (2k log k - log k, 2k log k) we further prove that the chromatic number almost surely equals k+1.
Enhancing Web Services with Message-Oriented Middleware
Authors: Piyush Maheshwari, Hua Tang, Roger Liang
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

This paper outlines the design and implementation ofWSMQ, which is a message-oriented middlewarespecifically designed to enhance the reliability of Webservices. Highlights of this application feature faulttolerance of Web services communication, Quality ofServices including authentication and prioritization,security enhancement and performance improvements inWeb services over the existing architecture. Theimplementation of these features aims to address theexisting issues surrounding Web services, and further itsadvancement towards a new standard for distributedapplication development.
A Survey of Content Based 3D Shape Retrieval Methods
Venue: Proceedings of the Shape Modeling International 2004 (2004)

Recent developments in techniques for modeling, digitizingand visualizing 3D shapes has led to an explosion inthe number of available 3D models on the Internet and indomain-specific databases. This has led to the developmentof 3D shape retrieval systems that, given a query object,retrieve similar 3D objects. For visualization, 3D shapesare often represented as a surface, in particular polygonalmeshes, for example in VRML format. Often these modelscontain holes, intersecting polygons, are not manifold,and do not enclose a volume unambiguously. On the contrary,3D volume models, such as solid models producedby CAD systems, or voxels models, enclose a volume properly.This paper surveys the literature on methods for contentbased 3D retrieval, taking into account the applicabilityto surface models as well as to volume models. The methodsare evaluated with respect to several requirements ofcontent based 3D shape retrieval, such as: (1) shape representationrequirements, (2) properties of dissimilarity measures,(3) efficiency, (4) discrimination abilities, (5) abilityto perform partial matching, (6) robustness, and (7) necessityof pose normalization. Finally, the advantages and limitsof the several approaches in content based 3D shape retrievalare discussed.
Generalized Speckle Reducing Anisotropic Diffusion for Ultrasound Imagery
Authors: Yongjian Yu, Janelle A. Molloy, Scott T. Acton
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

We first derive rigorously a partial differential equation (PDE) for speckle reduction fromminimizing a cost functional of the instantaneous coefficient of variation. Then, we show thatthe piecewise exponential function is the solution of the derived PDE. Next, we express thederived PDE using log-compressed ultrasound data, followed by a numerical implementationscheme. Finally, we demonstrate the performance of the proposed PDE using examples andcompare the results with those obtained from the speckle reducing anisotropic diffusion(SRAD) algorithm.
Cegor: An Adaptive Distributed File System for Heterogeneous Network Environments
Authors: Weisong Shi, Sharun Santhosh, Hanping Lufei
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Distributed file systems have been extensively studiedin the past, but they are still far from wide acceptanceover heterogeneous network environments. Most traditionalnetwork file systems target the tight-couple high-speednetworks only, and do not work well in the wide-areasetting. Several communication optimization techniquesare proposed in the context of wide-area file systems, butthese approaches do not take into consideration the filecharacteristics and may instead introduce extra computingoverhead when the network condition is good. We envisionthat the capability of providing adaptive, seamlessfile access to personal documents across diverse networkconnections plays an important role in the success of futuredistributed file systems.In this paper, we propose to build an adaptive distributedfile system which provides the "ClosE and Go,Open and Resume" (Cegor) semantics across heterogeneousnetwork connections, ranging from high-bandwidthlocal area network to low-bandwidth dial-up connection.Our approach relies on a set of new techniquesfor managing adaptive access to remote files, includingthree components: system support for secure, transparentreconnection at different places, semantic-view basedcaching to reduce communication frequencies in the system,and type-specific communication optimization tominimize the bandwidth requirement of synchronizationsbetween clients and servers.
Efficient Thermal Placement of Standard Cells in 3D ICs using a Force Directed Approach
Authors: Brent Goplen, Sachin Sapatnekar
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

As the technology node progresses, thermal problems arebecoming more prominent especially in the developingtechnology of three-dimensional (3D) integrated circuits. Thethermal placement method presented in this paper uses an iterativeforce-directed approach in which thermal forces direct cells awayfrom areas of high temperature. Finite element analysis (FEA) isused to calculate temperatures efficiently during each iteration.Benchmark circuits produce thermal placements with both lowertemperatures and thermal gradients while wirelength is minimally affected.
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
Authors: Mohamed F. Mokbel, Xiaopeing Xiong, Walid G. Aref
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

This paper intoduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluting a set of concurrent continuous spatio-temporal queries. SINA is designed with two goals in mind: (1) Scalability in terms of the number of concurrent continuous spatio-temporal queries, and (2) Incremental evaluation of continyous spatio-temporal queries. SINA achieves scalability by empolying a shared execution paradigm where the execution of continuous spatio-temporal queries is abstracted as a spatial join between a set of moving objects and a set of moving queries. Incremental evaluation is achived by computing only the updates of the previously reported answer. We introduce two types of updaes, namely positive and negative updates. Positive or negative updates indicate that a certain object should be added to or removed from the previously reported answer, respectively. SINA manages the computation of postive and negative updates via three phases: the hashing phase, the invalidation phase, and the joining phase. the hashing phase employs an in-memory hash-based join algorithm that results in a set a positive upldates. The invalidation phase is triggered every T seconds or when the memory is fully occupied to produce a set of negative updates. Finally, the joining phase is triggered by the end of the invalidation phase to produce a set of both positive and negative updates that result from joining in-memory data with in-disk data. Experimental results show that SINA is scalable and is more efficient than other index-based spatio-temporal algorithms.
A low-distortion class G line driver for central-office ADSL modem
Authors: Ing. Davide Vecchi, Andrea Boni, Carlo Morandi
Venue: Analog Integrated Circuits and Signal Processing (2003)

This paper presents the design of a high-efficiency line driver for central-office ADSL modems. This driver is a modification of the conventional class-G architecture already in use for hi-fi audio applications and it is based on two amplifiers operating in parallel and powered by different power supplies (± 5 V and ±12 V). The low-voltage amplifier is active with low-level input signal, while the high-voltage amplifier is used for processing the peaks of the DMT signal. By means of this solution and by properly interfacing the two amplifiers, high efficiency is achieved while maintaining a harmonic distortion similar to the one achieved by conventional class-AB schemes and compatible with the ADSL requirements. The circuit was designed in a 0.8-µm BCD technology.
Uncertain probabilities II: the continuous case
Authors: J. J. Buckley, E. Eslami
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

We consider probability density functions where some of the parameters are uncertain. We model these uncertainties using fuzzy numbers producing fuzzy probability density functions. In particular, we look at the fuzzy normal, fuzzy uniform, and the fuzzy negative exponential and show how to use them to compute fuzzy probabilities. We also use the fuzzy normal to approximate the fuzzy binomial. Our application is to inventory control (the economic order quantity model) where demand is given by a fuzzy normal probability density.
The Effect of Mammogram Databases on Algorithm Performance
Authors: Michael Wirth, Jennifer Lyon, Matteo Fraschini, Dennis Nikitenko
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

One of the caveats of the process of designing image processing algorithms is that they areoften tested on insignificant numbers of images. This paper discusses the influence ofmammogram databases on the performance evaluation of algorithms. We hope to demonstrate that the use of extensive collections of mammograms with varied characteristics to assess algorithm performance can lead to more robust algorithms.
Fast and energy-frugal deterministic test through efficient compression and compaction techniques
Authors: Ozgur Sinanoglu, Alex Orailoglu
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

Conversion of the flip-flops of the circuit into scan cells helps ease the test challenge; yet test application time is increased as serial shift operations are employed. Furthermore, the transitions that occur in the scan chains during these shifts reflect into significant levels of circuit switching unnecessarily, increasing the power dissipated. Judicious encoding of the correlation among the test vectors and construction of a test vector through predecessor updates helps reduce not only test application time but also scan chain transitions as well. Such an encoding scheme, which additionally reduces test data volume, can be further enhanced through appropriately ordering and padding of the test cubes given. The experimental results confirm the significant reductions in test application time, test data volume and test power achieved by the proposed compression methodology.
An Efficient Exponential Algorithm with Exponential Convergence Rate
Authors: Chichyang Chen, Kuo-Sheng Cheng
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper presents an efficient additive normalization method for exponential computation. Same as a previous additive normalization method, this new method can allow the values of the normalization factors in the normalization method be obtained directly from the remaining terms without any computation. Furthermore, the convergence rate of this method is also exponential. Instead of generating a group of logarithmic terms in each normalization stage, only one logarithmic term with large radix is generated and used as the normalization factor. This technique facilitates the computation of the partial result term in each normalization stage. The computation can then be implemented efficiently as a simple multiplication-and-add operation. Thorough simulations on the 24-bit exponential unit have verified that our proposed method is correct. From the synthesis results, the hardware cost and the delay of the proposed 53-bit exponential unit are only one-fourth and two-thirds of those of the 53-bit exponential unit in the previous design, respectively. We conclude that our proposed additive normalization method can significantly improve the performance of the exponential computation.
Ode to summer
Authors: Tony Neoh
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

An attempt to use CC technology to bring to life the art of Chinese ink brush painting. It has the usual elements found in Chinese paintings like the lotus, koi, lady, rock, tree and calligraphy. All the objects are 3D geometry with the unique Chinese brush strokes realized through a combination of models and shaders. Texture maps have been kept to a minimum while using simple lighting. Copyright held by creator.
A Hybrid Collision Detection Approach for the Haptic Rendering of Deformable Tools
Authors: S. D. Laycock, A. M. Day
Venue: Proceedings of the Computer Graphics International (2004)

There are strict time constraints with regard to the updaterates for applications incorporating the sense of touch.Therefore, it is essential to employ efficient algorithms forhaptic rendering to ensure stable and realistic force feedbackis perceived. A major part in any haptic renderingalgorithm is the collision detection between the virtual representationof the haptic interface and the objects in thescene. The first part of this paper describes an efficientcollision detection algorithm, which is derived from spatialpartitioning and bounding volume hierarchy approaches.The pair of closest points is obtained between two polygonalmodels which may be non-convex. The second part ofthe paper describes a haptic rendering algorithm that allowsthree-dimensional polygonal objects to represent deformabletools in the virtual environment.