ppxscal/embedding_network huggingface dataset:
Mapping XML instances
Authors: Sai Anand, Erik Wilde
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

For XML-based applications in general and B2B applications in particular, mapping between differently structured XML documents, to enable exchange of data, is a basic problem. A generic solution to the problem is of interest and desirable both in an academic and practical sense. We present a case study of the problem that arises in an XML based project, which involves mapping of different XML schemas to each other. We describe our approach to solving the problem, its advantages and limitations. We also compare and contrast our approach with previously known approaches and commercially available software solutions.
Pipelines on heterogeneous systems: models and tools: Research Articles
Authors: F. Almeida, D. Gonzalez, L. M. Moreno, C. Rodriguez
Venue: Concurrency and Computation: Practice Experience (2005)

We study the performance of pipeline algorithms in heterogeneous networks. The concept of heterogeneity is not only restricted to the differences in computational power of the nodes, but also refers to the network capabilities. We develop a skeleton tool that allows us an efficient block-cyclic mapping of pipelines on heterogeneous systems. The tool supports pipelines with a number of stages much larger than the number of physical processors available. We derive an analytical formula that allows us to predict the performance of pipelines in heterogeneous systems. According to the analytical complexity formula, numerical strategies to solve the optimal mapping problem are proposed. The computational results prove the accuracy of the predictions and effectiveness of the approach. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Evolution of mathematical models of chaotic systems based on multiobjective genetic programming
Authors: Katya Rodr&#x00ed;guez-V&#x00e1;zquez, Peter J. Fleming
Venue: Knowledge and Information Systems (2005)

This work is concerned with the identification of models for nonlinear dynamical systems using multiobjective evolutionary algorithms. Systems modelling involves the processes of structure selection, parameter estimation, model performance and model validation and involves a complex solution space. Evolutionary Algorithms (EAs) are search and optimisation tools founded on the principles of natural evolution and genetics, which are suitable for a wide range of application areas. Due to the versatility of these tools and motivated by the versatility of genetic programming (GP), this evolutionary paradigm is proposed for this modelling problem. GP is then combined with a multiobjective function definition scheme. Multiobjective genetic programming (MOGP) is applied to multiple, conflicting objectives and yields a set of candidate parsimonious and valid models, which reproduce the original system behaviour. The MOGP approach is then demonstrated as being applicable for system modelling with chaotic dynamics. The circuit introduced by Chua, being one of the most popular benchmarks for studying nonlinear oscillations, and the Duffing&#x2013;Holmes oscillator are the systems to test the evolutionary-based modelling approach introduced in this paper.
The vertex separator problem: algorithms and computations
Authors: Cid de Souza, Egon Balas
Venue: Mathematical Programming: Series A and B (2005)

This is a companion paper to our polyhedral study [1] of the Vertex Separator (VS) Problem. Given an undirected graph G, the VS problem consists in identifying a minimum-weight vertex set whose removal disconnects G, subject to bounds on the size of the resulting components. In this paper, we describe versions of a branch-and-cut algorithm based on the results of that polyhedral study. It uses two families of cuts, symmetric and asymmetric, for which we develop polynomial-time greedy separation routines. A heuristic to generate feasible separators is also used. A computational experiment on several data sets from the literature compares the performance of three versions of our algorithm to that of the commercial MIP solver XPRESS. This experiment throws a sharp light on the role of cut density, known to software developers but never before documented in the literature. It convincingly shows that the practical usefulness of cuts in integer programming depends not only on their strength, but also on their sparsity: everything else being equal, the smaller the cut support, the better. The power of the inequalities proposed here is well illustrated by the computational tests on dense graphs. This is in accordance with the previous observation, since the support of these cuts tends to decrease with graph density.
A Crowd Detecting and Tracking Algorithm Based on Projection of Grayscale Image
Authors: Huchuan Lu, Youjun Wang, Zunyi Wang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper an effective algorithm is developed to detect and track multiple people in a specific area. It advances a target detecting algorithm based on projection of grayscale image, while specifies a value function uniting features which are relatively unchanged for target tracking. And the result indicates a system based on our algorithms needs relatively less operations while the precision and efficiency are improved and the system has a certain self-adaptive capability.
Predatory search algorithm with restriction of solution distance
Authors: Chong Liu, Dingwei Wang
Venue: Biological Cybernetics (2005)

A variety of methods and algorithms have been developed to solve NP-Hard problems in recent decades. In this paper, we are concerned with a relatively new algorithm based on animal behavioral adaptability and evolutionary computation, namely predatory search. When first introduced, the algorithm was implemented with restrictions based on solution cost as a simplification of distance adopted by search-intensive predators. Our research concentrates on exploring the possibility of using distance to restrict search area. Based on the research of Boese et al. (1994), we propose a type of predatory search algorithm restricted by solution distance (particularly bond distance), and compare it with the original algorithm based on three benchmark traveling salesman problems. The results indicate that both algorithms are suitable for solving the traveling salesman problems, while our proposed algorithm either outperforms or at least matches its predecessor with respect to both the running time and the quality of solutions. In addition, further experiments suggest that there exists a certain relationship between the two algorithms.
Numerical methods, large codes, and programmers
Authors: Paul E. Saylor
Venue: ACM SIGNUM Newsletter (1980)

I asked Johnson if solving linear equations was a big part of the computational load at the laboratory. He said it must be about seventy-five percent of the machine time, but that his work to try to improve linear equation routines was mostly ineffectual. "You would go into the code and think you had it running faster, then they'd change the geometry or coefficients and that'd just kill you. You tamper with that code and then it might run a hundred hours of 7600 time over the weekend and not be worth a damn. It'd come back and be nothing but spaghetti. You get burned a few times like that and you think twice about changing anything. But like I say, if you could figure out a way to do it better it sure would make a difference. Only I never could."
Emergent behavior in two complex cellular automata rule sets: Research Articles
Authors: Christopher J. Hazard, Kyle R. Kimport, David H. Johnson
Venue: Complexity (2005)

Cellular automata systems often produce complex behavior from simple rule sets. The behaviors and results of two complex combinations of cellular automata rules are analyzed. Both two-dimensional rule sets add complexities to typical cellular automata systems by attaching attributes and rules to each cell. One of the rule sets produces gliders that reproduce upon collision, whereas the other grows into an intricate shape. Projection and entropy analysis classify the rule sets as complex for the intricate shape, but measurements indicate that the self-reproducing gliders fall between ordered and complex classification, despite their complex appearance. &copy; 2005 Wiley Periodicals, Inc. Complexity 10: 45&ndash;55, 2005
A fast XPATH evaluation technique with the facility of updates
Authors: Ashish Virmani, Suchit Agarwal, Rahul Thathoo, Shekhar Suman, Sudip Sanyal
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and also provide for updates without the need for the entire document being re-indexed in the RDBMS. We introduce a new labeling schema called the "Z-Label" for efficiently processing XPATH queries involving child and descendant axes.The use of "Z-Label" coupled with the indexing schema provides for smooth updates in the XML document.
Identification and analysis of novel tandem repeats in the cell surface proteins of archaeal and bacterial genomes using computational tools: Primary Research Papers
Authors: S. Adindla, K. K. Inampudi, K. Guruprasad, L. Guruprasad
Venue: Comparative and Functional Genomics (2004)

We have identified four novel repeats and two domains in cell surface proteins encoded by the Methanosarcina acetivorans genome and in some archaeal and bacterial genomes. The repeats correspond to a certain number of amino acid residues present in tandem in a protein sequence and each repeat is characterized by conserved sequence motifs. These correspond to: (a) a 42 amino acid (aa) residue RIVW repeat; (b) a 45 aa residue LGxL repeat; (c) a 42 aa residue LVIVD repeat; and (d) a 54 aa residue LGFP repeat. The domains correspond to a certain number of aa residues in a protein sequence that do not comprise internal repeats. These correspond to: (a) a 200 aa residue DNRLRE domain; and (b) a 70 aa residue PEGA domain. We discuss the occurrence of these repeats and domains in the different proteins and genomes analysed in this work. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The domestic economy: a broader unit of analysis for end user programming
Authors: Jennifer A. Rode, Eleanor F. Toye, Alan F. Blackwell
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Domestic ubicomp applications often assume individual users will program and configure their technology in isolation, decoupled from complex domestic environments in which they are situated. To investigate this assumption, we conducted a two week study of VCR use by eight families. Each household member old enough to write completed a diary, interviews were conducted before and after, and information on demographics and appliance ownership was collected. Our key finding supports the notion of the domestic economy and the trading of programming expertise. We use the Attention Investment paradigm, and discuss how the model fits with multi-user programming situations. We discuss the importance of the parent v/s child roles in VCR use, as well as, the tension between direct manipulation (e.g. pressing record) and programming ahead of time. We propose that future work on end user programming must focus on the household as a domestic system rather than on the individual.
Oscillation for a class of odd-order delay parabolic differential equations
Authors: Zigen Ouyang, Shengfan Zhou, Fuqi Yin
Venue: Journal of Computational and Applied Mathematics (2005)

Some sufficient conditions and some sufficient and necessary conditions are established for the oscillation of a class of odd-order delay parabolic differential equations of the form ∂Nu(x,t)/∂tN - a(t)Δu + Σi=1npi(x,t)u(x,t - σi) - Σj=1mqi(x,t)u(x,t - τj) + h(t)f(u(x,t - r1),...,u(x,t - rl)) = 0, (x, t) ∈ Ω × [t0, + ∞) ≡ G, t0 ∈ R, where N is an odd integer, Ω is a bounded domain in RM with a smooth boundary ∂Ω and Δ is the Laplacian operation with three different boundary conditions. To some extent, our results extended and improved the oscillatory results of some references. Meanwhile, we corrected some mistakes in a main conclusion of reference (J. Comput. Appl. Math. 147 (2002) 263).
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
Authors: Cesim Erten, Stephen G. Kobourov
Venue: Theory of Computing Systems (2005)

Traditional representations of graphs and their duals suggest that the dual vertices should be placed inside their corresponding primal faces, and the edges of the dual graph should only cross their corresponding primal edges. We consider the problem of simultaneously embedding a planar graph and its dual on a small integer grid such that the edges are drawn as straight-line segments and the only crossings are between primal--dual pairs of edges. We provide an O(n) time algorithm that simultaneously embeds a 3-connected planar graph and its dual on a (2n - 2) × (2n - 2) integer grid, where n is the total number of vertices in the graph and its dual. All the edges are drawn as straight-line segments except for one edge on the outer face, which is drawn using two segments.
Comparison of Approaches to Service Deployment
Authors: Vanish Talwar, Qinyi Wu, Calton Pu, Wenchang Yan, Gueyoung Jung, Dejan Milojicic
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

IT today is driven by the trend of increasing scale and complexity. Utility and Grid computing models, PlanetLab, and traditional data centers, are reaching the scale of thousands of computers. Installed software consists of dozens of interdependent applications and services. As the complexity and scale of these systems continues to grow, it becomes increasingly difficult to administer and manage them. At the same time, the service deployment technologies are still based on scripts and configuration files with minimal ability to express dependencies, to document and to verify configurations. This results in hard-to-use and erroneous system configurations. Language- and model-based tools, such as SmartFrog and Radia, are proposed for addressing these deployment challenges, but it is unclear whether they are beneficial over traditional solutions. In this paper, we quantitatively compare manual, script-, language-, and model-based deployment solutions as a function of scale, complexity, and susceptibility to change. We also qualitatively compare them in terms of expressiveness and barrier to first use. We demonstrate that script-based solutions are well matched for large scale deployments, language-based for services of large complexity, and model-based for dynamic changes to the design. Finally, we offer a table summarizing rules of thumb regarding which solution to use in which case, subject to deployment needs.
Analysis, simulation and verification of a bipolar current source power resonant inverter: Research Articles
Authors: Zhu Jianhua, Luo Fang Lin
Venue: International Journal of Circuit Theory and Applications (2004)

A high-frequency bipolar current source resonant inverter introduced in this paper has dramatic zero-voltage-switching (ZVS) characteristic. The analytic expressions of the resonant voltage and current are given. It indicates that the resonant waveform is composed of two parts, i.e. the oscillatory component and the stationary component. In special cases, the resonant waveform degenerates into the mono-frequency component, as presents the graceful sinusoidal wave with very low total harmonic distortion (THD) value. Based on the closed-form voltage and current, the component stresses on reactive elements are obtained. The impact of different component values and operating frequencies on ZVS feature is also discussed. It should be noted that the ZVS merit may be lost if the components are carelessly selected. The validity of the theoretical analysis has been proven with Pspice simulations and experimental results. Copyright &copy; 2004 John Wiley Sons, Ltd.
Real-Time Wide Area Multi-Camera Stereo Tracking
Authors: Tao Zhao, Manoj Aggarwal, Rakesh Kumar, Harpreet Sawhney
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a fully integrated real-time system to track humans with a network of stereo sensors over a wide area. The processing includes single camera tracking and multi-camera fusion. Each single camera detects and tracks humans in its own view and a multi-camera fusion module combines all the local tracks of the same human into a global track. We propose novel stereo segmentation and tracking techniques to handle multiple humans moving in groups in cluttered environments. We have developed a ground-based fusion method for camera handoff using space-time constraint. We show results and performance evaluation on very challenging data from a12-camera system.
Information security curriculum creation: a case study
Authors: Bradley Bogolea, Kay Wijekumar
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

Information Security is a critical part of the technology infrastructure. A survey of undergraduate degree programs in Computer Science, Information Technology, Management Information Science, and others show a lack of emphasis on security issues in their curriculum. The purpose of this paper is to present a case study on our approach to creating an undergraduate curriculum that will enhance existing degree programs in Computer Science and Information Technology to provide an increased awareness of Information Security concepts. Our rationale includes: research on existing Information Security programs, review of other Information Security curriculum development efforts, assessments and surveys of workforce needs in Information Technology pertaining to security, applying government directives, and the process of creating a curriculum to address the discovered gaps. Our approach is unique in its usage of surveys of Information Technology professionals, interviews with professionals, and a comprehensive survey of workforce needs in Information Security along with a review of other curriculum development efforts. From this case study, we will be able to suggest and define an Information Security curriculum that will best answer today's security challenges.
Predictors of customer perceived software quality
Authors: Audris Mockus, Ping Zhang, Paul Luo Li
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Predicting software quality as perceived by a customer may allow an organization to adjust deployment to meet the quality expectations of its customers, to allocate the appropriate amount of maintenance resources, and to direct quality improvement efforts to maximize the return on investment. However, customer perceived quality may be affected not simply by the software content and the development process, but also by a number of other factors including deployment issues, amount of usage, software platform, and hardware configurations. We predict customer perceived quality as measured by various service interactions, including software defect reports, requests for assistance, and field technician dispatches using the afore mentioned and other factors for a large telecommunications software system. We employ the non-intrusive data gathering technique of using existing data captured in automated project monitoring and tracking systems as well as customer support and tracking systems. We find that the effects of deployment schedule, hardware configurations, and software platform can increase the probability of observing a software failure by more than 20 times. Furthermore, we find that the factors affect all quality measures in a similar fashion. Our approach can be applied at other organizations, and we suggest methods to independently validate and replicate our results.
Genetic algorithm to generate optimized soft keyboard
Authors: Mathieu Raynal, Nadine Vigouroux
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In this paper, we propose a genetic algorithm formal framework to optimize character location on a soft keyboard. This method is described regardless of the language and layout used and can then easily be adapted to any language and layout. In this scope, we present a measure, based on Mackenzie's model, to estimate the performances of the best characters in a given layout. We apply our method to common English language and two different layouts (hexagonal and rectangular layout) in order to compare with FITALY, OPTI or Metropolis keyboards. In all configurations, our method has the best performance.
Energy Balanced Broadcasting Through Delayed Intelligence
Authors: Michael R. Gosnell, Ryan Albarelli, Maggie X. Cheng, Bruce McMillin
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Ad hoc wireless networks are growing in popularity and usefulness, however they rely on broadcasting as a fundamental process for routing. Improvements to broadcasting have made ad hoc networks more feasible, but sometimes benefit only specific situations. Delayed Intelligence (DI) is proposed as a new load balancing approach where small delays are introduced to allow distributed responsibility delegation. Preliminary results show delayed intelligence, when applied in existing broadcasting methods such as passive clustering, can be used to improve the energy disparity and therefore extend ad hoc network lifetime.
Pixel-level snakes on the CNNUM: algorithm design, on-chip implementation and applications: Research Articles
Authors: David L. Vilariño, Csaba Rekeczky
Venue: International Journal of Circuit Theory and Applications (2005)

In this paper, a new algorithm for the cellular active contour technique called pixel-level snakes is proposed. The motivation is twofold: on the one hand, a higher efficiency and flexibility in the contour evolution towards the boundaries of interest are pursued. On the other hand, a higher performance and suitability for its hardware implementation onto a cellular neural network (CNN) chip-set architecture are also required. Based on the analysis of previous schemes the contour evolution is improved and a new approach to manage the topological transformations is incorporated. Furthermore, new capabilities in the contour guiding are introduced by the incorporation of inflating&#x002F;deflating terms based on the balloon forces for the parametric active contours. The entire algorithm has been implemented on a CNN universal machine (CNNUM) chip set architecture for which the results of the time performance measurements are also given. To illustrate the validity and efficiency of the new scheme several examples are discussed including real applications from medical imaging. Copyright &copy; 2005 John Wiley & Sons, Ltd.