ppxscal/embedding_network huggingface dataset:
The Complexity of Quickly ORM-Decidable Sets
Authors: Joel D. Hamkins, David Linetsky, Russell Miller
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quickly by ORMs. In particular, we show that the arithmetical sets are exactly those sets that can be decided by ORMs in times uniformly less than ${\ensuremath{\omega^\omega}}$. Further, we show that the hyperarithmetical sets are exactly those sets that can be decided by an ORM in time uniformly less than $\omega_1^{CK}$.
Software engineering for and with artists: a case study
Authors: Anna Trifonova, Øyvind Brandtsegg, Letizia Jaccheri
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

The article presents ImproSculpt -- a live performance instrument for algorithmic composition and improvised audio manipulation. A custom version of the software has been used within several interactive art installations, one of which (i.e. Flyndre) will be described. Besides the software characteristics and usage modes we present and discuss the software engineering challenges, problems and lessons learned during the development of ImproSculpt. Several methodologies were used in the case study: observing the project through its life cycle; analyzing the software and its documentation; questionnaire with the artist who is also the main developer; two software engineering interventions. The support of high performance, easy modifiability and availability were found to be particularly important. The development of a modular architecture has been identified as a way to satisfy some of the non-functional quality attributes of the software that appeared with the growth of the project. Furthermore, ImproSculpt has been published as open source software in order to increase access to wider public and stimulate input from interested community - software developers and artists.
Modeling of 3D Scene Based on Series of Photographs Taken with Different Depth-of-Field
Authors: Marcin Denkowski, Michał Chlebiej, Paweł Mikołajczak
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

This paper presents a method for fusing multifocus images into enhanced depth-of-field composite image and creating a 3D model of a photographed scene. A set of images of the same scene is taken from a typical digital camera with macro lenses with different depth-of-field. The method employs convolution and morphological filters to designate sharp regions in this set of images and combine them together into an image where all regions are properly focused. The presented method consists of several phases including: image registration, height map creation, image reconstruction and final 3D scene reconstruction. In result a 3D model of the photographed object is created.
Static Loop Bound Analysis of C Programs Based on Flow Analysis and Abstract Interpretation
Authors: Marianne de Michiel, Armelle Bonenfant, Hugues Cassé, Pascal Sainrat
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

One of the important steps in processing the worst case execution time (WCET) of a program is to determine the loops upper bounds. Such bounds are crucial when verifying real-time systems. In this paper, we propose a static loop bound analysis which associates flow analysis and abstract interpretation. It considers binary operators (+, -, *, \) for the loop increment, nested loops, non-recursive function calls, simple loop conditions (==, !=,, >=, &&) and loop upper bound values (instead of intervals). We present the result of our analysis on the Mälardalen benchmark suite and compare them to the recent work of Ermedahl et al.
Duplication Mechanism and Disruptions in Flanking Regions Influence the Fate of Mammalian Gene Duplicates
Authors: Paul Ryvkin, Jin Jun, Edward Hemphill, Craig Nelson
Venue: Proceedings of the international workshop on Comparative Genomics (2008)

Here we identify duplicated genes in five mammalian genomes and classify these duplicates based on the mechanisms by which they were generated. Retrotransposition accounts for at least half of all predicted duplicate genes in these genomes, with tandem and interspersed duplicates comprising the other half. Estimation of the evolutionary rates in each class revealed greater rate asymmetry between retrotransposed and interspersed segmental duplicate pairs than between tandem duplicates, suggesting that retrotransposed and interspersed segmental duplicates are diverging more quickly. In an attempt to understand the basis of this asymmetry we identified disruption of flanking DNA as an indicator of new duplicate fate. Loss of synteny accelerates the asymmetry of divergence of DNA-mediated duplicates duplicates. These findings suggest that the differential evolution of duplicate genes may be significantly influenced by changes in local genome architecture and synteny.
Interconnected networks and the governance of risk and trust
Authors: Victor Bekkers, Marcel Thaens
Venue: Information Polity (2005)

Interconnected networks constitute the backbone of our society and bring many advantages to our daily life and activities. At the same time, however, our dependence on these networks and the fact that they are all interconnected makes our society vulnerable. Risks emerge from these interdependencies. How can society deal with these risks? To answer this question we first explore the closely related concepts of risk and trust. These explorations enable us to understand the implications of interconnected networks in terms of governance challenges. On the basis of this insight, we conclude that it is impossible to define risk as a 'general' policy concept. A major policy challenge in the governance of risk is not only the interplay of all kinds of networks and infrastructures, but also the interplay between diverse policy regimes with different governance models. We have discerned a number of specific governance models that can be used to handle the risks resulting from interconnected networks and infrastructures. Following Ashby's law of requisite variety, the variety of risks in the network society asks for a variety of risk governance models, in which different values are attached to the role of government, the private sector and the civil society.
A study on fault diagnosis of induction motor using neural-wavelet
Authors: Jung-Ho Shin, Hye-Youn Lim, Jing-Chen Qian, Dae-Seong Kang
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

The induction motors effort to widely industrial fields. On the contrary, faults of the induction motors cause another faults of the whole system, because the faults of the induction motors often progress through long time. It is very important that diagnosis for diagnosis fault and extracted fault feature from the acquired signal using wavelet transform. Extracted features use the fault diagnosis with neural network.
Subrange Caching: Handling Popular Range Queries in DHTs
Authors: Marc Sànchez-Artigas, Pedro García-López, Antonio G. Skarmeta
Venue: Proceedings of the 1st international conference on Data Management in Grid and Peer-to-Peer Systems (2008)

Range query, which is defined as retrieving all the keys within a certain range over the underlying DHT, has attracted a lot of attention recently. However, little has been done to speed up range queries through caching, one of the least studied P2P problems. In this paper, we present a caching protocol that (1) has excellent parallelizability, (2) can achieve O(1) complexity for moderate range queries, and (3) balances the access load among all the DHT peers. Our experimental results shows significant gains in both range query performance and load balancing, with minimal overhead.
Joint time-frequency offset detection using the fractional Fourier transform
Authors: P. J. Oonincx
Venue: Signal Processing (2008)

In this paper, a parametric correlation measure is introduced based on the fractional Fourier transform. Based on fundamental properties of this transform, maximum correlation is identified with a line structure in the time-frequency plane. Correlating measured and model data for different values of the parameter yields intersecting lines in the time-frequency plane, whose intersection is identified as the joint time-frequency offset of the measured data, as compared to the model data. Both theoretical and practical aspects of the method are discussed, while examples illustrate both the performance of the method and the geometric concept behind. The approach is particularly designed for analysing measured signals with different onset time (travel time) and frequency shift (Doppler), as compared to a given signal model.
Dynamic resource allocation architecture for IEEE802.16e: design and performance analysis
Authors: A. Nascimento, J. Rodriguez, S. Mumtaz, A. Gameiro, C. Politis
Venue: Mobile Networks and Applications (2008)

Mobile communications has witnessed an exponential increase in the amount of users, services and applications. WiMAX (Worldwide Interoperability for Microwave Access) targets to provide broadband connectivity to wide area coverage, both in fixed and in mobile environments, as well as in the provision of QoS constraints of those applications and services envisioned for Next Generation Networks (NGNs), which results in significant design challenges in the MAC (Medium Access Control) to provide the seamless transport of heterogeneous traffic in a cost-effective manner. This paper proposes a Dynamic Resource Allocation (DRA) architecture for the IEEE802.16e broadband wireless system (also known as Mobile WiMAX) that can provide operators the flexibility to deliver broadband traffic with high spectral efficiency. The proposed DRA architecture framework encompasses scheduler, Link Adaptation (LA), Resource Allocation (RA) and Hybrid Automated Repeat Request (HARQ) functional blocks which interwork seamlessly. The performance of the DRA was evaluated using commonly deployed scheduling policies: Max C/I, Proportional Fair and Round Robin schemes. Simulation results show that the proposed DRA scheme has the capacity to provide enhanced coverage and QoS provisioning for the area networks (WANs), such as the ones envisioned for B3G mobile wireless networks.
Multi-party Quantum Communication Complexity with Routed Messages
Authors: Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths, which may be shared with other parties, on a network of any topology. The technique can also be employed to obtain a lower-bound of the quantum communication complexity of some functions that depend on the inputs distributed over all parties on the network. As a typical application, we apply our technique to the distinctness problem of deciding whether there are at least two parties with identical inputs, on a k-party ring; almost matching upper bounds are also given.
Brief paper: On the model-based approach to nonlinear networked control systems
Authors: Ilia G. Polushin, Peter X. Liu, Chung-Horng Lung
Venue: Automatica (Journal of IFAC) (2008)

The problem of model-based stabilization of a nonlinear system based on its approximate discrete-time model is addressed, under the assumption that both the feedforward and the feedback paths are subject to network-induced constraints. These constraints include irregularity of the transfer intervals, time-varying communication delays, and the possibility of packet losses. A communication protocol that copes with these constraints is proposed. A ''Stability+performance recovery'' result for the nonlinear model-based networked control system (NCS) is formulated and proven.Simulation results presented confirm that the proposed method improves the maximum allowable transfer interval.
Testing the CAX on a Real-World Problem and Other Benchmarks
Authors: Ariel Tchougang, Alexandre Blansché, Laurent A. Baumes, Nicolas Lachiche, Pierre Collet
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Intrigued by the interesting Context Aware Crossover (CAX) operator proposed by Majeed and Ryan in a number of recent papers, this operator was tried on a real problem (solid catalysts optimisation) where unfortunately, no improvement was detected. An implementation of the benchmarks used in [MR06b] seems to show that the CAX is mostly an exploitation operator, boosting the average fitness of the population.
Land subsidence modeling due to ground water drainage using "WTAQ" software
Authors: Kaveh Kumarci, Arash Ziaie, Arash Kyioumarsi
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

Subsidence is settling of the earth's surface because of different factors. Ground movements, mining activities, gas, oil and water, withdrawal are some examples that can causes ground subsidence. In recent years it has been proven that in dry areas because of extensive ground water withdrawal, the rate of subsidence increases rapidly (more than 10 centimetres in a year). A decrease in ground water level will causes an increase in effective stresses at clay layers which results consolidation of lower layers. The behaviour can be modelled using finite element technique to predict the future settlement. In this paper the relationship between classical soil parameters and parameters used in numerical is driven for a single well water table lowering. It is possible to approximate the model by assuming elastic time dependent behaviour due to decrease in water table level that calculates with a computer software that's name is 'WTAQ' (Water Table Aquifer). For this purpose specialised finite element model was established and related to classical soil mechanics consolidation parameters. In this research subsidence of different lands in Sirjan and also Shahrekord are compared.
Design of a new base isolation system for forging hammer
Authors: Ana-Maria Mitu, Tudor Sireteanu, Daniel Catalin Baldovin
Venue: Proceedings of the 9th WSEAS International Conference on Acoustics & Music: Theory & Applications (2008)

Generally, the tensions caused by mechanical shocks and vibrations have negative effects upon the mechanic structures, given the fact that these structures are exposed to additional dynamic stresses. The aim of the paper is to employ the modeling of SERB hysteretic dissipative devices used for reducing the transfer of vibrations or shocks generated by forging hammers. Methods of linear equivalence of the dissipative component of the hysteretic type characteristics based on energy considerations will be applied.
IndeGSRI: Efficient View-Dependent Ranking in CFD Post- processing Queries with RDBMS
Authors: Christoph Brochhaus, Thomas Seidl
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

Computational fluid dynamics (CFD) linked with virtual reality (VR) visualization techniques offer comfortable means to explore interaction of fluids and gases with complex surfaces in the field of engineering or physics amongst others. Huge data sets, in the range of many gigabytes, require sophisticated storage schemes to enable efficient access during post-processing.In this paper we introduce approximate geometric ranking methods for CFD data using off-the-shelf RDBMS by significantly extending the efficient indexing structure RI-tree. We further present preliminary, but very promising performance results of our ongoing research.
Placement Algorithms for WiMAX Mesh Network
Authors: Salim Nahle, Naceur Malouch
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

Recently standardized, WiMAX promises high data rates over long ranges. It defines two modes of operation Point-to-Multi-Point PMP and MESH. In the PMP mode, subscriber stations (SSs) connect to the base station (BS) in single-hop transmissions. The mesh mode on the other hand, allows direct communications between SSs. WiMAX mesh networks constitute a real solution for extending the coverage of the BS. They can be used for providing access into under-covered zones like rural areas and hard-to-wire areas. Several aspects affect the performance of the mesh, such as routing, scheduling and SS locations which when optimized, result in improved performance in term of capacity. In order to cover a specific area, we propose a placement algorithm that adequately places the SSs using routing and scheduling algorithms that we have previously proposed for the purpose of maximizing the capacity. Knowing that placement problems are NP-Hard, we design a heuristic with two variants and we show by simulations, that our algorithms, compared to the intuitive bottom-up approach, always find the smallest number of SSs, but also guarantee a required data rate.
Assisting Human Cognition in Visual Data Mining
Authors: Simeon J. Simoff, Michael H. Böhlen, Arturas Mazeika
Venue: Visual Data Mining: Theory, Techniques and Tools for Visual Analytics (2008)

As discussed in Part 1 of the book in chapter "Form-Semantics-Function --- A Framework for Designing Visualisation Models for Visual Data Mining" the development of consistent visualisation techniques requires systematic approach related to the tasks of the visual data mining process. Chapter "Visual discovery of network patterns of interaction between attributes" presents a methodology based on viewing visual data mining as a "reflection-in-action" process. This chapter follows the same perspective and focuses on the subjective bias that may appear in visual data mining. The work is motivated by the fact that visual, though very attractive, means also subjective, and non-experts are often left to utilise visualisation methods (as an understandable alternative to the highly complex statistical approaches) without the ability to understand their applicability and limitations. The chapter presents two strategies addressing the subjective bias: "guided cognition" and "validated cognition", which result in two types of visual data mining techniques: interaction with visual data representations, mediated by statistical techniques, and validation of the hypotheses coming as an output of the visual analysis through another analytics method, respectively.
The Specification of Computer Graphics Systems
Authors: George Carson
Venue: IEEE Computer Graphics and Applications (1983)

Specification techniques for computer graphics systems should emulate those employed in the specification of computer communication protocols and software systems, not the specification of programming languages.
Fast identification of visual documents using local descriptors
Authors: Eduardo Valle, Matthieu Cord, Sylvie Philipp-Foliguet
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

In this paper we introduce a system for the identification of visual documents. Since it stems from content-based document indexing and retrieval, our system does not need to rely on textual annotations, watermarks or other metadata, which can be missing or incorrect. Our retrieval system is based on local descriptors, which have been shown to provide accurate and robust description. Because of the high computational costs associated to the matching of local descriptors, we propose Projection KD-Forest: an indexing technique which allows efficient approximate k nearest neighbors search. Experiments demonstrate that the Projection KD-Forest allows the system to provide prompt results with negligible loss on accuracy. The Projection KD-Forest also compares well when contrasted to other strategies of k nearest neighbors search.
Simultaneously Prediction of Network Traffic Flow Based on PCA-SVR
Authors: Xuexiang Jin, Yi Zhang, Danya Yao
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

The ability to predict traffic variables such as speed, travel time and flow, based on real time and historic data, collected by various systems in transportation networks, is vital to the intelligent transportation systems (ITS). The present paper proposes a method based on Principal Component Analysis and Support Vector Regression (PCA-SVR) for a short-term simultaneously prediction of network traffic flow which is multidimensional compared with traditional single point. Data from a typical traffic network of Beijing City, China are used for the analysis. Other models such as ANN and ARIMA are also developed as a comparison of the performance of both these techniques is carried out to show the effectiveness of the novel method.
MRI Bone Segmentation Using Deformable Models and Shape Priors
Authors: Jérôme Schmid, Nadia Magnenat-Thalmann
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

This paper addresses the problem of automatically segmenting bone structures in low resolution clinical MRI datasets. The novel aspect of the proposed method is the combination of physically-based deformable models with shape priors. Models evolve under the influence of forces that exploit image information and prior knowledge on shape variations. The prior defines a Principal Component Analysis (PCA) of global shape variations and a Markov Random Field (MRF) of local deformations, imposing spatial restrictions in shapes evolution. For a better efficiency, various levels of details are considered and the differential equations system is solved by a fast implicit integration scheme. The result is an automatic multilevel segmentation procedure effective with low resolution images. Experiments on femur and hip bones segmentation from clinical MRI depict a promising approach (mean accuracy: 1.44±1.1 mm, computation time: 2mn43s).
A Multi-agent Approach for Range Image Segmentation
Authors: Smaine Mazouzi, Zahia Guessoum, Fabien Michel, Mohamed Batouche
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

This paper presents and evaluates a multi-agent approach for range image segmentation. A set of reactive and autonomous agents perform a collective segmentation by partitioning a range image in its different planar regions. The agents move over the image and perform cooperative and competitive actions on the pixels, allowing a robust region extraction, and an accurate edge detection. An artificial potential field, created around the pixels of interest, ensures the agent coordination. It allows the agents to concentrate their actions around the edges and the noise regions. The experimental results show the potential of the proposed approach for scene understanding in range images, regarding both segmentation efficiency, and detection accuracy.