SoroushVahidi/scidocs huggingface dataset:
An algorithm to determine peer-reviewers
(2008)

The peer-review process is the most widely accepted certification mechanism for officially accepting the written results of researchers within the scientific community. An essential component of peer-review is the identification of competent referees to review a submitted manuscript. This article presents an algorithm to automatically determine the most appropriate reviewers for a manuscript by way of a co-authorship network data structure and a relative-rank particle-swarm algorithm. This approach is novel in that it is not limited to a pre-selected set of referees, is computationally efficient, requires no human-intervention, and, in some instances, can automatically identify conflict of interest situations. A useful application of this algorithm would be to open commentary peer-review systems because it provides a weighting for each referee with respects to their expertise in the domain of a manuscript. The algorithm is validated using referee bid data from the 2005 Joint Conference on Digital Libraries.
Health information systems: a survey of frameworks for developing countries.
(2010)

OBJECTIVES
The objective of this paper is to perform a survey of excellent research on health information systems (HIS) analysis and design, and their underlying theoretical frameworks. It classifies these frameworks along major themes, and analyzes the different approaches to HIS development that are practical in resource-constrained environments.


METHOD
Literature review based on PubMed citations and conference proceedings, as well as Internet searches on information systems in general, and health information systems in particular.


RESULTS
The field of health information systems development has been studied extensively. Despite this, failed implementations are still common. Theoretical frameworks for HIS development are available that can guide implementers.


CONCLUSION
As awareness, acceptance, and demand for health information systems increase globally, the variety of approaches and strategies will also follow. For developing countries with scarce resources, a trial-and-error approach can be very costly. Lessons from the successes and failures of initial HIS implementations have been abstracted into theoretical frameworks. These frameworks organize complex HIS concepts into methodologies that standardize techniques in implementation. As globalization continues to impact healthcare in the developing world, demand for more responsive health systems will become urgent. More comprehensive frameworks and practical tools to guide HIS implementers will be imperative.
Applying Deep Learning to the Newsvendor Problem
(2016)

The newsvendor problem is one of the most basic and widely applied inventory models. There are numerous extensions of this problem. If the probability distribution of the demand is known, the problem can be solved analytically. However, approximating the probability distribution is not easy and is prone to error; therefore, the resulting solution to the newsvendor problem may be not optimal. To address this issue, we propose an algorithm based on deep learning that optimizes the order quantities for all products based on features of the demand data. Our algorithm integrates the forecasting and inventory-optimization steps, rather than solving them separately, as is typically done, and does not require knowledge of the probability distributions of the demand. Numerical experiments on real-world data suggest that our algorithm outperforms other approaches, including data-driven and machine learning approaches, especially for demands with high volatility. Finally, in order to show how this approach can be used for other inventory optimization problems, we provide an extension for (r,Q) policies.
Arches: a Framework for Modeling Complex Terrains
(2009)

In this paper, we present a framework for representing complex terrains with such features as overhangs, arches and caves and including different materials such as sand and rocks. Our hybrid model combines a volumetric discrete data structure that stores the different materials and an implicit representation for sculpting and reconstructing the surface of the terrain. Complex scenes can be edited and sculpted interactively with high level tools. We also propose an original rock generation technique that enables us to automatically generate complex rocky sceneries with piles of rocks without any computationally demanding physically-based simulation.
Action Search: Learning to Search for Human Activities in Untrimmed Videos
(2017)

Traditional approaches for action detection use trimmed data to learn sophisticated action detector models. Although these methods have achieved great success at detecting human actions, we argue that huge information is discarded when ignoring the process, through which this trimmed data is obtained. In this paper, we propose Action Search, a novel approach that mimics the way people annotate activities in video sequences. Using a Recurrent Neural Network, Action Search can efficiently explore a video and determine the time boundaries during which an action occurs. Experiments on the THUMOS14 dataset reveal that our model is not only able to explore the video efficiently but also accurately find human activities, outperforming stateof-the-art methods.
Utility-Preserving Differentially Private Data Releases Via Individual Ranking Microaggregation
(2016)

Being able to release and exploit open data gathered in information systems is crucial for researchers, enterprises and the overall society. Yet, these data must be anonymized before release to protect the privacy of the subjects to whom the records relate. Differential privacy is a privacy model for anonymization that offers more robust privacy guarantees than previous models, such as k-anonymity and its extensions. However, it is often disregarded that the utility of differentially private outputs is quite limited, either because of the amount of noise that needs to be added to obtain them or because utility is only preserved for a restricted type and/or a limited number of queries. On the contrary, k-anonymity-like data releases make no assumptions on the uses of the protected data and, thus, do not restrict the number and type of doable analyses. Recently, some authors have proposed mechanisms to offer general-purpose differentially private data releases. This paper extends such works with a specific focus on the preservation of the utility of the protected data. Our proposal builds on microaggregation-based anonymization, which is more flexible and utility-preserving than alternative anonymization methods used in the literature, in order to reduce the amount of noise needed to satisfy differential privacy. In this way, we improve the utility of differentially private data releases. Moreover, the noise reduction we achieve does not depend on the size of the data set, but just on the number of attributes to be protected, which is a more desirable behavior for large data sets. The utility benefits brought by our proposal are empirically evaluated and compared with related works for several data sets and metrics.
The neuropsychiatry of the cerebellum — insights from the clinic
(2007)

A central aspect of the cerebellar cognitive affective syndrome is the dysregulation of affect that occurs when lesions involve the ‘limbic cerebellum’ (vermis and fastigial nucleus). In this case series we describe neuropsychiatric disturbances in adults and children with congenital lesions including cerebellar agenesis, dysplasia, and hypoplasia, and acquired conditions including cerebellar stroke, tumor, cerebellitis, trauma, and neurodegenerative disorders. The behaviors that we witnessed and that were described by patients and families included distractibility and hyperactivity, impulsiveness, disinhibition, anxiety, ritualistic and stereotypical behaviors, illogical thought and lack of empathy, as well as aggression and irritability. Ruminative and obsessive behaviors, dysphoria and depression, tactile defensiveness and sensory overload, apathy, childlike behavior, and inability to appreciate social boundaries and assign ulterior motives were also evident. We grouped these disparate neurobehavioral profiles into five major domains, characterized broadly as disorders of attentional control, emotional control, and social skill set as well as autism spectrum disorders, and psychosis spectrum disorders. Drawing on our dysmetria of thought hypothesis, we conceptualized the symptom complexes within each putative domain as reflecting either exaggeration (overshoot, hypermetria) or diminution (hypotonia, or hypometria) of responses to the internal or external environment. Some patients fluctuated between these two states. We consider the implications of these neurobehavioral observations for the care of patients with ataxia, discuss the broader role of the cerebellum in the pathogenesis of these neuropsychiatric symptoms, and revisit the possibility of using cerebellar stimulation to treat psychiatric disorders by enhancing cerebellar modulation of cognition and emotion.
Neuronal Specificity of Acupuncture in Alzheimer's Disease and Mild Cognitive Impairment Patients: A Functional MRI Study
(2018)

Although acupuncture is considered to be effective and safe for Alzheimer's disease (AD) and mild cognitive impairment (MCI), the mechanism underlying its therapeutic effect is still unknown. Most studies clarifying the neuronal pathway produced by acupuncture were still applied to healthy subjects with limited single acupuncture point stimulation, which was inconsistency with clinical practice. Thus, in our present study, we investigate the differences between brain activity changes in AD and MCI patients caused by multi-acupuncture point Siguan (four gates), in order to provide visualized evidence for neuronal specificity of clinical acupuncture. Forty-nine subjects were recruited, including 21 AD patients, 14 MCI patients, and 14 healthy controls (HC). AD and MCI patients were randomly divided into two groups, respectively: real acupuncture point group (14 AD and 8 MCI) and sham acupuncture point group (7 AD and 6 MCI). We adopted a 16-minute, single-block, experimental design for acquiring functional MRI images. We found, in AD and MCI patients, Siguan (four gates) elicited extensive activations and deactivations in cognitive-related areas, visual-related areas, the sensorimotor-related area, basal ganglia, and cerebellum. Compared with HC, AD and MCI patients showed similar activations in cognitive-related brain areas (inferior frontal gyrus, supramarginal gyrus, and rolandic operculum) as well as deactivations in cognitive-related areas, visual-related areas, basal ganglia, and cerebellum, which were not found in HC. Compared with sham acupuncture points, real acupuncture points produced more specific brain changes with both activated and deactivated brain activities in AD and MCI. The preliminary results in our study verified the objective evidence for neuronal specificity of acupuncture in AD and MCI patients.
Roombots—Towards decentralized reconfiguration with self-reconfiguring modular robotic metamodules
(2010)

This paper presents our work towards a decentralized reconfiguration strategy for self-reconfiguring modular robots, assembling furniture-like structures from Roombots (RB) metamodules. We explore how reconfiguration by locomotion from a configuration A to a configuration B can be controlled in a distributed fashion. This is done using Roombots metamodules—two Roombots modules connected serially—that use broadcast signals, lookup tables of their movement space, assumptions about their neighborhood, and connections to a structured surface to collectively build desired structures without the need of a centralized planner.
Social Persuasion in Online and Physical Networks
(2014)

Social persuasion to influence the actions, beliefs, and behaviors of individuals, embedded in a social network, has been widely studied. It has been applied to marketing, healthcare, sustainability, political campaigns, and public policy. Traditionally, there has been a separation between physical (offline) and cyber (online) worlds. While persuasion methods in the physical world focused on strong interpersonal trust and design principles, persuasion methods in the online world were rich on data-driven analysis and algorithms. Recent trends including Internet of Things, “big data,” and smartphone adoption point to the blurring divide between the cyber world and the physical world in the following ways. Fine grained data about each individual's location, situation, social ties, and actions are collected and merged from different sources. The messages for persuasion can be transmitted through both worlds at suitable times and places. The impact of persuasion on each individual is measurable. Hence, we posit that the social persuasion will soon be able to span seamlessly across these worlds and will be able to employ computationally and empirically rigorous methods to understand and intervene in both cyber and physical worlds. Several early examples indicate that this will impact the fundamental facets of persuasion including who, how, where, and when, and pave way for multiple opportunities as well as research challenges.
Improving Interactional Organizational Research : A Model of Person-Organization Fit
(2007)

In order for researchers to understand and predict behavior, they must consider both person and situation factors and how these factors interact. Even though organization researchers have developed interactional models, many have overemphasized either person or situation components, and most have failed to consider the effects that persons have on situations. This paper presents criteria for improving interactional models and a model of person-organization fit, which satisfies these criteria. Using a Q-sort methodology, individual value profiles are compared to organizational value profiles to determine fit and to predict changes in values, norms, and behaviors.
Constraint Programming in OPL
(1999)

OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations from model-ing languages with a rich constraint language and the ability to specify search procedures and strategies that is the essence of constraint programming. In addition, OPL models can be controlled and composed using OPLSCRIPT, a script language that simpliies the development of applications that solve sequences of models, several instances of the same model, or a combination of both as in column-generation applications. This paper illustrates some of the functionalities of OPL for constraint programming using frequency allocation, sport-scheduling, and job-shop scheduling applications. It also illustrates how OPL models can be composed using OPLSCRIPT on a simple connguration example.
Recycling ambient microwave energy with broad-band rectenna arrays
(2004)

This paper presents a study of reception and rectification of broad-band statistically time-varying low-power-density microwave radiation. The applications are in wireless powering of industrial sensors and recycling of ambient RF energy. A 64-element dual-circularly-polarized spiral rectenna array is designed and characterized over a frequency range of 2-18 GHz with single-tone and multitone incident waves. The integrated design of the antenna and rectifier, using a combination of full-wave electromagnetic field analysis and harmonic balance nonlinear circuit analysis, eliminates matching and filtering circuits, allowing for a compact element design. The rectified dc power and efficiency is characterized as a function of dc load and dc circuit topology, RF frequency, polarization, and incidence angle for power densities between 10/sup -5/-10/sup -1/ mW/cm/sup 2/. In addition, the increase in rectenna efficiency for multitone input waves is presented.
Dynamic Difficulty Adjustment (DDA) in Computer Games: A Review
(2018)

Dynamic difficulty adjustment (DDA) is a method of automatically modifying a game’s features, behaviors, and scenarios in realtime, depending on the player’s skill, so that the player, when the game is very simple, does not feel bored or frustrated, when it is very difficult. The intent of the DDA is to keep the player engrossed till the end and to provide him/her with a challenging experience. In traditional games, difficulty levels increase linearly or stepwise during the course of the game. The features such as frequency, starting levels, or rates can be set only at the beginning of the game by choosing a level of difficulty. This can, however, result in a negative experience for players as they try to map a predecided learning curve. DDA attempts to solve this problem by presenting a customized solution for the gamers. This paper provides a review of the current approaches to DDA.
Scale-Space and Edge Detection Using Anisotropic Diffusion
(1990)

Abstracf-The scale-space technique introduced by Witkin involves generating coarser resolution images by convolving the original image with a Gaussian kernel. This approach has a major drawback: it is difficult to obtain accurately the locations of the “semantically meaningful” edges at coarse scales. In this paper we suggest a new definition of scale-space, and introduce a class of algorithms that realize it using a diffusion process. The diffusion coefficient is chosen to vary spatially in such a way as to encourage intraregion smoothing in preference to interregion smoothing. It is shown that the “no new maxima should be generated at coarse scales” property of conventional scale space is preserved. As the region boundaries in our approach remain sharp, we obtain a high quality edge detector which successfully exploits global information. Experimental results are shown on a number of images. The algorithm involves elementary, local operations replicated over the image making parallel hardware implementations feasible.
Segmentation using Eigenvectors: A Unifying View
(1999)

Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using methods that are based on eigenvectors of the a nity matrix. These approaches are extremely attractive in that they are based on simple eigendecomposition algorithms whose stability is well understood. Nevertheless, the use of eigendecompositions in the context of segmentation is far from well understood. In this paper we give a unied treatment of these algorithms, and show the close connections between them while highlighting their distinguishing features. We then prove results on eigenvectors of block matrices that allow us to analyze the performance of these algorithms in simple grouping settings. Finally, we use our analysis to motivate a variation on the existing methods that combines aspects from di erent eigenvector segmentation algorithms. We illustrate our analysis with results on real and synthetic images. Human perceiving a scene can often easily segment it into coherent segments or groups. There has been a tremendous amount of e ort devoted to achieving the same level of performance in computer vision. In many cases, this is done by associating with each pixel a feature vector (e.g. color, motion, texture, position) and using a clustering or grouping algorithm on these feature vectors. Perhaps the cleanest approach to segmenting points in feature space is based on mixture models in which one assumes the data were generated by multiple processes and estimates the parameters of the processes and the number of components in the mixture. The assignment of points to clusters can then be easily performed by calculating the posterior probability of a point belonging to a cluster. Despite the elegance of this approach, the estimation process leads to a notoriously di cult optimization. The frequently used EM algorithm [3] often converges to a local maximum that depends on the initial conditions.
An Iterative Image Registration Technique with an Application to Stereo Vision
(1981)

Image registration finds a variety of applications in computer vision. Unfortunately, traditional image registration techniques tend to be costly. We present a new image registration technique that makes use of the spatial intensity gradient of the images to find a good match using a type of Newton-Raphson iteration. Our technique is faster because it examines far fewer potential matches between the images than existing techniques. Furthermore, this registration technique can be generalized to handle rotation, scaling and shearing. We show show our technique can be adapted for use in a stereo vision system.
Normalized Cuts and Image Segmentation
(1997)

w e propose Q novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the amage data, our approach aims a t extracting the global impression of an image. We treat image segmentation QS (I graph partitioning problem and propose Q novel global criterion, the normalized cut, for segmenting the graph. The normalized cut craterion measures both the total dissimilarity between the different groups QS well as the total similarity within the groups. We show that an eficient computational technique based on a generaked eigenvalue problem can be used to optimize this criterion. w e have applied this approach to segmenting static images and found results very enco u raging.
A First Look at a Telepresence System with Room-Sized Real-Time 3 D Capture and Life-Sized Tracked Display Wall
(2011)

This paper provides a first look at a telepresence system offering room-sized, fully dynamic real-time 3D scene capture and continuous-viewpoint head-tracked display on a life-sized tiled display wall. The system is an expansion of a previous system, based an array of commodity depth sensors. We describe adjustments and improvements made to camera calibration, sensor data processing, data merger, rendering, and display, as required to scale the earlier system to room-sized.
Weighted extreme learning machine for imbalance learning
(2013)

Extreme learning machine (ELM) is a competitive machine learning technique, which is simple in theory and fast in implementation. The network types are ‘‘generalized’’ single hidden layer feedforward networks, which are quite diversified in the form of variety in feature mapping functions or kernels. To deal with data with imbalanced class distribution, a weighted ELM is proposed which is able (1) it is simple in theory and convenient in implementation; (2) a wide type of feature mapping functions or kernels are available for the proposed framework; (3) the proposed method can be applied directly into multiclass classification tasks. In addition, after integrating with the weighting scheme, (1) the weighted ELM is able to deal with data with imbalanced class distribution while maintain the good performance on well balanced data as unweighted ELM; (2) by assigning different weights for each example according to users’ needs, the weighted ELM can be generalized to cost sensitive learning. & 2012 Elsevier B.V. All rights reserved.