ppxscal/embedding_network huggingface dataset:
On Topological Watersheds
Authors: Gilles Bertrand
Venue: Journal of Mathematical Imaging and Vision (2005)

In this paper, we investigate topological watersheds (Couprie and Bertrand, 1997). One of our main results is a necessary and sufficient condition for a map G to be a watershed of a map F, this condition is based on a notion of extension. A consequence of the theorem is that there exists a (greedy) polynomial time algorithm to decide whether a map G is a watershed of a map F or not. We introduce a notion of "separation between two points" of an image which leads to a second necessary and sufficient condition. We also show that, given an arbitrary total order on the minima of a map, it is possible to define a notion of "degree of separation of a minimum" relative to this order. This leads to a third necessary and sufficient condition for a map G to be a watershed of a map F. At last we derive, from our framework, a new definition for the dynamics of a minimum.
A SAW Tactile Display Using a Glass Substrate
Authors: Hiroyuki Kotani, Masaya Takasaki, Takeshi Mizuno, Takaaki Nara
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

A surface acoustic wave (SAW) tactile display consisted of a piezoelectric substrate and a slider. Rubbing the substrate through the slider, we could feel tactile sensations under a control depending on the rubbing motion. On the other hand, the piezoelectric substrate had constraint of size and shape. In this research, to solve this issue, a method was proposed to excite and propagate a SAW on a non-piezoelectric material surface. The method was realized by combination of a LiNbO3 plate and a glass substrate. Characteristics was measured. The effectiveness of the proposed method for the tactile display was discussed. An active type SAW tactile display using the glass transducer worked successfully.
An Efficient Content-Addressable Memory Implementation Using Dynamic Routing
Authors: Philip B. James-Roxby, Daniel J. Downs
Venue: Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2001)

Content addressable memories are important components in high-speed networking equipment. This paper describes the design of a wide CAM suitable for use as an IPv6 traffic classifier for a 622Mb/s communications link. The design flow uses a combination of standard design tools in conjunction with JBits, a low-level configuration API for manipulating programmable resources. The CAMs are 320 bits wide to accommodate a full IPv6 header. The most powerful wildcarding possible is supported, ranging from donýt cares on single bits of the header, all the way through to donýt cares for the whole header. A priority mechanism has been designed which allows explicit priority encoding to be used without required a costly sorting network. This is performed by dynamic routing, whereby routes are determined at run-time between the match units and the priority encoder. This allows a smaller, faster implicit priority encoder to be used, whilst still allowing priority to be explicitly defined. An experimental set-up is shown, which allows 128 320-bit patterns to be matched at 50.9 Msearches/s.
A learning method of immune multi-agent neural networks
Authors: Takumi Ichimura, Shinichi Oeda, Machi Suka, Katsumi Yoshida
Venue: Neural Computing and Applications (2005)

Many different learning algorithms for neural networks have been developed, with advantages offered in terms of network structure, initial values of some parameters, learning speed, and learning accuracy. If we train the networks only on good examples, without noise and shortage, the neural network can be trained to classify, with reasonable accuracy, target patterns or random patterns, but not both. To solve this problem, we propose a learning method of immune multi-agent neural networks (IMANNs), which have agents of macrophages, B-cells and T-cells. Each agent employs a different type of neural network. Because the agents work cooperatively and competitively, IMANNs can automatically classify the training dataset into some subclasses. In this paper, two types of IMANNs are described and their classification capabilities are compared. In order to verify the effectiveness of our proposed method, we used two datasets: the dataset of the MONK&#x2019;s problem (as a traditional classification problem) and a dataset from a medical diagnosis problem (hepatobiliary disorders).
Profile on the numerical mathematics section of the Lawrence Livermore laboratory
Authors: Fred N. Fritsch
Venue: ACM SIGNUM Newsletter (1973)

The following information is presented in response to the <u>Newsletter</u> Editor's request for "profiles of individual Numerical Mathematics Groups in industry."
Programming sensor networks with mobile agents
Authors: Athanassios Boulis
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Sensor Networks need the ability to be dynamically programmed efficiently. Several frameworks have been developed for this purpose largely falling into one of three classes: i) user-guided code updates, ii) database model, and iii) agent-based model. Even though the agent-based model is being touted to bring increased efficiency in terms of energy consumed, its advantage has not been clearly articulated by the relevant sensor network literature. We identify a suitable application to showcase the advantages of autonomously mobile code and analyze the generic solutions offered by the three different classes of frameworks to show that indeed an agent-based approach can bring considerable energy savings for some application scenarios.
H" Model Reduction of 2-D Singular Roesser Models
Authors: Huiling Xu, Yun Zou, Shengyuan Xu, James Lam, Qing Wang
Venue: Multidimensional Systems and Signal Processing (2005)

This paper discusses the problem of H¿ model reduction for linear discrete time 2-D singular Roesser models (2-D SRM). A condition for bounded realness is established for 2-D SRM in terms of linear matrix inequalities (LMIs). Based on this, a sufficient condition for the solvability of the H¿ model reduction problem is obtained via a group of LMIs and a set of coupling non-convex rank constraints. An explicit parameterization of the desired reduced-order models is presented. Particularly, a simple LMI condition without rank constraints is proposed for the zeroth-order H¿ approximation problem. Finally, a numerical example is given to illustrate the applicability of the proposed approach.
Ejb 2.0 Development With Websphere Studio Application Developer
Authors: Ueli Wahli
Venue:  (2003)

Learn about the EJB 2.0 specification Develop EJBs with Studio Application Developer Deploy EJBs to WebSphere Application Server This IBM Redbook provides detailed information on how to effectively use WebSphere Studio Application Developer for the development of applications based on the Enterprise JavaBeans (EJB) architecture, and deployment of such applications to a WebSphere Application Server. Throughout the book, we provide examples based on a simple banking application with an underlying relational database. In Part 1, we introduce EJBs as a part of Java 2 Enterprise Edition (J2EE) and cover the basic concepts and the architecture. In particular we point out the new functions introduced with the EJB 2.0 specification that provide, for example, enhanced functionality for container-managed persistence entity beans and message-driven beans. We also provide best practice guidelines for successful implementations of EJBs. In Part 2, we introduce the sample banking application and then implement entity beans, session beans, and message-driven beans using WebSphere Studio Application Developer. We also implement finder methods, different mapping strategies, and simple clients that use the EJBs. At the end, we describe how to deploy EJB applications to a WebSphere Application Server.
A resource management framework for interactive Grids: Research Articles
Authors: Raj Kumar, Vanish Talwar, Sujoy Basu
Venue: Concurrency and Computation: Practice Experience (2004)

Traditional use of Grid computing systems has been for batch jobs in the scientific and academic computing. We envision the next generation Grid computing systems to support graphical interactive sessions. In this paper, we propose a resource management framework for supporting graphical interactive sessions in a Grid computing system. We describe the high-level architectural resource management framework distributed among the submission node, central scheduler node, and the execution node. We then describe in detail the resource management framework on the execution node. The description of the resource management framework on the scheduler node is kept at a high level in this paper. The framework on execution nodes consists of Resource Management Agents, an Admission Control system and Application Predictor system. The agents on the execution node are Startup Agents, Sensor Agents, Monitoring Agents, Aggregator Agents, Enforcement Agents and Registration Agents. The Session Admission Control system is responsible for determining if a new application session can be admitted to the execution node. An Application Predictor system is responsible for predicting the resource utilization behavior of applications based on data obtained from the Resource Management Agents. The proposed framework allows for implementation of a scalable and extensible middleware for interactive Grid resource management. It supports fine-grained performance guarantees specified in service level agreements and brings forth some important and novel contributions to enable graphical interactive sessions on Grids. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A Meta-Software System for the Discovery of Hadamard Matrices
Authors: Ilias S. Kotsireas, Gil Pinheiro
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The purpose of this paper is to describe some of the technical and engineering concerns which define the search for Hadamard matrices through the creation of a software system which is correct, efficient and extensible.
Application of finite element-finite difference method to the determination of transient temperature field in functionally graded materials
Authors: Bao-Lin Wang, Zhen-Hui Tian
Venue: Finite Elements in Analysis and Design (2005)

A finite element/finite difference method (FEM/FDM) is developed to solve the time-dependent temperature field in non-homogeneous materials such as functionally graded materials. The method uses the finite element space discretization to obtain a first-order system of differential equations, which is solved by employing finite difference scheme to resolve the time-dependent response. A computation code is developed in the programming environment MATLAB. Temperature-dependent material properties are taken into account in the program.
Image-Based Rendering Using Image-Based Priors
Authors: Andrew Fitzgibbon, Yonatan Wexler, Andrew Zisserman
Venue: International Journal of Computer Vision (2005)

Given a set of images acquired from known viewpoints, we describe a method for synthesizing the image which would be seen from a new viewpoint. In contrast to existing techniques, which explicitly reconstruct the 3D geometry of the scene, we transform the problem to the reconstruction of colour rather than depth. This retains the benefits of geometric constraints, but projects out the ambiguities in depth estimation which occur in textureless regions.On the other hand, regularization is still needed in order to generate high-quality images. The paper's second contribution is to constrain the generated views to lie in the space of images whose texture statistics are those of the input images. This amounts to an image-based prior on the reconstruction which regularizes the solution, yielding realistic synthetic views. Examples are given of new view generation for cameras interpolated between the acquisition viewpoints--which enables synthetic steadicam stabilization of a sequence with a high level of realism.
Web composition with WCAG in mind
Authors: Vicente Luque Centeno, Carlos Delgado Kloos, Martin Gaedke, Martin Nussbaumer
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

Accessibility should be a part of the Web design process instead of being a post-design repair process. Thus, it should be more integrated within the internal authoring tools' mechanism of generating new accessible Web contents. Web pages are usually composed of small pieces of HTML code which, dynamically nested and combined, generate full Web pages. This Web composition, specially when creating Web pages from data extracted from heterogeneous or external sources, should have accessibility into account in order to guarantee that the final page being constructed is accessible. This paper presents the set of rules that, in a Web composition process, a design tool must follow in order to create accessible Web pages. These rules are formalized with W3C standards like XPath and XQuery expressions. We also present WSLS as an accessibility enabled authoring tool that makes this task feasible, and focus in how this tool incorporates accessibility into the process of generating new Web contents.
Interpolation of functions from generalized Paley-Wiener spaces
Authors: Yu. Lyubarskii, W. R. Madych
Venue: Journal of Approximation Theory (2005)

We consider the problem of reconstruction of functions f from generalized Paley-Wiener spaces in terms of their values on complete interpolating sequence {Zn}. We characterize the set of data sequences {f(zn)} and exhibit an explicit solution to the problem. Our development involves the solution of a particular ∂- problem.
Eclipse Java security scanner - JSS
Authors: Russell Spitler
Venue: Journal of Computing Sciences in Colleges (2005)

JSS is a plug-in that scans Java code for security vulnerabilities. The vulnerabilities are statically detectable and come from research in Java security. This research looks at both the structure of the code that leads to the vulnerability and how that structure can be taken advantage of to compromise sensitive information or critical code. Such security problems include improper visibility restraints, use of inner classes, failure to handle exceptions properly, execution of code in the JNI, and failure to finalize methods and classes. Gary McGraw and John Viega's paper "Statically Scanning Java Code: finding security vulnerabilities" is the inspiration for JSS. Using the built in org.eclipse.jdt.core package the plug-in parses the Java code and then generates an AST. Then using the Visitor pattern the tree is traversed and the problem sections of the code are identified. These sections are then highlighted and possible solutions are suggested. The scanner will be implemented as a fully functional, updatable plug-in for the Eclipse JDE.
Medical Training Simulation for Palpation of Subsurface Tumor Using HIRO
Authors: M. Osama Alhalabi, Vytautas Daniulaitis, Haruhisa Kawasaki, Takumi Hori
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Multi-fingers haptic device that enables multiple point of contact is essential for medical education. There is a strong need for palpation training in the detection of subsurface tumors. A virtual reality system utilizing the new developed haptic interface HIRO was created to address this need. The simulation considers multiple fingers contact and the interaction between the forces exerted by each finger. A physical-based model using FEM with elementary displacement technique was used to simulate the real breast with the existence of subsurface tumors to calculate the real reaction forces. The trainees were asked to locate the tumor position, and performance is evaluated in terms of positional and search time.
Block SOR Preconditioned Projection Methods for Kronecker Structured Markovian Representations
Authors: Peter Buchholz, Tugrul Dayar
Venue: SIAM Journal on Scientific Computing (2005)

Kronecker structured representations are used to cope with the state space explosion problem in Markovian modeling and analysis. Currently, an open research problem is that of devising strong preconditioners to be used with projection methods for the computation of the stationary vector of Markov chains (MCs) underlying such representations. This paper proposes a block successive overrelaxation (BSOR) preconditioner for hierarchical Markovian models (HMMs; throughout the paper, the HMM acronym stands for hierarchical Markovian models and should not be confused with the HMM that is sometimes used for hidden Markov models.) that are composed of multiple low-level models and a high-level model that defines the interaction among low-level models. The Kronecker structure of an HMM yields nested block partitionings in its underlying continuous-time MC which may be used in the BSOR preconditioner. The computation of the BSOR preconditioned residual in each iteration of a preconditioned projection method becomes the problem of solving multiple nonsingular linear systems whose coefficient matrices are the diagonal blocks of the chosen partitioning. The proposed BSOR preconditioner solves these systems using sparse LU or real Schur factors of diagonal blocks. The fill-in of sparse LU factorized diagonal blocks is reduced using the column approximate minimum degree (COLAMD) ordering. A set of numerical experiments is presented to show the merits of the proposed BSOR preconditioner.
A systematic approach to static access control
Authors: François Pottier, Christian Skalka, Scott Smith
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2005)

The Java Security Architecture includes a dynamic mechanism for enforcing access control checks, the so-called stack inspection process. While the architecture has several appealing features, access control checks are all implemented via dynamic method calls. This is a highly nondeclarative form of specification that is hard to read, and that leads to additional run-time overhead. This article develops type systems that can statically guarantee the success of these checks. Our systems allow security properties of programs to be clearly expressed within the types themselves, which thus serve as static declarations of the security policy. We develop these systems using a systematic methodology: we show that the security-passing style translation, proposed by Wallach et al. [2000] as a dynamic implementation technique, also gives rise to static security-aware type systems, by composition with conventional type systems. To define the latter, we use the general HM(X) framework, and easily construct several constraint- and unification-based type systems.
Power-Driven Routing-Constrained Scan Chain Design
Authors: Y. Bonhomme, P. Girard, L. Guiller, C. Landrault, S. Pravossoudovitch
Venue: Journal of Electronic Testing: Theory and Applications (2004)

Scan-based architectures, though widely used in modern designs, are expensive in power consumption. In this paper, we present a new technique that allows to design power-optimized scan chains under a given routing constraint. The proposed technique is a three-phase process based on clustering and reordering of scan cells in the design. It allows to reduce average power consumption during scan testing. Owing to this technique, short scan connections in scan chains are guaranteed and congestion problems in the design are avoided.
Top-Down Specialization for Information and Privacy Preservation
Authors: Benjamin C. M. Fung, Ke Wang, Philip S. Yu
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Releasing person-specific data in its most specific state poses a threat to individual privacy. This paper presents a practical and efficient algorithm for determining a generalized version of data that masks sensitive information and remains useful for modelling classification. The generalization of data is implemented by specializing or detailing the level of information in a top-down manner until a minimum privacy requirement is violated. This top-down specialization is natural and efficient for handling both categorical and continuous attributes. Our approach exploits the fact that data usually contains redundant structures forclassification. While generalization may eliminate some structures, other structures emerge to help. Our results show that quality of classification can be preserved even for highly restrictive privacy requirements. This work has great applicability to both public and private sectors that share information for mutual benefits and productivity.
Towards a semantic lexicon for biological language processing: Conference Papers
Authors: Karin Verspoor
Venue: Comparative and Functional Genomics (2005)

This paper explores the use of the resources in the National Library of Medicine's Unified Medical Language System (UMLS) for the construction of a lexicon useful for processing texts in the field of molecular biology. A lexicon is constructed from overlapping terms in the UMLS SPECIALIST lexicon and the UMLS Metathesaurus to obtain both morphosyntactic and semantic information for terms, and the coverage of a domain corpus is assessed. Over 77&percnt; of tokens in the domain corpus are found in the constructed lexicon, validating the lexicon's coverage of the most frequent terms in the domain and indicating that the constructed lexicon is potentially an important resource for biological text processing. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Computing correlated equilibria in multi-player games
Authors: Christos H. Papadimitriou
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We develop a polynomial-time algorithm for finding correlated equilibria (a well-studied notion of rationality due to Aumann that generalizes the Nash equilibrium) in a broad class of succinctly representable multiplayer games, encompassing essentially all known kinds, including all graphical games, polymatrix games, congestion games, scheduling games, local effect games, as well as several generalizations. Our algorithm is based on a variant of the existence proof due to Hart and Schmeidler [11], and employs linear programming duality, the ellipsoid algorithm, Markov chain steady state computations, as well as application-specific methods for computing multivariate expectations.
Tensor decomposition and approximation schemes for constraint satisfaction problems
Authors: W. Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh Vempala
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

The only general class of MAX-rCSP problems for which Polynomial Time Approximation Schemes (PTAS) are known are the dense problems. In this paper, we give PTAS's for a much larger class of weighted MAX-rCSP problems which includes as special cases the dense problems and, for r = 2, all metric instances (where the weights satisfy the triangle inequality) and quasimetric instances; for r > 2, our class includes a generalization of metrics. Our algorithms are based on low-rank approximations with two novel features: (1) a method of approximating a tensor by the sum of a small number of "rank-1" tensors, akin to the traditional Singular Value Decomposition (this might be of independent interest) and (2) a simple way of scaling the weights. Besides MAX-rCSP problems, we also give PTAS's for problems with a constant number of global constraints such as maximum weighted graph bisection and some generalizations.