SoroushVahidi/scidocs huggingface dataset:
Understanding Technology Adoption : Theory and Future Directions for Informal Learning
(2011)

How and why individuals adopt innovations has motivated a great deal of research. This article examines individuals' computing adoption processes through the lenses of three adoption theories: Rogers's innovation diffusion theory, the Concerns-Based Adoption Model, the Technology Acceptance Model, and the United Theory of Acceptance and Use of Technology. Incorporating all three models, this article suggests technology adoption is a complex, inherently social, developmental process; individuals construct unique yet malleable perceptions of technology that influence their adoption decisions. Thus, successfully facilitating technology adoption must address cognitive, emotional, and contextual concerns. This article also focuses specific attention on adoption theory outside of a formal organization and the implications of adoption theory on informal environments. For a crime against the gods—the specifics of which are variously reported—he was condemned to an eternity at hard labor. And frustrating labor at that. For his assignment was to roll a great boulder to the top of a hill. Only every time Sisyphus, by the greatest of exertion and toil, attained the summit, the darn thing rolled back down again.
From natural language requirements to UML class diagrams
(2015)

Unified Modeling Language (UML) is the most popular modeling language for analysis, design and development of the software system. There has been a lot of research interest in generating these UML models, especially class diagrams, automatically from Natural Language requirements. The interest in class diagrams can be attributed to the fact that classes represent the abstractions present in the system to be developed. However, automated generation of UML class diagrams is a challenging task as it involves lot of pre-processing or manual intervention at times. In this paper, we present dependency analysis based approach to derive UML class diagrams automatically from Natural Language requirements. We transform the requirements statements to an intermediary frame-based structured representation using dependency analysis of requirements statements and the Grammatical Knowledge Patterns. The knowledge stored in the frame-based structured representation is used to derive class diagrams using rule-based algorithm. Our approach has generated similar class diagrams as reported in earlier works based on linguistic analysis with either annotation or manual intervention. We present the effectiveness of our approach in terms of recall and precision for the case-studies presented in earlier works.
Health Effects Related to Wind Turbine Noise Exposure: A Systematic Review
(2014)

BACKGROUND
Wind turbine noise exposure and suspected health-related effects thereof have attracted substantial attention. Various symptoms such as sleep-related problems, headache, tinnitus and vertigo have been described by subjects suspected of having been exposed to wind turbine noise.


OBJECTIVE
This review was conducted systematically with the purpose of identifying any reported associations between wind turbine noise exposure and suspected health-related effects.


DATA SOURCES
A search of the scientific literature concerning the health-related effects of wind turbine noise was conducted on PubMed, Web of Science, Google Scholar and various other Internet sources.


STUDY ELIGIBILITY CRITERIA
All studies investigating suspected health-related outcomes associated with wind turbine noise exposure were included.


RESULTS
Wind turbines emit noise, including low-frequency noise, which decreases incrementally with increases in distance from the wind turbines. Likewise, evidence of a dose-response relationship between wind turbine noise linked to noise annoyance, sleep disturbance and possibly even psychological distress was present in the literature. Currently, there is no further existing statistically-significant evidence indicating any association between wind turbine noise exposure and tinnitus, hearing loss, vertigo or headache.


LIMITATIONS
Selection bias and information bias of differing magnitudes were found to be present in all current studies investigating wind turbine noise exposure and adverse health effects. Only articles published in English, German or Scandinavian languages were reviewed.


CONCLUSIONS
Exposure to wind turbines does seem to increase the risk of annoyance and self-reported sleep disturbance in a dose-response relationship. There appears, though, to be a tolerable level of around LAeq of 35 dB. Of the many other claimed health effects of wind turbine noise exposure reported in the literature, however, no conclusive evidence could be found. Future studies should focus on investigations aimed at objectively demonstrating whether or not measureable health-related outcomes can be proven to fluctuate depending on exposure to wind turbines.
A near linear time constant factor approximation for Euclidean bichromatic matching (cost)
(2007)

We give an <i>N</i>log<sup><i>O</i>(1)</sup> <i>N</i>-time randomized <i>O</i>(1)-approximation algorithm for computing the cost of minimum bichromatic matching between two planar point-sets of size <i>N</i>.
I Can Has Cheezburger? A Nonparanormal Approach to Combining Textual and Visual Information for Predicting and Generating Popular Meme Descriptions
(2015)

The advent of social media has brought Internet memes, a unique social phenomenon, to the front stage of the Web. Embodied in the form of images with text descriptions, little do we know about the “language of memes”. In this paper, we statistically study the correlations among popular memes and their wordings, and generate meme descriptions from raw images. To do this, we take a multimodal approach—we propose a robust nonparanormal model to learn the stochastic dependencies among the image, the candidate descriptions, and the popular votes. In experiments, we show that combining text and vision helps identifying popular meme descriptions; that our nonparanormal model is able to learn dense and continuous vision features jointly with sparse and discrete text features in a principled manner, outperforming various competitive baselines; that our system can generate meme descriptions using a simple pipeline.
Seeding Deep Learning using Wireless Localization
(2018)

Build accurate DNN models requires training on large labeled, context specific datasets, especially those matching the target scenario. We believe advances in wireless localization, working in unison with cameras, can produce automated annotation of targets on images and videos captured in the wild. Using pedestrian and vehicle detection as examples, we demonstrate the feasibility, benefits, and challenges of an automatic image annotation system. Our work calls for new technical development on passive localization, mobile data analytics, and error-resilient ML models, as well as design issues in user privacy policies.
Mastering the game of Go with deep neural networks and tree search
(2016)

The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves. Here we introduce a new approach to computer Go that uses ‘value networks’ to evaluate board positions and ‘policy networks’ to select moves. These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play. Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0. This is the first time that a computer program has defeated a human professional player in the full-sized game of Go, a feat previously thought to be at least a decade away.
Clinical spinal instability and low back pain.
(2003)

Clinical instability is an important cause of low back pain. Although there is some controversy concerning its definition, it is most widely believed that the loss of normal pattern of spinal motion causes pain and/or neurologic dysfunction. The stabilizing system of the spine may be divided into three subsystems: (1) the spinal column; (2) the spinal muscles; and (3) the neural control unit. A large number of biomechanical studies of the spinal column have provided insight into the role of the various components of the spinal column in providing spinal stability. The neutral zone was found to be a more sensitive parameter than the range of motion in documenting the effects of mechanical destabilization of the spine caused by injury and restabilization of the spine by osteophyle formation, fusion or muscle stabilization. Clinical studies indicate that the application of an external fixator to the painful segment of the spine can significantly reduce the pain. Results of an in vitro simulation of the study found that it was most probably the decrease in the neutral zone, which was responsible for pain reduction. A hypothesis relating the neutral zone to pain has been presented. The spinal muscles provide significant stability to the spine as shown by both in vitro experiments and mathematical models. Concerning the role of neuromuscular control system, increased body sway has been found in patients with low back pain, indicating a less efficient muscle control system with decreased ability to provide the needed spinal stability.
A Study on Balancing Parallelism, Data Locality, and Recomputation in Existing PDE Solvers
(2014)

Structured-grid PDE solver frameworks parallelize over boxes, which are rectangular domains of cells or faces in a structured grid. In the Chombo framework, the box sizes are typically 163 or 323, but larger box sizes such as 1283 would result in less surface area and therefore less storage, copying, and/or ghost cells communication overhead. Unfortunately, current on-node parallelization schemes perform poorly for these larger box sizes. In this paper, we investigate 30 different inter-loop optimization strategies and demonstrate the parallel scaling advantages of some of these variants on NUMA multicore nodes. Shifted, fused, and communication-avoiding variants for 1283 boxes result in close to ideal parallel scaling and come close to matching the performance of 163 boxes on three different multicore systems for a benchmark that is a proxy for program idioms found in Computational Fluid Dynamic (CFD) codes.
A Survey of the Functional Splits Proposed for 5 G Mobile Crosshaul Networks Line
(2018)

Pacing the way towards 5G has lead researchers and industry in the direction of centralized processing known from Cloud-Radio Access Networks (C-RAN). In C-RAN research, a variety of different functional splits is presented by different names and focusing on different directions. The functional split determines how many Base Station (BS) functions to leave locally, close to the user, with the benefit of relaxing fronthaul network bitrate and delay requirements, and how many functions to centralize with the possibility of achieving greater processing benefits. This work presents for the first time a comprehensive overview systematizing the different work directions for both research and industry, while providing a detailed description of each functional split option and an assessment of the advantages and disadvantages. This work gives an overview of where the most effort has been directed in terms of functional splits, and where there is room for further studies. The standardization currently taking place is also considered and mapped into the research directions. It is investigated how the fronthaul network will be affected by the choice of functional split, both in terms of bitrates and latency, and as the different functional splits provide different advantages and disadvantages, the option of flexible functional splits is also looked into. Keywords—Functional Split; Crosshaul; X-haul; C-RAN; Fronthaul; standardization; industry; network architecture; Please refer to the list of acronyms provided in the end of the paper, right before the references.
A Prototype Navigation System for Guiding Blind People Indoors using NXT Mindstorms
(2013)

People with visual impairment face enormous difficulties in terms of their mobility as they do not have enough information about their location and orientation with respect to traffic and obstacles on their route. Visually impaired people can navigate unknown areas by relying on the assistance of canes, other people, or specially trained guide dogs. The traditional ways of using guide dogs and long-cane only help to avoid obstacles, not to know where they are. The research presented in this paper introduces a mobile assistant navigation prototype to locate and direct blind people indoors. Since most of the existing navigation systems developed so far for blind people employ a complex conjunction of positioning systems, video cameras, locationbased and image processing algorithms, we designed an affordable low-cost prototype navigation system for orienting and tracking the position of blind people in complex environments. The prototype system is based on the inertial navigation system and experiments have been performed on NXT Mindstorms platform.
Online Learning of Weighted Relational Rules for Complex Event Recognition
(2018)

Systems for symbolic complex event recognition detect occurrences of events in time using a set of event definitions in the form of logical rules. The Event Calculus is a temporal logic that has been used as a basis in event recognition applications, providing among others, connections to techniques for learning such rules from data. We advance the state-of-the-art by combining an existing online algorithm for learning crisp relational structure with an online method for weight learning in Markov Logic Networks (MLN). The result is an algorithm that learns complex event patterns in the form of Event Calculus theories in the MLN semantics. We evaluate our approach on a challenging real-world application for activity recognition and show that it outperforms both its crisp predecessor and competing online MLN learners in terms of predictive performance, at the price of a small increase in training time.
Deep Reinforcement Learning for Robotic Manipulation
(2016)

Reinforcement learning holds the promise of enabling autonomous robots to learn large repertoires of behavioral skills with minimal human intervention. However, robotic applications of reinforcement learning often compromise the autonomy of the learning process in favor of achieving training times that are practical for real physical systems. This typically involves introducing hand-engineered policy representations and human-supplied demonstrations. Deep reinforcement learning alleviates this limitation by training general-purpose neural network policies, but applications of direct deep reinforcement learning algorithms have so far been restricted to simulated settings and relatively simple tasks, due to their apparent high sample complexity. In this paper, we demonstrate that a recent deep reinforcement learning algorithm based on offpolicy training of deep Q-functions can scale to complex 3D manipulation tasks and can learn deep neural network policies efficiently enough to train on real physical robots. We demonstrate that the training times can be further reduced by parallelizing the algorithm across multiple robots which pool their policy updates asynchronously. Our experimental evaluation shows that our method can learn a variety of 3D manipulation skills in simulation and a complex door opening skill on real robots without any prior demonstrations or manually designed representations.
Gradient and Curvature from Photometric Stereo Including Local Confidence Estimation
(2003)

Photometric stereo is one technique for 3D shape determination that has been implemented in a variety of experimental settings and that has produced consistently good results. The idea is to use intensity values recorded from multiple images obtained from the same viewpoint but under different conditions of illumination. The resulting radiometric constraint makes it possible to obtain local estimates of both surface orientation and surface curvature without requiring global smoothness assumptions and without requiring prior image segmentation. This paper moves photometric stereo one step closer to practical viability by describing an experimental setting in which surface gradient estimation is achieved on full frame video data at near video frame rates (i.e., 15Hz). The implementation uses commercially available hardware. Reflectance is modeled empirically using measurements obtained from a calibration sphere. Estimation of the gradient, (p, q), requires only simple table lookup. Curvature estimation uses, in addition, the reflectance map, R(p, q). The required lookup table and reflectance maps are derived during calibration. Because reflectance is modeled empirically, no prior physical model of the reflectance characteristics of the objects to be analyzed is assumed. At the same time, if a good physical model is available, it can be retrofit to the method for implementation purposes. Photometric stereo is subject to error in the presence of cast shadows and interreflection. No purely local technique can succeed since these phenomena are inherently non-local. Nevertheless, this paper demonstrates that one can exploit the redundancy in three light source photometric stereo to, in most cases, locally detect the presence of cast shadows and interreflection. Detection is facilitated by explicitly including a local confidence estimate in the lookup table used for gradient estimation.
Anatomisation with slicing: a new privacy preservation approach for multiple sensitive attributes
(2016)

An enormous quantity of personal health information is available in recent decades and tampering of any part of this information imposes a great risk to the health care field. Existing anonymization methods are only apt for single sensitive and low dimensional data to keep up with privacy specifically like generalization and bucketization. In this paper, an anonymization technique is proposed that is a combination of the benefits of anatomization, and enhanced slicing approach adhering to the principle of k-anonymity and l-diversity for the purpose of dealing with high dimensional data along with multiple sensitive data. The anatomization approach dissociates the correlation observed between the quasi identifier attributes and sensitive attributes (SA) and yields two separate tables with non-overlapping attributes. In the enhanced slicing algorithm, vertical partitioning does the grouping of the correlated SA in ST together and thereby minimizes the dimensionality by employing the advanced clustering algorithm. In order to get the optimal size of buckets, tuple partitioning is conducted by MFA. The experimental outcomes indicate that the proposed method can preserve privacy of data with numerous SA. The anatomization approach minimizes the loss of information and slicing algorithm helps in the preservation of correlation and utility which in turn results in reducing the data dimensionality and information loss. The advanced clustering algorithms prove its efficiency by minimizing the time and complexity. Furthermore, this work sticks to the principle of k-anonymity, l-diversity and thus avoids privacy threats like membership, identity and attributes disclosure.
Leveraging Deep Neural Networks and Knowledge Graphs for Entity Disambiguation
(2015)

Entity Disambiguation aims to link mentions of ambiguous entities to a knowledge base (e.g., Wikipedia). Modeling topical coherence is crucial for this task based on the assumption that information from the same semantic context tends to belong to the same topic. This paper presents a novel deep semantic relatedness model (DSRM) based on deep neural networks (DNN) and semantic knowledge graphs (KGs) to measure entity semantic relatedness for topical coherence modeling. The DSRM is directly trained on large-scale KGs and it maps heterogeneous types of knowledge of an entity from KGs to numerical feature vectors in a latent space such that the distance between two semantically-related entities is minimized. Compared with the state-ofthe-art relatedness approach proposed by (Milne and Witten, 2008a), the DSRM obtains 19.4% and 24.5% reductions in entity disambiguation errors on two publicly available datasets respectively.
AN AUTOMATIC SYSTEM FOR DETECTING AND COUNTING RBC AND WBC USING FUZZY LOGIC
(2016)

Blood cell detection and counting is the initial process for detecting and diagnosing diseases. Several image processing algorithms are there for the blood cell classification and counting. The processed image helps to detect different blood related diseases. In all those algorithms several pre-processing steps are there for the process of detection and counting. Though all the algorithms give accurate results, the pre-processing steps are complex and time-consuming. This paper discusses about the RBC and WBC detection using fuzzy logic. Fuzzy logic toolbox software in MATLAB is used to develop the model on virtual platform.
Evoked-potential correlates of stimulus uncertainty.
(1965)

The average evoked-potential waveforms to sound and light stimuli recorded from scalp in awake human subjects show differences as a function of the subject's degree of uncertainty with respect to the sensory modality of the stimulus to be presented. Differences are also found in the evoked potential as a function of whether or not the sensorymodality of the stimulus was anticipated correctly. The major waveform alteration is in the amplitude of a positive-going component which reaches peak amplitude at about 300 milliseconds.
Development of DC to Single-Phase AC Voltage Source Inverter With Active Power Decoupling Based on Flying Capacitor DC/DC Converter
(2018)

In the present, a power decoupling method without additional component is proposed for a dc to single-phase ac converter, which consists of a flying capacitor dc/dc converter (FCC) and the voltage source inverter (VSI). In particular, a small flying capacitor in the FCC is used for both a boost operation and a double-line-frequency power ripple reduction. Thus, the dc-link capacitor value can be minimized in order to avoid the use of a large electrolytic capacitor. In addition, component design, of, e.g., the boost inductor and the flying capacitor, is clarified when the proposed control is applied. Experiments were carried out using a 1.5-kW prototype in order to verify the validity of the proposed control. The experimental results revealed that the use of the proposed control reduced the dc-link voltage ripple by 74.5%, and the total harmonic distortion (THD) of the inverter output current was less than 5%. Moreover, a maximum system efficiency of 95.4% was achieved at a load of 1.1 kW. Finally, the high power density design is evaluated by the Pareto front optimization. The power densities of three power decoupling topologies, such as a boost topology, a buck topology, and the proposed topology are compared. As a result, the proposed topology achieves the highest power density (5.3 kW/dm3) among the topologies considered herein.