Miracle-dz/UniFAR-FTUs huggingface dataset:
Exploiting multi-threaded application characteristics to optimize performance and power of chip-multiprocessors

Chip multiprocessors (CMPs) are becoming a popular way of exploiting ever-increasing number of on-chip transistors. Multi-threaded applications are set to better utilize the raw power that CMPs provide. But those applications exhibit load imbalance at various levels. From CMPs point of view, the location of data on the chip can play a critical role in the performance of these applications because of the growing on-chip storage capacities and the relative cost of wire delays. It is important to locate the data at the right place at the right time in the on-chip cache hierarchy. We study the load imbalance at the barrier, among cache requests from different cores, and between actively shared blocks and mostly privately accessed blocks. We propose techniques to exploit those imbalance to improve power and performance. For the load imbalance at the barrier, we observe that the imbalance are quite predictable, thus we propose a novel technique for optimizing the power consumption of chip-multiprocessors (CMPs) using an integrated hardware-software mechanism. By using a high level synchronization construct, called the barrier, our technique tracks the idle times spent by a processor waiting for other processors to get to the same point in the program. Using this knowledge, the frequency of the processors can be modulated to reduce/eliminate these idle times, thus providing power savings without compromising on performance. For the imbalanced cache demands from different cores, we notice that the possible imbalance between the L2 demands across the cores favors a shared L2 organization, while the interference between these demands can favor a private L2 organization. We propose a new architecture, called Shared Processor-Based Split L2, that captures the benefits of these two organizations, while avoiding many of their drawbacks. We also study the demands on different blocks of the L2, namely actively shared blocks and mostly privately accessed blocks, and show that, while there are a considerable number of L2 accesses to shared data, the volume of this data is relatively low. Consequently, it is important to keep this shared data fairly close to all processor cores for both performance and power reasons. Motivated by this observation, we propose a small center cell cache residing in the middle of the processor cores which provides fast access to its contents. We demonstrate that this cache organization can considerably lower the number of block migrations between the L2 portions that are closer to each core, thus providing better performance. Combined with sequetial tag-data access, the power consumption of shared cache can be further reduced.
Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders

In the context of online ad serving, display ads may appear on different types of webpages, where each page includes several ad slots and therefore multiple ads can be shown on each page. The set of ads that can be assigned to ad slots of the same page needs to satisfy various prespecified constraints including exclusion constraints, diversity constraints, and the like. Upon arrival of a user, the ad serving system needs to allocate a set of ads to the current webpage respecting these per-page allocation constraints. Previous slot-based settings ignore the important concept of a page and may lead to highly suboptimal results in general. In this article, motivated by these applications in display advertising and inspired by the submodular welfare maximization problem with online bidders, we study a general class of page-based ad allocation problems, present the first (tight) constant-factor approximation algorithms for these problems, and confirm the performance of our algorithms experimentally on real-world datasets. A key technical ingredient of our results is a novel primal-dual analysis for handling free disposal, which updates dual variables using a “level function” instead of a single level and unifies with previous analyses of related problems. This new analysis method allows us to handle arbitrarily complicated allocation constraints for each page. Our main result is an algorithm that achieves a 1 - 1 / e - o(1)-competitive ratio. Moreover, our experiments on real-world datasets show significant improvements of our page-based algorithms compared to the slot-based algorithms. Finally, we observe that our problem is closely related to the submodular welfare maximization (SWM) problem. In particular, we introduce a variant of the SWM problem with online bidders and show how to solve this problem using our algorithm for whole-page optimization.
Tree-based state clustering for large vocabulary speech recognition

The key problem to be faced when building a HMM-based continuous speech recogniser is maintaining the balance between model complexity and available training data. For large vocabulary systems requiring cross-word context dependent modelling, this is particularly acute since many such contexts will never occur in the training data. This paper describes a method of creating a tied-state continuous speech recognition system using a phonetic decision tree. Results are presented for the Resource Management and Wall Street Journal tasks where very good performance is achieved. The method is compared to a traditional model-based procedure and shown to be clearly superior. <<ETX>>
A Relative Rate Study of the Reaction of Chlorine Atoms (Cl) and Hydroxyl Radicals (OH) with a Series of Ethers

Rate constants for the gas phase reactions of hydroxyl radicals and chlorine atoms with a number of ethers have been determined at 300 ± 3 K and at a total pressure of 1 atmosphere. Both OH radical and chlorine atom rate constants were determined using a relative rate technique. Values for the rate constants obtained are as follows. Text Table Text. compound kOH×1012(cm3 molecule−1 s−1) kC1×1011(cm3 molecule−1 s−1) Hexane 5.53 ± 1.55 — 2-Chloro ethyl methyl ether 4.92 ± 1.09 14.4 ± 5.0 2,2-Dichloro ethyl methyl ether 2.37 ± 0.50 4.4 ± 1.6 2-Bromo ethyl methyl ether 6.94 ± 1.38 16.3 ± 5.4 2-Chloro,1,1,1-trifluoro ethyl ethyl ether <0.3 0.30 ± 0.10 Isoflurane <0.3 <0.1 Enflurane <0.3 <0.1 Di-i-propyl ether 11.08 ± 2.26 16.3 ± 5.4 Diethyl ether — 25.8 ± 4.4 The above relative rate constants are based on the values of k(OH + pentane)=[3.94 ± 0.98]×10−12 and k(OH + diethyl ether)=[13.6 ± 2.26] × 10−12 cm3 molecule−1 s−1 in the case of the hydroxyl reactions. In the case of the chlorine atom reactions, the above rate constants are based on values of k(Cl + ethane)=[5.84 ± 0.88] × 10−11 and k(Cl + diethyl ether)=[25.4 ± 8.05] × 10−11 cm3 molecule−1 s−1. The quoted errors include ±2σ from a least squares analysis of our slopes plus the uncertainty associated with the reference rate constants. Atmospheric lifetimes calculated with respect to reaction with OH radicals are based on a tropospheric OH radical concentration of (7.7 ± 1.4) × 105 radicals cm−3, and lifetimes with respect to reaction with Cl atoms are based on a tropospheric Cl atom concentration of 1 × 103 atoms cm−3. Observed trends in the relative rates of reaction of hydroxyl radicals and chlorine atoms with the ethers studied is discussed. The significance of the calculated tropospheric lifetimes is also reviewed. © 1993 John Wiley & Sons, Inc.
Screening Legitimate and Fake/Crude Antivirus Software

Fake antivirus (AV) software, a kind of malware, pretends to be a legitimate AV product and frightens computer users by showing fake security alerts, as if their computers were infected with malware. In addition, fake AV urges users to purchase a “commercial” version of the fake AV. In this paper, we search for an indicator that captures behavioral differences in legitimate AV and fake AV. The key insight behind our approach is that legitimate AV behaves differently in clean and infected environments, whereas fake AV behaves similarly in both environments, because it does not analyze malware in the infected environments. We have investigated three potential indicators, file access pattern, CPU usage, and memory usage, and found that memory usage is an effective indicator to distinguish legitimate AV from fake AV. In an experiment, this indicator identifies all fake AV samples (39 out of 39) as fake and all legitimate AV products (8 out of 8) as legitimate. It is impractical for fake AV to evade this indicator because to do so would require it to detect malware infections, just as legitimate AV does.
Semi-Meshless Stencil Selection on Three-Dimensional Anisotropic Point Distributions with Parallel Implementation

Meshless methods are an attractive proposition in CFD as a means of simulating multibody systems. The selection of the stencils over the computational domain for the meshless solver is crucial for the method to be competitive with other CFD techniques. Stencil selection is relatively straight forward if the point distributions are isotropic in nature; however, this is rarely the case in computations that solve the Navier-Stokes equations. Previous work has included a fully automatic method of selecting the stencils from two-dimensional anisotropic point distributions, which are obtained from overlapping grids. This paper is an extension of that method to stencil selection for three-dimensional anisotropic point distributions. The methodology is described, and results, that are solutions to the Euler equations, are presented. The increased size of the computational domain for threedimensional cases means that a method of parallel computing is necessary for the solver; this method is also described.
Efficient full-wave simulation in layered, lossy media

We describe a fast integral equation-based method for full-wave extraction in layered media. The method uses a combination of the fast integral equation solver IES/sup 3/, layered Green's functions, and a formulation that gives a well-conditioned linear system even in the "electrically-small" regime (i.e., when circuit structures are a fraction of the wavelength of light). The overall approach gives O(NlogN) complexity, where N is the number of panels in a discretization of the conductor surfaces. We apply our method to the simulation of an integrated inductor on a lossy CMOS substrate and compare the results to measurement.
An empirical evaluation of bagging and boosting for artificial neural networks

Bagging and boosting are two relatively new but popular methods for producing classifier ensembles. An ensemble consists a set of independently trained classifiers (such as neural networks or decision trees) whose predictions are combined when classifying instances. Previous research suggests that an ensemble as a whole is often more accurate than any of the single classifiers in the ensemble. In this paper we evaluate bagging and boosting as methods for creating an ensemble of neural networks. We also include results from Quinlan's (1996) decision tree evaluation of these methods. Our results indicate that the ensemble methods can indeed produce very accurate classifiers for some dataset, but that these gains may depend on aspects of the dataset. In particular we find that bagging is probably appropriate for most problems, but when properly applied boosting may produce even larger gains in accuracy.
Accounting Students, Library Use, and Information Competence: Evidence From Course Syllabi and Professional Accounting Association Competency Maps

A syllabus study was conducted to gain insight into the library use expectations of faculty for undergraduate accounting students. The findings were compared to the professional competencies articulated by Canadian professional accounting association competency maps, and there was an expectations gap. All three competency maps referred to a set of professional skills that, when mapped to the Association of College and Research Libraries’ (ACRL) Information Literacy Competency Standards for Higher Education, were equivalent to information competence, yet the majority of courses taught required very little library use. This study contributes to the literature as the first to map the ACRL's standards to Canadian professional accounting association competencies.
Sampling Deviation Real-time Calibration Method for Wideband Simulator

Hardware-in-the-loop simulation is an efficient method for research on radar system.Target’s echo which offered by the simulator should be synchronized with radar on frequency, time, and range bin. However, because simulator needs to take into account of the requirements of various types of radar, it is difficult to make the clock of simulator synchronized with the clock of radar. To solve the problem, synchronous sampling deviation model is established. Influence of sampling deviation on imaging is analyzed. An engineering method is put forward to eliminate the sampling deviation. This method not only provides a reference for simulation system, but also provides a reference for the design of radar system.
A zero block detection algorithm used in EBCOT and its architecture

We propose a zero block detection algorithm and architecture in EBCOT. After the detailed analysis of wavelet coefficients’ precision and distribution in JPEG2000, there are three main modes of zero coefficients in the wavelet domain, i.e. zero column, zero stripe and zero code block. And we also discover that the coding information of each bit plane and the corresponding passes can be obtained simultaneously in the hardware structure. Therefore, bit plane-parallel and pass-parallel coding with zero detection is proposed, and its VLSI architecture is shown in details. The analysis and the corresponding software/hardware experimental results show that the proposed architecture reduces the processing time greatly compared with others.
Resource management in particle filtering for multiple object tracking

This paper presents a novel particle allocation approach to particle filtering for multiple object tracking which minimizes the total tracking distortion given a fixed number of particles over a video sequence. Under the framework of distributed multiple object tracking, we propose the dynamic proposal variance and optimal particle number allocation algorithm for multi-object tracking to allocate particles among multiple targets as well as multiple frames. Experimental results show the superior performance of our proposed algorithm to traditional particle allocation methods, i.e. a fixed number of particles for each object in each frame. To the best of our knowledge, our approach is the first to provide an optimal allocation of a fixed number of particles among multiple objects and multiple frames.
The Design for Computer Monitoring System Based on Ethernet

Ethernet computer monitor and control system is a new strategy subjecting to the problems existing in the Ethernet. The computer monitor and control system designed in this paper adopts C/S mode. It’s composed of client monitor software and server software. The five modules of the client monitor software are used to record the statistic analysis of the network usage state, the modification of the file information, the information of the running process, the information of the E-mail, and the use efficiency of CPU. The server software is in charge of collecting all kinds of information of client so that it is easy for the user to monitor and manage the host.
Partial fingerprint recognition using support vector machine

In this study, a novel partial fingerprint matching approach that uses global minutiae matching and the support vector machine is presented. Global minutiae-based matching algorithm is used to record the matching pairs and their feature vectors are used to generate a model file which is used for classification. The traditional minutiae-based matching approach is studied as a classification approach by using support vector machine. We used fingerprint verification competition databases for our evaluation. Results from our experiment showed 98.5% of matching is achieved compared to 97.6% obtained using flow network-based approach.
A model for exploiting the target language characteristics to extract bilingual base noun phrases

Bilingual Base Noun Phrase (BaseNP) extraction is one of the key tasks of Natural Language Processing (NLP). This task is more challenging for the pair of English-Vietnamese due to the lack of available Vietnamese language resources such as treebanks, part-of-speech taggers, and parsers. In this paper, we propose a combination model that uses language characteristics based on statistics and the projection method to extract BaseNP correspondences from a bilingual corpus. The language characteristics used in this model include the word segmentation, word order and word classification [1]. Our model overcomes not only the lack of resources of Vietnamese, but also improves the performance of miss-alignment, null-alignment, overlap and conflict projection of the existing methods. The proposed model can be easily applied to other language pairs. Experiment on 66,646 pairs of sentences in the English-Vietnamese bilingual corpus shows that our proposed model is very satisfactory.
Resolution of an inverse thermal problem using parallel processing on shared-memory multiprocessor architectures

Advances in multi-cores CPUs and in Graphics Processors Units (GPUs) are attracting a lot of attention of the scientific community due to their parallel processing power in conjunction with their low cost. In recent years the resolution of inverse thermal problems (ITP) is gaining increasing importance and attention in simulation-based applied science and engineering. However, the resolutions of these problems are very sensitive to random errors and the computer cost is high. In an attempt to improve the computational performance to solve an ITP, the computational power of multi-core architectures was used and analysed; mainly those offered by the GPU via Compute Unified Device Architecture (CUDA) and multi-cores CPUs via Pthreads. Also, we developed the implementation of the Preconditioned Conjugate Gradient method as a kernel on GPU to solve several sparse linear systems. Our CUDA and Pthreads-based systems are, respectively, two and four times faster than the serial version, while maintaining comparable convergence behaviour.
USGS potential‐field geophysical software for PC and compatible microcomputers

Potential‐field software currently in use by the USGS Branch of Geophysics has recently been modified for use on PC/MS-Dos based microcomputers and is available at nominal cost from the USGS Open‐File Report Services. Version 2.0 represents a substantial upgrade of version 1.0 of the PC software (US Geological Survey Open‐File Report 89–197 A-F) released in 1989. It includes many new programs and program repairs, fuller documentation, and on‐line help. Both executable and Fortran source‐code are included.
Framework for policy aware reuse of content on the WWW

This thesis focuses on methods for detecting and preventing license violations, in a step towards policy aware content reuse on the Web. This framework builds upon the Creative Commons (CC) Rights Expression Language, which provides a very clear and a widely accepted set of licenses grounded in Semantic Web technologies. These licenses are machine readable, and indicates to a person who wishes to reuse the content exactly how it should be used. An experiment on CC attribution license violations on Flickr images revealed the attribution license violation rate on the Web to be around 70-90% from samples of Websites that had at least one embedded Flickr image. Therefore, it is evident that there should be robust mechanisms for detecting license violations on the Web and prevent those happening, if possible. The primary objective is to enable the user to do the right thing instead of preventing the user from doing the wrong thing. As a solution, we have implemented (1) “Attribution License Violations Validator” for Flickr images and, (2) the more generic “Semantic Clipboard”. The “Attribution License Violations Validator” can be used to validate users’ work against any attribution license violation. The “Semantic Clipboard”, which is implemented as a component of the Tabulator Firefox extension, allows the user to copy an image with its license metadata expressed in Resource Description Framework in annotations (RDFa) in the original source document to any other document. Thesis Supervisor: Tim Berners-Lee Title: Professor Thesis Reader: Lalana Kagal Title: Research Scientist
Recognition of devoiced vowels using optical microphone made of multiple POF moisture sensors

A novel optical fiber microphone system for recognizing devoiced vowels has been studied. This system consists of optical detection of the moisture pattern formed by a devoiced breath and its recognition by modified DP-matching. To detect the moisture pattern of devoiced vowels, five plastic optical fiber moisture sensors with fast response were developed and used. Using this system, a high discernment rate of over 93% was obtained for devoiced vowels. This system will be used for verbally handicapped people to create sounds with minimal effort in the near future. © 2010 Wiley Periodicals, Inc. Electron Comm Jpn, 93(9): 12–18, 2010; Published online in Wiley Online Library (wileyonlinelibrary.com). DOI 10.1002/ ecj.10253
E-mail Spam Filtering Using Adaptive Genetic Algorithm

Now a day's everybody email inbox is full with spam mails. The problem with spam mails is that they are not malicious in nature so generally don't get blocked with firewall or filters etc., however, they are unwanted mails received by any internet users. In 2012, more that 50% emails of the total emails were spam emails. In this paper, a genetic algorithm based method for spam email filtering is discussed with its advantages and dis-advantages. The results presented in the paper are promising and suggested that GA can be a good option in conjunction with other e-mail filtering techniques can provide more robust solution.
Dependence of current match on back-gate bias in weakly inverted MOS transistors and its modeling

We have extensively measured and analyzed the current mismatch of a small-size n-channel MOS transistor of 2 /spl mu/m/spl times/2 /spl mu/m operated in weak inversion with its p-well-to-n/sup +/-source junction forward and reverse biased. The case of slightly forward biasing the well-to-source junction represents the action of a gated lateral bipolar transistor in low level injection. The measured dependencies of the mismatch in weak inversion on the back-gate forward and reverse biases have been successfully reproduced by a new simple statistical model. From the experimental data, we suggest that i) subthreshold circuits should be carefully designed for suppression of mismatch arising from back-gate reverse bias, and ii) a gated lateral bipolar action in low level injection may be utilized as a new method of improving the transistor matching.
Chinese Accent Detection Using Acoustic Feature Sets with Context Features

Accent is a critically important component of spoken communication. In this paper, we use acoustic features with context features to detect Chinese accent, and use NaiveBayes classifier to conduct model based on ASCCD reading discourse corpus. For comparison purposes, we digitally added white noise to ASCCD, and regarded it as ASCCD (white). NaiveBayes classifier is utilized to model the acoustic feature sets, which adequately present the property of the current syllable and context. The experimental results indicate that the acoustic feature sets with context features achieve 80.7% accent detection accuracy on ASCCD. The experiment also demonstrate that the acoustic feature sets with context features achieve 75.7% accent detection accuracy on ASCCD(white). Across these acoustic feature sets, we find pitch features to be the most predictive of Chinese accent on ASCCD and on ASCCD (white). Context is important to Chinese accent detection on ASCCD and on ASCCD (white). And the experimental results show that the NaiveBayes classification has a good classification result for these.