waashk/dblp huggingface dataset:
efficient implementation of fingerprint verification for mobile embedded systems using fixed-point arithmetic. fingerprint sensors are getting small enough to be included in mobile devices to enable fingerprint verification be employed as an authentication tool when using the mobile devices for secure transactions. fingerprint verification, however, is a computing intensive technology that requires a lot of floating-point computation. unfortunately, the embedded processors in most mobile devices do not support floating-point hardware. in this paper, we present the implementation of a fingerprint verification process in an embedded system environment based the strongarm processor and the embedded linux operating system. the success of the implementation relies on the use of a fixed-point arithmetic only. the fingerprint verification component, the fixed-point component as well as the technique employed to pair up the two components are described in details. in particular, we estimated the required precisions in the fixed-point representations before conducting experiments. through our results, we further show that not only the fixed-point implementation achieves the goal of significant speed improvement but is almost as reliable as the floating-point counterparts.
an artificial immune system approach to document clustering. it has recently been shown that artificial immune systems (ais) can be successfully used in many machine learning tasks. the ainet, one such ais algorithm exploiting the biologically-inspired features of the immune system, performs well on elementary clustering tasks. this paper proposes the use of the ainet to more complex tasks of document clustering. based on the immune network and affinity maturation principles, the ainet performs an evolutionary process on the raw data, which removes data redundancy and retrieves good clustering results. also, principal component analysis is integrated into this method to reduce the time complexity. the results are compared with some classical document clustering methods - hierachical agglomerative clustering and k-means.
organizing and visualizing software repositories using the growing hierarchical self-organizing map. a software repository, a place where reusable components are stored and searched for, is a key ingredient for instituting and popularizing software reuse. it is vital that a software repository should be well-organized and provide efficient tools for developers to locate reusable components that meet their requirements. the growing hierarchical self-organizing map (ghsom), an unsupervised learning neural network, is a powerful data mining technique for the clustering and visualization of large and complex data sets. the resulting maps, serving as retrieval interfaces, can be beneficial to developers in obtaining better insight into the structure of a software repository and increasing their understanding of the relationships among software components. the ghsom, which is an improvement over the basic self-organizing map (som), can adapt its architecture during its learning process and expose the hierarchical structure that exists in the original data. in this paper, we demonstrate the potential of the ghsom for the organization and visualization of a collection of reusable components stored in a software repository, and compare the results with the ones obtained by using the traditional som.
agent oriented logic programming in jinni 2004. jinni 2004 [1, 2, 3] (available from http://www.binnetcorp.com/jinni) expresses various agent programming constructs in terms of an object oriented logic programming layer implemented on top of a java-based prolog compiler. the architecture provides a high degree of compositionality through the use of a small set of orthogonal programming language constructs.
knowledge-based conversational agents and virtual storytelling. we describe an architecture for building speech-enabled conversational agents, deployed as self-contained web services, with ability to provide inference processing on very large knowledge bases and its application to voice enabled chatbots in a virtual storytelling environment. the architecture integrates inference engines, natural language pattern matching components and story-specific information extraction from rdf/xml files. our web interface is dynamically generated by server side agents supporting multi-modal interface components (speech and animation). prolog refactorings of the wordnet lexical knowledge base, framenet and the open mind common sense knowledge repository are combined with internet meta-search to provide high-quality knowledge sources to our conversational agents. an example of conversational agent with speech capabilities is deployed on the web at http://logic.csci.unt.edu:8080/wordnet_agent/frame.html. the agent is also accessible for live multi-user text-based chat, through a yahoo instant messenger protocol adaptor, from wired or wireless devices, as the jinni_agent yahoo im "handle".
semantic document engineering with wordnet and pagerank. this paper describes natural language processing techniques for document engineering in combination with graph algorithms and statistical methods. google's pagerank and similar fast-converging recursive graph algorithms have provided practical means to statically rank vertices of large graphs like the world wide web. by combining a fast java-based pagerank implementation with a prolog base inferential layer, running on top of an optimized wordnet graph, we describe applications to word sense disambiguation and evaluate their accuracy on standard benchmarks.
an xml-based conversational protocol for web services. soap is used to communicate with web services. it defines the a messaging framework (the envelope), encoding rules and a binding protocol over the http protocol. however soap, as it is, does not deal with conversations. to provide full interoperability, clients need to not only know the correct data formats to pass, but also the conversation level protocol involving those messages for any required web service. this must also include the valid responses, where multiple responses are possible, and the starting and ending states of the conversation.this paper describes an xml-based conversational protocol for web services. each server site publishes details enabling client agents to interact with the server. this involves the publication of protocol specifications representing a finite state machine (fsm). a client agent downloads this specification, validate it for correctness, and then implement the protocol dynamically, as a state machine. this can be viewed as a negotiation of protocols where the client negotiates to implement all requirements of a server.
a digital conference like software tool for pdp programs. digital conference is a software package, which allows people at different locations to exchange information and simultaneously share a running program through a network. it motivates us to create a digital conference like software for parallel and distributed processing programs. the dc-like pdp allows a group to discuss and operate the same pdp model without having all members present at the same computer site. the software has potential to facilitate teaching and research in our institution. this paper presents a complete methodology to develop the dc-like pdp. two solution models using client/server computing are presented. a decision table approach is proposed to facilitate system analysis and design. the table is ultimately encoded as macro rules in source programs. the approach improves program readability, reduces the size of source codes, and enforces consistent maintenance.
cafiss: a complex adaptive framework for immune system simulation. currently most reported immune system simulations in literature involve the use of differential equations, genetic algorithm-based searching or simple cellular automata models. this limits the diversity in results obtained and thus provides fewer avenues for experimenting with behavioral responses of the immune system entities under exogenous stimulations. complex adaptive systems (or cas) by holland provide a way of modeling natural systems with complex aggregation and nonlinear interactions to exhibit emergent behaviours. the immune system, being a powerful and flexible information processing system is particularly suited to being modeled using cas. this paper describes a java-based implementation of a framework for modeling the immune system, particularly human immunodeficiency virus (or hiv) attack, using a cas model. the credibility of the system is established through comparisons against available viral dynamics data. we show that it is feasible to achieve relatively accurate predictions of viral pathogenesis through agent-based discrete event simulations, the first steps towards improved automation of hypothesis verification.
incremental profile learning based on a reinforcement method. this paper presents a profile learning method in an adaptive information filtering. the learning method is an incremental profile learning based on a reinforcement algorithm. the basic idea consists in building, when a document is selected and judged as relevant, the temporary profile which makes it possible to find this document with a strong score, then integrating this profile, using a logarithmic function, in the global profile. the proposed method is compared to two ir learning methods, query expansion method used in okapi and rocchio's algorithm. experiments carried out on trec1-2002 collection showed the effectiveness of the reinforcement method.adaptive filtering, profile learning, reinforcement method
load balancing for the management of service performance in open service markets: a customer-oriented approach. in open service markets customers can choose between several providers offering similar services. to survive in the arising competition, service providers are compelled to satisfy their customers by not only offering services for a reasonable price but additionally deploy them in an efficient way regarding e.g. performance and availability. because in a service provision process application, network, and system aspects are involved, new management concepts are needed. this paper discusses a mechanism for the management of services in distributed environments to reduce the probability of a performance decrease or a connection loss in service provision. to support a customer in choosing a service, a service trader is used as a central component. this trader considers the global state of the distributed system's resources using a load balancer. to fulfil quality characteristics of a mediated service at usage time, management proxies encapsulate services or service groups to observe their performance and availability characteristics. this approach only causes a small involvement of service providers and customers in the selection and management process.
towards a reference model management system for business engineering. the central idea in reference modeling is the reutilization of the business knowledge contained in reference models for the construction of specific models. the orientation on the content of a reference model can increase the efficiency of processes in business engineering projects. despite this, the use of reference models in the field of business engineering has not established itself in practice. this is due to the field of conflict between research and practice, in which reference modeling is at home. there is still a deficit in knowledge about the use and problems inherent in the implementation of reference models despite the array of theoretical concepts. accordingly, in the past years the supply-sided development of reference models predominant in the science world has distanced itself from their demand-sided use in business practice. the article analyses this problem and presents an approach to the management of reference models. the task to be mastered using the proposed approach will be conceptually concretized with a framework and prototypically implemented in the form of a reference model management system.
a framework for the development of information appliances. this paper provides a framework for the design and development of personal information appliances - interactive technologies which aim to assist users in managing personal information in organisational, group and environmental contexts. the emphasis is on integration, both in terms of the development of integrated families of appliances and in terms of way in which appliances provide an integration of the diverse media necessary to support the management of personal information.
software security vulnerability testing in hostile environments. traditional black box software testing can be effective at exposing some classes of software failures. security class failures, however, do not tend to manifest readily using these techniques. the problem is that many security failures occur in stressed environments, which appear in the field, but are often neglected during testing because of the difficulty to simulate these conditions. software can only be considered secure if it behaves securely under all operating environments. hostile environment testing must thus be a part of any overall testing strategy. this paper describes this necessity and a black box approach for creating such environments in order to expose security vulnerabilities.
simplifying transformation of software architecture constraints. the heterogeneity of the architectural constraint languages makes difficult the transformation of constraints throughout the development process. indeed they have significantly different metamodels, which make the definition of mapping rules complex. in this paper, we present an approach that aims at simplifying transformations of architectural constraints. it is based on an architectural constraint language (acl), which includes one core constraint expression language and different profiles. each profile is defined upon a metamodel, which represents the architectural abstractions manipulated at each stage in the development process.
mobile agents for network management: when and when not! in order to fully realise the potential of mobile agent technology to address the needs of the network management domain, it is imperative to establish the conditions where mobile agent-based (ma) nms or snmp-based nms should be employed to achieve the optimal performance in term of overhead traffic generated. this paper presents mathematical models to approximate the overhead traffic created by the ma-based nms and snmp-based nms on the production network, based on the complexity of the management task involved. through our analysis and experimentation, we establish that there is range (of the number of nodes involved) wherein it is advantageous to use mobile agents. furthermore, we demonstrate through our analytical model that this range can be estimated a priori, thereby facilitating a decision on when to deploy mobile agents and when not to.
a coordination model for the semantic web. the semantic web foresees a web of machine-processable knowledge interacted with by clients in an operationalized manner. at web scale, the coordination between clients will be vital for ensuring the success of their interactions. in this paper we consider how a coordination model for the semantic web would look, as a precursor to the design and implementation of semantic web spaces, a middleware platform for real-world semantic web applications.
programming distributed systems with the delegation-based object-oriented language dself. common middleware platforms rely on a class-based object model. however, this model introduces several dependencies that are disadvantageous for distributed systems. the family of class-less delegation-based languages offers an alternative object model with lesser such dependencies. dself is an extension to the delegation-and prototype-based object-oriented language self. it adds distributed objects and transparent remote reference resolution to the language. in consequence, dself facilitates distributed inheritance and instantiation mechanisms. we describe the conception and implementation of dself and give examples where the flexibility of dself can be used with benefit as a middleware concept for programming distributed systems.
axes-based visualizations with radial layouts. in the analysis of multidimensional data sets questions involving detection of extremal events, correlations, patterns and trends play an increasingly important role in a variety of applications. axes-based visualizations like parallel or star coordinates are useful tools for the analysis of multidimensional data sets. in this paper, we present several interactive axes, which can be used to analyze data in an intuitive manner. furthermore, we present two novel radial visual arrangements of such axes - the timewheel and the multicomb. they focus on data sets with one variable of reference. timewheel and multicomb in combination with interactive axes are part of an interactive framework called visaxes, which can be used for enhanced multidimensional data browsing and analysis.
adding wildcards to the java programming language. this paper describes wildcards, a new language construct designed to increase the flexibility of object-oriented type systems with parameterized classes. based on the notion of use-site variance, wildcards provide a type safe abstraction over different instantiations of parameterized classes, by using '?' to denote unspecified type arguments. thus they essentially unify the distinct families of classes often introduced by parametric polymorphism. wildcards are implemented as part of the upcoming addition of generics to the java&trade; programming language, and will thus be deployed world-wide as part of the reference implementation of the java compiler javac available from sun microsystems, inc. by providing a richer type system, wildcards allow for an improved type inference scheme for polymorphic method calls. moreover, by means of a novel notion of wildcard capture, polymorphic methods can be used to give symbolic names to unspecified types, in a manner similar to the "open" construct known from existential types. wildcards show up in numerous places in the java platform apis of the upcoming release, and some of the examples in this paper are taken from these apis.
towards an intelligent mobile travel assistant. travel has many situations where context-aware computing can bring important benefits. in this paper, we describe an approach for integrating context-aware computing to a mobile travel assistant. travel plans, generated using reality [2], are enriched within compact and powerful structures, called user task models. these structures are transferred to a mobile device enabling the support for the traveler during his trip.
reality: a scalable intelligent travel planner. many information systems are used in a problem solving context. examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. they can be made more useful by integrating problem-solving capabilities into the information systems. this poses the challenge of scalability: when hundreds of users access a server at the same time, it is important to avoid excessive computational load.in this paper, we present an approach, called reality, that allows to significantly extend the reach of electronic commerce in travel. our application addresses in particular the challenge of modeling customers' personal preferences and providing solutions that are tailored to just those preferences. in contrast to existing technology, which allow to optimize only a small and predefined set of preferences, our tool allows a wide variety that can accurately model the preferences of different customers.
replicated declustering for arbitrary queries. declustering have attracted a lot of interest over the couple of years. recently, declustering using replication is proposed to reduce the additive overhead of declustering. most of the work on declustering focuses on spatial range queries. however, in many scenarios including multi-user environments, query shapes can be arbitrary. in this paper, we explore replicated declustering for arbitrary queries. replication reduces the cost of arbitrary queries to manageable levels. first, we investigate theoretically what is possible using replication for arbitrary queries. then, we propose a 2-copy replication strategy that achieves the theoretical limit and therefore is the best possible scheme. using proposed scheme, an arbitrary query containing b buckets requires disk accesses bounded by [&radic;b] this is a significant improvement especially for small queries because using a single copy b buckets require min (b, n) disk accesses in the worst case even for small queries. proposed scheme works for nonuniform data as well as uniform data. finally, we extend the proposed scheme to a partial replication scheme to achieve best performance using limited replication.
performance analysis of mpi-i/o primitives on a pc cluster. cluster computing is an area of growing interest to support parallel and distributed applications. many of these applications are i/o intensive and the limited bandwidth of the i/o subsystem of the cluster is an important bottleneck usually ignored. thus, the performance of parallel i/o primitives is critical for the overall cluster performance. in this work, we try to characterize i/o routines supported by the standard mpi-2 on a pc cluster using the nfs and pvfs file systems in order to detect weak spots in the use of these routines and to predict their impact on the application's performance.
an evaluation of qinna, a component-based qos architecture for embedded systems. component-based software engineering (cbse) is quickly becoming a mainstream approach to software development. at the same time, there is a massive shift from desktop applications to handheld systems: it is especially the case for multimedia applications such as video player, games, etc. moreover, these applications have several quality of service (qos) constraints which must be reached. a key issue of cbse in embedded systems is its ability to integrate qos management. in this paper, we demonstrate the feasibility of integrating qos concepts to cbse. the demonstration is based on qinna, a component-based qos architecture integrating the main qos concepts. moreover, qinna respects separation of concerns and can be easily reused thanks to its identified components.