ppxscal/embedding_network huggingface dataset:
Neurally-Based Algorithms for Image Processing
Authors: Mark Flynn, Henry Abarbanel, Garrett Kenyon
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

One of the more difficult problems in image processing is segmentation. The human brain has an ability that is unmatched by any current technology for breaking down the world into distributed features and reconstructing them into distinct objects. Neurons encode informationboth in the number of spikes fired in a given time period, which indicates the strength with which a given local feature is present, and in the temporal code or relative timing of the spike, indicating whether the individual features are part of the same or different objects. Neurons that respond to contiguous stimuli produce synchronous oscillations, while those that are not fire independently. Thus, neural synchrony could be used as a tag for each pixel in an image indicating to which object it belongs. We have developed a simulation based on the primary visual cortex. We found that neurons that respond to the same object oscillate synchronously while those that respond to different objects fire independently.
The Complexity of Finding Paths in Graphs with Bounded Independence Number
Authors: Arfst Nickelsen, Till Tantau
Venue: SIAM Journal on Computing (2005)

We study the problem of finding a path between two vertices in finite directed graphs whose independence number is bounded by some constant k. The independence number of a graph is the largest number of vertices that can be picked such that there is no edge between any two of them. The complexity of this problem depends on the exact question we ask: Do we wish only to tell whether a path exists? Do we also wish to construct such a path? Are we required to construct the shortest one? Concerning the first question, we show that the reachability problem is first-order definable for all k and that its succinct version is $\Pi_2^{\mathrm{P}}$-complete for all k. In contrast, the reachability problems for many other types of finite graphs, including dags and trees, are not first-order definable, and their succinct versions are PSPACE-complete. Concerning the second question, we show not only that we can construct paths in logarithmic space, but that there even exists a logspace approximation scheme for this problem. The scheme gets a ratio r > 1 as additional input and outputs a path that is at most r times as long as the shortest path. Concerning the third question, we show that even telling whether the shortest path has a certain length is NL-complete and thus is as difficult as for arbitrary directed graphs.
Geo-word centric association rule mining
Authors: Katsumi Takahashi, Iko Pramudiono, Masaru Kitsuregawa
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Association rule mining is a well known data mining technique that also applicable to spatial data. Here we systematically elaborate spatial association rule mining which focusing on the "geo-word" in order to analyze location related preferences of human users. We propose several categories of mining methodologies based on the items in the rule and rule generation process. Novel interestingness metrics are derived out of those mining methodologies to identify location specific characteristics such as local specialties and common words. An experiment on real access logs from a commercial yellowpage site is conducted to examine the effectiveness of those methodologies
Aggregate Sum Retrieval in Sensor Network by Distributed Prefix Sum Data Cube
Authors: Lok Hang Lee, Man Hon Wong
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Several data aggregation algorithmsfor sensor networks have been proposed [3, 5-7, 9]. They are capable of returning the aggregate value of a single set of sensors. Howevel; when data aggregates of several sets of sensors are needed at the same time, the only solution these techniques provide is to build multipledistributed data structures or gossip groups in these sets of sensors. Hence in a sensor network with N sensors, we may need 2^N distributed data structures or gossip groups in order to get the aggregates of all possible sets of sensors. In this paper, we propose a novel and data-centric technique for the fast retrieval of aggregate sums from multiple regions in a sensor network, using only one single distributed data structure. Our idea is to construct a distributed data cube in the sensor network. The distributed data cube construction algorithm we propose makes use of the inclusion-exclusion principle and it can build a distributed prefix sum data cube in a sensor network in 0(N) worst case time. With the distributed data cube, data aggregate queries on any rectangular regions in the sensor network can be answered injust a constant number of operations.
Foreword: It is with regret that we report the death of Dr. Pallottino (April 11, 2004).
Venue: Networks (2004)

No abstract. 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
ARAS: Adaptive Recommender for Academic Scheduling
Authors: Mark Kilfoil, Wenpu Xing, Ali Ghorbani
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

This paper describes ARAS, a prototype adaptive website based on a novel and general adaptive website framework. ARAS acts as a course counselor, guiding students through an online information system of university courses. Using realistic trial data the prototype demonstrates adaptive navigation, fragment substitution, link addition and removal, and conditional fragment inclusion.
A Cache Engine for E-Content Integration
Authors: Peter Triantafillou, Nikos Ntarmos, John Yannakopoulos
Venue: IEEE Internet Computing (2004)

Content-integration systems generally suffer performance bottlenecks due to network overhead.To address this problem, the authors developed the Data Integration Cache Engine (DICE), which uses summarization techniques (subqueries and Bloom filters) and semantic metadata to achieve semantic active caching in the context of Internet-based data integration applications.The system uses algorithms and specialized data structures to generate exact remainder queries to locate content that is missing from cache in case of partial hits. The authors' performance results indicate that DICE outperforms existing options in terms of response time, network overhead, and server load.
Enriching software engineering courses with service-learning projects and the open-source approach
Authors: Chang Liu
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Real-world software engineers deal with complex problem. Yet many software engineering courses do not involve projects of enough complexity to give students such experience. We sense that service-learning projects, while difficult to manage and sustain, can serve a crucial role in this regard. Through trials in a senior-level software engineering course, we discovered that the open-source approach works well to enable students to work on large, multiple-term service-learning projects. We developed GROw, a cross-term, cross-team educational software process to meet the challenges of adopting complex, real-world projects in one-term courses, and to sustain service learning.
Optimizing the Synchronization Operations in Message Passing Interface One-Sided Communication
Authors: Rajeev Thakur, William Gropp, Brian Toonen
Venue: International Journal of High Performance Computing Applications (2005)

One-sided communication in Message Passing Interface (MPI) requires the use of one of three different synchronization mechanisms, which indicate when the one-sided operation can be started and when the operation is completed. Efficient implementation of the synchronization mechanisms is critical to achieving good performance with one-sided communication. However, our performance measurements indicate that in many MPI implementations, the synchronization functions add significant overhead, resulting in one-sided communication performing much worse than point-to-point communication for short- and medium-sized messages. In this paper, we describe our efforts to minimize the overhead of synchronization in our implementation of one-sided communication in MPICH2. We describe our optimizations for all three synchronization mechanisms defined in MPI: fence, post-start-complete-wait, and lock-unlock. Our performance results demonstrate that, for short messages, MPICH2 performs six times faster than LAM for fence synchronization and 50% faster for post-start-complete-wait synchronization, and it performs more than twice as fast as Sun MPI for all three synchronization methods.
A Low Voltage Wide-Input-Range Bulk-Input CMOS OTA
Authors: Ivan Grech, Joseph Micallef, George Azzopardi, Carl J. Debono
Venue: Analog Integrated Circuits and Signal Processing (2005)

The Gm-C technique is extensively used for continuous-time filtering applications because it results in tunable, wideband and compact designs. In this paper, an OTA architecture using a novel bulk-input differential pair without the use of a tail current source is proposed. Good CMRR is still achieved by using the gate terminal to control the total current in the differential pair, via the use of a dummy pair. The OTA also exhibits a wide differential input range and good Gm-tunability. For this design, two standard double-poly double-metal CMOS processes were investigated: a 0.8 ¿m process having a nominal threshold voltage of around 0.7 V and a 0.35 ¿m process having a nominal threshold voltage of 0.5 V. Simulation results are presented for both designs while test results are presented, for the OTA, implemented using the 0.8 ¿ m process, used in a second order cochlea low-pass filter.
Practical Performance Model for Optimizing Dynamic Load Balancing of Adaptive Applications
Authors: Kevin Barker, Nikos Chrisochoides
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Optimizing the performance of dynamic load balancing toolkits and applications requires the adjustment of several runtime parameters; however, determining sufficiently good values for these parameters through repeated experimentation can be an expensive and prohibitive process. We describe an analytic modeling method which allows developers to study and optimize adaptive application performance in the presence of dynamic load balancing. To aid tractibility, we first derive a "bi-modal" step function which simplifies and approximates task execution behavior. This allows for the creation of an analytic modeling function which captures the dynamic behavior of adaptive and asynchronous applications, enabling accurate predictions of runtime performance. We validate our technique using synthetic microbenchmarks and a parallel mesh generation application and demonstrate that this technique, when used in conjunction with the PREMA runtime toolkit, can offer users significant performance improvements over several well-known load balancing tools used in practice today.
Review of "Machine Intelligence and Related Topics: An Information Scientist's Weekend Book by Donald Michie"; Gordon & Breach, Science Publishers, Inc., ISBN 0-677-05560-9, 1982.
Authors: Anthony S. Maida
Venue: Issue 85 (July 1983) (1983)

Machine Intelligence is a collection of articles that Donald Michie has published in various, sometimes obscure, places over the years and which he thought would make an entertaining, informative anthology for the information scientist.
TASK PROTOCOL SPECIFICATION: A WORKSTATION INDEPENDENT SPECIFICATION TECHNIQUE FOR HUMAN-COMPUTER INTERACTION
Authors: Paul M. Mullins, Siegfried Treu
Venue: ACM SIGCHI Bulletin (1991)

Methods of specification for human-computer interfaces (HCI) are diverse. Commonly used methods include (augmented) transition networks, BNF grammars, event-based descriptions, and the command language grammar [Moran81]. The latter is especially useful for its task-based description of the conceptual model as well as the dialogue. The Command Language Grammar (CLG) begins with a task analysis, and proceeds to model the HCI structurally through a process of step-wise refinement. The result is a detailed specification or representation of the system.
Towards truthful mechanisms for binary demand games: a general framework
Authors: Ming-Yang Kao, Xiang-Yang Li, WeiZhao Wang
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They only apply to optimization problems with a utilitarian (or affine) objective function, and their output should optimize the objective function. For many optimization problems, finding the optimal output is computationally intractable. If we apply VCG mechanisms to polynomial-time algorithms that approximate the optimal solution, the resulting mechanisms may no longer be truthful.In light of these limitations, it is useful to study whether we can design a truthful non-VCG payment scheme that is computationally tractable for a given allocation rule O. In this paper, we focus our attention on emphbinary demand games in which the agents' only available actions are to take part in the a game or not to. For these problems, we prove that a truthful mechanism M=(O, P) exists with a proper payment method P iff the allocation rule O satisfies a certain monotonicity property. We provide a general framework to design such P. We further propose several general composition-based techniques to compute P efficiently for various types of output. In particular, we show how P can be computed through "or/and" combinations, round-based combinations, and some more complex combinations of the outputs from subgames.
Chips on wafers, or packing rectangles into grids
Authors: Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
Venue: Computational Geometry: Theory and Applications (2005)

A set of rectangles S is said to be grid packed if there exists a rectangular grid (not necessarily regular) such that every rectangle lies in the grid and there is at most one rectangle of S in each cell. The area of a grid packing is the area of a minimal bounding box that contains all the rectangles in the grid packing. We present an approximation algorithm that given a set S of rectangles and a real constant ε > 0 produces a grid packing of S whose area is at most (1 + ε) times larger than an optimal grid packing in polynomial time. If ε is chosen large enough the running time of the algorithm will be linear. We also study several interesting variants, for example the smallest area grid packing containing at least k ≤ n rectangles, and given a region A grid pack as many rectangles as possible within A. Apart from the approximation algorithms we present several hardness results.
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
Authors: J. Könemann, R. Ravi
Venue: SIAM Journal on Computing (2005)

We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree (MST) problem: Given an undirected graph with nonnegative edge weights and a degree bound B, find a spanning tree of maximum node-degree B and minimum total edge-cost. Our algorithm outputs a tree of maximum degree at most a constant times B and total edge-cost at most a constant times that of a minimum-cost degree-B-bounded spanning tree.While our new algorithm is based on ideas from Lagrangian relaxation, as is our previous work [SIAM J. Comput., 31 (2002), pp. 1783--1793], it does not rely on computing a solution to a linear program. Instead, it uses a repeated application of Kruskal's MST algorithm interleaved with a combinatorial update of approximate Lagrangian node-multipliers maintained by the algorithm. These updates cause subsequent repetitions of the spanning tree algorithm to run for longer and longer times, leading to overall progress and a proof of the performance guarantee. A second useful feature of our algorithm is that it can handle nonuniform degree bounds on the nodes: Given distinct bounds Bv for every node $v \in V$, the output tree has degree at most O(Bv + log|V|) for every $v \in V$. As before, the cost of the tree is at most a constant times that of a minimum-cost tree obeying all degree bounds.
Nonconvex Duality in Optimal Control
Authors: F. H. Clarke, C. Nour
Venue: SIAM Journal on Control and Optimization (2005)

We derive a representation of the minimum cost of an optimal control problem in terms of the upper envelope of generalized semisolutions of the Hamilton--Jacobi equation.
A Dual Pyramid Watermarking for JPEG-2000
Authors: Yu-Cheng Fan, Hen-Wai Tsao
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In the last decades, Internet becomes more and more popular. Considering the ownership right of digital image, content provides want to devise and effective way to protect their intelligent property right. Digital watermarking, which protects legal copy and distribution of digital products, has been the hotspot of international academia. In this paper, we propose a dual pyramid watermarking method to protect the ownership right of JPEG-2000 image. Dual pyramid watermarking includes a robust pyramid watermark and a fragile pyramid watermark. The robust pyramid watermark is embedded into the host image by changing the wavelet coefficients according to the characteristics of DWT, ROI, and EBCOT to protect copyrights. The fragile pyramid watermark records the characteristics of the coefficients in the high-high band to detect slight changes and authenticate the owner of the images. This scheme integrates the watermarking process with the JPEG-2000 compression procedures. We are able to anticipate which of the transformed coefficients will be discarded by the compression scheme. Experimental results show that the proposed technique successfully survives JPEG-2000 compression and can detect modification of the host image.
Accuracy of transformed kernel density estimates for a heavy-tailed distribution
Authors: N. M. Markovich
Venue: Automation and Remote Control (2005)

Nonparametric estimation for the density of a heavy-tailed probability distribution is studied through transformation of initial observations. The accuracy of transformed kernel estimates with constant and variable window width in the sense of mean integrated squared error for different transformations is determined. Boundary kernel are designed for improving estimation on distribution tails. For a kernel estimate with variable window width, the mismatch method ensures a mean integrated squared estimation error close to the optimal error.
Contrast Enhancement of Multi-Displays Using Human Contrast Sensitivity
Authors: Aditi Majumder
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Study of contrast sensitivity of the human eye shows that we are more sensitive to brightness differences at low intensity levels than at high intensity levels. We apply this fact effectively to achieve brightness seamlessness in multi-projector displays. Multi-displays, popularly made of a rectangular array of partially overlapping projectors, show severe spatial variation in brightness. Existing methods achieve brightness uniformity across the display by matching the brightness response of every pixel to the pixel with the most limited contrast leading to severe compression in the contrast of the display. In this paper, we propose a method that allows a constrained variation in brightness guided by the human contrast sensitivity function such that it is imperceptible to the human eye. This achieves a seamless multi-display with a dramatic improvement in the contrast making the display practically usable.
HERMES: An Angioplasty Surgery Simulator
Authors: Mirko Raspolli, Carlo Alberto Avizzano, Gabriele Facenza, Massimo Bergamasco
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Minimally invasive surgery procedures are getting common in surgical practice; this new interventional procedure requires a training process in order to be successful and safe. Computer-based simulators, with haptic feedback, can be an efficient method for facilitating the education and training process reducing costs of education and providing realism with regard to tissues behavior and real-time interaction. This work takes into account the results of the HERMES Project (HEmatology Research virtual MEdical System). The aim of this project is to build an integrate system in order to simulate a coronary angioplasty intervention. The designed Haptic Interface is able to generate on the user a force and a torque in order to replicate on his fingertips the usual sensations perceived during a real angioplasty operation. The big axial run allows simulating all the operation without interruptions.
Quadric-based simplification in any dimension
Authors: Michael Garland, Yuan Zhou
Venue: ACM Transactions on Graphics (TOG) (2005)

We present a novel generalization of the quadric error metric used in surface simplification that can be used for simplifying simplicial complexes of any type embedded in Euclidean spaces of any dimension. We demonstrate that our generalized simplification system can produce high quality approximations of plane and space curves, triangulated surfaces, tetrahedralized volume data, and simplicial complexes of mixed type. Our method is both efficient and easy to implement. It is capable of processing complexes of arbitrary topology, including nonmanifolds, and can preserve intricate boundaries.
A Class of High Resolution Difference Schemes for Nonlinear Hamilton-Jacobi Equations with Varying Time and Space Grids
Authors: Huazhong Tang, Gerald Warnecke
Venue: SIAM Journal on Scientific Computing (2005)

Based on a simple projection of the solution increments of the underlying partial differential equations (PDEs) at each local time level, this paper presents a difference scheme for nonlinear Hamilton--Jacobi (H--J) equations with varying time and space grids. The scheme is of good consistency and monotone under a local CFL-type condition. Moreover, one may deduce a conservative local time step scheme similar to Osher and Sanders scheme approximating hyperbolic conservation law (CL) from our scheme according to the close relation between CLs and H--J equations. Second order accurate schemes are constructed by combining the reconstruction technique with a second order accurate Runge--Kutta time discretization scheme or a Lax--Wendroff type method. They keep some good properties of the global time step schemes, including stability and convergence, and can be applied to solve numerically the initial-boundary-value problems of viscous H--J equations. They are also suitable to parallel computing.Numerical errors and the experimental rate of convergence in the Lp-norm, p = 1, 2, and $\infty$, are obtained for several one- and two-dimensional problems. The results show that the present schemes are of higher order accuracy.