SoroushVahidi/scidocs huggingface dataset:
Weakly supervised named entity classification
(2014)

In this paper, we describe a new method for the problem of named entity classification for specialized or technical domains, using distant supervision. Our approach relies on a simple observation: in some specialized domains, named entities are almost unambiguous. Thus, given a seed list of names of entities, it is cheap and easy to obtain positive examples from unlabeled texts using a simple string match. Those positive examples can then be used to train a named entity classifier, by using the PU learning paradigm, which is learning from positive and unlabeled examples. We introduce a new convex formulation to solve this problem, and apply our technique in order to extract named entities from financial reports corresponding to healthcare companies.
An Efficient Method of Number Plate Extraction from Indian Vehicles Image
(2014)

Automatic Number Plate Recognition (ANPR) is an image-processing technology that identifies vehicles by their number plates without direct human intervention. It is an application of computer vision and important area of research due to its many applications. The main process of ANPR is divided into four stages. This paper presents a simple and efficient method for the extraction of number plate from the vehicle image based on morphological operations, thresholding and sobel edge detection, and the connected component analysis.
Information fusion for wireless sensor networks: Methods, models, and classifications
(2007)

Wireless sensor networks produce a large amount of data that needs to be processed, delivered, and assessed according to the application objectives. The way these data are manipulated by the sensor nodes is a fundamental issue. Information fusion arises as a response to process data gathered by sensor nodes and benefits from their processing capability. By exploiting the synergy among the available data, information fusion techniques can reduce the amount of data traffic, filter noisy measurements, and make predictions and inferences about a monitored entity. In this work, we survey the current state-of-the-art of information fusion by presenting the known methods, algorithms, architectures, and models of information fusion, and discuss their applicability in the context of wireless sensor networks.
Leadership style and patient safety: implications for nurse managers.
(2015)

OBJECTIVE
The purpose of this study was to explore the relationship between nurse manager (NM) leadership style and safety climate.


BACKGROUND
Nursing leaders are needed who will change the environment and increase patient safety. Hospital NMs are positioned to impact day-to-day operations. Therefore, it is essential to inform nurse executives regarding the impact of leadership style on patient safety.


METHODS
A descriptive correlational study was conducted in 41 nursing departments across 9 hospitals. The hospital unit safety climate survey and multifactorial leadership questionnaire were completed by 466 staff nurses. Bivariate and regression analyses were conducted to determine how well leadership style predicted safety climate.


RESULTS
Transformational leadership style was demonstrated as a positive contributor to safety climate, whereas laissez-faire leadership style was shown to negatively contribute to unit socialization and a culture of blame.


CONCLUSIONS
Nursing leaders must concentrate on developing transformational leadership skills while also diminishing negative leadership styles.
Iterative Attention Mining for Weakly Supervised Thoracic Disease Pattern Localization in Chest X-Rays
(2018)

Given image labels as the only supervisory signal, we focus on harvesting, or mining, thoracic disease localizations from chest X-ray images. Harvesting such localizations from existing datasets allows for the creation of improved data sources for computer-aided diagnosis and retrospective analyses. We train a convolutional neural network (CNN) for image classification and propose an attention mining (AM) strategy to improve the model’s sensitivity or saliency to disease patterns. The intuition of AM is that once the most salient disease area is blocked or hidden from the CNN model, it will pay attention to alternative image regions, while still attempting to make correct predictions. However, the model requires to be properly constrained during AM, otherwise, it may overfit to uncorrelated image parts and forget the valuable knowledge that it has learned from the original image classification task. To alleviate such side effects, we then design a knowledge preservation (KP) loss, which minimizes the discrepancy between responses for X-ray images from the original and the updated networks. Furthermore, we modify the CNN model to include multi-scale aggregation (MSA), improving its localization ability on small-scale disease findings, e.g., lung nodules. We experimentally validate our method on the publicly-available ChestXray14 dataset, outperforming a class activation map (CAM)-based approach, and demonstrating the value of our novel framework for mining disease locations.
Content-Based Image Retrieval Using Multiple Features
(2014)

Algorithms of Content-Based Image Retrieval (CBIR) have been well developed along with the explosion of information. These algorithms are mainly distinguished based on feature used to describe the image content. In this paper, the algorithms that are based on color feature and texture feature for image retrieval will be presented. Color Coherence Vector based image retrieval algorithm is also attempted during the implementation process, but the best result is generated from the algorithms that weights color and texture. 80% satisfying rate is achieved.
DIFusion: Fast Skip-Scan with Zero Space Overhead
(2018)

Scan is a crucial operation in main-memory column-stores. It scans a column and returns a result bit vector indicating which records satisfy a filter predicate. ByteSlice is an in-memory data layout that chops data into multiple bytes and exploits early-stop capability by high-order bytes comparisons. As column widths are usually not multiples of byte, the last-byte of ByteSlice is padded with 0's, wasting memory bandwidth and computation power. To fully leverage the resources, we propose to weave a secondary index into the vacant bits (i.e., bits originally padded with 0's), forming our new layout coined DIFusion (Data Index Fusion). DIFusion enables skip-scan, a new fast scan that inherits the early-stopping capability from ByteSlice and at the same time possesses the data-skipping ability of index with zero space overhead. Empirical results show that skip-scan on DIFusion outperforms scan on ByteSlice.
Monocyte emigration from bone marrow during bacterial infection requires signals mediated by chemokine receptor CCR2
(2006)

Monocytes recruited to tissues mediate defense against microbes or contribute to inflammatory diseases. Regulation of the number of circulating monocytes thus has implications for disease pathogenesis. However, the mechanisms controlling monocyte emigration from the bone marrow niche where they are generated remain undefined. We demonstrate here that the chemokine receptor CCR2 was required for emigration of Ly6Chi monocytes from bone marrow. Ccr2−/− mice had fewer circulating Ly6Chi monocytes and, after infection with Listeria monocytogenes, accumulated activated monocytes in bone marrow. In blood, Ccr2−/− monocytes could traffic to sites of infection, demonstrating that CCR2 is not required for migration from the circulation into tissues. Thus, CCR2-mediated signals in bone marrow determine the frequency of Ly6Chi monocytes in the circulation.
Incremental learning for ν-Support Vector Regression
(2015)

The ν-Support Vector Regression (ν-SVR) is an effective regression learning algorithm, which has the advantage of using a parameter ν on controlling the number of support vectors and adjusting the width of the tube automatically. However, compared to ν-Support Vector Classification (ν-SVC) (Schölkopf et al., 2000), ν-SVR introduces an additional linear term into its objective function. Thus, directly applying the accurate on-line ν-SVC algorithm (AONSVM) to ν-SVR will not generate an effective initial solution. It is the main challenge to design an incremental ν-SVR learning algorithm. To overcome this challenge, we propose a special procedure called initial adjustments in this paper. This procedure adjusts the weights of ν-SVC based on the Karush-Kuhn-Tucker (KKT) conditions to prepare an initial solution for the incremental learning. Combining the initial adjustments with the two steps of AONSVM produces an exact and effective incremental ν-SVR learning algorithm (INSVR). Theoretical analysis has proven the existence of the three key inverse matrices, which are the cornerstones of the three steps of INSVR (including the initial adjustments), respectively. The experiments on benchmark datasets demonstrate that INSVR can avoid the infeasible updating paths as far as possible, and successfully converges to the optimal solution. The results also show that INSVR is faster than batch ν-SVR algorithms with both cold and warm starts.
Feature combination strategies for saliency-based visual attention systems
(1999)

acin ral eais a000 Abstract. Bottom-up or saliency-based visual attention allows primates to detect nonspecific conspicuous targets in cluttered scenes. A classical metaphor, derived from electrophysiological and psychophysical studies, describes attention as a rapidly shiftable ‘‘spotlight.’’ We use a model that reproduces the attentional scan paths of this spotlight. Simple multi-scale ‘‘feature maps’’ detect local spatial discontinuities in intensity, color, and orientation, and are combined into a unique ‘‘master’’ or ‘‘saliency’’ map. The saliency map is sequentially scanned, in order of decreasing saliency, by the focus of attention. We here study the problem of combining feature maps, from different visual modalities (such as color and orientation), into a unique saliency map. Four combination strategies are compared using three databases of natural color images: (1) Simple normalized summation, (2) linear combination with learned weights, (3) global nonlinear normalization followed by summation, and (4) local nonlinear competition between salient locations followed by summation. Performance was measured as the number of false detections before the most salient target was found. Strategy (1) always yielded poorest performance and (2) best performance, with a threefold to eightfold improvement in time to find a salient target. However, (2) yielded specialized systems with poor generalization. Interestingly, strategy (4) and its simplified, computationally efficient approximation (3) yielded significantly better performance than (1), with up to fourfold improvement, while preserving generality. © 2001 SPIE and IS&T. [DOI: 10.1117/1.1333677]
Counter-Forensics: Attacking Image Forensics
(2013)

This chapter discusses counter-forensics, the art and science of impeding or misleading forensic analyses of digital images. Research on counter-forensics is motivated by the need to assess and improve the reliability of forensic methods in situations where intelligent adversaries make efforts to induce a certain outcome of forensic analyses. Counter-forensics is first defined in a formal decision-theoretic framework. This framework is then interpreted and extended to encompass the requirements to forensic analyses in practice, including a discussion of the notion of authenticity in the presence of legitimate processing, and the role of image models with regard to the epistemic underpinning of the forensic decision problem. A terminology is developed that distinguishes security from robustness properties, integrated from post-processing attacks, and targeted from universal attacks. This terminology is directly applied in a self-contained technical survey of counter-forensics against image forensics, notably techniques that suppress traces of image processing and techniques that synthesize traces of authenticity, including examples and brief evaluations. A discussion of relations to other domains of multimedia security and an overview of open research questions concludes the chapter. 1 Definition of Counter-Forensics This final chapter changes the perspective. It is devoted to digital image counterforensics, the art and science of impeding and misleading forensic analyses of digital images. Rainer Böhme Westfälische Wilhelms-Universität Münster, Dept. of Information Systems, Leonardo-Campus 3, 48149 Münster, Germany e-mail: rainer.boehme@wi.uni-muenster.de Matthias Kirchner International Computer Science Institute, 1947 Center Street, Berkeley, CA 94704 e-mail: kirchner@icsi.berkeley.edu
Band-pass shielding enclosure for 2.4/5 GHz WLAN applications
(2017)

This paper presents a design of band-pass shielding enclosure for two frequency bands of WLAN. The proposed design employs a compact frequency selective surface to highlight the advantages of these miniaturized structures for the selective shielding of such enclosures that are electrically small. The results indicate that the proposed shielding enclosure has high transmittance in both the pass bands for horizontal and vertical polarizations, while offers a good amount of electromagnetic shielding outside these frequency bands.
Big Data For Development: Applications and Techniques
(2016)

With the explosion of social media sites and proliferation of digital computing devices and Internet access, massive amounts of public data is being generated on a daily basis. Efficient techniques/ algorithms to analyze this massive amount of data can provide near real-time information about emerging trends and provide early warning in case of an imminent emergency (such as the outbreak of a viral disease). In addition, careful mining of these data can reveal many useful indicators of socioeconomic and political events, which can help in establishing effective public policies. The focus of this study is to review the application of big data analytics for the purpose of human development. The emerging ability to use big data techniques for development (BD4D) promises to revolutionalize healthcare, education, and agriculture; facilitate the alleviation of poverty; and help to deal with humanitarian crises and violent conflicts. Besides all the benefits, the large-scale deployment of BD4D is beset with several challenges due to the massive size, fast-changing and diverse nature of big data. The most pressing concerns relate to efficient data acquisition and sharing, establishing of context (e.g., geolocation and time) and veracity of a dataset, and ensuring appropriate privacy. In this study, we provide a review of existing BD4D work to study the impact of big data on the development of society. In addition to reviewing the important works, we also highlight important challenges and open issues.
On-Chip High-Voltage Generation in Integrated Circuits Using an Improved Multiplier Technique
(1976)

An improved oped for generating +40 voltage multiplier technique has been develV internally in p-channel MNOS integrated circuits to enrtble them to be operated from standard +5and : 12-V supply rails. With this technique, the multiplication efficiency and current driving capabtilty are both independent of the number of multiplier stages. A mathematical model and simple equivalent circuit have been developed for the multiplier and the predicted performance agrees well with measured results. A multiplier has already been incorporated into a TTL compatible nonvolatile quad-latch, in which it occupies a chip area of 600 ~m X 240 pm. It is operated with a clock frequency of 1 MHz and can supManuscript received December 9, 1975; revised February 18, 1976. This paper is based on part of a presentation entitled “A non-volatile MNOS quad-latch,” which was presented at the First European SolidState Circuits Conference, Canterbury, England, September 2-5, 1975. The author is with the Allen Clark Research Centre, The Plessey Company Ltd., CasweJl, Towcester, Northants., England. MNOS Voltage ply a maximum load current of about 10 NA. The output impedance is 3.2 Mfl. INTRODUCTION ALTHOUGH MNOS technology is now well established for fabricating nonvolatile memory circuits, the relatively high potentials necessary to write or erase information, typically 30-40 V, are an obvious disadvantage. In many applications, the need to generate these voltages has prevented the use of MNOS devices being economically viable, especially when only a few bits of nonvolatile data are required. To overcome this problem, a method of on-chip high-voltage generation using a new voltage multiplier technique has been developed, enabling MNOS circuits to be operated with standard DICKSON: ON-CHIP HIGH-VOLTAGEGENERATION 375
Using Fully Homomorphic Encryption for Statistical Analysis of Categorical, Ordinal and Numerical Data
(2016)

In recent years, there has been a growing trend towards outsourcing of computational tasks with the development of cloud services. The Gentry’s pioneering work of fully homomorphic encryption (FHE) and successive works have opened a new vista for secure and practical cloud computing. In this paper, we consider performing statistical analysis on encrypted data. To improve the efficiency of the computations, we take advantage of the batched computation based on the ChineseRemainder-Theorem. We propose two building blocks that work with FHE: a novel batch greater-than primitive, and matrix primitive for encrypted matrices. With these building blocks, we construct secure procedures and protocols for different types of statistics including the histogram (count), contingency table (with cell suppression) for categorical data; k-percentile for ordinal data; and principal component analysis and linear regression for numerical data. To demonstrate the effectiveness of our methods, we ran experiments in five real datasets. For instance, we can compute a contingency table with more than 50 cells from 4000 of data in just 5 minutes, and we can train a linear regression model with more than 40k of data and dimension as high as 6 within 15 minutes. We show that the FHE is not as slow as commonly believed and it becomes feasible to perform a broad range of statistical analysis on thousands of encrypted data.
Anomalous Magnetic Field Activity During a Bioenergy Healing Experiment
(2010)

A few studies have reported magnetic fi eld changes during bioenergy healing. In a pilot experiment, we examined magnetic fi eld activity during hands-on healing and distant healing of mice with experimentally induced tumors. During healing sessions, we observed distinct magnetic fi eld oscillations adjacent to the mice cages, which were similar in appearance to those reported by Zimmerman (1985). The magnetic fi eld oscillations began as 20–30 Hz oscillations, slowing to 8–9 Hz, and then to less than 1 Hz, at which point the oscillations reversed and increased in frequency, with an overall symmetrical appearance resembling a “chirp wave.” The waves ranged from 1–8 milliGauss peak-to-peak in strength and 60–120 sec in duration. Evidence to date suggests that bioenergy healing may be detectable with DC gaussmeters, although we have not ruled out an artifactual basis for the oscillations reported here.
Algorithms implementing distributed shared memory
(1990)

Four basic algorithms for implementing distributed shared memory are compared. Conceptually, these algorithms extend local virtual address spaces to span multiple hosts connected by a local area network, and some of them can easily be integrated with the hosts' virtual memory systems. The merits of distributed shared memory and the assumptions made with respect to the environment in which the shared memory algorithms are executed are described. The algorithms are then described, and a comparative analysis of their performance in relation to application-level access behavior is presented. It is shown that the correct choice of algorithm is determined largely by the memory access behavior of the applications. Two particularly interesting extensions of the basic algorithms are described, and some limitations of distributed shared memory are noted.<<ETX>>
Adapting the Tesseract open source OCR engine for multilingual OCR
(2009)

We describe efforts to adapt the Tesseract open source OCR engine for multiple scripts and languages. Effort has been concentrated on enabling generic multi-lingual operation such that negligible customization is required for a new language beyond providing a corpus of text. Although change was required to various modules, including physical layout analysis, and linguistic post-processing, no change was required to the character classifier beyond changing a few limits. The Tesseract classifier has adapted easily to Simplified Chinese. Test results on English, a mixture of European languages, and Russian, taken from a random sample of books, show a reasonably consistent word error rate between 3.72% and 5.78%, and Simplified Chinese has a character error rate of only 3.77%.
Multilingual OCR (MOCR): An Approach to Classify Words to Languages
(2011)

There are immense efforts to design a complete OCR for most of the world’s leading languages, however, multilingual documents either of handwritten or of printed form. As a united attempt, Unicode based OCRs were studied mostly with some positive outcomes, despite the fact that a large character set slows down the recognition significantly. In this paper, we come out with a method to classify words to a language as the word segmentation is complete. For the purpose, we identified the characteristics of writings of several languages and utilized projecting method combined with some other feature extraction methods. In addition, this paper intends a modified statistical approach to correct the skewness before processing a segmented document. The proposed procedure, evaluated for a collection of both handwritten and printed documents, came with excellent outcomes in assigning words to languages. General Terms Pattern Recognition, Document Processing, Optical Character Recognition.
Automatic code generation of convolutional neural networks in FPGA implementation
(2016)

Convolutional neural networks (CNNs) have gained great success in various computer vision applications. However, state-of-the-art CNN models are computation-intensive and hence are mainly processed on high performance processors like server CPUs and GPUs. Owing to the advantages of high performance, energy efficiency and reconfigurability, Field-Programmable Gate Arrays (FPGAs) have been widely explored as CNN accelerators. In this paper, we propose parallel structures to exploit the inherent parallelism and efficient computation units to perform operations in convolutional and fully-connected layers. Further, an automatic generator is proposed to generate Verilog HDL source code automatically according to high-level hardware description language. Execution time, DSP consumption and performance are analytically modeled based on some critical design variables. We demonstrate the automatic methodology by implementing two representative CNNs (LeNet and AlexNet) and evaluate the execution time models by comparing estimated and measured values. Our results show that the proposed automatic methodology yields hardware design with good performance and saves much developing round time.
Extending drift-diffusion paradigm into the era of FinFETs and nanowires
(2015)

This paper presents a feasibility study that the drift-diffusion model can capture the ballistic transport of FinFETs and nanowires with a simple model extension. For FinFETs, Monte Carlo simulation is performed and the ballistic mobility is calibrated to linear & saturation currents. It is validated that the calibrated model works over a wide range of channel length and channel stress. The ballistic mobility model is then applied to a nanowire with 5nm design rules. Finally, the technology scaling trend of the ballistic ratio is explored.