SoroushVahidi/scidocs huggingface dataset:
Learning from mistakes: towards a correctable learning algorithm
(2012)

Many learning algorithms generate complex models that are difficult for a human to interpret, debug, and extend. In this paper, we address this challenge by proposing a new learning paradigm called correctable learning, where the learning algorithm receives external feedback about which data examples are incorrectly learned. We define a set of metrics which measure the correctability of a learning algorithm. We then propose a simple and efficient correctable learning algorithm which learns local models for different regions of the data space. Given an incorrect example, our method samples data in the neighborhood of that example and learns a new, more correct local model over that region. Experiments over multiple classification and ranking datasets show that our correctable learning algorithm offers significant improvements over the state-of-the-art techniques.
Wrapper Induction for Information Extraction
(1997)

Many Internet information resources present relational data|telephone directories, product catalogs, etc. Because these sites are formatted for people, mechanically extracting their content is di cult. Systems using such resources typically use hand-coded wrappers, procedures to extract data from information resources. We introduce wrapper induction, a method for automatically constructing wrappers, and identify hlrt, a wrapper class that is e ciently learnable, yet expressive enough to handle 48% of a recently surveyed sample of Internet resources. We use PAC analysis to bound the problem's sample complexity, and show that the system degrades gracefully with imperfect labeling knowledge.
Achieving Secure, Universal, and Fine-Grained Query Results Verification for Secure Search Scheme over Encrypted Cloud Data
(2017)

Secure search techniques over encrypted cloud data allow an authorized user to query data files of interest by submitting encrypted query keywords to the cloud server in a privacy-preserving manner. However, in practice, the returned query results may be incorrect or incomplete in the dishonest cloud environment. For example, the cloud server may intentionally omit some qualified results to save computational resources and communication overhead. Thus, a well-functioning secure query system should provide a query results verification mechanism that allows the data user to verify results. In this paper, we design a secure, easily integrated, and fine-grained query results verification mechanism, by which, given an encrypted query results set, the query user not only can verify the correctness of each data file in the set but also can further check how many or which qualified data files are not returned if the set is incomplete before decryption. The verification scheme is loose-coupling to concrete secure search techniques and can be very easily integrated into any secure query scheme. We achieve the goal by constructing secure verification object for encrypted cloud data. Furthermore, a short signature technique with extremely small storage cost is proposed to guarantee the authenticity of verification object and a verification object request technique is presented to allow the query user to securely obtain the desired verification object. Performance evaluation shows that the proposed schemes are practical and efficient.
Collective Opinion Target Extraction in Chinese Microblogs
(2013)

Microblog messages pose severe challenges for current sentiment analysis techniques due to some inherent characteristics such as the length limit and informal writing style. In this paper, we study the problem of extracting opinion targets of Chinese microblog messages. Such fine-grained word-level task has not been well investigated in microblogs yet. We propose an unsupervised label propagation algorithm to address the problem. The opinion targets of all messages in a topic are collectively extracted based on the assumption that similar messages may focus on similar opinion targets. Topics in microblogs are identified by hashtags or using clustering algorithms. Experimental results on Chinese microblogs show the effectiveness of our framework and algorithms.
Voting models in random networks
(2010)

A crucial problem of Social Sciences is under what conditions agreement, or disagreement, emerge in a network of interacting agents. This topic has application in many contexts, including business and marketing decisions, with potential impact on information and technological networks. In this paper we consider a particular model of interaction between a group of individuals connected through a network of acquaintances. In the first model, a node waits an exponentially time with parameter one, and when it expires it chooses one of its neighbors' at random and adopts its decision. In the second one, the node chooses the opinion which is the most adopted by its neighbors (hence, majority rule). We show how different updating rule of the agent' state lead to different emerging patterns, namely, agreement and disagreement. In addition, in the case of agreement, we provide bounds on the time to convergence for various types of graphs.
Evolving Graphs and Networks with Edge Encoding: Preliminary Report
(1996)

We present an alternative to the cellular encoding technique [Gruau 1992] for evolving graph and network structures via genetic programming. The new technique, called edge encoding, uses edge operators rather than the node operators of cellular encoding. While both cellular encoding and edge encoding can produce all possible graphs, the two encodings bias the genetic search process in different ways; each may therefore be most useful for a different set of problems. The problems for which these techniques may be used, and for which we think edge encoding may be particularly useful, include the evolution of recurrent neural networks, finite automata, and graph-based queries to symbolic knowledge bases. In this preliminary report we present a technical description of edge encoding and an initial comparison to cellular encoding. Experimental investigation of the relative merits of these encoding schemes is currently in progress.
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
(2006)

We propose a fast algorithm, EMD-L1, for computing the Earth Mover’s Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely simplified structure. The number of unknown variables in EMD-L1 is O(N) that is significantly less than O(N) of the original EMD for a histogram with N bins. In addition, the number of constraints is reduced by half and the objective function is also simplified. We prove that the EMD-L1 is formally equivalent to the original EMD with L1 ground distance without approximation. Exploiting the L1 metric structure, an efficient tree-based algorithm is designed to solve the EMD-L1 computation. An empirical study demonstrates that the new algorithm has the time complexity of O(N), which is much faster than previously reported algorithms with super-cubic complexities. The proposed algorithm thus allows the EMD to be applied for comparing histogram-based features, which is practically impossible with previous algorithms. We conducted experiments for shape recognition and interest point matching. EMD-L1 is applied to compare shape contexts on the widely tested MPEG7 shape dataset and SIFT image descriptors on a set of images with large deformation, illumination change and heavy noise. The results show that our EMD-L1based solutions outperform previously reported state-of-the-art features and distance measures in solving the two tasks.
Boxlets: A Fast Convolution Algorithm for Signal Processing and Neural Networks
(1998)

Signal processing and pattern recognition algorithms make extensive use of convolution. In many cases, computational accuracy is not as important as computational speed. In feature extraction, for instance, the features of interest in a signal are usually quite distorted. This form of noise justi es some level of quantization in order to achieve faster feature extraction. Our approach consists of approximating regions of the signal with low degree polynomials, and then di erentiating the resulting signals in order to obtain impulse functions (or derivatives of impulse functions). With this representation, convolution becomes extremely simple and can be implemented quite e ectively. The true convolution can be recovered by integrating the result of the convolution. This method yields substantial speed up in feature extraction and is applicable to convolutional neural networks.
Robust Real-time Object Detection
(2001)

This paper describes a visual object detection framework that is capable of processing images extremely rapidly while achieving high detection rates. There are three key contributions. The first is the introduction of a new image representation called the “Integral Image” which allows the features used by our detector to be computed very quickly. The second is a learning algorithm, based on AdaBoost, which selects a small number of critical visual features and yields extremely efficient classifiers [6]. The third contribution is a method for combining classifiers in a “cascade” which allows background regions of the image to be quickly discarded while spending more computation on promising object-like regions. A set of experiments in the domain of face detection are presented. The system yields face detection performace comparable to the best previous systems [18, 13, 16, 12, 1]. Implemented on a conventional desktop, face detection proceeds at 15 frames per second.
Modeling of a Vertical Axis Wind Turbine with Permanent Magnet Synchronous Generator for Nigeria
(2013)

The performances of a vertical axis wind turbine (VAWT) with permanent magnet synchronous generator (PMSG) under low and unsteady wind speed is investigated and Modelled in this paper. The ever increasing demand for electrical energy has led to the continuous search for the most readily available means of providing electricity. Wind turbine is an alternative source of electricity. To implement a wind turbine, careful and extensive investigation is required since different environments or geographical locations call for different wind speed. Nigeria is a typical example of locations with low and unsteady wind speed. The wind turbine system consists of three main parts; the wind speed, the turbine and the generator. A three phase PMSG is chosen in this work due to its higher efficiency and less need for maintenance when compared to other types of generators. It does not require rotor windings which imply a reduction of weight and cost. These elements and entire idea of this work have been modelled and simulated using MATLAB/ SIMULINK. Results obtained showed good system performance. The methodology used in this work, if fully implemented, will not only reduce the cost of design but will also reduce the cost of maintenance, making it economical and affordable.
PUF-FSM: A Controlled Strong PUF
(2018)

Existing strong controlled physical unclonable function (PUF) designs are built to resist modeling attacks and they deal with noisy PUF responses by exploiting error correction logic. These designs are burdened by the costs of the error correction logic and information shown to leak through the associated helper data for assisting error corrections; leaving the design vulnerable to fault attacks or reliability-based attacks. We present a hybrid PUF–finite state machine (PUF-FSM) construction to realize a controlled strong PUF. The PUF-FSM design removes the need for error correction logic and related computation, storage of the helper data and loading it on-chip by only employing error-free responses judiciously determined on demand in the absence of the underlying PUF—an Arbiter PUF—with a large challenge response pair space. The PUF-FSM demonstrates improved security, especially to reliability-based attacks and is able to support a range of applications from authentication to more advanced cryptographic applications built upon shared keys. We experimentally validate the practicability of the PUF-FSM.
A Machine Learning Based Intrusion Detection System for Software Defined 5G Network
(2017)

As an inevitable trend of future 5G networks, Software Defined architecture has many advantages in providing centralized control and flexible resource management. But it is also confronted with various security challenges and potential threats with emerging services and technologies. As the focus of network security, Intrusion Detection Systems (IDS) are usually deployed separately without collaboration. They are also unable to detect novel attacks with limited intelligent abilities, which are hard to meet the needs of software defined 5G. In this paper, we propose an intelligent intrusion system taking the advances of software defined technology and artificial intelligence based on Software Defined 5G architecture. It flexibly combines security function modules which are adaptively invoked under centralized management and control with a globle view. It can also deal with unknown intrusions by using machine learning algorithms. Evaluation results prove that the intelligent intrusion detection system achieves a better performance.
Medusa: Simplified Graph Processing on GPUs
(2014)

Graphs are common data structures for many applications, and efficient graph processing is a must for application performance. Recently, the graphics processing unit (GPU) has been adopted to accelerate various graph processing algorithms such as BFS and shortest paths. However, it is difficult to write correct and efficient GPU programs and even more difficult for graph processing due to the irregularities of graph structures. To simplify graph processing on GPUs, we propose a programming framework called Medusa which enables developers to leverage the capabilities of GPUs by writing sequential C/C++ code. Medusa offers a small set of user-defined APIs and embraces a runtime system to automatically execute those APIs in parallel on the GPU. We develop a series of graph-centric optimizations based on the architecture features of GPUs for efficiency. Additionally, Medusa is extended to execute on multiple GPUs within a machine. Our experiments show that 1) Medusa greatly simplifies implementation of GPGPU programs for graph processing, with many fewer lines of source code written by developers and 2) the optimization techniques significantly improve the performance of the runtime system, making its performance comparable with or better than manually tuned GPU graph operations.
Efficacy of Topical Combination of 0.25% Finasteride and 3% Minoxidil Versus 3% Minoxidil Solution in Female Pattern Hair Loss: A Randomized, Double-Blind, Controlled Study.
(2018)

BACKGROUND
The relationship between female pattern hair loss (FPHL) and androgenic hormones is not well established, but some evidence indicates oral finasteride may be efficacious in FPHL. Use of a topical formulation has been proposed to minimize unwanted effects.


OBJECTIVES
Our objective was to compare the efficacy and safety of topical 0.25% finasteride combined with 3% minoxidil solution and 3% minoxidil solution as monotherapy in the treatment of FPHL.


METHODS
This was a prospective, randomized, double-blind study in 30 postmenopausal women with FPHL. Each participant was randomized to receive either topical 0.25% finasteride combined with topical 3% minoxidil or topical 3% minoxidil solution as monotherapy for 24 weeks. To determine efficacy, the hair density and diameter was measured and global photographic assessment was conducted at baseline and 8, 16, and 24 weeks. Side effects and serum dihydrotestosterone levels were also evaluated.


RESULTS
By 24 weeks, hair density and diameter had increased in both groups, and finasteride/minoxidil was significantly superior to minoxidil solution in terms of hair diameter (p = 0.039). No systemic side effects were reported. However, serum dihydrotestosterone levels in the finasteride/minoxidil group significantly decreased from baseline (p = 0.016).


CONCLUSION
A topical combination of 0.25% finasteride and 3% minoxidil may be a promising option in the treatment of FPHL with an additional benefit of increasing hair diameter. Nevertheless, as it may be absorbed percutaneously, it should be reserved for postmenopausal women.


TRIAL REGISTRATION
clinicaltrials.in.th; identifier TCTR20160912002.
Exercise treatment for major depression: maintenance of therapeutic benefit at 10 months.
(2000)

OBJECTIVE
The purpose of this study was to assess the status of 156 adult volunteers with major depressive disorder (MDD) 6 months after completion of a study in which they were randomly assigned to a 4-month course of aerobic exercise, sertraline therapy, or a combination of exercise and sertraline.


METHODS
The presence and severity of depression were assessed by clinical interview using the Diagnostic Interview Schedule and the Hamilton Rating Scale for Depression (HRSD) and by self-report using the Beck Depression Inventory. Assessments were performed at baseline, after 4 months of treatment, and 6 months after treatment was concluded (ie, after 10 months).


RESULTS
After 4 months patients in all three groups exhibited significant improvement; the proportion of remitted participants (ie, those who no longer met diagnostic criteria for MDD and had an HRSD score <8) was comparable across the three treatment conditions. After 10 months, however, remitted subjects in the exercise group had significantly lower relapse rates (p = .01) than subjects in the medication group. Exercising on one's own during the follow-up period was associated with a reduced probability of depression diagnosis at the end of that period (odds ratio = 0.49, p = .0009).


CONCLUSIONS
Among individuals with MDD, exercise therapy is feasible and is associated with significant therapeutic benefit, especially if exercise is continued over time.
Hardware Intrinsic Security from Physically Unclonable Functions
(2010)

Counterfeiting of goods in general and of electronic goods in particular is a growing concern with a huge impact on the global economy, the society, and the security of its critical infrastructure. Various examples are known where companies suffer from economic and brand damage due to competition with counterfeit goods. In some cases the use of counterfeit components has even led to tragic accidents in which lives were lost. It has also recently become clear that counterfeit products can penetrate the critical and security infrastructure of our modern societies and hence cause a threat to national security. One of the difficulties to deal with this problem stems from the fact that counterfeit goods can originate from sources that are able to make copies that are very hard to distinguish from their legitimate counterpart. A first well-known aspect of counterfeiting is product cloning. A second much less known but increasingly dangerous aspect consists of overproduction of goods. A special, but modern, case of counterfeiting is theft of Intellectual Property such as software and designs. The attractive part from the attackers’ point of view is that it is relatively easy to steal and has a high value without having to do huge investments in research and development. From a high-level point of view one can state that the attack can be thwarted by using encryption and authentication techniques. Device configuration data or embedded software can, for example, be encrypted such that it will only run on the device possessing the correct cryptographic key. Since encrypted data is still easy to copy, it now becomes essential that the secret key is well protected against copying or cloning. In order to deal with these two aspects of counterfeiting, a secret unclonable identifier is required together with strong cryptographic protocols. In this chapter we focus on a new way to address these problems: Hardware Intrinsic Security. It is based on the implementation and generation of secret physically unclonable identifiers used in conjunction with cryptographic techniques such as encryption and
Development and Applications of CRISPR-Cas9 for Genome Engineering
(2014)

Recent advances in genome engineering technologies based on the CRISPR-associated RNA-guided endonuclease Cas9 are enabling the systematic interrogation of mammalian genome function. Analogous to the search function in modern word processors, Cas9 can be guided to specific locations within complex genomes by a short RNA search string. Using this system, DNA sequences within the endogenous genome and their functional outputs are now easily edited or modulated in virtually any organism of choice. Cas9-mediated genetic perturbation is simple and scalable, empowering researchers to elucidate the functional organization of the genome at the systems level and establish causal linkages between genetic variations and biological phenotypes. In this Review, we describe the development and applications of Cas9 for a variety of research or translational applications while highlighting challenges as well as future directions. Derived from a remarkable microbial defense system, Cas9 is driving innovative applications from basic biology to biotechnology and medicine.
Information overload: why some people seem to suffer more than others
(2006)

We studied information overload among senior managers in an industrial company. We used the critical incident collection technique to gather specific examples of information overload and coping strategies. We then used textual interpretation and the affinity diagram technique to interpret the interviews and to categorize our respondents, the critical incidents they described, and the coping strategies they mentioned. Our results show that the extent to which people suffer from information overload is closely related to the strategies they use to deal with it.
Do you care if a computer says sorry?: user experience design through affective messages
(2012)

While traditional HCI research emphasizes usability based on models of cognition, user experience (UX) focuses on affect and emotion through the provision of positive interactive experiences. Providing affective cues, such as apologetic on-screen display messages, appears to be a way to influence users' affective states as well as their perceptions toward an information retrieval system. A study was designed to determine whether users' affect and perceptions differ between three types of systems: neutral, apologetic, and non-apologetic. Our results revealed that the users perceived the apologetic system as more aesthetically appealing and usable than the neutral or non-apologetic system. The result also showed that users' frustration was the lowest when using the apologetic system. We discuss the implications of these results in designing a more experience-centered system.
Parsing sewing patterns into 3D garments
(2013)

We present techniques for automatically parsing existing sewing patterns and converting them into 3D garment models. Our parser takes a sewing pattern in PDF format as input and starts by extracting the set of panels and styling elements (e.g. darts, pleats and hemlines) contained in the pattern. It then applies a combination of machine learning and integer programming to infer how the panels must be stitched together to form the garment. Our system includes an interactive garment simulator that takes the parsed result and generates the corresponding 3D model. Our fully automatic approach correctly parses 68% of the sewing patterns in our collection. Most of the remaining patterns contain only a few errors that can be quickly corrected within the garment simulator. Finally we present two applications that take advantage of our collection of parsed sewing patterns. Our garment hybrids application lets users smoothly interpolate multiple garments in the 2D space of patterns. Our sketch-based search application allows users to navigate the pattern collection by drawing the shape of panels.