Miracle-dz/UniFAR-FTUs huggingface dataset:
The research on screening function of myeloperoxidase in chest pain patients compared with coronary CT angiography

Objective: To explore the value of myeloperoxidase in screening patients with chest pain in early time. Methods 324 individuals were recruited and divided into coronary heart disease (CHD) group (165 cases) and non-coronary heart disease group (NCHD) (159 cases) according to the result of coronary CT angiography (CTA). CHD patients were divided into two groups, acute coronary syndrome (ACS) group and stable angina pectoris (SAP) group. We collected plasma samples in each group, and myeloperoxidase (MPO) levels were detected in plasma. MPO concentrations were detected by enzyme-linked immunosorbent assay (ELISA). Gensini scores were used to assess coronary artery lesions. Results The plasma MPO levels were significantly higher in CHD group than those in NCHD group (p<0.01). Patients with ACS had significantly higher MPO concentrations than those with SAP. MPO in the CHD patients had close relations with Gensini score. Sensitivity, specificity and total consistent rate of MPO were 79.39%, 96.22%, and 87.65% respectively. Kappa value (0.75, P<0.05) showed that the MPO level was in good agreement with CTA. Conclusions: The plasma MPO level can help us identify patients with chest pain in early time. MPO level has clear relations with the width of coronary artery. [MA Chun-mei, GUO Yue-ling, WU Jian-rong, YE Dao-bin, DENG Xiao-wei, LIU Hui-liang. The research on screening function of myeloperoxidase in chest pain patients compared with coronary CT angiography. Life Sci J 2014;11(12):1050-1053]. (ISSN:1097-8135). http://www.lifesciencesite. com. 180
Efficient Image Compression Technique using Clustering and Random Permutation

Multimedia data compression is a challenging situation for compression technique, due to the possibility of loss of data as well as it require large amount of storage place. The minimization of storage place and proper transmission of these data need compression. In this dissertation we proposed a block based DWT image compression technique using genetic algorithm and HCC code matrix. The HCC code matrix compressed into two different set redundant and non-redundant which generate similar pattern of block coefficient. The similar block coefficient generated by particle of swarm optimization. The process of particle of swarm optimization is select for the optimal block of DWT transform function. For the experimental purpose we used some standard image such as Lena, Barbara and cameraman image. The size of resolution of this image is 256*256. The source of image is Google.
Co-construction of sustainable collaborative practices in a smart neighbourhood : a methodological approach for analysing the future sharing of resources

This paper exposes a prospective methodology for anticipating scenarios and collaborative practices in a Smart and Collaborative Neighbourhood. We aim to identify the conditions necessary for the acceptance of such a socio-technical system, and focus on the coconstruction of sustainable collaborative practices by analyzing communicative interactions and collective decision-making processes. Our global approach respects the three foundations of Prospective Ergonomics. We first introduce the study of emerging practices in a collaborative housing project. Then, we discuss a creativity workshop we carried out in order to produce news ideas for scenarios. Finally, we discuss a tool we used to develop and test these scenarios: a collaborative serious game.
Adaptative Single-Phase Autoreclosing Based on Secondary Arc Voltage Harmonic Signature

-This paper presents an adaptative Single-Phase Auto Reclosure (SPAR) scheme to minimize protection dead time. The proposed method detects the extinction of the secondary arc. Computer simulation and secondary arc field tests were combined to improve the performance of adaptative SPAR for various secondary arc current levels. The PSCAD/EMTDC program together with measured secondary arc data were used to simulate secondary arc on the system. The harmonic content of the secondary arc voltage was analyzed with Short Time Discrete Fourier Transform (STDFT). The proposed algorithm is based on the characteristics of the odd order harmonics of the faulted voltage. The algorithm determined the secondary arc extinction and gave the order to reclose the circuit breaker. A properly designed control can be responsible for taking the decision on whether the fault is a permanent one or a transient fault, and if the transient one has extinguished, i.e. whether to trip the other sound phases or to reclose the faulted phase after the secondary arc extinction.
Maximal Clique Sets with Pseudo Clique Constraints ジェイ 泓杰

Many variants of pseudo-cliques have been introduced as a relaxation model of cliques to detect communities in real world networks. For most types of pseudo-cliques, enumeration algorithms can be designed just similar to maximal clique enumerator. However, the problem of enumerating pseudo-cliques is computational hard, because the number of maximal pseudocliques-cliques is huge in general. Furthermore, because of the weak requirement of k-plex, sparse communities are also allowed depending on the parameter k. To obtain a class of more dense pseudo cliques and to improve the computational performance, we introdue a derived graph whose vertices are cliques in the original input graph. Then our target pseudo must be a clique or a pseudo clique of the derived graph under an additional constraint requiring density in the original graph. An enumerator for this new class is designed and its computational efficientcy is experimentally verfied.
Character Identification on Multiparty Dialogues using Multimodal Features

다중 화자 대화 속 인물 식별(Character Identification)이란 드라마 대본 등 여러 등장인물이 나오는 대본에서 인물 멘션(Mention)들을 실제 인물과 연결해 주는 문제이다[1]. 인물 멘션이란 ‘그녀’또는 ‘아버지’와 같이 인물을 지칭하는 명사 또는 명사구 이다. 즉 이러한 명사 또는 명사구들이 실제 어떤 인물 을 나타내는지 파악하는 문제라고 볼 수 있다. 대화 문 장 속에서 인물 멘션이 의미하는 실제 인물을 파악하는 문제는 질의 응답, 요약과 같은 고차원 자연어처리 문제 를 해결하기 위해 중요한 단계이다 [2]. 인물 식별 문제 는 미국 드라마 프렌즈(Friends) 두 시즌(Season) 47개 화(Episode)에 대해서 데이터가 구축되었고[1,2], SemEval 2018 Task4[3]로 공개되어 다수의 연구팀이 참여 하는 등 여러 관련 연구가 진행되어 왔다[1-5]. 이 문제는 자연어처리에서 개체 연결(Entity Linking)[6] 및 상호참조해결(Coreference Resolution) [7,8] 문제와 비슷한 형태를 가진다. 그러나 연결 대상 이 되는 개체(Entity)가 지식베이스 개체가 아닌 대화 속 등장인물이기에 지식베이스 정보를 활용할 수 없고, 기존 상호참조해결 문제처럼 같은 개체를 나타내는 멘션 (Mention)들끼리 묶어주는 것 뿐만 아니라 실제 인물과 연결까지 해주어야 된다는 점이 다르다. 또한 이러한 다 중 화자 대화/대본은 은유, 수사적 표현 등이 많은 구어 그림 1 영상 정보 없이 대본 정보만으로는 대화 속 인물
Control of a positioning system with structural flexibility using piezoelectric transducers

This paper addresses the control problem for a structurally flexible positioning system by utilizing lead zirconate titanate (PZT) piezoelectric transducers to act as actuator and sensor elements. It is shown that proper placement of PZT actuators can result in less torque requirements for these actuators. Furthermore, a nonlinear control scheme is developed and augmented with a friction compensation term. Experimental results are presented which illustrate the effectiveness of the control algorithm and improved performance of the controller as compared to the case where no secondary actuation is used.
Mayr Ontological Document Reading An Experience Report

Ontological document reading is defined as automatically and appropriately populating a conceptual model representing an ontological conceptualization of some fragment of the real world. Appropriately populating the conceptualization involves not only extracting the information with respect to the declared object and relationship sets of the conceptual model but also involves checking the extracted information for real-world constraint violations, standardizing the data, and inferring the unwritten information that a document author intended to convey. Appropriately populating an ontology may, in addition, require adjustments to the ontology itself. This approach to document reading is presented in terms of an effort to build a system to extract the genealogical information in family history books. The status of the reading system is reported. Also explained is how the generated results can be imported into and thus contribute to the construction of a large repository of world-wide family interrelationships. The reading system’s potential use for constructing similar knowledge repositories in other domains is foreshadowed.
Effect of systemic doxycycline on scaling and root planing in chronic periodontitis

Background: Periodontitis is a multifactorial chronic inflammatory disease. It occurs due to inflammation and tooth-supporting tissues destruction by subgingival microbiota. Anti-infective therapy has been accepted as the cornerstone of periodontal treatment. Aim: The aim of the study was to evaluate the efficacy of doxycycline as adjunct to scaling and root planing in treatment of chronic periodontitis. Materials and Methods: A total of 52 participants having moderate to severe chronic periodontitis were included and divided into 2 groups: Group A (Test group-SRP+Doxycycline) and Group B (Control group-SRP alone). Plaque Index (PI), Gingival Index (GI), Probing Depth (PD) and Clinical Attachment Level (CAL) were assessed at baseline and 3 months interval. Result: Significant differences were seen from baseline to 3 months in both test and control groups in terms of reduction in PI, GI, PD and gain in CAL (P<0.001). Inter-group analysis showed significant differences between the two groups after 3 months, with GI, PD and CAL with P-value <0.001. Conclusion: At the end of 3 months, Doxycycline showed better results after mechanical therapy in the treatment of patients with chronic periodontitis because it has an anticollagenase effect that can inhibit tissue destruction and aid bone regeneration.
A novel biometric approach in human verification by photoplethysmographic signals

Presents a new human verification approach using photoplethysmography (PPG) signals that can be obtained easily from the fingertip. The experiment was performed on a group of 17 healthy subjects, and evident characteristics of the PPG signals were studied. These characteristics are unique identifiers specific to different persons while they are similar enough to recognize the same person. Four feature parameters were extracted from digitalized PPG signals. The template feature vector was formulated using part of the recorded signals, and then the discriminant function was applied to the remaining data for verification. The result with a successful rate of 94% shows that this method is promising for human verification.
Epworth sleepiness score to predict sleep apnea in acute stroke: Do we need to delve deeper?

Introduction: Globally, stroke is a leading cause of death and disability. Obstructive sleep apnea (OSA) is globally being recognized as an emerging public health problem and a risk factor for stroke. Epworth Sleepiness Score (ESS) is increasingly being used as a screening tool to determine the likelihood of OSA in a patient before polysomnography (PSG). However, ESS questionnaires in patients with acute stroke and their comparison with overnight PSG have not been studied. We conducted this study at a tertiary care respiratory center in Mumbai to determine the effectiveness of ESS in predicting the prevalence of sleep apnea in acute ischemic stroke. Materials and Methods: Twenty-eight patients of acute stroke were included in the study. These patients were subjected to ESS and technician attended overnight PSG. Apnea–Hypopnea Index, oxygen desaturation index, and minimum saturation were determined at the overnight PSG. Results: Majority of patients belonged to 61–80 years' age group (53.6%) and were predominantly male (89.3%). Only 5 patients (17.9%) showed an ESS of more than 8, whereas 23 patients (82.1%) showed evidence of OSA on PSG. Sensitivity of ESS in predicting OSA in patients with acute stroke was 17.3%, whereas specificity was 80%. Conclusion: The use of ESS in patients of acute stroke to screen for sleep-disordered breathing (SDB) should be avoided. A PSG may be considered in these patients as early diagnosis of SDB in these patients can help in improving recovery.
Development of tuberculosis vaccines in clinical trials: Current status

Tuberculosis (TB) is an important infectious disease worldwide. Currently, Bacillus Calmette‐Guérin (BCG) remains the only TB vaccine licensed for human use. This TB vaccine is effective in protecting children against severe military TB but offers variable protective efficacy in adults. Therefore, new vaccines against TB are needed to overcome this serious disease. At present, around 14 TB vaccine candidates are in different phases of clinical trials. These TB vaccines in clinical evaluation can be classified into two groups including preventive pre‐ and post‐exposure vaccines: subunit vaccines (attenuated viral vectors or adjuvanted fusion proteins), and whole‐cell vaccines (genetically attenuated Mycobacterium tuberculosis (M. tb), recombinant BCG, killed M. tb or M. vaccae). Although, over the last two decades a great progress in the search for a more effective TB vaccine has been demonstrated there is still no replacement for the licensed BCG vaccine. This article summarizes the current status of TB vaccine development and identifies crucial gaps of research for the development of an effective TB vaccine in all age groups.
Polarimetric scattering coefficients of half-space heterogeneous medium

Almost all natural media such as a rain, ice, fog, snow, clouds, leaves, forests, surface soil layer, agricultural plants, etc. can be considered as some kind of heterogeneous random medium embedded with nonspherical discrete particles. In this paper the polarimetric backscattering coefficients of half-space random medium are calculated for the purposes of the environmental remote sensing using polarimetric radars. The stochastic model of the half-space heterogeneous medium consists of a random current propagating in a hypothetical isotropic medium. The parameters of the model used in this paper are derived by the aid of strong permittivity fluctuation theory under a bilocal as well low-frequency approximations. The symmetry of scattering matrix F was proven in backscattering direction of measurement of scattered electromagnetic field in the atmosphere. It was shown that the polarimetric covariance matrix C consists of two polarimetric covariance matrices of unperturbed and random parts of scattered electromagnetic field. It was as well shown that in backscattering direction the scattering coefficients /spl sigma//sub hv/, /spl sigma//sub hhhv/, /spl sigma//sub hvvv/ are different from zero in general. The expressions of polarimetric backscattering scattering coefficients given in this paper are valid for arbitrary joint probability density function P(/spl theta/,/spl phi/) of scatterers spatial orientation. The obtained results can be used for the purposes of polarimetric remote sensing of heterogeneous natural media embedded with discrete scatterers having non spherical geometry.
Turing instabilities in a S-I-R model

With the increasing threat of biological warfare and the fear of an epidemic outbreak of influenza, smallpox, and other deadly diseases, the field of epidemic modeling is becoming increasingly important in the scientific fields. The focus of this thesis will be to create a model to study the effects of the rates of reaction and the rates of diffusion within a network based on the different parameters used in the modeling of any disease. For this model, the exact parameters of a specific disease are not as crucial as the qualitative behaviors that occur from the changing parameters. The model is linearly stable when diffusion does not exist. As diffusion is incorporated, Turing instabilities occur.
Robust Non-Bayesian Social Learning

We study non-Bayesian social learning in large networks and binary state space. Agents who are located in a network receive conditionally i.i. d. signals over the state. We refer to the initial distribution of signals as the information structure. In each step, all agents aggregate their belief with the beliefs of their neighbors according to some non-Bayesian rule. We refer to the aggregation rule as the learning dynamic. We say that a dynamic leads to learning if the beliefs of all agents converge to the correct state with a probability that approaches one in an increasing sequence of large networks. We say that a class of information structures p is learnable if there exists a learning dynamic that leads to learning for all information structures in p. Namely, there exists a single learning dynamic that robustly leads to learning for all possible information structures. We provide a necessary and sufficient characterization of learnable classes of information structures. Whenever learning is possible in a class p it is also possible via a virtually additive learning dynamic, where players map beliefs to virtual values and in each period they simply sum up all neighbors' virtual values to deduce their new belief. In addition, we relax the common prior assumption and provide a sufficient condition for learning in the absence of a common prior.
Bridging the Latency Gap between NVM and DRAM for Latency-bound Operations

Non-Volatile Memory (NVM) technologies exhibit 4X the read access latency of conventional DRAM. When the working set does not fit in the processor cache, this latency gap between DRAM and NVM leads to more than 2X runtime increase for queries dominated by latency-bound operations such as index joins and tuple reconstruction. We explain how to easily hide NVM latency by interleaving the execution of parallel work in index joins and tuple reconstruction using coroutines. Our evaluation shows that interleaving applied to the non-trivial implementations of these two operations in a production-grade codebase accelerates end-to-end query runtimes on both NVM and DRAM by up to 1.7X and 2.6X respectively, thereby reducing the performance difference between DRAM and NVM by more than 60%.
Crossflow: A Framework for Distributed Mining of Software Repositories

Large-scale software repository mining typically requires substantial storage and computational resources, and often involves a large number of calls to (rate-limited) APIs such as those of GitHub and StackOverflow. This creates a growing need for distributed execution of repository mining programs to which remote collaborators can contribute computational and storage resources, as well as API quotas (ideally without sharing API access tokens or credentials). In this paper we introduce Crossflow, a novel framework for building distributed repository mining programs. We demonstrate how Crossflow can delegate mining jobs to remote workers and cache their results, and how workers can implement advanced behaviour such as load balancing and rejecting jobs they cannot perform (e.g. due to lack of space, credentials for a specific API).
Accelerating the Unacceleratable: Hybrid CPU/GPU Algorithms for Memory-Bound Database Primitives

Many database operations have a low compute to memory access ratio. In heterogeneous systems, where a graphics processing unit (GPU) is interconnected via PCIe, the data transfer bottleneck is perceived as insurmountable to achieving performance gains on these memory-bound database primitives. On the other hand, several compute-bound database operations have been shown to achieve significant performance gains using the GPU. This leads to CPU-only memory-bound applications having an increasingly non-negligible impact on database query throughput. In this paper we examine several of these overlooked algorithms, including (i) batched predecessor searches; (ii) multiway merging; and, (iii) partitioning. We examine the performance of parallel CPU-only, GPU-only, and hybrid CPU/GPU approaches, and show that hybrid algorithms achieve respectable performance gains. We develop a model that considers main memory accesses and PCIe data transfers, which are two major bottlenecks for hybrid CPU/GPU algorithms. The model lets us analytically determine how to distribute work between the CPU and GPU to maximize resource utilization while minimizing load imbalance. We show that our model can accurately predict the fraction of work to be sent to each architecture, and consequently, confirms that these overlooked database primitives can be accelerated despite their memory-bound nature.
Freezing Frozen Pages with Multi-Stream SSDs

Flash memory SSDs have been replacing hard disks as the main storage thanks to their high IOPS/$ and energy e ciency [6]. Internally within SSD, Flash Translation Layer (FTL) has control over data mapping and garbage collection (GC). Because of its architectural feature, log-structured approach, the costly GC operation is unavoidable to secure new blocks for newly written pages. During every GC, valid pages from the victim block have to be relocated causing additional writes. It is well known that these additional writes (i.e., write ampli cation) negatively a ect the performance and lifespan of the ash memory SSDs. Hence, it is imperative to reduce write ampli cation factor (WAF) in modern ash memory SSDs. Though numerous FTLs have been proposed with this goal in mind, the most commercial ash storage device is known to take the page-mapping FTL approach [7]. Unfortunately, it is well known that page-mapping FTL results in highWAF (e.g., 5), particularly against random write patterns which are common in OLTP workloads. Recently, one interesting interface for ash memory SSDs, called Multi-Streamed SSD (MS-SSD in short), has been proposed and standardized to lower the GC overhead with the help of explicit hint on data lifetime from applications [4, 8]. The main purpose of MS-SSD is to allow to place data pages with di erent lifetime into di erent ash regions so as to reduce the SSD-internal WAF from GC. Meanwhile, the e ectiveness of MS-SSD is highly dependent on the accuracy of the classi cation of the lifetime of each data pages [3]. Therefore, it is critical for any MS-SSD applications to precisely classify logical data pages according to their
A Large-Scale Study About Quality and Reproducibility of Jupyter Notebooks

Jupyter Notebooks have been widely adopted by many different communities, both in science and industry. They support the creation of literate programming documents that combine code, text, and execution results with visualizations and all sorts of rich media. The self-documenting aspects and the ability to reproduce results have been touted as significant benefits of notebooks. At the same time, there has been growing criticism that the way notebooks are being used leads to unexpected behavior, encourage poor coding practices, and that their results can be hard to reproduce. To understand good and bad practices used in the development of real notebooks, we studied 1.4 million notebooks from GitHub. We present a detailed analysis of their characteristics that impact reproducibility. We also propose a set of best practices that can improve the rate of reproducibility and discuss open challenges that require further research and development.
In situ Statistics Generation within partially reconfigurable Hardware Accelerators for Query Processing

Hardware Accelerators for Query Processing are often optimized to filter as much data as possible before the results are stored to memory or sent to the user. However, the static nature of such optimized accelerators limits the amount of operators they can implement to a fixed amount configured at synthesis time. If not all operators can be pushed down to the accelerator, the decision which operators should be pushed down has therefore a big impact on the resulting data size and overall query execution time. Statistics are therefore used to determine which operators to push onto the hardware accelerators. Gathering these statistics is therefore of utmost importance. In this paper we present multiple possibilities to gather statistics within an accelerator while executing a partial query. These statistics can be gradually improved with every execution of the accelerator be of use in future queries during the query planning phase.