ppxscal/embedding_network huggingface dataset:
Semi-Automatically Augmenting Virtual Environments with Plausibly Located Clutter
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

This paper presents an approach for semi-automaticallyaugmenting existing virtual environments with sensibly and plausibly distributedfeatures which model the clutter we find in real-worldscenes. It focuses on the stages of identifying sensiblepotential clutter placement regions and then describesa novel use of parametric surfaces as a generalisedmeans of specifying distribution patterns within theseregions.
Time complexity of practical parallel steiner point insertion algorithms
Authors: Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

An effective method in practice to compute quality Delaunay triangulations is to apply parallel refinements that insert Steiner points whose prestars in the triangulation do not overlap. We show that these algorithms can be implemented in O(log m) time using m processors, where m is the output size. To our knowledge, this is the first such analysis.
Efficient development of data migration transformations
Authors: Paulo Carreira, Helena Galhardas
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

In this paper, we present a data migration tool named DATA FUSION. Its main features are: A domain specific language designed to conveniently model complex data transformations; an integrated development environment that assists users on managing complex data transformation projects and an auditing facility that provides relevant information to project managers and external auditors.
Gene Length and Alternative Transcription in Fruit Fly
Authors: Boris Budagyan, Ann Loraine
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Alternative transcription, in which a single gene may give rise to multiple variant mRNA forms, is widely recognized as an important source of protein diversity in complex, eukaryotic genomes. Here we show that in the Drosophila genome, larger genes with greater numbers of exons tend to be alternatively transcribed to a greater degree than smaller genes with fewer exons. In addition, we show that a log-normal distribution provides a good approximation for gene length distributions in Drosophila and that an exponential function relates the number of variants produced per gene with average exon count.
From Continuous to Discrete Games
Authors: Inmaculada Garcia, Ramon Molla, Pedro Morillo
Venue: Proceedings of the Computer Graphics International (2004)

Computer games follow a scheme of continuoussimulation, coupling the rendering phase and thesimulation phase. That way of operation hasdisadvantages that can be avoided using a discreteevent simulator as a game kernel. This paper proposesto integrate a discrete event simulator (DESK) tomanage the videogames events. The videogame kernelused is Fly3D. The new kernel is called DFly3D. Itallows a discrete event simulation scheme and therendering and simulation phase independence. Theintegration objective has been to maintain the Fly3Dmain structure and functionality, changing only theevents management. The videogames objects behaviorand interconnection is modeled by message passing.Maintaining the videogame quality, the video-gamescreated using DFly3D allow to reduce the computerpower used to execute it. That allows to execute thevideogame in computers with less computing power orto improve the game quality.
Comparing Real-Time Communication Under Electromagnetic Interference
Authors: Ian Broster, Alan Burns, Guillermo Rodriguez-Navas
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

The contribution of this paper is threefold. First, an improvementto a previously published paper on the timinganalysis of Controller Area Network (CAN) in the presenceof transient network faults is presented. A probabilistic faultmodel is considered, where random faults from electromagneticinterference occur according to a Poisson distribution.The analysis provides worst case response times for messageframes, not as a single value, but as a probability distribution.Secondly, a similar result is produced for time-triggeredCAN (TTCAN), a version of CAN based on time-drivenschedule. Thirdly, these analyses are applied to anexample message set and used to discuss the dependabilityof event-triggered and time-triggered communication inthe presence of electromagnetic interference. The results indicatethat, an event-triggered bus can generally provide ahigher probability of timely-delivery of data than a time-triggeredbus.
Synergy between medical informatics and bioinformatics: facilitating genomic medicine for future health care
Authors: F. Martin-Sanchez, I. Iakovidis, S. Nørager, V. Maojo, P. de Groen, J. Van der Lei, T. Jones, K. Abraham-Fuchs, R. Apweiler, A. Babic, R. Baud, V. Breton, P. Cinquin, P. Doupi, M. Dugas, R. Eils, R. Engelbrecht, P. Ghazal, P. Jehenson, C. Kulikowski, K. Lampe, G. De Moor, S. Orphanoudakis, N. Rossing, B. Sarachan, A. Sousa, G. Spekowius, G. Thireos, G. Zahlmann, J. Zvárová, I. Hermosilla, F. J. Vicente
Venue: Journal of Biomedical Informatics (2004)

In this paper, we review the results of BIOINFOMED, a study funded by the European Commission (EC) with the purpose to analyse the different issues and challenges in the area where Medical Informatics and Bioinformatics meet. Traditionally, Medical Informatics has been focused on the intersection between computer science and clinical medicine, whereas Bioinformatics have been predominantly centered on the intersection between computer science and biological research. Although researchers from both areas have occasionally collaborated, their training, objectives and interests have been quite different. The results of the Human Genome and related projects have attracted the interest of many professionals, and introduced new challenges that will transform biomedical research and health care. A characteristic of the 'post genomic' era will be to correlate essential genotypic information with expressed phenotypic information. In this context, Biomedical Informatics (BMI) has emerged to describe the technology that brings both disciplines (BI and MI) together to support genomic medicine. In recognition of the dynamic nature of BMI, institutions such as the EC have launched several initiatives in support of a research agenda, including the BIOINFOMED study.
Feature Weighting and Instance Selection for Collaborative Filtering: An Information-Theoretic Approach
Authors: Kai Yu, Xiaowei Xu, Martin Ester, Hans-Peter Kriegel
Venue: Knowledge and Information Systems (2003)

Collaborative filtering (CF) employing a consumer preference database to make personal product recommendations is achieving widespread success in E-commerce. However, it does not scale well to the ever-growing number of consumers. The quality of the recommendation also needs to be improved in order to gain more trust from consumers. This paper attempts to improve the accuracy and efficiency of collaborative filtering. We present a unified information-theoretic approach to measure the relevance of features and instances. Feature weighting and instance selection methods are proposed for collaborative filtering. The proposed methods are evaluated on the well-known EachMovie data set and the experimental results demonstrate a significant improvement in accuracy and efficiency.
Bernstein-Bezoutian matrices
Authors: D. A. Bini, L. Gemignani
Venue: Theoretical Computer Science (2004)

Several computational and structural properties of Bezoutian matrices expressed with respect to the Bernstein polynomial basis are shown. The exploitation of such properties allows the design of fast algorithms for the solution of Bernstein-Bezoutian linear systems without never making use of potentially ill-conditioned reductions to the monomial basis. In particular, we devise an algorithm for the computation of the greatest common divisor (GCD) of two polynomials in Bernstein form. A series of numerical tests are reported and discussed, which indicate that Bernstein-Bezoutian matrices are much less sensitive to perturbations of the coefficients of the input polynomials compared to other commonly used resultant matrices generated after having performed the explicit conversion between the Bernstein and the power basis.
Relevance models to help estimate document and query parameters
Authors: David Bodoff
Venue: ACM Transactions on Information Systems (TOIS) (2004)

A central idea of Language Models is that documents (and perhaps queries) are random variables, generated by data-generating functions that are characterized by document (query) parameters. The key new idea of this paper is to model that a relevance judgment is also generated stochastically, and that its data generating function is also governed by those same document and query parameters. The result of this addition is that any available relevance judgments are easily incorporated as additional evidence about the true document and query model parameters. An additional aspect of this approach is that it also resolves the long-standing problem of document-oriented versus query-oriented probabilities. The general approach can be used with a wide variety of hypothesized distributions for documents, queries, and relevance. We test the approach on Reuters Corpus Volume 1, using one set of possible distributions. Experimental results show that the approach does succeed in incorporating relevance data to improve estimates of both document and query parameters, but on this data and for the specific distributions we hypothesized, performance was no better than two separate one-sided models. We conclude that the model's theoretical contribution is its integration of relevance models, document models, and query models, and that the potential for additional performance improvement over one-sided methods requires refinements.
Exploitation of 3D Video Technologies
Authors: Takashi Matsuyama
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

3D video is NOT an artificial CG animation but a real 3Dmovie recording the full 3D shape, motion, and precise surfacecolor & texture of real world objects. It enables us toobserve real object behaviors from any viewpoints as wellas to see pop-up 3D object images. We believe the exploitationof 3D video technologies will open up a new world ofversatile cultural and social activities: visual communication,entertainment, training & learning, archiving, and soon. This paper gives an overview of our research attainmentsso far obtained: (1) a PC cluster system with distributedactive cameras for real-time 3D shape reconstruction,(2) a dynamic 3D mesh deformation method for obtainingaccurate 3D object shape, (3) a texture mapping algorithmfor high fidelity visualization, and (4) user friendly3D video editing system.
A Care Communication Service System for Improving Inpatients Quality of Life
Authors: Akio Koyama, Tadahiko Abiko, Noriyuki Kamibayashi, Norio Narita
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this research, we investigated the everyday life of inpatients in a hospital. We found that family members want to meet with inpatients even if they are very busy with their work. The inpatients have a lot of free time to meet, talk and discuss with family members. In order to ensure a better Quality of Life (QoL) for inpatients, we propose a new telecommunication service system. The proposed system uses the network and multimedia communications to provide the communication among the family members, inpatient and medical staffs. The service system consists of networked computers, cameras, hand free microphones, speakers and the voice chat software. We verified by experiment that the proposed communication system has an easy operation and is a useful system for the inpatients and family members.
Performance Optimization of Latency Insensitive Systems Through Buffer Queue Sizing of Communication Channels
Authors: Ruibing Lu, Cheng-Kok Koh
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This paper proposes for latency insensitive systems a performanceoptimization technique called channel buffer queue sizing, whichis performed after relay station insertion in the physical designstage. It can be shown that proper queue sizing can reduce or evencompletely avoid the performance loss due to imbalanced relaystations insertion in reconvergent paths. Moreover, the problemof queue sizing and placement of the additional buffers for maximumperformance is formulated and studied to properly allocateavailable chip areas in the layout to communication channels. Analgorithm based on mixed integer linear programming is proposed.Experimental results show that queue sizing is effective in improvingthe performance of latency insensitive systems even under tightarea constraints. Moreover, the proposed algorithm is sufficientlyefficient in obtaining the optimal solution for systems of practicalsizes.
FA&Ccedil;ADE: a fast and effective approach to the discovery of dense clusters in noisy spatial data
Authors: Yu Qian, Gang Zhang, Kang Zhang
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

FA&Ccedil;ADE (Fast and Automatic Clustering Approach to Data Engineering) is a spatial clustering tool that can discover clusters of different sizes, shapes, and densities in noisy spatial data. Compared with the existing clustering methods, FA&Ccedil;ADE has several advantages: first, it separates true data and noise more effectively. Second, most steps of FA&Ccedil;ADE are automatic. Third, it requires only O(nlogn) time. 2D and 3D visualizations are used in FA&Ccedil;ADE to assist parameter selection and result evaluation. More information on FA&Ccedil;ADE is available at: http://viscomp.utdallas.edu/FACADE.
The role of cryptography in database security
Authors: Ueli Maurer
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

In traditional database security research, the database is usually assumed to be trustworthy. Under this assumption, the goal is to achieve security against external attacks (e.g. from hackers) and possibly also against users trying to obtain information beyond their privileges, for instance by some type of statistical inference. However, for many database applications such as health information systems there exist conflicting interests of the database owner and the users or organizations interacting with the database, and also between the users. Therefore the database cannot necessarily be assumed to be fully trusted.In this extended abstract we address the problem of defining and achieving security in a context where the database is not fully trusted, i.e., when the users must be protected against a potentially malicious database. Moreover, we address the problem of the secure aggregation of databases owned by mutually mistrusting organisations, for example by competing companies.
The IBM ASIC/SoC methodology--A recipe for first-time success
Authors: G. W. Doerre, D. E. Lackey
Venue: IBM Journal of Research and Development (2002)

This paper describes the methodology employed by the IBM Microelectronics Division for the design of its Blue LogicÂ® application-specific integrated circuits (ASICs) and system-on-a-chip (SoC) designs. This methodology is used by both IBM ASIC and SoC designers, as well as OEM customers. A key focus of the IBM ASIC/SoC methodology, outlined in the first section of this paper, is the first-time-right methods of design and verification that maximize correct operation of the chip upon product integration. The second section of this paper describes advances in methodology that deal with the physical effects of shrinking device geometries and enable design using the performance and density capabilities available in the new technologies, and methodology advances that have improved design turnaround time (TAT) for large, complex designs. Upcoming nanometer-level technologies present new opportunities to integrate systems on a single chip, including functional components of mixed libraries and mixed analog and digital design. The final section of this paper outlines strategies that are enabling SoC design at these levels.
Computing mountain passes and transition states
Authors: Jorge J. Mor&#x00e9;, Todd S. Munson
Venue: Mathematical Programming: Series A and B (2004)

The mountain-pass theorem guarantees the existence of a critical point on a path that connects two points separated by a sufficiently high barrier. We propose the elastic string algorithm for computing mountain passes in finite-dimensional problems and analyze the convergence properties and numerical performance of this algorithm for benchmark problems in chemistry and discretizations of infinite-dimensional variational problems. We show that any limit point of the elastic string algorithm is a path that crosses a critical point at which the Hessian matrix is not positive definite.
Towards a refinement algebra
Authors: J. von Wright
Venue: Science of Computer Programming (2004)

Kleene algebra with tests (KAT) has proved to be useful for reasoning about programs in a partial correctness framework. We describe demonic refinement algebra (DRA), a variation of KAT for total correctness and illustrate its modelling and reasoning power with a number of applications and examples.
Recent Metaheuristic Algorithms for the Generalized Assignment Problem
Authors: Mutsunori Yagiura, Toshihide Ibaraki
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

The generalized assignment problem is a classical combinatorialoptimization problem known to be NP-hard. Itcan model a variety of real world applications in location,allocation, machine assignment, and so forth. In this paper,we review recent metaheuristic algorithms we developedfor this problem. The algorithms use the ejection chainapproach, which is embedded in a neighborhood constructionto create more complex and powerful moves. We alsoincorporate an automatic mechanism for adjusting searchparameters, to maintain a balance between visits to the feasibleand infeasible regions. Computational comparisons onbenchmark instances show that the methods are very effectivecompared to other existing metaheuristic algorithms.
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties
Authors: Zhaohui Liu, T.C. Edwin Cheng
Venue: Journal of Scheduling (2004)

Extensive research has been devoted to preemptive scheduling. However, little attention has been paid to problems where a certain time penalty must be incurred if preemption is allowed. In this paper, we consider the single-machine scheduling problem of minimizing the total completion time subject to job release dates and preemption penalties, where each time a job is started, whether initially or after being preempted, a job-independent setup must take place. The problem is proved to be strongly NP-hard even if the setup time is one unit. We also study a natural extension of a greedy algorithm, which is optimal in the absence of preemption penalty. It is proved that the algorithm has a worst-case performance bound of 25/16, even when the maximum completion time, i.e., makespan, criterion is considered simultaneously.
CUBIC: Search for Binding Sites
Authors: Victor Olman, Jizhu Lu, PhuongAn Dam, Zhengchang Su, Ying Xu
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The regulation of gene transcription is achieved through specific interactions between transcription factors and their binding sites in the upstream region of the gene being regulated. Correct identification of these binding sites represents a key challenging problem in computational biology. Our approach to the problem is to find a "clear" cluster in the space of all k-mers from the upstream regulatory regions of a set of genes that potentially share similar binding sites. The cluster identification is performed by using Minimal Spanning Tree (MST) technique with a special distance between k-mers based on the chosen Profile. Itýs shown that widely used "conservation" characteristic in position is a result of a "common sense" requirement for "conservation". The local convergence of algorithm for "conservation" maximization of Profile has been proved and the method for statistical significance evaluation of results is presented. All ideas have been implemented in a form of software CUBIC.
Influence of processing conditions on CoSi2 formation in the presence of a Ti capping layer
Authors: C. Detavernier, R. L. Van Meirhaeghe, W. Vandervorst, K. Maex
Venue: Microelectronic Engineering (2004)

The formation of cobalt silicide by the reaction of a Co layer with a Si substrate is known to be sensitive to the presence of oxygen contamination in the reaction region. A layer of Ti deposited on top of the Co is known to getter oxygen impurities. However, the presence of a Ti capping layer induces two additional effects: firstly, the nucleation temperature of CoSi2 is increased by 60-80 °C. Secondly, the CoSi2 that is formed in the presence of a Ti capping layer has a preferential (220) and (400) orientation. A detailed study is presented on the influence of several processing parameters (annealing temperature, selective etching, layer thickness) on the nucleation temperature and preferential orientation of CoSi2 in the Ti/Co/Si system.
LCGMiner: Levelwise Closed Graph Pattern Mining from Large Databases
Authors: Aihua Xu, Hansheng Lei
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

LCGMiner (Levelwise Closed Graph Pattern Miner) isproposed to improve CloseGraph[CloseGraph: Mining closed frequent graph paterns] in discovering frequent closed subgraphs. Frequent closed edgesets with thesame extended vertexsets are expanded in pattern generationcompared to one edge or one vertex in traditional methods.Experiments on synthetic datasets as well as a realNIH dataset demonstrates that our algorithm outperformscloseGraph and gSpan.
Non-equivalent partitions of d-triangles with Steiner points
Authors: Ángel Plaza, José P. Suárez, Miguel A. Padrón
Venue: Applied Numerical Mathematics (2004)

In this paper we present lower and upper bounds for the number of equivalence classes of d-triangles with additional or Steiner points. We also study the number of possible partitions that may appear by bisecting a tetrahedron with Steiner points at the midpoints of its edges. This problem arises, for example, when refining a 3D triangulation by bisecting the tetrahedra. To begin with, we look at the analogous 2D case, and then the 1-irregular tetrahedra (tetrahedra with at most one Steiner point on each edge) are classified into equivalence classes, and each element of the class is subdivided into several non-equivalent bisection-based partitions which are also studied. Finally, as an example of the application of refinement and coarsening of 3D bisection-based algorithms, a simulation evolution problem is shown.