snu-aidas/HVMap-dataset huggingface dataset:
Learning a Variational Network for Reconstruction of Accelerated MRI Data

PURPOSE
To allow fast and high-quality reconstruction of clinical accelerated multi-coil MR data by learning a variational network that combines the mathematical structure of variational models with deep learning.


THEORY AND METHODS
Generalized compressed sensing reconstruction formulated as a variational model is embedded in an unrolled gradient descent scheme. All parameters of this formulation, including the prior model defined by filter kernels and activation functions as well as the data term weights, are learned during an offline training procedure. The learned model can then be applied online to previously unseen data.


RESULTS
The variational network approach is evaluated on a clinical knee imaging protocol for different acceleration factors and sampling patterns using retrospectively and prospectively undersampled data. The variational network reconstructions outperform standard reconstruction algorithms, verified by quantitative error measures and a clinical reader study for regular sampling and acceleration factor 4.


CONCLUSION
Variational network reconstructions preserve the natural appearance of MR images as well as pathologies that were not included in the training data set. Due to its high computational performance, that is, reconstruction time of 193 ms on a single graphics card, and the omission of parameter tuning once the network is trained, this new approach to image reconstruction can easily be integrated into clinical workflow. Magn Reson Med 79:3055-3071, 2018. © 2017 International Society for Magnetic Resonance in Medicine.
Framework for a Digital Forensic Investigation

Computer Forensics is essential for the successful prosecution of computer criminals. For a forensic investigation to be performed successfully there are a number of important steps that have to be considered and taken. The aim of this paper is to define a clear, step-by-step framework for the collection of evidence suitable for presentation in a court of law. Existing forensic models will be surveyed and then adapted to create a specific application framework for single computer, entry point forensics.
Ultrasound for fetal assessment in early pregnancy.

BACKGROUND
Advantages of early pregnancy ultrasound screening are thought to be more accurate calculation of gestational age, earlier identification of multiple pregnancies, and diagnosis of non-viable pregnancies and certain fetal malformations.


OBJECTIVES
The objective of this review was to assess the use of routine (screening) ultrasound compared with the selective use of ultrasound in early pregnancy (ie before 24 weeks).


SEARCH STRATEGY
The Cochrane Pregnancy and Childbirth Group trials register and the Cochrane Controlled Trials Register (up to July 1998) were searched.


SELECTION CRITERIA
Adequately controlled trials of routine ultrasound imaging in early pregnancy.


DATA COLLECTION AND ANALYSIS
One reviewer assessed trial quality and extracted data. Study authors were contacted for additional information.


MAIN RESULTS
Nine trials were included. The quality of the trials was generally good. Routine ultrasound examination was associated with earlier detection of multiple pregnancies (twins undiagnosed at 26 weeks, odds ratio 0.08, 95% confidence interval 0.04 to 0.16) and reduced rates of induction of labour for post-term pregnancy (odds ratio 0. 61, 95% confidence interval 0.52 to 0.72). There were no differences detected for substantive clinical outcomes such as perinatal mortality (odds ratio 0.86, 95% confidence interval 0.67 to 1.12). Where detection of fetal abnormality was a specific aim of the examination, the number of terminations of pregnancy for fetal anomaly increased.


REVIEWER'S CONCLUSIONS
Routine ultrasound in early pregnancy appears to enable better gestational age assessment, earlier detection of multiple pregnancies and earlier detection of clinically unsuspected fetal malformation at a time when termination of pregnancy is possible. However the benefits for other substantive outcomes are less clear.
HS2: Active Learning over Hypergraphs

We propose a hypergraph-based active learning scheme which we term HS; HS generalizes the previously reported algorithm S originally proposed for graph-based active learning with pointwise queries [1]. Our HS method can accommodate hypergraph structures and allows one to ask both pointwise queries and pairwise queries. Based on a novel parametric system particularly designed for hypergraphs, we derive theoretical results on the query complexity of HS for the above described generalized settings. Both the theoretical and empirical results show that HS requires a significantly fewer number of queries than S when one uses S over a graph obtained from the corresponding hypergraph via clique expansion.
Persuasive messages on information system acceptance: A theoretical extension of elaboration likelihood model and social influence theory

Firms invest millions of dollars in the introduction of new information systems for long-term benefit. If employees are not willing to accept a new information system, such investments may be wasted. Employee acceptance of a new information system is in part determined by external influences. However, previous research has neglected the paths of persuasive strategies and external social influences on information system acceptance. Linkages between persuasive strategies and external social influences are also scarce. By integrating social influence theory and an elaboration likelihood model, this study explores the influence of persuasive messages (source credibility and argument quality) on social influence, affective response and cognitive response. This study also investigates the interrelationships among affective response, cognitive response and behavior intention. Furthermore, the moderating roles of social influences on the impact of affective response and cognitive response on behavior intention are identified. 2012 Elsevier Ltd. All rights reserved.
Differentiating anxiety forms and their role in academic performance from primary to secondary school

INTRODUCTION
Individuals with high levels of mathematics anxiety are more likely to have other forms of anxiety, such as general anxiety and test anxiety, and tend to have some math performance decrement compared to those with low math anxiety. However, it is unclear how the anxiety forms cluster in individuals, or how the presence of other anxiety forms influences the relationship between math anxiety and math performance.


METHOD
We measured math anxiety, test anxiety, general anxiety and mathematics and reading performance in 1720 UK students (year 4, aged 8-9, and years 7 and 8, aged 11-13). We conducted latent profile analysis of students' anxiety scores in order to examine the developmental change in anxiety profiles, the demographics of each anxiety profile and the relationship between profiles and academic performance.


RESULTS
Anxiety profiles appeared to change in specificity between the two age groups studied. Only in the older students did clusters emerge with specifically elevated general anxiety or academic anxiety (test and math anxiety). Our findings suggest that boys are slightly more likely than girls to have elevated academic anxieties relative to their general anxiety. Year 7/8 students with specifically academic anxiety show lower academic performance than those who also have elevated general anxiety.


CONCLUSIONS
There may be a developmental change in the specificity of anxiety and gender seems to play a strong role in determining one's anxiety profile. The anxiety profiles present in our year 7/8 sample, and their relationships with math performance, suggest a bidirectional relationship between math anxiety and math performance.
Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report)

The isomorphism problem for graphs G1 and G2 is to determine if there exists a one-to-one mapping of the vertices of G1 onto the vertices of G2 such that two vertices of G1 are adjacent if and only if their images in G2 are adjacent. In addition to determining the existence of such an isomorphism, it is useful to be able to produce an isomorphism-inducing mapping in the case where one exists.
 The isomorphism problem for triconnected planar graphs is particularly simple since a triconnected planar graph has a unique embedding on a sphere [6]. Weinberg [5] exploited this fact in developing an algorithm for testing isomorphism of triconnected planar graphs in O(|V|2) time where V is the set consisting of the vertices of both graphs. The result has been extended to arbitrary planar graphs and improved to O(|V|log|V|) steps by Hopcroft and Tarjan [2,3]. In this paper, the time bound for planar graph isomorphism is improved to O(|V|). In addition to determining the isomorphism of two planar graphs, the algorithm can be easily extended to partition a set of planar graphs into equivalence classes of isomorphic graphs in time linear in the total number of vertices in all graphs in the set. A random access model of computation (see Cook [1]) is assumed. Although the proposed algorithm has a linear asymptotic growth rate, at the present stage of development it appears to be inefficient on account of a rather large constant. This paper is intended only to establish the existence of a linear algorithm which subsequent work might make truly efficient.
An Efficient Power Scheduling Scheme for Residential Load Management in Smart Homes

In this paper, we propose mathematical optimization models of household energy units to optimally control the major residential energy loads while preserving the user preferences. User comfort is modelled in a simple way, which considers appliance class, user preferences and weather conditions. The wind-driven optimization (WDO) algorithm with the objective function of comfort maximization along with minimum electricity cost is defined and implemented. On the other hand, for maximum electricity bill and peak reduction, min-max regret-based knapsack problem (K-WDO) algorithm is used. To validate the effectiveness of the proposed algorithms, extensive simulations are conducted for several scenarios. The simulations show that the proposed algorithms provide with the best optimal results with a fast convergence rate, as compared to the existing techniques. Appl. Sci. 2015, 5 1135
Writing for synthesis of evidence in empirical software engineering

Context: Systematic literature reviews have become common in software engineering in the last decade, but challenges remain.
 Goal: Given the challenges, the objective is to describe improvement areas in writing primary studies, and hence provide a good basis for researchers aiming at synthesizing research evidence in a specific area.
 Method: The results presented are based on a literature review with respect to synthesis of research results in software engineering with a particular focus on empirical software engineering. The literature review is complemented and exemplified with experiences from conducting systematic literature reviews and working with research methodologies in empirical software engineering.
 Results: The paper presents three areas where improvements are needed to become more successful in synthesizing empirical evidence. These three areas are: terminology, paper content and reviewing.
 Conclusion: It is concluded that it must be possible to improve the primary studies, but it requires that researchers start having synthesis in mind when writing their research papers.
A morphologic two-stage approach for automated optic disk detection in color eye fundus images

A new adaptive morphological method for the automatic detection of the optic disk in digital color eye fundus images is presented in this paper. This method has been designed to detect the optic disk center and the optic disk rim. In our experiments with the DRIVE and DIARETDB1 databases, the proposed method was able to detect the optic disk center with 100% and 97.75% of accuracy, respectively. We considered correct all automatically detected optic disk location that is within the borders of the optic disk marked manually. Using our proposed method, the rim of the optic disk was detected in all images of the DRIVE database with average sensitivity and specificity of 83.54% and 99.81%, respectively, and on the DIARETDB1 database with average sensitivity and specificity of 92.51% and 99.76%, respectively. 2013 Published by Elsevier B.V.
Formal Verification With Frama-C: A Case Study in the Space Software Domain

With the increasing importance of software in the aerospace field, as evidenced by its growing size and complexity, a rigorous and reliable software verification and validation process must be applied to ensure conformance with the strict requirements of this software. Although important, traditional validation activities such as testing and simulation can only provide a partial verification of behavior in critical real-time software systems, and thus, formal verification is an alternative to complement these activities. Two useful formal software verification approaches are deductive verification and abstract interpretation, which analyze programs statically to identify defects. This paper explores abstract interpretation and deductive verification by employing Frama-C's value analysis and Jessie plug-ins to verify embedded aerospace control software. The results indicate that both approaches can be employed in a software verification process to make software more reliable.
A multilevel automatic thresholding method based on a genetic algorithm for a fast image segmentation

In this paper, a multilevel thresholding method which allows the determination of the appropriate number of thresholds as well as the adequate threshold values is proposed. This method combines a genetic algorithm with a wavelet transform. First, the length of the original histogram is reduced by using the wavelet transform. Based on this lower resolution version of the histogram, the number of thresholds and the threshold values are determined by using a genetic algorithm. The thresholds are then projected onto the original space. In this step, a refinement procedure may be added to detect accurate threshold values. Experiments and comparative results with multilevel thresholding methods over a synthetic histogram and real images show the efficiency of the proposed method. 2007 Elsevier Inc. All rights reserved.
The Distributed Simulation of Multi-Agent Systems

Agent-based systems are increasingly being applied in a wide range of areas including telecommunications, business process modelling, computer games, control of mobile robots and military simulations. Such systems are typically extremely complex and it is often useful to be able to simulate an agent-based system to learn more about its behaviour or investigate the implications of alternative architectures. In this paper, we discuss the application of distributed discrete-event simulation techniques to the simulation of multi-agent systems. We identify the efficient distribution of the agents’ environment as a key problem in the simulation of agent-based systems, and present an approach to the decomposition of the environment which facilitates load balancing. Keywords— agents, distributed simulation, interest management, load balancing.
Ant colony optimization : Introduction and recent trends

Ant colony optimization is a technique for optimization that was introduced in the early 1990’s. The inspiring source colony optimization is the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the of approximate solutions to discrete optimization problems, to continuous optimization problems, and to important pro telecommunications, such as routing and load balancing. First, we deal with the biological inspiration of ant colony optim algorithms. We show how this biological inspiration can be transfered into an algorithm for discrete optimization. Then, we ant colony optimization in more general terms in the context of discrete optimization, and present some of the nowad performing ant colony optimization variants. After summarizing some important theoretical results, we demonstrate how a optimization can be applied to continuous optimization problems. Finally, we provide examples of an interesting recent direction: The hybridization with more classical techniques from artificial intelligence and operations research.  2005 Elsevier B.V. All rights reserved.
Reporting and Methods in Clinical Prediction Research: A Systematic Review

BACKGROUND
We investigated the reporting and methods of prediction studies, focusing on aims, designs, participant selection, outcomes, predictors, statistical power, statistical methods, and predictive performance measures.


METHODS AND FINDINGS
We used a full hand search to identify all prediction studies published in 2008 in six high impact general medical journals. We developed a comprehensive item list to systematically score conduct and reporting of the studies, based on recent recommendations for prediction research. Two reviewers independently scored the studies. We retrieved 71 papers for full text review: 51 were predictor finding studies, 14 were prediction model development studies, three addressed an external validation of a previously developed model, and three reported on a model's impact on participant outcome. Study design was unclear in 15% of studies, and a prospective cohort was used in most studies (60%). Descriptions of the participants and definitions of predictor and outcome were generally good. Despite many recommendations against doing so, continuous predictors were often dichotomized (32% of studies). The number of events per predictor as a measure of statistical power could not be determined in 67% of the studies; of the remainder, 53% had fewer than the commonly recommended value of ten events per predictor. Methods for a priori selection of candidate predictors were described in most studies (68%). A substantial number of studies relied on a p-value cut-off of p<0.05 to select predictors in the multivariable analyses (29%). Predictive model performance measures, i.e., calibration and discrimination, were reported in 12% and 27% of studies, respectively.


CONCLUSIONS
The majority of prediction studies in high impact journals do not follow current methodological recommendations, limiting their reliability and applicability.
Human Motion Reconstruction from Action Video Data Using a 3-Layer-LSTM

Data driven motion generation is a challenging problem. Typically the model is trained using motion capture (MOCAP) data, which is limited in scope and diversity. Solving this problem using motion data extracted from Youtube videos would enable motion generation pipelines to feed from a wider range of action data, allowing for greater variability in the actions generated. Human action is expressed through a sequence of bodily movements. Hence, in this work we explore three stages for the motion synthesis pipeline: first by extracting human pose from video data with Part Affinity Fields method by [1], and then by training a 3-Layer Recurrent Neural Network (RNN) that learns to generate human-like motion for a given class from annotated video data, and finally we explore a simple synthesis of motion from multiple classes. Ultimately, this approach could enable robust generation of a wide range of motions, capturing the the subtle and fine variations of human movement expressed in videos that populate the Internet to artificially produce life like motion.
Parameterisation of a stochastic model for human face identification

Stochastic modelling of non-stationary vector timeseries based on HMMs has been very successful for speech applications [5]. Recently it has been applied to a range of image recognition problems [7, 9]. Previously reported work [6] has investigated the use of HMMs to model human faces for identi cation purposes. Faces can be intuitively divided into regions such as the mouth, eyes, nose, etc., and these regions can be associated with the states of an HMM. The identi cation performance of a top-bottom HMM compares favourably with some of the well-known algorithms, for example eigenfaces as detailed in [8]. However, the HMM parameterisation in the work presented so far was arrived at by subjective intuition. This paper presents experimental results which show how identi cation rates vary with HMM parameters, and which indicate the most sensible choice of parameters. The paper is organised as follows: section 2 gives an overview of the HMM-based approach; section 3 details the training and recognition processes; section 4 describes the experimental setup; section 5 presents the identi cation results; section 6 concludes the paper.
Theory application by school-based occupational therapists.

OBJECTIVES
Recent literature indicates that there is an inconsistent use of theory to guide clinical actions by occupational therapists, including those working in pediatrics. The purpose of this study was to describe school-based therapists' theory application by collecting information about what frames of reference they used and why.


METHOD
Of the 72 school-based therapists in the mid-Atlantic states who agreed to respond to a questionnaire, 51 (70.8%) returned the questionnaire. Information about demographics, what frames of reference were used, and why they were used was obtained from the questionnaire.


RESULTS
Respondents reported using a multitheoretical approach, with sensory integration theory and neurodevelopmental theory being the predominate frames of reference applied but not the only ones used. The frames of reference were used on the basis of several factors, including the children's needs and the respondent's education.


CONCLUSION
Formal and continuing education seems to have a great effect on school-based occupational therapists as they develop their personal conceptual frameworks.