Miracle-dz/UniFAR-FTUs huggingface dataset:
IFWM and IXPM nonlinear effects suppression by using optical pulse position modulation

Infra-channel nonlinear effects of fiber optic system are studied by deploying pulse position modulation on a prespread fiber plus dispersion shift fiber and dispersion compensation fiber established single channel 100 Gb/s high-speed optical transmission system, where inter-pulse cross phase modulation and inter-bit four wave mixing are considered as main intra-channel nonlinear impairment of the transmission. Numerical study has shown that, the pulse crosstalk caused by intra-channel nonlinear effects is suppressed in terms of adopting pulse position modulation, in which the resonant of consecutive pulses is broken and inter pulse interaction is depressed by adding guard interval within the conventional transmitted return-to-zero Gaussian pulse sequence.
Compilers and compiler generators : an introduction with C++

Designed for computer science students studying for a second or final year course in compilers/programming language translation, this text manages to combine theory, practical applications and enough use of compiler writing tools to give students a solid introduction to the subject. The text provides enough theory to allow the reader insight into areas of programming language design and implementation - without overwhelming the student with too much maths. It also provides case studies of translators (which completes a small assembler compiler). The illustrations in the book concentrate on the use of C++, whilst limited object-oriented features are explained.
Review of Local Descriptor in RGB-D Object Recognition

The emergence of an RGB-D (Red-Green-Blue-Depth) sensor which is capable of providing depth and RGB images gives hope to the computer vision community. Moreover, the use of local features began to increase over the last few years and has shown impressive results, especially in the field of object recognition. This article attempts to provide a survey of the recent technical achievements in this area of research. We review the use of local descriptors as the feature representation which is extracted from RGB-D images, in instances and category-level object recognition. We also highlight the involvement of depth images and how they can be combined with RGB images in constructing a local descriptor. Three different approaches are used in involving depth images into compact feature representation, that is classical approach using distribution based, kernel-trick, and feature learning. In this article, we show that the involvement of depth data successfully improves the accuracy of object recognition.
Local Reasoning for Stateful Programs

Programs are called stateful when they manipulate the state of a computer explicitly, for example, by assignment. The main theme of the thesis is reasoning about stateful programs. In fact, for the past 30 years, significant efforts have been made for obtaining good reasoning principles to ensure that such programs work correctly. However, reasoning techniques developed so far often result in significantly more complex verification than an informal argument; consequently, they don't attract attention from real programmers. In the thesis, we develop O'Hearn's idea of local reasoning, which was recently proposed to overcome such complexity problem in reasoning. The key observation of local reasoning is that most programs show conceptual locality in their use of the store: even though a program is able to access all global variables and all heap data structures in principle, it usually uses only a few of them. Local reasoning uses such an observation to simplify verification: one starts reasoning about a program considering only the accessed portion of the store so as to obtain a “local” fact; then, a “global” fact is inferred simply by conjoining as an invariant a property that only involves the portion of the store not accessed by the program. In the thesis, we formulate a rule which allows one to derive a global property from a local one. The rule is an extension of O'Hearn's Frame Rule for programs with procedures. It uses a symmetric noninterference predicate and a spatial conjunction to ensure that a program phrase doesn't alter the portion of the store that a conjoined property depends on. We show completeness of the rule, which provides a sense that all properties can be inferred with the rule. We also study reasoning principles for the symmetric noninterference predicate and the spatial conjunction connective; reasoning about certain uses of the spatial conjunction connective is shown to be automated. The benefit of the formalism is illustrated with the verification of the Schorr-Waite graph marking algorithm.
Modified Apriori Algorithm For Predefind Support And Confidence In Cloud Computing Environment For Frequent Pattern Mining

Cloud computing has demonstrated that processing very large datasets over commodity clusters can be done by giving the right programming model. Cloud can be meant as an infrastructure that provides resources and/or service over the internet. A cloud can be a storage cloud that provides block or file based storage service or it can be a compute cloud that provides computational services. Data mining is the process of analyzing data from different perspectives and summarizing it into useful information. Mining association rules is one of the most important aspects in data mining. Association rules are dependency rules which predict occurrence of an item based on occurrences of other items. Apriori is the best-known algorithm to mine association rules. The Apriori algorithm had a major problem of multiple scans through the entire data. It required a lot of space and time. The modification in our paper suggests that we do not scan the whole database to count the support for every attribute. This is possible by keeping the count of minimum support and then comparing it with the support of every attribute. The support of an attribute is counted only till the time it reaches the minimum support value. using sector/sphere framework with association rules.
Type and Effect Systems for Dynamically Changing Code - DRAFT CORRECTIONS, DO NOT DISTRIBUTE

We extend type and effect analyses to permit dynamically changing effects and dynamically changing code in multi-threaded systems with shared resources. We guarantee that after a well typed modification a set of threads will have the specified desired effects and will continue to safely use the resources. We prove the key properties of subject reduction and fidelity (safety) for our general system. We provide an application of our system: dynamic software updating for a multi-threaded asynchronous message passing system. We show how key safety properties from session typing follow from the properties of our general system.
Dynamic mixture probabilistic PCA classifier modeling and application for fault classification

A dynamic classifier based on the mixture probabilistic principal component analyzer (MPPCA) is proposed for fault classification. Compared with traditional methods, both fault detection and diagnosis are combined into a single classification task. By introducing a state indicator, the conventional MPPCA model is first designed as a standard classifier. Then, the static MPPCA model based classifier is temporally extended to the dynamic form within the hidden Markov model framework. Both static and dynamic MPPCA classifiers are obtained by using the Expectation‐Maximization algorithm. For performance evaluation, case studies of the continuous stirred tank heater process and the Tennessee Eastman process are carried out. Results indicate that the dynamic MPPCA classifier performs better compared with the static MPPCA classifier and the hidden Markov model based classifier. Copyright © 2015 John Wiley & Sons, Ltd.
Automated fuzzy knowledge base generation and tuning

The authors present an approach to generating and tuning a knowledge base for fuzzy logic control (FLC) of an inverted pendulum. They used a modified self-organizing control procedure under typical FLC design choices with a very crude plant model to quickly converge on a rule base appropriate for the plant. A FLC using the derived rule base showed smaller percent overshoot and shorter settling time than a simple modern controller. The knowledge base was tuned by dynamically changing the controller gain according to a thresholding parameter. The best threshold/gain value was obtained by a gradient search algorithm driven by a step-response performance cost function. The same FLC using the tuned scaling factors exhibited critically damped step response. <<ETX>>
Measuring Risk Attitudes in a Natural Experiment: Data from the Television Game Show Lingo.

We use data from a television game show involving elementary lotteries as a natural experiment to measure risk attitudes. Unique features of our data set are the substantial monetary stakes and the large sample size. CRRA and CARA utility specifications perform approximately equally well. We find robust evidence of substantial risk aversion. Extensions of the basic model, which allow for a separate utility flow purely from playing the game or for decisions based on decision weights instead of actual probabilities, raise the estimated degree of risk aversion.
Information flow in relay networks

A centrifugating device for biological liquids, e.g. blood, in which a rotatable container carries a specially shaped seal that surrounds and bears on a fixed assembly with a minimum area of interface between the fixed and rotating parts. This seal is disposed outside the path of the liquid to be treated. The fixed assembly, in turn, is releasably carried by a bracket, the bracket being selectively longitudinally extensible as well as selectively adjustably swingable about a vertical axis of oscillation eccentric to the centrifuge, thereby to permit exact positioning of the fixed assembly coaxially of the rotatable container. The parts are so simple and inexpensive in construction that at least some of them can be used once and thrown away. Moreover, the fixed assembly is easily insertable in sealed relationship in any of a variety of containers, by the simplest of manual assembly and disassembly operations.
WWW Experiments for Economists, a Technical Introduction

In this document we sketch some techniques that are useful when developing www moderated experiments. We describe a modular and, hence, very flexible approach. On all levels (clients, server, programming language, database, etc.) we compare alternatives that can be integrated. We argue that a very wide range of experiments can be covered. There is no restriction to particular hardware, clients, operating systems, programming languages, etc. Laboratories from all over the world can be linked together with the help of the internet.
Information transfer protocols for the broadband ISDN

A refinement of the OSI (open systems interconnection) reference model for broadband ISDN (integrated services digital network) is presented which introduces several additional sublayers in the network layer and one additional sublayer in the link layer. The purpose of these sublayers is to enhance the performance of the network, especially availability, while at the same time reducing capital and operational costs. Central to this improved performance of the network is the concept of a virtual direct route, i.e. a virtual circuit connection between two nodes in the network which is used by one or more calls as though it were a direct route. One of the sublayers in the proposed broadband ISDN reference model corresponds to the transfer of packets on virtual direct routes. The other sublayers all relate to service protection, i.e. techniques for maintaining service in the presence of equipment failure. <<ETX>>
Cross-Language Information Retrieval and Evaluation: Workshop of Cross-Language Evaluation Forum, CLEF 2000, Lisbon, Portugal, September 21-22, 2000, Revised Papers

Evaluation for CLIR Systems. - CLIR Evaluation at TREC. - NTCIR Workshop : Japanese- and Chinese-English Cross-Lingual Information Retrieval and Multi-grade Relevance Judgments. - Language Resources in Cross-Language Text Retrieval: A CLEF Perspective. - The Domain-Specific Task of CLEF - Specific Evaluation Strategies in Cross-Language Information Retrieval. - Evaluating Interactive Cross-Language Information Retrieval: Document Selection. - New Challenges for Cross-Language Information Retrieval: Multimedia Data and the User Experience. - Research to Improve Cross-Language Retrieval - Position Paper for CLEF. - The CLEF-2000 Experiments. - CLEF 2000 - Overview of Results. - Translation Resources, Merging Strategies, and Relevance Feedback for Cross-Language Information Retrieval. - Cross-Language Retrieval for the CLEF Collections - Comparing Multiple Methods of Retrieval. - A Language-Independent Approach to European Text Retrieval. - Experiments with the Eurospider Retrieval System for CLEF 2000. - A Poor Man's Approach to CLEF. - Ambiguity Problem in Multiingual Information Retrieval. - The Use of NLP Techniques in CLIR. - CLEF Experiments at Maryland: Statistical Stemming and Backoff Translation. - Multilingual Information Retrieval Based on Parallel Texts from the Web. - Mercure at CLEF-1. - Bilingual Tests with Swedish, Finnish, and German Queries: Dealing with Morphology, Compound Words, and Query Structure. - A Simple Approach to the Spanish-English Bilingual Retrieval Task. - Cross-Language Information Retrieval Using Dutch Query Translation. - Bilingual Information Retrieval with HyREX and Internet Translation Services. - Sheffield University CLEF 2000 Submission - Bilingual Track: German to English. - West Group at CLEF 2000: Non-english Monolingual Retrieval. - ITC-irst at CLEF 2000: Italian Monolingual Track. - Automatic Language-Specific Stemming in Information Retrieval.
VLSI Mesh Routing Systems

Abstract : For message-passing concurrent computers with very few nodes, it is practical to use a full interconnection scheme between nodes A full interconnection of channels quickly becomes impractical as the number of nodes increases since each node of an N node machine must have N - 1 connections. A configuration used for larger message passing multicomputers such as the Caltech Cosmic Cube [Seitz 85] and its commercial descendants is that of a binary n-cube (or hypercube) to connect N = 2" nodes. Each node has n = log2N connections, and a message never has to travel through more than n channels to reach its destination.
Supervised Learning to Control Energetic Reasoning: A Feasibility Study

Propagation is a double-edged sword, with more pruning power coming at the price of larger computation time. For each problem constraint, the best propagator depends on the specific instance and may change at search time. We propose to use an oracle function, obtained via Machine Learning, to decide whether to run complex propagators for a target constraint. In this paper, we focus on investigating the feasi- bility of building an oracle for the Energetic Reasoning propagator used in scheduling. Our experiments show that high prediction accuracy can be obtained, provide suggestions for classification features, and highlight important issues to address when building such an oracle.
Developing Literacy in Second-Language Learners: Report of the National Literacy Panel on Language-Minority Children and Youth. Executive Summary.

Contents: P. McCardle, Foreword. Preface. Introduction to the Volume. D. August, T. Shanahan, Introduction and Methodology. D. August, Demographic Overview. Part I: Development of Literacy in Second-Language Learners. N. Lesaux, E. Geva, Synthesis: Development of Literacy in Language-Minority Students. N. Lesaux, with K. Koda, L.S. Siegel, T. Shanahan, Development of Literacy. E. Geva, Second-Language Oral Proficiency and Second-Language Literacy. Part I References. Part II: Cross-Linguistic Relationships in Second-Language Learners. F. Genesee, E. Geva, C. Dressler, M.L. Kamil, Synthesis: Cross-Linguistic Relationships. F. Genesee, E. Geva, Cross-Linguistic Relationships in Working Memory, Phonological Processes, and Oral Language. E. Geva, F. Genesee, First-Language Oral Proficiency and Second-Language Literacy. C. Dressler, with M.L. Kamil, First-and Second-Language Literacy. Part II References. Part III: Sociocultural Contexts and Literacy Development. C. Goldenberg, R.S. Rueda, D. August, Synthesis: Sociocultural Contexts and Literacy Development. C. Goldenberg, R.S. Rueda, D. August, Social and Cultural Influences on the Literacy Attainment of Language-Minority Children and Youth. R.S. Rueda, D. August, C. Goldenberg, The Social and Cultural Context in Which Children Acquire Literacy. Part III References. Part IV: Educating Language-Minority Students: Instructional Approaches and Professional Development. D. August, T. Shanahan, Synthesis: Instruction and Professional Development. D.J. Francis, N. Lesaux, D. August, Language of Instruction. T. Shanahan, I.L. Beck, Effective Literacy Teaching for English-Language Learners. D. August, with F. Erickson, Qualitative Studies of Classroom and School Practices. D. August, with L.S. Siegel, Literacy Instruction for Language-Minority Children in Special Education Settings. D. August, M. Calderon, Teacher Beliefs and Professional Development. Part IV References. Part V: Student Assessment. G.E. Garcia, G. McKoon, D. August, Synthesis: Language and Literacy Assessment. G.E. Garcia, G. McKoon, Language and Literacy Assessment of Language-Minority Students. Part V References. Part VI: Cross-Cutting Themes and Future Research Directions. C. Snow, Cross-Cutting Themes and Future Research Directions. Biographical Sketches.
of Retraction

—Energy consumption is one of the most important issues to the wireless sensor network, which determines the network lifetime. The non-uniform property of energy consumption is studied in this paper. Theoretical analysis indicates that the average energy consumption of the sensor is heavy non-uniform, which decrease with the hop number to the sink node (or the sensor belongs to the high level in a heterogeneous sensor network). In a wireless sensor network, the energy utilization rate is very low while the coeficient of energy waste is very high, which are monotone decreasing and increasing with the hop number to the sink node (or the sensor belongs to the high level in a heterogeneous sensor network) respectively. We concentrate on the energy consumption of the grid network and the random network which has uniform distribution. The definitions of eficient energy and residual energy of, energy utilization rate and energy waste coefficient of the sensor network are given. Then the relationship between the energy utilization rate and the maximal network hop number are analyzied in both grid sensor network and random uniform sensor network. When the hop number reaches 3, the residual energy is much larger than the energy used for sensing and transmitting the packet. As the random network is concerned, the energy wasted is much heavier than that in the grid network. For the purpose of energy conservation, a tuning transmission radii solution scheme is proposed. As an application, a semi-grid sensor network is constructed and a routing algorithm is designed. Compared result shows that this scheme can reduce the residual energy and prolong the network lifetime remarkably.
A DSP and FPGA based integrated controller development solutions for high performance electric drives

Modern drive control algorithms require advanced hardware and software platforms suitable for fast, efficient and reliable implementations. The development process includes in most cases the following engineering steps: off-line software simulations, hardware design and software implementation in a target system. This paper presents the general requirements connected with microprocessor-based digital control systems for drive control applications. An integrated and flexible hardware and software environment for electric drives control is described. The hardware part of the system includes flexible stand-alone boards and PC-cards set based on the digital signal processors (DSP) family and advanced field programmable gate arrays (FPGA). The flexibility of FPGAs provides multiprocessor and open architecture interface. The PC-based simulation environment offers hardware-in-the-loop options and extended data acquisition functions. After simulation and evaluation procedures the software structure of the controllers can be transfered into the stand-alone DSP board ready for commercial application. The proposed integrated system is very useful in the high-performance AC drives and double-fed machine controller designs. Currently, the project of the DSP controller for the voltage source inverter with the power range above 100 kW is under way in the Gdansk Branch of the Electrotechnical Institute. Several simulation and experimental results are presented and summarised.
Numerical Methods for Image Registration

1. Introduction 2. The Human Neuroscanning Project 3. The mathematical setting I PARAMETRIC IMAGE REGISTRATION 4. Landmark based registration 5. Principal axes based registration 6. Optimal linear registration 7. Summarizing parametric image registration II NON-PARAMETRIC IMAGE REGISTRATION 8. Non-parametric image registration 9. Elastic registration 10. Fluid registration 11. Diffusion registration 12. Curvature registration 13. Concluding remarks
Good-Turing Smoothing Without Tears

The performance of statistically based techniques for many tasks such as spelling correction, sense disambiguation, and translation is improved if one can estimate a probability for an object of interest which has not been seen before. Good-Turing methods are one means of estimating these probabilities for previously unseen objects. However, the use of Good-Turing methods requires a smoothing step which must smooth in regions of vastly different accuracy. Such smoothers are difficult to use, and may have hindered the use of Good-Turing methods in computational linguistics.
Neural redundant robotic trajectory optimization with diagnostic motor control

The joint commands of a simulated redundant PUMA robot and hand are allocated via a suggested command weight neural network for each DC motor. Three inputs of this network are diagnostic outputs of the neural network motor controller. Commands minimize time, energy expended, and error while attempting to reduce stress on motors experiencing extremes in loading, friction, or stiffness. This diagnostic control, combined with knowledge of a best vector of approach provided by an object grasp category network, enables the hand to attempt an accurate and stable first grasp of an object. <<ETX>>