DNATyper^(TM)21与Verifiler^(TM)Plus试剂盒对常规案件检材检验的比较

本文通过比较DNATyper^(TM)21与Verifi ler^(TM)Plus两种STR检测试剂盒对各类案件检材的检验能力,探讨DNATyper^(TM)21试剂盒在常规案件检验中应用的可靠性。取0.03125、0.0625、0.125、0.25、0.5、1.0 ng/μL基因组标准品对两种试剂盒进行灵敏度测试;应用DNATyper^(TM)21与Verifi ler^(TM)Plus试剂盒分别对1056例常规案件检材DNA进行检验;对同一样本等位基因进行一致性比较。结果表明,两种试剂盒均可以成功检测出模板浓度在0.0625 ng/μL以上的标准DNA。在检验的1056例样本中,DNATyper^(TM)21试剂盒共检出881例,检出率为83.4%;Verifi ler^(TM)Plus试剂盒检出892例,检出率为84.5%。统计学结果表明两种试剂盒检出率无统计学差异,且同一样本相同基因座得到的等位基因分型一致。综上,DNATyper^(TM)21试剂盒对各类常规检材具有良好的检验能力,可应用于日常案件检验。

Establishment and validation of a predictive model for peripherally inserted central catheter-related thrombosis in patients with liver cancer

BACKGROUND Peripherally inserted central catheters(PICCs)are commonly used in hospitalized patients with liver cancer for the administration of chemotherapy,nutrition,and other medications.However,PICC-related thrombosis is a serious complication that can lead to morbidity and mortality in this patient population.Several risk factors have been identified for the development of PICC-related thrombosis,including cancer type,stage,comorbidities,and catheter characteristics.Understanding these risk factors and developing a predictive model can help healthcare providers identify high-risk patients and implement preventive measures to reduce the incidence of thrombosis.AIM To analyze the influencing factors of PICC-related thrombosis in hospitalized patients with liver cancer,construct a predictive model,and validate it.METHODS Clinical data of hospitalized patients with liver cancer admitted from January 2020 to December 2023 were collected.Thirty-five cases of PICC-related thrombosis in hospitalized patients with liver cancer were collected,and 220 patients who underwent PICC placement during the same period but did not develop PICC-related thrombosis were randomly selected as controls.A total of 255 samples were collected and used as the training set,and 77 cases were collected as the validation set in a 7:3 ratio.General patient information,case data,catheterization data,coagulation indicators,and Autar Thrombosis Risk Assessment Scale scores were analyzed.Univariate and multivariate unconditional logistic regression analyses were performed on relevant factors,and the value of combined indicators in predicting PICC-related thrombosis in hospitalized patients with liver cancer was evaluated using receiver operating characteristic(ROC)curve analysis.RESULTS Univariate analysis showed statistically significant differences(P<0.05)in age,sex,Karnofsky performance status score(KPS),bedridden time,activities of daily living impairment,parenteral nutrition,catheter duration,distant metastasis,and bone marrow suppression between the thrombosis group and the non-thrombosis group.Other aspects had no statistically significant differences(P>0.05).Multivariate regression analysis showed that age≥60 years,KPS score≤50 points,parenteral nutrition,stage III to IV,distant metastasis,bone marrow suppression,and activities of daily living impairment were independent risk factors for PICC-related thrombosis in hospitalized patients with liver cancer(P<0.05).Catheter duration of 1-6 months and catheter duration>6 months were protective factors for PICC-related thrombosis(P<0.05).The predictive model for PICC-related thrombosis was obtained as follows:P predictive probability=[exp(Logit P)]/[1+exp(Logit P)],where Logit P=age×1.907+KPS score×2.045+parenteral nutrition×9.467+catheter duration×0.506+tumor-node-metastasis(TNM)staging×2.844+distant metastasis×2.065+bone marrow suppression×2.082+activities of daily living impairment×13.926.ROC curve analysis showed an area under the curve(AUC)of 0.827(95%CI:0.724-0.929,P<0.001),with a corresponding optimal cut-off value of 0.612,sensitivity of 0.755,and specificity of 0.857.Calibration curve analysis showed good consistency between the predicted occurrence of PICC-related thrombosis and actual occurrence(P>0.05).ROC analysis showed AUCs of 0.888 and 0.729 for the training and validation sets,respectively.CONCLUSION Age,KPS score,parenteral nutrition,TNM staging,distant metastasis,bone marrow suppression,and activities of daily living impairment are independent risk factors for PICC-related thrombosis in hospitalized patients with liver cancer,while catheter duration is a protective factor for the disease.The predictive model has an AUC of 0.827,indicating high predictive accuracy and clinical value.

A Composite Ansatz for Calculation of Dynamical Structure Factor

We propose an ansatz without adjustable parameters for the calculation of a dynamical structure factor.The ansatz combines the quasi-particle Green’s function,especially the contribution from the renormalization factor,and the exchange-correlation kernel from time-dependent density functional theory together,verified for typical metals and semiconductors from a plasmon excitation regime to the Compton scattering regime.It has the capability to reconcile both small-angle and large-angle inelastic x-ray scattering(IXS)signals with muchimproved accuracy,which can be used as the theoretical base model,in inversely inferring electronic structures of condensed matter from IXS experimental signals directly.It may also be used to diagnose thermal parameters,such as temperature and density,of dense plasmas in x-ray Thomson scattering experiments.

P_(c)(4457)Interpreted as a J^(P)=1/2+State byD^(0)∧_(c)^(+)(2595)-π^(0)P_(c)(4312)Interaction

P_(c)(4457)has been discovered over five years,but the parity of this particle remains undetermined.We propose a new interpretation for P_(c)(4457),which is the state generated from the coupled-channel D^(0)Ac+(2595)andπ^(0)P_(c)(4312)since they can exchange an almost on-shell∑_(c)^(+).In this scenario,the parity of P_(c)(4457)will be positive,which is different from the candidate of the bound state of D*∑_(c).The main decay channel of P_(c)(4457)in this model is Pc(4312)π.We propose three processes∧_(b)^(0)→J/ψKapπ^(-),∧_(b)^(0)→J/ψK-pπ^(0),and∧_(b)^(0)→J/ψpπ^(-)π^(+)k^(-)to verify Pc(4457)→Pc(4312)π.

A verifiable essential secret image sharing scheme based on HLRs(VESIS-(t,s,k,n))

In traditional secret image sharing schemes,a secret image is shared among shareholders who have the same position.But if the shareholders have two different positions,essential and non‐essential,it is necessary to use essential secret image sharing schemes.In this article,a verifiable essential secret image sharing scheme based on HLRs is proposed.Shareholder's share consists of two parts.The first part is produced by the shareholders,which prevents the fraud of dealers.The second part is a shadow image that is produced by using HLRs and the first part of share.The verification of the first part of the shares is done for the first time by using multilinear and bilinear maps.Also,for verifying shadow images,Bloom Filters are used for the first time.The proposed scheme is more efficient than similar schemes,and for the first part of the shares,has formal security.

VPFL:A verifiable privacy-preserving federated learning scheme for edge computing systems

Federated learning for edge computing is a promising solution in the data booming era,which leverages the computation ability of each edge device to train local models and only shares the model gradients to the central server.However,the frequently transmitted local gradients could also leak the participants’private data.To protect the privacy of local training data,lots of cryptographic-based Privacy-Preserving Federated Learning(PPFL)schemes have been proposed.However,due to the constrained resource nature of mobile devices and complex cryptographic operations,traditional PPFL schemes fail to provide efficient data confidentiality and lightweight integrity verification simultaneously.To tackle this problem,we propose a Verifiable Privacypreserving Federated Learning scheme(VPFL)for edge computing systems to prevent local gradients from leaking over the transmission stage.Firstly,we combine the Distributed Selective Stochastic Gradient Descent(DSSGD)method with Paillier homomorphic cryptosystem to achieve the distributed encryption functionality,so as to reduce the computation cost of the complex cryptosystem.Secondly,we further present an online/offline signature method to realize the lightweight gradients integrity verification,where the offline part can be securely outsourced to the edge server.Comprehensive security analysis demonstrates the proposed VPFL can achieve data confidentiality,authentication,and integrity.At last,we evaluate both communication overhead and computation cost of the proposed VPFL scheme,the experimental results have shown VPFL has low computation costs and communication overheads while maintaining high training accuracy.

Novel traveling quantum anonymous voting scheme via GHZ states

Based on traveling ballot mode,we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger(GHZ)states.In this scheme,each legal voter performs unitary operation on corresponding position of particle sequence to encode his/her voting content.The voters have multiple ballot items to choose rather than just binary options“yes”or“no”.After counting votes phase,any participant who is interested in voting results can obtain the voting results.To improve the efficiency of the traveling quantum anonymous voting scheme,an optimization method based on grouping strategy is also presented.Compared with the most existing traveling quantum voting schemes,the proposed scheme is more practical because of its privacy,verifiability and non-repeatability.Furthermore,the security analysis shows that the proposed traveling quantum anonymous voting scheme can prevent various attacks and ensure high security.

MaMADS1-MaNAC083 transcriptional regulatory cascade regulates ethylene biosynthesis during banana fruit ripening

The hormone ethylene is crucial in the regulation of ripening in climacteric fruit,such as bananas.The transcriptional regulation of ethylene biosynthesis throughout banana fruit ripening has received much study,but the cascaded transcriptional machinery of upstream transcriptional regulators implicated in the ethylene biosynthesis pathway is still poorly understood.Here we report that ethylene biosynthesis genes,including MaACS1,MaACO1,MaACO4,MaACO5,and MaACO8,were upregulated in ripening bananas.NAC(NAM,ATAF,CUC)transcription factor,MaNAC083,a ripening and ethylene-inhibited gene,was discovered as a potential binding protein to the MaACS1 promoter by yeast one-hybrid screening.Further in vitro and in vivo experiments indicated that MaNAC083 bound directly to promoters of the five ethylene biosynthesis genes,thereby transcriptionally repressing their expression,which was further verified by transient overexpression experiments,where ethylene production was inhibited through MaNAC083-modulated transcriptional repression of ethylene biosynthesis genes in banana fruits.Strikingly,MaMADS1,a ripening-induced MADS(MCM1,AGAMOUS,DEFICIENS,SRF4)transcription factor,was found to directly repress the expression of MaNAC083,inhibiting trans-repression of MaNAC083 to ethylene biosynthesis genes,thereby attenuating MaNAC083-repressed ethylene production in bananas.These findings collectively illustrated the mechanistic basis of a MaMADS1-MaNAC083-MaACS1/MaACOs regulatory cascade controlling ethylene biosynthesis during banana fruit ripening.These findings increase our knowledge of the transcriptional regulatory mechanisms of ethylene biosynthesis at the transcriptional level and are expected to help develop molecular approaches to control ripening and improve fruit storability.

Blind quantum computation with a client performing different single-qubit gates

In the field of single-server blind quantum computation(BQC), a major focus is to make the client as classical as possible. To achieve this goal, we propose two single-server BQC protocols to achieve verifiable universal quantum computation. In these two protocols, the client only needs to perform either the gate T(in the first protocol) or the gates H and X(in the second protocol). With assistance from a single server, the client can utilize his quantum capabilities to generate some single-qubit states while keeping the actual state of these qubits confidential from others. By using these single-qubit states, the verifiable universal quantum computation can be achieved.

A leap by the rise of solid-state electrolytes for Li-air batteries

Li-air batteries have attracted extensive attention because of their ultrahigh theoretical energy density. However, the potential safety hazard of flammable organic liquid electrolytes hinders their practical applications. Replacing liquid electrolytes with solidstate electrolytes(SSEs) is expected to fundamentally overcome the safety issues. In this work, we focus on the development and challenge of solid-state Li-air batteries(SSLABs). The rise of different types of SSEs, interfacial compatibility and verifiability in SSLABs are presented. The corresponding strategies and prospects of SSLABs are also proposed. In particular, combining machine learning method with experiment and in situ(or operando)techniques is imperative to accelerate the development of SSLABs.

A New Technique for Attention Management and Somatosensory Processing in Hypnotherapy: Mental Access/Somatosensory Access (MASSA)

The author introduces a new hypnotherapeutic technique termed “Mental Access/Somatosensory Access” (MASSA). MASSA is designed to utilize an external somatosensory stimulus in the context of hypnotherapy, based on a Bottom-Up/Top-Down Paradigm, which complements and mutually reinforces hypnotic inductions by using imbedded suggestions. The intervention’s algorithm includes a combination of real-time stimulation through one of the following somatosensory modalities: sensorimotor activation of the palms, visual, auditory, vibration, thermal, olfaction or oropharyngeal. These modalities are accompanied by guided hypnotic dissociation and suggestions. Somatosensory stimulation amplifies patients’ engagement in the procedure, focusing their attention on a stimulus and on the hypnotic experience during the intervention. A stream of closed questions with imbedded suggestions, presented by the therapist, is designed using suggestive presuppositions, termed by the author “The Create and Verify Principle” (CVP). This principle facilitates effective pacing and helps transform patients’ sensory and mental experiences. Imbedded suggestions followed by real-time stimulation, maintain a focus on the somatosensory content, boost the hypnotic experience, and gradually combine awareness of the somatosensory stimulation experience (Bottom-Up regulation) with memory, imagination, emotions and meanings, for mental access of resources and adaptive coping (Top-Down regulation). In the first part of this article, the author briefly introduces the neurophysiological mechanism behind the suggestive, somatosensory, attention-management intervention and provides an example of a basic algorithm of the MASSA technique. The second part includes clinical samples with scripts of successfully treated patients, who experienced tension headache, psychogenic balance disorder, tinnitus. .

Improved key exchange protocol for three-party based on verifier authentication

To prevent server compromise attack and password guessing attacks,an improved and efficient verifier-based key exchange protocol for three-party is proposed,which enables two clients to agree on a common session key with the help of the server.In this protocol,the client stores a plaintext version of the password,while the server stores a verifier for the password.And the protocol uses verifiers to authenticate between clients and the server.The security analysis and performance comparison of the proposed protocol shows that the protocol can resist many familiar attacks including password guessing attacks,server compromise attacks,man-in-the-middle attacks and Denning-Sacco attacks,and it is more efficient.

Distributed Secure Storage Scheme Based on Sharding Blockchain

Distributed storage can store data in multiple devices or servers to improve data security.However,in today’s explosive growth of network data,traditional distributed storage scheme is faced with some severe challenges such as insufficient performance,data tampering,and data lose.A distributed storage scheme based on blockchain has been proposed to improve security and efficiency of traditional distributed storage.Under this scheme,the following improvements have been made in this paper.This paper first analyzes the problems faced by distributed storage.Then proposed to build a new distributed storage blockchain scheme with sharding blockchain.The proposed scheme realizes the partitioning of the network and nodes by means of blockchain sharding technology,which can improve the efficiency of data verification between nodes.In addition,this paper uses polynomial commitment to construct a new verifiable secret share scheme called PolyVSS.This new scheme is one of the foundations for building our improved distributed storage blockchain scheme.Compared with the previous scheme,our new scheme does not require a trusted third party and has some new features such as homomorphic and batch opening.The security of VSS can be further improved.Experimental comparisons show that the proposed scheme significantly reduces storage and communication costs.

A New Rational Secret Sharing Scheme

In this paper,we propose a new approach for rational secret sharing in game theoretic settings.The trusted center is eliminated in the secret reconstruction phase.Every player doesn’t know current round is real round or fake round.The gain of following the protocol is more than the gain of deviating,so rational player has an incentive to abide the protocol.Finally,every player can obtain the secret fairly.Our scheme is verifiable and any player’s cheating can not work.Furthermore the proposed scheme is immune to backward induction and satisfies resilient equilibrium.No player of the coalition C can do better,even if the whole coalition C cheats.Our scheme can withstand the conspiracy attack with at most m-1 players.

浅析人脸识别解锁系统的现状与展望

作为人工智能中人脸识别的技术之一,人脸识别是对人的面部特征与信息进行采集,对显示的面部影像,首先检测在拍摄镜头中是否有人脸,若检测到人脸,则进一步的给出脸的位置、形状和各个面部器官的坐标、形状等信息。处理器提取信息后,将其与已知的面部特征进行对比,从而识别用户的身份。它包括人脸检测、人脸跟踪、人脸对比三项主要内容。而人脸识别解锁系统就是基于人脸识别技术的基础上,通过识别人脸来对户与设备中存储的人脸信息进行比对进而判断该用户是否能够进入系统的技术。用户通过电子设备的摄像头拍摄自己的面部影像,使设备预先记录下了本人的面部信息。然后再通过摄像头对采集的影像进行比对进而开放设备。如果登录用户的脸与"预先设定的身份认证信息"比对结果成功,那么用户就可进入并使用设备。

Verifiable Secret Redistribution for Proactive Secret Sharing Schemes

A new scheme to verifiably redistribute a secret from the old to new shareholders without reconstruction of the secret is presented in this paper. The scheme allows redistribution between different access structures and between different threshold schemes. A point worth mentioning is that this verifiable secret redistribution (VSR) scheme can identify dishonest old shareholders during redistribution without any assumption. A certain technique is adopted to verify the correctness of the old shares of the secret. As a result, the scheme is very efficient. It can be applied to proactive secret sharing (PSS) schemes to construct more flexible and practical proactive secret sharing schemes.

Verifiable Diversity Ranking Search Over Encrypted Outsourced Data

Data outsourcing has become an important application of cloud computing.Driven by the growing security demands of data outsourcing applications,sensitive data have to be encrypted before outsourcing.Therefore,how to properly encrypt data in a way that the encrypted and remotely stored data can still be queried has become a challenging issue.Searchable encryption scheme is proposed to allow users to search over encrypted data.However,most searchable encryption schemes do not consider search result diversification,resulting in information redundancy.In this paper,a verifiable diversity ranking search scheme over encrypted outsourced data is proposed while preserving privacy in cloud computing,which also supports search results verification.The goal is that the ranked documents concerning diversification instead of reading relevant documents that only deliver redundant information.Extensive experiments on real-world dataset validate our analysis and show that our proposed solution is effective for the diversification of documents and verification.

An Identity-Based Strong Designated Verifier Proxy Signature Scheme

In a strong designated verifier proxy signature scheme, a proxy signer can generate proxy signature on behalf of an original signer, but only the designated verifier can verify the validity of the proxy signature. In this paper, we first define the security requirements for strong designated verifier proxy signature schemes. And then we construct an identity-based strong designated verifier proxy signature scheme. We argue that the proposed scheme satisfies all of the security requirements.

Verifiable Identity-Based Encryption with Keyword Search for IoT from Lattice

Internet of Things(IoT),which provides the solution of connecting things and devices,has increasingly developed as vital tools to realize intelligent life.Generally,source-limited IoT sensors outsource their data to the cloud,which arises the concerns that the transmission of IoT data is happening without appropriate consideration of the profound security challenges involved.Though encryption technology can guarantee the confidentiality of private data,it hinders the usability of data.Searchable encryption(SE)has been proposed to achieve secure data sharing and searching.However,most of existing SE schemes are designed under conventional hardness assumptions and may be vulnerable to the adversary with quantum computers.Moreover,the untrusted cloud server may perform an unfaithful search execution.To address these problems,in this paper,we propose the first verifiable identity-based keyword search(VIBKS)scheme from lattice.In particular,a lattice-based delegation algorithm is adopted to help the data user to verify both the correctness and the integrity of the search results.Besides,in order to reduce the communication overhead,we refer to the identity-based mechanism.We conduct rigorous proof to demonstrate that the proposed VIBKS scheme is ciphertext indistinguishable secure against the semi-honestbut-curious adversary.In addition,we give the detailed computation and communication complexity of our VIBKS and conduct a series of experiments to validate its efficiency performance.

Verifiably Encrypted Signatures Without Random Oracles

Verifiably encrypted signatures are employed when a signer wants to sign a message for a verifier but does not want the verifier to possess his signature on the message until some certain requirements of his are satisfied. This paper presented new verifiably encrypted signatures from bilinear pairings. The proposed signatures share the properties of simplicity and efficiency with existing verifiably encrypted signature schemes. To support the proposed scheme, it also exhibited security proofs that do not use random oracle assumption. For existential unforgeability, there exist tight security reductions from the proposed verifiably encrypted signature scheme to a strong but reasonable computational assumption.