ppxscal/embedding_network huggingface dataset:
Benefit of multiclassifier systems for Arabic handwritten words recognition
Authors: FARAH Nadir, ENNAJI Abdelatif, KHADIR Tarek, SELLAMI Mokhtar
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In order to improve the results of single classijiers, the study of multiple classifier systems has become an area of intensive research in pattern recognition. In this paper, two types of features are fed to a number of Artificial Neural Networks (ANN). Then, their respective responses are combined for the recognition of handwritten Arabic literal words. Different parallel combination schemes are presented, including the use of an ANN as a meta classrfier. Their results are then com~ared and conclusions on the most suitable approach are drawn.
A Join-Less Approach for Co-Location Pattern Mining: A Summary of Results
Authors: Jin Soung Yoo, Shashi Shekhar, Mete Celik
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Spatial co-location patterns represent the subsets of features whose instances are frequently located together in geographic space. Co-location pattern discovery presents challenges since the instances of spatial features are embedded in a continuous space and share a variety of spatial relationships. A large fraction of the computation time is devoted to identifying the instances of co-location patterns. We propose a novel join-less approach for co-location pattern mining, which materializes spatial neighbor relationships with no loss of co-location instances and reduces the computational cost of identifying the instances. The join-less co-location mining algorithm is efficient since it uses an instance-lookup scheme instead of an expensive spatial or instance join operation for identifying co-location instances. The experimental evaluations show the join-less algorithm performs more efficiently than a current join-based algorithm and is scalable in dense spatial datasets.
Random precision: some applications of fractals and cellular automata in music composition
Authors: Thomas H. Wells
Venue:  (2005)

Automated composition is a form of algorithmic composition which always involves mechanical, or digital elements of decision-making, to make music with minimal human intervention. This is often done on a computer, with the aid of random number generation, rule-based systems, and various other algorithms. The idea of composing music by stochastic means, and using computers as an aid in music composition is still alive; there are many musicians and programmers such as Yo Kubota, Phil Thompson, David H. Singer, Phil Jackson and others, trying to develop software for automated composition, which is&mdash;most of the time&mdash;available as a free download from their respective websites. Some of the most popular programs, such as Gingerbread, FractMus, Texture and Fmusic use fractals, chaotic equations, and cellular automata simulations to create music. This thesis shows how algorithmic music is generated, and&mdash;at the same time&mdash;focuses on Fmusic, program that uses both fractals and cellular automata to generate music, and is flexible enough to allow composer to have control over many important musical parameters, such as rhythm, loudness, pitch distribution, panning, patch (timbre), patterns and transitions.
Segmentation of Color Textured Images Using Dual Tree Complex Wavelet Features and Fuzzy Clustering
Authors: S. Vasuki, L. Ganesan
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

In this paper, we have proposed a novel approach for segmentation of color textured images using Dual Tree Complex Wavelet Transform (DTCWT). The choice of DTCWT is proven for its attractive properties such as shift invariance, good directional selectivity, limited redundancy and efficient computation. The image is first decomposed into 16 sub bands by applying one level DTCWT in a separable manner without down sampling. Texture features are extracted from these sub bands by estimating in each sub band, the local energy around each pixel over a small neighborhood. To offer dimensionality reduction in feature space, a decisive criterion called Mutual Information is used to remove irrelevant or redundant features. Having obtained the feature images, we emphasize on the feature representation by labeling each pixel independently using Fuzzy Clustering. The segmentation results have demonstrated the effectiveness of the proposed method.
Application Modeling and Representation for Automatic Grid-Enabling of Legacy Applications
Authors: Liping Zhu, Andrea Matsunaga, Vivekananthan Sanjeepan, Herman Lam, Jose A. B. Fortes
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

To best exploit the potential of the Grid, it is necessary to "Grid-enable" legacy applications that were not originally developed to run on a Grid. In this paper, a generic framework to Grid-enable legacy applications is presented. In particular, this paper focuses on a general approach to model and represent an application in a way that is supportive of the key properties of the Grid-enabling framework: generality, automatic generation and integration of Grid applications, plug-and-play deployment, and interoperability. Based on the model, a configuration language is developed to describe a wide range of command-line applications and their execution requirements. It is easy to use and does not require the application enabler to know the details of the Grid middleware. A case study is presented to illustrate the automated Grid-enabling of a legacy application in In-VIGO(In-Virtual Information Grid Organizations), a Grid computing infrastructure that makes extensive use of virtualization technology.
Efficient Node Admission for Short-lived Mobile Ad Hoc Networks
Authors: Nitesh Saxena, Gene Tsudik, Jeong Hyun Yi
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

Admission control is an essential and fundamental security service in mobile ad hoc networks (MANETs). It is needed to securely cope with dynamic membership and topology and to bootstrap other important security primitives (such as key management) and services (such as secure routing) without the assistance of any centralized trusted authority. An ideal admission protocol must involve minimal interaction among the MANET nodes, since connectivity can be unstable. Also, since MANETs are often composed of weak or resource-limited devices, admission control must be efficient in terms of computation and communication.Most previously proposed admission control protocols are prohibitively expensive and require a lot of interaction among MANET nodes in order to securely reach limited consensus regarding admission and cope with potentially powerful adversaries. While the expense may be justified for long-lived group settings, short-lived MANETs can benefit from much less expensive techniques without sacrificing any security. In this paper, we consider short-lived MANETs and present a secure, efficient and a fully noninteractive admission control protocol for such networks. More specifically, our work is focused on novel applications of non-interactive secret sharing techniques based on bi-variate polynomials, but, unlike other results, the associated costs are very low.
A framework for learning coordinated behavior
Authors: Albert Esterline, Chafic BouSaba, Abdollah Homaifar, Dan Rodgers
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

We sketch a framework for learning structured coordinated behavior, specifically the tactical behavior of Experimental Unmanned Vehicles (XUVs). We conceptualize an XUV unit as a multiagent system (MAS) on which we impose a command structure to yield a holarchy, a hierarchy of holons, where a holon is both a whole and a part. The formalism used is a conservative extension of Statecharts, called a Parts/whole Statechart, which introduces a coordinating whole as a concurrent component on a par with the coordinated parts; wholes are related to common knowledge. We use X-classifier systems (XCSs). Exploiting Statechart semantics, we translate Statechart transitions into classifiers and define data structures that interact with an XCS.
Largest family without A ∪ B ⊆ C ∩ D
Authors: Annalisa De Bonis, Gyula O. H. Katona, Konrad J. Swanepoel
Venue: Journal of Combinatorial Theory Series A (2005)

Let F be a family of subsets of an n-element set not containing four distinct members such that A ∪ B ⊆ C ∩ D. It is proved that the maximum size of F under this condition is equal to the sum of the two largest binomial coefficients of order n. The maximum families are also characterized. A LYM-type inequality for such families is given, too.
Securing publish-subscribe overlay services with EventGuard
Authors: Mudhakar Srivatsa, Ling Liu
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

A publish-subscribe overlay service is a wide-area communication infrastructure that enables information dissemination across geographically scattered and potentially unlimited number of publishers and subscribers. A wide-area publish-subscribe (pub-sub) system is often implemented as a collection of spatially disparate nodes communicating on top of a peer to peer overlay network. Such a model presents many inherent benefits such as scalability and performance, as well as potential challenges such as: (i) confidentiality & integrity, (ii) authentication, and (iii) denial-of-service (DoS) attacks. In this paper we present EventGuard for securing pub-sub overlay services. EventGuard comprises of a suite of security guards that can be seamlessly plugged-into a content-based pub-sub system. EventGuard mechanisms aim at providing security guarantees while maintaining the system's overall simplicity, scalability and performance metrics. We present an implementation which shows that EventGuard is easily stackable on any content-based pub-sub core. Finally, our experimental results show that EventGuard can secure a pub-sub system with minimal performance penalty.
On the Error Modeling of Dead Reckoned Data in a Distributed Virtual Environment
Authors: Dai Hanawa, Tatsuhiro Yonekura
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

In this paper, the authors aim to analyze the error of dead reckoned data generated from received data in a discrete temporal axis in a distributed virtual environment (DVE). That is, compared with the data received in continuous time, data acquired in discrete time has a certain degradation or uncertainty of information. Our way of analysis is to introduce a mathematical model of this degradation with regard to the metrics of the temporal interval. We introduced polynomial models for dead reckoning method between frames using parametrics calculated from the data over the last several frames. By employing the method of error analysis of a numerical analysis to the above polynomial models, we formulate theoretical models which approximate the statistical error of dead reckoned data based on parameters such as the update interval and changes in the data. This study enables the discussion on the optimality of the update interval in a DVE using dead reckoning. Finally, we evaluate the adaptability of the theoretical model by conducting simulation experiments generated by pen motion of writing string of letters by human. As a result, we confirm that the proposed theoretical model closely approximates the average error in the simulation.
Building Community Information Systems: The Connected Kids Case
Authors: Teresa M. Harrison, James P. Zappen, Sibel Adali
Venue: Computer (2005)

Conceived as both a digital government project and a community information system, the Connected Kids project helped bridge one city's digital divide by helping youth organizations access new information technologies.
Application of Autoregressive Decomposition and Pole Tracking to Pathological Voice Signals
Authors: Paulo R. Scalassara, Maria E. Dajer, Carlos D. Maciel
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper, it is presented an insight of the effects of the application of autoregressive (AR) decomposition and pole tracking to voice signals. The AR model is used to decompose the signals in a set of poles which has a correspondence to the peaks of the signals power spectral density function (PSD). The aim of this work is to show the differences in the behavior of these poles for voice signals collected from two groups of people, one with healthy glottal tract and another with nodule pathology in vocal folds.
Ontology Guided Access to Document Images
Authors: Gaurav Harit, Santanu Chaudhury, Jagrati Paranjpe
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we propose a scheme for accessing document images using ontology. We make use of an extension of OWL (Ontology Language for Web) to allow encoding of ontologies for document images. We experimentally demonstrate that reasoning with the concepts defined in ontology and their observation models provide a mechanism to support conceptual querying and automated hyperlinking of document images.
Reducing Inter-Configuration Memory Usage and Performance Improvement in Reconfigurable Computing Systems
Authors: Farhad Mehdipour, Morteza Saheb Zamani, Mehdi Sedighi
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

For running subsequent configurations in a reconfigurable computing system intermediate data must transfer between them. Reducing memory usage overhead can result in reduction in the array size and the number of input/output pins. In this paper, a new iterative design flow is proposed which integrates the synthesis and physical design aspects for performing a static compilation process. A new temporal partitioning algorithm for partitioning and scheduling is proposed, which tries to increase similarity of subsequent configurations in such a way that the reconfiguration time on a partially reconfigurable hardware decreases. In addition, we perform an iterative physical design process based on similar configurations produced in the previous stage. A modified algorithm improves our prior temporal partitioning algorithm, which usually had large overhead of memory usage and the number of input/output pins. This new approach performs partitioning in depth and tries to minimize the memory and IO requirements.
Observability in Hybrid Multi Agent Recurrent Nets for Natural Language Processing
Authors: David Al-Dabass, David Evans, Manling Ren
Venue: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems (2005)

Reading a sequence of lexical items in a sentence is equivalent to providing progressively more data at the input to a Kalman observer. The observer architecture includes a model of the lexical/syntactical sequence generator, with state and output variables, driven by the error between the observed sequence and its evolving 'mirror' within the observer. The theoretical foundations for this observer are put forward and the conditions for observability and controllability of hybrid recurrent nets are explained. Knowledge mining architectures are proposed which consist of an extensible recurrent hybrid net hierarchy of multi-agents where the composite behaviour of agents at any one level is determined by those of the level immediately below.
The Topological Properties and Network Embedding of RP(k)
Authors: Fangai Liu, Liancheng Xu
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

An interconnection network, RP(k), and its properties are investigated. Two parameters, the closest group and the optimal partition of networks are proposed. It is shown that RP(k) network has high communication efficiency . It is also proven that RP(k) network is a Hamiltonian graph and the ring can be embedded into the RP(k) network with load, expansion, dilation and congestion all equal to 1 even though some faulty nodes exist in the RP(k) network. Embedding of Rings and 2-D meshes into the RP(k) networks are discussed. Two embedding methods are given with high embedding performance.
A Note on Space-Filling Visualizations and Space-Filling Curves
Authors: Martin Wattenberg
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

A recent line of treemap research has focused on layout algorithms that optimize properties such as stability, preservation of ordering information, and aspect ratio of rectangles. No ideal treemap layout algorithm has been found, and so it is natural to explore layouts that produce non-rectangular regions. This note describes a connection between space-filling visualizations and the mathematics of space-filling curves, and uses that connection to characterize a family of layout algorithms which produce nonrectangular regions but enjoy geometric continuity under changes to the data and legibility even for highly unbalanced trees.
Service Address Routing: A Network Architecture for Tightly Coupled Distributed Computing Systems
Authors: Isaac D. Scherson, Daniel S. Valencia
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

A novel Interconnection Network Architecture is proposed for integrating tightly coupled Distributed Systems. It allows the implementation of Service Address Routing( SAR): network communications between components are based on the "name" of requested services. It is a client server communications model, and includes the traditional physical addressing schemes. This enhanced network architecture registers the capabilities of the components attached to its ports and directs service requests to appropriate server nodes. The Network can perform Resource Allocation by placing services in nodes that can support them. Load Distribution can be achieved by binding requests to adequate servers with enough free resources. Furthermore, SAR effects a simple, yet efficient and transparent resource discovery mechanism by means of a distributed content addressable search at each network port. When migration of services is allowed SAR permits the network to realize more resource management functions, such as load balancing, normally ascribed to higher level SSI Distributed Operating Systems.
Risk Management for Critical Infrastructure Protection (CIP) Challenges, Best Practices & Tools
Authors: Eyal Adar, Andreas Wuchner
Venue: Proceedings of the First IEEE International Workshop on Critical Infrastructure Protection (2005)

Risk Management (RM) has become increasingly important in dealing with Information and IT security over the past several years. This article aims at discussing the major challenges facing Critical Infrastructure Protection (CIP) RM, and outlines several methods and best practice guidelines that can be used to cope with it, including:Creating a RM framework and RM measurement criteria Usage of advanced Risk Analysis (RA) methods, and adoption of CIP models that can be used for RA Development and implementation of RM tools Use of RM tools can play a major role in this process, as it can raise the efficiency of RM activities, and decrease reliance on any individual RA specialist's knowledge. The contribution of such tools is even greater, when dealing with Critical Infrastructures; as it is very difficult for a single specialist to cope with the diversity and complexity of CIP Risk Assessment.
Script Identification Using Steerable Gabor Filters
Authors: W. M. Pan, C. Y. Suen, T. D. Bui
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Multi-channel Gabor filtering has been widely used in texture classification. In this paper, Gabor filters have been applied to the problem of script identification in printed documents. Our work is divided into two stages. Firstly, a Gabor filter bank is appropriately designed so that extracted rotation-invariant features can handle scripts that are similar in shape and even share many characters. Secondly, the steerability property of Gabor filters is exploited to reduce the high computation cost resulted from the frequent image filtering, which is a common problem encountered in Gabor filter related applications. Results from preliminary experiments are quite promising, where Chinese, Japanese, Korean and English are considered. Over 98.5% language identification rate can be achieved while image filtering operations have been reduced by 40%.
The king has...
Authors: Krister Olsson, Takashi Kawashima
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The installation The King Has... grew out of a desire to explore the ways in which people react to knowing the secrets of others, and if anonymity were guaranteed, the kinds of secrets people would choose to make public.Secrets were gathered from individuals via SMS messaging, printed on wood panels, and mounted at two installation sites, creating ever-growing fields of text.
First-person experience and usability of co-located interaction in a projection-based virtual environment
Authors: Andreas Simon
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

Large screen projection-based display systems are very often not used by a single user alone, but shared by a small group of people. We have developed an interaction paradigm allowing multiple users to share a virtual environment in a conventional single-view stereoscopic projection-based display system, with each of the users handling the same interface and having a full first-person experience of the environment.Multi-viewpoint images allow the use of spatial interaction techniques for multiple users in a conventional projection-based display. We evaluate the effectiveness of multi-viewpoint images for ray selection and direct object manipulation in a qualitative usability study and show that interaction with multi-viewpoint images is comparable to fully head-tracked (single-user) interaction. Based on ray casting and direct object manipulation, using tracked PDA's as common interaction device, we develop a technique for co-located multi-user interaction in conventional projection-based virtual environments. Evaluation of the VRGEO Demonstrator, an application for the review of complex 3D geo-seismic data sets in the oil-and-gas industry, shows that this paradigm allows multiple users to each have a full first-person experience of a complex, interactive virtual environment.
Managing privacy preferences for federated identity management
Authors: Gail-Joon Ahn, John Lam
Venue: Proceedings of the 2005 workshop on Digital identity management (2005)

We have witnessed that the Internet is now a prime vehicle for business, community, and personal interactions. The notion of identity is the important component of this vehicle. Identity management has been recently considered to be a viable solution for simplifying user management across enterprise applications. The network identity of each user is the global set of personal credentials and preferences constituting the various accounts. The prevalence of business alliances or coalitions necessitates the further evolution of identity management, named federated identity management (FIM). The main motivation of FIM is to facilitate the federation of identities among business partners emphasizing on ease of user management. In this paper, we investigate privacy issues in FIM, especially focusing on Liberty Alliance approach. We attempt to identify practical business scenarios that help us understand privacy issues in FIM. Also, we propose systematic mechanisms to specify privacy preferences in FIM.