ppxscal/embedding_network huggingface dataset:
Some Observations on the Theory of Cryptographic Hash Functions
Authors: D. R. Stinson
Venue: Designs, Codes and Cryptography (2006)

In this paper, we study issues related to the notion of "secure" hash functions. Several necessary conditions are considered, as well as a popular sufficient condition (the so-called random oracle model). We study the security of various problems that are motivated by the notion of a secure hash function. These problems are analyzed in the random oracle model, and we prove that the obvious trivial algorithms are optimal. As well, we look closely at reductions between various problems. In particular, we consider the important question "does collision resistance imply preimage resistance?". We provide partial answers to this question --- both positive and negative! --- based on uniformity properties of the hash function under consideration.
Treating Free Variables in Generalized Geometric Global Optimization Programs
Authors: Han-Lin Li, Jung-Fa Tsai
Venue: Journal of Global Optimization (2005)

Generalized geometric programming (GGP) problems occur frequently in engineering design and management. Recently, some exponential-based decomposition methods [Maranas and Floudas, 1997,Computers and Chemical Engineering 21(4), 351---370; Floudas et al., 1999 , Handbook of Test Problems in Local and Global Optimization, Kluwer Academic Publishers, Boston, pp. 5---105; Floudas, 2000 Deterministic Global Optimizaion: Theory, Methods and Application, Kluwer Academic Publishers, Boston, pp. 257---306] have been developed for GGP problems. These methods can only handle problems with positive variables, and are incapable of solving more general GGP problems. This study proposes a technique for treating free (i.e., positive, zero or negative) variables in GGP problems. Computationally effective convexification rules are also provided for signomial terms with three variables.
Unraveling Crosscutting Concerns in Web Services Middleware
Authors: Bart Verheecke, Wim Vanderperren, Viviane Jonckers
Venue: IEEE Software (2006)

The emergence of Web service technology raises the need for techniques to realize just-in-time integration and composition of services in client applications. Current approaches to integrate Web services are inflexible, affecting the short-term adaptability and long-term evolution of the service, the network, and the business environment. To enable the development of more flexible and robust applications, the Web Services Management Layer defines middleware for the dynamic integration, selection, composition and client-side management of Web services in service-oriented architectures (SOA). WSML uses dynamic aspect-oriented programming to solve several crosscutting concerns in SOAs. A realistic industrial case study shows WSML used in the context of broadband service provisioning.This article is part of a theme section on aspect-oriented programming.
On the readability of graphs using node-link and matrix-based representations: a controlled experiment and statistical analysis
Authors: Mohammad Ghoniem, Jean-Daniel Fekete, Philippe Castagliola
Venue: Information Visualization (2005)

In this article, we describe a taxonomy of generic graph related tasks along with a computer-based evaluation designed to assess the readability of two representations of graphs: matrix-based representations and node-link diagrams. This evaluation encompasses seven generic tasks and leads to insightful recommendations for the representation of graphs according to their size and density. Typically, we show that when graphs are bigger than twenty vertices, the matrix-based visualization outperforms node-link diagrams on most tasks. Only path finding is consistently in favor of node-link diagrams throughout the evaluation.
Curve and polygon evolution techniques for image processing
Authors: Gozde Bozkurt
Venue:  (2002)

The objective of this thesis is to develop image processing algorithms which are efficient, statistically robust and sufficiently general, in order to account for noise and textural variations in images, and which have the ability to extract and provide compact and useful descriptions of target objects in images, for object recognition and tracking purposes. The main contribution is the development of image processing algorithms, which are based on the theory of curve evolution with connections to information theory and probability theory. These connections form the basis for extracting a compact object description, in the form of a polygonal contour. One contribution is the development of a new class of curve evolutions designed to preserve prescribed polygonal structures in an image while removing noise. A local stochastic formulation of a geometric heat equation led to our proposal of its vanishing at pre-defined directions. Under these flows, the limiting shape of a curve is a polygon, pre-specified by the form and the parameters of the specific flow. The second contribution of the thesis is the development of a new active contour model which merges the desirable polygonal representation of an object directly to the image segmentation process by adapting an information-theoretic measure into an active contour framework with an unsupervised texture segmentation goal. The polygon-propagating models we develop can capture texture boundaries more reliably than the continuous active contour models because the evolution of an active polygon vertex depends on an overall speed function integrated along its two adjacent polygon edges rather than on pointwise measurements along continuous contour points. Thus, higher-order statistics which provide more adapted information than the first and second-order, are captured. Another contribution in this sequel is a new global polygon regularizer algorithm which uses electrostatics principles. The final contribution of the thesis is the development of a simple and efficient object tracking algorithm well-adapted to polygonal objects. This is an extension of the second contribution of the thesis, and the key idea here is centered around tracking a relatively few vertices together with their corresponding edges, which in turn yields a bookkeeping simplicity and hence efficiency.
Investigation on Transmit Power Estimation and Gateway Selection on Ad hoc Networks
Authors: Tarek R. Sheltami
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Wireless mobile ad hoc networks depend on batteries or other fatiguing means for their energy. Power aware design and estimation of transmit power requires familiarity with the energy consumption behavior in wireless systems. Moreover, selection of gateways has not been introduced thoroughly. This paper introduces a mathematical analysis for power adjustment and then we use these equations in selecting gateways in the simulation experiments according to two different criteria: the gateway with the highest energy level and the gateway with the least number of neighbors.
Ontology-Based User Modeling in an Augmented Audio Reality System for Museums
Authors: Marek Hatala, Ron Wakkary
Venue: User Modeling and User-Adapted Interaction (2005)

Ubiquitous computing is a challenging area that allows us to further our understanding and techniques of context-aware and adaptive systems. Among the challenges is the general problem of capturing the larger context in interaction from the perspective of user modeling and human---computer interaction (HCI). The imperative to address this issue is great considering the emergence of ubiquitous and mobile computing environments. This paper provides an account of our addressing the specific problem of supporting functionality as well as the experience design issues related to museum visits through user modeling in combination with an audio augmented reality and tangible user interface system. This paper details our deployment and evaluation of ec(h)o --- an augmented audio reality system for museums. We explore the possibility of supporting a context-aware adaptive system by linking environment, interaction objects and users at an abstract semantic level instead of at the content level. From the user modeling perspective ec(h)o is a knowledge-based recommender system. In this paper we present our findings from user testing and how our approach works well with an audio and tangible user interface within a ubiquitous computing system. We conclude by showing where further research is needed.
A Content-Based Broadcasted Sports Video Retrieval System Using Multiple Modalities: SportBR
Authors: Liu Huayong, Zhang Hui
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper, an advanced content-based broadcasted sports video retrieval system, SportBR, is proposed. Its main features include event-based sports video browsing and keyword-based sports video retrieval. The paper first defines the framework of our system, and then introduces a novel approach that integrates multimodal analysis, such as visual streams analysis, speech recognition, speech signal processing and text extraction to realize event-based video clips selection. The experimental results for sports video of world cup football games indicate that multimodal analysis is effective. The system is proved to be helpful and effective for understanding the sports video content.
An Adaptive Visual Analytics Platform for Mobile Devices
Authors: Antonio Sanfilippo, Richard May, Gary Danielson, Bob Baddeley, Rick Riensche, Skip Kirby, Sharon Collins, Susan Thornton, Kenneth Washington, Matt Schrager, Jamie Van Randwyk, Bob Borchers, Doug Gatchell
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

We present the design and implementation of InfoStar, an adaptive visual analytics platform for mobile devices such as PDAs, laptops, Tablet PCs and mobile phones. InfoStar extends the reach of visual analytics technology beyond the traditional desktop paradigm to provide ubiquitous access to interactive visualizations of information spaces. These visualizations are critical in addressing the knowledge needs of human agents operating in the field, in areas as diverse as business, homeland security, law enforcement, protective services, emergency medical services and scientific discovery. We describe an initial real world deployment of this technology, in which the InfoStar platform has been used to offer mobile access to scheduling and venue information to conference attendees at Supercomputing 2004.
Modern Control Approach for Robotic Wheelchair with Inverse Pendulum Control
Authors: Yoshihiko Takahashi, Otsushiro Tsubouchi
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

We are proposing a robotic wheelchair that enables a wheelchair bound person to climb over steps up to about 8cm in height without assistance from others. By using the proposed robotic wheelchair, a user can maintain inverse pendulum control after raising its front wheels. Then, a user can move forward to the step maintaining the inverse pendulum control, and can climb over the step using motor force of a rear wheel shaft. This paper described the control system designs and simulations of the inverse pendulum control. An observer based optimal control (LQG or H2) with an integral action is discussed in order to obtain better control performances for the inverse pendulum control.
A Heterogeneous Field Matching Method for Record Linkage
Authors: Steven N. Minton, Claude Nanjo, Craig A. Knoblock, Martin Michalowski, Matthew Michelson
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Record linkage is the process of determining that two records refer to the same entity. A key subprocess is evaluating how well the individual fields, or attributes, of the records match each other. One approach to matching fields is to use hand-written domain-specific rules. This "expert systems" approach may result in good performance for specific applications, but it is not scalable. This paper describes a new machine learning approach that creates expert-like rules for field matching. In our approach, the relationship between two field values is described by a set of heterogeneous transformations. Previous machine learning methods used simple models to evaluate the distance between two fields. However, our approach enables more sophisticated relationships to be modeled, which better capture the complex domain specific, common-sense phenomena that humans use to judge similarity. We compare our approach to methods that rely on simpler homogeneous models in several domains. By modeling more complex relationships we produce more accurate results.
Robust Watermarking with Kernels-Alternated Error Diffusion and Weighted Lookup Table in Halftone Images
Authors: Jing-Ming Guo
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

A halftone watermarking method of high quality, robustness, and capacity flexibility is presented in this paper. An objective halftone image quality evaluation method based on the human visual system obtained by Least-Mean-Square is also introduced. In the encoder, the Kernels-Alternated Error Diffusion (KAEDF) is applied. This is able to maintain the computational complexity at the same level as ordinary error diffusion. Compared with Hel- Or [1] using ordered dithering, the proposed KAEDF yields a better image quality through using error diffusion. We also propose a Weighted Lookup Table (WLUT) in the decoder instead of LUT, as proposed by Pei and Guo [2], so as to achieve a higher decoded rate. As the experimental results demonstrated, this technique is able to guard against degradation due to tampering, cropping, rotation, as well as print-and-scan processes in error-diffused halftone images.
Quantile estimation in regenerative simulation: a case study
Authors: G. W. J. Coppus, M. P. F. M. van Dongen, J. P. C. Kleinjen
Venue: ACM SIGSIM Simulation Digest (1977)

We model key-punching in a computer center as a queuing simulation with 2 servers (typists) and 3 priority classes (small, medium, large jobs). The 90% quantile of queuing time is estimated for different borderlines between the 3 job classes. Confidence intervals for the quantiles are based on the regenerative properties of the simulation, as derived by Iglehart (1974). They utilize the asymptotic normality of the estimated quantile, and a rather complicated expression for its variance. Numerical results are given for the quantiles (and averages) of the queuing times in each job class, for several borderlines between the 3 job classes. The effects of simulation runlength on the confidence intervals were also examined. The effects of varying job-class borderlines were tentatively modeled by a regression model.
Normal Forms and Normalized Design Method for Business Service
Authors: Zhongjie Wang, Xiaofei Xu, Dechen Zhan
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Service-oriented computing (SOC) is thought to be an effective way to tackle complex web-based business collaborations between enterprises in e-business environment, but in practice it didn't reach the expectation. Current researches mainly focus on technological aspects, such as service publication, discovery, binding, and composition, etc, while lack in effective ways to support service identification and design before they are to be published and discovered by other enterprises. This paper analyzes the relationships between business service and inter- /intra-enterprise business processes, discusses what kind of properties a "good" service should have, and accordingly presents a Service Normal Form (SNF) and the corresponding service normalization method. In this method, the way of how to identify normalized services from business process models, and how to create close mapping between services and legacy component-based information systems, are emphatically discussed. This method provides great significance to help enterprises identifying and designing valuable business services.
A smooth transition model between kinetic and hydrodynamic equations
Authors: Pierre Degond, Shi Jin, Luc Mieussens
Venue: Journal of Computational Physics (2005)

This paper presents a model which provides a smooth transition between a kinetic and a hydrodynamic domain. The idea is to use a buffer zone, in which both hydrodynamics and kinetic equations will be solved. The solution of the original kinetic equation will be recovered as the sum of the solutions of these two equations. We use an artificial connecting function which makes the equation on each domain degenerate at the end of the buffer zone, thus no boundary condition is needed at the transition point. Consequently, this model avoids the delicate issue of finding the interface condition in a typical domain decomposition method that couples a kinetic equation with hydrodynamic equations. A simple kinetic scheme is developed to discretize our model, and numerical examples are used to validate the method.
A $C^2$ Trivariate Macroelement Based on the Worsey--Farin Split of a Tetrahedron
Authors: Peter Alfeld, Larry L. Schumaker
Venue: SIAM Journal on Numerical Analysis (2005)

A $C^2$ trivariate macroelement is constructed based on the Worsey--Farin split of a tetrahedron into twelve subtetrahedra. The element uses supersplines of degree 9 and provides optimal order approximation of smooth functions.
A Study On the Use of 8-Directional Features For Online Handwritten Chinese Character Recognition
Authors: Zhen-Long BAI, Qiang HUO
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper presents a study of using 8-directional features for online handwritten Chinese character recognition. Given an online handwritten character sample, a series of processing steps, including linear size normalization, adding imaginary strokes, nonlinear shape normalization, equidistance resampling, and smoothing, are performed to derive a 64×64 normalized online character sample. Then, 8-directional features are extracted from each online trajectory point, and 8 directional pattern images are generated accordingly, from which blurred directional features are extracted at 8 × 8 uniformly sampled locations using a filter derived from the Gaussian envelope of a Gabor filter. Finally, a 512-dimensional vector of raw features is formed. Extensive experiments on the task of recognizing 3755 level-1 Chinese characters in GB2312-80 standard are performed to compare and discern the best setting for several algorithmic choices and control parameters. The effectiveness of the studied approach is confirmed.
Fuzzy nature of trust and dynamic trust modeling in service oriented environments
Authors: Elizabeth J. Chang, Farookh Khadeer Hussain, Tharam S. Dillon
Venue: Proceedings of the 2005 workshop on Secure web services (2005)

In this paper, we propose and describe the six characteristics of trust. Based on the six proposed characteristics, we determine why trust is fuzzy. The term 'fuzzy' in this paper not in the sense of the precise definitions given in the Fuzzy Systems literature but to indicate a certain vagueness, complexity or ill-definition and qualitative characterization rather than quantitative representation and dynamic.We then determine why due to the six characteristics of trust, trust is dynamic. We then propose a modeling language tool to model the fuzzy and dynamic nature of trust.
Lattice algebra approach to neural computation
Authors: Laurentiu Iancu
Venue:  (2005)

As a field of study, brain theory deals with abstractions of neural cells and cell systems, in order to understand the development, capabilities, and functions of biological neural networks. In neural computation, the focus is on the technologies that implement systems of artificial neurons designed as variations of the abstractions from brain theory. The goal is thus to enable a machine to address complex problems of recognition and control in an attempt of mimicking the intelligent behavior of biological neural systems. This dissertation presents a new model of artificial neural networks as an approach to neural computation that is based on lattice algebraic abstractions. The elementary operations in these artificial neural networks occur within the dendritic structures of neurons and the computations are defined in the framework of lattice algebra. The new model provides for the construction of various neural architectures based on lattice algebra, referred to as morphological neural networks. The lattice algebraic operations employed in morphological neural networks are based on dilation and erosion, the two fundamental operations from the field of mathematical morphology. In these neural networks, the strength of the electric potential of the signal traveling along an axon is an additive process and the firing mechanism of the postsynaptic neuron accepts signals of maximum (or minimum) strength. The same processes in traditional models involve multiplication (rather than addition) and summation (instead of maximum/minimum), respectively. The emphasis in this work is on morphological perceptrons with dendritic structures, a model supported by recent results and which can be applied in solving problems of pattern classification and association. The proposed model exhibits several advantages when compared to classical models such as multilayer perceptrons, which include (1) High speed in both training (convergence in a single epoch) and runtime execution; (2) Rigorously established learning of arbitrary sets (noncontiguous, nonconvex) within any desired degree of accuracy; (3) Drawing of closed separation surfaces in feature space; A guaranteed 100% correct recognition for the training set; (4) Efficient hardware implementation (using no multiplication operations); (5) A better symbol grounding (the role of the processing elements is fully understood). These characteristics of morphological perceptrons are obtained with no hidden layers, but with dendrites, which mimic more faithfully the biological reference and are currently believed by some researchers to be the main processing elements of the neurons. A morphological perceptron with dendritic structures is, therefore, a good candidate in solving problems of pattern recognition and association, especially when one of the aspects mentioned above (such as speed) is a concern.
Home Networking
Authors: George K. Thiruvathukal
Venue: Computing in Science and Engineering (2006)

My coeditors (Paul Dubois and Konstantin Läufer) and I are among a growing number of individuals who install and maintain a home computer network. When Paul and I first discussed the idea of writing an article about the subject several months ago, my first thought was that you--our cherished readers-might consider this whole notion so trivial as to not be worthy of a column that focuses mostly on scientific programming and software development topics. But based on the realization that we three computer scientists devote a significant part of our time to network and system administration, it almost goes without saying that networking is becoming more commonplace at home than at work.
A Tiger's Speed, an Elephant's Memory: Holographic Storage Ready for Market
Authors: Benjamin Alfonsi
Venue: IEEE Distributed Systems Online (2005)

Emerging holographic technologies have progressed to the point where companies worldwide, such as Japan-based Optware Corporation and InPhase Technologies in the US, are projecting consumer products will be on the market within a year.