ppxscal/embedding_network huggingface dataset:
An Improved Adaptive Algorithm for Controlling the Probabilities of Crossover and Mutation Based on a Fuzzy Control Strategy
Authors: Qing Li, Xinhai Tong, Sijiang Xie, Guangjun Liu
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

An improved adaptive algorithm for controlling the probabilities of crossover and mutation with fuzzy logic is proposed in this paper. The changes of average fitness value and standard deviation between two continuous generations are selected as input and the changes of crossover probability and mutation probability are the output variables. Two adaptive scaling factors are introduced for normalizing the input variables and new fuzzy rules based on domain heuristic knowledge are investigated for adjusting the probabilities of crossover and mutation. Numerical simulation studies of three different test functions are carried out, and the simulation results show that the genetic algorithm with the proposed adaptive fuzzy controller exhibits improved search speed and quality.
Mean-Value Laplacian Coordinates for Triangular Meshes
Authors: H. Y. Wu, Chunhong Pan, Qing Yang, Jia Pan, Songde Ma
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

This paper presents an effective approach for triangular mesh editing, based on mean-value laplacian coordinates for triangular meshes. We discretize the Laplace operator using mean value weights instead of uniform weights for fine approximation qualities. The results are obtained by solving a quadratic optimization problem, which can be efficiently minimized by solving a sparse linear system. Moreover, the quadratic energy function is assigned to each triangle rather than each vertex, which is more convenient to add control items. The result shows that our method is effective enough for common applications.
Accurate estimation of AR model by tapered SVD without rank determination
Authors: H. Kanai, N. Chubachi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

This paper presents a new method to increase the accuracy in the estimates of the autoregressive (AR) model obtained by the Kumaresan-Tuft (KT) method proposed in 1982. In the KT method, there are the following two problems to be solved. (1) It is necessary to select the appropriate order of the AR-model before truncating the non-significant singular values obtained by the singular-value-decomposition (SVD). (2) There are errors in the selection of the signal- and noise-subspaces, which are determined by the noisy data matrix. Thus, the resultant singular values cannot be neglected even for the higher orders. Thus, truncation of the high order singular values by the predetermined order causes the bias error in the resultant AR parameter estimates. By introducing a tapering window into the truncation of high order non-significant singular values, the mean squared error of the estimates is certainly reduced. This paper also presents a new procedure to design an optimum tapering window for estimating AR model parameters without using any non-linear optimisation procedure.
Mechanisms of Eye Gaze Perception during Infancy
Authors: Teresa Farroni, Mark H. Johnson, Gergely Csibra
Venue: Journal of Cognitive Neuroscience (2004)

Previous work has shown that infants are sensitive to the direction of gaze of another's face, and that gaze direction can cue attention. The present study replicates and extends results on the ERP correlates of gaze processing in 4-month-olds. In two experiments, we recorded ERPs while 4-month-olds viewed direct and averted gaze within the context of averted and inverted heads. Our results support the previous finding that cortical processing of faces in infants is enhanced when accompanied by direct gaze. However, this effect is only found when eyes are presented within the context of an upright face.
Behavioral and Neuroimaging Evidence for a Contribution of Color and Texture Information to Scene Classification in a Patient with Visual Form Agnosia
Authors: Jennifer K.E. Steeves
Venue: Journal of Cognitive Neuroscience (2004)

A common notion is that object perception is a necessary precursor to scene perception. Behavioral evidence suggests, however, that scene perception can operate independently of object perception. Further, neuroimaging has revealed a specialized human cortical area for viewing scenes that is anatomically distinct from areas activated by viewing objects. Here we show that an individual with visual form agnosia, D.F., who has a profound deficit in object recognition but spared color and visual texture perception, could still classify scenes and that she was fastest when the scenes were presented in the appropriate color. When scenes were presented as black-and-white images, she made a large number of errors in classification. Functional magnetic resonance imaging revealed selective activation in the parahippocampal place area (PPA) when D.F. viewed scenes. Unlike control observers, D.F. demonstrated higher activation in the PPA for scenes presented in the appropriate color than for black-and-white versions. The results demonstrate that an individual with profound form vision deficits can still use visual texture and color to classify scenes&mdash;and that this intact ability is reflected in differential activation of the PPA with colored versions of scenes.
Capacity analysis for parallel and sequential MIMO equalizers
Authors: Xinying Zhang, S. Y. Kung
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

It is well known that linear MMSE can outperform its zero-forcing counterpart. In combination with a successive interference canceller, MMSE can fully exploit the capacity of MIMO (multiple-input-multiple-output) channels [A.J. Viterbi, 1986, M.K. Varanasi, T. Guess, 1997]. In practice, however, such an advantage is compromised due to its implementation complexity and the requirement of accurate SNR estimate. Thus other equalizers such as zero-forcing may present an attractive alternative as long as the performance gap is tolerable. This motivates a need to quantify the tradeoff between MMSE and zero-forcing in both parallel and sequential structures. In this paper, the capacity performance of different equalization schemes is investigated, with closed-form formulas provided in terms of two key measures: capacity gaps and ratios. We also conclude that the capacity gain via structural choice (between parallel and sequential) far out-weights that via filter choice (between zero-forcing and MMSE). Indeed, the latter is found to be almost negligible for most practical SNR regions. It is also shown that the sequential zero-forcing equalizers can asymptotically reach the channel capacity when SNR approaches infinity, irrelevant of the detection order. Although this paper is focused on the flat-fading channels, the result is directly extendable to the ISI case by slicing the frequency band into infinitesimal stripes, each of which can be treated as flat.
Estimation of perceived quality of service for applications on IPv6 networks
Authors: Xiaoming Zhou, Henk Uijterwaal, Rob E. Kooij, Piet Van Mieghem
Venue: Proceedings of the ACM international workshop on Performance monitoring, measurement, and evaluation of heterogeneous wireless and wired networks (2006)

To provide high quality service to future Internet applications, IPv6 performance measurements are needed. However, to the best of our knowledge, IPv6 delay and loss performance evolution and their impact on applications have not been studied on a large scale. In this paper, we have analyzed more than 600 end-to-end IPv6 paths between about 26 testboxes of RIPE NCC over the past two years, and compared the delay and loss performance evolution in IPv6 with their IPv4 counterparts. We present and discuss the measurement methodology, and we provide evidence that IPv6 network has a higher delay and loss evolution than IPv4. Finally, based upon our measurements, we assess the perceived quality of three real-life applications: VoIP, Video-over-IP and data communication services based upon TCP
Stereo Vision in Structured Environments by Consistent Semi-Global Matching
Authors: Heiko Hirschmuller
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

This paper considers the use of stereo vision in structured environments. Sharp discontinuities and large untextured areas must be anticipated, but complex or natural shapes of objects and fine structures should be handled as well. Additionally, radiometric differences of input images often occur in practice. Finally, computation time is an issue for handling large or many images in acceptable time. The Semi-Global Matching method is chosen as it fulfills already many of the requirements. Remaining problems in structured environments are carefully analyzed and two novel extensions suggested. Firstly, intensity consistent disparity selection is proposed for handling untextured areas. Secondly, discontinuity preserving interpolation is suggested for filling holes in the disparity images that are caused by some filters. It is shown that the performance of the new method on test images with ground truth is comparable to the currently best stereo methods, but the complexity and runtime is much lower.
Feedback Control Architecture and Design Methodology for Service Delay Guarantees in Web Servers
Authors: Chenyang Lu, Ying Lu, Tarek F. Abdelzaher, John A. Stankovic, Sang Hyuk Son
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

This paper presents the design and implementation of an adaptive Web server architecture to provide relative and absolute connection delay guarantees for different service classes. The first contribution of this paper is an adaptive architecture based on feedback control loops that enforce desired connection delays via dynamic connection scheduling and process reallocation. The second contribution is the use of control theoretic techniques to model and design the feedback loops with desired dynamic performance. In contrast to heuristics-based approaches that rely on laborious hand-tuning and testing iteration, the control theoretic approach enables systematic design of an adaptive Web server with established analytical methods. The adaptive architecture has been implemented by modifying an Apache server. Experimental results demonstrate that the adaptive server provides robust delay guarantees even when workload varies significantly.
A Binary Linear Programming Formulation of the Graph Edit Distance
Authors: Derek Justice Alfred Hero
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. A general formulation for editing graphs is used to derive a graph edit distance that is proven to be a metric, provided the cost function for individual edit operations is a metric. Then, a binary linear program is developed for computing this graph edit distance, and polynomial time methods for determining upper and lower bounds on the solution of the binary program are derived by applying solution methods for standard linear programming and the assignment problem. A recognition problem of comparing a sample input graph to a database of known prototype graphs in the context of a chemical information system is presented as an application of the new method. The costs associated with various edit operations are chosen by using a minimum normalized variance criterion applied to pairwise distances between nearest neighbors in the database of prototypes. The new metric is shown to perform quite well in comparison to existing metrics when applied to a database of chemical graphs.
Decomposing parameters of mixture Gaussian model using genetic and maximum likelihood algorithms on dental images
Authors: Nariman Majdi-Nasab, Mostafa Analoui, Edward J. Delp
Venue: Pattern Recognition Letters (2006)

We present new approaches based on Genetic Algorithms (GAs), Simulated Annealing (SA) and Expectation Maximization (EM) for determining parameters of the mixture Gaussian model. GAs are adaptive search techniques designed to search for near-optimal solutions of large-scale optimization problems with multiple local maxima. It has been shown that GAs are independent of initialization parameters and can efficiently optimize functions in large search spaces while the solution obtained by EM is a function of initial parameters. There is a relatively high likelihood of achieving sub-optimal solution, due to trapping in local maxima. In this work, we propose a combination of Genetic Algorithm with EM (Interlaced GA-EM) to improve estimation of Gaussian mixture parameters. The method uses population of mixture models, rather than a single mixture, iteratively in both GA and EM to determine Gaussian mixture parameters. To assess the performance of the proposed methods, a series of Gaussian phantoms, based on the 'Modified Shepp-Logan' method, were created. All proposed methods were employed to estimate the tissue parameters in each phantom and applied on Micro Computed Tomography (@mCT) of dental images. The proposed method offers an accurate and stable solution for parameter estimation on Gaussian mixture models, with higher likelihood of achieving global optimal minima. Obtaining such accurate parameter estimation is a key requirement for image segmentation approach, which rely on a priori knowledge of tissue model parameters.
Robust Estimation for Background Subtraction
Authors: Hongxun Zhang, De Xu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Background subtraction is a method typically used to segment moving regions in image sequences taken from a static camera by comparing each new frame to a model of the scene background. We present a novel Robust Estimators model and a background subtraction approach. The method could handle various small motions of background objects such as swaying tree branches and bushes. The model measures the central value and their variability, i.e. estimates the location and scale. These estimates should preferably be robust against outliers, as reflected by their small-sample breakdown values. The model adapts quickly to changes in the scene that enables very sensitive detection of moving targets. The results show that the proposed method is effective and efficient in real-time and accurate background maintenance in complex environment
Knowledge Structure of Virtual Inhabitant for an Alibi Reasoning
Authors: Jeong-Woo Kwon, Se-Jin Ji, Jong-Hee Park
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

A Virtual Inhabitant is a kind of believable agent proposed in order to endow the attractive features of human-controlled characters to computer-controlled characters. In this paper, we specify the knowledge structure for Virtual Inhabitant to infer an alibi problem in virtual environment. An alibi problem is important problem which includes temporal-spatial aspect. Time and space don't have pointed value but have ranged value in situation. We introduce three layer of abstraction to present time and space value. We expect that proposed knowledge structure can make Inference of Virtual Inhabitant more believable.
Facilitating social creativity through collaborative designing
Authors: Pirita Seitamaa-Hakkarainen, Uotila Minna
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The present study introduces the "Facilitating Social Creativity through Collaborative Designing" project, an undertaking aimed at developing and testing Virtual Design Studios (VDS) in education and professional communities. VDS is a pedagogical approach supported by collaborative technologies, focused on engaging learners in the co-design of various artefacts. The present poster provides a synthesis of results concerning multiple design experiments regarding VDS at the elementary, higher educational and professional levels. The reviewed data generally support the usefulness and benefits of VDS, and indicate the areas where improvements are desirable.
Modeling a garment manufacturer's cash flow using object-oriented simulation
Authors: José A. Sepúlveda, Haluk M. Akin
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Garment manufacturers usually work with a short vision of the demand to come in the following months. So they want to borrow as little as possible while still making a good profit at the end of the year. This study models a garment manufacturer's cash flow with the objective of finding scenarios where the company will be employing a low level of its credit-line and still be making a reasonable profit. To model our problem, we use Silk, an object-oriented simulation library in Java. Input data from a small-sized garment manufacturing company is used to build and test the model. A model where the manufacturer can test decisions like investing on opening new job shops, changing the production scheduling heuristics, or changing the payment agreements with suppliers and an example usage of the simulation are presented.
Observability Statement Coverage Based on Dynamic Factored Use-Definition Chains for Functional Verification
Authors: Tao Lv, Jian-Ping Fan, Xiao-Wei Li, Ling-Yi Liu
Venue: Journal of Electronic Testing: Theory and Applications (2006)

Simulation is still the primary verification method for integrated circuit designs, and coverage evaluation is indispensable for it on account of its incompleteness. As the functional complexity of modern designs is increasing dramatically, it is necessary to take observability into consideration for coverage metrics. In this paper we extend factored use-definition chains (FUD chains), a mature data structure in compilers, from sequential software to concurrent hardware design, and propose dynamic FUD chains (DFUD chains). Based on it, we present an observability model and an algorithm to evaluate observability-based statement coverage. This technique has several advantages. Firstly, it could be easily integrated into compilers or simulators for hardware description languages, since it utilizes many flow analysis techniques adopted in compilers. Secondly, it can be combined with many controllability metrics, such as statement coverage metric, since the observability model is based on definitions and uses of variables. The proposed technique has been implemented as a prototype tool for Verilog designs, and experimental results show its benefits.
An end-to-end TCP-friendly streaming protocol for multimedia over wireless Internet
Authors: Fan Yang, Qian Zhang, Wenwu Zhu, Ya-Qin Zhang
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

With the convergence of wired line Internet and mobile wireless networks, it's important to study its impacts on continuous media delivery and media streaming protocols. In this paper, we propose an end-to-end (wireless) multimedia streaming TCP-friendly protocol for media delivery over wireless Internet (WMSTFP). WMSTFP can effectively differentiate erroneous packet losses from congestive losses and filter out the abnormal round-trip-time values due to the highly varying wireless environment. Analytical and simulation results show that WMSTFP can achieve higher throughput in wireless Internet and can perform rate adjustment in a smooth and TCP-friendly manner.
EGEE: building a pan-European grid training organisation
Authors: Rüdiger Berlich, Marcus Hardt, Marcel Kunze, Malcolm Atkinson, David Fergusson
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

As the largest EU Grid project, it is one of the Enabling Grids for E-SciencE initiatives foremost goals to establish a production quality Grid infrastructure. Amongst EGEE's diverse duties the creation of a pan-European Grid training organisation plays a prominent role. Close to the end of the first project phase, this paper describes the training organisation in the context of EGEE's other duties, discusses the experience made in building it, lists results and lessons learned over the course of almost two years of training provision. It is the purpose of this paper to allow upcoming Grid initiatives to leverage the experiences made in EGEE training[1].
A Parametric Approach to Orthographic Processing in the Brain: An fMRI Study
Authors: M.-A. Tagamets, Jared M. Novick, Maria L. Chalmers, Rhonda B. Friedman
Venue: Journal of Cognitive Neuroscience (2000)

Brain activation studies of orthographic stimuli typically start with the premise that different types of orthographic strings (e.g., words, pseudowords) differ from each other in discrete ways, which should be reflected in separate and distinct areas of brain activation. The present study starts from a different premise: Words, pseudowords, letterstrings, and false fonts vary systematically across a continuous dimension of familiarity to English readers. Using a one-back matching task to force encoding of the stimuli, the four types of stimuli were visually presented to healthy adult subjects while fMRI activations were obtained. Data analysis focused on parametric comparisons of fMRI activation sites. We did not find any region that was exclusively activated for real words. Rather, differences among these string types were mainly expressed as graded changes in the balance of activations among the regions. Our results suggest that there is a widespread network of brain regions that form a common network for the processing of all orthographic string types.
A Scheduling Algorithm with Adaptive Allocation for Monte Carlo Simulation in P2P Grid
Authors: Seok Myun Kwon, Jin Suk Kim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Many researches have been conducted on systems that consist of heterogeneous machines, such as peerto- peer computing and GRID system. In heterogeneous system, an important research problem is how to allocate a set of tasks to the computing machine. In this paper, a scheduling algorithm, LSAA, allocate parallel tasks through peer-to-peer, computing was presented, and its effectiveness in the peer-to-peer system was shown by the experimental results. The experiments show that the performance of the scheduling algorithm LSAA is better than the performances of previous algorithm.
Should transient analysis be taught?
Authors: M. C. Court, J. L. Pittman, H. T. L. Pham
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The authors present the results of experiments performed to identify the pitfalls of performing 'bad' transient analysis when estimating steady-state parameters via the method of independent replications. The intention was to demonstrate to students that failure to delete transient data may lead to confidence intervals that underestimate steady-state parameters. Two types of systems are analyzed: M/M/1/GD/&infin;/&infin; systems and an M/M/s/GD/&infin;/&infin; optimization problem. These systems are chosen since they are typically taught in an undergraduate stochastic operations research course where a closed-form solution of the steady-state parameter exists. Surprisingly, the results prove to support the opposite of our original intention---regardless of run length, ignoring transient analysis often leads to the same level of coverage at greater precision, or provides no gain in coverage to justify the effort of performing transient analysis. Thus, we now pose the question---should transient analysis be taught?