Miracle-dz/UniFAR-FTUs huggingface dataset:
Information-seeking Behavior During Residency Is Associated With Quality of Theoretical Learning, Academic Career Achievements, and Evidence-based Medical Practice

AbstractData regarding knowledge acquisition during residency training are sparse. Predictors of theoretical learning quality, academic career achievements and evidence-based medical practice during residency are unknown. We performed a cross-sectional study on residents and attending physicians across several residency programs in 2 French faculties of medicine. We comprehensively evaluated the information-seeking behavior (I-SB) during residency using a standardized questionnaire and looked for independent predictors of theoretical learning quality, academic career achievements, and evidence-based medical practice among I-SB components using multivariate logistic regression analysis. Between February 2013 and May 2013, 338 fellows and attending physicians were included in the study. Textbooks and international medical journals were reported to be used on a regular basis by 24% and 57% of the respondents, respectively. Among the respondents, 47% refer systematically (4.4%) or frequently (42.6%) to published guidelines from scientific societies upon their publication. The median self-reported theoretical learning quality score was 5/10 (interquartile range, 3–6; range, 1–10). A high theoretical learning quality score (upper quartile) was independently and strongly associated with the following I-SB components: systematic reading of clinical guidelines upon their publication (odds ratio [OR], 5.55; 95% confidence interval [CI], 1.77–17.44); having access to a library that offers the leading textbooks of the specialty in the medical department (OR, 2.45, 95% CI, 1.33–4.52); knowledge of the specialty leading textbooks (OR, 2.12; 95% CI, 1.09–4.10); and PubMed search skill score ≥5/10 (OR, 1.94; 95% CI, 1.01–3.73). Research Master (M2) and/or PhD thesis enrolment were independently and strongly associated with the following predictors: PubMed search skill score ≥5/10 (OR, 4.10; 95% CI, 1.46–11.53); knowledge of the leading medical journals of the specialty (OR, 3.33; 95% CI, 1.32–8.38); attending national and international academic conferences and meetings (OR, 2.43; 95% CI, 1.09–5.43); and using academic theoretical learning supports several times a week (OR, 2.23; 95% CI, 1.11– 4.49). This study showed weaknesses in the theoretical learning framework during residency. I-SB was independently associated with quality of academic theoretical learning, academic career achievements, and the use of evidence-based medicine in everyday clinical practice. Study registration: CNIL No.1797639.
Probabilistic security-constrained optimal power flow including the controllability of HVDC lines

In this paper we propose a security-constrained optimal power flow (SC-OPF) algorithm which incorporates the stochastic infeed of renewable sources, such as wind, as well as the controllability of HVDC lines. We extend our earlier work on SC-OPF problem and incorporate corrective control actions emanating form the controllability of the AGC lines. This is achieved by appropriately adjusting the HVDC setpoint after a component outage. The overall problem is formulated as chance constrained optimization program. We solve it using a scenario based methodology, which offers a-priori guarantees regarding the probability of constraint satisfaction. Moreover, we exploit recent developments in sampling based optimization allowing us to identify more optimal solutions in term of cost. To demonstrate the efficiency of our approach and the improvement in terms of cost due to the controllability offered by the HVDC lines, we apply to an IEEE benchmark network.
Empowering Data Placement for Ad-hoc Queries in Mobile Broadcast Environments

Data broadcast with its scalability feature provides a strong backbone for the digital information delivery. Such a feature is especially significant for mobile users with inherent power limitations in asymmetric communication environments. This paper presents a specific broadcast ordering scheme supported by advanced structure and access mechanism for ad-hoc queries in mobile data broadcast environments. The proposed scheme aims to minimize both query-access and tuning times by specifying a new message and ordering structure. As a proof of concept, we carry out experimentation of the proposed scheme in comparison with the conventional models. The result of the experiments are presented and discussed in the paper.
Protective Factors Against Intergenerational Conflict in Chinese Immigrant Families: A Pilot Study

vii CHAPTER ONE: INTRODUCTION . 1 CHAPTER TWO: REVIEW OF THE LITERATURE . 6 Conceptualizations of Acculturation. 6 Acculturation Gap and Intergenerational Conflicts in Chinese Immigrant F amilies . 9 Parent Attachment . 11 Social Support . 14 Parent-Child Communication in Cultural Differences . 16 CHAPTER THREE: METHODS . 20 Participants . 20 Procedure . 20 Measures . 22 Demographic Questionnaire . 22 Asian American Family Conflicts Scale . 23 Acculturation Rating Scale for Mexican Americans . 23 Acculturation Gap . 24 Parent Attachment Subscale . 27 Acquiring Social Support Subscale . 27 Parent-Child Communication on Cultural Differences Scale . 28 CHAPTER FOUR: RESULTS . 29 Acculturation Gap and Family Conflict . 31 Test of Moderation Effect . 31 CHAPTER FIVE: DISCUSSION . 33 Major Findings . 34 Limitations and Future Directions . 35 Counseling Implications . 37 APPENDIX A: PARENTAL CONSENT FORM . 40 APPENDIX B: ADOLESCENT ASSENT FORM . 44 APPENDIX C: DEMOGRAPHIC QUESTIONNAIRE . 47
Cosmology with the cluster mass function: mass estimators and shape systematics in large weak lensing surveys

Accurate measurement of the cluster mass function is a crucial element in efforts to constrain structure formation models, the normalization of the matter power spectrum and the cosmological matter density, and the nature and evolution of dark energy. Large weak lensing surveys of ∼20 000 galaxy clusters and groups will be key tools in the observational pursuit of that goal; first-generation surveys such as those using the Sloan Digital Sky Survey (SDSS) are already beginning to calibrate previous measurements of the mass function from X-ray observations and to extend existing constraints down to galaxy group scales. These weak lensing studies proceeded by stacking the lensing signals of many clusters and groups binned by mass-correlated observables such as richness and luminosity; typically such analyses ignore the triaxial structure of dark matter haloes on the assumption that the averaging of many shear signals within each mass bin makes its effects (as large as factors of two in mass model parameter estimates from individual clusters) negligible. We test this assumption utilizing a population of 15 000 analytic triaxial dark matter haloes spanning 2 dex in mass, and find that triaxiality can bias 3D virial mass estimates compared to those for a spherical population by a few per cent if suboptimal mass estimators are used. This bias affects not only direct lensing constraints on the mass function but can also affect the scatter and normalization of the mass-observable relations derived from lensing that are so crucial to constraining the cluster mass function with large samples. However, we demonstrate that a careful choice of mass estimator can remove the bias very effectively if the lensing signals from a sufficient number of triaxial haloes are averaged together, and further quantify that sufficient number for adequate shape averaging. We thus show that by choosing observable bins to contain an adequate number of haloes and by utilizing a carefully chosen 3D mass estimator stacked weak-lensing analyses can give unbiased constraints on the triaxial mass function.
Decryptable Public Key Encryption with Keyword Search Schemes

A public key encryption with keyword search (PEKS) scheme does not allow the user to decrypt the encrypted keyword or decrypt the encrypted massage. This "no-decryption" property also limits the applicability of a PEKS scheme. Fuhr and Paillier also left an open problem on how to come up with a decryptable PEKS which security does not rely on random oracles. In this paper, we first enhance the security model of searchable encryption with decryption scheme (PEKSD) by allowing the test query, and present an efficient PEKSD scheme in the enhanced model without random oracle. And then, we extend our scheme to obtain PEKSD with independent decryption key and trapdoor derivation key. Finally, we also modify our scheme to achieve a PKE/PEKS scheme in which it allows to retrieve both the PEKS keyword and the message. To the best of our knowledge, this is the first PEKS scheme that allows to retrieve both the PEKS keyword and the message.
kPeer as a Context-Aware Topic Map P2P Application for the Distributed Integration of Knowledge

First ideas on how context may be employed within the kPeer (Knowledge Peers) project are discussed. kPeer aims at the virtual and distributed (P2P) integration and organization of assertions about subjects originating from a multiplicity of independent sources with heterogeneous metadata of varying quality. The subsequent provision and exchange of new, aggregated and context-adapted digital knowledge products and services based on Semantic Knowledge Networks has applications in Distributed Knowledge Management (DKM) and dynamic Value Webs. Knowledge goods suitable for users in comparable usage contexts expressed as OWL-bound RDF statements or ontology-constrained Topic Map Fragments will be offered via orchestrated W3C Web Services. Contexts as patterns for ”sense making” can aid in overcoming various information barriers, improve semantic interoperability and contribute towards the Subject Location Uniqueness Objective (SLUO). An adequate information architecture should use Published Subjects for context elements and respect principles of ontology engineering. 1 Relevance to the Workshop This paper is connected to the workshops’ topics of interest as follows: 1. In the kPeer system, contexts (potential interests in related resources about comparable subjects) are expressed and retrieved as Topic Map constructs. 2. Situations of known similar usage contexts are exploited by design to provide additional resources about subjects relevant to the situation at hand. In this sense, context and situation match. 3. It is intended to extend kPeer to a more context-aware application. 1 submitted to the KI 2004 Workshop on Modeling and Retrieval of Context (MRC2004), 20. -24. September 2004, University of Ulm (Germany), http://www.mrc2004. de.ms/. Updated version of 2004-05-03.
TruffleC: dynamic execution of C on a Java virtual machine

This paper presents TruffleC, a C interpreter that allows the dynamic execution of C code on top of a Java Virtual Machine (JVM). Rather than producing a static build of a C application, TruffleC is a self-optimizing abstract syntax tree (AST) interpreter combined with a just-in-time (JIT) compiler. Our self-optimizing interpreter specializes the AST based on run-time feedback. AST specialization relies on optimistic assumptions and allows us to build inline caches for polymorphic function pointer calls, to profile runtime values and to potentially replace them with constants, or to speculatively remove code that was not executed yet. After AST specialization, the JIT compiler translates the AST to highly optimized machine code. The machine code uses dynamic deoptimization points at which the control switches back to the interpreter in case of a violated assumption. We evaluated TruffleC using a C micro-benchmark in terms of peak performance. This evaluation showed that TruffleC outperforms the code produced by industry standard compilers such as GCC or Clang/LLVM. The evaluation of other benchmarks ("Computer Language Benchmarks Game") showed that the TruffleC performance is on average only 7% slower than the best performance out of the GCC and Clang/LLVM performances.
Standard Austrian German

The development of Standard Austrian German (SAG; de-AT) is closely linked to the development of Standard German German (SGG; de-DE) as spoken in Northern Germany. Traditionally, SAG is strongly geared towards SGG norms. The orientation towards SGG norms goes back to at least 1750, when Maria Theresia ordered the adoption of the Upper Saxonian norms in place at that time (Ebner 1969, Wiesinger 1989). Since then, SAG pronunciation is modelled on SGG and Austrian newsreaders are instructed according to the norms of Duden's (2005) Aussprachewörterbuch and Siebs (1958, with an addendum for Austria) (Wächter-Kollpacher 1995, Soukup & Moosmüller 2011). This procedure leads to an inconsistent usage of SGG features in Austrian broadcasting media (Wiesinger 2009, Soukup & Moosmüller 2011, Hildenbrandt & Moosmüller 2015). Therefore, from a methodological point of view, pronunciation used in the Austrian broadcasting media is unsuitable for defining SAG (Moosmüller 2015).
The Impact of Network Topology on the Spread of Anti-Virus Countermeasures

Are there properties of networks that affect the spread of anti-virus countermeasures? Is countermeasure spreading more effective through one network than through another? In this paper, we investigate this problem by simulating the impact of network topology on the effectiveness of anti-virus countermeasures. We simulate the spread of countermeasures based on the idea that computer viruses and countermeasures spread through two separate complex networks -the virus-spreading network and the countermeasure-spreading network. This problem can be though of having countermeasures act as competing species against computer viruses. We find that certain properties of networks determine if countermeasures can spread faster than computer viruses and influence the size of the virus infection. Contact: Li-Chiou Chen Dept. of Engineering and Public Policy Carnegie Mellon University Pittsburgh, PA 15213 Tel: 1-412-268-5550 Fax: 1-412-268-6938 Email: lichiou@andrew.cmu. edu
Address allocation scheme of wireless sensor networks based on IPv6

The Wireless Sensor Network (WSN) is one of the core technologies to form the future networks. A WSN is typically composed of numerous tiny energy-constrained sensor nodes with limited information processing and data storage capabilities, thus, the energy-efficient strategy is the key issue in designing protocols for WSN. All IPv6-based addressing is suitable for the seamless integration between WSN and IPv6. However, the length of IPv6 address is too long for WSN, and the energy cost becomes a key problem in the use of all IPv6-based addressing. We propose an improved self-organized addressing scheme with simplified IPv6 address format which is designed for intra-WSN communication, and the corresponding address allocation, stateless autoconfiguration, redirection method are presented. This scheme realizes dynamic addressing, and stateless address autoconfiguration. The simulation result demonstrates that the scheme reaches the expected effect of saving energy and prolonging the lifespan of the sensor networks.
An Examination of a Temporal Anisotropy in the Visual Integration of Spatial Frequencies

Three pairs of experiments were conducted to investigate the importance of spatial-frequency-processing delays imposed by the visual system on the efficacy of their subsequent integration. In the first pair of experiments filtered versions of a natural image were found to be easily discriminable from the full-bandwidth image. These images were then placed into triplets and presented sequentially. Subjects were required to detect the presence of a full-bandwidth target image within the sequence. As with previous results a low-to-high progression of spatial-frequency information did increase the number of errors of full-bandwidth-image detection within the triplets where it was not present. However, this was not found across all conditions and was suggested to be due to the increased discriminability of the constituent images which form the image triplets. The second experiment was a repetition of the first with more confusable component images. Again the weak order effect on target detection was found. It was suggested that this may be due to the nature of the stimulus used. The third pair of experiments repeated the design of the first pair of experiments but with Gabor patches which provide localised spatial-frequency information. It was found that a low-to-high progression of spatial frequencies resulted in more false detections of the target. The results are interpreted as supporting an integration mechanism which operates with greater efficacy when the presentation of spatial-frequency information mirrors that naturally imposed by the neural delays involved in the processing of spatial frequencies.
Plasma-Derived Exosomal Survivin, a Plausible Biomarker for Early Detection of Prostate Cancer

Background Survivin is expressed in prostate cancer (PCa), and its downregulation sensitizes PCa cells to chemotherapeutic agents in vitro and in vivo. Small membrane-bound vesicles called exosomes, secreted from the endosomal membrane compartment, contain RNA and protein that they readily transport via exosome internalization into recipient cells. Recent progress has shown that tumor-derived exosomes play multiple roles in tumor growth and metastasis and may produce these functions via immune escape, tumor invasion and angiogenesis. Furthermore, exosome analysis may provide novel biomarkers to diagnose or monitor PCa treatment. Methods Exosomes were purified from the plasma and serum from 39 PCa patients, 20 BPH patients, 8 prostate cancer recurrent and 16 healthy controls using ultracentrifugation and their quantities and qualities were quantified and visualized from both the plasma and the purified exosomes using ELISA and Western blotting, respectively. Results Survivin was significantly increased in the tumor-derived samples, compared to those from BPH and controls with virtually no difference in the quantity of Survivin detected in exosomes collected from newly diagnosed patients exhibiting low (six) or high (nine) Gleason scores. Exosome Survivin levels were also higher in patients that had relapsed on chemotherapy compared to controls. Conclusions These studies demonstrate that Survivin exists in plasma exosomes from both normal, BPH and PCa subjects. The relative amounts of exosomal Survivin in PCa plasma was significantly higher than in those with pre-inflammatory BPH and control plasma. This differential expression of exosomal Survivin was seen with both newly diagnosed and advanced PCa subjects with high or low-grade cancers. Analysis of plasma exosomal Survivin levels may offer a convenient tool for diagnosing or monitoring PCa and may, as it is elevated in low as well as high Gleason scored samples, be used for early detection.
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines

Scheduling a sequence of jobs released over time when the processing time of a job is only known at its completion is a classical problem in CPU scheduling in time sharing operating systems. A widely used measure for the responsiveness of the system is the average flow time of the jobs, i.e. the average time spent by jobs in the system between release and completion. The Windows NT and the Unix operating system scheduling policies are based on the Multi-level Feedback algorithm [12, 1]. In this paper we prove that a randomized version of the Multi-level Feedback algorithm is competitive for single and parallel machine systems, in our opinion providing one theoretical validation of the goodness of an idea that has been very effective in practice along the last two decades. The randomized Multi-level Feedback algorithm (RMLF) was first proposed by Kalyanasundaram and Pruhs [7] for a single machine achieving an O(\log n \log\log n) competitive ratio to minimize the average flow time against the on-line adaptive adversary, where n is the number of jobs that are released. We present a version of RMLF working for any numberm of parallel machines. We show for RMLF a first O(\log n\log \frac{n}{m}) competitiveness result against the oblivious adversary on parallel machines. We also show that the same RMLF algorithm surprisingly achieves a tight O(\log n) competitive ratio against the oblivious adversary on a single machine, therefore matching the lower bound of [10].
Line temperatures and elemental abundances in H ii galaxies

We present long-slit spectrophotometric observations in the red and near-infrared of 12 H II galaxies. The spectral range includes the sulphur lines [S II] at λλ6716,6731 and [S III] at λ6312 and λλ9069,9532. For all of the observed galaxies, at least three ion-weighted temperatures from forbidden auroral to nebular line ratios have been obtained and the relations between the different line temperatures have been discussed. It is found that, for some objects, the [O II] temperatures derived from those of [O III] through the use of photoionization models, without taking into account the effect of density, can lead to a significant underestimate of the O + /H + ionic abundance and hence of the total oxygen abundance. For all the observed objects, we have calculated the ionic abundances of O + , O 2 + , S + , S 2 + and N + and they have been used to constrain the ionization structure of the emitting regions with the help of photoionization models. From them, the ionization correction factors for N and S, and their corresponding total abundances, have been derived.
A Foundation for Verified Software Development Systems

We describe a formalization of the meta-mathematics of programming in a higher-order calculus as a means to create verifiably correct implementations of program synthesis tools. Formal definitions and lemmata are used to raise the level of abstraction in formal reasoning to one comprehensible for programmers. Formal metatheorems make explicit the semantic knowledge contained in program derivation methods and serve as kernel of derived inference rules implementing these methods. By an example formalization of a strategy deriving global search algorithms we demonstrate the advantages of combining formal mathematics with an interactive theorem proving environment to develop powerful, flexible, and reliable systems for knowledge-based software development.
Error Performance of Low-Priority Data in Advanced T-DMB System

Nowadays, the investigation of Korean T-DMB system is moving onto the next generation, which is called advanced T-DMB system. It can move up the data transmission rate by using hierarchical modulation. In the hierarchical constellation, each symbol is composed of high-priority (HP) symbol and low-priority (LP) symbol. The HP symbol is used for carrying the conventional data, whereas the LP symbol is used for carrying the additional data. In this paper, we presented how to implement the turbo code into the advanced T-DMB system, and introduced how to combine the turbo code with the Reed-Solomon code to improve the error performance of LP data in the advanced T-DMB system.
An Effective Approach for Home Services Management

Domotic systems aim to offer functionalities like energy management, security, conveniences, and much more. Many domotic networks exist to provide a subset of these applications, but these networks are not necessarily compatible due to different communication mediums or protocols. Literature presents different studies that introduce high-level systems that solve the lack of incompatibility, but it does not explore how to create a network behavior. This paper concentrates on studying how to model the unit behaviors of home devices and a global behavior of a network of these devices: the automated living area. The global behavior is set-up with rules and constraints. The behaviors are modeled with an extended automaton input-output symbolic transition systems. To finish this paper, a use case shows the interest of building global behavior with unit behaviors.