snu-aidas/HVMap-dataset huggingface dataset:
Breathing at a rate of 5.5 breaths per minute with equal inhalation-to-exhalation ratio increases heart rate variability.

OBJECTIVES
Prior studies have found that a breathing pattern of 6 or 5.5 breaths per minute (bpm) was associated with greater heart rate variability (HRV) than that of spontaneous breathing rate. However, the effects of combining the breathing rate with the inhalation-to-exhalation ratio (I:E ratio) on HRV indices are inconsistent. This study aimed to examine the differences in HRV indices and subjective feelings of anxiety and relaxation among four different breathing patterns.


METHODS
Forty-seven healthy college students were recruited for the study, and a Latin square experimental design with a counterbalance in random sequences was applied. Participants were instructed to breathe at two different breathing rates (6 and 5.5 breaths) and two different I:E ratios (5:5 and 4:6). The HRV indices as well as anxiety and relaxation levels were measured at baseline (spontaneous breathing) and for the four different breathing patterns.


RESULTS
The results revealed that a pattern of 5.5 bpm with an I:E ratio of 5:5 produced a higher NN interval standard deviation and higher low frequency power than the other breathing patterns. Moreover, the four different breathing patterns were associated with significantly increased feeling of relaxation compared with baseline.


CONCLUSION
The study confirmed that a breathing pattern of 5.5 bpm with an I:E ratio of 5:5 achieved greater HRV than the other breathing patterns. This finding can be applied to HRV biofeedback or breathing training in the future.
Three-dimensional soft-tissue and hard-tissue changes in the treatment of bimaxillary protrusion.

INTRODUCTION
Facial convexity related to bimaxillary protrusion is prevalent in many populations. Underlying skeletal protrusion combined with increased dentoalveolar protrusion contributes to facial muscle imbalance and lip incompetence, which is undesirable for many patients. In this study, we evaluated the relationship between soft-tissue and hard-tissue changes in an orthodontically treated Asian population.


METHODS
Twenty-four consecutive adult Asian patients (mean age, 24 years), diagnosed with severe bimaxillary dentoalveolar protrusion, were evaluated using pretreatment and posttreatment cone-beam computed tomography. The patients were treated with 4 first premolar extractions followed by anterior retraction with either skeletal or intraoral anchorage. Serial cone-beam computed tomography radiographs were registered on the entire cranial base and fossa. Soft-tissue and hard-tissue changes were determined through landmark displacement and color mapping.


RESULTS
Upper lip retraction was concentrated between the nasolabial folds and commissures. Lower lip retraction was accompanied by significant redistribution of soft tissues at pogonion. Soft-tissue changes correlated well with regional facial muscle activity. Significant retractions (2-4 mm) of the soft tissues occurred beyond the midsagittal region. Use of skeletal anchorage resulted in 1.5 mm greater lower lip retraction than intraoral anchorage, with greater retraction of the maxillary and mandibular incisor root apices.


CONCLUSIONS
Profound soft-tissue changes accompanied retraction of the anterior dentition with both treatment modalities.
Parameterized Pattern Matching: Algorithms and Applications

The problem of finding sections of code that either are identical or are related by the systematic renaming of variables or constants can be modeled in terms of parameterized strings ( p-strings) and parameterized matches ( p-matches). P-strings are strings over two alphabets, one of which represents parameters. Two p-strings are a parameterized match ( p-match) if one p-string is obtained by renaming the parameters of the other by a one-to-one function. In this paper, we investigate parameterized pattern matching via parameterized suffix trees (p-suffix trees). We give two algorithms for constructing p-suffix trees: one (eager) that runs in linear time for fixed alphabets, and another that uses auxiliary data structures and runs in O(n log(n)) time for variable alphabets, where n is input length. We show that using a p-suffix tree for a pattern p-string P, it is possible to search for all p-matches of P within a text p-string T in space linear in |P| and time linear in |T | for fixed alphabets, or O( |T | log(min( |P|, _)) time and O( |P|) space for variable alphabets, where _ is the sum of the alphabet sizes. The simpler p-suffix tree construction algorithm eager has been implemented, and experiments show it to be practical. Since it runs faster than predicted by the above worst-case bound, we reanalyze the algorithm and show that eager runs in time O(min(t |S |+m(t, S) | t>0) log _)), where for an input p-string S, m(t, S) is the number of maximal p-matches of length at least t that occur within S, and _ is the sum of the alphabet sizes. Experiments with the author's program dup (B. Baker, in ``Comput. Sci. Statist.,'' Vol. 24, 1992) for finding all maximal p-matches within a p-string have found m(t, S) to be less than |S | in practice unless t is small. ] 1996 Academic Press, Inc.
Speech and Language Processing

CHAPTER 18 Lexicons for Sentiment and Affect Extraction " [W]e write, not with the fingers, but with the whole person. The nerve which controls the pen winds itself about every fibre of our being, threads the heart, pierces the liver. " Virginia Woolf, Orlando " She runs the gamut of emotions from A to B. " Dorothy Parker, reviewing Hepburn's performance in Little Women In this chapter we turn to tools for interpreting affective meaning, extending our affective study of sentiment analysis in Chapter 7. We use the word 'affective', following the tradition in affective computing (Picard, 1995) to mean emotion, sentiment, personality , mood, and attitudes. Affective meaning is closely related to subjectivity, subjectivity the study of a speaker or writer's evaluations, opinions, emotions, and speculations (Wiebe et al., 1999). How should affective meaning be defined? One influential typology of affec-tive states comes from Scherer (2000), who defines each class of affective states by factors like its cognition realization and time course: Emotion: Relatively brief episode of response to the evaluation of an external or internal event as being of major significance. Mood: Diffuse affect state, most pronounced as change in subjective feeling, of low intensity but relatively long duration, often without apparent cause. Interpersonal stance: Affective stance taken toward another person in a specific interaction, colouring the interpersonal exchange in that situation. Figure 18.1 The Scherer typology of affective states, with descriptions from Scherer (2000).
TOLDI: An effective and robust approach for 3D local shape description

Feature description for the 3D local shape in the presence of noise, varying mesh resolutions, clutter and occlusion is a quite challenging task in 3D computer vision. This paper tackles the problem by proposing a new local reference frame (LRF) together with a novel triple orthogonal local depth images (TOLDI) representation, forming the TOLDI method for local shape description. Compared with previous methods, TOLDI manages to perform efficient, distinctive and robust description for the 3D local surface simultaneously under various feature matching contexts. The proposed LRF differs from many prior ones in its calculation of the z-axis and x-axis, the z-axis is calculated using the normal of the keypoint and the x-axis is computed by aggregating the weighted projection vectors of the radius neighbors. TOLDI feature descriptors are then obtained by concatenating three local depth images (LDI) captured from three orthogonal view planes in the LRF into feature vectors. The performance of our TOLDI approach is rigorously evaluated on several public datasets, which contain three major surface matching scenarios, namely shape retrieval, object recognition and 3D registration. Experimental results and comparisons with the state-of-the-arts validate the effectiveness, robustness, high efficiency, and overall superiority of our method. Our method is also applied to aligning 3D object ∗Corresponding author Email addresses: jqyang@hust.edu.cn (Jiaqi Yang), hangfanzq@163.com (Qian Zhang), Yang Xiao@hust.edu.cn (Yang Xiao), zgcao@hust.edu.cn (Zhiguo Cao) Preprint submitted to Journal of LTEX Templates November 23, 2016 and indoor scene point clouds obtained by different devices (i.e., LiDAR and Kinect), the accurate outcomes further confirm the effectiveness of our method.
Normalization at the field level: Fractional counting of citations

Van Raan et al. (2010) accepted our critique for the case of journal normalization (previously CPP/JCSm); CWTS has in the meantime adapted its procedures. However, a new indicator was proposed for field normalization (previously CPP/FCSm), called the “mean normalized citation score” (MNCS; cf. Lundberg, 2007). In our opinion, this latter change does not sufficiently resolve the problems. Since the new indicator is considered another “crown indicator,” it seems urgent to warn against and elaborate on these remaining problems. In addition to damaging evaluation processes at the level of individuals and institutions, the “crown indicator” is also used by CWTS for the “Leiden Rankings,” and flaws in it can therefore misguide policies at national levels. also
A New Framework for Computer Science and Engineering

T raditionally, computing studies has two partitions—science and engineering—that are separated by a line roughly at the computer architecture level. Above the line is computer science and below is computer engineering. Each of these two disciplines then breaks into subspecialties, such as the decomposition of computer science into theory, systems, and AI. Such an approach succeeds in dividing the field into affinity groups, but it tends to isolate its respective parts and the systems that come from them. This isolation, in turn, makes it difficult to incorporate either an integrative systems-oriented perspective or the interdisciplinary work that is rapidly becoming critical to computing studies’ future.1 A more effective organization for computer science and engineering (CS&E)—and one that helps point the way toward its promising future—requires an intrinsically interdisciplinary framework that combines academic and systems-oriented computing perspectives. My colleagues and I have been developing such a framework, which is already changing key segments of CS&E at the University of Southern California (USC). The framework reaggregates computer science and computer engineering and then repartitions the resulting single field into analysis and synthesis components.2-4 Analysis, the more academic of the two, focuses on the nature of computing and the relationships between computer science and other major scientific domains. The synthesis component builds up computer engineering as a more pragmatic systems-oriented activity through a hierarchy of related layers, each of which covers important interdisciplinary issues. The framework is based on the notion that science is foremost about dissecting and understanding, and engineering is mostly about envisioning and building. True, scientists also envision and build—integrated models, for example—but such activities are directed mostly at dissecting and understanding something. Likewise engineers also dissect and understand things, but primarily to envision and build. Extending these notions to computing studies, computer science is concerned with dissecting and understanding the nature of computing and its relationship to the other sciences, while computer engineering is concerned To realize the compelling future of computing studies, researchers and analysts must rethink the traditional way of partitioning and structuring computer science and engineering. A framework that USC is already partially implementing combines an explicitly interdisciplinary academic focus with a systems-oriented perspective. Paul S. Rosenbloom University of Southern California
Automatic Classification for Vietnamese News

This paper proposes an automatic framework to classify Vietnamese news from news sites on the Internet. In this proposed framework, the extracted main content of Vietnamese news is performed automatically by applying the improved performance extraction method from [1]. This information will be classified by using two machine learning methods: Support vector machine and naïve bayesian method. Our experiments implemented with Vietnamese news extracted from some sites showed that the proposed classification framework give acceptable results with a rather high accuracy, leading to applying it to real information systems.
A k-mean clustering algorithm for mixed numeric and categorical data

Use of traditional k-mean type algorithm is limited to numeric data. This paper presents a clustering algorithm based on k-mean paradigm that works well for data with mixed numeric and categorical features. We propose new cost function and distance measure based on co-occurrence of values. The measures also take into account the significance of an attribute towards the clustering process. We present a modified description of cluster center to overcome the numeric data only limitation of k-mean algorithm and provide a better characterization of clusters. The performance of this algorithm has been studied on real world data sets. Comparisons with other clustering algorithms illustrate the effectiveness of this approach. 2007 Elsevier B.V. All rights reserved.
Unsupervised Learning with Mixed Numeric and Nominal Data

ÐThis paper presents a Similarity-Based Agglomerative Clustering (SBAC) algorithm that works well for data with mixed numeric and nominal features. A similarity measure, proposed by Goodall for biological taxonomy [15], that gives greater weight to uncommon feature value matches in similarity computations and makes no assumptions of the underlying distributions of the feature values, is adopted to define the similarity measure between pairs of objects. An agglomerative algorithm is employed to construct a dendrogram and a simple distinctness heuristic is used to extract a partition of the data. The performance of SBAC has been studied on real and artificially generated data sets. Results demonstrate the effectiveness of this algorithm in unsupervised discovery tasks. Comparisons with other clustering schemes illustrate the superior performance of this approach. Index TermsÐAgglomerative clustering, conceptual clustering, feature weighting, interpretation, knowledge discovery, mixed numeric and nominal data, similarity measures, 2 aggregation.
Chameleon: Hierarchical Clustering Using Dynamic Modeling

68 Computer C lustering is a discovery process in data mining. 1 It groups a set of data in a way that maximizes the similarity within clusters and minimizes the similarity between two different clusters. 1,2 These discovered clusters can help explain the characteristics of the underlying data distribution and serve as the foundation for other data mining and analysis techniques. Clustering is useful in characterizing customer groups based on purchasing patterns, categorizing Web documents, 3 grouping genes and proteins that have similar func-tionality, 4 grouping spatial locations prone to earthquakes based on seismological data, and so on. Most existing clustering algorithms find clusters that fit some static model. Although effective in some cases, these algorithms can break down—that is, cluster the data incorrectly—if the user doesn't select appropriate static-model parameters. Or sometimes the model cannot adequately capture the clusters' characteristics. Most of these algorithms break down when the data contains clusters of diverse shapes, densities , and sizes. Existing algorithms use a static model of the clusters and do not use information about the nature of individual clusters as they are merged. Furthermore, one set of schemes (the CURE algorithm and related schemes) ignores the information about the aggregate interconnectivity of items in two clusters. The other set of schemes (the Rock algorithm, group averaging method, and related schemes) ignores information about the closeness of two clusters as defined by the similarity of the closest items across two clusters. (For more information, see the " Limitations of Traditional Clustering Algorithms " sidebar.) By only considering either interconnectivity or close-ness, these algorithms can easily select and merge the wrong pair of clusters. For instance, an algorithm that focuses only on the closeness of two clusters will incorrectly merge the clusters in Figure 1a over those in Figure 1b. Similarly, an algorithm that focuses only on interconnectivity will, in Figure 2, incorrectly merge the dark-blue with the red cluster rather than the green one. Here, we assume that the aggregate interconnec-tivity between the items in the dark-blue and red clusters is greater than that of the dark-blue and green clusters. However, the border points of the dark-blue cluster are much closer to those of the green cluster than those of the red cluster. Chameleon is a new agglomerative hierarchical clustering algorithm that overcomes the limitations of existing clustering algorithms. Figure 3 (on page 70) provides an overview of the overall approach …
WhatsApp network forensics: Decrypting and understanding the WhatsApp call signaling messages

WhatsApp is a widely adopted mobile messaging application with over 800 million users. Recently, a calling feature was added to the application and no comprehensive digital forensic analysis has been performed with regards to this feature at the time of writing this paper. In this work, we describe how we were able to decrypt the network traffic and obtain forensic artifacts that relate to this new calling feature which included the: a) WhatsApp phone numbers, b) WhatsApp server IPs, c) WhatsApp audio codec (Opus), d) WhatsApp call duration, and e) WhatsApp's call termination. We explain the methods and tools used to decrypt the traffic as well as thoroughly elaborate on our findings with respect to the WhatsApp signaling messages. Furthermore, we also provide the community with a tool that helps in the visualization of the WhatsApp protocol messages. © 2015 Elsevier Ltd. All rights reserved.
A survey of socially interactive robots

This paper reviews “socially interactive robots”: robots for which social human–robot interaction is important. We begin by discussing the context for socially interactive robots, emphasizing the relationship to other research fields and the different forms of “social robots”. We then present a taxonomy of design methods and system components used to build socially interactive robots. Finally, we describe the impact of these robots on humans and discuss open issues. An expanded version of this paper, which contains a survey and taxonomy of current applications, is available as a technical report [T. Fong, I. Nourbakhsh, K. Dautenhahn, A survey of socially interactive robots: concepts, design and applications, Technical Report No. CMU-RI-TR-02-29, Robotics Institute, Carnegie Mellon University, 2002]. © 2003 Elsevier Science B.V. All rights reserved.
An Active Pixel Sensor Fabricated Using CMOS / CCD Process Technology

Paul P. K. Lee, Russell C. Gee*, R. Michael Guidash, T-H. Lee, and Eric R. Fossum* Microelectronics Technology Division, Eastman Kodak Company 1669 Lake Avenue, Rochester, New York 14650-2008 Tel: (716) 477-2869, Fax: (716) 477-4947, Internet: ppklee@Kodak.COM *Jet Propulsion Laboratory, California Institute of Technology 4800 Oak Grove Drive, Pasadena, CA 91109 Abstract This paper describes the integration of the active pixel sensor (APS) architecture normally fabricated in conventional complementary metal oxide semiconductor (CMOS) technology with a pinned photodiode (PPD) device using a mixed process technology. This new technology allows mix and match of CMOS and high performance charged coupled device (CCD) modules. The PPD [1] becomes the photoactive element in an XYaddressable area array with each pixel containing active devices for the transfer, readout and reset functions. It is a standard photo-sensitive element, available in a high performance true two-phase CCD technology developed previously for CCD-based image sensors [2]. An n-well 2-μm CMOS technology was combined with the CCD process to provide the best features from both. A Design of Experiment approach was used with Technology Computer Aided Design (TCAD) tools to develop and optimize the new mixed process technology without sacrificing any CCD performance while minimizing impact to the CMOS device characteristics [3]. By replacing polysilicon photocapacitor or photogate in conventional APS with the pinned photodiode, deficiencies in poor blue response and high dark current are minimized [4].
COID: A cluster–outlier iterative detection approach to multi-dimensional data analysis

Nowadays, most data mining algorithms focus on clustering methods alone. Also, there are a lot of approaches designed for outlier detection. We observe that, in many situations, clusters and outliers are concepts whose meanings are inseparable to each other, especially for those data sets with noise. Thus, it is necessary to treat both clusters and outliers as concepts of the same importance in data analysis. In this paper, we present our continuous work on the cluster–outlier iterative detection algorithm (Shi in SubCOID: exploring cluster-outlier iterative detection approach to multi-dimensional data analysis in subspace. Auburn, pp. 132–135, 2008; Shi and Zhang in Towards exploring interactive relationship between clusters and outliers in multi-dimensional data analysis. IEEE Computer Society. Tokyo, pp. 518–519, 2005) to detect the clusters and outliers in another perspective for noisy data sets. In this algorithm, clusters are detected and adjusted according to the intra-relationship within clusters and the inter-relationship between clusters and outliers, and vice versa. The adjustment and modification of the clusters and outliers are performed iteratively until a certain termination condition is reached. This data processing algorithm can be applied in many fields, such as pattern recognition, data clustering, and signal processing. Experimental results demonstrate the advantages of our approach.
Gender identity disorder in twins: a review of the case report literature.

INTRODUCTION
The etiology of gender identity disorder (GID) remains largely unknown. In recent literature, increased attention has been attributed to possible biological factors in addition to psychological variables.


AIM
To review the current literature on case studies of twins concordant or discordant for GID.


METHODS
A systematic, comprehensive literature review.


RESULTS
Of 23 monozygotic female and male twins, nine (39.1%) were concordant for GID; in contrast, none of the 21 same-sex dizygotic female and male twins were concordant for GID, a statistically significant difference (P=0.005). Of the seven opposite-sex twins, all were discordant for GID.


CONCLUSIONS
These findings suggest a role for genetic factors in the development of GID.