Background
Bile duct injury (BDI) is a rare complication associated with cholecystectomy, and recommendations for treatment are based on publications from referral centers with a selection of major ...injuries and failures after primary repair. The aim was to analyze the frequency, treatment, and outcome of BDIs in an unselected population-based cohort.
Methods
This was a retrospective cohort study including all BDIs registered in GallRiks (Swedish quality register for gallstone surgery and ERCP) during 2007–2011. Data for this study were based on a national follow-up survey where medical records were scrutinized and BDIs classified according to the Hannover classification.
Results
A total of 174 BDIs arising from 55,134 cholecystectomies (0.3 %) identified at 60 hospitals were included with a median follow-up of 37 months (9–69). 155 BDIs (89 %) were detected during cholecystectomy, and immediate repair was attempted in 140 (90 %). A total of 27 patients (18 %) were referred to a HPB referral center. Hannover Grade C1 (i.e., small lesion <5 mm) dominated (
n
= 102; 59 %). The most common repair was “suture over T-tube” (
n
= 78; 45 %) and reconstruction with hepaticojejunostomy was performed in 30 patients (17 %). A total of 31 patients (18 %) were diagnosed with stricture, 19 of which were primarily repaired with “suture over T-tube.” The median in-hospital-stay was 14 days (1–149).
Conclusions
The majority of BDIs were detected during the cholecystectomy and repaired by the operating surgeon. Although this is against most current recommendations, short-term outcome was surprisingly good.
Objective
Investigate associations between pre‐pregnancy participation and performance in a demanding cross‐country ski race (proxy for exercise volume and fitness) and perinatal outcomes. ...Pre‐registered protocol: osf.io/aywg2.
Design
Prospective cohort study.
Setting
Based on entire overlap between the Vasaloppet registry and the population‐based Swedish Pregnancy Register.
Sample
All female Vasaloppet participants 1991–2017 with subsequent singleton delivery (skiers), and age‐ and county‐matched non‐skiers.
Methods
We calculated odds ratios (ORs) for non‐skiers versus skiers (model 1) and, among skiers, by performance (model 2), in Bayesian logistic regressions adjusted for socio‐demographics, lifestyle factors, and comorbidities. We repeated calculations adjusting for early pregnancy body mass index (potential mediator) and explored robustness (selection/exposure settings; multiple comparisons correction).
Main outcome measures
Twenty‐nine important perinatal outcomes, predefined based on existing expert consensus.
Results
Non‐skiers (n = 194 384) versus skiers (n = 15 377) (and slower versus faster performance, not shown) consistently had higher odds of gestational diabetes mellitus (GDM) (OR 1.70, 95% highest density interval: 1.40–2.09), excessive gestational weight gain (GWG) (1.28, 1.22–1.38), psychiatric morbidity (1.60, 1.49–1.72), any caesarean section (CS) (1.34, 1.28–1.40), elective CS (1.39, 1.29–1.49), and large‐for‐gestational‐age babies (>90th percentile, 1.11, 1.04–1.18); lower odds of inadequate GWG (0.83, 0.79–0.88); and no associations with fetal/neonatal complications (e.g. preterm birth 1.09, 0.98–1.20, small for gestational age SGA 1.23, 1.05–1.45). Adjustment for body mass index attenuated associations with excessive (1.20, 1.14–1.30) and inadequate GWG (0.87, 0.83–0.92) and large for gestational age (1.07, 1.00–1.13).
Conclusion
Non‐skiers compared with skiers, and slower versus faster performance, consistently displayed higher odds of GDM, excessive GWG, psychiatric morbidity, CS and large‐for‐gestational‐age babies; and lower odds of inadequate GWG, after adjustment for socio‐demographic and lifestyle factors and comorbidities. There were no associations with fetal/neonatal complications.
Physical unclonable functions (PUFs) have been adopted in many resource-constrained IoT (Internet of Things) applications to provide effective and lightweight solutions for device authentication. ...However, an attacker can collect challenge-response pairs (CRPs) of a strong PUF, to build a machine learning (ML) model and mimic its behavior, i.e., predicting the responses of unseen challenges with high accuracy. Although several PUFs have been proposed to resist such modeling attacks, they incur high hardware overhead. Developing a PUF primitive with low hardware cost and high resistance to ML attacks is thus a crucial task. In this paper, we propose the first response feedback-based lightweight anti-machine learning-attack PUF, namely FLAM-PUF. It is only composed of one arbiter PUF (APUF) and one Galois linear feedback shift register (LFSR), with some basic logic gates, reducing more than 62% hardware cost compared with the state-of-the-art robust strong PUFs. Specifically, FLAM-PUF leverages a cost-effective feedback loop structure to dynamically control and update the LFSR configuration. FLAM-PUF has two main characteristics: (i) it feeds back a one-bit response in every cycle to intentionally poison the data of the CRP set for training. To resist ML-based modeling attacks, the one-bit response can randomly update one coefficient of the feedback polynomial to implant more complex correlations into the model built by attackers; (ii) it takes advantage of an n-bit response feedback-controlled reconfigurable Galois LFSR to enlarge the original challenge space of the APUF. Extensive experimental results show that the proposed FLAM-PUF achieves near-optimal uniformity, uniqueness, and reliability. Our scheme works well under standard attack models with public crucial initial information. In particular, the prediction accuracy of modeling attacks against FLAM-PUF is nearly 50% under the four widely-used machine learning algorithms, i.e., support vector machines (SVM), logistic regression (LR), covariance matrix adaptation evolution strategy (CMA-ES), and deep neural networks (DNN), indicating excellent resistance against these machine learning attacks.
Singers use a whistle register to sing at a fundamental frequency above 1000 Hz. In previous studies, vocal fold vibrations with or without complete closure and partial vocal fold vibrations were ...observed depending on the subject. However, the production mechanism of the whistle register is not yet clearly understood because of the limitations of the imaging device for the glottis and subjects.
This study aims to examine vocal fold vibrations in a whistle register.
The dynamic behavior of the glottis was recorded for six singers (four females and two males) using a high-speed digital imaging device with a frame rate above 10,000 fps. Audio signals were recorded simultaneously. The data were analyzed in the form of topography, glottal area waveforms, spectrograms, and phonovibrography to examine spatiotemporal patterns of glottal motion.
The vibratory motion of the vocal folds was classified into six patterns. The first pattern was the entire vocal fold vibration with complete closure during the closed phase. The second to fifth was the entire vocal fold vibration without complete closure, where a gap was observed for the full length of the vocal folds for the second, at the posterior part of the glottis for the third, at the anterior for the fourth, and at both ends for the fifth. In the sixth pattern, the vocal folds vibrated partially. Our results support the previous findings on the vibration of the vocal folds. In addition, we identified novel vibratory patterns in the vocal folds.
We conclude that the production of the whistle register is not just an extension of the falsetto register to the higher fundamental-frequency region; rather, the production mechanism of the whistle register appeared to be diverse as a means of vocalization.
Most previous linguistic investigations of the web have focused on special linguistic features associated with Internet language (e.g., the use of emoticons, abbreviations, contractions, and ...acronyms) and the “new” Internet registers that are especially salient to observers (e.g., blogs, Internet forums, instant messages, tweets). Multi-Dimensional (MD) analysis has also been used to analyze Internet registers, focusing on core grammatical features (e.g., nouns, verbs, prepositional phrases). MD research differs theoretically and methodologically from most other research approaches in linguistics in that it is built on the notion of linguistic co-occurrence, with the claim that register differences are best described in terms of sets of co-occurring linguistic features that have a functional underpinning. At the same time, though, most previous MD studies are similar to other previous research in their focus on new Internet registers, such as blogs, Facebook/Twitter posts, and email messages. These are the registers that we immediately think of in association with the Internet, and thus it makes sense that they should be the focus of most previous research. However, that emphasis means that we know surprisingly little at present about the full range of registers found on the web and the patterns of linguistic variation among those registers. This is the goal of the present study. Rather than beginning with a focus on new registers that are assumed to be interesting, we analyze a representative sample of the entire searchable web. End-users coded the situational and communicative characteristics of each document in our corpus, leading to a much wider range of register categories than that used in any previous linguistic study: eight general categories; several hybrid register categories; and twenty-seven specific register categories. This approach thus leads to a much more inclusive and diverse sample of web registers than that found in any previous study of English Internet language. The goal of the present study is to document the patterns of linguistic variation among those registers. Using MD analysis, we explore the dimensions of linguistic variation on the searchable web, and the similarities and differences among web registers with respect to those dimensions.
This is the first population-level study to examine inequalities in COVID-19 mortality according to working-age individuals' occupations and the indirect occupational effects on COVID-19 mortality of ...older individuals who live with them.
We used early-release data for the entire population of Sweden of all recorded COVID-19 deaths from 12 March 2020 to 23 February 2021, which we linked to administrative registers and occupational measures. Cox proportional hazard models assessed relative risks of COVID-19 mortality for the working-aged population registered in an occupation in December 2018 and the older population who lived with them.
Among working aged-adults, taxi/bus drivers had the highest relative risk of COVID-19 mortality: over four times that of skilled workers in IT, economics, or administration when adjusted only for basic demographic characteristics. After adjusting for socioeconomic factors (education, income and country of birth), there are no occupational groups with clearly elevated (statistically significant) COVID-19 mortality. Neither a measure of exposure within occupations nor the share that generally can work from home were related to working-aged adults' risk of COVID-19 mortality. Instead of occupational factors, traditional socioeconomic risk factors best explained variation in COVID-19 mortality. Elderly individuals, however, faced higher COVID-19 mortality risk both when living with a delivery or postal worker or worker(s) in occupations that generally work from home less, even when their socioeconomic factors are taken into account.
Inequalities in COVID-19 mortality of working-aged adults were mostly based on traditional risk factors and not on occupational divisions or characteristics in Sweden. However, older individuals living with those who likely cannot work from home or work in delivery or postal services were a vulnerable group.
Register automaton (RA), register context-free grammar (RCFG) and register tree automaton (RTA) are computational models with registers which deal with data values. This paper shows pumping lemmas ...for the classes of languages expressed by RA, RCFG and RTA. Among them, the first lemma was already proved in terms of nominal automata, which is an abstraction of RA. We define RTA in a deterministic and bottom-up manner. For these languages, the notion of ‘pumped word’ must be relaxed in such a way that a pumped subword is not always the same as the original subword, but is any word equivalent to the original subword in terms of data type defined in this paper. By using the lemmas, we give examples of languages that do not belong to the above-mentioned classes of languages.
Register context-free grammars (RCFG), register pushdown automata (RPDA) and register tree automata (RTA) are extensions of their classical counterparts to handle data values in a restricted way. ...These extended models are paid attention as models of query languages for structured documents such as XML with data values. This paper investigates the computational complexity of the basic decision problems for the models. We show that the membership and emptiness problems for RCFG are EXPTIME-complete and also show the membership problem becomes PSPACE-complete and NP-complete for ε-rule free RCFG and growing RCFG, respectively while the emptiness problem remains EXPTIME-complete for these subclasses. The complexities of these problems for RPDA and RTA as well as their language expressive powers are also investigated.
This article presents a 12-bit 1.5-GS/s single-channel pipelined successive approximation register (SAR) analog-to-digital converter (ADC). The ADC leverages a pipelined residue amplification (RA) ...stage scheme, early quantization technique, and fast differential ring amplifier (ringamp) to achieve high speed and high power efficiency simultaneously. The pipelined RA stage scheme allows the RA and SAR conversion to run in parallel for a fast pipelining operation and a relaxed residue amplifier's bandwidth requirement, thus alleviating the speed bottleneck of the pipelined SAR ADCs. The early quantization technique reduces the timing budget of the SAR conversion phase, thereby further improving the ADC speed. The differential ringamp with a short settling time and low common-mode gain guarantees the high accuracy and high speed of the critical RA. Furthermore, a flexible digital-to-analog-converter (DAC) topology combining the scaling capacitor and bridge capacitor is employed to align the quantization range avoiding large overheads. The prototype ADC was fabricated in a 28-nm CMOS process and consumes 21.3 mW at 1.5 GS/s. The signal-to-noise-and-distortion-ratio (SNDR) and spurious-free dynamic range (SFDR) are 58.5 and 74.5 dB with a Nyquist input, respectively, achieving a Walden figure-of-merit (FoM) of 20.7 fJ/conversion step and a Schreier FoM of 164 dB.
PDF
