ppxscal/embedding_network huggingface dataset:
Bounds on tradeoffs between randomness and communication complexity
Authors: R. Canetti, O. Goldreich
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A quantitative investigation of the power of randomness in the context of communication complexity is initiated. The authors prove general lower bounds on the length of the random input of parties computing a function f, depending on the number of bits communicated and the deterministic communication complexity of f. Four standard models for communication complexity are considered: the random input of the parties may be shared or local, and the communication may be one-way or two-way. The bounds are shown to be tight for all the models, for all values of the deterministic communication complexity, and for all possible quantities of bits exchanged. It is shown that it is possible to reduce the number of random bits required by any protocol, without increasing the number of bits exchanged (up to a limit depending on the advantage achieved by the protocol).
Modeling Biological Networks by Action Languages via Answer Set Programming
Authors: Steve Dworschak, Susanne Grell, Victoria J. Nikiforova, Torsten Schaub, Joachim Selbig
Venue: Constraints (2008)

We describe an approach to modeling biological networks by action languages via answer set programming. To this end, we propose an action language for modeling biological networks, building on previous work by Baral et al. We introduce its syntax and semantics along with a translation into answer set programming, an efficient Boolean Constraint Programming Paradigm. Finally, we describe one of its applications, namely, the sulfur starvation response-pathway of the model plant Arabidopsis thaliana and sketch the functionality of our system and its usage.
A comparison study on fusion methods using evaluation indicators
Authors: V. Karathanassi, P. Kolokousis, S. Ioannidou
Venue: International Journal of Remote Sensing (2007)

Various fusion methods have been developed for improving data spatial resolution. The methods most encountered in the literature are the intensity-hue-saturation (IHS) transform, the Brovey transform, the principal components algorithm (PCA) fusion method, the Gram-Schmidt fusion method, the local mean matching method, the local mean and variance matching method, the least square fusion method, the discrete wavelet fusion method including Daubechies, Symlet, Coiflet, biorthogonal spline, reverse biorthogonal spline, and Meyer wavelets, the wavelet-PCA fusion method, and the crossbred IHS and wavelet fusion method. Using various evaluation indicators such as two-dimensional correlation, relative difference of means, relative variation, deviation index, entropy difference, peak signal-to-noise ratio index and universal image quality index, as well as photo-interpretation methods and techniques, results of the above fusion methods were compared and comments on the fusion methods and potential of evaluation indicators were made. Among data fusion methods and indicators the local mean and variance matching methods proved the most efficient and the peak signal-to-noise ratio indicator proved the most appropriate for the evaluation of data fusion results.
Smooth adaptive sliding mode observers in uncertain chaotic communication
Authors: R. Raoufi, A. S. I. Zinober
Venue: International Journal of Systems Science (2007)

We study the performance of adaptive sliding mode observers (ASMO) in chaotic synchronization and communication in the presence of uncertainties. The proposed robust adaptive observer-based synchronization is used for cryptography based on non-linear chaotic masking modulation (NCM). Uncertainties are intentionally injected into the chaotic dynamical system to achieve higher security and we use robust sliding mode observer design methods for the uncertain non-linear dynamics. In addition, a relaxed matching condition and a boundary layer smooth gain are introduced to realize the robust observer design more feasibly. A brief study in introducing an alternative augmented ASMO-based chaotic communication configuration will be discussed. Finally, a Lorenz system is employed as an illustrative example to demonstrate the effectiveness and feasibility of the proposed cryptosystem.
Using the Model Coupling Toolkit to couple earth system models
Authors: John C. Warner, Natalie Perlin, Eric D. Skyllingstad
Venue: Environmental Modelling Software (2008)

Continued advances in computational resources are providing the opportunity to operate more sophisticated numerical models. Additionally, there is an increasing demand for multidisciplinary studies that include interactions between different physical processes. Therefore there is a strong desire to develop coupled modeling systems that utilize existing models and allow efficient data exchange and model control. The basic system would entail model ''1'' running on ''M'' processors and model ''2'' running on ''N'' processors, with efficient exchange of model fields at predetermined synchronization intervals. Here we demonstrate two coupled systems: the coupling of the ocean circulation model Regional Ocean Modeling System (ROMS) to the surface wave model Simulating WAves Nearshore (SWAN), and the coupling of ROMS to the atmospheric model Coupled Ocean Atmosphere Prediction System (COAMPS). Both coupled systems use the Model Coupling Toolkit (MCT) as a mechanism for operation control and inter-model distributed memory transfer of model variables. In this paper we describe requirements and other options for model coupling, explain the MCT library, ROMS, SWAN and COAMPS models, methods for grid decomposition and sparse matrix interpolation, and provide an example from each coupled system. Methods presented in this paper are clearly applicable for coupling of other types of models.
Particle Transfer and Detection in a Microspheres Based Detoxification System
Authors: M. Brandl, J. Hartmann, T. Posnicek, D. Falkenhagen
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

Extracorporeal blood purification by means of the adsorption system MDS is based on high specific microparticle adsorbent for toxin removal. A thin-wall hollow-fiber membrane filter separates the microparticle-plasma suspension from the bloodstream. For patient safety, it is necessary to have a means to detect membrane ruptures that could lead to a release of microparticles into the patient's bloodstream. A non invasive optical detection system was developed to monitor the extracorporeal venous bloodstream for the presence of released microparticles. For detection, labeled microspheres are suspended with the adsorbent particles. In the case of a membrane rupture, the labeled particles would be released together with the microadsorbent. A detailed description for the system setup is introduced.
Towards a value-based approach in software engineering
Authors: Pasi Ojala
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

The number of companies producing software has grown constantly, and it seems that we need software more and more everyday. Lately, several authors have discussed about the importance of cost efficiency and value creation in software development as well in software process and product improvement (SPI). It also seems that several companies have noticed that competition is increasing and cost-efficient companies have perhaps more competitive advantage in global markets than ever. This study discusses about the concepts, principles and practical methods of economic-driven software engineering and outlines us to understand better the content of value-based approach. This is done in part by presenting a conceptual analysis of the economic-driven view of software development including cost estimation and cost accounting and in part by discussing the cost-efficiency and value characteristics of software processes, products and their improvement. As a summary this study proposes to use value-based approach to find solutions for cost efficiency related challenges. As well it encourages both technical and economical sciences to work together when creating meaningful and practical solutions for our everyday use.
A Document Clustering Method Based on Hierarchical Algorithm with Model Clustering
Authors: Haojun Sun, Zhihui Liu, Lingjun Kong
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Document clustering is an important tool for text analysis and is used in many applications. This work develops a novel hierarchal algorithm for document clustering. We are particularly interested in studying and making use of cluster overlapping phenomenon to design cluster merging criteria. In our previous papers, the theoretical results on the overlap rate between clusters based on the Gaussian mixture model were reported. In this paper, we propose a new way to compute the overlap rate in order to improve time efficiency and “the veracity”. The way is that we use a line passed through the two cluster’s center instead of the Ridge Curve. Based on the Hierarchical Clustering Method, we use the Expectation-Maximization (EM) algorithm in the Gaussian Mixture Model to count the parameters and make the two sub-clusters combined when their overlap is the largest. Experiments in both public data and document clustering data show that this approach can improve the efficiency of clustering and save computing time.
Visual creation of inhabited 3D environments: An ontology-based approach
Authors: Alejandra Garc&#x00ed;a-Rojas, Mario Guti&#x00e9;rrez, Daniel Thalmann
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

The creation of virtual reality applications and 3D environments is a complex task that requires good programming skills and expertise in computer graphics and many other disciplines. The complexity increases when we want to include complex entities such as virtual characters and animate them. In this paper we present a system that assists in the tasks of setting up a 3D scene and configuring several parameters affecting the behavior of virtual entities like objects and autonomous virtual humans. Our application is based on a visual programming paradigm, supported by a semantic representation, an ontology for virtual environments. The ontology allows us to store and organize the components of a 3D scene, together with the knowledge associated with them. It is also used to expose functionalities in the given 3D engine. Based on a formal representation of its components, the proposed architecture provides a scalable VR system. Using this system, non-experts can set up interactive scenarios with minimum effort; no programming skills or advanced knowledge is required.
GOSAP: Gene Ontology-Based Semantic Alignment of Biological Pathways
Authors: Jonas Gamalielsson, Bjorn Olsson
Venue: International Journal of Bioinformatics Research and Applications (2008)

We present a new method for semantic comparison of biological pathways, aiming to discover evolutionary conservation of pathways between species. Our method uses all three sub-ontologies of Gene Ontology (GO) and a measure of semantic similarity to calculate match scores between gene products. These scores are used for finding local pairwise pathway alignments. This approach has the advantage of being applicable to all types of pathways where nodes are gene products, e.g., regulatory pathways, signalling pathways and metabolic enzyme-to-enzyme pathways. We demonstrate the usefulness of the method using regulatory and metabolic pathways from E. coli and S. cerevisiae as examples.
Tighter bounds for random projections of manifolds
Authors: Kenneth L. Clarkson
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The most direct application of the lemma applies to a finite set of points, but recent work has extended the technique to affine subspaces, curves, and general smooth manifolds. Here the case of random projection of smooth manifolds is considered, and a previous analysis is sharpened, reducing the dependence on such properties as the manifold's maximum curvature.
A game loop architecture for the GPU used as a math coprocessor in real-time applications
Authors: Marcelo P. M. Zamith, Esteban W. G. Clua, Aura Conci, Anselmo Montenegro, Regina C. P. Leal-Toledo, Paulo A. Pagliosa, Luis Valente, Bruno Feij
Venue: Computers in Entertainment (CIE) (2008)

This article concerns the use of a graphics processor unit (GPU) as a math co-processor in real-time applications in special games and physics simulations. To validate this approach, we present a new game loop architecture that employs GPUs for general-purpose computations (GPGPUs). A critical issue here is the process distribution between the CPU and the GPU. The architecture consists of a model for distribution, and our implementation offers many advantages in comparison to other approaches without the GPGPU stage. This architecture can be used either by a general-purpose language such as the Compute Unified Device Architecture (CUDA), or shader languages such as the High-Level Shader Language (HLSL) and the OpenGL Shading Language (GLSL). Although the architecture proposed here aims at supporting mathematics and physics on the GPU, it is possible to adapt any kind of generic computation. This article discusses the model implementation in an open-source game engine and presents the results of using this platform.
Quality of Life Supporters Employing Music Therapy
Authors: Nikolay Mirenkov, Kamen Kanev, Hiroshi Takezawa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Music therapy addresses physiological, cognitive, and social needs of individuals and employs music to enhance quality of human lives through creation of positive changes. In this paper, we consider applying music therapy to human-computer interfaces, based on Quality of Life Supporters (QLS) of self-explanatory type, and oriented to elderly and disabled people. QLS are multi-modal communicators for person-environment (P-E) fit adjustments that take into account individual emotions and wellbeing. The "Circumplex model" published by Russell (1980) is employed for constructing optimal sequences of steps allowing smooth transition between any current and target emotional states in the course of computer assisted sessions. Findings regarding optimal step sizes and preferable types of music applicable for each step, as well as empirical methods of acquiring knowledge concerning relations between music and emotions are reported in result.
Environmental management system for the organizations to achieve business excellence
Authors: Gurumurthy Vijayan Iyer, Nikos E. Mastorakis
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

The ISO 14000 Environmental Management System (EMS) standards apply to the management system concepts of total quality management (TQM) to the management of an organization's environmental issues and opportunities. It defines the features of an EMS that need to be in place to ensure that the organization identifies and focuses on improving areas where they have significant environmental impacts. In the present article, steps involved to implement EMS in an organization through ISO-14000 EMS standards are discussed. This system can be integrated with ISO 9000 Quality Management System (QMS) standards in order to achieve excellence in quality as well as environmental obligations. The overall aim of the EMS is to provide protection to the environment and to prevent pollution so as to manufacture eco-friendly products and services. EMS focuses on key drives of performance excellence in products and processes as well as organizations that are focused on delivering values to the customers, internal operational processes, and to staff's learning. Hence, this system approach to the environmental management shall achieve excellence in the overall performances of the organization.
Testing equalities of multiplicative representations in polynomial time
Authors: Guoqiang Ge
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

For multiplicative representations /spl Pi//sub i=1//sup k//spl alpha//sub i//sup n(i)/ and /spl Pi//sub j=1//sup l//spl beta//sub j//sup m(j)/ where /spl alpha//sub i/, /spl beta//sub j/ are non-zero elements of some algebraic number field K and n/sub i/, m/sub j/ are rational integers, we present a deterministic polynomial time algorithm that decides whether /spl Pi//sub i=1//sup k//spl alpha//sub i//sup n(i)/ equals /spl Pi//sub j=1//sup l//spl beta//sub j//sup m(j)/. The running time of the algorithm is polynomial in the number of bits required to represent the number field K, the elements /spl alpha//sub i/, /spl beta//sub j/ and the integers n/sub i/, m/sub j/.
Graph summarization with bounded error
Authors: Saket Navlakha, Rajeev Rastogi, Nisheeth Shrivastava
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We propose a highly compact two-part representation of a given graph G consisting of a graph summary and a set of corrections. The graph summary is an aggregate graph in which each node corresponds to a set of nodes in G, and each edge represents the edges between all pair of nodes in the two sets. On the other hand, the corrections portion specifies the list of edge-corrections that should be applied to the summary to recreate G. Our representations allow for both lossless and lossy graph compression with bounds on the introduced error. Further, in combination with the MDL principle, they yield highly intuitive coarse-level summaries of the input graph G. We develop algorithms to construct highly compressed graph representations with small sizes and guaranteed accuracy, and validate our approach through an extensive set of experiments with multiple real-life graph data sets. To the best of our knowledge, this is the first work to compute graph summaries using the MDL principle, and use the summaries (along with corrections) to compress graphs with bounded error.
The Rate-Distortion Function of a Poisson Process with a Queueing Distortion Measure
Authors: Todd P. Coleman, Negar Kiyavash, Vijay G. Subramanian
Venue: Proceedings of the Data Compression Conference (2008)

This paper presents a proof of the rate distortion function of a Poisson process with a queuing distortion measure that is in complete analogy with the proofs associated with the rate distortion functions of a Bernoulli source with Hamming distortion measure and a Gaussian source with squared-error distortion measure. Analogous to those problems, the distortion measure that we consider is related to the logarithm of the conditional distribution relating the input to the output of a well-known channel coding problem, specifically the Anantharam and Verdu "Bits through Queues" coding problem. Our proof of the converse utilizes McFadden's point process entropy formulation and involves a number of mutual information inequalities, one of which exploits the maximum-entropy achieving property of the Poisson process. Our test channel uses Burke's theorem to prove achievability.
Numerical and experimental analysis of long range guided waves for nondestructive testing of pipes
Authors: F. Bertoncini, M. Raugi
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

In this paper numerical and experimental analysis of long range guided waves for non destructive testing of pipes is carried out. Guided waves based NonDestructiveTesting (NDT) methods offer considerable advantages over conventional techniques because they allow the inspection of wide areas from a single point of measure; therefore they are currently being investigated by some researchers. The analysis of the measured data from guided wave propagation in pipes requires advanced processing data systems to extract the right information on defect size and location. Then, a full comprehension of the physical phenomena underlying this technique is fundamental for a successful and reliable use of this technique. Then combined numerical and experimental analyses are of fundamental importance. In this paper a finite element code is used to numerical simulate the guided wave phenomenon in pipes. Furthermore, an experimental set-up showing critical characteristics has been arranged for the testing of the numerical data.
On the computation of 3d periodic triangulations
Authors: Manuel Caroli, Monique Teillaud
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

In this video, we first review the incremental algorithm to compute Delaunay triangulations in R3. Then we examine the case of the periodic space T3, focusing on the differences with R3.
Approximate string matching in sublinear expected time
Authors: W. I. Chang, E. L. Lawler
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The k differences approximate string matching problem specifies a text string of length n, a pattern string of length m, and the number k of differences (insertions, deletions, substitutions) allowed in a match, and asks for every location in the text where a match occurs. Previous algorithms required at least O(nk) time. When k is as large as a fraction of m, no substantial progress has been made over O(nm) dynamic programming. The authors have investigated much faster algorithms for restricted cases of the problem, such as when the text string is random and errors are not too frequent. They have devised an algorithm that, for k
A novel design method of time-interleaved subranging ADC
Authors: Ki Chul Park, Seong Ik Cho
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

A novel design method of time-interleaved subranging ADC is presented. We use the bisection method to let only half of comparators in typical subranging ADC working in every clock cycle. Thus, we are able to reduce the number of comparators by half. It is possible to reduce the die size. An example of 8-bit time-interleaved subranging ADC operates at 40MHz sampling rate and 1.8V supply voltage is demonstrated. The power consumption of the proposed circuit is only 10mV with SPECTRE simulation. Compared with the typical subranging ADC, our bisection method is able to reduce up to 40% in die size.
Modelling the Interaction of Distributed Systems as Protocols
Authors: Johannes Reich
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

In descriptions of loosely coupled process-like interactions of computational systems and especially in the literature on electronic business processes, the protocol notion is often used only informally. However, its complete expressive power becomes effective only with a precise formalization. Based on Holzmann's protocol concept, a formal protocol definition is introduced, providing an inductive definition of the protocol transition relation. The protocol transition relation describes all possible interactions between system components which are formally specified as nondeterministic extended finite input output automata.The formal approach is illustrated by means of a buying selling business interaction. Additionally, it is used to illustrate some semantic shortcomings of the ``transaction pattern'' approach, which tries to partition process-like interactions into one- and two-way interactions.In the discussion, the ``loose'' aspect of a protocol based interaction is treated. Motivated by the non-functional system relation defined by a protocol, it is proposed to classify the exchanged information between systems according to their logical relation in documents for (nondeterministic) protocols and I/O parameters for remote function calls.