Search

Guangyi Xu,1 Ting Liu,1 Yunxia Jiang,1 Yanhong Xu,2 Taohua Zheng,2 Xiaona Li3 1Author affiliations School of Nursing, Qingdao University, Shandong, People’s Republic of China; 2Author affiliations Department of Gastroenterology, The Affiliated Hospital of Qingdao University, Shandong, People’s Republic of China; 3Author Affiliations Endoscopic Diagnosis and Treatment Center, Qilu Hospital, Cheeloo College of Medicine, Shandong University, Qingdao, People’s Republic of ChinaCorrespondence: Ting Liu, School of Nursing, Qingdao University, 1 Ningde Road, Qingdao, Shandong, 266073, People’s Republic of China, Tel +86 15066237573, Email liuting201516@163.comPurpose: To identify the distinct profiles of psychosocial adaptation of Chinese inflammatory bowel disease (IBD) patients and the predictive factors.Patients and Methods: A cross-sectional survey method was used to recruit 263 IBD patients who were treated in a tertiary hospital in Shandong Province from July 2022 to April 2023. The general information questionnaire, Inflammatory Bowel Disease Psychosocial Adaptation Questionnaire, Resilience Scale for Inflammatory Bowel Disease, Chinese Benefit Finding Scale, and Stigma Scale for Chronic Illnesses, Medical Coping Modes Questionnaire and Inflammatory Bowel Disease-Disk were used as the instruments for investigation. Latent profile analysis was conducted with the six dimensions of the IBD Psychosocial Adaptation Questionnaire as the explicit indicators. The predictors of profile membership were analyzed by multinomial logistic regressions.Results: Four profiles of psychosocial adaptation in IBD patients were identified: Low level psychosocial adaptation (14.1%), Medium level psychosocial adaptation – High body image distress (25.5%), Medium level psychosocial adaptation – Low body image distress (30.0%) and High level psychosocial adaptation (30.4%). Compared with Low level psychosocial adaptation group, High level psychosocial adaptation group had a highe

The rapid development of open-source large language models (LLMs) has been truly remarkable. However, the scaling law described in previous literature presents varying conclusions, which casts a dark cloud over scaling LLMs. We delve into the study of scaling laws and present our distinctive findings that facilitate scaling of large scale models in two commonly used open-source configurations, 7B and 67B. Guided by the scaling laws, we introduce DeepSeek LLM, a project dedicated to advancing open-source language models with a long-term perspective. To support the pre-training phase, we have developed a dataset that currently consists of 2 trillion tokens and is continuously expanding. We further conduct supervised fine-tuning (SFT) and Direct Preference Optimization (DPO) on DeepSeek LLM Base models, resulting in the creation of DeepSeek Chat models. Our evaluation results demonstrate that DeepSeek LLM 67B surpasses LLaMA-2 70B on various benchmarks, particularly in the domains of code, mathematics, and reasoning. Furthermore, open-ended evaluations reveal that DeepSeek LLM 67B Chat exhibits superior performance compared to GPT-3.5.

We present DeepSeek-V2, a strong Mixture-of-Experts (MoE) language model characterized by economical training and efficient inference. It comprises 236B total parameters, of which 21B are activated for each token, and supports a context length of 128K tokens. DeepSeek-V2 adopts innovative architectures including Multi-head Latent Attention (MLA) and DeepSeekMoE. MLA guarantees efficient inference through significantly compressing the Key-Value (KV) cache into a latent vector, while DeepSeekMoE enables training strong models at an economical cost through sparse computation. Compared with DeepSeek 67B, DeepSeek-V2 achieves significantly stronger performance, and meanwhile saves 42.5% of training costs, reduces the KV cache by 93.3%, and boosts the maximum generation throughput to 5.76 times. We pretrain DeepSeek-V2 on a high-quality and multi-source corpus consisting of 8.1T tokens, and further perform Supervised Fine-Tuning (SFT) and Reinforcement Learning (RL) to fully unlock its potential. Evaluation results show that, even with only 21B activated parameters, DeepSeek-V2 and its chat versions still achieve top-tier performance among open-source models.

Yanhong Xu,1 Ting Liu,1 Yunxia Jiang,1 Xianzhi Zhao,2 Fei Meng,1 Guangyi Xu,1 Mengjiao Zhao1 1School of Nursing, Qingdao University, Qingdao, People’s Republic of China; 2Department of Gastroenterology, The Affiliated Hospital of Qingdao University, Qingdao, People’s Republic of ChinaCorrespondence: Ting Liu, School of Nursing, Qingdao University, 1 Ningde Road, Qingdao, Shandong, 266073, People’s Republic of China, Tel +86 15066237573, Email liuting201516@163.comPurpose: Patients with inflammatory bowel disease (IBD) suffer from physical symptoms and psychosocial issues. This generates risks of psychosocial maladjustment that is closely linked with self-care ability and health-related quality of life. The study aimed to explore psychosocial adaptation of IBD patients in China and the influencing factors from individual and family levels.Patients and Methods: Using a cross-sectional design, 191 Chinese patients with IBD were recruited from October 2020 to September 2021. General information questionnaire, general family functioning scale, resilience scale for IBD, and psychosocial adaptation questionnaire for IBD were used for investigation. Multivariate linear regression was used to identify predictive factors of psychosocial adaptation.Results: IBD patients reported a moderate level of psychosocial adaptation. Regression analysis showed that personal resilience especially the three dimensions (i.e., positive illness perception, disease management, and support from fellow IBD patients), general family functioning, and disease conditions (i.e., extra-intestinal manifestations and current disease status) were the main contributing factors of psychosocial adaptation, explaining 49.3% of the total variance.Conclusion: The findings suggest that healthcare providers could focus on improving patients’ illness perception about IBD and strengthening their disease management abilities, together with optimizing patients’ family functioning to enhance their psychosoc

Policy-based signatures (PBS) were proposed by Bellare and Fuchsbauer (PKC 2014) to allow an {\em authorized} member of an organization to sign a message on behalf of the organization. The user's authorization is determined by a policy managed by the organization's trusted authority, while the signature preserves the privacy of the organization's policy. Signing keys in PBS do not include user identity information and thus can be passed to others, violating the intention of employing PBS to restrict users' signing capability. In this paper, we introduce the notion of {\em traceability} for PBS by including user identity in the signing key such that the trusted authority will be able to open a suspicious signature and recover the signer's identity should the needs arise. We provide rigorous definitions and stringent security notions of traceable PBS (TPBS), capturing the properties of PBS suggested by Bellare-Fuchsbauer and resembling the "full traceability" requirement for group signatures put forward by Bellare-Micciancio-Warinschi (Eurocrypt 2003). As a proof of concept, we provide a modular construction of TPBS, based on a signature scheme, an encryption scheme and a zero-knowledge proof system. Furthermore, to demonstrate the feasibility of achieving TPBS from concrete, quantum-resistant assumptions, we give an instantiation based on lattices., Comment: 37 pages,5 figures

Lina Ma,1,* Yanhong Xu,1,2,* Yaxin Zhang,1 Tong Ji,1 Yun Li1 1Department of Geriatrics, Xuanwu Hospital, Capital Medical University, National Clinical Research Center for Geriatric Diseases, Beijing 100053, People’s Republic of China; 2Department of Geriatrics, Miyun Teaching Hospital of Capital Medical University, Beijing 101500, People’s Republic of China*These authors contributed equally to this workCorrespondence: Lina MaDepartment of Geriatrics, Xuanwu Hospital, Capital Medical University, National Clinical Research Center for Geriatric Diseases, #45 Changchun Street, Xicheng District, Beijing 100053, People’s Republic of ChinaEmail malina0883@126.comBackground: Metabolic inflammation plays an important role in the pathogenesis of atherosclerosis, type 2 diabetes, non-alcoholic fatty liver disease, and obesity. The above metabolic disorders often coexist and are closely related with systemic low-grade inflammation. Metabolic inflammatory syndrome (MIS), a cluster of these four metabolic disorders, is a novel concept that is thought to be a better predictor of coronary heart disease than metabolic syndrome. Adiponectin is an adipokine that increases insulin sensitivity and antioxidation as well as has an anti-atherosclerosis effect. It is unclear whether adiponectin is associated with MIS. The objective of this study was to assess whether circulating adiponectin can be used as an indicator for MIS in elderly adults.Methods: A total of 136 elderly inpatients were divided into two groups: the MIS group and the non-MIS group. Characteristics, inflammatory markers, blood lipid metabolism, insulin resistance, and circulating adiponectin levels were assessed and compared between the two groups. Logistic regression analysis was used to explore the association between the associated factors and MIS.Results: MIS patients were more likely to have a higher body mass index, have a higher fasting blood glucose level, be smokers, have fundus arte

Group signatures allow users of a group to sign messages anonymously in the name of the group, while incorporating a tracing mechanism to revoke anonymity and identify the signer of any message. Since its introduction by Chaum and van Heyst (EUROCRYPT 1991), numerous proposals have been put forward, yielding various improvements on security, efficiency and functionality. However, a drawback of traditional group signatures is that the opening authority is given too much power, i.e., he can indiscriminately revoke anonymity and there is no mechanism to keep him accountable. To overcome this problem, Kohlweiss and Miers (PoPET 2015) introduced the notion of accountable tracing signatures (ATS) - an enhanced group signature variant in which the opening authority is kept accountable for his actions. Kohlweiss and Miers demonstrated a generic construction of ATS and put forward a concrete instantiation based on number-theoretic assumptions. To the best of our knowledge, no other ATS scheme has been known, and the problem of instantiating ATS under post-quantum assumptions, e.g., lattices, remains open to date. In this work, we provide the first lattice-based accountable tracing signature scheme. The scheme satisfies the security requirements suggested by Kohlweiss and Miers, assuming the hardness of the Ring Short Integer Solution (RSIS) and the Ring Learning With Errors (RLWE) problems. At the heart of our construction are a lattice-based key-oblivious encryption scheme and a zero-knowledge argument system allowing to prove that a given ciphertext is a valid RLWE encryption under some hidden yet certified key. These technical building blocks may be of independent interest, e.g., they can be useful for the design of other lattice-based privacy-preserving protocols., Comment: CT-RSA 2019

In this work, we provide the first lattice-based group signature that offers full dynamicity (i.e., users have the flexibility in joining and leaving the group), and thus, resolve a prominent open problem posed by previous works. Moreover, we achieve this non-trivial feat in a relatively simple manner. Starting with Libert et al.'s fully static construction (Eurocrypt 2016) - which is arguably the most efficient lattice-based group signature to date, we introduce simple-but-insightful tweaks that allow to upgrade it directly into the fully dynamic setting. More startlingly, our scheme even produces slightly shorter signatures than the former, thanks to an adaptation of a technique proposed by Ling et al. (PKC 2013), allowing to prove inequalities in zero-knowledge. Our design approach consists of upgrading Libert et al.'s static construction (EUROCRYPT 2016) - which is arguably the most efficient lattice-based group signature to date - into the fully dynamic setting. Somewhat surprisingly, our scheme produces slightly shorter signatures than the former, thanks to a new technique for proving inequality in zero-knowledge without relying on any inequality check. The scheme satisfies the strong security requirements of Bootle et al.'s model (ACNS 2016), under the Short Integer Solution (SIS) and the Learning With Errors (LWE) assumptions. Furthermore, we demonstrate how to equip the obtained group signature scheme with the deniability functionality in a simple way. This attractive functionality, put forward by Ishida et al. (CANS 2016), enables the tracing authority to provide an evidence that a given user is not the owner of a signature in question. In the process, we design a zero-knowledge protocol for proving that a given LWE ciphertext does not decrypt to a particular message.

Group signature is a fundamental cryptographic primitive, aiming to protect anonymity and ensure accountability of users. It allows group members to anonymously sign messages on behalf of the whole group, while incorporating a tracing mechanism to identify the signer of any suspected signature. Most of the existing group signature schemes, however, do not guarantee security once secret keys are exposed. To reduce potential damages caused by key exposure attacks, Song (ACMCCS 2001) put forward the concept of forward-secure group signature (FSGS), which prevents attackers from forging group signatures pertaining to past time periods even if a secret group signing key is revealed at the current time period. For the time being, however, all known secure FSGS schemes are based on number-theoretic assumptions, and are vulnerable against quantum computers. In this work, we construct the first lattice-based FSGS scheme. Our scheme is proven secure under the Short Integer Solution and Learning With Errors assumptions. At the heart of our construction is a scalable lattice-based key evolving mechanism, allowing users to periodically update their secret keys and to efficiently prove in zero-knowledge that key evolution process is done correctly. To realize this essential building block, we first employ the Bonsai tree structure by Cash et al. (EUROCRYPT 2010) to handle the key evolution process, and then develop Langlois et al.'s construction (PKC 2014) to design its supporting zero-knowledge protocol.