ppxscal/embedding_network huggingface dataset:
Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity
Authors: Yitong Yin
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We study the nondeterministic cell-probe complexity of static data structures. We introduce cell-probe proofs (CPP), a proof system for the cell-probe model, which describes verifications instead of computations in the cell-probe model. We present a combinatorial characterization of CPP. With this novel tool, we prove the following lower bounds for the nondeterministic cell-probe complexity of static data structures: We show that there exist data structure problems which have super-constant nondeterministic cell-probe complexity. In particular, we show that for the exact nearest neighbor search (NNS) problem or the partial match problem in high dimensional Hamming space, there does not exist a static data structure with Poly(n) cells, each of which contains n o(1) bits, such that the nondeterministic cell-probe complexity is O(1), where n is the number of points in the data set for the NNS or partial match problem. For the polynomial evaluation problem, if single-cell nondeterministic probes are sufficient, then either the size of a single cell is close to the size of the whole polynomial, or the total size of the data structure is close to that of a naive data structure that stores results for all possible queries.
The Quantification Study on Emergencies and their Influence on Corporation Credit Risks
Authors: Shujun Ye, Jing Liang, Fajin Gong
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

This study tries to reveal emergencies and their influence on corporation credit risks. Based on the recognition of emergency and its definition, we establish Poisson process model of emergencies and compound Poisson process model of emergencies’ influence on corporation credit risks. And then, we do some quantification study on them. It turns out that the expectation of the influence can be quantified as a certain formula during a certain interval. Affected by emergencies, the time interval, in which a corporation credit level lasted, can also be ascertained.
Segmentation of Moving Foreground Objects Using Codebook and Local Binary Patterns
Authors: Bo Li, Zhen Tang, Baozong Yuan, Zhenjiang Miao
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Robust detection of moving objects in complex scenes is one of the most challenging issues in computer vision. In this paper, we present a novel texture-wise approach to segment moving objects with codebook and local binary patterns (LBP). In many moving segmentation algorithms, the information from limited frames before current image is used. Our approach models background over long time with small memory. Firstly, we construct codebook model which represents a compressed form of background model for long image sequences. A single Gaussian model of per-pixel is built to deal with illumination changes. By using the correlation and texture of spatially proximal pixels, local binary patterns background model is constructed. Finally current image is segmented into two parts, foreground and background, by comparing current image with background model. Experiments show that the proposed approach achieves promising results robustly in real videos.
Algebraic Models for Bidirectional Model Synchronization
Authors: Zinovy Diskin
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

The paper presents several algebraic models for semantics of bidirectional model synchronization and transformation. Different patterns of model synchronization are analyzed (including view updates and incremental synchronization), and this analysis motivates the formal definitions. Relationships between the formal models are precisely specified and discussed. A new formal model of updates is proposed.
A Method of Representing the Solid Design Process
Authors: Hiroaki Chiyokura, Fumihiko Kimura
Venue: IEEE Computer Graphics and Applications (1985)

Wish modeling systems were more user friendly? This one quickly regenerates a solid design from previous developmental stages to ease the usual trial-and-error procedurtes
Application aspects of data mining analysis on evolving graphs
Authors: Mukkai S. Krishnamoorthy
Venue:  (2007)

With the recent discovery that many real-world networks have many things in common, and in particular in how such networks evolve, have increased interest in the study of evolution of networks. Adding the dimension of time to the analysis of graphs, evolving graphs present opportunities and challenges for analysts to extract valued information.In this thesis, the application aspects of evolving graphs are explored. We introduce the Evolving Graph Markup Language (EGML), an XML application for representing evolving graphs and related results. Along with EGML, we provide a software tool for the study of evolving graphs. Metrics, the common tool for graph analysis, are explored. We study classic problems of data mining such as ranking, clustering, and prediction problems and visualization of evolving graphs, specifically the drawing of an evolving graph.Through our research, we explore techniques that improve the computation time required to calculate metrics for evolving graphs. Further, we develop new techniques that address ranking and clustering problems of evolving graphs, and provide new models and methods for prediction problems of evolving graphs. Finally, we explore new evolving graph drawing techniques.The results on metric experiments show that using update technique on metrics significantly improve computation time. In ranking problem experiments, utilizing different metrics in ranking algorithm yields different results and PageRank produces the closest rank result to the original rank of Eurovision competition data. In clustering problem experiments, different clustering algorithms perform well on different quality measures. The single linkage clustering produces the highest coverage quality measure, PageRank clustering produces the highest conductance quality measure, and MCL produces the highest performance quality measure. In prediction problem experiments, our methods for each model all predict better than random prediction. And last, our evolving graph drawing techniques reduce the vertex movements between graph instances, so that evolving graph can be viewed with smooth transition.
On Periodicity of Generalized Two-Dimensional Words
Authors: Svetlana Puzynina
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

A generalized two-dimensional word is a function on ¿2 with finite number of values. The main problem we are interested in is periodicity of two-dimensional words satisfying some local conditions. Let $A=(a_{ij})_{i,j=1}^n$ be an integer matrix. The function φ: ¿2 ¿¿ n is a generalized centered function of radius r with the matrix A if $$\sum\limits_{\scriptsize \begin{array}{c} (y_1, y_2): \\ 0 for every integers x 1, x 2. We prove that every bounded generalized centered function of radius r > 1 is periodic. For r = 1 periodicity depends on spectrum of the matrix A. Similar results are obtained for the infinite triangular and hexagonal grids.
Does the Cell Compute?
Authors: Giuseppe Trautteur
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We propose a tentative parallel between computational features and cellular operations in order to explore the possibility that the cell itself is intrinsically and not metaphorically a symbol-processing, computing entity. Central to this possible identification is the notion of virtuality, as understood in computational theory.
Intrinsic Motivational Factors for the Intention to Use Adaptive Technology: Validation of a Causal Model
Authors: Fabio Pianesi, Ilenia Graziola, Massimo Zancanaro
Venue: Proceedings of the 11th international conference on User Modeling (2007)

In this paper, we propose and validate a model of the `intention to use' adaptive audio-video guides in a museum setting, extending TAM to include intrinsic motivational factors (involvement, attention) and constructs specific to adaptivity (control, personalization). The results of a PLS analysis ran on the data from 115 subjects show that for adaptive museum guides intention to use is not affected by such traditional construct as perceived ease of use, whereas perceived usefulness and enjoyment play an important role. Also, both personalization and control are causally relevant, the former affecting enjoyment and the latter the perceived usefulness.
Three dimensional knowledge visualization in the theatre studies classroom
Authors: Iryna Kuksa
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Education is naturally a social process, where knowledge is an experience and information is an environment. Cyberspace is able to create a new multi-participant classroom, where learners are able to compare various forms of delivery and choose one they prefer. Computer-mediated learning can greatly shift traditional modes of knowledge delivery towards a more visually-enhanced experience, which is especially important for exploring scenographic artefacts. New approaches to theatre education and research have already been established through the global use of digital communication technologies. Three dimensional (3D) modelling and navigation techniques proved very efficient in improving the understanding of communicative qualities of set design and accelerating learning. In this paper, I will introduce the first 3D reconstruction of one of the finest examples of unrealized modernist stage design -- The Divine Comedy (1921) by Norman Bel Geddes. The model is integrated within the body of the Set-SPECTRUM educational project, which was created with the intention to enable theatre students and scholars to understand and study this remarkable stage-construction using digital means of presentation This approach to knowledge visualization aims to strengthen the established approach to research, learning, and teaching, but also to transform the passive consumers of digital products into active participants. The paper concludes with a detailed discussion of the social implications of using computer-generated learning environments.
Square-free partial words
Authors: Vesa Halava, Tero Harju, Tomi Kärki
Venue: Information Processing Letters (2008)

We say that a partial word w over an alphabet A is square-free if every factor xx^' of w such that x and x^' are compatible is either of the form @?a or a@? where @? is a hole and a@?A. We prove that there exist uncountably many square-free partial words over a ternary alphabet with an infinite number of holes.
Validating Evolving Simulations in COERCE
Authors: Paul F. Reynolds,  Jr., Michael Spiegel, Xinyu Liu, Ross Gore
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

We seek to increase user confidence in simulations as they are adapted to meet new requirements. Our approach includes formal representation of uncertainty, lightweight validation, and novel techniques for exploring emergent behavior. Uncertainty representation, using formalisms such as Dempster-Shafer theory, can capture designer insight about uncertainty, enabling formal analysis and improving communication with decision and policy makers. Lightweight validation employs targeted program analysis and automated regression testing to maintain user confidence as adaptations occur. Emergent behavior validation exploits the semi-automatic adaptation capability of COERCE to make exploration of such behavior efficient and productive. We describe our research on these three technologies and their impact on validating dynamically evolving simulations.
Physically Based Finite Element Model of the Face
Authors: Giuseppe Barbarino, Mahmood Jabareen, Juergen Trzewik, Edoardo Mazza
Venue: Proceedings of the 4th international symposium on Biomedical Simulation (2008)

The proposed 3D finite element model of the face aims at a faithful representation of the anatomy, the mechanical interactions between different tissues, and the non linear force deformation characteristics of tissues. Bones and soft tissues were reconstructed from magnetic resonance images. Non linear constitutive equations are implemented in the numerical model. The corresponding model parameters were selected according to previous work with mechanical measurements on soft facial tissue. Model assumptions concerning tissues geometry, mechanical properties and boundary conditions were validated through comparison with measurements of the facial tissue response to gravity loads and to the application of a pressure inside the oral cavity. In particular, parametric studies were carried out in order to quantify the influence of constitutive model parameters of muscles. The model described in this paper might be used for simulation of plastic and reconstructive surgery and for investigation of the physiology and pathology of face deformation.
A Continuous Derivative for Real-Valued Functions
Authors: Abbas Edalat
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We develop a notion of derivative of a real-valued function on a Banach space, called the L-derivative, which is constructed by introducing a generalization of Lipschitz constant of a map. The values of the L-derivative of a function are non-empty weak* compact and convex subsets of the dual of the Banach space. This is also the case for the Clarke generalised gradient. The L-derivative, however, is shown to be upper semi continuous with respect to the weak* topology, a result which is not known to hold for the Clarke gradient on infinite dimensional Banach spaces. We also formulate the notion of primitive maps dual to the L-derivative, an extension of Fundamental Theorem of Calculus for the L-derivative and a domain for computation of real-valued functions on a Banach space with a corresponding computability theory.
Modeling word perception using the Elman network
Authors: Cheng-Yuan Liou, Jau-Chi Huang, Wen-Chie Yang
Venue: Neurocomputing (2008)

This paper presents an automatic acquisition process to acquire the semantic meaning for the words. This process obtains the representation vectors for stemmed words by iteratively improving the vectors, using a trained Elman network. Experiments performed on a corpus composed of Shakespeare's writings show its linguistic analysis and categorization abilities.
Document Summarization Using Non-Negative Matrix Factorization and Relevance Feedback
Authors: Sun Park, Ju-Hong Lee, Deok-Hwan Kim, Chan-Min Ahn
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper proposes a new document summarization method using relevance feedback (RF) and non-negative matrix factorization (NMF) to distill the contents of the documents with respect to a given query. The proposed method expands the query through relevance feedback to reflect user's requirement and extract meaningful sentences using the cosine similarity measure between the expanded query and the semantic features which are obtained by NMF. It can reduce the semantic gap between the low level feature representation in vector model and the high level user's perception by means of iterative relevance feedback. The experimental results demonstrate that the proposed method achieves better performance than the other methods.
A temporal logic for Markov chains
Authors: Wojciech Jamroga
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Most models of agents and multi-agent systems include information about possible states of the system (that defines relations between states and their external characteristics), and information about relationships between states. Qualitative models of this kind assign no numerical measures to these relationships. At the same time, quantitative models assume that the relationships are measurable, and provide numerical information about the degrees of relations. In this paper, we explore the analogies between some qualitative and quantitative models of agents/processes, especially those between transition systems and Markovian models. Typical analysis of Markovian models of processes refers only to the expected utility that can be obtained by the process. On the other hand, modal logic offers a systematic method of describing phenomena by combining various modal operators. Here, we try to exploit linguistic features, offered by propositional modal logic, for analysis of Markov chains and Markov decision processes. To this end, we propose Markov temporal logic - a multi-valued logic that extends the branching time logic CTL*.
Cognitive agents with non-monotonic reasoning
Authors: Peter Novák
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: doctoral mentoring program (2008)

This extended abstract provides an overview of my research towards a dissertation thesis in the context of programming cognitive agents with non-monotonic reasoning capabilities.
Selective Visual Attention for Object Detection on a Legged Robot
Authors: Daniel Stronger, Peter Stone
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

Autonomous robots can use a variety of sensors, such as sonar, laser range finders, and bump sensors, to sense their environments. Visual information from an onboard camera can provide particularly rich sensor data. However, processing all the pixels in every image, even with simple operations, can be computationally taxing for robots equipped with cameras of reasonable resolution and frame rate. This paper presents a novel method for a legged robot equipped with a camera to use selective visual attention to efficiently recognize objects in its environment. The resulting attention-based approach is fully implemented and validated on an Aibo ERS-7. It effectively processes incoming images 50 times faster than a baseline approach, with no significant difference in the efficacy of its object detection.
Construction and Complete Circuit for Quantum Low Density Parity Check Code
Authors: Sheng-mei Zhao, Bao-yu Zheng
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Quantum error correction is the basic technique for realization of quantum communication and quantum computation. So far, the theories of quantum error correction have become more and more perfect, and many counterpart of classical error correction coding technique have been found in quantum area. In this article, we proposed a new method of construction of party check matrix of quantum low density parity check (LDPC) codes which based on classical quasi-cyclic LDPC codes, and selected the quantum code (3,8)(16,6) as the example to illustrate the construction of quantum code. We also gave its completing circuit by Controlled-not gate and Hadamard gate.
A Double Domain Based Robust Digital Image Watermarking Scheme
Authors: Chuang Lin, Jeng-Shyang Pan, Zhe-Ming Lu
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

In this paper, a double domain based robust digital image watermarking scheme is proposed. Up to now, the existing robust watermarking algorithms can only resist a part of geometrical attacks and some common image processing attacks, while the proposed method can resist almost all geometrical attacks and a lot of common image processing attacks. Firstly, the watermark is embedded in the 3-level DWT coefficients by the parity modulation method, and then the same watermark is embedded in the pixel domain by the similar method. At the detector side, the watermark is extracted twice, one is in the DWT domain, the other is in the pixel domain. Select the watermark which has better visual quality as the final result. By carefully regulating the parameters and selecting the embedding sequence, the watermarks in the two domains are compatible with each other. Experimental results show the effectiveness of the proposed method.
Comparing collaborative and independent search in a recall-oriented task
Authors: Hideo Joho, David Hannah, Joemon M. Jose
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

Search interfaces are mainly designed to support a single searcher at a time. We therefore have a limited understanding of how an interface can support search where more than one searcher concurrently pursues a shared information need. This paper investigated the performance and user behaviour of concurrent search. Based on a recall-oriented search task, a user study was carried out to compare an independent search condition to collaborative search conditions. The results show that the collaborative conditions helped searchers diversify search vocabulary while reducing redundant documents to be bookmarked within teams. However, these effects were found to be insufficient to improve the retrieval effectiveness. We discussed the implications for concurrent search support based on our findings.
Experimental Tests on SCTP over IPSec
Authors: Maria-Dolores Cano, Juan A. Romero, Fernando Cerdan
Venue: Proceedings of the 2008 IFIP International Conference on Network and Parallel Computing (2008)

As telecommunication technologies evolve, security in communications becomes a more and more relevant issue. IPSec is a set of protocols aiming to enhance security at the IP layer. Specifically, IPSec and IKE are important security mechanism that provide cryptographic-based protection for IP packets, and consequently for IP services. SCTP is a standardized transport protocol whose main features include multihoming and multistreaming, and is gaining momentum as a general-purpose transport protocol. While the simultaneous use of these two protocols is feasible, it is under study how to make them work efficiently. In this paper, we present a simple method to improve SCTP-IPSec-IKE compatibility by modifying the structure of the Security Associations. Despite the conceptual simplicity of our proposal, it has not been proposed before in related literature.
Solutions to improve dust collection with plate-type electrostatic precipitators
Authors: Gabriel Nicolae Popa, Ioan Sora, Victor Vaida, Sorin Deaconu, Iosif Popa
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The plate-type electrostatic precipitators can treat large gas flows with low pressure drops, can also operate a wide range of temperatures and have low operating cost. A problem of this type of precipitator is difficulty to collection high resistivity fly ash. In the inlet section the fly ash resistivity is moderate and is necessary to charge dust particles as many is possible. It is useful to use traditional dc energization. For the middle section and especially for outlet section, where the fly ash resistivity is high, it is necessary another supply solution for section because the charging particle decrease when is use traditional dc energization. The intermitent energization of sections can be a cheap solution to middle and outlet section (without change the power supply structure, will change only the automatic voltage control unit).