ppxscal/embedding_network huggingface dataset:
On-line Writer Adaptation for Handwriting Recognition using Fuzzy Inference Systems
Authors: Harold Mouchere, Eric Anquetil, Nicolas Ragot
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

We present an automatic on-line adaptation mechanism to the writer's handwriting style for the recognition of isolated handwritten characters. The classifier is based on a Fuzzy Inference System (FIS). This FIS is composed of fuzzy prototypes which represent the intrinsic properties of the classes and it uses numeric conclusions. The proposed adaptation mechanism affects both the conclusions of the rules and the fuzzy prototypes of the premises by recentering and re-shaping them. Doing so, the FIS is automatically fitted to the handwriting style of the writer that is currently using the system. This adaptation mechanism has been tested with 8 different writers. The results show the adaptation mechanism is able to improve the recognition rate from 88% to 98.2% in average for the 26 Latin letters.
Globally Minimal Surfaces by Continuous Maximal Flows
Authors: Ben Appleton, Hugues Talbot
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

In this paper, we address the computation of globally minimal curves and surfaces for image segmentation and stereo reconstruction. We present a solution, simulating a continuous maximal flow by a novel system of partial differential equations. Existing methods are either grid-biased (graph-based methods) or suboptimal (active contours and surfaces). The solution simulates the flow of an ideal fluid with isotropic velocity constraints. Velocity constraints are defined by a metric derived from image data. An auxiliary potential function is introduced to create a system of partial differential equations. It is proven that the algorithm produces a globally maximal continuous flow at convergence, and that the globally minimal surface may be obtained trivially from the auxiliary potential. The bias of minimal surface methods toward small objects is also addressed. An efficient implementation is given for the flow simulation. The globally minimal surface algorithm is applied to segmentation in 2D and 3D as well as to stereo matching. Results in 2D agree with an existing minimal contour algorithm for planar images. Results in 3D segmentation and stereo matching demonstrate that the new algorithm is robust and free from grid bias.
Humancentric Applications of Precise Location Based Services
Authors: Laura Perusco, Katina Michael
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This paper focuses on the growing need to consider the implications of humancentric applications of precise location based services (LBS). As newer positioning technologies are introduced into the market with a greater level of location accuracy, and existing technologies are utilized in an integrated fashion to overcome limitations, issues pertaining to the use and potential misuse of location information rise to the fore. The scenario planning methodology provides a robust approach within which to consider future possibilities based on current market developments. To this end, document and content analysis play an important role in the collection of facts used to illustrate a given set of scenarios. The contribution of this paper is in providing adequate evidence toward precise LBS and in identifying those attributes that will guide the formation of the narrative descriptions in future research. The preliminary results of the study indicate that societal, ethical and legal implications need to be given greater attention as precise LBS applications will be increasingly used in the tagging, tracking and tracing of humans.
Content-Aware Global Static Compression for Web Content Delivery
Authors: Junli Yuan, Chi-Hung Chi, Qibin Sun
Venue: Proceedings of the 10th International Workshop on Web Content Caching and Distribution (2005)

The effectiveness of real-time lossless compression on web data is found to be limited by the relatively small size of its basic operation unit, web object. However, we observe that while the repeated occurrence frequencies of strings within a single object might be low, the frequencies can be very high if they are considered over multiple objects. Furthermore, these strings with high occurrence frequencies are quite static, and the size of such string set is also quite small. In this paper, we propose a complementary compression mechanism on top of the existing HTTP supported algorithms, called the Content-Aware Global Static Compression (CAGSC), to further improve web data compression. Its basic idea is to include a static CAGSC table to perform compression on frequently, globally occurred strings. Our experimental result shows that CAGSC can obtain an average of 15% improvement over standard HTTP supported algorithms.
Predicting Human Papilloma Virus Prevalence and Vaccine Policy Effectiveness in Demographic Strata
Authors: Courtney Corley, Armin R. Mikler
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Human Papilloma Virus (HPV) is a sexually transmitted virus, which can lead to cervical cancer. HPV DNA is found in cervical cancers with types 16, 18, 31 and 45 accounting for more than 75% of cervical cancers. Candidate vaccines have entered phase III testing with the Food and Drug Administration and several drug companies are in licensing arbitration. Once this vaccine becomes available, an effective vaccination strategy is needed. Hughes, Garnett and Anderson have developed a model to predict HPV prevalence and population-level vaccine effectiveness; however, this model does not allow for stratification with time-dependent demographic traits, such as age. With this in mind, we have developed a tool that facilitates predicting HPV prevelence in a variety of demographic settings and allows for quantification of different vaccination policies.
The MSFAM: a modified fuzzy ARTMAP system
Authors: Mu-Chun Su, Wei-Zhe Lu, Jonathan Lee, Gwo-Dong Chen, Chen-Chiung Hsieh
Venue: Pattern Analysis Applications (2005)

A fuzzy ARTMAP system is a system for incremental supervised learning of recognition categories and multi-dimensional maps in response to an arbitrary sequence of analog or binary input vectors. Fuzzy ARTMAP systems have been benchmarked against a variety of machine learning, neural networks, and genetic algorithms with considerable success. Owing to many appealing properties, fuzzy ARTMAP systems provide a natural basis for many researchers. Many different approaches have been proposed to modify fuzzy ARTMAP systems. In this paper, we propose a new approach to modifying a fuzzy ARTMAP system. We refer to the new system as the modified and simplified fuzzy ARTMAP (MSFAM) system. The aims of MSFAM systems are not only to reduce the architectural redundancy of the fuzzy ARTMAP system, but also to make extracted rules more comprehensible and concise. Four data sets were used for demonstrating the performance of the proposed MSFAM system.
Semiconductor and insulator nanostructures: challenges and opportunities
Authors: C. V. Cojocaru, F. Ratto, C. Harnagea, A. Pignolet, F. Rosei
Venue: Microelectronic Engineering (2005)

In the race to downsize integrated devices nanostructure fabrication is a primary challenge. Semiconductors and insulators technology has always relied on the top-down approach. Alternative "unconventional" approaches are now emerging, in particular the bottom-up approach. We describe recent work on the fabrication, patterning and integration of two important classes of new materials into the Si based technology, namely Ge/Si semiconductor hetero-structures and ABO3 ferroelectric oxides.
Resource Allocation for High-Speed Uplink Wireless Channels with no Reservation Guarantees
Authors: H. Papadakis, P. Koutsakis
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

A new scheme, combining medium access control (MAC) with traffic policing for next generation wireless networks, is proposed in this work, in order to provide a flexible solution for the integration of multimedia traffic over noisy high capacity links. The most attractive features of our scheme are: a) its flexibility, which allows it to adapt easily to wireless channel of various capacities, and b) its ability to efficiently integrate the different types of traffic, which have diverse and contradictory Quality of Service (QoS) requirements, without dedicating a fixed portion of its bandwidth to requests by the voice, data and video terminals. Our scheme achieves high aggregate channel throughput in all cases of traffic load, while preserving the Quality of Service (QoS) requirements of each traffic type. The scheme is also shown to outperform, both conceptually and in terms of channel throughput, three efficient MAC protocols of the literature.
A Generic Communication Middleware Architecture for Distributed Application and Service Messaging
Authors: Daniel Pakkala, Pekka Pakkonen, Markus Sihvonen
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

The contribution of this paper is a Generic Communication Middleware (GCM) concept and architecture definition for application messaging in heterogeneous distributed computing environments. The GCM is targeted to facilitate the development of distributed applications into heterogeneous computing environments, with special attention given to applicability for both wireless and wired communication and variable capability devices. The requirements are gathered from the literature and initial prototype implementations. The GCM concept and architecture are presented in the paper. The novelty of the GCM middleware is that it provides both application and transport independent messaging system architecture that can be widely applied in different applications and services as middleware. Functional validation of the GCM concept and architecture is provided via prototypes overviewed and empirically analyzed in the paper.
Computer measurement and evaluation: artistry or science?
Authors: Thomas E. Bell
Venue: ACM SIGSIM Simulation Digest (1972)

Effort invested in computer measurement and evaluation is clearly increasing, but the results of this increasing investment may be unfortunate. The undeniable value of the results and the enthusiasm of participants may be leading to unrealizable expectations. The present artistry needs to be converted into a science for achieving a solid future; the most fruitful direction may be the synthesis of individual, empirical discoveries combined with testing hypotheses about performance relationships.
3D surface analysis using coupled HMMs
Authors: Franz Pernkopf
Venue: Machine Vision and Applications (2005)

We propose a coupled hidden Markov model (CHMM) for analysis of steel surfaces containing three-dimensional flaws. The aim is to model surface errors, which are stretched across one or more surface segments because of their strongly varying size. Due to scale on the surface, the reflection property across the intact surface changes and intensity imaging fails. Light sectioning is used to acquire the surface range data. The steel block is vibrating on the conveyor during data acquisition, which complicates robust feature extraction. After depth map recovery and feature extraction, segments of the surface are classified using CHMMs. The CHMM achieves a recognition rate of 98.57%. We compare the CHMM approach to the na&#x00ef;ve Bayes classifier, the Hidden Markov Model, the k-nearest neighbor classifier, and to the Support Vector Machine.
Sharing Ontology Schema Information for Web Service Integration
Authors: Jingshan Huang, Rosa Laura Zavala Gutierrez, Benito Mendoza Garcia, Michael N. Huhns
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In spite of many standards efforts, Web services with similar or compatible functionalities often have heterogeneous semantics. One reason is the disparate ontologies used for service descriptions. In order to compare and compose Web services, the ability to merge different ontologies is essential. This paper describes an approach to align numerous, independently designed ontologies. Our approach is a completely automated one, without the need for prior agreement on semantics. It incorporates WordNet and heuristic reasoning and infers new knowledge by selflearning. Our system provides a solid base for the seamless integration of Web services.
Image Based Tracking of News Stories
Authors: Jedrzej Z. Miadowicz, John M. Gauch, Abhishek Shivadas
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Broadcasters often reuse video clips while reporting news stories. New clips are added to the story as it develops replacing old clips. A subset of these video clips may be replayed as follow up stories are investigated. This pattern of video repetition can be used to impose a story level organization on video clips that are broadcast by one or more news channels. In this paper, we describe an automated system for detecting and tracking repeated video clips in news broadcasts. We begin by performing temporal video segmentation to divide the video into shots and scenes. As each frame of the video source is processed, we extract low-level video features that are used to perform repeated sequence detection in realtime. Our matching algorithms have been adapted to recognize partial clip reuse while remaining robust to minor variations in the video source. Our system then builds a set of shots relevant to the news story being tracked, called a story core, and identifies new story episodes by detecting occurrences of shots belonging to this set. The story core is allowed to evolve dynamically over time to account for additional video footage as it becomes available. This technique was evaluated on a 24-hour broadcast of CNN News channel where we were very successful locating and tracking video clips associated with selected news stories.
Adventures in time and space
Authors: Norman Danner, James S. Royer
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR1, has its first-order programs characterize the poly-time computable functions, and its second-order programs characterize the type-2 basic feasible functionals of Mehlhorn and of Cook and Urquhart. (The ATR1-types are confined to levels 0, 1, and 2.) The type system comes in two parts, one that primarily restricts the sizes of values of expressions and a second that primarily restricts the time required to evaluate expressions. The size-restricted part is motivated by Bellantoni and Cook's and Leivant's implicit characterizations of poly-time. The time-restricting part is an affine version of Barber and Plotkin's DILL. Two semantics are constructed for ATR1. The first is a pruning of the naïve denotational semantics for ATR1. This pruning removes certain functions that cause otherwise feasible forms of recursion to go wrong. The second semantics is a model for ATR1's time complexity relative to a certain abstract machine. This model provides a setting for complexity recurrences arising from ATR1 recursions, the solutions of which yield second-order polynomial time bounds. The time-complexity semantics is also shown to be sound relative to the costs of interpretation on the abstract machine.
$\varepsilon$-Optimal Bidding in an Electricity Market with Discontinuous Market Distribution Function
Authors: Edward J. Anderson, Huifu Xu
Venue: SIAM Journal on Control and Optimization (2005)

This paper investigates the optimal bidding strategy (supply function) for a generator offering power into a wholesale electricity market. The model has three characteristics: the uncertainties facing the generator are described by a single probability function, namely the market distribution function; the supply function to be chosen is nondecreasing but need not be smooth; the objective function is the expected profit which can be formulated as a Stieltjes integral along the generator's supply curve. In previous work the market distribution function has been assumed smooth, but in practice this assumption may not be satisfied. This paper focuses on the case that the market distribution function is not continuous, and hence an optimal supply function may not exist. We consider a modified optimization problem and show the existence of an optimal solution for this problem. Then we show constructively how such an optimum can be approximated with an $\varepsilon$-optimal supply function by undercutting when the generator does not hold a hedging contract (and possibly overcutting when the generator has a hedging contract). Our results substantially extend previous work on the market distribution model.
Human information behavior: Integrating diverse approaches and information use
Authors: Amanda Spink, Charles Cole
Venue: Journal of the American Society for Information Science and Technology (2006)

For millennia humans have sought, organized, and used information as they learned and evolved patterns of human information behaviors to resolve their human problems and survive. However, despite the current focus on living in an &ldquo;information age,&rdquo; we have a limited evolutionary understanding of human information behavior. In this article the authors examine the current three interdisciplinary approaches to conceptualizing how humans have sought information including (a) the everyday life information seeking&ndash;sense-making approach, (b) the information foraging approach, and (c) the problem&ndash;solution perspective on information seeking approach. In addition, due to the lack of clarity regarding the role of information use in information behavior, a fourth information approach is provided based on a theory of information use. The use theory proposed starts from an evolutionary psychology notion that humans are able to adapt to their environment and survive because of our modular cognitive architecture. Finally, the authors begin the process of conceptualizing these diverse approaches, and the various aspects or elements of these approaches, within an integrated model with consideration of information use. An initial integrated model of these different approaches with information use is proposed. &copy; 2006 Wiley Periodicals, Inc.
HOTS: An OWAMP-Compliant Hardware Packet Timestamp Recorder
Authors: Zhang Shu, Katsushi Kobayashi
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Accurate timestamps on both the sender and the receiver side are crucial for one-way delay (OWD) measurements. Traditionally, such measurements use software-based timestamps, which could suffer from errors of up to tens of milliseconds. In this paper, we introduce HOTS - a hardware packet timestamp recorder dedicated to OWD measurements. Compared with traditional methods, HOTS has the advantage of: (i) it can generate extremely precise timestamps for both outgoing and incoming OWAMP test packets, and (ii) it eliminates all kinds of software overheads. We present the results of OWD measurements that we carried out using this timestamp recorder and confirm some basic characteristics of the Internet traffic. In addition, we compare these results with those based on traditional methods of obtaining time information. We show that the results of HOTS are more accurate and stable. Although HOTS is developed for measuring OWD, it can also provide accurate timestamps for other applications.
Throughput of Streaming Applications Running on a Multiprocessor Architecture
Authors: Nikolay Kavaldjiev, Gerard J. M. Smit, Pierre G. Jansen
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

In this paper we study the timing behaviour of streaming applications running on a multiprocessor architecture. Dependencies are derived between the application throughput and the timing characteristics of the processors and communication. Four different processor organizations that strongly influenced the results are considered and compared.
On the generalized Zipf distribution. Part I
Authors: Shi Shan
Venue: Information Processing and Management: an International Journal (2005)

This article is concerned with a class of informetric distribution, a family of skew distributions found to describe a wide range of phenomena both within or outside of information sciences and referred to as being of Zipf-type. A generalization of Zipf distribution (a size-frequency form of the Zipf's law), named the generalized Zipf distribution, is introduced. Two main characterizations of the generalized Zipf distribution are obtained based on the proportionate hazard rate and truncated moments. Finally, some asymptotic properties of the generalized Zipf distribution are investigated.
Experiences with and Observations of Direct-Touch Tabletops
Authors: Kathy Ryall, Clifton Forlines, Chia Shen, Meredith Ringel Morris, Katherine Everitt
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

The design of multi-touch multi-user tabletop user interfaces is still in its infancy and is not yet well understood. To date, published experimental results have primarily focused on controlled user studies. In this paper, we present observations of user experience "in the wild" on interactive tables in four different real-world contexts - all non-controlled settings. We reflect upon our collective experience, report our observations, and summarize lessons learned by identifying design considerations relating to several aspects of interactive tables, such as simultaneous touching, ambiguous input, one-fingered touch, finger resolution, alternate touch input, crowding and clutter, text input, orientation, multi-user coordination, occlusion, ergonomic issues, and mental models.
Requirements modeling with uml: a study of perceived usefulness and ease of use
Authors: Cynthia Phillips
Venue:  (2005)

The Unified Modeling Language (UML) provides an environment for modeling complex systems. It supports a variety of diagrams for analyzing, designing, and implementing software systems. During the requirements phase, developers abstract concepts from the application domain and describe what the system is intended to do, not how it will do it. UML was adopted as a standard for OO modeling by the Object Management Group in 1997 and has found use in various software development projects. However, the continued success of any new technology depends a great deal on its usability. To predict the future success of a language like UML it is important to address the issue of usability from the perspective of the users of the language, the software developers. This study reports the results of an empirical study aimed at assessing the usability of UML for developing software requirements. It addresses the dimensions of ease of use, usefulness, and usefulness for communicating requirements to various project stakeholders.