Miracle-dz/UniFAR-FTUs huggingface dataset:
Automatic treebank annotation for the acquisition of LFG resources

Traditionally, rich, constraint-based grammatical resources have been hand-coded. Scaling wide-coverage, deep, constraint-based grammars such as Lexical-Functional Grammars from fragments to naturally occurring unrestricted text is knowledge-intensive, timeconsuming and (often prohibitively) expensive. Based on earlier work by McCarthy (2003), this thesis presents the development and evaluation of an automatic LFG f-structure annotation algorithm which is the core component in a larger project on rapid, wide-coverage, deep, constraint-based, multilingual grammar acquisition, addressing the knowledge acquisition bottleneck familiar from traditional rule-based approaches to NLP and AI. The algorithm annotates the Penn-II treebank with LFG f-structure information. Grammars and lexical resources are then extracted from the f-structure annotated treebank. Extensive evaluation of the annotation algorithm against independently constructed gold-standards (PARC 700 Dependency Bank and Propbank) shows the quality of the f-structures acquired. The methodology developed in this thesis has been deployed for multilingual, rapid grammar development: grammars and lexical resources for Mandarin Chinese were acquired from the Penn Chinese Treebank (CTB) using a generic version of the annotation algorithm, seeded with linguistic generalisations for Mandarin Chinese.
Channel Sounding with Software Defined Radio

Abstract: We present an investigation into the channel sounding of wireless communicationssystems using a Software Deﬁned Radio (SDR) platform. Using the UniversalSoftware Deﬁned Radio (USRP), in conjunction with the GNURadio SDR sys-tem, we implemented and evaluated channel sounding capabilities using a varietyof signal sequences. The ﬁnal implementation utilized the IEEE 802.11a Orthog-onal Frequency Division Multiplexing (OFDM) preamble for the tasks of carrierfrequency and timing estimation, as well as channel sounding. We show that thesystem is able to characterize 1.8 MHz of spectrum reliably, with a resolution of34 kHz. The bandwidth restrictions caused by the hardware bottlenecks were themain source of limitation.Keywords: Channel sounding, Software deﬁned radio, GNURadio, USRP 1 I NTRODUCTIONIn all mobile communication systems, it is essential totake into account the rapidly changing wireless environ-ment. An estimate of the channel impulse response (CIR)or transfer function (CTF) can be used to equalise its ef-fects at the receiver and to optimize transmission. The ti-tle given to the estimation of these characteristics is chan-nel sounding. Providing accurate channel state informa-tion (CSI) to the transmitter can further enhance the useof the channel, although some form of prediction may berequired to compensate for the latency in providing this in-formation. Multiple-Input Multiple-Output (MIMO) sys-tems particularly rely on reliable CSI, and some MIMOschemes require CSI at the transmitter.Modern communications systems are required to behighly adaptive, due to the changing conditions of thewireless environment. Parameters within a system thatmay be adapted include modulation, power allocation andcoding technique. Many functionalities, such as modula-tion, pulse shaping, constellation mapping and coding aretypically done in hardware. Such architectures lack theability to adapt during operation, and also complicate thetask of system re-design. Software deﬁned radio (SDR)offers a solution to a number of the issues described aboveby abstracting the tasks of constellation mapping, codingand pulse shaping from a hardware-based issue to a soft-ware one. This allows the engineer to change the spec-iﬁcations of a system by simply re-writing code, not bycreating a new piece of hardware.The aim of the research elucidated in this paper isto utilize these new devices and the powerful GNURa-dio framework to build a fully functional Single-InputSingle-Output (SISO) channel sounder, and also to inves-tigate the possibility of implementing a MIMO system.The ﬁnal SISO sounder is able to characterise 2 MHz ofunique bandwidth with a resolution of 38 kHz, utilizingthe IEEE 80211.a Orthogonal Frequency Division Multi-plexing (OFDM) preamble.
Algorithms for VLSI Circuit Optimization and GPU-Based Parallelization

Algorithms for VLSI Circuit Optimization and GPU-based Parallelization. (May 2010) Yifang Liu, B.S., Univ. of Elec. Science and Technology of China, China M.S., Univ. of Maryland, Baltimore County, USA Chair of Advisory Committee: Dr. Jiang Hu This research addresses some critical challenges in various problems of VLSI design automation, including sophisticated solution search on DAG topology, simultaneous multi-stage design optimization, optimization on multi-scenario and multi-core designs, and GPU-based parallel computing for runtime acceleration. Discrete optimization for VLSI design automation problems is often quite complex, due to the inconsistency and interference between solutions on reconvergent paths in directed acyclic graph (DAG). This research proposes a systematic solution search guided by a global view of the solution space. The key idea of the proposal is joint relaxation and restriction (JRR), which is similar in spirit to mathematical relaxation techniques, such as Lagrangian relaxation. Here, the relaxation and restriction together provides a global view, and iteratively improves the solution. Traditionally, circuit optimization is carried out in a sequence of separate optimization stages. The problem with sequential optimization is that the best solution in one stage may be worse for another. To overcome this difficulty, we take the approach of performing multiple optimization techniques simultaneously. By searching in the combined solution space of multiple optimization techniques, a broader view of the problem leads to the overall better optimization result. This research takes this approach on two problems, namely, simultaneous technology mapping and cell
Modeling Structural Priming as Implicit Learning

B. The governess poured the princess a cup of tea (Double Object) Syntactic or structural priming refers to the tendency for speakers to repeat the structure of previous utterances (Bock, 1986). For instance, speakers are more likely to describe the pictures shown in Figure 1 with the target sentences if they have previously said a sentence with the same structure (A) rather than an alternative structure (B). Introduction
Visually-guided haptic object recognition

Sensory capabilities are vital if a robot is to function autonomously in unknown or partially specified environments, if it is to carry out complex, roughly detailed tasks, and if it is to interact with and to learn from the world around it. Perception forms the all important interface between the cogitative organism and the world in which it must act and survive. Hence the first step toward intelligent, autonomous robots is to develop this interface--to provide robots with perceptual capabilities. This work presents a model for robotic perception. Within the framework of this model, we have developed a system which utilizes passive vision and active touch for the task of object categorization. The system is organized as a highly modularized, distributed hierarchy of domain specific and informationally encapsulated knowledge-based experts. The visual subsystem is passive and consists of a two-dimensional region analysis and a three-dimensional edge analysis. The haptic subsystem is active and consists of a set of modules which either execute exploratory procedures to extract information from the world or which combine information from lower level modules into more complex representations. We also address the issues of visually-guided haptic exploration and intersensory integration. Finally, we establish representational and reasoning paradigms for dealing with generic objects. Both representation and reasoning are feature-based. The representation includes both definitional information in the form of a hierarchy of frames and spatial/geometric information in the form of the spatial polyhedron.
Differential invariants without derivatives

Presents a new and more robust method of obtaining local projective and affine invariants. These shape descriptors are useful for object recognition because they eliminate the search for the unknown viewpoint. Being local, the invariants are much less sensitive to occlusion than the global ones used elsewhere. The basic ideas are: (i) employing an implicit curve representation without a curve parameter, thus increasing robustness; and (ii) using a canonical coordinate system which is defined by the intrinsic properties of the shape, regardless of any given coordinate system, and is thus invariant. Several configurations are treated including a general curve without any correspondence, and curves with known correspondence of feature points or lines. <<ETX>>
Inverse Wrappers for Legacy Information Systems Migrat ion

The paper studies some problems that arise when a technology change induces the migration of a data-centered application. In particular, it addresses the difficult problem of migrating application programs from a legacy data manager, such as a COBOL file system, to a modern DBMS, such as a relational database management system. The approach suggested in this paper relies on the concept of inverse wrappers, that is, wrappers that simulate the legacy API on top of the new database. This architecture allows (1) the design of a fully normalized database rid of the anomalies of the legacy data, (2) future programs to be developed on a sound basis and (3) legacy programs to work on the new database with minimum transformation, and therefore at low cost. The paper describes the components of this architecture, a methodology to design them and a CASE tool that automates their generation.
Analysis of a man-in-the-middle attack on the Diffie-Hellman key exchange protocol

Abstract : The ability to distribute cryptographic keys securely has been a challenge for centuries. The Diffie-Hellman key exchange protocol was the first practical solution to the key exchange dilemma. The Diffie-Hellman protocol allows two parties to exchange a secret key over unsecured communication channels without meeting in advance. The secret key can then be used in a symmetric encryption application, and the two parties can communicate securely. However, if the key exchange takes place in certain mathematical environments, the exchange becomes vulnerable to a specific man-in-the-middle attack, first observed by Vanstone. We explore this man-in-the-middle attack, analyze countermeasures against the attack, and extend the attack to the multi-party setting.
Connectionist Symbol Processing

BoltzCONS - dynamic symbol structures in a connectionist network, D.S. Touretzky mapping part-whole hierarchies into connectionist networks, G. E. Hinton recursive distributed representations, J.B. Pollack mundane reasoning by settling on a plausible model, M. Derthick tensor product variable binding and the representation of symbolic structures in connectionist systems, P. Smolensky learning and applying contextual constraints in sentence comprehension, M.F. St. John and J.L. McClelland.
A subliminal channel in codes for authentication without secrecy

G.J. Simmons has advanced the concept of using authentication in an open channel to actually convey information. We review the use of the knapsack problem for public codes and explore the use of Shamir's method for a signature only knapsack to convey messages. Disciplines Physical Sciences and Mathematics Publication Details Seberry, J, A subliminal channel in codes for authentication without secrecy, Ars Combinatoria, 19A, 1985, 37-41. This journal article is available at Research Online: http://ro.uow. edu.au/infopapers/1018 A SUBLIMINAL CHANNEL IN CODES FOR AUTHENTICATION WITHOUT SECRECY Jennifer Seberry* Department of Computer Science University of Sydney N.S. W. 2006 Abstract G.J. Simmons has advanced the concept of using authentication in an open channel to actually convey information. We review the use of the knapsack problem for public codes and explore the use of Shamir's method for a signature only knapsack to convey messages.G.J. Simmons has advanced the concept of using authentication in an open channel to actually convey information. We review the use of the knapsack problem for public codes and explore the use of Shamir's method for a signature only knapsack to convey messages. Introduction Simmons describes subverting authentication to carry secret information when the message-signature pair (M, C) is transported by a neutral or hostile medium on an open channel. Simmons describes how a warden might pennit a trustee (or say the Red Cross) to carry an open communication between X and Y in the hope that he can deceive at least one into accepting as a genuine communication (a) a fraudulent message created by the warden, or (b) a modification of a genuine message. X and Y accept the use of an open channel and a potentially hostile transporter in order to have any communication at all but insist on a signature or authentication attached to the communication. The model can be described by the following diagram. Initiator , Receiver sends checks message OPEN CHANNEL signature (data link, telephone, telex, with signature trustee, third person) given public key As Simmons notes, there can be many valid signatures for one message, and if the signature space can be partitioned. information can be conveyed by the choice of signature. *This research was supported by grants from the ACRB and the ARGS. ARS COMBINATORIA, Vol. 19A (1985), pp.37-41 MeSSage~""'~=====: -:. ~~~
Optimal Frame Synchronization for Continuous and Packet Data Transmission

In this work the problem of frame synchronization is tackled from the standpoint of optimal detection theory for a multitude of scenarios. For continuous data transmission the optimal synchronizers for differential detection, flat fading channels and coded data are derived. Where too complex, the synchronizers are approximated by close­to­optimal and technically realizable ones. The performance of the synchronizers was analysed by simulation and analysis (for binary phase shift keying over a Gaussian channel) and it was shown that using the primitive correlation rule and neglecting channel state and coding information yields markedly inferior correct synchronization rates. For preamble­less packet data transmission the importance of powerful frame synchronization is even more pronounced due to the one shot nature of acquisition. Here, the new synchronizers result in significant increases in possible data throughput through reduction of the pertinent sync word lengths. Simulations are confirmed by analysis, the latter allowing the design of new ­and more efficient­ sync words for use in packet transmission.
Domain and genre in sublanguage text: definitional microtexts in three corpora

In this paper we outline a shallow grammar of definitions as they occur in technical and scientific texts. We show how visual clues, typography and layout, interact with lexical and syntactic clues to signal a definitional text. Whilst starting from the hypothesis that domain and genre have an impact on the grammar of definitions, we also expect to find stable features, which would make the retrieval of definitions possible in new domains. We illustrate this approach with a comparative study on three texts whic differ in terms of domain and genre and we show how it is possible to identify some constraints on variations in the formulation of definitional texts.
Sensing and predicting the pulse of the city through shared bicycling

City-wide urban infrastructures are increasingly reliant on network technology to improve and expand their services. As a side effect of this digitalization, large amounts of data can be sensed and analyzed to uncover patterns of human behavior. In this paper, we focus on the digital footprints from one type of emerging urban infrastructure: shared bicycling systems. We provide a spatiotemporal analysis of 13 weeks of bicycle station usage from Barcelona's shared bicycling system, called Bicing. We apply clustering techniques to identify shared behaviors across stations and show how these behaviors relate to location, neighborhood, and time of day. We then compare experimental results from four predictive models of near-term station usage. Finally, we analyze the impact of factors such as time of day and station activity in the prediction capabilities of the algorithms.
The Use of Learning Object in 3D Character Modeling Lesson: A Perception Study Among Digital Arts Student

Currently learning object leads education worlds with the instructional technology towards more effective instructional design, development and delivery of learning content. It has brought new paradigms in the way people teach and learn. The focus of this research is to conduct a perception study among digital arts students of Polythenic Tuanku Syed Sirajuddin (PTSS), Perlis towards the use of learning object in 3D Character Modeling lesson. The purpose of this application is to help student as guidance for them to do and finish their assessment and also to enhance and improve their 3D skills. Methodology of Design Research (GMDR) by Vaishnavi and Kuechler (2004) was used to develop and evaluate the application. An evaluation on the acceptance and learn ability of the application among the students carried out. At the end of this study, the potential use of learning object in 3D Character Modeling in the teaching and learning process can be made.
Efficient algorithms for computing transitive closure in CWB : Implementation and comparison of several variations

This paper presents a thesis work for the M. Sc degree in Computer Science at the University of Stockholm. Abstract: The work was accomplished at the Swedish Institute of Computer Science (SICS) during autumn and winter 1989-1990. Bjorn Lisper was supervisor at SICS and Yngve Sundblad at NADA/KTH. The task was to implement an efficient algorithm for computing the transitive closure of binary relations in the Concurrency Workbench (CWB). The CWB is a system that caters for the analysis of concurrent processes expressed in CCS. It was developed at the University of Edinburgh. Further development has and is being carried out both at Edinburgh, the University of Sussex and SICS. The system is written in Standard ML. I have studied a number of transitive closure algorithms. An algorithm by J. Eve and R. Kurki-Suonio seemed to be the most efficient. Two versions of this and of the classical Warhall algorithm have been implemented. One version use array representation and one version uses list representation.
Evaluación de la calidad de la fruta bomba (Carica papaya L.) variedad Maradol roja deshidratada utilizando el método de deshidratación osmótica (DO)

La deshidratacion es uno de los metodos mas utilizados para la conservacion de frutas y vegetales, mediante su uso se logra extender los periodos de almacenamiento preservando siempre la calidad de los productos. El presente trabajo tiene como objetivo evaluar la calidad de la fruta bomba (Carica papaya L.) variedad Maradol roja como fruta fresca y despues de ser sometida a un proceso de deshidratacion osmotica (DO). Durante el analisis se determino a las frutas frescas: masa, firmeza, talla, pH y contenido de solidos solubles (SSC), posteriormente las frutas fueron troceadas en piezas de 1 x 5 ± 2 cm para ser sometidas a un tratamiento de DO a 60 °C durante un tiempo de 4 horas. Ademas, se determinaron los valores de masa y firmeza de las piezas de frutas antes y despues de deshidratadas para determinar la perdida de peso y la variacion de la firmeza durante el proceso. Como principales resultados se obtuvo que el producto deshidratado por DO experimenta una perdida de peso y una variacion de firmeza de 65,6% y 82,09% respectivamente. Los indicadores economicos refieren que el proceso de DO asciende al monto de 15.21 pesos para una masa total de 439,3 g, un nivel de aceptacion de 98% y un periodo de conservacion de 90 dias.
Estimation du regard avec une caméra RGB-D dans des environnements utilisateur non-contraints

Dans ce travail, nous avons aborde le probleme d’estimation automatique du regard dans des environnements utilisateur sans contraintes. Ce travail s’inscrit dans la vision par ordinateur appliquee a l’analyse automatique du comportement humain. Plusieurs solutions industrielles sont aujourd’hui commercialisees et donnent des estimations precises du regard. Certaines ont des specifications materielles tres complexes (des cameras embarquees sur un casque ou sur des lunettes qui filment le mouvement des yeux) et presentent un niveau d’intrusivite important, ces solutions sont souvent non accessible au grand public. Cette these vise a produire un systeme d’estimation automatique du regard capable d’augmenter la liberte du mouvement de l’utilisateur par rapport a la camera (mouvement de la tete, distance utilisateur-capteur), et de reduire la complexite du systeme en utilisant des capteurs relativement simples et accessibles au grand public. Dans ce travail, nous avons explore plusieurs paradigmes utilises par les systemes d’estimation automatique du regard. Dans un premier temps, Nous avons mis au point deux systemes bases sur deux approches classiques: le premier base caracteristiques et le deuxieme base semi apparence. L’inconvenient majeur de ces paradigmes reside dans la conception des systemes d'estimation du regard qui supposent une independance totale entre l'image d'apparence des yeux et la pose de la tete. Pour corriger cette limitation, Nous avons converge vers un nouveau paradigme qui unifie les deux blocs precedents en construisant un espace regard global, nous avons explore deux directions en utilisant des donnees reelles et synthetiques respectivement.
AJATO: an AspectJ Assessment Tool

Aspect-oriented software development [3] is an emerging paradigm that provides new mechanisms to support the modularization of concerns, which otherwise would crosscut the OO system decomposition. However, the accurate identification of concerns to be aspectized is far from being trivial [2, 4], and it requires a systematic design assessment and reasoning about multiple modularity principles [2]. Even the aspectization of certain tangled and scattered concerns can negatively affect fundamental software attributes, such as coupling, cohesion, and conciseness [2, 4]. In this context, this paper presents an assessment tool, called AJATO [5], to support the quantitative assessment of AO software artefacts. The goals of the tool are: (i) to compute existing AO metrics, and (ii) to support the application of a heuristics suite. Most of the AO metrics available in our tool are based on traditional metrics, such as lines of code, and on extensions of those widely used with object-oriented design, such as the Chidamber and Kemerer metrics. Besides, the metrics suite also encompasses new metrics for measuring separation of concerns [4]. Some of the metrics available in AJATO are Concern Diffusion over Components (CDC), Number of Attributes per Concern (NOAconcern), Number of Operations per Concern (NOOconcern), Vocabulary Size (VS), Number of Attributes (NOA), and Number of Operations (NOO). In addition to the metrics, our assessment tool also implements some heuristics rules in order to automate some modularity analysis about the numbers. For example, the set of heuristics provides contextual information on how the realization of a given concern satisfies other software engineering attributes, such as coupling, cohesion, and size. It also supports the automatic generation of warnings when certain design principles, such as narrow interfaces and high cohesion, are violated. Table 1 presents some of these rules associated to separation of concerns. The investigated heuristics have been derived from our long-term experience on assessing aspect-oriented design and implementation [2, 4]. AJATO also supports the association of application-specific thresholds with the metrics and heuristics.