Miracle-dz/UniFAR-FTUs huggingface dataset:
Elastic structural matching for recognizing on-line handwritten alphanumeric characters

ElasticStructuralMatchingforRecognizingOn-lineHandwrittenAlphanumericCharactersKam-FaiChanandDit-YanYeungTechnicalRep ortHKUST-CS98-07March1998DepartmentofComputerScienceTheHongKongUniversityofScience&TechnologyClearWaterBay,Kowlo on,HongKongfkchan,dyyeungg@cs.ust. hkAbstractSp eed,accuracy,andexibilityarecrucialtothepracticaluseofon-linehandwritingrecognition.Besides,extensibilityisalsoanimp ortantconcernaswemovfromonedomaintoanotherwhichrequiresthecharactersetb eextended.Inthispap er,wewillprop oseasimpleyetrobuststructuralapproachforrecognizingon-linehandwriting.Ourapproachisdesignedtoachievereasonablesp eed,fairlyhighaccu-racyandsucienttolerancetovariations.Athesametime,itmaintainsahighdegreeofreusabilityandhencefacilitatesextensibilit.Exp erimentalresultsshowthattherecognitionratesare98.60%fordigits,98.49%upp ercaseletters,97.44%forlowercaseand97.40%thecombinedset.Whentherejectedcasesareexcludedfromcalculation,ratescanb eincreasedto99.93%,99.53%,98.55%and98.07%,resp ectively.Ontheaverage,recognitionsp eedisab out7.5charactersp ersecondrunninginPrologonaSunSPARC10Unixworkstationandthememoryrequirementisreasonablylow.Withthissimpleyetrobuststructuralapproach,wealreadyhavane ectivandecienton-linecharacterrecognitionmo dule.Thismo dulewillb eusedaspartofalargersystem,ap en-basedmathematicalequationeditor,whichisb eingdevelop edbytheauthorsusingsyntacticalpatternrecognitionapproach.TheHongKongUniversityofScience&TechnologyTechnicalRep ortSeriesDepartmentComputer
Personal assistance by means of mobile objects

In the rst part the common structure of a mobile distributed system will be elaborated. A layered model will be presented, including the layers of hardware, operating system kernel, operating system services, middleware and applications. Many structuring concepts are used within these layers, especially with respect to object orientation. They will be shown. Additionally replication and consistency of replicas play an important role within mobile distributed systems. They are integrated too. The second part focuses on operating system and application support for mobile systems. Some research and development results in the areas of PDA operating systems and their applications will be presented. The overall objectives in this paper are: (1) the introduction into the elds of objects, mobility, and replication, (2) the presentation of recent research trends in operating systems usable for mobile distributed (object oriented) systems, and (3) the application of mobile objects in the area of personal assistance. In mobile distributed systems resources of any kind are more and more mobile, applications require mobility, and applications require replication for reasons of eeciency, fault tolerance, and disconnection. The principle of mobility states, that information access and processing should be possible always and everywhere. The market especially for personal assistance evolves into a mass market. A common global model of a mobile distributed system consists of the following ve layers, listed from bottom to top: (1) Hardware, (2) Operating system kernel, (3) System services, (4) Application services, and (5) Applications (see gure 1). Objects, object mobility, and object replication could be found everywhere in the system's global model. Outline of the paper: (1) Motivation and introduction, (2) General model and its layers, (3) Recent trends in mobile distributed operating systems, (4) Personal assistance at the application layer, (5) Summary and conclusions.
The dynamics of specialized knowledge representation : simulational reconstruction or the perception

Dynamicity is the condition of being in motion, and thus, is characterized by continuous change, activity, or progress. Not surprisingly, dynamicity is generally acknowledged to be an important part of any kind of knowledge representation system or knowledge acquisition scenario. This means that it might be a good idea to reconsider concept representations in Terminology, and modify them so that they better reflect the nature of conceptualization in the mind and brain. In this sense, recent theories of cognition have emphasized that situated or grounded experiences are activated in cognitive processing (Louwerse and Jeuniaux 2010; Barsalou 1999; Zwaan 2003). According to these theories, meaning construction heavily relies on perceptually simulating the information that is presented to the comprehender. Specialized knowledge representation that facilitates knowledge acquisition could thus be conceived as a situation model or event that enables comprehenders to use communicated information to better interact with the world
The XSB Programmer's Manual Version 1.7.1

To date (Version 1.7.1), the core engine development of the SLG-WAM has been mainly implemented by Terrance Swift, Kostis Sagonas, Prasad Rao and Juliana Freire. The breakdown, roughly, was that Terrance Swift wrote the initial tabling engine, Prasad Rao wrote the trie-based table access routines, and Kostis Sagonas implemented most of tabled negation. Juliana Freire revised the table scheduling mechanism starting from Version 1.5. 0 to create a more eecient engine, as well as adding local emulator, new to version 1.7. David Warren and Prasad Rao implemented the aggregate code. The auto table and suppl table directives were written by Kostis Sagonas. Memory management code and the command line execution interface were written by Ernie Johnson, Prasad Rao and Bart Demoen. Rui Marquez improved the trailing of the SLG-WAM. The safety check for tabling within the scope of cuts was written by Kate Dvortsova. Of other features in the system, Kostis Sagonas added HiLog compilation to XSB, along with the associated builtins. Steve Dawson implemented Uniication Factoring. wrote the mode analyzer for XSB. Harald Schroepfer helped the XSB group with the Solaris port, and Yiorgos Adamopou-los suggested the bits to use for the HP-700 series port. were responsible for the MkLinux and Solaris x86 ports. Thanks are also due to Weidong Chen for his early work on Prolog clause indexing and Richard O'Keefe, who contributed the Prolog code for the Prolog reader and the C code for the tokenizer.
UNDERSTANDING PREPOSITIONS THROUGH COGNITIVE GRAMMAR. A CASE OF IN

Poly - semantic nature of prepositions has been discussed in linguistic literature and confirmed by language data. In the majority of research within cognitive linguistics prepositions have been approached as predicates organising entities in space, with less attention paid to the search for a meaning schema sanctioning the numerous uses. Cognitive Grammar analytic tools allow for the analysis which results in discovering one meaning schema sanctioning the uses of the English preposition in. The present analysis is based on the assumption that the meaning schema of in profiles a relation of conceptual enclosure between two symbolic structures, one of which conceptually fits in the other. Accordingly, I argue that the speaker employs in to structure a real scene not because one element of the scene can physically enclose the other one, but due to conceptual ‘fitting in’ holding between the predication ‘preceding’ the preposition and the one that ‘follows’. In formal terms, the usage of in is conditioned and sanctioned by compatibility of active zones in the predications used to form the complex language expression involved. Peculiarities of physical organization may be ignored in such conceptualisation, though the speaker can choose to encode all peculiarities of physical organisation of real world objects employing different linguistic devices.
Yield Enhancement through Pre- and Post-Silicon Adaptation

Yield Enhancement through Preand Post-Silicon Adaptation by Cheng Zhuo Achieving a consistently high yield is always a key design objective. However, circuits designed in aggressively scaled technologies face more stringent design constraints and increased process variability. Traditional guard-band design methodologies that assume worst-case environmental factors and minimum feature size may reach overly conservative decisions and inevitably deteriorate the yield. Hence, design for yield (DFY) in nano-meter regime has become highly imperative for chip designers. This thesis focuses on several topics in yield enhancement and attempts to answer two basic questions (1) how to achieve a high yield and (2) how to achieve a consistently high yield. The first question is associated with several yield optimization issues. One key issue that complicates parametric yield optimization is the negative correlation among design constraints. In the first part of the thesis, we discuss the power-performance correlation and present a novel yield optimization framework by selecting body bias at design time. The framework considers both interand intra-die variation and then explores the possible body bias selection for gates by using a feature extraction technique. The gates with similar features are then grouped together and fed to the optimization framework to maximize the joint power-performance yield. The second and third parts of the thesis discuss the impact of oxide breakdown reliability on yield. For recent technology nodes, chip reliability has become a pressing concern in DFY. This thesis places the focus on oxide breakdown reliability, which is one of the key factors that set constraints on the operating supply voltage of the chip. Any pessimism in oxide breakdown reliability analysis may eventually degrade the yield. We
A Reading Course for Computing

109 During the last two decades a wide range of language courses have appeared in the market, particularly in fields such as business and economics (St John, 1996). Nevertheless, science and technology, having pioneered language textbooks with samples like Ewers and Latorres (1969), has not had the desirable continuity needed in this field, perhaps with some exceptions like Comfort et al. (1984). In the last few years, however, some efforts have been made to provide learners in technical fields with class materials: Alvarez de Mon et al. (1989) in electronics; Simon and Pritchard (2000) in engineering; Posteguillo (1997) and Remacha (1999) in computer science, and the like. Informatics technology, a discipline in constant evolution, demands a continuous striving towards developing and improving the necessary teaching tools. A Reading Course for Computing (ARCC) represents such an impulse for computer science learners of English.
Aplicación de un proceso de mejora continua en una asignatura de Desarrollo de Software Dirigido por Modelos

Currently, Model Driven Software Development (MDSD) is an emergent area in Software Engineering. DSDM allows developers to think on essential domain aspects more than on specific software implementation technology. Recently, this novel subject has been included in Computer Science and Software Engineering curricula. In this work, our experience teaching MDSD is described. A continuous improvement process has been used which allows us to analyze the teachinglearning process results, to think about this process and to build a improvement plan for the next years. The analysis of this continuous improvement process has
Genetic-algorithm-based design of ground-water quality monitoring system

This research builds on the work of Meyer and Brill [I9881 and subsequent work by Meyer et al. [1990], Meyer et al. [1992], and Meyer [I9921 on the optimal location of a network of groundwater monitoring wells under conditions of uncertainty. A method of optimization is developed using genetic algorithms (GAS) which allows consideration of the two objectives of Meyer et a1 . [1992], maximizing reliability and minimizing contaminated area, separately yet simultaneously. The GA-based solution method can generate both convex and non-convex points of the tradeoff curve, can accommodate non-linearities in the two objective functions, and is not restricted to the peculiarities of a weighted objective function. Furthermore, GAS can generate large portions of the tradeoff curve in a single iteration and may be more efficient than methods that generate only a single point at a time. Four multi-objective GAS formulations are investigated and their performance in generating the multi-objective tradeoff curve is evaluated for the groundwater monitoring problem using two example data sets. The GA formulations are compared to each other and to simulated annealing on both performance and computational intensity. The simulated annealing based technique used by Meyer et al. [I9921 relies on a weighted objective function which finds only a single point along the tradeoff curve for each iteration, while the multiple-objective GA formulations are able to find many convex and nonconvex points along the tradeoff curve in a single iteration. Each iteration of simulated annealing is approximately five times faster than an iteration of the genetic algorithm, but several simulated annealing iterations are required to generate the tradeoff curve. GAS are able to find a larger number of non-dominated points on the tradeoff curve in a single iteration, and are therefore just as computationally efficient as simulated annealing in terms of generating the tradeoff curves. None of the GA formulations demonstrate the ability to generate the entire tradeoff curve in a single iteration, but they yield either a good estimation of all regions of the tradeoff curve except the very highest and very lowest reliability ends or a good estimation of the high reliability end alone.
MARKALARIN DUYULAR YOLUYLA ŞEKİLLENMESİ: DUYUSAL MARKALAMA

Koklama, tatma, isitme, dokunma ve gorme gibi insanin sahip oldugu 5 duyunun mumkun oldugukadar coguna seslenen markalar, hedef kitlelerine deneyimleyecekleri genis bir alan yaratmaktave marka ile yakin temas kurulmasini saglayarak, kurum hatta marka kimliklerini hedefkitlelerin akillarinda daha net ve saglam olarak yerlestirebilmektedirler. Duyusal markalama olaraktanimlanan bu yeni yaklasimin etkisini gormus olan bircok isletme markalarina ozgu koku,dokunma ve gorsel kimliklerin yani sira urunlerini tanimlayan ses kimliklerini de ozel olarak tasarlatmaktave pazarlama uygulamalarinda kimlik calismalari icine bu konulari da dahil etmektedirler.Bircok duyuya hitap eden mesajlarin etkisinin ve gucunun daha fazla oldugu yargisindanhareketle bicimlendirilen, markalama konusunda duyular ile kurulacak duygusal bagin oneminidile getiren bir yaklasim olarak “Askla Yaratilan Markalar (Lovemarks)” anlayisi, Saatchi& SaatchiReklam Ajansi'nin yaratici direktoru olan Kevin Roberts'in ortaya attigi bir stratejik bakisacisidir. Bu calismada soz konusu yaklasim temelinde, duyularin ozellikle kurumsal markalamauzerindeki etkisi ve duyusal pazarlama olgusu, markalarin ornek uygulamalari baglaminda aktarilmaktadir.
Survivable design in WDM mesh networks

This dissertation addresses several important survivable design issues in WDM mesh net­ works. We first consider single link failure scenarios. To achieve both high efficiency in capac­ ity utilization and fast restoration are primary goals of survivable design in optical networks. Shared backup path protection has been shown to be efficient in terms of capacity utilization, due to the sharing of backup capacity. However, sharing of backup capacity also complicates the restoration process, and leads to slow recovery. Ring-type protection in mesh topology, on the other hand, has the advantage of fast restoration. The p-cycle scheme is the most efficient ring-type protection method in terms of capacity utilization. Recently, the concept of pre-cross-connected protection was proposed to increase the recovery speed of shared path protection. We overview these protection methods and discuss their failure recovery processes. The recovery time of these schemes are compared analytically. We formulate integer program­ ming optimization problems for three protection methods in static traffic scenario, considering wavelength continuity constraint. We investigate the effect of network connectivity on the per­ formance of capacity utilization of the methods by experimenting on topologies with different average nodal degrees. Dynamically provisioning connections, i.e. lightpaths are established on demand as connec­ tion requests arrive at the network and torn down when connections are terminated is becoming more important in backbone transport network. Survivable design for dynamic traffic using p-cycle technique has the potential to achieve both fast recovery and capacity efficiency. We develop a p-cycle based scheme to deal with dynamic traffic in WDM networks. We use a two-step approach. In first step, we find a set of p-cycles to cover the network and reserve
Active Message Applications Programming Interface

High-performance network hardware is advancing, with multi-gigabit link bandwidths and sub-microsec and switch latencies. Network-interface hardware also continues to evolve, although the design space remains large and diverse. One critical abstraction, a simple, portable, and general-purpose communications interface, is required to make effective use of these increasingly high-performance networks and their capable interfaces. Without a new interface, the software overheads of existing ones will dominate communication costs, and many applications may not benefit from the advancements in network hardware. This document specifies a new active message communications interface for these networks. Its primitives, in essence an instruction set for communications, map efficiently onto underlying network hardware and compose effectively into higher-level protocols and applications. For high-performance implementations, the interface enables direct application-network interface interactions. In the common case, for applications exhibiting locality in communication, these interactions bypass the operating system. To enable the construction of large-scale, general-purpose systems, the interface supports the protected multiprogramming of many users onto finite network resources. This document also describes a prototype system that uses the virtual-memory facilities of the Solaris operating system to implement virtual networks that sup port protected, network multiprogramming. The system caches the active communication endpoints in network-interface memory and demand-pages them between the host and network-interface memories.
Physically-Adaptive Computing via Introspection and Self-Optimization in Reconfigurable Systems

Digital electronic systems typically must compute precise and deterministic results, but in principle have flexibility in how they compute. Despite the potential flexibility, the overriding paradigm for more than 50 years has been based on fixed, non-adaptive integrated circuits. This one-size-fits-all approach is rapidly losing effectiveness now that technology is advancing into the nanoscale. Physical variation and uncertainty in component behavior are emerging as fundamental constraints and leading to increasingly sub-optimal fault rates, power consumption, chip costs, and lifetimes. This dissertation proposes methods of physically-adaptive computing (PAC), in which reconfigurable electronic systems sense and learn their own physical parameters and adapt with fine granularity in the field, leading to higher reliability and efficiency. We formulate the PAC problem and provide a conceptual framework built around two major themes: introspection and self-optimization. We investigate how systems can efficiently acquire useful information about their physical state and related parameters, and how systems can feasibly re-implement their designs on-the-fly using the information learned. We study the role not only of self-adaptation—where the above two tasks are performed by an adaptive system itself—but also of assisted adaptation using a remote server or peer. We introduce low-cost methods for sensing regional variations in a system, including a flexible, ultra-compact sensor that can be embedded in an application and implemented on field-programmable gate arrays (FPGAs). An array of such sensors, with only 1% total overhead, can be employed to gain useful information about circuit delays, voltage noise, and even leakage variations. We present complementary methods of regional self-optimization, such as finding a design alternative that best fits a given system region. We propose a novel approach to characterizing local, uncorrelated variations. Through in-system emulation of noise, previously hidden variations in transient fault susceptibility are uncovered. Correspondingly, we demonstrate practical methods of self-optimization, such as local re-placement, informed by the introspection data. Forms of physically-adaptive computing are strongly needed in areas such as communications infrastructure, data centers, and space systems. This dissertation contributes practical methods for improving PAC costs and benefits, and promotes a vision of resourceful, dependable digital systems at unimaginably-fine physical scales.
Influencing middle school girls to study computer science through educational computer games

The shortage of females in computer science has been studied before. Computer games have long been one way teenage boys find an interest in Computer Science, but most of those games are not appealing to teenage girls. This paper describes the ongoing collaborative research project which is experimenting with the design of educational computer games. Our research has the objective to influence middle school girls to pursue computer science in high school and college. The games are designed to change the image of computing among middle school girls, and to instill confidence by teaching real computer science concepts through puzzles. Gail Carmichael and her team of graduate students at Carleton University designed and created an educational computer game (Grams House) in 2010 with a "helping others" story. The prototype game focuses on two computer concept puzzles. In summer 2012, two undergraduates Jennifer Latham, and Nathaly Lozano, at Kean University designed and created a companion game (Grams Grocery Shop) with more teen appeal, and two more puzzles. In fall 2012 the Kean University research team piloted the game pair in an after school program at Roselle Park, a local middle school, using attitude surveys and concept quizzes to determine the impact of the games among the students. The pilot games were successful with the middle school students. After they had played the games, many of the girls said they could see themselves studying computer science, even though before the games, very few girls had included computer scientist as one of their two hoped for careers. Statistics gathered during the pilot indicate the need to continue this research, with more students in different demographics, and with more researcher collaboration, in order to design more adaptive games, to determine what specifically about the games influenced the girls the most, and to gain insight into how they were learning the computer concepts in the puzzles.
A Filter Co-ordination for Exploring Multi-Classification Sitemaps

Supporting the exploration of large web sites remainsa challenge. Visitors require site overviews to guide theirexploration. Text based search facilities tend to beunsatisfactory for exploration as they require specificinformation and typically return lists of pages where therelationship between these pages is not known. This paperpresents an interface that provides multiple overviews of aweb site. Each overview presents an independentclassification tree such as web page position, file type, filesize and last update date which also supports selection.Our interface combines the overview panels into a set ofcoordinated query filters. We present a new coordinationthat supports both flexible incremental querying guided byincremental overviews across the multiple classifications,and supports independent global overviews.