ppxscal/embedding_network huggingface dataset:
Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns
Authors: Mehmet Koyuturk, Wojciech Szpankowski, Ananth Grama
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Biclustering is an important problem that arises in diverse applications, including analysis of gene expression and drug interaction data. The problem can be formalized in various ways through different interpretation of data and associated optimization functions. We focus on the problem of finding unusually dense patterns in binary (0-1) matrices. This formulation is appropriate for analyzing experimental datasets that come from not only binary quantization of gene expression data, but also more comprehensive datasets such as gene-feature matrices that include functions of coded proteins and motifs in the coding sequence. We formalize the notion of an "unusually" dense submatrix to evaluate the interestingness of a pattern in terms of statistical significance based on the assumption of a uniform memoryless source. We then simplify it to assess statistical significance of discovered patterns. Using statistical significance as an objective function, we formulate the problem as one of finding significant dense submatrices of a large sparse matrix. Adopting a simple iterative heuristic along with randomized initialization techniques, we derive fast algorithms for discovering binary biclusters. We conduct experiments on a binary gene-feature matrix and a quantized breast tumor gene expression matrix. Our experimental results show that the proposed method quickly discovers all interesting patterns in these datasets.
On Closure Under Stuttering
Authors: O. Pãun, Marsha Chechik
Venue: Formal Aspects of Computing (2003)

For over a decade, researchers in formal methods have tried to create formalisms that permit natural specification of systems and allow mathematical reasoning about their correctness. The availability of fully automated reasoning tools enables non-experts to use formal methods effectively&#x2014;their responsibility reduces to specifying the model and expressing the desired properties. Thus, it is essential that these properties be represented in a language that is easy to use, sufficiently expressive and succinct. Linear-time temporal logic (LTL) is a formalism that has been used extensively by researchers for program specification and verification. One of the desired properties of LTL formulas is closure under stuttering. That is, we do not want the interpretation of formulas to change over traces where some states are repeated. This property is important from both practical and theoretical prospectives; all properties which are closed under stuttering can be expressed in LTL&#x2212;X&#x2014;a fragment of LTL without the &#x2018;next&#x2019; operator. However, it is often difficult to express properties in this fragment of LTL. Further, determining whether a given LTL property is closed under stuttering is PSPACE-complete. In this paper, we introduce a notion of edges of LTL formulas and present a formal theory of closure under stuttering. Edges allow natural modelling of systems with events. Our theory enables syntactic reasoning about whether the resulting properties are closed under stuttering. Finally, we apply the theory to the pattern-based approach of specifying temporal formulas.
A Robust Hybrid Tracking System for Outdoor Augmented Reality
Authors: Bolan Jiang, Ulrich Neumann, Suya You
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

We present a real-time hybrid tracking system thatintegrates gyroscopes and line-based vision trackingtechnology. Gyroscope measurements are used topredict orientation and image line positions.Gyroscope drift is corrected by vision tracking.System robustness is achieved by using a heuristiccontrol system to evaluate measurement quality andselect measurements accordingly. Experiments showthat the system achieves robust, accurate, and real-timeperformance for outdoor augmented reality.
Multiple-Input Resonant-Tunneling Logic Gates for Flash A/D Converter Applications
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

Multiple-inputresonant-tunneling (RT) logic gates have beenproposed for flash analog-to-digital converter applications.An error-mode operation has been found in conventional RTgates called MOBILE when the number of input increases.By introducing an RTD/HEMT series connection to suppressthe error operation, we can successfully design 4-, 8-,and 16-input RT gates, which are essential to obtain compactflash ADCs.
Modelling the water sorption isotherms of yoghurt powder spray
Authors: Jiri Stencl
Venue: Mathematics and Computers in Simulation (2004)

Moisture sorption isotherms of yoghurt powder spray were determined using a gravimetric dynamic method with continuous recording of changes in sample weight. Equilibrium data for adsorption and desorption of water from yoghurt powder spray were investigated at ambient temperatures in the range of 20-40 °C and water activity ranging from 0.40 to 0.99. Sorption capacity decreased as temperature increased. Four models available in the literature (Chung-Pfost, Halsey, Henderson and Oswin) were evaluated by determining the best fit to the experimental data. The modified Chung-Pfost equation was found to be a good model for moisture adsorption and desorption of yoghurt powder spray. The critical value of equilibrium moisture content (EMC) of samples tested, corresponding to the water activity equal 0.6, was 8.1-8.9% (wet basis, w.b.) at the temperature of 20 °C.
Work-Flow Based Multi-Domain Certificate in E-Commerce
Authors: Zhiyi Fang, Yong Feng, Zhuang Liu, Jing Zhang
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Workflow technology is directly objected to the application of industry and business. In a networked e-Commerce system, network programming brings many threats to whole network, such as spoof of identity, unauthorized access and damage to network. In this paper, we propose a multi-domain certificate mechanism based on work-flow requirements. By using multi-domain certificate mechanism, we can provide higher security for authentication and authorization in a networked e-Commerce system.
Robust Watermarking of Point-Sampled Geometry
Authors: Daniel Cotting, Tim Weyrich, Mark Pauly, Markus Gross
Venue: Proceedings of the Shape Modeling International 2004 (2004)

We present a new scheme for digital watermarking ofpoint-sampled geometry based on spectral analysis. Byextending existing algorithms designed for polygonal datato unstructured point clouds, our method is particularlysuited for scanned models, where the watermark can bedirectly embedded in the raw data obtained from the 3Dacquisition device. To handle large data sets efficiently, weapply a fast hierarchical clustering algorithm that partitionsthe model into a set of patches. Each patch is mappedinto the space of eigenfunctions of an approximate Laplacianoperator to obtain a decomposition of the patch surfaceinto discrete frequency bands. The watermark is thenembedded into the low frequency components to minimizevisual artifacts in the model geometry. During extraction,the target model is resampled at optimal resolution usingan MLS projection. After extracting a watermark from thismodel, the corresponding bit stream is analyzed using statisticalmethods based on correlation. We have applied ourmethod to a number of point-sampled models of differentgeometric and topological complexity. These experimentsshow that our watermarking scheme is robust againstnumerous attacks, including low-pass filtering, resampling,affine transformations, cropping, additive randomnoise, and combinations of the above.
Optimized Slowdown in Real-Time Task Systems
Authors: Ravindra Jejurikar, Rajesh Gupta
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

Slowdown factors determine the extent of slowdown acomputing system can experience based on functional andperformance requirements. Dynamic Voltage Scaling (DVS)of a processor based on slowdown factors can lead to considerableenergy savings. We address the problem of computingslowdown factors for dynamically scheduled taskswith specified deadlines. We present an algorithm to computea near optimal constant slowdown factor based on thebisection method. As a further generalization, for the caseof tasks with varying power characteristics, we present thecomputation of near optimal slowdown factors as a solutionto convex optimization problem using the ellipsoid method.The algorithms are practically fast and have the same timecomplexity as the algorithms to compute the feasibility ofa task set. Our simulation results show on an average 20%energy gains over known slowdown techniques using staticslowdown factors and 40% gains with dynamic slowdown.
Porting DPPX from the IBM 8100 to the IBM ES/9370: installation and testing
Authors: G. E. Boehm, A. M. Palmiotti, D. P. Zingaretti
Venue: IBM Systems Journal (1990)

This paper describes the software tools, testing activities, and testing methods that were used to port the DPPX/SP operating system from its original implementation on the IBM 8100 Information System to its new implementation on the IBM ES/9370 Information System.
Real-time reflection on moving vehicles in urban environments
Authors: Alexandre Meyer, Céline Loscos
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

In the context of virtual reality, the simulation of complex environments with many animated objects is becoming more and more common. Virtual reality applications have always promoted the development of new efficient algorithms and image-based rendering techniques for real-time interaction. In this paper, we propose a technique which allows the real-time simulation in a city of the reflections of static geometry (eg. building) on specular dynamic objects (vehicles). For this, we introduce the idea of multiple environment maps. We pre-compute a set of reference environment maps at strategic positions in the scene, that are used at run time and for each visible dynamic object, to compute local environment maps by resampling images. To efficiently manage a small number of reference environment maps, compared to the scene dimension, for each vertex of the reconstructed environment we perform a ray tracing in a heightfield representation of the scene. We control the frame rate by adaptative reconstruction of environment maps. We have implemented this approach, and the results show that it is efficient and scalable to many dynamic objects while maintaining interactive frame rates.
Adaptation-Based Individualized Face Modeling for Animation Using Displacement Map
Authors: Yu Zhang, Terence Sim, Chew Lim Tan
Venue: Proceedings of the Computer Graphics International (2004)

In this paper a new adaptation-based method is presentedto reconstruct animatable facial models of human individualsfrom scan data. An anatomy-based generic controlmodel serves as the starting point for our adaptation algorithm.Based on a series of measurements between thespecified 3D landmarks, a global adaptation is carried outto align the generic control model to the scan surface. Alocal adaptation then deforms the geometry of the genericmodel to fit all of its vertices to the scan surface. Thehigh-resolution geometry of the scan surface is representedas a displacement map which is generated using an offset-envelopemapping. Reconstruction of high-resolution geometryon the adapted generic mesh is achieved by hierarchicalrefinement using a surface subdivision scheme with resamplingof the displacement map.
Multistrategy Ensemble Learning: Reducing Error by Combining Ensemble Learning Techniques
Authors: Geoffrey I. Webb
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Ensemble learning strategies, especially Boosting and Bagging decision trees, have demonstrated impressive capacities to improve the prediction accuracy of base learning algorithms. Further gains have been demonstrated by strategies that combine simple ensemble formation approaches. In this paper, we investigate the hypothesis that the improvement in accuracy of multistrategy approaches to ensemble learning is due to an increase in the diversity of ensemble members that are formed. In addition, guided by this hypothesis, we develop three new multistrategy ensemble learning techniques. Experimental results in a wide variety of natural domains suggest that these multistrategy ensemble learning techniques are, on average, more accurate than their component ensemble learning techniques.
Traffik
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

A man and his dog try to cross a busy intersection. Copyright held by creator. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Analyses of the Reverse Path Forwarding Routing Algorithm
Authors: Christie Bolton, Gavin Lowe
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

The reverse path forwarding algorithm is a protocol fordistributing messages throughout networks. The intentionis to preserve correctness-messages sent will eventuallybe received by all nodes in the originator's connectedcomponent-whilst minimising the number of propagationsof each message.We use a variety of analysis techniques to identify necessaryadditional constraints, and to prove correctness underthese conditions. In particular we present counter examplesfound by the model-checkers FDR and the Alloy Analyzer,illustrating that the protocol is incorrect if the cost oflinks is dependent upon the node using that link. We thenconsider the case where the cost of links is independent ofthe node using that link; we use a special-purpose networksampling program to increase confidence in the correctnessof this stricter protocol, and then perform a hand-proof toverify correctness. We conclude with a discussion of thesuitability of these techniques for reasoning about protocolsof this complexity.
Two-frequency decomposition
Authors: A. Buzdin, G. Wittum
Venue: Numerische Mathematik (2004)

In this paper, we present a preconditioner for large systems of linear equations based on the block decomposition for block-tridiagonal matrices. This decomposition is in many respects similar to the frequency-filtering method of Wittum [18] and also to the frequency-filtering decomposition of Wagner [4]&#x2013;[6]. In contrast to these methods, our approach requires no pointwise filtering conditions but, as in [1], only averaged ones; this simplifies the implementation without any loss of efficiency. Theoretical analysis of the model problem leads to the convergence rate *** inline equation ***. Numerical experiments demonstrate similar convergence behaviour for a wider class of problems.
The world from a cat&#x2019;s perspective &#x2013; statistics of natural videos
Authors: Belinda Y. Betsch, Wolfgang Einh&#x00e4;user, Konrad P. K&#x00f6;rding, Peter K&#x00f6;nig
Venue: Biological Cybernetics (2004)

The mammalian visual system is one of the most intensively investigated sensory systems. However, our knowledge of the typical input it is operating on is surprisingly limited. To address this issue, we seek to learn about the natural visual environment and the world as seen by a cat. With a CCD camera attached to their head, cats explore several outdoor environments and videos of natural stimuli are recorded from the animals&#x2019; perspective. The statistical analysis of these videos reveals several remarkable properties. First, we find an anisotropy of oriented contours with an enhanced occurrence of horizontal orientations, earlier described in the &#x201c;oblique effect&#x201d; as a predominance of the two cardinal orientations. Second, contrast is not elevated in the center of the images, suggesting different mechanisms of fixation point selection as compared to humans. Third, analyzing a sequence of images we find that the precise position of contours varies faster than their orientation. Finally, collinear contours prevail over parallel shifted contours, matching recent physiological and anatomical results. These findings demonstrate the rich structure of natural visual stimuli and its direct relation to extensively studied anatomical and physiological issues.
A grid-oriented genetic algorithm framework for bioinformatics
Authors: Hiroaki Imade, Ryohei Morishita, Isao Ono, Norihiko Ono, Masahiro Okamoto
Venue: New Generation Computing (2004)

In this paper, we propose a framework for enabling for researchers of genetic algorithms (GAs) to easily develop GAs running on the Grid, named "Grid-Oriented Genetic algorithms (GOGAs)", and actually "Gridify" a GA for estimating genetic networks, which is being developed by our group, in order to examine the usability of the proposed GOGA framework. We also evaluate the scalability of the "Gridified" GA by applying it to a five-gene genetic network estimation problem on a grid testbed constructed in our laboratory.
An Energy-Efficient Adaptive Multiple-Issue Architecture
Authors: Mars Lan, Morteza Biglari-Abhari
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Energy-efficient and low-power designs issues are becoming more important in modern processors. In this paper we propose an energy-efficient adaptive multiple-issue architecture for portable systems. The architecture utilizes a hardware-software cooperation approach to minimize hardware overhead while providing control flexibilities to programs and operating systems. Optimizations are made based on the program execution profile. Simulation results show that the adaptive architecture improves the performance by an average 20% with a maximum 8% reduction in energy consumption compared with the baseline model. The increase in power dissipation is restricted to less than 6%.
Dynamic Filter Cache for Low Power Instruction Memory Hierarchy
Authors: Kugan Vivekanandarajah, Thambipillai Srikanthan, Saurav Bhattacharyya
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Filter cache(FC) is effective in achieving energy saving at the expense of some performance degradation.The energy savings, here, comes from repeated execution of tiny loops from energy efficient FC.The absence of cacheable loops leads to performance degradation in such FC structures. Therefore, we propose a simple dynamic FC scheme, which detects the opportunity for use of the FC and enables (or disables) it dynamically.Thus providing (slightly reduced) energy savings at minimal performance degradation. A combination of the predictive filter cache with the above schemes reduces the performance and energy penalty.For the benchamrks simulated with 256 Byte FC, the average performance degradation is 1.13% with the proposed scheme compared to 2.47% with just the predictive filter cache.With the same configuration, the resulting energy reduction is 42.77%.Finally, the proposed dynamic filter cache scheme is inherently simple and hence it lends well for VLSI efficient implementation.
Multi-Million Gate FPGA Physical Design Challenges
Authors: Maogang Wang, Abhishek Ranjan, Salil Raje
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

The recent past has seen a tremendous increase in the size ofdesign circuits that can be implemented in a single FPGA. Theselarge design sizes significantly impact cycle time due to designautomation software runtimes and an increased number ofperformance based iterations. New FPGA physical designapproaches need to be utilized to alleviate some of theseproblems. Hierarchical approaches to divide and conquer thedesign, early estimation tools for design exploration, andphysical optimizations are some of the key methodologies thathave to be introduced in the FPGA physical design tools. Thispaper will investigate the loss/benefit in quality of results due tohierarchical approaches and compare and contrast some of thedesign automation problem formulations and solutions neededfor FPGAs versus known standard cell ASIC approaches.
Heuristic planning: a declarative approach based on strategies for action selection
Authors: Josefina Sierra-Santibáñez
Venue: Artificial Intelligence (2004)

This paper introduces the notion of heuristic planning, and describes a particular approach to heuristic planning based on a declarative formalization of strategies for action selection. This approach is compared with some heuristic planning systems proposed in the literature. The heuristic information and declarative formalisms for the representation of heuristic knowledge used by these systems are compared in terms of their capacity of controlling the search process and their effectiveness for solving some planning problems. Finally, the results of some experiments on heuristic answer set planning are described in order to show how heuristics can be used to improve the scalability of answer set planning.
Model-based Discovery of Web Services
Authors: Jan Hendrik Hausmann, Reiko Heckel, Marc Lohmann
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Web Services are software components that can be discoveredand employed at runtime using the Internet. Conflictingrequirements towards the nature of these servicescan be identified. From a business perspective, Web Servicespromise to enable the formation of ad-hoc cooperation's ona global scale. From a technical perspective, a high degreeof standardization and rigorous specifications are requiredto enable the automated integration of Web Services. A suitabletechnology for Web Services has to mediate these needsfor flexibility and stability. In this paper, a new approach tothe description of Web Service semantics is introduced. It isa visual approach based on the use of software models andgraph transformations and allows for the description of innovativeservices while providing a precise matching concept.An implementation using current standards and toolsis available.
Use-Based Register Caching with Decoupled Indexing
Authors: J. Adam Butts, Gurindar S. Sohi
Venue: Proceedings of the 31st annual international symposium on Computer architecture (2004)

Wide, deep pipelines need many physical registersto hold the results of in-flight instructions. Simultaneously,high clock frequencies prohibit using largeregister files and bypass networks without a significantperformance penalty. Previously proposed techniquesusing register caching to reduce this penalty sufferfrom several problems including poor insertion andreplacement decisions and the need for a fully-associativecache for good performance. We present novelmechanisms for managing and indexing register cachesthat address these problems using knowledge of thenumber of consumers of each register value.The insertion policy reduces pollution by not cachinga register value when all of its predicted consumersare satisfied by the bypass network. The replacementpolicy selects register cache entries with the fewestremaining uses (often zero), lowering the miss rate. Wealso introduce a new, general method of mapping physicalregisters to register cache sets that improves theperformance of set-associative cache organizations byreducing conflicts. Our results indicate that a 64-entry,two-way set associative cache using these techniquesoutperforms multi-cycle monolithic register files andpreviously proposed hierarchical register files.