ppxscal/embedding_network huggingface dataset:
Introduction to discrete differential geometry: the geometry of plane curves
Authors: Eitan Grinspun, Adrian Secord
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

The nascent field of discrete differential geometry deals with discrete geometric objects (such as polygons) which act as analogues to continuous geometric objects (such as curves). The discrete objects can be measured (length, area) and can interact with other discrete objects (collision/response). From a computational standpoint, the discrete objects are attractive, because they have been designed from the ground up with data-structures and algorithms in mind. From a mathematical standpoint, they present a great challenge: the discrete objects should have properties which are analogues of the properties of continuous objects. One important property of curves and surfaces is their curvature, which plays a significant role in many application areas (see, e.g., Chapters 4 and 5). In the continuous domain there are remarkable theorems dealing with curvature; a key requirement for a discrete curve with discrete curvature is that it satisfies analogous theorems. In this chapter we examine the curvature of continuous and discrete curves on the plane.
An approximation algorithm to the k-Steiner Forest problem
Authors: Peng Zhang, Mingji Xia
Venue: Theoretical Computer Science (2009)

Given a graph G, an integer k, and a demand set D={(s"1,t"1),...,(s"l,t"l)}, the k-Steiner Forest problem finds a forest in graph G to connect at least k demands in D such that the cost of the forest is minimized. This problem was proposed by Hajiaghayi and Jain in SODA'06. Thereafter, using a Lagrangian relaxation technique, Segev et al. gave the first approximation algorithm to this problem in ESA'06, with performance ratio O(n^2^/^3logl). We give a simpler and faster approximation algorithm to this problem with performance ratio O(n^2^/^3logk) via greedy approach, improving the previously best known ratio in the literature.
Visual word proximity and linguistics for semantic video indexing and near-duplicate retrieval
Authors: Yu-Gang Jiang, Chong-Wah Ngo
Venue: Computer Vision and Image Understanding (2009)

Bag-of-visual-words (BoW) has recently become a popular representation to describe video and image content. Most existing approaches, nevertheless, neglect inter-word relatedness and measure similarity by bin-to-bin comparison of visual words in histograms. In this paper, we explore the linguistic and ontological aspects of visual words for video analysis. Two approaches, soft-weighting and constraint-based earth mover's distance (CEMD), are proposed to model different aspects of visual word linguistics and proximity. In soft-weighting, visual words are cleverly weighted such that the linguistic meaning of words is taken into account for bin-to-bin histogram comparison. In CEMD, a cross-bin matching algorithm is formulated such that the ground distance measure considers the linguistic similarity of words. In particular, a BoW ontology which hierarchically specifies the hyponym relationship of words is constructed to assist the reasoning. We demonstrate soft-weighting and CEMD on two tasks: video semantic indexing and near-duplicate keyframe retrieval. Experimental results indicate that soft-weighting is superior to other popular weighting schemes such as term frequency (TF) weighting in large-scale video database. In addition, CEMD shows excellent performance compared to cosine similarity in near-duplicate retrieval.
Implementing set-theoretic relational-query functions using highly parallel index-processing hardware
Authors: Sakti Pramanik
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Hardware organizations for processing set-theoretic database query functions are presented. These organizations implement the functions by processing index trees. One advantage of this approach is that the index trees can be merged in a highly parallel fashion. Hardware organizations proposed here use the database machine approach, thus processing the index-trees on the fly. Experimental results giving the performances of these organizations are presented. Finally, a slight variation of the index tree representation, requiring much less storage for the index, is given.
Rule Extraction from Neural Networks Via Ant Colony Algorithm for Data Mining Applications
Authors: Lale Özbakır, Adil Baykasoğlu, Sinem Kulluk
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

A common problem in Data Mining (DM) is the presence of noise in the data being mined. Artificial neural networks (ANN) are robust and have a good tolerance to noise, which makes them suitable for mining very noisy data. Although they may achieve high classification accuracy, they have the well-known disadvantage of having black-box nature and not discovering any high-level rule that can be used as a support for human understanding. The main challenge in using ANN in DM applications is to get explicit knowledge from these models. For this purpose, a study on knowledge acquirement from trained ANNs for classification problems is presented. The proposed method uses Touring Ant Colony Optimization (TACO) algorithm for extracting accurate and comprehensible rules from databases via trained artificial neural networks. The suggested algorithm is experimentally evaluated on different benchmark data sets. Results show that the proposed approach has a potential to generate accurate and concise rules.
On the properties of von Neumann kernels for link analysis
Authors: Masashi Shimbo, Takahiko Ito, Daichi Mochihashi, Yuji Matsumoto
Venue: Machine Learning (2009)

We study the effectiveness of Kandola et al.'s von Neumann kernels as a link analysis measure. We show that von Neumann kernels subsume Kleinberg's HITS importance at the limit of their parameter range. Because they reduce to co-citation relatedness at the other end of the parameter, von Neumann kernels give us a spectrum of link analysis measures between the two established measures of importance and relatedness. Hence the relative merit of a vertex can be evaluated in terms of varying trade-offs between the global importance and the local relatedness within a single parametric framework. As a generalization of HITS, von Neumann kernels inherit the problem of topic drift. When a graph consists of multiple communities each representing a different topic, HITS is known to rank vertices in the most dominant community higher regardless of the query term. This problem persists in von Neumann kernels; when the parameter is biased towards the direction of global importance, they tend to rank vertices in the dominant community uniformly higher irrespective of the community of the seed vertex relative to which the ranking is computed. To alleviate topic drift, we propose to use of a PLSI-based technique in combination with von Neumann kernels. Experimental results on a citation network of scientific papers demonstrate the characteristics and effectiveness of von Neumann kernels.
Visual SourceSafe 2005 Software Configuration Management in Practice: Best practice management and development of Visual Studio .NET 2005 applications with this easy-to-use SCM tool from Microsoft
Authors: Alexandru Serban
Venue:  (2007)

This book uses a real-world case-study project to teach you how to manage software configuration efficiently using Visual SourceSafe 2005, Microsoft's Software Configuration Management (SCM) solution for independent developers and for developers working in small- and medium-sized teams. It also provides a best-practices reference on using SourceSafe 2005 to manage the software development lifecycle. This book is for .NET developers, testers and configuration managers who: Use Visual Studio .NET 2005 for building software. Want to use software configuration to manage their products in day-to-day activities. Want to improve their efficiency by learning to use the best practices with SourceSafe. Want to install, manage, and configure Visual SourceSafe 2005 for optimal operation. The book does not assume previous knowledge of Software Configuration Management or Visual SourceSafe. It takes the reader from the ground up and is a great resource for people starting to learn about this subject. Readers with previous SourceSafe experience will benefit by discovering the improved and new features in Visual SourceSafe 2005.
Extremal Optimisation with a Penalty Approach for the Multidimensional Knapsack Problem
Authors: Pedro Gómez-Meneses, Marcus Randall
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

The extremal optimisation (EO) meta-heuristic is a recent form of search that is suitable for combinatorial optimisation problems. EO has been applied to problems such as graph partitioning, spin glass, and graph colouring. However, only a relatively small amount of work has been done on other combinatorial problems particularly those having constraints. This paper examines the issue of satisfying constraints with a penalty approach using the multidimensional knapsack problem. An EO model is presented which finds solutions through the analysis of the number of overloaded constraints. This approach allows the solution state move between feasible and infeasible spaces. The results show that the new algorithm is able to obtain optimal results for small problems and finds competitive solutions for large problems.
A tool for neutrophil guided dose adaptation in chemotherapy
Authors: Johan E. Wallin, Lena E. Friberg, Mats O. Karlsson
Venue: Computer Methods and Programs in Biomedicine (2009)

Chemotherapy dosing in anticancer treatment is a balancing act between achieving concentrations that are effective towards the malignancy and that result in acceptable side-effects. Neutropenia is one major side-effect of many antitumor agents, and is related to an increased risk of infection. A model capable of describing the time-course of myelosuppression from administered drug could be used in individual dose selection. In this paper we describe the transfer of a previously developed semi-mechanistic model for myelosuppression from NONMEM to a dosing tool in MS Excel, with etoposide as an example. The tool proved capable to solve a differential equation system describing the pharmacokinetics and pharmacodynamics, with estimation performance comparable to NONMEM. In the dosing tool the user provides neutrophil measures from a previous treatment course and request for the dose that results in a desired nadir in the upcoming course through a Bayesian estimation procedure.
Predictions for 2009
Authors: Lisa Neal Gualtieri
Venue: eLearn (2009)

Once a year we turn to the experts in our field to share their predictions on what lies ahead for the e-learning community. While our colleagues unanimously agree the global economic downturn is the overwhelming factor coloring their forecasts, they do see a great array of opportunities and challenges in the coming 12 months.
Movement 11 (2008 serie)
Authors: Alain Bittler
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

In this expression of the energy of a virtual dancer, we can see the vibration of his virtual movements in the universe. My work is about my impression of Asian wisdom and gods.
One- and two-dimensional lattice sums for the three-dimensional Helmholtz equation
Authors: C. M. Linton, I. Thompson
Venue: Journal of Computational Physics (2009)

The accurate and efficient computation of lattice sums for the three-dimensional Helmholtz equation is considered for the cases where the underlying lattice is one- or two-dimensional. We demonstrate, using careful numerical computations, that the reduction method, in which the sums for a two-dimensional lattice are expressed as a sum of one-dimensional lattice sums leads to an order-of-magnitude improvement in performance over the well-known Ewald method. In the process we clarify and improve on a number of results originally formulated by Twersky in the 1970s.
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
Authors: Mohammad Ansari, Mikel Luján, Christos Kotselidis, Kim Jarvis, Chris Kirkham, Ian Watson
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered to minimise aborts, but such an ordering is often either complex, or unfeasible, to obtain.This paper introduces a new technique called steal-on-abort, which aims to improve transaction ordering at runtime. Suppose transactions A and B conflict, and B is aborted. In general it is difficult to predict this first conflict, but once observed, it is logical not to execute the two transactions concurrently again. In steal-on-abort, the aborted transaction B is stolen by its opponent transaction A, and queued behind A to prevent concurrent execution of A and B. Without steal-on-abort, transaction B would typically have been restarted immediately, and possibly had a repeat conflict with transaction A.Steal-on-abort requires no application-specific information, modification, or offline pre-processing. In this paper, it is evaluated using a sorted linked list, red-black tree, STAMP-vacation, and Lee-TM. The evaluation reveals steal-on-abort is highly effective at eliminating repeat conflicts, which reduces the amount of computing resources wasted, and significantly improves performance.
An m-EVBT algorithm for energy efficient routing in wireless sensor networks
Authors: Jaekwang Kim, KwangHo Yoon, Seunghoon Lee, Je-hee Jung, Jee-Hyong Lee
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

The virtual backbone concept is a method of efficient communication in wireless sensor networks. A recent variant is the energy-aware virtual backbone tree (EVBT) algorithm which applies a tree structure to the backbone. This algorithm can minimize the energy consumed in a data transfer between a sensor node and a tree node, but cannot minimize the energy consumption throughout the routing process. In this paper, we propose a modified-EVBT (m-EVBT) algorithm which consumes less energy than the EVBT algorithm over the entire routing process. While EVBT algorithm uses physical distance to determine the upstream link of a sensor node, the proposed algorithm uses energy consumption information. The experimental results show that the m-EVBT algorithm consumes less energy than the EVBT algorithm. It also efficiently constructs the backbone tree.
Shape Reconstruction by Combination of Structured-Light Projection and Photometric Stereo Using a Projector-Camera System
Authors: Tomoya Okazaki, Takayuki Okatani, Koichiro Deguchi
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In this paper, we present a method for synthesizing virtual appearance of an object by projecting images onto the surface of the object using projectors. The object surface is assumed to have a known diffuse reflectance property; its shape is allowed to have an arbitrary shape. Using a system consisting of multiple projectors and a camera, the method first estimates their internal and external parameters as well as the object surface based on the projection of structured patterns, and then measures surface normals by the method of photometric stereo that uses the same projectors as point sources of illumination. By enabling highly accurate calibration of the projectors as well as reconstruction of the object shape and also by reducing the random errors in surface normals that significantly affect final appearance, it is made possible to synthesize high-quality appearance associated with an arbitrary virtual reflectance property.
Identification Model of Logistic Regression Analysis on Listed Firms' Frauds in China
Authors: Xiaoxin Chen, Rong Ye
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The identification of corporation accounting frauds is a major difficulty in financial study. This article establishes an identifying model of financial frauds of Chinese listed firms by adopting Logistic regression analysis. Then it defines public companies whose accounting statements are rejected or denied by register accountant in Shanghai & Shenzhen security market as " corporation with financial frauds" and selects 88 corporations which contain 44 companies with financial frauds and 44 companies without financial frauds as samples of study to build the Logistic regression identifying model for financial frauds of listed firms. Appling the model to test samples which contain 30 firms which 15 companies with financial frauds and 15 companies without financial frauds, it possesses good identification ability, because accurate rate of its identification is 93.33%.
Convergence of optimal solutions about approximation scheme for fuzzy programming with minimum-risk criteria
Authors: Yan-Kui Liu, Miao Tian
Venue: Computers Mathematics with Applications (2009)

This paper presents a class of two-stage fuzzy programming with minimum-risk criteria in the sense of Value-at-Risk (VaR). Since the proposed two-stage fuzzy minimum-risk problem (FMRP) often includes fuzzy variable coefficients defined through possibility distributions with infinite supports, it is inherently an infinite-dimensional optimization problem that can rarely be solved directly. Thus, algorithm procedures for solving such an optimization problem must rely on soft computing and approximation schemes, which result in a finite-dimensional optimization problem. In this paper, we develop an approximation method to compute the objective function of the two-stage FMRP, and discuss the convergent results about the use of the approximation method in FMRP, including the convergence of the objective value, optimal value, and the optimal solutions. To apply the convergent results about the approximation method, we consider a two-stage fuzzy facility location-allocation (FLA) problem with VaR objective, and solve the problem indirectly by solving its approximating problem. Since the approximating fuzzy FLA problem is neither linear nor convex, conventional optimization algorithms cannot be used to solve it. In this paper, we design a hybrid particle swarm optimization (PSO) algorithm to solve the approximating fuzzy FLA problem. One numerical example with five facilities and ten customers is also presented to demonstrate the effectiveness of the designed algorithm.
Low-complexity policies for energy-performance tradeoff in chip-multi-processors
Authors: Avshalom Elyada, Ran Ginosar, Uri Weiser
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Chip-multi-processor (CMP) utilize multiple energy-efficient processing elements (PEs) to deliver high performance while reducing energy-consumption. Dynamic frequency-Voltage Scaling (DVS) balances performance and energy consumption by varying PEs' frequency-voltage workpoints to save energy while meeting performance requirements. We consider multi-task CMP applications with unknown workloads, and dynamically set workpoints to minimize ET2. Heuristic policies for serial/parallel task-graphs are investigated. We compare these policies to a theoretical bound and show that they achieve good results with low complexity. In most cases the simplest policy, which usually assigns constant workpoints, is also the most cost-effective one.
Integration of a GIS and a complex three-dimensional hydrodynamic, sediment and heavy metal transport numerical model
Authors: Sandy M. Y. Ng, Onyx W. H. Wai, Yok-Shueng Li, Zhi-Lin Li, Yuwu Jiang
Venue: Advances in Engineering Software (2009)

The paper presents an integration of a geographic information system (GIS) and a complex three-dimensional hydrodynamic sediment and heavy metal transport numerical model. The integration overcomes the two-dimensional constraint of conventional GIS by supplementing advance tools for three-dimensional, dynamic visualization. The application of a GIS-based interface module together with the three-dimensional, dynamic display tools enhances communication of relationships and trends of hydrodynamic and pollutant transport simulation in both spatial and temporal context, and thus promotes better coastal water quality planning and management. Model functionality includes input data viewing and editing, mesh grid configuration, and result interpretation. The functionality of the GIS-model integrated system is illustrated through a case study on the Pearl River Estuary (PRE).
Maximum benefit from a minimal HTM
Authors: Owen S. Hofmann, Christopher J. Rossbach, Emmett Witchel
Venue: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems (2009)

A minimal, bounded hardware transactional memory implementation significantly improves synchronization performance when used in an operating system kernel. We add HTM to Linux 2.4, a kernel with a simple, coarse-grained synchronization structure. The transactional Linux 2.4 kernel can improve performance of user programs by as much as 40% over the non-transactional 2.4 kernel. It closes 68% of the performance gap with the Linux 2.6 kernel, which has had significant engineering effort applied to improve scalability. We then extend our minimal HTM to a fast, unbounded transactional memory with a novel technique for coordinating hardware transactions and software synchronization. Overflowed transactions run in software, with only a minimal coupling between hardware and software systems. There is no performance penalty for overflow rates of less than 1%. In one instance, at 16 processors and an overflow rate of 4%, performance degrades from an ideal 4.3x to 3.6x.
New formulations for recursive residuals as a diagnostic tool in the fixed-effects linear model with design matrices of arbitrary rank
Authors: J. D. Godolphin
Venue: Computational Statistics Data Analysis (2009)

The use of residuals for detecting departures from the assumptions of the linear model with full-rank covariance, whether the design matrix is full rank or not, has long been recognized as an important diagnostic tool. Once it became feasible to compute different kinds of residual in a straight forward way, various methods have focused on their underlying properties and their effectiveness. The recursive residuals are attractive in Econometric applications where there is a natural ordering among the observations through time. New formulations for the recursive residuals for models having uncorrelated errors with equal variances are given in terms of the observation vector or the usual least-squares residuals, which do not require the computation of least-squares parameter estimates and for which the transformation matrices are expressed wholly in terms of the rows of the Theil Z matrix. Illustrations of these new formulations are given.