ppxscal/embedding_network huggingface dataset:
Chromium Renderserver: Scalable and Open Remote Rendering Infrastructure
Authors: Brian Paul, Sean Ahern, Wes Bethel, Eric Brugger, Rich Cook, Jamison Daniel, Ken Lewis, Jens Owen, Dale Southard
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Chromium Renderserver (CRRS) is software infrastruc-ture that provides the ability for one or more users to run and view image output from unmodified, interactive OpenGL and X11 applications on a remote, parallel computational platform equipped with graphics hardware accelerators via industry-standard Layer 7 network proto-cols and client viewers. The new contributions of this work include a solution to the problem of synchronizing X11 and OpenGL command streams, remote delivery of parallel hardware accelerated rendering, and a performance anal-ysis of several different optimizations that are generally applicable to a variety of rendering architectures. CRRS is fully operational, Open Source software. imagery and sending it to a remote viewer.
Parallel fine spatial resolution satellite sensor image segmentation based on an improved Pulse-Coupled Neural Network
Authors: L. Li, J. Ma, Q. Wen
Venue: International Journal of Remote Sensing (2007)

An improved Pulse-Coupled Neural Network (PCNN), which has two modules with different inner processing mechanisms, was introduced and applied to segment an IKONOS image with different parameters. Results show that the improved PCNN can segment the image in a parallel and multiscale way, and the output image is easier to analyse than with the basic PCNN.
Testing embeddability between metric spaces
Authors: Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

Let L &ge; 1, &epsilon;> 0 be real numbers, (M, d) be a finite metric space and (N, &rho;) be a metric space (Rudin 1976). The metric space (M, d) is said to be L-bilipschitz embeddable into (N, &rho;) if there is an injective function f : M &rarr; N with 1/L&middot;d(x, y)&le;&rho;(f(x),f(y))&ge;L&middot;d(x, y) for all x, y &isin; N (Farb & Mosher 1999, David & Semmes 2000, Croom 2002). In this paper, we also say that (M, d) is &epsilon;-far from being L-bilipschitz embeddable into (N, &rho;) if the above inequality fails on at least an &epsilon; fraction of pairs (x, y) &isin; M x M for every injective function f : M &rarr; N. Below, a query to a metric space consists of asking for the distance between a pair of points chosen for that query. We study the number of queries to metric spaces (M, d) and (N, &rho;) needed to answer whether (M, d) is L-bilipschitz embeddable into (N, &rho;) or &epsilon;-far from being L-bilipschitz embeddable into (N, &rho;). When (M, d) is &epsilon;-far from being L-bilipschitz embeddable into (N, &rho;), we allow an o(1) probability of error (i.e., returning the wrong answer "L-bilipschitz embeddable"). However, we allow no error when (M, d) is L-bilipschitz embeddable into (N, &rho;). That is, algorithms with only one-sided errors are considered in this paper. When |M| &le; |N| are finite, we give an upper bound of [EQUATION] on the number of queries for determining with onesided error whether (M, d) is L-bilipschitz embeddable into (N, &rho;) or &epsilon;-far from being L-bilipschitz embeddable into (N, &rho;). For the special case of finite |M| = |N|, the above upper bound evaluates to [EQUATION]. We also prove a lower bound of &Omega;(|N|3/2) even for the special case when |M| = |N| are finite and L = 1, which coincides with testing isometry between finite metric spaces (Croom 2002). For finite |M| = |N|, the upper and lower bounds thus match up to a multiplicative factor of at most [EQUATION] which depends only sublogarithmically in |N|. We also investigate the case when (N, &rho;) is not necessarily finite. Our results are based on techniques developed in an earlier work on testing graph isomorphism (Fischer & Matsliah 2006).
Is Greater China a currency union?
Authors: Zhaoyong Zhang, Kiyotaka Sato, Michael McAleer
Venue: Mathematics and Computers in Simulation (2008)

With the rapid flow of knowledge and capital from Hong Kong and Taiwan to Mainland China, a dynamic economy of ''Greater China'' has emerged, making the Chinese trio increasingly interdependent on trade and investment. In this paper we develop a three-variable VAR model to assess empirically the feasibility of forming a currency union in the Greater China area. The empirical results suggest that, from an economic perspective, it is feasible for the Chinese trio to move toward a currency union because of the increasing symmetry of shocks, the dynamic economic integration among the Greater China economies, and the speed of adjustment to shocks.
Managing Real-World System Configurations with Constraints
Authors: Thomas Delaet, Paul Anderson, Wouter Joosen
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Managing large computing infrastructures in a reliable and efficient way requires system configuration tools which accept higher-level specifications. This paper describes an interface between the established configuration tool LCFG, and the experimental configuration tool PoDIM. The combined system is used to generate explicit real-world configurations from high-level, constraint-based specifications. The concept is validated using live data from a large production installation. This demonstrates that a loosely-coupled, multi-layer approach can be used to construct configuration tools which translate high-level requirements into deployable production configurations.
The population biology of infectious diseases (abstract only)
Authors: Caroline Ebersole
Venue: ACM Communications in Computer Algebra (2008)

In this poster, we are looking at differential equations that model a population with an infectious disease. Three different types of models are shown. The first model is the most primitive model, which does not effectively show how the population is spread in the population or does not take into account how difficult it would be to measure a viral population. The SIR model splits the population into three distinct categories: susceptible, infected, and removed. The SIRS model is similar except that individuals can return to the susceptible population after recovering from the virus. The SIRS model is further analyzed and a graph of the equilibrium points and nullclines.
Strictly nonblocking f-cast photonic networks
Authors: Xiaohong Jiang, Achille Pattavina, Susumu Horiguchi
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

The multicast capability and crosstalk issue need to be deliberately considered in the design of future high performance photonic switching networks. In this paper, we focus on the photonic switching networks built on the banyan-based architecture and directional coupler technology. We explore the capability of these networks to support general f-cast traffic, which covers the unicast traffic (f = 1) and multicast traffic (f = N) as special cases, and determine the conditions for these networks to be f-cast strictly nonblocking under various crosstalk constraints. In particular, we propose an optimization framework to determine the nonblocking condition of an f-cast photonic network when a general crosstalk constraint is imposed.
A new fast block matching algorithm for video files with much inter-frame difference
Authors: Hyeonwoo Nam, Sungchae Lim
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

For video coding, we have to consider two performance factors, i.e., the search speed and coded video's quality. Since there is often a trade-off between those performance factors, it is not easy to develop an efficient algorithm in all these aspects. As two feasible video coding algorithms based on the block matching motion estimation, the CDS and HEXBS have been proposed. Although the algorithms have better performance advantages than a naive full search algorithm, they cannot provide the best coding speed and image quality for video files with less inter-frame redundancy. Against this, we propose a new block matching algorithm that works with the small cross and flat hexagon search patterns. From extensive performance evaluations, we can see that our algorithm outperforms both CDS and HEXBS algorithms in terms of the search speed and the coded video's quality. Using our algorithm, we can improve the search speed by up to 51%, and also diminish the PSNR (Peak Signal Noise Ratio) by at most 0.7 dB, thereby improving the video quality.
Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
Authors: Dominikus Noll
Venue: Optimization Methods Software (2007)

We consider nonlinear optimization programs with matrix inequality constraints, also known as nonlinear semidefinite programs. We prove local convergence for an augmented Lagrangian method which uses smooth spectral penalty functions. The sufficient second-order no-gap optimality condition and a suitable implicit function theorem are used to prove local linear convergence without the need to drive the penalty parameter to 0.
Activity-Aware Computing for Healthcare
Authors: Monica Tentori, Jesus Favela
Venue: IEEE Pervasive Computing (2008)

Although context-aware applications can assist hospital staff in their daily work, inadequately managing the dynamic nature of context could lead to the presentation of services and information disembodied from the user's goal. One way to overcome this is to let computational activities mirror human activities such that the activity being executed triggers adaptation of a pervasive environment. The authors use information gathered from a workplace study in a hospital to develop an approach for activity recognition and a set of design principles for activity-aware applications. A mobile activity monitor that provides a wearable connection between patients and nurses exemplifies the design principles proposed. This article is part of a special issue on activity-based computing.
Biometric Certificate Based Biometric Digital Key Generation with Protection Mechanism
Authors: Yunsu Chung, Kiyoung Moon, Hyung-Woo Lee
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

The binding of the user's identity and biometric feature data to an entity is provided by an authority through a digitally signed data structure called a Biometric Certificate. Therefore, the main goal (or contribution) of this work is to propose a simple method for generating biometric digital key with biometric certificate on fuzzy fingerprint vault mechanism. Biometric digital key from biometric data has many applications such as automatic identification, user authentication with message encryption, etc. Therefore, this work analysis the related existing scheme and proposes a simplified model where a general fuzzy fingerprint vault using biometric certificate with security consideration. 1
Exponential time integration and Chebychev discretisation schemes for fast pricing of options
Authors: D. Y. Tangman, A. Gopaul, M. Bhuruth
Venue: Applied Numerical Mathematics (2008)

We consider exponential time differencing (ETD) schemes for the numerical pricing of options. Special treatments for the implementation of the boundary conditions that arise in finance are described. We show that only one explicit time step computation gives unconditional second order accuracy for European, Barrier and Butterfly spread options under both Black-Scholes geometric Brownian motion model and Merton's jump diffusion model with constant coefficients. In comparison, the commonly used Crank-Nicolson scheme is shown to be only conditionally stable due to lack of L"0-stability. Finally, we describe how the use of spectral spatial discretisation based on a Chebychev grid point concentration strategy gives fourth order accurate option prices for both the Black-Scholes and Merton's jump-diffusion model.
Thresholding techniques and their performance evaluation for weld defect detection in radiographic testing
Authors: N. Nacereddine, L. Hamami, D. Ziou
Venue: Machine Graphics Vision International Journal (2006)

In non-destructive testing with radiography, a perfect knowledge of the weld defect shape is an essential step to appreciate the quality of the weld and make decision on its acceptance or rejection. Because of the complex nature of the considered images, and in order that the detected defect region represent the real defect as accurately as possible, the choice of the thresholding methods must be made judiciously. In this paper, performance criteria are used to conduct a comparative study of the thresholding methods based on the gray level histogram, the 2D histogram and the locally adaptive approach to weld defect detection in radiographic images.
Generalized Distributed Multi-antenna Architecture Based Location Technology for Beyond 3G Systems
Authors: Xu Xiaodong, Tao Xiaofeng, Zhang Hui, Hao Zhijie, Zhang Ping
Venue: Proceedings of the Third International Conference on Systems (2008)

In order to research mobile terminal location technology for the next generation mobile communications, this paper sums up existing location technology of current mobile communications system, and then introduces generalized distributed antenna network architecture for Beyond 3G system. On this basis, this paper presents a novel mobile terminal location technology. This method is based on the multi-antenna architecture, which calculates the distance between each antenna and mobile terminal by link gain, then locates the position of mobile terminal, or its probability in this region. The simulation result and error analysis confirm that this method can provide a location technology with higher precision than other location technologies in current mobile communication system.
Expander codes
Authors: M. Sipser, D. A. Spielman
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We present a new class of asymptotically good, linear error-correcting codes based upon expander graphs. These codes have linear time sequential decoding algorithms, logarithmic time parallel decoding algorithms with a linear number of processors, and are simple to understand. We present both randomized and explicit constructions for some of these codes. Experimental results demonstrate the extremely good performance of the randomly chosen codes.
On knowledge modelling of the Visual Tracking task
Authors: Juan J. Pantrigo, Ángel Sánchez, José Mira
Venue: Expert Systems with Applications: An International Journal (2008)

This paper describes the knowledge modelling for a complex object tracking system based on a video sequence. By complex object tracking problems, we mean those based on articulated models and also the possibility of tracking multiple targets. The general proposed framework to solve the considered problem, referred as the ''Visual Tracking'' task, is based on a synergic combination of strategies coming from particle filters and population-based metaheuristics. The considered system works with a population of individuals (solutions) that evolve along time. These individuals cooperate among them and also improve their respective fitness values in order to offer an efficient near-optimal solution for each frame in the tracked video sequence. The three main resulting subtasks, namely ''Extract'', ''Explore'' and ''Exploit''', are described in detail by CommonKADS library schemes. We argue that the knowledge modelling components used in the decomposition of the Visual Tracking task can be reused as generic elements of problem-solving methods in video processing.
Bregman bubble clustering: A robust framework for mining dense clusters
Authors: Gunjan Gupta, Joydeep Ghosh
Venue: ACM Transactions on Knowledge Discovery from Data (TKDD) (2008)

In classical clustering, each data point is assigned to at least one cluster. However, in many applications only a small subset of the available data is relevant for the problem and the rest needs to be ignored in order to obtain good clusters. Certain nonparametric density-based clustering methods find the most relevant data as multiple dense regions, but such methods are generally limited to low-dimensional data and do not scale well to large, high-dimensional datasets. Also, they use a specific notion of &ldquo;distance&rdquo;, typically Euclidean or Mahalanobis distance, which further limits their applicability. On the other hand, the recent One Class Information Bottleneck (OC-IB) method is fast and works on a large class of distortion measures known as Bregman Divergences, but can only find a single dense region. This article presents a broad framework for finding k dense clusters while ignoring the rest of the data. It includes a seeding algorithm that can automatically determine a suitable value for k. When k is forced to 1, our method gives rise to an improved version of OC-IB with optimality guarantees. We provide a generative model that yields the proposed iterative algorithm for finding k dense regions as a special case. Our analysis reveals an interesting and novel connection between the problem of finding dense regions and exponential mixture models; a hard model corresponding to k exponential mixtures with a uniform background results in a set of k dense clusters. The proposed method describes a highly scalable algorithm for finding multiple dense regions that works with any Bregman Divergence, thus extending density based clustering to a variety of non-Euclidean problems not addressable by earlier methods. We present empirical results on three artificial, two microarray and one text dataset to show the relevance and effectiveness of our methods.
Design of a remote controlled caching proxy system: architecture, algorithm and implementation
Authors: Khaled E. A. Negm, Maryam A. Al-Aly
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

A caching proxy server acts as an invisible intermediary between browsing clients and the internet servers. In the case of a Web cache, cacheable objects are always separate and are always read in their entity with no pre-fetching. In the present study we present a novel design for a system to remote control an array of proxy system. The administrator can monitor and configure the caching array system from any normal client computational facility. The current system emphasizes on the fact that the administrator can change the configuration of the system with no need either to start the system or alter the clients' statuses. This is achieved by implementing the concurrency control system under the system hierarchy. The primarily local testing of the system shows promising results to get implemented on large scale of enterprise systems.
Even dicycles
Authors: William McCuaig
Venue: Journal of Graph Theory (2000)

We answer a question of Thomassen by proving that there is a unique strongly 2-connected digraph with no even dicycle. We show the significance of this digraph to the structure of strongly connected digraphs with no even dicycles. We also prove a conjecture of Lundy. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 46&ndash;68, 2000
Colour induction on computer displays - adjacency and shape effects
Authors: L. Kjelldahl, B. N. Schenkman
Venue: Behaviour & Information Technology (2007)

The perceived interactions, induction and assimilation between colours presented on a computer screen were investigated for seven participants who gave estimates on the perceived colours. A method based on memory estimation was used. In one experiment, a red - green scale was used, while in a second experiment a white - green scale was used. The distance between objects, shape of objects and colour of objects was varied. A distance effect of colour interaction was found in both experiments, but stronger for the red - green scale. For objects adjacent to each other the interaction effects were statistically significant. For objects not adjacent to each other some smaller effects occurred. No shape effects were found. Assimilation effects were shown for the red - green colour combinations. The participants seemed to use their own internal memory scale for their judgements. A theoretical model for distance effects of colour interaction is also presented.
New Layered Space-Time Schemes Based on Group of Three Transmit Antenna
Authors: G. Ferré, J. P. Cances, V. Meghdadi
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

We present a new architecture of layered space-time codes as a combination of BLAST architecture and of special STTC codes which are variations about the codes first introduced by Jafarkhani et al. and named Super Orthogonal Space-Time Trellis Codes (SOSTTC). Using powerful set partitioning, these codes are able to combine the coding advantage of STTC’s together with the advantage diversity of orthogonal Space-Time Block Codes (STBC). The system we propose is named Super Quasi Orthogonal Horizontal Layered Space Time Trellis Code (SQOHLSTTC). It consists in a powerful STBC based STTC originally derived for a three transmit antenna system, together with an original block based decoding algorithm which enables to use a higher number of transmit antennas. The decoding of SQOHLSTTC combines group interference suppression and group interference cancellation techniques. To implement the system, we propose a low complexity hard decision iterative decoding method. System performances are illustrated and confirm the great interest of the proposed transmission scheme.
Multi-purpose watermarking schemes for color halftone image
Authors: Kuo-Ming Hung, Ching-Tang Hsieh, Kuan-Ting Yeh
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

In many printer and publishing applications, it is desirable to embed data in halftone images for copyright control and authentication purposes. However, the robustness of the geometrical attacks in halftone watermarking is still a key problem. In this paper, we proposed a multipurpose color halftone watermarking using embedding watermark into the pixel with complicated texture by wavelet transform based on the dithering technique in the halftone processing. According to properties of the color model [R,G,B], we chosen the G level for embedded our robust watermark and B level for embedded our semi-fragile watermark. The Zernike moment is adopted to detect rotation and scale of the watermarked image. Experimental results show that watermarked image with good visual quality and the robust watermark is robust to the malicious attacks such as compress, corrupting, cropping, rotating, and scaling. The semi-fragile watermark can detect the regions where attacked by corrupted and cropped.
Convergence and superconvergence analysis of finite element methods on graded meshes for singularly and semisingularly perturbed reaction-diffusion problems
Authors: Guoqing Zhu, Shaochun Chen
Venue: Journal of Computational and Applied Mathematics (2008)

The bilinear finite element methods on appropriately graded meshes are considered both for solving singular and semisingular perturbation problems. In each case, the quasi-optimal order error estimates are proved in the @e-weighted H^1-norm uniformly in singular perturbation parameter @e, up to a logarithmic factor. By using the interpolation postprocessing technique, the global superconvergent error estimates in @e-weighted H^1-norm are obtained. Numerical experiments are given to demonstrate validity of our theoretical analysis.