Miracle-dz/UniFAR-FTUs huggingface dataset:
Proceedings of the ACL-SIGLEX Workshop on Deep Lexical Acquisition

This volume contains the papers accepted for presentation at the ACL-SIGLEX 2005 Workshop on Deep Lexical Acquisition, held at the University of Michigan, Ann Arbor, USA, on the 30th of June, 2005. This workshop is supported by SIGLEX, the Special Interest Group on the Lexicon of the Association for Computational Linguistics (http://www.clres.com/siglex.html). Its goal is to bring together researchers interested in different facets of the automatic acquisition of deep lexical information, e.g. in the areas of computational grammars, computational lexicography, machine translation, information retrieval, question-answering, and text mining. Deep lexical resources include lexicons for linguistically-precise grammars, template sets for information extraction systems, and ontologies for word sense disambiguation. Such resources are critical for enhancing the performance of systems and for improving their portability between domains. Most deep lexical resources in current use have been developed manually by lexicographers at considerable cost, and yet have limited coverage and require labour-intensive porting to new tasks. Automatic lexical acquisition is a more promising and cost-effective approach to take, and is increasingly viable given recent advances in NLP and machine learning technology, and corpus availability. However, a number of important challenges still need addressing before benefits can be reaped in practical language engineering, such as the (multilingual) acquisition of deep lexical information from corpora and the implementation of accurate, large-scale, portable acquisition techniques.
The homotopy method applied to the symmetric eigenproblem

1995 v Acknowledgements It is my strong desire to thank all the people who have supported the present work. Above all, I am indebted to Prof. W. Gander, my supervisor, for giving me the freedom to explore new ideas and for providing a good productive environment. His algorithmic spirit and his appreciation for numerical details has become for me an ideal to strive for. Also his conndence in the ultimate success of our work was very encouraging. I thank Dr. P. Arbenz, co-examiner, who initiated me into the eld of the algebraic eigenvalue problem and who has originated the subject of this thesis. I had many fruitful discussions with him. Special thanks goes to Prof. R. Jeltsch who spontaneously accepted to be co-examiner. My thank also goes to Prof. T. Y. Li who invited me to Michigan State University in spring 1994. He gave me valuable insight into his research on the homotopy method. I am grateful to the numerous people in the Institute for Scientiic Computing who have helped me by frequent discussions held in an open and stimulating atmosphere. To my mother, who has always supported me, I would like to dedicate this thesis. vi Abstract Abstract The homotopy method has been used in the past for nding zeros of nonlinear functions. Recently this method has been given new attention and it is being used for the computation of matrix eigenvalues and eigenvectors because of its natural parallelism. Early algorithms based on the homotopy approach for solving the symmetric eigen-problem suuer either from insuucient orthogonality between computed eigenvalues or low eeciency. A new algorithm presented in this thesis overcomes these problems by using deeation of close eigenpairs and maintains a high degree of parallelism by applying the divide-and-conquer principle. The selection of appropriate starting matrices is discussed too. A numerical comparison of a sequential implementation of the new algorithm shows that it is competitive with other well-established algorithms both in speed and accuracy. Algorithms based on the homotopy method are excellent candidates for multicom-puters, because of there natural parallelism. It is examined in this thesis how the algorithm can be implemented on distributed-memory multicomputer. The experimental performance results obtained on an Intel Paragon are very satisfying.
Modulo de generación de reportes graficos de una honeynet a partir de los logs tcpdumps

Nowadays, computer networks connected to the Internet continue to be compromised and exploited by hackers. This is in spite of the fact that many networks run some type of security mechanism at their connection to the Internet. Large enterprise networks, such as the network for a major university, are very inviting targets to hackers who are looking to exploit them. In the market there are several tools that help the analysis, which could be a possible network attack, but despite of that these tools are available both for free and as owner, they fail in the analysis of large amounts of information (in the order of GBs and TBs). This paper describes a tool for scalable and distributed processing logs of network traffic (pcap format) and the generation of graphical reports from these logs, so that these reports can be used as part of computer forensics processes. |
A linear operational transconductance amplifier with automatic offset cancellation and transconductance calibration

Operational Transconductance Amplifiers (OTA's) with linear input-output characteristics have become the focus of attention as a fundamental building block for analogue time-continuous circuits. Especially they are used in filters and instrumentation amplifiers with high cutoff- or corner frequencies. This paper describes a simple CMOS circuit technique for realizing a precision linear amplifier using the square-law function of MOS transistors. The linear input-output characteristic is not influenced by the MOS threshold voltage dependence on the source-bulk voltage or other effects. To eliminate the remaining imperfections the new proposed technique combines analogue time-continuous and time-discrete circuitry. By the use of two adjustment phases, the offset can be suppressed effectively and the transconductance can be put back or newly defined in a given range. In a third phase the OTA works along with further time-continuous circuits. The proposed circuitry can be implemented with a double or a single-ended output stage. Due to symmetrical internal signal paths, the best results in terms of linearity, PSRR and CMRR are obtained in combination with a double-ended output stage.
MapReduce with Deltas

The MapReduce programming model is extended slightly in order to use deltas. Because many MapReduce jobs are being re-executed over slightly changing input, processing only those changes promises significant improvements. Reduced execution time allows for more frequent execution of tasks, yielding more up-to-date results in practical applications. In the context of compound MapReduce jobs, benefits even add up over the individual jobs, as each job gains from processing less input data. The individual steps necessary in working with deltas are being analyzed and examined for efficiency. Several use cases have been implemented and tested on top of Hadoop. The correctness of the extended programming model relies on a simple correctness criterion.
Process Mining for Contextual Situations Adaptation using Goal-Heuristic Algorithm

For surviving in their complex and dynamic environments, organizations should be adaptable and interoperable with these environments. However, there is a limit for distinguishing the range of occurrence and the level of severity in regard to the new external problems occurring in a complicated environment. In addition, they lack system servitization for dynamic business model processing and system integration. Therefore, a study upon the handling of service requirements by users, which could occur dynamically, needs a new concept of process mining to redesign a process to fit adaptation measure after analyzing the scope of problem recognition to change. The existing studies of process mining have been aimed to extract the information of redesigning business process at the level of simple field of database; examine dependency relation; and create a complete process model. Therefore, they lack in ways to analyze and evaluate business process of new requirements for external situations and solve the problems of dynamic reconfiguration. In this respect, the present study is aimed to analyze goal scenario so as to provide the service requirements of new scenarios that occurs dynamically and propose the process mining method that uses goal heuristic algorithm to analyze and evaluate process variable information. When a new requirement comes out, business process changes by goal on the basis of context information and searches a fit process model from existing goal scenarios and new goal scenario by goal heuristic algorithm. And then the similarity, importance, association of the process models are evaluated and analyzed for the purpose. The information analyzed in this way is capable of finding out problems resulting from change in requirements when necessary, determining the needs of adaptation and reconfiguring to keep providing services.
Psychometric Properties of the Greek Version of the Feelings Toward Group Work Questionnaire

The present study examined the psychometric properties (factor structure, internal and test-retest reliability, convergent and criterion-related validity, social desirability effect, and experimental validity) of the Greek version of the Feelings Toward Group Work questionnaire. Results from exploratory and confirmatory factor analyses showed a clear three-factor structure, identical with the English version. Also, the results showed adequate internal and test-retest reliability, predicted correlations with self- and peer ratings of the Multisource Assessment of Children Social Competence, nonsignificant correlations with Social Desirability Scale, and significant pre- and posttest differences from the application of a cooperative learning program. Overall, the results showed that the Greek version of the scale is a valid and reliable instrument that can be used for research in cooperative learning with Greek samples.
A Use of Time Series in Improving Weather Forecasting

Abstract : Given the assumption that weather can be predicted more effectively by integrating the dynamic equations(s) than by examining trends, the question investigated here is whether time series can be used in the secondary routine to effect improvement. The method is described, the relevant equations are derived, a program using real meteorological data is made and run, and a measure of effectiveness is given. Limited study shows some definite promise. (Author)
Speech physiology, speech perception, and acoustic phonetics: Basic acoustics

List of Figures Preface Acknowledgements 1. Introduction 2. A qualitative introduction to the physiology of speech 3. Basic acoustics 4. Source-filter theory of speech production 5. Speech analysis 6. Anatomy and physiology of speech production 7. Speech perception 8. Phonetic theories 9. Some current topics in speech research 10. Acoustic correlates of speech sounds Bibliography Index.
Analysis of cochannel interference in angle modulation systems

To increase the channel capacity of cellular mobile radio systems, the cell size is decreased to enable greater frequency reuse. Consequently, as the cell size is decreased, cochannel interference (CCI) becomes a dominant impairment in system performance rather than additive white Gaussian noise (AWGN). Thus, precise CCI models are important in the analysis of such systems. This paper presents an exact CCI model for angle modulation systems. The model is valid for digital binary and M-ary modulations as well as analogue modulations in slow Rayleigh fading.
Updating logical databases

Acknowledgments 1. Introduction 2. Classes of update semantics 3. Model-based semantics for updates 4. Update algorithms for model-based semantics 5. Updates with variables 6. Lazy evolution of updates 7. Integrity constraints 8. Adding knowledge to relational theories 9. Implementation Bibliography Index of definitions.
CPW‐Fed Arbitrary Frequency‐Switchable Antenna Using CRLH Transmission Line

A novel frequency‐switchable antenna that uses PIN diodes and a composite right‐ and left‐handed transmission line (CRLH TL) is proposed. The CRLH TL provides multi‐order resonance, including a zeroth‐order resonance (ZOR), and its shunt stub determines the ZOR frequency. Thus, the resonant frequency is arbitrarily chosen by lumped chip inductors on the shunt stub. Two prototypes are designed using different chip inductors while maintaining the antenna geometries. Antenna #1 can switch the resonant frequency from 1.8 GHz to 2.3 GHz. Antenna #2 can switch its resonance from 0.9 GHz to 2.3 GHz.
Prefetching for the Kilo-Instruction Processor

The large latency of memory accesses in modern computer systems is a key obstacle to achieving high processor utilization. Techniques to reduce or tolerate large memory latencies become essential for achieving high processor utilization. Prefetch is one of the most widely studied mechanisms at literature. This mechanism predicts the future effective addresses of loads to bring in advance their data to the upper and faster levels of the memory hierarchy. Another technique to alleviate the memory gap is the out-of-order commit, implemented in the Kilo-Instruction processors. This technique is based on the fact that independent instructions of a delinquent load can be executed even if the data for that load is not still available. The goal of this thesis project is to study a stride prefetching mechanism built on top of a Kilo-Instruction processor. I implemented the stride prefetching mechanism on SimpleScalar 3.0 and evaluate several sets of prefetch parameters by simulating them in a Kilo-instruction processor environment using the SPEC2000 benchmarks. The results show that the prefetching scheme effectively eliminates a major portion of data access penalty for a uniprocessor environment but provides less than 15% speedup improvement when applied to the Kilo-Instruction processor.
Collaboration Framework based on Social Semantic Web for Cloud Systems

Cloud services are used for improving business. Moreover, customer relationship management(CRM) approaches use social networking as tools to enhance services to customers. However, most cloud systems do not support the semantic structures, and because of this, vital information from social network sites is still hard to process and use for business strategy. This paper proposes a collaboration framework based on social semantic web for cloud system. The proposed framework consists of components to support social semantic web to provide an efficient collaboration system for cloud consumers and service providers. The knowledge acquisition module extracts rules from data gathered by social agents and t hese rules are used for collaboration and business strategy. This paper showed the implementations of processing of social network site data in the proposed semantic model and pattern extraction which was used for the virtual grouping of cloud service providers for efficient collaboration.
Upgrading and Repairing PCs

From the Publisher: Upgrading and Repairing PCs, Fifth Edition, is the most comprehensive PC support reference available. Discover the best way to assess your system, install hardware, and troubleshoot problems. Learn about the latest state-of-the-art motherboards, processors, memory, and disk drives. This book addresses all PC-compatible systems, from notebooks to towers, as well as Windows 95 and the new Plug and Play standard - providing the most complete and up-to-date technical reference available. This book contains everything you need to know. You'll find detailed information and specifications for every component in your PC, including major peripherals. Special sections detail system capabilities and upgrade options, and troubleshooting tips help you identify and solve problems.
Spreadsheet Applications in Chemistry Using Microsoft Excel

From the Publisher: This book illustrates how EXCEL can be used to help scientists process, analyze, and present scientific data. EXCEL provides a flexible environment that can be used to prepare spreadsheet solutions for scientific data processing problems. It demonstrates step-by-step how to program EXCEL to perform appropriate tasks, automate repetitive data processing tasks, and prepare integrated documents by transferring data and graphics. It covers problems such as how to perform linear regression and use the built-in statistical tools of EXCEL, as well as addressing advanced topics such as graphing complex equations, model building and the use of VBA and macros for user interface. Though the examples emphasize chemical applications, the information provided will prove useful to all scientists.
A source-channel coding study of ARQ for the transmission of images

We investigate the transmission of images over a noisy channel using an ARQ scheme. The images are compressed using the JPEG standard. The error control coding is provided by BCH codes. The ARQ mechanism is selective repeat ARQ. The error control decoding is bounded distance decoding. We look at three figures of merit: the overall distortion, the throughput, and the delay. We can vary three parameters: the source coding rate, the error control coding rate, and the radius of the error control decoder. We try to find the parameter combination that yields the best figure of merit, or combination of figures of merit.
Structured Electronic Design: High-Performance Harmonic Oscillators and Bandgap References

Preface. Acknowledgements. 1. Introduction. 2. Structured electronic design. 3. Low-voltage low-power design. 4. Amplifiers. 5. Harmonic oscillators. 6. Bandgap references. 7. Conclusions. 8. Summary. A. Minimum voltage required for feedback amplifiers. B. Design example: class-AB amplifier. C. The Effective Q versus the phase shift. D. Design example: second-order compensated BGR. E. Optimum ratio of saturation currents. F. Design example: first-order compensated BGR. Index.
Dynamic organization of active video multicast in heterogeneous environment

In this paper, we introduce active network technologies to a video multicast system that can satisfy heterogeneous client requests in an efficient and effective way We employ active nodes that adapt incoming video streams at the user's request by using transcoders or filters and then dynamically reorganize multicast sessions to accommodate clients. Simulation experiments demonstrate that our methods can appropriately split, merge, and move multicast groups to handle client-to-client heterogeneity.
Secret-key and identification rates for biometric identification systems with protected templates

In this paper we consider secret generation in biometric identification systems with protected templates. This problem is closely related to the study of the bio metric identification capacity [Willems et al., 2003] and [O’Sullivan and Sclmmid, 2002] and the common randomness generation scheme [Ahlswede and Csiszar. 1993]. In our system two terminals observe biometric enrollment and identifi cation sequences of a number of individuals. It is the goal of these terminals to form a common secret for the sequences that belong to the same individual by interchanging public (helper) messages for all individuals in such a way that the information leakage about the secrets from these helper messages is negli gible. Moreover, based on the helper data produced by the first terminal, the second terminal has to establish tIme identity of the individual who presented his biometric sequence.
A Knowledge Based Threat Analysis in Trustworthy Software Engineering

In recent years, the security of software becomes one significant feature of software. This paper improves trustworthy software engineering through a knowledge based expert system. We propose the knowledge collection and organization method, and threats analyzing algorithm in detail which are the kernel of the expert system. The software threat information is divided into threat state and exploit, and stored in the knowledge database together with the state production and exploit production representing the relationships between threat state and exploit. The threat analysis calculates the threat degree quantitatively of an application based on this knowledge in a formal way and give security advice to mitigate threats. Our method can reduce the work of an experienced security expert which is time consuming and economic costly, therefore popularizes the trustworthy software engineering.
Ontologia: o termo e a idéia 10.5007/1518-2924.2007v12n24p172

Aborda o conceito de Ontologia e relaciona alguns problemas que motivam os pesquisadores desta area. Contextualiza a sobrecarga informacional em virtude do crescente volume de texto eletronico armazenado em bases de dados, em especial na Web, e sua implicacao na manutencao do fluxo da informacao. Alem disso, introduz a ideia da Web Semântica como uma solucao para a organizacao dos conteudos das paginas nos sitios da Web e o papel preponderante das ontologias, dentro deste contexto, que auxiliam a automatizacao da interpretacao destes conteudos e otimiza a recuperacao da informacao.
Towards a Universal Language for Combinatorial Auctions

A type of auctions that allows bidding on packages, or combinations, is called a combinatorial auction. One reason combinatorial auctions are challenging to implement is that the bidder determination problem is computationally difficult (NP-hard). The second reason is that a if a mechanism is to be useful in practice, a language for expressing bidder valuations has to be relatively simple and the process of bid creation itself should be straightforward. In this paper we present a general formulation of the winner determination problem as an integer program and describe a bidding language capable of expressing a large variety of valuations. The winner determination is done through an SQL-based interface between a database and an algebraic modeling language, making it quick to develop, easy to modify and flexible to implement.