SoroushVahidi/scidocs huggingface dataset:
Similarity and Locality Based Indexing for High Performance Data Deduplication
(2015)

Data deduplication has gained increasing attention and popularity as a space-efficient approach in backup storage systems. One of the main challenges for centralized data deduplication is the scalability of fingerprint-index search. In this paper, we propose SiLo, a near-exact and scalable deduplication system that effectively and complementarily exploits similarity and locality of data streams to achieve high duplicate elimination, throughput, and well balanced load at extremely low RAM overhead. The main idea behind SiLo is to expose and exploit more similarity by grouping strongly correlated small files into a segment and segmenting large files, and to leverage the locality in the data stream by grouping contiguous segments into blocks to capture similar and duplicate data missed by the probabilistic similarity detection. SiLo also employs a locality based stateless routing algorithm to parallelize and distribute data blocks to multiple backup nodes. By judiciously enhancing similarity through the exploitation of locality and vice versa, SiLo is able to significantly reduce RAM usage for index-lookup, achieve the near-exact efficiency of duplicate elimination, maintain a high deduplication throughput, and obtain load balance among backup nodes.
Functional System and Areal Organization of a Highly Sampled Individual Human Brain
(2015)

Resting state functional MRI (fMRI) has enabled description of group-level functional brain organization at multiple spatial scales. However, cross-subject averaging may obscure patterns of brain organization specific to each individual. Here, we characterized the brain organization of a single individual repeatedly measured over more than a year. We report a reproducible and internally valid subject-specific areal-level parcellation that corresponds with subject-specific task activations. Highly convergent correlation network estimates can be derived from this parcellation if sufficient data are collected-considerably more than typically acquired. Notably, within-subject correlation variability across sessions exhibited a heterogeneous distribution across the cortex concentrated in visual and somato-motor regions, distinct from the pattern of intersubject variability. Further, although the individual's systems-level organization is broadly similar to the group, it demonstrates distinct topological features. These results provide a foundation for studies of individual differences in cortical organization and function, especially for special or rare individuals. VIDEO ABSTRACT.
A Fast Similarity Join Algorithm Using Graphics Processing Units
(2008)

A similarity join operation A BOWTIEepsiv B takes two sets of points A, B and a value epsiv isin Ropf, and outputs pairs of points p isin A,q isin B, such that the distance D(p, q) les epsiv. Similarity joins find use in a variety of fields, such as clustering, text mining, and multimedia databases. A novel similarity join algorithm called LSS is presented that executes on a graphics processing unit (GPU), exploiting its parallelism and high data throughput. As GPUs only allow simple data operations such as the sorting and searching of arrays, LSS uses these two operations to cast a similarity join operation as a GPU sort-and-search problem. It first creates, on the fly, a set of space-filling curves on one of its input datasets, using a parallel GPU sort routine. Next, LSS processes each point p of the other dataset in parallel. For each p, it searches an interval of one of the space-filling curves guaranteed to contain all the pairs in which p participates. Using extensive theoretical and experimental analysis, LSS is shown to offer a good balance between time and work efficiency. Experimental results demonstrate that LSS is suitable for similarity joins in large high-dimensional datasets, and that it performs well when compared against two existing prominent similarity join methods.
Detecting Anomalous Trajectories and Behavior Patterns Using Hierarchical Clustering from Taxi GPS Data
(2018)

Anomalous taxi trajectories are those chosen by a small number of drivers that are different from the regular choices of other drivers. These anomalous driving trajectories provide us an opportunity to extract driver or passenger behaviors and monitor adverse urban traffic events. Because various trajectory clustering methods have previously proven to be an effective means to analyze similarities and anomalies within taxi GPS trajectory data, we focus on the problem of detecting anomalous taxi trajectories, and we develop our trajectory clustering method based on the edit distance and hierarchical clustering. To achieve this objective, first, we obtain all the taxi trajectories crossing the same source–destination pairs from taxi trajectories and take these trajectories as clustering objects. Second, an edit distance algorithm is modified to measure the similarity of the trajectories. Then, we distinguish regular trajectories and anomalous trajectories by applying adaptive hierarchical clustering based on an optimal number of clusters. Moreover, we further analyze these anomalous trajectories and discover four anomalous behavior patterns to speculate on the cause of an anomaly based on statistical indicators of time and length. The experimental results show that the proposed method can effectively detect anomalous trajectories and can be used to infer clearly fraudulent driving routes and the occurrence of adverse traffic events.
A 1.6Gbps Digital Clock and Data Recovery Circuit
(2006)

A digital clock and data recovery circuit employs simple 3-level digital-to-analog converters to interface the digital loop filter to the voltage controlled oscillator and achieves low jitter performance. Test chip fabricated in a 0.13mum CMOS process achieves BER < 10-12 , plusmn1500ppm lock-in range, plusmn2500ppm tracking range, recovered clock jitter of 8.9ps rms and consumes 12mW power from a single-pin 1.2V supply, while operating at 1.6Gbps
Deep Convolutional Networks as shallow Gaussian Processes
(2018)

We show that the output of a (residual) convolutional neural network (CNN) with an appropriate prior over the weights and biases is a Gaussian process (GP) in the limit of infinitely many convolutional filters, extending similar results for dense networks. For a CNN, the equivalent kernel can be computed exactly and, unlike “deep kernels”, has very few parameters: only the hyperparameters of the original CNN. Further, we show that this kernel has two properties that allow it to be computed efficiently; the cost of evaluating the kernel for a pair of images is similar to a single forward pass through the original CNN with only one filter per layer. The kernel equivalent to a 32-layer ResNet obtains 0.84% classification error on MNIST, a new record for GPs with a comparable number of parameters. 1
From cyber-physical systems to Industry 4.0: make future manufacturing become possible
(2016)

Recently, ‘Industry 4.0’ has become the supporting force in the manufacturing field. From CPS to Industry 4.0, they are leading a new round of industrial revolution. To meet the fourth industrial revolution, USA, European countries, Japan, South Korea and China have presented different versions of the so-called ‘Industry 4.0’ strategies respectively, which are different from each other in the content, but their common goal is to achieve manufacturing structural adjustment and restructuring and upgrading, to seize a place for future manufacturing, to provide users with better service. What is more, we summarised the five major trends of the future manufacturing. Then, we introduce some enabling technologies about Industry 4.0, among them, CPS plays a key role in the Industry 4.0 factory. Based on the customer to business (C2B) mode, we regard everything as a service, and propose a structure of Industry 4.0. Finally, the automotive industry as an example, we make a brief introduction about an Industry 4.0 case. [Received 15 December 2015; Revised 30 May 2016; Accepted 30 May 2016]
Line-start synchronous reluctance motors: Design guidelines and testing via active inertia emulation
(2015)

Line-Start Synchronous Reluctance (LS-SyR) Motors are a viable solution to reach IE4 efficiency class with the frame size of induction motors having standard efficiency. The proposed paper reviews the guidelines for the design of LS-SyR machines and introduces a new technique for testing their capability of load synchronization. Design wise, the efficiency at synchronous speed and the load pull-in capability must be traded off. The key design principles of LS-SyR machines are reviewed in this sense, and two manufacturing solutions are proposed for comparison. A new experimental method for the evaluation of the pull-in characteristic is proposed. The test fixture consists of a torque-controlled ac drive load, equipped with a shaft accelerometer. The load applied to the line-start machine under test is augmented with a component proportional to the acceleration measurement, to emulate additional inertia.
Toward De-Anonymizing Bitcoin by Mapping Users Location
(2015)

The Bitcoin system (https://bitcoin.org) is a pseudo-anonymous currency that can dissociate a user from any real-world identity. In that context, a successful breach of the virtual and physical divide represents a signficant aw in the Bit-coin system [1]. In this project we demonstrate how to glean information about the real-world users behind Bitcoin transactions. We analyze publicly available data about the cryptocurrency. In particular, we focus on determining information about a Bitcoin user's physical location by examining that user's spending habits.
Twitter spam detection based on deep learning
(2017)

Twitter spam has long been a critical but difficult problem to be addressed. So far, researchers have developed a series of machine learning-based methods and blacklisting techniques to detect spamming activities on Twitter. According to our investigation, current methods and techniques have achieved the accuracy of around 80%. However, due to the problems of spam drift and information fabrication, these machine-learning based methods cannot efficiently detect spam activities in real-life scenarios. Moreover, the blacklisting method cannot catch up with the variations of spamming activities as manually inspecting suspicious URLs is extremely time-consuming. In this paper, we proposed a novel technique based on deep learning techniques to address the above challenges. The syntax of each tweet will be learned through WordVector Training Mode. We then constructed a binary classifier based on the preceding representation dataset. In experiments, we collected and implemented a 10-day real Tweet datasets in order to evaluate our proposed method. We first studied the performance of different classifiers, and then compared our method to other existing text-based methods. We found that our method largely outperformed existing methods. We further compared our method to non-text-based detection techniques. According to the experiment results, our proposed method was more accurate.
Random telegraph noise (RTN) in scaled RRAM devices
(2013)

The random telegraph noise (RTN) related read instability in resistive random access memory (RRAM) is evaluated by employing the RTN peak-to-peak (P-p) amplitude as a figure of merit (FoM). Variation of the FoM value over multiple set/reset cycles is found to follow the log-normal distribution. P-p decreases with the reduction of the read current, which allows scaling of the RRAM operating current. The RTN effect is attributed to the mechanism of activation/deactivation of the electron traps in (in HRS) or near (in LRS) the filament that affects the current through the RRAM device.
Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners
(2013)

When designing state-of-the-art, domain-independent planning systems, many decisions have to be made with respect to the domain analysis or compilation performed during preprocessing, the heuristic functions used during search, and other features of the search algorithm. These design decisions can have a large impact on the performance of the resulting planner. By providing many alternatives for these choices and exposing them as parameters, planning systems can in principle be configured to work well on different domains. However, usually planners are used in default configurations that have been chosen because of their good average performance over a set of benchmark domains, with limited experimentation of the potentially huge range of possible configurations. In this work, we propose a general framework for automatically configuring a parameterized planner, showing that substantial performance gains can be achieved. We apply the framework to the well-known LPG planner, which has 62 parameters and over 6.5 × 10 possible configurations. We demonstrate that by using this highly parameterized planning system in combination with the off-the-shelf, state-of-the-art automatic algorithm configuration procedure ParamILS, the planner can be specialized obtaining significantly improved performance.
Screen Printing of Highly Loaded Silver Inks on Plastic Substrates Using Silicon Stencils.
(2015)

Screen printing is a potential technique for mass-production of printed electronics; however, improvement in printing resolution is needed for high integration and performance. In this study, screen printing of highly loaded silver ink (77 wt %) on polyimide films is studied using fine-scale silicon stencils with openings ranging from 5 to 50 μm wide. This approach enables printing of high-resolution silver lines with widths as small as 22 μm. The printed silver lines on polyimide exhibit good electrical properties with a resistivity of 5.5×10(-6) Ω cm and excellent bending tolerance for bending radii greater than 5 mm (tensile strains less than 0.75%).
Minimum Error Rate Training in Statistical Machine Translation
(2003)

Often, the training procedure for statistical machine translation models is based on maximum likelihood or related criteria. A general problem of this approach is that there is only a loose relation to the final translation quality on unseen text. In this paper, we analyze various training criteria which directly optimize translation quality. These training criteria make use of recently proposed automatic evaluation metrics. We describe a new algorithm for efficient training an unsmoothed error count. We show that significantly better results can often be obtained if the final evaluation criterion is taken directly into account as part of the training procedure.
Bayesian Unsupervised Word Segmentation with Nested Pitman-Yor Language Modeling
(2009)

In this paper, we propose a new Bayesian model for fully unsupervised word segmentation and an efficient blocked Gibbs sampler combined with dynamic programming for inference. Our model is a nested hierarchical Pitman-Yor language model, where Pitman-Yor spelling model is embedded in the word model. We confirmed that it significantly outperforms previous reported results in both phonetic transcripts and standard datasets for Chinese and Japanese word segmentation. Our model is also considered as a way to construct an accurate word n-gram language model directly from characters of arbitrary language, without any “word” indications.
The Mathematics of Statistical Machine Translation: Parameter Estimation
(1993)

We describe a series o,f five statistical models o,f the translation process and give algorithms,for estimating the parameters o,f these models given a set o,f pairs o,f sentences that are translations o,f one another. We define a concept o,f word-by-word alignment between such pairs o,f sentences. For any given pair of such sentences each o,f our models assigns a probability to each of the possible word-by-word alignments. We give an algorithm for seeking the most probable o,f these alignments. Although the algorithm is suboptimal, the alignment thus obtained accounts well for the word-by-word relationships in the pair o,f sentences. We have a great deal o,f data in French and English from the proceedings o,f the Canadian Parliament. Accordingly, we have restricted our work to these two languages; but we,feel that because our algorithms have minimal linguistic content they would work well on other pairs o,f languages. We also ,feel, again because of the minimal linguistic content o,f our algorithms, that it is reasonable to argue that word-by-word alignments are inherent in any sufficiently large bilingual corpus.
Occupational therapy interventions for employment and education for adults with serious mental illness: a systematic review.
(2011)

In this systematic review, we investigated research literature evaluating the effectiveness of occupational therapy interventions focusing on participation and performance in occupations related to paid and unpaid employment and education for people with serious mental illness. The review included occupation- and activity-based interventions and interventions addressing performance skills, aspects of the environment, activity demands, and client factors. The results indicate that strong evidence exists for the effectiveness of supported employment using individual placement and support to result in competitive employment. These outcomes are stronger when combined with cognitive or social skills training. Supported education programs emphasizing goal setting, skill development, and cognitive training result in increased participation in educational pursuits. The evidence for instrumental activities of daily living interventions that targeted specific homemaking occupations and supported parenting was limited but positive. Environmental cognitive supports, such as signs, and other compensatory strategies are useful in managing maladaptive behavior.
THE FUNCTIONAL APPROACH TO THE STUDY OF ATTITUDES
(2005)

At the psychological level the reasons for holding or for changing attitudes are found in the functions they perform for the individual, specifically the functions of adjustment, ego defense, value expression, and knowledge. The conditions necessary to arouse or modify an attitude vary according to the motivational basis of the attitude. Ego-defensive attitudes, for example, can be aroused by threats, appeals to hatred and repressed impulses, and authoritarian suggestion, and can be changed by removal of threat, catharsis, and self-insight. Expressive attitudes are aroused by cues associated with the individual's values and by the need to reassert his self-image and can be changed by showing the appropriateness of the new or modified beliefs to the self-concept Brain washing is primarily directed at the value-expressive function and operates by controlling all environmental supports of old values. Changing attitudes may involve generalization of change to related areas of belief and feeling. Minimal generalization seems to be the rule among adults; for example, in politics voting for an opposition candidate does not have much effect upon party identification. The author is Professor of Psychology at the University of Michigan, former president of the Society for the Psychological Study of Social Issues, and coeditor of Research Methods in the Behavioral Sciences and Public Opinion and Propaganda.
A method for classifying medical images using transfer learning: A pilot study on histopathology of breast cancer
(2017)

The advance of deep learning has made huge changes in computer vision and produced various off-the-shelf trained models. Particularly, Convolutional Neural Network (CNN) has been widely used to build image classification model which allow researchers transfer the pre-trained learning model for other classifications. We propose a transfer learning method to detect breast cancer using histopathology images based on Google's Inception v3 model which were initially trained for the classification of non-medical images. The pilot study shows the feasibility of transfer learning in the detection of breast cancer with AUC of 0.93.
Escape loneliness by going digital: a quantitative and qualitative evaluation of a Dutch experiment in using ECT to overcome loneliness among older adults.
(2007)

BACKGROUND
This study evaluates the outcomes of an Internet-at-home intervention experiment that intended to decrease loneliness among chronically ill and physically handicapped older adults through introducing them to the use of an electronic communication facility.


METHOD
To determine the effectiveness of the experiment in terms of reducing loneliness, 15 older adults were interviewed three times: shortly before the start, two years later and immediately after termination of the experiment, while their loneliness scores at zero and post-measurement were compared with those of a control group.


RESULTS
Both the participants and the control persons experienced a reduction in loneliness over time. However, the reduction was only significant for the intervention participants. Moreover, the changes in loneliness were significantly greater among the participants compared to the control persons. When looking more in detail, the effect of the experiment was only significant regarding emotional loneliness and among the highest educated. Findings of the qualitative research enabled us to understand the mechanisms through which the intervention helped alleviate loneliness. E-mail was found to facilitate social contact. Furthermore, the computer and Internet were often used to pass the time, taking people's minds off their loneliness. Unexpectedly, the intervention also improved people's self-confidence.


CONCLUSION
The decline in loneliness is likely to be greater if persons under more favorable circumstances are selected and if more social functions of the Internet are used.
Semantic Foggy Scene Understanding with Synthetic Data
(2018)

This work addresses the problem of semantic foggy scene understanding (SFSU). Although extensive research has been performed on image dehazing and on semantic scene understanding with clear-weather images, little attention has been paid to SFSU. Due to the difficulty of collecting and annotating foggy images, we choose to generate synthetic fog on real images that depict clear-weather outdoor scenes, and then leverage these partially synthetic data for SFSU by employing state-of-the-art convolutional neural networks (CNN). In particular, a complete pipeline to add synthetic fog to real, clear-weather images using incomplete depth information is developed. We apply our fog synthesis on the Cityscapes dataset and generate Foggy Cityscapes with 20,550 images. SFSU is tackled in two ways: (1) with typical supervised learning, and (2) with a novel type of semi-supervised learning, which combines (1) with an unsupervised supervision transfer from clear-weather images to their synthetic foggy counterparts. In addition, we carefully study the usefulness of image dehazing for SFSU. For evaluation, we present Foggy Driving, a dataset with 101 real-world images depicting foggy driving scenes, which come with ground truth annotations for semantic segmentation and object detection. Extensive experiments show that (1) supervised learning with our synthetic data significantly improves the performance of state-of-the-art CNN for SFSU on Foggy Driving; (2) our semi-supervised learning strategy further improves performance; and (3) image dehazing marginally advances SFSU with our learning strategy. The datasets, models and code are made publicly available.