ppxscal/embedding_network huggingface dataset:
Genetic Algorithm and Region Growing Based Road Detection in SAR Images
Authors: Yuan Guo, Zhengyao Bai, Yue Li, Yang Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A new method for detecting roads in SAR images is presented in this paper. The method consists of four parts: preprocessing, Hough transform, genetic algorithm and region growing. In the preprocessing step, morphological operations are employed to remove many details in binarized SAR images. The Canny operator is applied to detect image edge, and small areas are deleted by using morphological area open operation. Hough transform is employed to extract lines. Genetic algorithm (GA) is used to search and connect road segments. Region growing approaches are utilized to extend road segments. The experimental results show that the proposed method can better detect roads in SAR images.
Statistical-Mechanical Analysis of Inverse Digital-Halftoning
Authors: Jun-ichi Inoue, Yohei Saika, Masato Okada
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

We propose a theoretical framework to investigate sta- tistical performance of inverse digital-halftoning problems. In the context of the maximizer of the posterior marginal (MPM) estimate corresponding to the Markov random fields (MRFs) model in which each pixel takes discrete values such as 1, · · · , Q, we formulate the problem of inverse digital-halftoning in which digital images are generated by the threshold constant and the so-called Bayers' matrices. To construct the Gibbs sampler for the MRFs, we carry out Markov chain Monte Carlo (MCMC) simulations and in- vestigate hyper-parameter dependence of the performance in terms of the mean-square error. By using the statistical- mechanical analysis, we also investigate averaged case per- formance of the inverse-halftoning for the corresponding analytically tractable class of the MRFs models. Both equi- librium and dynamical properties of the MPM estimation of the original grayscale images are revealed.
Quality of Service APIs for a 3GPP Mobile and Pervasive Large Scale Augmented Reality Gaming Middleware
Authors: Pedro Ferreira, Joao Orvalho, Fernando Boavida
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Ubiquitous or pervasive computing is a new kind of computing, where specialized elements of hardware and software will have such a high level of deployment that their use will be fully integrated with the environment. Augmented reality extends reality with virtual elements but tries to place the computer in a relatively unobtrusive, assistive role. Specialized network middleware solutions for large scale mobile and pervasive augmented reality games are, to our knowledge, inexistent. The work presented in this paper focuses on the creation of such type of network middleware for mobile and pervasive entertainment, applied to the area of large scale augmented reality games. In this paper we propose and describe APIs and architecture for Quality of Service specification, negotiation and provision on the client side (using J2ME) and on the server side (using J2SE). The paper discusses architectural and implementation aspects.
R68-15 Trajectory Computation by a Hybrid Computer for the Apollo Midcourse Abort Simulation
Authors: E. E. Markson
Venue: IEEE Transactions on Computers (1968)

The paper by Smith is representative of a class of spacecraft-guided simulation problems wherein the body dynamics of the spacecraft are eliminated by assuming that the inertia of the body is zero. Thus rotational accelerations become infinite and attitude system-response times are taken to be zero. The simulation of such problems is most generally performed entirely on digital equipment because the rate of change of the guidance function is generally of the same order as the rate of change of the trajectory parameters. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Diffeomorphic statistical shape models
Authors: T. F. Cootes, C. J. Twining, K. O. Babalola, C. J. Taylor
Venue: Image and Vision Computing (2008)

We describe a method of constructing parametric statistical models of shape variation which can generate continuous diffeomorphic (non-folding) deformation fields. Traditional statistical shape models are constructed by analysis of the positions of a set of landmark points. Here, we describe an algorithm which models parameters of continuous warp fields, constructed by composing simple parametric diffeomorphic warps. The warps are composed in such a way that the deformations are always defined in a reference frame. This allows the parameters controlling the deformations to be meaningfully compared from one example to another. A linear model is learnt to represent the variations in the warp parameters across the training set. This model can then be used to generalise the deformations. Models can be built either from sets of annotated points, or from unlabelled images. In the latter case, we use techniques from non-rigid registration to construct the warp fields deforming a reference image into each example. We describe the technique in detail and give examples of the resulting models.
Pointed pictures
Authors: Paolo Bottoni, Anna Labella
Venue: Journal of Visual Languages and Computing (2007)

We introduce the notion of entry and exit points for pictures and define a new operation on the resulting set of pointed pictures, which allows an algebraic description of them. This provides an alternative way for picture composition via a single operation, with respect to the classical use of pairs of operations. This can be used to impose a reading order in a picture resulting from the juxtaposition of several partial ones.
High performance index build algorithms for intranet search engines
Authors: Marcus Fontoura, Engene Shekita, Jason Y. Zien, Sridhar Rajagopalan, Andreas Neumann
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

There has been a substantial amount of research on high-performance algorithms for constructing an inverted text index. However, constructing the inverted index in a intranet search engine is only the final step in a more complicated index build process. Among other things, this process requires an analysis of all the data being indexed to compute measures like PageRank. The time to perform this global analysis step is significant compared to the time to construct the inverted index, yet it has not received much attention in the research literature. In this paper, we describe how the use of slightly outdated information from global analysis and a fast index construction algorithm based on radix sorting can be combined in a novel way to significantly speed up the index build process without sacrificing search quality.
Nonlinear Diffusion for Angiogram Enhancement based on Morphology Measure
Authors: Kaiqiong Sun, Nong Sang, Guodong Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper introduces a nonlinear diffusion method for coronary angiogram enhancement based on morphology measure. This method is designed to utilize the distinction of morphology measure between coronary tree and background, and the iterative enhancement feature of nonlinear diffusion. The morphology measure is calculated by the difference between morphological opening results of original image with structuring elements of different scale. The morphology difference is embedded in a generalized formulation of P-M equation in which the statistics about intensity difference is replaced by the generalized measure. Experimentations are reported about the result of the proposed method on clinic angiogram and the comparative result with other method.
Bounded oscillation for second-order nonlinear neutral difference equations in critical and non-critical states
Authors: Qiong Meng, Jurang Yan
Venue: Journal of Computational and Applied Mathematics (2008)

The sufficient and necessary conditions for the bounded oscillation of the second order nonlinear neutral delay difference equation@D^2[x(n)-px(n-@t)]=@?i=1mq"ix(n-@s"i)+f(n,x(n-@h"1(n)),...,x(n-@h"l(n)))are obtained in critical and non-critical cases.
The Piecewise Data Flow Architecture: Architectural Concepts
Authors: J. E. Requa
Venue: IEEE Transactions on Computers (1983)

This paper presents the design and a brief analysis of the Piecewise Data Flow computer (PDF), an architecture proposed for very high-performance computing. PDF is a heterogeneous multiprocessor system having both SIMD and MIMD characteristics. Each computation is translated into a control flow graph in which each node contains a basic block of instructions. Concurrency can be exploited in three different ways: simultaneous execution of independent basic blocks, simultaneous execution of independent instructions within a basic block, and intrinsic array operations. This program representation is amenable to traditional languages (e.g., Fortran) because almost all optimizing compilers use basic blocks as their internal representation. New functional languages should be able to exploit this architecture even more easily. The most significant aspects of the PDF architecture concern scheduling basic blocks for execution, allocating registers to intermediate results, and assigning instructions to processors.
Unpacking the social dimension of external interruptions
Authors: Rikard Harr, Victor Kaptelinin
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

The paper systematically explores the social dimension of external interruptions of human activities. Interruptions and interruption handling are key issues in human-computer interaction (HCI) and computer-supported cooperative work (CSCW) research. However, existing research has almost exclusively dealt with effects of interruptions on individual tasks. In this paper we call for expanding the scope of analysis by including the effect of interruptions on the social context. We identify four facets of the social 'ripple effect' of interruptions: location, communication, collaboration, and interpersonal relation. We discuss the advantages of extending the notion of interruptions and its implications for future research.
A Geometric Initialization Algorithm for Blind Separation of Speech Signals
Authors: Chao Wang, Yong Fang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Iterative blind source separation algorithm is often equivalent to a forward neural network trained by the unsupervised learning. Training iteration of parameters should be initialized beforehand. In this paper, an initialization algorithm is proposed for the blind separation of mixed speech signals based on the geometric structure of speech signal space. After the mixed signals are whitened, the quadrants of coordinates are regarded as the local PCA subspaces of the obtained signals. The mixing matrix can be estimated by the first eigenvectors of these subspaces. Simulation results show that separation performance of the FASTICA algorithm is improved by the proposed initialization algorithm.
A Tour Through Cedar
Authors: W. Teitelman
Venue: IEEE Software (1984)

This lively walk through a sophisticated programming environment is taken from a videotaped demonstration of the system. There is no need to adjust your set.
Product Semantics Evaluation Based on User Memory
Authors: Yanhe Zhang, Ying Yang, Tian Lei
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Product semantics is difficult to be obtained because it is affected by the user's vague memory. To solve this problem, product semantics evaluation model based on user memory is proposed. The model is composed of product semantics storage, product semantics recognition and recall, and product semantics evaluation. In this model, characters of product semantics in user memory are analyzed, and how these characters affect the user's evaluation is also analyzed. Then analytical hierarchy process is used to help the user score product semantics. In case study, sun-glasses are taken as examples to show how analytical hierarchy process is applied to product semantics evaluation. And data obtained from the users are examined in consistency and split-half reliability. Results show that product semantics evaluation model can solve problems caused by the user's vague memory. In addition, product semantics evaluation model can help the designer select the optimal product in product decision.
A frequency domain inversion code to retrieve time-dependent parameters of very long period volcanic sources
Authors: S. Cesca, T. Dahm
Venue: Computers Geosciences (2008)

In this article, we present a new code for the inversion of source parameters of volcanic seismic events. The code, named VOLPIS (Volcanic Long Period Inversion for the Source), has as its main goal the retrieval of time-dependent source parameters, so that both amplitudes and time history of source components can be estimated. The methodology used has been designed to be extremely flexible, in order to be easily applied to different datasets and, eventually, used for the inversion of any other seismic source with a complex source time function. Certain physical phenomena occurring at volcanic focal regions can be expressed in terms of a generalized seismic point source, as the sum of single forces and dipole forces (moment tensor). Source time histories for different source components can be kept independent, so that superposition of different physical phenomena can be retrieved, even in cases where they occur with different timing. Otherwise, a constraint for partially or fully common source time history can be included. The algorithm is based on a frequency domain approach, where the inversion is solved separately for each complex sampled frequency. The code structure helps in simplifying the handling and processing of data, which can be adapted to data characteristics or user requirements. Significant examples of possible applications to synthetic data are included.
Column-Based Partitioning for Data in High Dimensional Space
Authors: Ekasit Kijsipongse, Sudsanguan Ngamsuriyaroj
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Several scientific applications such as 3D Jacobi Iteration [17] and LQCD [5] demand high computing power, and run on parallel systems. Such applications mostly operate on high dimensional data, and partitioning them into smaller units would help reduce their execution time considerably. Many algorithms such as CBP [2], Dissect [15], and Bisection [3] are proposed to find an optimal partitioning for two dimensional data. Simply extending such algorithms to handle higher dimensional data does not guarantee the maximum efficiency since the number of data dimensions must be taken into account. In addition, the communication cost among data in high dimensions is increased since data have high interaction to each other. This paper proposes a new algorithm called HyperCBP which is a general optimal column-based partitioning in high dimensional space. The algorithm divides high dimensional data into rectangle blocks of different sizes according to the computing power of each computing node, and minimizes the communication time used in transferring data among rectangles. We evaluate our algorithmusing the new defined performance metric called Communication Saving Ratio (CSR). When compared with Dissect [15] and Bisection [3], the results show that HyperCBP gives a higher CSR than those two algorithms, and thus results in a better partitioning.
Special Feature Computer Graphics: A Two-Way Street
Authors: W. Myers
Venue: Computer (1980)

We design-in the characteristics of the computer graphics system; those of the human visual system at the other end of the street are equally important. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The potential impact of 3d telepresence technology on task performance in emergency trauma care
Authors: Hanna M. Söderholm, Diane H. Sonnenwald, Bruce Cairns, James E. Manning, Greg F. Welch, Henry Fuchs
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Emergency trauma is a major health problem worldwide. To evaluate the potential of emerging 3D telepresence technology for facilitating paramedic - physician collaboration while providing emergency medical trauma care we conducted a between-subjects post-test experimental lab study. During a simulated emergency situation 60 paramedics diagnosed and treated a trauma victim while working alone or in collaboration with a physician via 2D video or a 3D proxy. Analysis of paramedics' task performance shows that the fewest harmful procedures occurred in the 3D proxy condition. Paramedics in the 3D proxy condition also reported higher levels of self-efficacy. These results indicate 3D telepresence technology has potential to improve paramedics' performance of complex emergency medical tasks and improve emergency trauma health care when designed appropriately.
The heart&rsquo;s fibre alignment assessed by comparing two digitizing systems. Methodological investigation into the inclination angle towards wall thickness
Authors: P. P. Lunkenheimer, K. Redmann, K.-H. Dietl, C. Cryer, K.-D. Richter, W. F. Whimster, P. Niederer
Venue: Technology and Health Care (1997)

Myocardial contractile pathways which are not aligned strictly parallel to the heart&rsquo;s epicardial surface, give rise to forces which also act in the ventricular dilating direction. We developed a method which allows us to assess any fibre orientation in the three-dimensional myocardial weave. Decollagenized hearts were prepared by peeling-off fibre strands, following their main fibre orientation down to near the endocardium. In the subepicardium the strands followed a course more or less parallel to the epicardium, whereas from the mid-wall on they tended to dive progressively deeper into the wall. The preparation displays more or less rugged surfaces rather than smooth layers. The grooves and crests on the exposed surfaces were sequentially digitized by two methods&colon; (1) Using a magnet tablet (3 Draw Digitizer System, Polhemus, Cochester VTO 5446, USA) on a dilated pig heart we manually followed the crests using a stylus, handling each groove and crest as an individual contractile pathway. (2) A constricted cow heart was digitized using a contact-free optical system (opto TOP, Dr. Breuckmann, Meersburg, Germany), which is based on the principle of imaging triangulation. Using specially developed software the inclination angles of selected crests and grooves with respect to the epicardial surface were calculated. The two digitizing methods yield comparable results. We found a depth- and side-specific weave component inclined to the epi-endocardial direction. This oblique netting component was more pronounced in the inner 1/3 of the wall than in the subepicardium. The inclination angle probably increases with increasing wall thickness during the ejection period. Manual digitizing is an easy and fast method which delivers consistent results comparable with those obtained by the cumbersome high resolution optical method. The rationales for the assessment of transmural fibre inclination are (1) the putative existence of dilating forces inherent in the myocardial weave and (2) the possible overproportional increase in the oblique transmural weave component during myocardial hypertrophy, which would entail a reduction in efficiency of ventricular performance in terms of haemodynamic work.
Reasoning about vague topological information
Authors: Steven Schockaert, Martine De Cock
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Topological information plays a fundamental role in the human perception of spatial configurations and is thereby one of the most prominent geographical features in natural language. As vagueness abounds in geography, flexible formalisms with the ability to capture vague topological information are often needed in practice. While such formalisms have already been introduced by various authors, complete reasoning procedures are usually not discussed. In this paper, we show how many interesting reasoning tasks, such as consistency checking and entailment checking, can be supported in a generalization of the well-known RCC-8 calculus. In particular, we present decision procedures based on linear programming, solving all reasoning tasks of interest. We furthermore show how deciding the consistency of vague topological information can be reduced to the consistency problem of the original RCC-8.
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Authors: N. Srinivas, Kalyanmoy Deb
Venue: Evolutionary Computation (1994)

In trying to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands that the user have knowledge about the underlying problem. Moreover, in solving multiobjective problems, designers may be interested in a set of Pareto-optimal points, instead of a single point. Since genetic algorithms (GAs) work with a population of points, it seems natural to use GAs in multiobjective optimization problems to capture a number of solutions simultaneously. Although a vector evaluated GA (VEGA) has been implemented by Schaffer and has been tried to solve a number of multiobjective problems, the algorithm seems to have bias toward some regions. In this paper, we investigate Goldberg's notion of nondominated sorting in GAs along with a niche and speciation method to find multiple Pareto-optimal points simultaneously. The proof-of-principle results obtained on three problems used by Schaffer and others suggest that the proposed method can be extended to higher dimensional and more difficult multiobjective problems. A number of suggestions for extension and application of the algorithm are also discussed.
A Sliced Coprocessor for Native Clifford Algebra Operations
Authors: S. Franchini, A. Gentile, M. Grimaudo, C. A. Hung, S. Impastato, F. Sorbello, G. Vassallo, S. Vitabile
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Computer graphics applications require efficient tools to model geometric objects. The traditional approach based on compute-intensive matrix calculations is error-prone due to a lack of integration between geometric reasoning and matrix-based algorithms. Clifford algebra offers a solution to these issues since it permits specification of geometry at a coordinate-free level. The best way to exploit the symbolic computing power of geometric (Clifford) algebra is supporting its data types and operators directly in hardware. This paper outlines the architecture of S-CliffoSor (Sliced Clifford coprocesSor), a parallelizable embedded coprocessor that executes native Clifford algebra operations. S-CliffoSor is a sliced coprocessor that can be replicated for parallel execution of concurrent Clifford operations. A single slice has been designed, implemented and tested on the Celoxica Inc. RC1000 board. The experimental results show the potential to achieve a 3x speedup for Clifford sums and 4x speedup for Clifford products compared to against the analogous operations in the software library generator GAIGEN.