snu-aidas/HVMap-dataset huggingface dataset:
Index Financial Time Series Based on Zigzag-Perceptually Important Points

Problem statement: Financial time series were usually large in size, unstructured and of high dimensionality. Since, the illustration of fin a cial time series shape was typically characterize d by a few number of important points. These important p oints moved in zigzag directions which could form technical patterns. However, these important p oints exhibited in different resolutions and diffic ult to determine. Approach: In this study, we proposed novel methods of financ i l time series indexing by considering their zigzag movement. The methods c onsist of two major algorithms: first, the identification of important points, namely the Zigz ag-Perceptually Important Points (ZIPs) identification method and next, the indexing method namely Zigzag based M-ary Tree (ZM-Tree) to structure and organize the important points. Results: The errors of the tree building and retrieving compared to the original time series increased when t important points increased. The dimensionality reduction using ZM-Tree based on tree pruning and n umber of retrieved points techniques performed better when the number of important points increase d. Conclusion: Our proposed techniques illustrated mostly acceptable performance in tree op rations and dimensionality reduction comparing to existing similar technique like Specialize Binar y Tree (SB-Tree).
Science-based views of drug addiction and its treatment.
Review on Machine Learning Techniques for Automatic Segmentation of Liver Images

The segmentation of liver from abdominal images has gained huge importance in medical imaging field since it is fundamental step to diagnose liver tumor and other liver diseases, liver volume measurement and 3D liver volume rendering. In this paper, recent automatic methods for liver image segmentation proposed in literature are reviewed. Generally, Liver image segmentation techniques can be semi-automatic and fully automatic. Under fully automatic segmentation category, various methods, approaches, recent advances and related problems has been explained. Brief summary of all discussed methods has been provided. Finally it is concluded that liver image segmentation is still an open problem since various drawbacks of proposed methods can be addressed. Keywords— Liver image Segmentation, Automatic Segmentation, Neural Network, Support Vector Machine, Clustering, Hybrid, Review.
Toward Scalable Verification for Safety-Critical Deep Networks

The increasing use of deep neural networks for safety-critical applications, such as autonomous driving and flight control, raises concerns about their safety and reliability. Formal verification can address these concerns by guaranteeing that a deep learning system operates as intended, but the state-of-the-art is limited to small systems. In this work-in-progress report we give an overview of our work on mitigating this difficulty, by pursuing two complementary directions: devising scalable verification techniques, and identifying design choices that result in deep learning systems that are more amenable to verification. ACM Reference Format: Lindsey Kuper, Guy Katz, Justin Gottschlich, Kyle Julian, Clark Barrett, and Mykel J. Kochenderfer. 2018. Toward Scalable Verification for SafetyCritical Deep Networks. In Proceedings of SysML Conference (SysML). ACM, New York, NY, USA, 3 pages.
Does Attendance Matter ? An Examination of Student Attitudes , Participation , Performance and Attendance

Non attendance of lectures and tutorials appears to be a growing trend. The literature suggests many possible reasons including students’ changing lifestyle, attitudes, teaching and technology. This paper looks at the reasons for non attendance of students in the Faculty of Commerce at the University of Wollongong and identifies relationships between attendance, participation and performance. The results indicate that there are valid reasons for non attendance that are both in the control of learners and teachers. There are also clear benefits for students to be gained in attendance; however, changes in the way we learn, teach, assess and use technology are recommended if we wish to reverse the trend. This journal article is available in Journal of University Teaching & Learning Practice: http://ro.uow.edu.au/jutlp/vol3/iss2/3 Jour na l o f Un ive rs i t y Teach ing and Lear n ing Pr ac t i ce Does Attendance Matter? An Examination of Student Attitudes, Participation, Performance and Attendance
Analysis and reduction of quadrature errors in the material point method ( MPM )

The material point method (MPM) has demonstrated itself as a computationally effective particle method for solving solid mechanics problems involving large deformations and/or fragmentation of structures, which are sometimes problematic for finite element methods (FEMs). However, similar to most methods that employ mixed Lagrangian (particle) and Eulerian strategies, analysis of the method is not straightforward. The lack of an analysis framework for MPM, as is found in FEMs, makes it challenging to explain anomalies found in its employment and makes it difficult to propose methodology improvements with predictable outcomes. In this paper we present an analysis of the quadrature errors found in the computation of (material) internal force in MPM and use this analysis to direct proposed improvements. In particular, we demonstrate that lack of regularity in the grid functions used for representing the solution to the equations of motion can hamper spatial convergence of the method. We propose the use of a quadratic B-spline basis for representing solutions on the grid, and we demonstrate computationally and explain theoretically why such a small change can have a significant impact on the reduction in the internal force quadrature error (and corresponding ‘grid crossing error’) often experienced when using MPM. Copyright q 2008 John Wiley & Sons, Ltd.
Calming effects of deep touch pressure in patients with autistic disorder, college students, and animals.

ABSTRACT Many people with autistic disorder have problems with oversensitivity to both touch and sound. The author (an autistic person) developed a device that delivers deep touch pressure to help her learn to tolerate touching and to reduce anxiety and nervousness. The "squeeze machine" applies lateral, inwardly directed pressure to both lateral aspects of a person's entire body, by compressing the user between two foam-padded panels. Clinical observations and several studies suggest that deep touch pressure is therapeutically beneficial for both children with autistic disorder and probably children with attention-deficit hyperactivity disorder. Only minor and occasional adverse effects have been noted. Data are reported that show a similar calming effect in nonreferred college students. A review of the animal literature reveals that animals have similar calming reactions, and also suggests possible additional physiological effects of deep touch pressure. At present, there are increasing anecdotal reports of the clinical value of the squeeze machine, including suggestions that it can be used to reduce required doses of psychostimulant medications. More clinical studies are needed to evaluate the potential role of this seemingly beneficial form of "physiological" stimulation.
Root Gap Correction with a Deep Inpainting Model

Imaging roots of growing plants in a non-invasive and affordable fashion has been a long-standing problem in image-assisted plant breeding and phenotyping. One of the most affordable and diffuse approaches is the use of mesocosms, where plants are grown in soil against a glass surface that permits the roots visualization and imaging. However, due to soil and the fact that the plant root is a 2D projection of a 3D object, parts of the root are occluded. As a result, even under perfect root segmentation, the resulting images contain several gaps that may hinder the extraction of finely grained root system architecture traits. We propose an effective deep neural network to recover gaps from disconnected root segments. We train a fully supervised encoder-decoder deep CNN that, given an image containing gaps as input, generates an inpainted version, recovering the missing parts. Since in real data ground-truth is lacking, we use synthetic root images [10] that we artificially perturb by introducing gaps to train and evaluate our approach. We show that our network can work both in dicot and monocot cases in reducing root gaps. We also show promising exemplary results in real data from chickpea root architectures.
OpenARC: open accelerator research compiler for directive-based, efficient heterogeneous computing

This paper presents Open Accelerator Research Compiler (OpenARC): an open-source framework that supports the full feature set of OpenACC V1.0 and performs source-to-source transformations, targeting heterogeneous devices, such as NVIDIA GPUs. Combined with its high-level, extensible Intermediate Representation (IR) and rich semantic annotations, OpenARC serves as a powerful research vehicle for prototyping optimization, source-to-source transformations, and instrumentation for debugging, performance analysis, and autotuning. In fact, OpenARC is equipped with various capabilities for advanced analyses and transformations, as well as built-in performance and debugging tools. We explain the overall design and implementation of OpenARC, and we present key analysis techniques necessary to efficiently port OpenACC applications. Porting various OpenACC applications to CUDA GPUs using OpenARC demonstrates that OpenARC performs similarly to a commercial compiler, while serving as a general research framework.
Alteration of the platelet serotonin transporter in romantic love.

BACKGROUND
The evolutionary consequences of love are so important that there must be some long-established biological process regulating it. Recent findings suggest that the serotonin (5-HT) transporter might be linked to both neuroticism and sexual behaviour as well as to obsessive-compulsive disorder (OCD). The similarities between an overvalued idea, such as that typical of subjects in the early phase of a love relationship, and obsession, prompted us to explore the possibility that the two conditions might share alterations at the level of the 5-HT transporter.


METHODS
Twenty subjects who had recently (within the previous 6 months) fallen in love, 20 unmedicated OCD patients and 20 normal controls, were included in the study. The 5-HT transporter was evaluated with the specific binding of 3H-paroxetine (3H-Par) to platelet membranes.


RESULTS
The results showed that the density of 3H-Par binding sites was significantly lower in subjects who had recently fallen in love and in OCD patients than in controls.


DISCUSSION
The main finding of the present study is that subjects who were in the early romantic phase of a love relationship were not different from OCD patients in terms of the density of the platelet 5-HT transporter, which proved to be significantly lower than in the normal controls. This would suggest common neurochemical changes involving the 5-HT system, linked to psychological dimensions shared by the two conditions, perhaps at an ideational level.
A shape-based similarity measure for time series data with ensemble learning

This paper introduces a shape-based similarity measure, called the angular metric for shape similarity (AMSS), for time series data. Unlike most similarity or dissimilarity measures, AMSS is based not on individual data points of a time series but on vectors equivalently representing it. AMSS treats a time series as a vector sequence to focus on the shape of the data and compares data shapes by employing a variant of cosine similarity. AMSS is, by design, expected to be robust to time and amplitude shifting and scaling, but sensitive to short-term oscillations. To deal with the potential drawback, ensemble learning is adopted, which integrates data smoothing when AMSS is used for classification. Evaluative experiments reveal distinct properties of AMSS and its effectiveness when applied in the ensemble framework as compared to existing measures.
Letter-based classification of Arabic scripts style in ancient Arabic manuscripts: Preliminary results

Classifying ancient Arabic manuscripts based on handwriting styles is one of the important roles in the field of paleography. Recognizing the style of handwriting in Arabic manuscripts helps in identifying the origin and date of ancient documents. In this paper we proposed using segmented letters from Arabic manuscripts to recognize handwriting style. Both Gabor Filters (GF) and Local Binary Pattern (LBP) are used to extract features from letters. The fused features are sent to Support Vector Machine (SVM) classifier. Experimental results have been implemented using manuscripts images from the Qatar National Library (QNL) and other online datasets. Better results are achieved when both GF and LBP descriptors are combined. The recognized Handwritten Arabic styles are Diwani, Kufic, Naskh, Farsi, Ruq'ah and Thuluth.
miRCancer: a microRNA-cancer association database constructed by text mining on literature

MOTIVATION
Research interests in microRNAs have increased rapidly in the past decade. Many studies have showed that microRNAs have close relationships with various human cancers, and they potentially could be used as cancer indicators in diagnosis or as a suppressor for treatment purposes. There are several databases that contain microRNA-cancer associations predicted by computational methods but few from empirical results. Despite the fact that abundant experiments investigating microRNA expressions in cancer cells have been carried out, the results have remain scattered in the literature. We propose to extract microRNA-cancer associations by text mining and store them in a database called miRCancer.


RESULTS
The text mining is based on 75 rules we have constructed, which represent the common sentence structures typically used to state microRNA expressions in cancers. The microRNA-cancer association database, miRCancer, is updated regularly by running the text mining algorithm against PubMed. All miRNA-cancer associations are confirmed manually after automatic extraction. miRCancer currently documents 878 relationships between 236 microRNAs and 79 human cancers through the processing of >26 000 published articles.


AVAILABILITY
miRCancer is freely available on the web at http://mircancer.ecu.edu/
Named Entity Recognition using Support Vector Machine: A Language Independent Approach

Named Entity Recognition (NER) aims to classify each word of a document into predefined target named entity classes and is now-a-days considered to be fundamental for many Natural Language Processing (NLP) tasks such as information retrieval, machine translation, information extraction, question answering systems and others. This paper reports about the development of a NER system for Bengali and Hindi using Support Vector Machine (SVM). Though this state of the art machine learning technique has been widely applied to NER in several well-studied languages, the use of this technique to Indian languages (ILs) is very new. The system makes use of the different contextual information of the words along with the variety of features that are helpful in predicting the four different named (NE) classes, such as Person name, Location name, Organization name and Miscellaneous name. We have used the annotated corpora of 122,467 tokens of Bengali and 502,974 tokens of Hindi tagged with the twelve different NE classes , defined as part of the IJCNLP-08 NER Shared Task for South and South East Asian Languages (SSEAL) . In addition, we have manually annotated 150K wordforms of the Bengali news corpus, developed from the web-archive of a leading Bengali newspaper. We have also developed an unsupervised algorithm in order to generate the lexical context patterns from a part of the unlabeled Bengali news corpus. Lexical patterns have been used as the features of SVM in order to improve the system performance. The NER system has been tested with the gold standard test sets of 35K, and 60K tokens for Bengali, and Hindi, respectively. Evaluation results have demonstrated the recall, precision, and f-score values of 88.61%, 80.12%, and 84.15%, respectively, for Bengali and 80.23%, 74.34%, and 77.17%, respectively, for Hindi. Results show the improvement in the f-score by 5.13% with the use of context patterns. Statistical analysis, ANOVA is also performed to compare the performance of the proposed NER system with that of the existing HMM based system for both the languages. Keywords—Named Entity (NE); Named Entity Recognition (NER); Support Vector Machine (SVM); Bengali; Hindi.
An improved swarm optimized functional link artificial neural network (ISO-FLANN) for classification

Multilayer perceptron (MLP) (trained with back propagation learning algorithm) takes large computational time. The complexity of the network increases as the number of layers and number of nodes in layers increases. Further, it is also very difficult to decide the number of nodes in a layer and the number of layers in the network required for solving a problem a priori. In this paper an improved particle swarm optimization (IPSO) is used to train the functional link artificial neural network (FLANN) for classification and we name it ISO-FLANN. In contrast to MLP, FLANN has less architectural complexity, easier to train, and more insight may be gained in the classification problem. Further, we rely on global classification ata mining unctional link artificial neural networks ulti-layer perception article swarm optimization mproved particle swarm optimization VM capabilities of IPSO to explore the entire weight space, which is plagued by a host of local optima. Using the functionally expanded features; FLANN overcomes the non-linear nature of problems. We believe that the combined efforts of FLANN and IPSO (IPSO + FLANN = ISO − FLANN) by harnessing their best attributes can give rise to a robust classifier. An extensive simulation study is presented to show the effectiveness of proposed classifier. Results are compared with MLP, support vector machine(SVM) with radial basis function (RBF) kernel, FLANN with gradiend descent learning and fuzzy swarm net (FSN). SN
Correlation clustering in general weighted graphs

We consider the following general correlation-clustering problem [N. Bansal, A. Blum, S. Chawla, Correlation clustering, in: Proc. 43rd Annu. IEEE Symp. on Foundations of Computer Science, Vancouver, Canada, November 2002, pp. 238–250]: given a graph with real nonnegative edge weights and a 〈+〉/〈−〉 edge labelling, partition the vertices into clusters to minimize the total weight of cut 〈+〉 edges and uncut 〈−〉 edges. Thus, 〈+〉 edges with large weights (representing strong correlations between endpoints) encourage those endpoints to belong to a common cluster while 〈−〉 edges with large weights encourage the endpoints to belong to different clusters. In contrast to most clustering problems, correlation clustering specifies neither the desired number of clusters nor a distance threshold for clustering; both of these parameters are effectively chosen to be the best possible by the problem definition. Correlation clustering was introduced by Bansal et al. [Correlation clustering, in: Proc. 43rd Annu. IEEE Symp. on Foundations of Computer Science, Vancouver, Canada, November 2002, pp. 238–250], motivated by both document clustering and agnostic learning. They proved NP-hardness and gave constant-factor approximation algorithms for the special case in which the graph is complete (full information) and every edge has the same weight. We give an O(log n)-approximation algorithm for the general case based on a linear-programming rounding and the “region-growing” technique. We also prove that this linear program has a gap of (log n), and therefore our approximation is tight under this approach. We also give an O(r3)-approximation algorithm for Kr,r -minor-free graphs. On the other hand, we show that the problem is equivalent to minimum multicut, and therefore APX-hard and difficult to approximate better than (log n). © 2006 Elsevier B.V. All rights reserved.
The Whale Optimization Algorithm

This paper proposes a novel nature-inspired meta-heuristic optimization algorithm, called Whale Optimization Algorithm (WOA), which mimics the social behavior of humpback whales. The algorithm is inspired by the bubble-net hunting strategy. WOA is tested with 29 mathematical optimization problems and 6 structural design problems. Optimization results prove that the WOA algorithm is very competitive compared to the state-of-art meta-heuristic algorithms as well as conventional methods. The source codes of the WOA algorithm are publicly available at http://www.alimirjalili.com/WOA.html © 2016 Elsevier Ltd. All rights reserved.
TSC-DL: Unsupervised trajectory segmentation of multi-modal surgical demonstrations with Deep Learning

The growth of robot-assisted minimally invasive surgery has led to sizable datasets of fixed-camera video and kinematic recordings of surgical subtasks. Segmentation of these trajectories into locally-similar contiguous sections can facilitate learning from demonstrations, skill assessment, and salvaging good segments from otherwise inconsistent demonstrations. Manual, or supervised, segmentation can be prone to error and impractical for large datasets. We present Transition State Clustering with Deep Learning (TSC-DL), a new unsupervised algorithm that leverages video and kinematic data for task-level segmentation, and finds regions of the visual feature space that correlate with transition events using features constructed from layers of pre-trained image classification Deep Convolutional Neural Networks (CNNs). We report results on three datasets comparing Deep Learning architectures (AlexNet and VGG), choice of convolutional layer, dimensionality reduction techniques, visual encoding, and the use of Scale Invariant Feature Transforms (SIFT). We find that the deep architectures extract features that result in up-to a 30.4% improvement in Silhouette Score (a measure of cluster tightness) over the traditional “shallow” features from SIFT. We also present cases where TSC-DL discovers human annotator omissions. Supplementary material, data and code is available at: http://berkeleyautomation.github.io/tsc-dl/.
Effects of concurrent endurance and strength training on running economy and .VO(2) kinetics.

PURPOSE
It has been suggested that endurance training influences the running economy (CR) and the oxygen uptake (.VO(2)) kinetics in heavy exercise by accelerating the primary phase and attenuating the .VO(2) slow component. However, the effects of heavy weight training (HWT) in combination with endurance training remain unclear. The purpose of this study was to examine the influence of a concurrent HWT+endurance training on CR and the .VO(2) kinetics in endurance athletes.


METHODS
Fifteen triathletes were assigned to endurance+strength (ES) or endurance-only (E) training for 14 wk. The training program was similar, except ES performed two HWT sessions a week. Before and after the training period, the subjects performed 1) an incremental field running test for determination of .VO(2max) and the velocity associated (V(.VO2max)), the second ventilatory threshold (VT(2)); 2) a 3000-m run at constant velocity, calculated to require 25% of the difference between .VO(2max) and VT(2), to determine CR and the characteristics of the VO(2) kinetics; 3) maximal hopping tests to determine maximal mechanical power and lower-limb stiffness; 4) maximal concentric lower-limb strength measurements.


RESULTS
After the training period, maximal strength were increased (P < 0.01) in ES but remained unchanged in E. Hopping power decreased in E (P < 0.05). After training, economy (P < 0.05) and hopping power (P < 0.001) were greater in ES than in E. .VO(2max), leg hopping stiffness and the .VO(2) kinetics were not significantly affected by training either in ES or E.


CONCLUSION
Additional HWT led to improved maximal strength and running economy with no significant effects on the .VO(2) kinetics pattern in heavy exercise.