Reviewerly/exHarmony huggingface dataset:
The Story Behind the HL7 FHIR to CDISC Mapping Implementation Guide

BackgroundHealth data has become an abundant and rich source of information that can be leveraged for clinical trials. Health Level Seven (HL7) provides standards for health care data, while the Clinical Data Interchange Standards Consortium (CDISC) provides standards for research data. Bridging these worlds and leveraging health data has the potential to enhance knowledge and data quality, while reducing delays and cost in clinical trials.Objectives The aim was to provide an overview of the HL7 Fast Healthcare Interoperability Resources (FHIR®) to CDISC Joint Mapping Implementation Guide (IG) development. The ultimate aim is to increase awareness of this rich resource.MethodsA gap analysis was performed to assess the possibility and feasibility of mapping from FHIR to the CDISC’s Study Data Tabulation Model (SDTM) and Clinical Data Acquisition Standards Harmonization (CDASH) standards. The mapping of CDISC domains commenced using FHIRPath, a path-based navigation and extraction language. The domains mapped were Medical History (MH), Concomitant Medications (CM), Procedures (PR), Vital Signs (VS), Laboratory (LB), Adverse Events (AE), and Demographics (DM). The proposed mappings were evaluated through a formal review process.ResultsThe review process consisted of a CDISC Internal Review and a simultaneous CDISC Public Review and HL7 Ballot Review.&amp;nbsp; A total of 363 comments were obtained from the following reviews: 1) CDISC Internal Review (268), and 2) simultaneous Public Review (95) - CDISC (37), HL7 (58). The predominant gathered in the review included mapping updates, terminology, and requests for greater detail.ConclusionThe HL7 FHIR®&amp;nbsp;to CDISC Joint Mapping Implementation Guide (IG) provides a rich resource for bridging health care and research standards that can be used with CDISC LB to LOINC mapping guide for leveraging real-world data for clinical trials. The guide assists stakeholders in utilizing health data through the HL7 FHIR® resources to CDISC, CDASH, and SDTM variables. As the community uses this resource, it will continue to mature and potentially expand into new domains.
Petrochemical Equipment Tracking by Improved Yolov7 Network and Hybrid Matching in Moving Scenes

Petrochemical equipment tracking is a fundamental and important technology in petrochemical industry security monitoring, equipment working risk analysis, and other applications. In complex scenes where the multiple pipelines present different directions and many kinds of equipment have huge scale and shape variation in seriously mutual occlusions captured by moving cameras, the accuracy and speed of petrochemical equipment tracking would be limited because of the false and missed tracking of equipment with extreme sizes and severe occlusion, due to image quality, equipment scale, light, and other factors. In this paper, a new multiple petrochemical equipment tracking method is proposed by combining an improved Yolov7 network with attention mechanism and small target perceive layer and a hybrid matching that incorporates deep feature and traditional texture and location feature. The model incorporates the advantages of channel and spatial attention module into the improved Yolov7 detector and Siamese neural network for similarity matching. The proposed model is validated on the self-built petrochemical equipment video data set and the experimental results show it achieves a competitive performance in comparison with the related state-of-the-art tracking algorithms.
Effective Emoticon Suggestion Technique Based on Active Emotional Input Using Facial Expressions and Heart Rate Signals

The evolution of mobile communication technology has brought about significant changes in the way people communicate. However, the lack of nonverbal cues in computer-mediated communication can make the accurate interpretation of emotions difficult. This study proposes a novel approach for using emotions as active input in mobile systems. This approach combines psychological and neuroscientific principles to accurately and comprehensively assess an individual's emotions for use as input in mobile systems. The proposed technique combines facial and heart rate information to recognize users' five prime emotions, which can be implemented on mobile devices using a front camera and a heart rate sensor. A user evaluation was conducted to verify the efficacy and feasibility of the proposed technique, and the results showed that users could express emotions faster and more accurately, with average recognition accuracies of 90% and 82% for induced and intended emotional expression, respectively. The proposed technique has the potential to enhance the user experience and provide more personalized and dynamic interaction with mobile systems.
Coalition Formation Game for Cost-Efficient Multiparty Payment Channel in Payment Channel Networks

Blockchain has introduced a new era for online payment services and its economy with tamper-proof cryptocurrencies. However, blockchain, which is based on global peer-to-peer networks, has its limitations due to payment delays from global consensus and transaction costs for maintenance. Thus, payment channel networks (PCN) have been proposed as one of the most promising off-chain solutions, allowing users to pay directly through payment channels (PC), with minimal blockchain involvement. However, payment delays and cost problems still exist, especially given the large size of the PCN. This study proposes a multiparty payment channel (MPC) that enables multiple users to join the same PC and exchange payment transactions, compared to the legacy PC. To avoid a consensus procedure among users in the PC, we introduce sequential and parallel updates for the PC status. Since increasing the MPC size limits the advantages in terms of the delay and cost, we propose a distributed coalition formation algorithm to form the MPC group, in which each user has the choice to join or leave the group. Simulations show that the proposed algorithm establishes MPCs successfully, considering the trade-off between the payoff gain and the MPC delay cost.
On the number of rational points on Artin-Schreier hypersurfaces

Let Fqk denote the finite field with qk elements. In this work, we study the number of Fqk-rational points of the affine hypersurfaces given by yq−y=a1x1d1+…+asxsds+b. We prove that if b∈Fqk has a nonzero trace over Fq, then Weil's bound cannot be achieved and that a sharp bound can be explicitly provided. In the case Trqk/q(b)=0, we give necessary and sufficient conditions for Weil's bound to be attained. Furthermore, we present several new cases in which formulas for the number of Fqk-rational points can be obtained.
Low <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e20" altimg="si6.svg"><mml:mi>c</mml:mi></mml:math>-differential uniformity of the swapped inverse function in odd characteristic

The study of Boolean functions with low c-differential uniformity has become recently an important topic of research. However, in odd characteristic case, there are not many results on the (c-)differential uniformity of functions that are not power functions. In this paper, we investigate the c-differential uniformity of the swapped inverse functions in odd characteristic, and show that their c-differential uniformities are at most 6 except for some special case.
The blindfolded traveler’s problem: A search framework for motion planning with contact estimates

We address the problem of robot motion planning under uncertainty where the only observations are through contact with the environment. Such problems are typically solved by planning optimistically assuming unknown space is free, moving along the planned path and re-planning if the robot collides. However this approach can be very inefficient, leading to many unnecessary collisions and unproductive motion. We propose a new formulation, the Blindfolded Traveler’s Problem (BTP), for planning on a graph containing edges with unknown validity, with true validity observed only through attempted traversal by the robot. The solution to a BTP is a policy indicating the next edge to attempt given previous observations and an initial belief. We prove that BTP is NP-complete and show that exact modeling of the belief is intractable, therefore we present several approximation-based policies and beliefs. For the policy we propose graph search with edge weights augmented by the probability of collision. For the belief representation we propose a weighted Mixture of Experts of Collision Hypothesis Sets and a Manifold Particle Filter. Empirical evaluation in simulation and on a real robot arm shows that our proposed approach vastly outperforms several baselines as well as a previous approach that does not employ the BTP framework.
Content Strategy and Intercultural Communication: Analysis of International Websites of Chinese Universities

This study examines the content strategies of 12 Chinese universities’ international websites. Going beyond the Hofstede–Hall model, we explore a novel mixed-method study using both content strategy analysis and user research to investigate intercultural web-based communication strategies. Our study identifies the impacts of Chinese cultural and socio-political values on web content and the mismatch between such values and the information needs of globally distributed prospective students. We conclude that universities’ web content strategies should fully understand target audiences’ needs. Designers benefit from doing stakeholder interviews and competitor analysis to provide relevant, accurate, and accessible information to users from different cultures.
Virtual emotional gestures to assist in the examination of the mental health of the deaf‐mutes

Abstract The particular characteristics of deaf‐mutes make them more likely to have mental health problems. Due to their particular way of communication, it is more difficult for them to deal with mental health problems than ordinary people. Nowadays, those psychologists who are good at sign language are in short supply, and remote assistance cannot achieve satisfactory results. Therefore, a library of virtual emotional gestures based on electroencephalogram (EEG) was established and a prototype system for mental health examination of deaf‐mutes was proposed, which help deaf‐mutes identify their psychological problems in time and assist medical staff to examine the psychological problems encountered by deaf‐mutes. In addition, the virtual library of emotional gestures is established with the assistance of the chief physician from a 3A hospital in Henan Province. More importantly, the later experiments demonstrate the applicability of this virtual system.
Methods for Fault Diagnosis in Mechanical Systems based on Deep Learning in the Absence or Class Imbalance of Fault Data

Deep learning-based fault diagnosis systems for prognostics and health management of mechanical systems is an active research topic. Notably, the absence and class imbalance of fault data (insufficient fault data compared to normal data) have been shown to cause many challenges in developing fault diagnosis systems for the manufacturing fields. Therefore, this paper presents case studies using deep learning algorithms in the absence or class imbalance of fault data. Auto-encoder-based anomaly detection method, which can be used when fault data is absent, was applied to diagnose faults in a robotic spot welding process. The anomaly detection threshold was set based on the reconstruction error of trained normal data and the confidence level of the distribution of normal data. The anomaly detection performance of the auto-encoder was verified using non-trained normal data and three sets of fault data through the threshold. As a case study for insufficient fault data, synthetic data was generated based on cGAN and applied to diagnose fault of bearing. Using the imbalanced dataset to generate synthetic fault data and to reduce the imbalance ratio, it was confirmed that the accuracy of the synthetic data generation-based 2DCNN fault diagnosis model was improved.
A motion-blurred restoration method for surface damage detection of wind turbine blades

In order to reduce expensive cost and downtimes, visual inspection method based on unmanned aerial vehicles has become a promising method for surface damage detection in wind turbine blades. Due to the fact that the linear velocity of points on the blade varies along its longitudinal dimension while the blade is in-operation, the captured blade image suffers degradation caused by motion-blur, and the degradation process of the image is nonlinear. To address this issue, an area-based deblurring method is firstly developed. The points on each divided region can be assumed to follow a uniform motion with the same linear velocity and blurring effect, which indicates that the nonlinear problem can be resolved by linear methods. Point spread function estimation is then conducted to each region to obtain the blur kernels, and image restoration of each region is carried out by using Wiener filter algorithm. Ultimately, image fusion is implemented to merge all the restored regions to realize blade image restoration. Experimental results and evaluation have demonstrated that the proposed area-based method can mitigate blurring effects of rotating blade images, thus further improve the detection accuracy for the on-line inspection.
An improved residue multiplier using Montgomery modular multiplication

Implementing cryptosystems using the residue number system (RNS) requires many balanced equally-wide residue channels. The generic residue multiplier has a significant impact on the residue balance. Improving the residue multiplier delay affects the RNS efficiency. The Montgomery reduction is used for the residue generation in the auto-scale multiplier method, where its operations are merged to reduce residue generation delay. The synthesis result shows the proposed work delay has improved by 36%, 41%, and 29% for three channel widths of 16, 32, and 64-bit compared to the previous relevant work. Moreover, the area consumption has reduced by about 40%.
Exploring Factors Influencing School Life Satisfaction for Middle and High School Students’ Using Random Forests

본 연구는 중학교 1학년과 고등학교 1학년 학생이 인식한 학교생활만족도의 영향요인을 탐색하고자 수행되었다. 이를 위해 경기도교육연구원의 경기교육종단연구(Gyeonggi Education Panel Study, GEPS) 4차년도 중학교 1학년 자료와 7차년도 고등학교 1학년 자료를 활용하였으며, 기계학습 기법의 일종인 랜덤포레스트(random forests) 방법을 적용하였다. 분석에 활용된 설명변수는 중학생 312개, 고등학생 322개이다. 랜덤포레스트를 적용하여 학교생활만족도에 영향을 미치는 주요 요인을 상위 20위 내에 포함된 변인들을 기준으로 정리하였으며, 분석 결과는 다음과 같다. 첫째, 중･고등학생 1학년의 학교생활만족도에 영향을 미치는 공통 요인은 학생자치, 교사-학생관계, 교사 사기･열의, 학습동기로 밝혀졌으며, 이는 다수의 선행연구와 유사한 결과를 보였다. 둘째, 중학생 1학년의 학교생활 만족도에 영향을 미치는 고유 요인으로 학습자중심수업, 교사의 수업능력, 교우관계가 도출되었다. 셋째, 고등학생 1학년의 학교생활만족도에 영향을 미친 고유 요인으로 국어효능감이 포함되었다. 이러한 연구 결과를 토대로 중･고등학생의 학교생활만족도와 주요 설명변수와의 관계를 학교급별로 설명하고 연구 결과에 비추어 논의점을 제시하였다.This study aimed to explore the factors influencing school life satisfaction among first-year middle school and first-year high school students. To this end, The 4th and 7th year survey of ‘Gyeonggi Education Panel Study (GEPS)’ were used, and the random forests method, a type of machine learning technique, was applied. The explanatory variables used in the analysis were 312 items in middle school students and 322 items in high school students. By applying random forests, the major factors affecting school life satisfaction were summarized based on the variables included in the top 20, and the analysis results are as follows. First, student autonomy is a common major factor that affects school life satisfaction of first graders in middle and high school. It was found to be teacher-student relationship, teacher morale and enthusiasm, and learning motivation, which showed similar results to many previous studies. Second, learner-centered instruction, teachers’ teaching ability, and peer relationship were derived as unique factors affecting school life satisfaction of first graders in middle school. Third, Korean language efficacy was included as a unique factor that influenced school life satisfaction of first graders in high school. Based on these results, the relationship between school life satisfaction and major explanatory variables of middle and high school students was explained by school level, and discussions were presented according to the results of the study.
A Meta-Analysis of Teacher-Child Relationships and Child Development

본 연구는 교사-유아 관계와 유아발달이 어떠한 관계가 있는가를 메타분석을 통해 체계적으로 정리하는 데 목적이 있다. 이를 위해 본 연구에서는 2013년부터 2022년까지 국내의 학위, 학술논문들을 검토하여 학위논문 36편, 학술논문 57편 총 93편의 논문을 분석 대상으로 하였다. 교사-유아의 관계와 유아발달에 관한 메타분석 결과 친밀관계와 유아발달의 전체 효과크기는 높게 나타났다(ES=.443). 조절변인에 따라서 친밀관계와 유아발달의 효과크기를 살펴본 결과 남아의 효과크기가 가장 높게 나타났다. 교사 평정의 효과크기는 유아 평정의 효과크기보다 높게 나타났으며, Pianta(1991) 척도의 효과크기가 가장 높았다. 교사-유아 갈등관계와 유아발달의 전체 효과크기는 중간 효과크기가 나타났다(ES=-.379). 교사 평정의 효과크기는 유아 평정의 효과크기보다 부적으로 높게 나타났으며, 천향숙(2012) 척도의 효과크기가 부적으로 가장 높았다. 교사-유아의 의존관계와 유아발달의 전체 효과크기는 낮게 나타났지만(ES=-.131), 조절변인에 따른 차이는 유의하지 않았다. 본 연구는 교사-유아의 친밀, 갈등, 의존관계와 유아발달에 관한 전체 효과크기와 더불어 조절변인에 따른 효과크기는 어떠한지 전체적으로 살펴보았다는 데 의의가 있다.The study is to synthesize the studies of teacher-child relationships and child development through meta-analysis. Research papers included unpublished master’s theses, doctoral dissertations, and journals total of 93 from 2013 to 2022 (36 unpublished master’s theses, doctoral dissertations, and 57 journals). The effect size of the intimacy teacher-child relationship and child development was large (ES=.443). The effect size of boys was more significant than other groups. The effect size of the teacher rater was more significant than that of the infant rater, and Pianta's scale (1991) showed the highest effect size. The effect size of conflict in teacher-child relationships and child development showed medium (ES=-.379). The effect size of the teacher rater was negatively larger than that of the infant rater. The effect size of Cheon's scale (2012) showed a negatively significant effect size. The effect size of dependence in teacher-child relationships and child development was small (ES=-.131), but the effect sizes depending on the moderating variables were not significant. This study is meaningful because it examined the effect size of the relationship between intimacy, conflict, dependence in teacher-child relationships, and child development and how the effect sizes change depending on the moderating variables.
Efficient Interactive Coding Achieving Optimal Error Resilience over the Binary Channel

Given a noiseless protocol π0 computing a function f(x, y) of Alice and Bob’s private inputs x, y, the goal of interactive coding is to construct an error-resilient protocol π computing f such that even if some fraction of the communication is adversarially corrupted, both parties still learn f(x, y). Ideally, the resulting scheme π should be positive rate, computationally efficient, and achieve optimal error resilience.
A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity

A remarkable recent paper by Rubinfeld and Vasilyan (2022) initiated the study of testable learning, where the goal is to replace hard-to-verify distributional assumptions (such as Gaussianity) with efficiently testable ones and to require that the learner succeed whenever the unknown distribution passes the corresponding test. In this model, they gave an efficient algorithm for learning halfspaces under testable assumptions that are provably satisfied by Gaussians.
Quantum Free Games

The complexity of free games with two or more classical players was essentially settled by Aaronson, Impagliazzo, and Moshkovitz (CCC’14). In the quantum world, there are two complexity classes that can be considered quantum analogues of classical free games: (1) AM*, the multiprover interactive proof class corresponding to free games with entangled players, and, somewhat less obviously, (2) BellQMA(2), the class of quantum Merlin-Arthur proof systems with two unentangled Merlins, whose proof states are separately measured by Arthur. In this work, we make significant progress towards a tight characterization of both of these classes. (1) We show a BellQMA(2) protocol for 3SAT on n variables, where the total amount of communication is Õ(√n). This answers an open question of Chen and Drucker (2010) and also shows, conditional on ETH, that the algorithm of Brandão, Christandl and Yard (STOC’11) for optimizing over separable states is tight up to logarithmic factors. (2) We show that AM* with nprovers = 2, question length O(1), and answer-length log(n) is equal to RE, i.e. that free entangled games with constant-sized questions are as powerful as general entangled games. (In contrast, Aaronson, Impagliazzo and Moshkovitz show that classical free games are much weaker than general classical games.) We show this using a question “hyper-compression” theorem that iteratively applies the introspection technique of Ji et al. (2020). Our result is a significant improvement over the headline result of Ji et al., whose MIP* protocol for the halting problem has (n)-sized questions and answers. (3) By the same techniques, we obtain a zero-gap AM* protocol for a Π2 complete language with constant-size questions and almost logarithmically (O(logn · log* n)) large answers, improving on the headline result of Mousavi, Nezhadi and Yuen (STOC’22). (4) Using a connection to the nonuniform complexity of the halting problem we show that any MIP* protocol for RE requires Ω(logn) bits of communication. It follows that our results in item 3 are optimal up to an O(log* n) factor, and that the gapless compression theorems of Mousavi, Nezhadi and Yuen are asymptotically optimal. We conjecture that these bounds can be saturated in the gapped case as well.
Multidimensional Quantum Walks

While the quantum query complexity of k-distinctness is known to be O(n3/4 − 1/4(2k−1)) for any constant k≥ 4 [Belovs, FOCS 2012], the best previous upper bound on the time complexity was O(n1−1/k). We give a new upper bound of O(n3/4 − 1/4(2k−1)) on the time complexity, matching the query complexity up to polylogarithmic factors. In order to achieve this upper bound, we give a new technique for designing quantum walk search algorithms, which is an extension of the electric network framework. We also show how to solve the welded trees problem in O(n) queries and O(n2) time using this new technique, showing that the new quantum walk framework can achieve exponential speedups.
Faster Isomorphism for 𝑝-Groups of Class 2 and Exponent 𝑝

The group isomorphism problem determines whether two groups, given by their Cayley tables, are isomorphic. For groups with order n, an algorithm with n(logn + O(1)) running time, attributed to Tarjan, was proposed in the 1970s (Miller, STOC 1978). Despite the extensive study over the past decades, the current best group isomorphism algorithm has an n(1 / 4 + o(1))logn running time (Rosenbaum 2013).
Weighted Edit Distance Computation: Strings, Trees, and Dyck

Given two strings of length n over alphabet Σ, and an upper bound k on their edit distance, the algorithm of Myers (Algorithmica’86) and Landau and Vishkin (JCSS’88) from almost forty years back computes the unweighted string edit distance in O(n+k2) time. To date, it remains the fastest algorithm for exact edit distance computation, and it is optimal under the Strong Exponential Hypothesis (Backurs and Indyk; STOC’15). Over the years, this result has inspired many developments, including fast approximation algorithms for string edit distance as well as similar Õ(n+poly(k))-time algorithms for generalizations to tree and Dyck edit distances. Surprisingly, all these results hold only for unweighted instances.