Miracle-dz/UniFAR-FTUs huggingface dataset:
Model Monitor User’s Guide version 1.0

Model Monitor (M) is a software tool for studying the effect of distribution shifts the performance of machine learning algorithms. Most practical work in data mining assumes that data distributions are stationary, which is to say they do not change over time. As such, classifiers tend to be most effective when the data on which they are evaluated (test data) is similar to the data on which the model was built (training data). In real life, however, shifts in distribution do occur, and a model that is robust to changes in distribution will be significantly more valuable in the long run than one which is not. With this fact in mind, we designed Model Monitor around two basic tasks. First, it can be used to determine whether a distribution shift has occurred. Given separate train and test datasets (or a single dataset with a train-test split), Model Monitor will test each individual attribute of the dataset for distribution shift, using methods from [2], and report any features that have changed. Second, Model Monitor can evaluate the robustness of a particular classifier to certain types of distribution shift. Using any commandline classifier, or a classifier from the WEKA machine learning environment, Model Monitor will run the classifier and report its performance under any one of a number of chosen performance measures or loss measures. In this way, researchers can better design classifiers that are resistant to distribution shifts, or practitioners can choose a model that performs well under an anticipated set of future conditions.
HYBRID COHERENT ANTI-STOKES RAMAN SCATTERING FOR KHZ-RATE TEMPERATURE AND SPECIES MEASUREMENTS IN COMBUSTING FLOWS

Introduction In an effort to reduce pollutant emissions and increase energy efficiency, current clean combustion devices rely on precise control of reaction parameters such as fuel injection rate and reactant mixing. In order to understand, and predict, the effect of these parameters on the overall combustion process, temporallyand spatially-resolved measurements of key thermodynamic properties are required. Although traditional intrusive instrumentation has been used for many years, novel laser-based probes have recently become important tools in combustion research due to their accuracy and non-invasive application [1]. Chief among these is coherent anti-Stokes Raman scattering (CARS) spectroscopy which has been used for accurate temperature and species measurements, on which the reaction kinetics are highly dependent [2].
AMR TO G.729A SPEECH TRANSCODING WITH FAST CODEBOOK SEARCH

Speech transcoding scheme is needed in the voice system over internet. Full decoding technique is an intuitive and traditional speech transcoding method, but it requires high computational complexity and long processing time. In this paper, we propose a partial decoding technique with fast codebook search, which utilizes the pulse replacement method, on ACELP coding architecture. There is no need to redo all the decoding and encoding processes. Partial decoding method can be directly applied to ACELP based speech coding, such as AMR[1] and G.729A[2] speech standards. The proposed method decodes the parameters from the input bit-stream, which includes line-spectral pair (LSP), pitch delay, fixed codevector and codebook gain. It achieves excellent voice quality as the full decoding method does while it only requires 7.2% computation loading calculated byclockticks per frame. In this paper, we propose a partial decoding technique with fast codebook search, which utilizes the pulse replacement method, and describe its working procedure in Section 2. In Section 3, we use C simulation to demonstrate the quality measurement of our proposed approach. Finally, Section 4 concludes the paper. Keyword : speech transcoding, AMR, G.729A, ACELP Figure 1. Integration of 3GPP and IP network 2. PROPOSED TRANSCODING SCHEME FROM AMR TO G.729A Figure 2. Two speech transcoding schemes (a) Full decoding (b) Partial decoding To translate one frame from AMR to G.729A, the direct solution is to cascade the decoder of AMR and the encoder of G.729A. However, this conventional method has several problems, including of computation complexity, coding delay, and so on: 1. Computation complexity : The conventional full decoding method needs to perform decode and encoder at least once. The computation load is tremendous in some compression procedure. 2. Coding delay:Some processing delay is generated by frame buffering and windowing look-ahead from LPC analysis. Therefore, this conventional transcodng method increases the processing delay. To solve these problems, we make use of the similarities between both codecs. Both AMR and G.729A are based on ACELP. ACELP transmits four kinds of parameters that correspond with the speech characteristics:LPC coefficients, pitch delay, index of fixed codebook, and gains of the adaptive codebook, and fixed codebook. AMR and G.729A are different from each other in frame size and method of quantization, as shown in Table I and Table II . Table I. Specification of AMR and G.729A coding standards AMR G.729A Algorithm ACELP CS-ACELP Bit-rate 4.75, 5.15, 5.9, 6.7, 7.4, 7.95, 10.2, 12.2 kbits/s 8 kbits/s Frame size 20ms 10ms Subfrmae size 5ms 5ms Table II. Difference of techniques between AMR and G.729A AMR G.729A LSP SMQ VQ Adaptive codebook lag 12.2k mode: 1/6 1/3 Other modes: 1/3 Fixed codebook pulses 2~10 pulses 4 pulses
On the preparation , structure and bonding of ReSCl 3

The reaction of Re2O7 with a solution of S in S2Cl2 at 100°C produced rhenium sulfur trichloride, ReSCl3. The compound was found to have a polymeric linear s tructure [{ReCl 2(μ-Cl)} 2(μ-S)2]∞, which represents a new structure type (space group C2/m, a = 11.4950(7), b = 6.5626(3), c = 5.9938(4) Å, β = 95.199(4)°, Z = 4). The structure is closely related to the NbCl 4-type and expands the series of similar one-dimensi onal chain structures. Distorted Re[Cl4S2] octahedra share edges to form infinite straight c hains along the [010] direction and the Re atoms are arranged in pairs wi th alternatively short (2.965 Å) and long (3.598 Å) Re–Re distances. Electronic structure calculations and ch emical bonding analysis, using the electron density/electron-localizability indicator (ELI) approach, indicated overall metallic character and revealed a combination of covalent polar Re–Cl and Re–S bonds and weak Re–Re non-polar metallic bonds, yielding t he ELI-based oxidation numbers (ELIBON) ReS[Cl1]2Cl2 .
Parallel Preconditioned Hierarchical Harmonic Balance for Analog and RF Circuit Simulation

Circuit simulation is a fundamental enabler for the design of integrated circuits. As the design complexity increases, there has been a long lasting interest in speeding up transient circuit simulation using paralellization (Dong et al., 2008; Dong & Li, 2009b;c; Reichelt et al., 1993; Wever et al., 1996; Ye et al., 2008). On the other hand, Harmonic Balance (HB), as a general frequency-domain simulation method, has been developed to directly compute the steady-state solutions of nonlinear circuits with a periodic or quasi-periodic response (Kundert et al., 1990). While being algorithmically efficient, densely coupling nonlinear equations in the HB problem formulation still leads to computational challenges. As such, developing parallel harmonic balance approaches is very meaningful. Various parallel harmonic balance techniques have been proposed in the past, e.g. (Rhodes & Perlman, 1997; Rhodes & Gerasoulis, 1999; Rhodes & Honkala, 1999; Rhodes & Gerasoulis, 2000). In (Rhodes & Perlman, 1997), a circuit is partitioned into linear and nonlinear portions and the solution of the linear portion is parallelized; this approach is beneficial if the linear portion of the circuit analysis dominates the overall runtime. This approach has been extended in (Rhodes & Gerasoulis, 1999; 2000) by exposing potential parallelism in the form of a directed acyclic graph. In (Rhodes & Honkala, 1999), an implementation of HB analysis on shared memory multicomputers has been reported, where the parallel task allocation and scheduling are applied to device model evaluation, matrix-vector products and the standard block-diagonal (BD) preconditioner (Feldmann et al., 1996). In the literature, parallel matrix computation and parallel fast fourier transform / inverse fast fourier transform (FFT/IFFT) have also been exploited for harmonic balance. Some examples of the above ideas can be found from (Basermann et al., 2005; Mayaram et al., 1990; Sosonkinaet al., 1998). In this chapter, we present a parallel approach that focuses on a key component of modern harmonic balance simulation engines, the preconditioner. The need in solving large practical harmonic balance problems has promoted the use of efficient iterative numerical methods, such as GMRES (Feldmann et al., 1996; Saad, 2003), and hence the preconditioning techniques associated with iterative methods. Under such context, preconditioning is a key as it not only determines the efficiency and robustness of the simulation, but also corresponds to a fairly significant portion of the overall compute work. The presented work is based upon a custom hierarchical harmonic balance preconditioner that is tailored to have improved efficiency and Parallel Preconditioned Hierarchical Harmonic Balance for Analog and RF Circuit Simulation 5
THE INFORMATION SOCIETY

This study explains the application of three bibliometric tools for the exploration of the maturity of the information society as a field of research. The authors discovered a disparity between the realization of the information society in everyday life and the state of the research in the area which is at a fairly early stage of evolving into a mature research discipline. Preliminary analysis of the data uncovers the three disciplinary foundations as Library and Information Science, Communication, and Information systems. The Bradford distribution reveals that the core of information society journals is not yet fully established. Journal citation and self-citation patterns lend further support for this and help identify which journals are firmly part of the core and which are less so. Finally, research collaboration patterns demonstrate that this area of research is moving towards disciplinary maturity. The paper concludes with some practical and academic recommendations.
COMPLEX BEHAVIORS OF TELEOPERATED ROBOTIS

Abstract There has been much interest lately in the area of Internet-based control and robotics education. This is needed because the real plants and robots are very expensive to buy. This paper presents a series of experiments in autonomous collective robotics that are taken by students in control engineering and cognitive science. They allow the student to test different control algorithms from a remote location. Moreover, it is now possible to control a team of two robots connected to the same remote computer. Different complex, global behaviors are generated from simple individual behaviors.
Incorporação de representação vetorial distribuída de palavras e parágrafos na classificação de SMS SPAM

Resumo—A classificação automática de SMS spam é um problema desafiador, pois ao contrário de outros documentos (como e-mails, por exemplo), esses textos são extremamente curtos, com no máximo 140 caracteres. Além disso, eles normalmente são escritos utilizando gírias, abreviaturas e símbolos como emoticons. Técnicas de pré-processamento tem sido aplicadas para contornar esse problema, como o uso de dicionários de gírias e desambiguação de contexto. Entretanto, os benefícios advindos de técnicas baseadas em dicionário são limitados, uma vez que apenas termos dicionarizados são pré-processados. Neste trabalho investigamos o uso da combinação de técnicas tradicionais com informação advinda de redes neurais recentemente propostas, que criam uma representação vetorial distribuídas de palavras e parágrafos. Essas técnicas são capazes de capturar relações semânticas não triviais, e que podem ser usadas para melhorar a classificação automática de SPAMS. Resultados experimentais mostram que a técnica é bastante competitiva com o uso de dicionários, e que podem agregar informações adicionais relevantes para a classificação de SMS spam.
Non-vesicle-bound free microRNAs could enter cells and affect gene expression

Background: Cell-free microRNAs (miRNAs) exist in body fluid. Previous studies showed that cell-free mi-RNAs are partly bound in microvesicles, and could transfer between cells via fusion with cell membrane. Methods: We quantified the amount of a panel of mi-RNA targets in and outside microvesicles in human proximal tubular epithelial cell (HK2) medium by microarray and real-time quantitative polymerase chain reaction (RT-QPCR). Intercellular miRNA transfer was explored by medium transfer experiments. Results: We identified a portion of cell-free miRNAs that exists as non-vesicle bound, truly naked form. More importantly, these non-vesicle bound free miRNA could transfer between cells and exert biological effects. By miRNA microarray, we showed that the expression of many miRNA targets in HK-2 cells were altered, either up- or down-regulated, after exposure to extrinsic free miRNAs. The miRNA-200 family was the most affected in our model, with a corresponding alteration in the messenger RNA expression of down-stream targets including ZEB1 and vimentin. Conclusion: Our results suggest that free miRNA may serve as an intercellular messenger, a phenomenon that needs further exploration.
Information Technology and Middle Management Downsizing: A Tale of Two Cities

Information Technology and Middle Management Downsizing: A Tale of Two Cities CRITO Working Paper URB-115 Alain Pinsonneault Ecole des Hautes Etudes Commerciales 3000 Cote Ste-Catherine Montreal, Quebec Canada H3T 2A7 alain.pinsonneault@hec.ca Telephone (514) 340-6489 Fax (514) 340-6132 Kenneth L. Kraemer Center for Research on Information Technology Graduate School of Management University of California, Irvine 3200 Berkeley Place Irvine, CA 92697-4650 kkraemer@uci.edu Telephone (714) 824-5246 Fax (714) 824-8091 Acknowledgments. This research was supported by grants from the Social Sciences and Humanities Research Council of Canada, the Fonds pour la Formation de Chercheurs et l'Aide a la Recherche du Quebec, and the CISE Division of the U.S. National Science Foundation.
Evaluation of a grass infusion-baited autocidal ovitrap for the monitoring of Aedes aegypti (L.)

Autocidal ovitraps used for the monitoring of Aedes (Stegomyia) aegypti (L.) (Diptera: Culicidae) in Singapore are routinely stocked with cow-grass (Axonopus commpressus) infusion. The optimum concentration of this infusion was determined to be a 1:4 dilution of a stock infusion prepared by fermenting dried cow-grass in tap water at a rate of 10g/l. Aedes aegypti females confined in an empty room and offered an ovitrap baited with cow-grass in competition with a range of common oviposition sites (plastic bottle, paper cup, plastic pail, flower pot plate, Coca-Cola can, and vase) laid significantly more eggs in the ovitrap than in the next most competitive container. The number of eggs laid in the ovitrap did not change with the competitiveness of the other sites offered, nor with the number of other sites, but it did change – albeit non-linearly – with the number of mosquitoes released. Implications for the interpretation of quantitative ovitrap data for the monitoring of mosquito populations are discussed.
Ralph-C. Bayer, University of Adelaide, AUS

This paper investigates the relation between cognitive abilities and behavior in strategic-form games with the help of a novel experiment. The design allows us first to measure the cognitive abilities of subjects without confound and then to evaluate their impact on behavior in strategic-from games. We find that subjects with better cognitive abilities show more sophisticated behavior and make better use of information on cognitive abilities and preferences of opponents. Although we do not find evidence for Nash behavior, observed behavior is remarkably sophisticated, as almost 80% of subjects behave near optimal and outperform Nash behavior with respect to expected payoffs.
THE PROPERDIN SYSTEM AND IMMUNITY V. THE BACTERICIDAL ACTIVI~ O~ Tm~ PROPERDIN SYSTEM BY ALASTAIR

Properdin, complement, and magnesium ions constitute the recognized components of the properdin system (1, 2). This system, which is present in the normal serum of man and other mammals, has the ability in vitro to lyse certain cells, destroy bacteria, and inactivate viruses, and appears to be involved in the resistance or susceptibility of experimental animals to infection, irradiation, and shock (3-9). Preliminary reports have described briefly the action of the properdin system in bactericidal phenomena (1, 2, 5). The purpose of this paper is to report in detail experimental evidence which shows that the properdin system is the mechanism by which certain bacteria are destroyed by fresh, normal human serum. The factors required for the bactericidal action; and the variety of bacteria affected by the system are also considered. Properdin was originally recognized by its ability to combine with zymosan, the insoluble cell wall residue of yeast, to form a complex that inactivated the third component of complement (C'3). Two distinct reaction stages were demonstrated: First, the combination of zymosan with properdin, which required the presence of complement and magnesium and second, the destruction of C'3 by the properdin-zymosan complex (PZ) (1, 2). These interactions had a resemblance to the heat-labile viral neutralizing activities of serum described by Ginsberg and Horsfall (10). When it was evident, as a result of preliminary studies (1, 6), that the properdin system had viral inactivating properties, the analogy between zymosan and the bacterial cell wall suggested that the properdin system might also be bactericidal. The experiments, that confirmed this hypothesis, are described below.
Axiomatic Topological Quantum Field Theory

This dissertation provides an introduction to the ideas employed in topological quantum field theory. We illustrate how the field began by considering knot invariants of three-manifolds and demonstrating the consequences of defining such a theory axiomatically. The ideas of category theory are introduced and we show that what we are actually concerned with are symmetric monoidal functors from the category of topological cobordisms to the category of vector spaces. In two dimensions, these theories are elegantly classified through their equivalence to Frobenius algebras. Finally, we discuss possibly the simplest topological quantum field theory using a finite gauge group to define the fields.
Compression and Mining of GPS Trace Data: New Techniques and Applications

The massive volumes of trajectory data generated by inexpensive GPS devices have led to difficulties in processing, querying, transmitting and storing such data. To overcome these difficulties, a number of algorithms for compressing trajectory data have been proposed. These algorithms try to reduce the size of trajectory data, while preserving the quality of the information. We present results from a comprehensive empirical evaluation of many compression algorithms including Douglas-Peucker Algorithm, Bellman's Algorithm, STTrace Algorithm and Opening Window Algorithms. Our empirical study uses different types of realworld data such as pedestrian, vehicle and multimodal trajectories. The algorithms are compared using several criteria including how well they preserve the spatio-temporal information across numerous real-world datasets, execution times and various error metrics. Such comparisons are useful in identifying the most effective algorithms for various situations. We also provide recommendations for a hybrid algorithm which can leverage the strengths of various algorithms while mitigating their drawbacks.
The Herschel-ATLAS: Magnifications and physical sizes of 500-μm-selected strongly lensed galaxies

We perform lens modelling and source reconstruction of Submillimeter Array (SMA) data for a sample of 12 strongly lensed galaxies selected at 500μm in the Herschel Astrophysical Terahertz Large Area Survey (H-ATLAS). A previous analysis of the same dataset used a single Sersic profile to model the light distribution of each background galaxy. Here we model the source brightness distribution with an adaptive pixel scale scheme, extended to work in the Fourier visibility space of interferometry. We also present new SMA observations for seven other candidate lensed galaxies from the H-ATLAS sample. Our derived lens model parameters are in general consistent with previous findings. However, our estimated magnification factors, ranging from 3 to 10, are lower. The discrepancies are observed in particular where the reconstructed source hints at the presence of multiple knots of emission. We define an effective radius of the reconstructed sources based on the area in the source plane where emission is detected above 5σ. We also fit the reconstructed source surface brightness with an elliptical Gaussian model. We derive a median value reff ∼ 1.77 kpc and a median Gaussian full width at half maximum ∼1.47 kpc. After correction for magnification, our sources have intrinsic star formation rates SFR ∼ 900 − 3500 M⊙yr−1, resulting in a median star formation rate surface density ΣSFR ∼ 132 M⊙yr−1 kpc−2 (or ∼218 M⊙yr−1 kpc−2 for the Gaussian fit). This is consistent with what observed for other star forming galaxies at similar redshifts, and is significantly below the Eddington limit for a radiation pressure regulated starburst.
SOFTWARE COST ESTIMATION USING FUZZY NUMBER AND PARTICLE SWARM OPTIMIZATION

Software cost estimation is a process to calculate effort, time and cost of a project, and assist in better decision making about the feasibility or viability of project. Accurate cost prediction is required to effectively organize the project development tasks and to make economical and strategic planning, project management. There are several known and unknown factors affect this process, so cost estimation is a very difficult process. Software size is a very important factor that impacts the process of cost estimation. Accuracy of cost estimation is directly proportional to the accuracy of the size estimation. Failure of Software projects has always been an important area of focus for the Software Industry. Implementation phase is not the only phase for Software projects to fail, instead planning and estimation steps are the most crucial ones, which lead to their failure. More than 50% of the total projects fail which go beyond the estimated time and cost. The Standish group‘s CHAOS reports failure rate of 70% for the software projects. This paper presents the existing algorithms for software estimation and the relevant concepts of Fuzzy Theory and PSO. Also explains the proposed algorithm with experimental results.
Combining multiple similar grammars into a single modular grammar

Implementing multiple similar grammars in one application often results in duplicate code and multiple parsers in general. This research discusses methods with which multiple similar grammars can be combined into a single modular grammar. In particular I take a look at the property languages used in the model checker LTSmin. Here, the similar languages CTL, LTL, and μ-calculus are used. They are implemented each with their own grammar. As a case study we determine if and how this can be improved with a modular grammar implementation.