ppxscal/embedding_network huggingface dataset:
Polymorphic typed defunctionalization
Authors: François Pottier, Nadji Gauthier
Venue: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2004)

Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-class values. Its purpose is thus identical to that of closure conversion. It differs from closure conversion, however, by storing a tag, instead of a code pointer, within every closure. Defunctionalization has been used both as a reasoning tool and as a compilation technique.Defunctionalization is commonly defined and studied in the setting of a simply-typed λ-calculus, where it is shown that semantics and well-typedness are preserved. It has been observed that, in the setting of a polymorphic type system, such as ML or System F, defunctionalization is not type-preserving. In this paper, we show that extending System F with guarded algebraic data types allows recovering type preservation. This result allows adding defunctionalization to the toolbox of type-preserving compiler writers.
Fast image segmentation based on multi-resolution analysis and wavelets
Authors: Byung-Gyu Kim, Jae-Ick Shim, Dong-Jo Park
Venue: Pattern Recognition Letters (2003)

An efficient algorithm for image segmentation based on a multi-resolution application of a wavelets transform and feature distribution is presented. The original feature space is transformed into a lower resolution with a wavelets transform to derive fast computation of the optimum threshold value in a feature space. Based on this lower resolution version of the given feature space, a single feature value or multiple feature values are determined as the optimum threshold values. The optimum feature values, which are in the lower resolution, are projected onto the original feature space. In this step a refinement procedure may be added to detect the optimum threshold value. Experimental results for the proposed algorithm indicate feasibility and reliability for fast image segmentation.
Conquering Uncertainty in Multiple-Valued Logic Design
Authors: Denis V. Popel
Venue: Artificial Intelligence Review (2003)

In modern science, significant advances are typically made at cross-roads of disciplines. Thus, many optimization problems in Multiple-valued Logic Design have been successfully approached using ideas and techniques from Artificial Intelligence. In particular, improvements in multiple-valued logic design have been made by exploiting information/uncertainty measures. In this paper, we review well-known information measures in the multiple-valued domain and consider some methods of finding information measures for completely or incompletely specified functions with multiple-valued and continuous attributes. In this respect, the paper addresses the problem known as discretization and introduces a method of finding an optimal representation of continuous data in the multiple-valued domain. We also propose a technique for efficient calculation of different information measures using Multiple-valued Decision Diagrams. As one application of our technique, we outline an approach to synthesizing digital circuits derived from decision diagrams that can yield to reduction in power dissipation. The paper also shows the impact in several important areas of multiple-valued system design including (i) fuzzy logic, (ii) quantum computing systems, and (iii) data mining.
Lucas-Kanade 20 Years On: A Unifying Framework
Authors: Simon Baker, Iain Matthews
Venue: International Journal of Computer Vision (2004)

Since the Lucas-Kanade algorithm was proposed in 1981 image alignment has become one of the most widely used techniques in computer vision. Applications range from optical flow and tracking to layered motion, mosaic construction, and face coding. Numerous algorithms have been proposed and a wide variety of extensions have been made to the original formulation. We present an overview of image alignment, describing most of the algorithms and their extensions in a consistent framework. We concentrate on the inverse compositional algorithm, an efficient algorithm that we recently proposed. We examine which of the extensions to Lucas-Kanade can be used with the inverse compositional algorithm without any significant loss of efficiency, and which cannot. In this paper, Part 1 in a series of papers, we cover the quantity approximated, the warp update rule, and the gradient descent approximation. In future papers, we will cover the choice of the error function, how to allow linear appearance variation, and how to impose priors on the parameters.
Components for time serie receiver clock offset in GPS solutions
Authors: P. Abad
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In the equations systems generated for the GPS satellite observations, when the positional parameters are held fixed or constrained the clock receiver solutions are significantly affected, and this variable absorbs the non controlled effects. In this work, for the clock receiver solutions viewed a time serie, we analyze the components to detect periodicity in the no controlled effects, and built new mathematical models for control them.
Adaptive speech recognition with evolving connectionist systems
Authors: Akbar Ghobakhlou, Michael Watts, Nikola Kasabov
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

The paper presents a novel approach towards building adaptive speech recognition systems based on the evolving connectionist systems paradigm (ECoS). The simple evolving connectionist systems are the minimalist implementation of the ECoS. They can accommodate new input data and new classes through local element tuning. New connections and neurons are created during the adaptive learning process of the system. Experiments are conducted to illustrate this concept. It is demonstrated that a system can adapt to new speakers data and add new output classes on-line, e.g. new words, added at any time of its operation without having to rebuild the network from "scratch". The system is robust to forgetting when new words are added.
Thermo-Key: Human Region Segmentation from Video
Authors: Kazutaka Yasuda, Takeshi Naemura, Hiroshi Harashima
Venue: IEEE Computer Graphics and Applications (2004)

A color and thermal combination camera measures the temperature distribution of its field of view. This system segments the human region from the video sequence¿captured by the color camera in real time¿with high robustness against lighting and background conditions.
Increasing efficiency of compositional synthesis by improving the database of its building blocks
Authors: Amaresh Chakrabarti
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

This article is an attempt to improve the efficiency of procedures for compositional synthesis of design solutions using building blocks. These procedures have found use in a wide range of applications, and are one of the most substantial outcomes of research into automated synthesis of design solutions. Due to their combinatorial nature, these procedures are highly inefficient in solving problems, especially when the database of building blocks for synthesis or the problem size is large. Previous literature often focuses on improving only the algorithm part of a procedure, while it is both its algorithm and database which together determine the overall efficiency of the procedure. This article uses a case study to investigate and develop a set of rules for structuring and preprocessing a database of building blocks so as to improve the efficiency of synthesis of design solutions using this database.
Action systems in incremental and aspect-oriented modeling
Authors: R. Kurki-Suonio
Venue: Distributed Computing (2003)

Action systems were first introduced as an execution model that made it possible to model distributed systems at a high level of abstraction and to refine these models into implementation descriptions. This paper describes how these initial ideas have developed into a formally based specification and design method for reactive systems, and discusses some related research. In this approach, TLA is adopted as programming logic, and action systems are extended with various language facilities. Systems are modeled as closed systems, which makes effective interface refinement possible. The associated design method is based on refinement by superposition, and the resulting specifications are layered structures, in which aspect-orientation is supported by the possibility to compose independent refinements of common base systems. A new kind of analysis of observations of concurrent executions shows that TLA-based fairness assumptions can be used also in high-level abstractions of distributed systems.
Copper post-electroplating anneal: evaluation of in-line vs. furnace anneal on layer properties
Authors: P. H. Haumesser, T. Mourier, S. Maîtrejean, M. Cordeau, T. Morel, X. Avale, O. Pollet, J. Klocke
Venue: Microelectronic Engineering (2003)

With the integration of copper as a conductive material in interconnects, post-electroplating anneal plays a key role in controlling the copper characteristics. Meanwhile, there is a constant need to reduce the thermal budget in the back-end processes. In this context, short on-board anneals are an interesting alternative to long batch furnace thermal treatments. In this work, we evaluate the impact of such short anneals on copper properties. Microstructural, mechanical and contamination results show that short on-board anneals at 400 °C offer performances that are similar to longer furnace anneals at the same temperature, whereas 250 °C anneals are clearly insufficient. Integration issues such as copper adhesion are investigated.
Distinct Sums Modulo n and Tree Embeddings
Authors: André E. Kézdy, Hunter S. Snevily
Venue: Combinatorics, Probability and Computing (2002)

In this paper we are concerned with the following conjecture.Conjecture. For any positive integers n and k satisfying k < n, and any sequence a1, a2, &hellip; ak of not necessarily distinct elements of Zn, there exists a permutation &pi; &isin; Sk such that the elements a&pi;(i)+i are all distinct modulo n.We prove this conjecture when 2k &le; n+1. We then apply this result to tree embeddings. Specifically, we show that, if T is a tree with n edges and radius r, then T decomposes Kt for some t &le; 32(2r+4)n2+1.
Communities and other social structures for knowledge sharing: a case study in an internet consultancy company
Authors: Inkeri Ruuska, Matti Vartiainen
Venue: Communities and Technologies (2003)

This research aims at understanding how people share knowledge in their everyday work in a project-based company. The social structures for knowledge sharing are characterised as formal, informal, and quasi-informal structures. They vary from those with high formalisation to the informal, and even include structures which are invisible and unrecognised in the organisation. They also vary in their composition. They may share the same or different space, and communication is based on face-to-face or virtual interaction. Data was collected by means of documents and interviews (n=18) during the autumn of 2002 and the winter of 2003 from an Internet consultancy company. The study shows the great variety of formal, informal, and quasi-informal social structures that are used for knowledge sharing in the case company. In all, sixteen different structures were found. The number of formal structures is smaller than the number of informal ones. Their analysis in terms of five dimensions also shows their great heterogeneity.
Near force-balanced cutting: key to increase productivity in machining
Authors: P. Sasavat, N. Gindy, J. F. Xie, A. T. Bozdana
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

A near force-balanced system has been developed to reduce the deterioration of part quality occurring during machining process by proposing multiple active tools cutting simultaneously in the different direction and/or utilization of active/passive tools (supports) operating simultaneously. FEM is used to prove the feasibility of this idea by considering an aluminum hollow cylinder that is fixed at one end to represent a turning process of workpiece clamped in a chuck. Weakening material property by reducing the value of young's modulus is selected as the material removal technique for this paper. Parametric study is also performed to analyze the effect of changing some relevant parameters whereas experimental validation of this concept in twin turning machine (CNC) is underway.
Coupling pair programming and writing: learning about students' perceptions and processes
Authors: Tammy VanDeGrift
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Pair Programming has been successful in many introductory computer science courses. Its success has manifested in increased retention rates, better performance on programming tasks, increased confidence, and decreased frustration. This paper highlights experiences using pair programming coupled with individual written reports in a large, introductory computer science course. Through analysis of survey data and written reports, our study shows that students perceive benefits in pair programming, such as those documented earlier (social structure, peer help, less frustration, reduced workload). Regarding the written reports, students cited benefits such as a chance to summarize their project, to reflect on the code, and to use new vocabulary. We discuss what we learn about students' processes, their challenges, and the resources they use for supporting their learning.
Real world sensorization for observing human behavior and its application to behavior-to-speech
Authors: Yoshifumi Nishida, Koji Kitamura, Hiroshi Aizawa, Toshio Hori, Makoto Kimura, Takeo Kanade, Hiroshi Mizoguchi
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

This paper describes a method for robustly detecting and efficiently recognizing daily human behavior in the real world. The proposed method involves real-world sensorization using ultrasonic tags to robustly observe behavior, real-world virtualization to create a virtual environment by modeling real objects using a stereovision system, and virtual sensorization of virtualized objects in order to quickly register the handling of objects in the real world and efficiently recognizing specific human behavior. A behavior-to-speech system created based on this recognition method is also presented as a new application of this technology.
News & Trends
Authors: Greg Goth, Lisa Rein
Venue: IEEE Internet Computing (2004)

The Internet Engineering Task Force is beginning work on a standard for internationalizing email addresses, not quite a year after it codified RFC 3490, the standard for internationalized domain names. The discussion surrounding RFC 3490 was prolonged and passionate, and those in the center of it expect the debate surrounding internationalizing email addresses should prove just as boisterous, for both good and ill.
Integrating smart card access to Web-based medical information systems
Authors: Alvin T. S. Chan
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper examines the application of smart cards in the development of distributed medical information systems. The pocket mobility and security features of smart cards make them an ideal medium for storing the critical medical records of individual. However, the lack of interoperability and support for distributed operation has limited the development and usage of smart cards in a networked environment. This paper highlights the benefits of combining the World Wide Web and smart card technologies to support the development of highly robust health information system, while leveraging on the rich benefits of the Web technology. In particular, we describe an approach of using the WebCard service model as a common interface to communicate and access the medical records residing in a smart card that seamlessly integrates to existing web infrastructure. Importantly, by employing HTTP as the baseline protocol to access information on the smart card, WebCard promotes the use of de facto standard web browsers as the common client user interface. The initial implementation of the framework and development of a case example of a web-based medical information site have demonstrated the feasibility of the concept of WebCard.
The encryption method to share a secret binary image and its decryption system
Authors: Sang-su Lee, Jong-wook Han, Hyo-wook Bae
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

In this paper, an encryption method to share a secret binary image was proposed. This divides the image to be encrypted into an arbitrary number of images and encrypts them using XOR process with different binary random images which was prepared by the means of the XOR process, too. Each encrypted slice image can be distributed to the authenticated ones. However, we transfer the encrypted images to the binary phase masks to strengthen the security power, that means phase masks can not be copied with general light-intensity sensitive tools such as CCDs and cameras. For decryption, we used the Mach-Zehnder interferometer in which linearly polarized two light beams in orthogonal direction, respectively. The experimental result proved the efficiency of the proposed method.
Determinants of the Future Level of Use of Electronic Marketplaces among Canadian Firms
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Based on the literature on the diffusion of innovation and on information systems (IS), and building on emerging concepts in electronic commerce (e-commerce), this paper measures the influence of various factors (i.e., those that relate to the technology itself, to the present use of e-commerce and to business relationships) on firms' future level of use of electronic marketplaces (e-marketplaces). This theoretical model is tested on data collected from 1,200 senior managers in Canadian firms. Findings indicate that a firm's past experience in e-commerce and factors that relate to its business relationships ultimately affect its future use of e-marketplaces. Results of TOBIT regressions also show that the complexity of sophisticated e-commerce implementations is negatively correlated with the future level of use of e-marketplaces and that consultants and other experts play an essential role in encouraging and facilitating the use of this new type of electronic platform. Finally, our survey data demonstrate that the relative influence of some determinants differs according to the firms' size.
Essential Check Point FireWall-1 NG: An Installation, Configuration, and Troubleshooting Guide
Authors: Dameon D. Welch-Abernathy
Venue:  (2004)

"When it comes to security products and technologies, experience is far and away the best teacher. PhoneBoy has been installing, running, and supporting Check Point FireWall-1 for years, and his experience shows in this book. Save yourself the pain of learning from your own mistakes--let PhoneBoy show you the right way to manage your FireWall-1 NG infrastructure." --Tina Bird, Computer Security Officer, Stanford University"Dameon has taken his original definitive guide and updated it thoroughly for NG. No other book is informed by his depth of experience with Check Point. Accept no substitutes!" --Matthew Gast, author of 802.11 Wireless Networks: The Definitive Guide"PhoneBoy is the de facto expert on this product, and people have been clamoring for an NG book from him since he published the first one. No one can compete with him." --Valerie M. Leveille, Professional Educator"Dameon is the foremost authority on FireWall-1. He has the knowledge to give details of FireWall-1 functionality that no other reference on this topic can." --Paul Keser, Senior Network Security Engineer, Raytheon ITSS/NASA Ames Research Center"This book is the Swiss army knife solution for Check Point FireWall-1 NG." --Thomas Warfield, TNT-OK.comNow there's a definitive insider's guide to planning, installing, configuring, and maintaining the newest version of the world's #1 firewall: Check Point™ FireWall-1® Next Generation™. Leading Check Point support authority Dameon Welch-Abernathy (a.k.a. PhoneBoy) offers exclusive hands-on tips, techniques, checklists, and detailed sample configurations you can use right now to improve reliability, efficiency, and manageability in your Check Point environment.The author's previous Check Point FireWall-1 guide became an instant bestseller, earning the praise of security professionals worldwide. This new book has been thoroughly revamped to reflect Check Point FireWall-1 NG's powerful new features, and it includes even more expert solutions from PhoneBoy's FireWall-1 FAQ, the Web's #1 independent Check Point support site. Whether you're a security/network architect, administrator, or manager, you'll find it indispensable.Whether you're running FireWall-1 NG on UNIX or Windows platforms, this book brings together expert guidance for virtually every challenge you'll face: building your rulebase, logging and alerting, remote management, user authentication, inbound/outbound content restriction, managing NAT environments, building site-to-site VPNs with SecuRemote, even INSPECT programming. Welch-Abernathy also covers high availability in detail, identifying proven solutions for the challenges of implementing multiple firewalls in parallel.0321180615B12192003
MASS: a multi-axis storage structure for large XML documents
Authors: Kurt Deschler, Elke Rundensteiner
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Effective indexing for XML must consider both the query requirements of the XPath language and the dynamic nature of XML. We introduce MASS, a Multiple Axis Storage Structure, to provide scalable indexing for XPath expressions with guaranteed update performance. We describe the building blocks of MASS and provide results that demonstrate MASS's scalability. We show that MASS can outperform other state-of-the-art XML indexing solutions, even with constrained system resources.
Automatic Eyeglasses Removal from Face Images
Authors: Chenyu Wu, Ce Liu, Heung-Yueng Shum, Ying-Qing Xu, Zhengyou Zhang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--In this paper, we present an intelligent image editing and face synthesis system that automatically removes eyeglasses from an input frontal face image. Although conventional image editing tools can be used to remove eyeglasses by pixel-level editing, filling in the deleted eyeglasses region with the right content is a difficult problem. Our approach works at the object level where the eyeglasses are automatically located, removed as one piece, and the void region filled. Our system consists of three parts: eyeglasses detection, eyeglasses localization, and eyeglasses removal. First, an eye region detector, trained offline, is used to approximately locate the region of eyes, thus the region of eyeglasses. A Markov-chain Monte Carlo method is then used to accurately locate key points on the eyeglasses frame by searching for the global optimum of the posterior. Subsequently, a novel sample-based approach is used to synthesize the face image without the eyeglasses. Specifically, we adopt a statistical analysis and synthesis approach to learn the mapping between pairs of face images with and without eyeglasses from a database. Extensive experiments demonstrate that our system effectively removes eyeglasses.