SoroushVahidi/scidocs huggingface dataset:
Altered salience network connectivity predicts macronutrient intake after sleep deprivation
(2015)

Although insufficient sleep is a well-recognized risk factor for overeating and weight gain, the neural mechanisms underlying increased caloric (particularly fat) intake after sleep deprivation remain unclear. Here we used resting-state functional magnetic resonance imaging and examined brain connectivity changes associated with macronutrient intake after one night of total sleep deprivation (TSD). Compared to the day following baseline sleep, healthy adults consumed a greater percentage of calories from fat and a lower percentage of calories from carbohydrates during the day following TSD. Subjects also exhibited increased brain connectivity in the salience network from the dorsal anterior cingulate cortex (dACC) to bilateral putamen and bilateral anterior insula (aINS) after TSD. Moreover, dACC-putamen and dACC-aINS connectivity correlated with increased fat and decreased carbohydrate intake during the day following TSD, but not during the day following baseline sleep. These findings provide a potential neural mechanism by which sleep loss leads to increased fat intake.
Sentence Selection and Weighting for Neural Machine Translation Domain Adaptation
(2018)

Neural machine translation NMT has been prominent in many machine translation tasks. However, in some domain-specific tasks, only the corpora from similar domains can improve translation performance. If out-of-domain corpora are directly added into the in-domain corpus, the translation performance may even degrade. Therefore, domain adaptation techniques are essential to solve the NMT domain problem. Most existing methods for domain adaptation are designed for the conventional phrase-based machine translation. For NMT domain adaptation, there have been only a few studies on topics such as fine tuning, domain tags, and domain features. In this paper, we have four goals for sentence level NMT domain adaptation. First, the NMT's internal sentence embedding is exploited and the sentence embedding similarity is used to select out-of-domain sentences that are close to the in-domain corpus. Second, we propose three sentence weighting methods, i.e., sentence weighting, domain weighting, and batch weighting, to balance the data distribution during NMT training. Third, in addition, we propose dynamic training methods to adjust the sentence selection and weighting during NMT training. Fourth, to solve the multidomain problem in a real-world NMT scenario where the domain distributions of training and testing data often mismatch, we proposed a multidomain sentence weighting method to balance the domain distributions of training data and match the domain distributions of training and testing data. The proposed methods are evaluated in international workshop on spoken language translation IWSLT English-to-French/German tasks and a multidomain English-to-French task. Empirical results show that the sentence selection and weighting methods can significantly improve the NMT performance, outperforming the existing baselines.
Amortized Efficiency of List Update and Paging Rules
(1985)

In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes &thgr;(i) time, we show that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and frequency count rules, do not share this property. We generalize our results to show that move-to-front is within a constant factor of optimum as long as the access cost is a convex function. We also study paging, a setting in which the access cost is not convex. The paging rule corresponding to move-to-front is the “least recently used” (LRU) replacement rule. We analyze the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule (Belady's MIN algorithm) by a factor that depends on the size of fast memory. No on-line paging algorithm has better amortized performance.
Learning Multi-agent Communication under Limited-bandwidth Restriction for Internet Packet Routing
(2019)

Communication is an important factor for the big multi-agent world to stay organized and productive. Recently, the AI community has applied the Deep Reinforcement Learning (DRL) to learn the communication strategy and the control policy for multiple agents. However, when implementing the communication for real-world multi-agent applications, there is a more practical limited-bandwidth restriction, which has been largely ignored by the existing DRL-based methods. Specifically, agents trained by most previous methods keep sending messages incessantly in every control cycle; due to emitting too many messages, these methods are unsuitable to be applied to the real-world systems that have a limited bandwidth to transmit the messages. To handle this problem, we propose a gating mechanism to adaptively prune unprofitable messages. Results show that the gating mechanism can prune more than 80% messages with little damage to the performance. Moreover, our method outperforms several state-of-the-art DRL-based and rule-based methods by a large margin in both the real-world packet routing tasks and four benchmark tasks.
Assessing the Potential of Classical Q-learning in General Game Playing
(2018)

After the recent groundbreaking results of AlphaGo and AlphaZero, we have seen strong interests in deep reinforcement learning and artificial general intelligence (AGI) in game playing. However, deep learning is resource-intensive and the theory is not yet well developed. For small games, simple classical table-based Q-learning might still be the algorithm of choice. General Game Playing (GGP) provides a good testbed for reinforcement learning to research AGI. Q-learning is one of the canonical reinforcement learning methods, and has been used by (Banerjee & Stone, IJCAI 2007) in GGP. In this paper we implement Q-learning in GGP for three small-board games (Tic-Tac-Toe, Connect Four, Hex), to allow comparison to Banerjee et al.. We find that Q-learning converges to a high win rate in GGP. For the -greedy strategy, we propose a first enhancement, the dynamic algorithm. In addition, inspired by (Gelly & Silver, ICML 2007) we combine online search (Monte Carlo Search) to enhance offline learning, and propose QM-learning for GGP. Both enhancements improve the performance of classical Q-learning. In this work, GGP allows us to show, if augmented by appropriate enhancements, that classical table-based Q-learning can perform well in small games.
A new adaptive frequency oscillator for gait assistance
(2015)

To control exoskeletons for walking gait assistance, it is of primary importance to control them to act synchronously with the gaits of users. To effectively estimate the gait cycle (or the phase within a stride) of users, we propose a new adaptive frequency oscillator (AFO). While previous AFOs successfully estimated the walking frequency from joint angles as inputs, the new AFO, called particularly-shaped adaptive oscillator (PSAO) can estimate gait cycle from the same inputs, which would have required foot contact sensors in previous approaches. To predict the effects of PSAO-based gait assistance on human walking, it has been tested with neuromuscular walking simulation. In the simulation, the gait assistance system reduced the metabolic cost of walking for some assistance patterns. The walk ratio (step length per step rate) also changed as assistance patterns shifted in phase, which is meaningful because metabolic cost of walking in general is minimal at specific walk ratio. For a prototype exoskeleton we developed, the effect of gait assistance was experimented on a human subject walking on level ground and inclining slopes to verify the predictions from the simulation: (1) physiological cost index computed from heart rate significantly decreased indicating reduction in metabolic energy expenditure; (2) walk ratio was in fact controllable to an extent.
Education 4.0 for tall thin engineer in a data driven society
(2017)

The rise of digital technology creates disruptive innovation, new opportunities in communication, it transforms industrial production and it changes the way we work, learn and live. That leads to the fourth Industrial Revolution, which changes the working world enormously. New skills, future-ready curricula, new learning and training concepts as well as the flexibility in education are necessary. To deliver that, it needs a fourth revolution in the educational system with a strong active presence and most important Artificial Intelligence (AI) driven features for better performance. Education 4.0 needs also a strong partnership between industry and academicals environment in the formation of human resources for Industry 4.0. We present in this paper our answers of education regarding the challenges of fourth revolution in Industry and the seven AI driven didactic methods identified for the University of Future.
Fusion of Keypoint Tracking and Facial Landmark Detection for Real-Time Head Pose Estimation
(2018)

In this paper, we address the problem of extreme head pose estimation from intensity images, in a monocular setup. We introduce a novel fusion pipeline to integrate into a dedicated Kalman Filter the pose estimated from a tracking scheme in the prediction stage and the pose estimated from a detection scheme in the correction stage. To that end, the measurement covariance of the Kalman Filter is updated in every frame. The tracking scheme is performed using a set of keypoints extracted in the area of the head along with a simple 3D geometric model. The detection scheme, on the other hand, relies on the alignment of facial landmarks in each frame combined with 3D features extracted on a head mesh. The head pose in each scheme is estimated by minimizing the reprojection error from the 3D-2D correspondences. By combining both frameworks, we extend the applicability of head pose estimation from facial landmarks to cases where these features are no longer visible. We compared the proposed method to other related approaches, showing that it can achieve state-of-the-art performance. We also demonstrate that our approach is suitable for cases with extreme head rotations and (self-) occlusions, besides being suitable for real time applications.
Mux-Kmeans: multiplex kmeans for clustering large-scale data set
(2014)

Kmeans clustering algorithm is widely used in a number of scientific applications due to its simple iterative nature and ease of implementation. The quality of clustering result highly depends on the selection of initial centroids. Different selections of initial centroids result in different clustering results. In practice, people run a series of Kmeans processes with multiple initial centroid groups serially and return the best clustering result among them. However, in the era of big data, a Kmeans process is implemented on MapReduce to scale to large data sets. Even a single Kmeans process on MapReduce requires considerable long runtime. This paper proposes Mux-Kmeans. Rather than executing multiple Kmeans processes serially, Mux-Kmeans launches these Kmeans processes concurrently with multiple centroid groups. In each iteration, Mux-Kmeans (i) evaluates these Kmeans processes, (ii) prunes the low-quality Kmeans processes, and (iii) incubates new Kmeans processes. After a certain number of iterations, it finally obtains the best among these local optimal results. We implement Mux-Kmeans on MapReduce and evaluate it on Amazon EC2. The experimental results show that starting from the same initial centroid groups, the clustering result of Mux-Kmeans is always non-worse than the best of a series of Kmeans processes. Mux-Kmeans also saves elapsed time than serial multiple Kmeans processes.
A Clinical Study of 35 Cases of Pincer Nails
(2011)

BACKGROUND
Pincer nail is a nail deformity characterized by transverse overcurvature of the nail plate. Pincer nail can affect a patient's quality of life due to its chronic, recurrent course; however, there have been no clinical studies on the pincer nail condition in Korean patients.


OBJECTIVE
The purpose of this study was to characterize the clinical findings and treatment of pincer nail. In addition, possible etiological factors were considered, and treatment efficacy was evaluated.


METHODS
The medical records and clinical photographs of 35 patients (12 males, 23 females) who were diagnosed with pincer nail between August 1, 2005 and July 31, 2009 were studied.


RESULTS
Patient age ranged from 10 to 77 (52.09±17.26) years, and there was a predominance of female (23 out of 35 patients, F:M=2:1). The mean duration of the disorder was 7.45 years (range 0.25~40); 85% had pincer nail for at least 1 year. In addition, 40% had a history of previous treatment and recurrence. There were 82.8% patients with the common type of pincer nails. The most commonly involved nails were both great toenails. Among 35 patients, nail grinding was started in 30 patients, and 25 patients showed clinical improvement with nail grinding. The width index increased and the height index decreased after treatment. The mean follow up period was 8.42 months (range 1~27), and 7 patients showed recurrence after 8.8 months (range 2~20). Among 35 patients, 5 patients were treated with nail extraction with matricectomy, and the symptoms resolved immediately. The mean follow up period was 7.6 months (range 0~19), and recurrence was not observed. Onychomycosis was also present in 37.1% of patients, and itraconazole pulse therapy for 3 months was added.


CONCLUSION
The results of this study demonstrate the clinical features of pincer nail in Korean patients. The findings show that the common type of pincer nail was most common, and nail grinding as a conservative treatment greatly improved pincer nails despite a risk of recurrence. When onychomycosis was also present, oral antifungal therapy added to nail grinding resulted in a more rapid change in nail thickness and clinical improvement.
Applying a tendency to be well retweeted to false information detection
(2016)

While a lot of useful information can be found in SNS, false information also diffuses through it, thereby confusing many people sometimes. In this paper, we predict a tendency of tweets to be well retweeted and consider applying the tendency to false information detection. The tendency prediction can be implemented with simple features of tweets. We examine the effect of the tendency when it is used in false information detection empirically. Our experimental results indicate that it would be valuable to take the tendency into account for the detection. We also discuss findings when applying them to tweets in Japanese.
Path Planning using a Dynamic Vehicle Model
(2006)

This paper addresses the problem of path planning using a dynamic vehicle model. Previous works which include a basic kinematic model generate paths that are only realistic at very low speed. By considering higher vehicle speed during navigation, the vehicle can significantly deviate from the planned trajectory. Consequently, the planned path becomes unusable for the mission achievement. So, to bridge a gap between planning and navigation, we propose a realistic path planner based on a dynamic vehicle model
Autonomous local path planning for a mobile robot using a genetic algorithm
(2004)

This work presents results of our work in development of a genetic algorithm based path-planning algorithm for local obstacle avoidance (local feasible path) of a mobile robot in a given search space. The method tries to find not only a valid path but also an optimal one. The objectives are to minimize the length of the path and the number of turns. The proposed path-planning method allows a free movement of the robot in any direction so that the path-planner can handle complicated search spaces.
Reactive Nonholonomic Trajectory Generation via Parametric Optimal Control
(2003)

There are many situations for which a feasible nonholonomic motion plan must be generated immediately based on real-time perceptual information. Parametric trajectory representations limit computation because they reduce the search space for solutions (at the cost of potentially introducing suboptimality). The use of any parametric trajectory model converts the optimal control formulation into an equivalent nonlinear programming problem. In this paper, curvature polynomials of arbitrary order are used as the assumed form of solution. Polynomials sacrifice little in terms of spanning the set of feasible controls while permitting an expression of the general solution to the system dynamics in terms of decoupled quadratures. These quadratures are then readily linearized to express the necessary conditions for optimality. Resulting trajectories are convenient to manipulate and execute in vehicle controllers and they can be computed with a straightforward numerical procedure in real time. KEY WORDS—mobile robots, car-like robots, trajectory generation, curve generation, nonholonomic, clothoid, cornu spiral, optimal control
Measuring User Engagement
(2014)

User engagement refers to the quality of the user experience that emphasizes the positive aspects of interacting with an online application and, in particular, the desire to use that application longer and repeatedly. User engagement is a key concept in the design of online applications (whether for desktop, tablet or mobile), motivated by the observation that successful applications are not just used, but are engaged with. Users invest time, attention, and emotion in their use of technology, and seek to satisfy pragmatic and hedonic needs. Measurement is critical for evaluating whether online applications are able to successfully engage users, and may inform the design of and use of applications. User engagement is a multifaceted, complex phenomenon; this gives rise to a number of potential measurement approaches. Common ways to evaluate user engagement include using self-report measures, e.g., questionnaires; observational methods, e.g. facial expression analysis, speech analysis; neuro-physiological signal processing methods, e.g., respiratory and cardiovascular accelerations and decelerations, muscle spasms; and web analytics, e.g., number of site visits, click depth. These methods represent various trade-offs in terms of the setting (laboratory versus “in the wild”), object of measurement (user behaviour, affect or cognition) and scale of data collected. For instance, small-scale user studies are deep and rich, but limited in terms of generalizability, whereas large-scale web analytic studies are powerful but negate users’ motivation and context. The focus of this book is how user engagement is currently being measured and various considerations for its measurement. Our goal is to leave readers with an appreciation of the various ways in which to measure user engagement, and their associated strengths and weaknesses. We emphasize the multifaceted nature of user engagement and the unique contextual constraints that come to bear upon attempts to measure engagement in different settings, and across different user groups and web domains. At the same time, this book advocates for the development of “good” measures and good measurement practices that will advance the study of user engagement and improve our understanding of this construct, which has become so vital in our wired world.
A 95% Efficient Normally-Off GaN-on-Si HEMT Hybrid-IC Boost-Converter with 425-W Output Power at 1 MHz
(2011)

A 2:1 351 V hard-switched boost converter was constructed using high-voltage GaN high-electron-mobility transistors grown on Si substrates and GaN Schottky diodes grown on Sapphire substrates. The high speed and low on-resistance of the GaN devices enables extremely fast switching times and low losses, resulting in a high conversion efficiency of 95% with 425-W output power at 1 MHz. The boost converter has a power density of 175 W/in3. To our knowledge, these results are the best reported on GaN devices, and the highest for 1MHz switching.
Episodic Memory and Beyond: The Hippocampus and Neocortex in Transformation.
(2016)

The last decade has seen dramatic technological and conceptual changes in research on episodic memory and the brain. New technologies, and increased use of more naturalistic observations, have enabled investigators to delve deeply into the structures that mediate episodic memory, particularly the hippocampus, and to track functional and structural interactions among brain regions that support it. Conceptually, episodic memory is increasingly being viewed as subject to lifelong transformations that are reflected in the neural substrates that mediate it. In keeping with this dynamic perspective, research on episodic memory (and the hippocampus) has infiltrated domains, from perception to language and from empathy to problem solving, that were once considered outside its boundaries. Using the component process model as a framework, and focusing on the hippocampus, its subfields, and specialization along its longitudinal axis, along with its interaction with other brain regions, we consider these new developments and their implications for the organization of episodic memory and its contribution to functions in other domains.
Solving sybil attacks using evolutionary game theory
(2016)

Recommender systems have become quite popular recently. However, such systems are vulnerable to several types of attacks that target user ratings. One such attack is the Sybil attack where an entity masquerades as several identities with the intention of diverting user ratings. In this work, we propose evolutionary game theory as a possible solution to the Sybil attack in recommender systems. After modeling the attack, we use replicator dynamics to solve for evolutionary stable strategies. Our results show that under certain conditions that are easily achievable by a system administrator, the probability of an attack strategy drops to zero implying degraded fitness for Sybil nodes that eventually die out.
Design of a smart parking system using wireless sensor network
(2015)

In this article it is included the design of a smart parking system, the base was the current system "Sistema integrado de Estacionamiento (SIMERT)" and the mobility in Loja - Ecuador, with the use of a sensor network and wireless technology based in Zigbee 900 and Digimesh 2.4 GHz. To the feasibility of the project it was considered a technological platform that could be adapted to the city conditions and that be friendly with the environment, furthermore the suggested solution gives us connectivity with a Web application for integrated parking and usability of administrators and final users.
Automated Detection of Logical Errors in Programs
(2014)

Research and industrial experience reveal that code reviews as a part of software inspection might be the most cost-effective technique a team can use to reduce defects. Tools that automate code inspection mostly focus on the detection of a priori known defect patterns and security vulnerabilities. Automated detection of logical errors, due to a faulty implementation of applications’ functionality is a relatively uncharted territory. Automation can be based on profiling the intended behavior behind the source code. In this paper, we present a new code profiling method that combines an information flow analysis, the crosschecking of dynamic invariants with symbolic execution, and the use of fuzzy logic. Our goal is to detect logical errors and exploitable vulnerabilities. The theoretical underpinnings and the practical implementation of our approach are discussed. We test the APP_LogGIC tool that implements the proposed analysis on two realworld applications. The results show that profiling the intended program behavior is feasible in diverse applications. We discuss the heuristics used to overcome the problem of state space explosion and of the large data sets. Code metrics and test results are provided to demonstrate the effectiveness of the approach.