The shrink proofing on wool with treatment of protease named Argaenzyme STL was studied. The various pretreating auxiliaries, different parameters for protease treating process and the effect of stabilizer were discus...The shrink proofing on wool with treatment of protease named Argaenzyme STL was studied. The various pretreating auxiliaries, different parameters for protease treating process and the effect of stabilizer were discussed in detail. The varieties of some properties before and after protease treatment were also investigated.展开更多
Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells c...Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells could be generated from adult mouse fibroblasts is powerful proof that cell fate can be changed.An exciting extension of the discovery of cell fate impermanence is the direct cellular reprogram ming hypothesis-that terminally differentiated cells can be reprogrammed into other adult cell fates without first passing through a stem cell state.展开更多
There is an error in the name of the cell line in the abstract of the published paper“MicroRNA-502-3p regulates GABAergic synapse function in hippocampal neurons”published on pages 2698-2707,Issue 12,Volume 19 of Ne...There is an error in the name of the cell line in the abstract of the published paper“MicroRNA-502-3p regulates GABAergic synapse function in hippocampal neurons”published on pages 2698-2707,Issue 12,Volume 19 of Neural Regeneration Research(Sharma et al.,2024),because of oversight during final proof checking.The correct description should be“human-GABA receptor A-α1/β2/γ2L human embryonic kidney(HEK)recombinant cell line.”The authors apologize for any inconvenience this correction may cause for readers and editors of Neural Regeneration Research.展开更多
This paper introduces the Integrated Security Embedded Resilience Architecture (ISERA) as an advanced resilience mechanism for Industrial Control Systems (ICS) and Operational Technology (OT) environments. The ISERA f...This paper introduces the Integrated Security Embedded Resilience Architecture (ISERA) as an advanced resilience mechanism for Industrial Control Systems (ICS) and Operational Technology (OT) environments. The ISERA framework integrates security by design principles, micro-segmentation, and Island Mode Operation (IMO) to enhance cyber resilience and ensure continuous, secure operations. The methodology deploys a Forward-Thinking Architecture Strategy (FTAS) algorithm, which utilises an industrial Intrusion Detection System (IDS) implemented with Python’s Network Intrusion Detection System (NIDS) library. The FTAS algorithm successfully identified and responded to cyber-attacks, ensuring minimal system disruption. ISERA has been validated through comprehensive testing scenarios simulating Denial of Service (DoS) attacks and malware intrusions, at both the IT and OT layers where it successfully mitigates the impact of malicious activity. Results demonstrate ISERA’s efficacy in real-time threat detection, containment, and incident response, thus ensuring the integrity and reliability of critical infrastructure systems. ISERA’s decentralised approach contributes to global net zero goals by optimising resource use and minimising environmental impact. By adopting a decentralised control architecture and leveraging virtualisation, ISERA significantly enhances the cyber resilience and sustainability of critical infrastructure systems. This approach not only strengthens defences against evolving cyber threats but also optimises resource allocation, reducing the system’s carbon footprint. As a result, ISERA ensures the uninterrupted operation of essential services while contributing to broader net zero goals.展开更多
The security of information transmission and processing due to unknown vulnerabilities and backdoors in cyberspace is becoming increasingly problematic.However,there is a lack of effective theory to mathematically dem...The security of information transmission and processing due to unknown vulnerabilities and backdoors in cyberspace is becoming increasingly problematic.However,there is a lack of effective theory to mathematically demonstrate the security of information transmission and processing under nonrandom noise(or vulnerability backdoor attack)conditions in cyberspace.This paper first proposes a security model for cyberspace information transmission and processing channels based on error correction coding theory.First,we analyze the fault tolerance and non-randomness problem of Dynamic Heterogeneous Redundancy(DHR)structured information transmission and processing channel under the condition of non-random noise or attacks.Secondly,we use a mathematical statistical method to demonstrate that for non-random noise(or attacks)on discrete memory channels,there exists a DHR-structured channel and coding scheme that enables the average system error probability to be arbitrarily small.Finally,to construct suitable coding and heterogeneous channels,we take Turbo code as an example and simulate the effects of different heterogeneity,redundancy,output vector length,verdict algorithm and dynamism on the system,which is an important guidance for theory and engineering practice.展开更多
The rapid evolution of quantum computing poses significant threats to traditional cryptographic schemes,particularly in Decentralized Finance(DeFi)systems that rely on legacy mechanisms like RSA and ECDSA for digital ...The rapid evolution of quantum computing poses significant threats to traditional cryptographic schemes,particularly in Decentralized Finance(DeFi)systems that rely on legacy mechanisms like RSA and ECDSA for digital identity verification.This paper proposes a quantum-resilient,blockchain-based identity verification framework designed to address critical challenges in privacy preservation,scalability,and post-quantum security.The proposed model integrates Post-quantum Cryptography(PQC),specifically lattice-based cryptographic primitives,with Decentralized Identifiers(DIDs)and Zero-knowledge Proofs(ZKPs)to ensure verifiability,anonymity,and resistance to quantum attacks.A dual-layer architecture is introduced,comprising an identity layer for credential generation and validation,and an application layer for DeFi protocol integration.To evaluate its performance,the framework is tested on multiple real-world DeFi platforms using metrics such as verification latency,throughput,attack resistance,energy efficiency,and quantum attack simulation.The results demonstrate that the proposed framework achieves 90%latency reduction and over 35%throughput improvement compared to traditional blockchain identity solutions.It also exhibits a high quantum resistance score(95/100),with successful secure verification under simulated quantum adversaries.The revocation mechanism—implemented using Merkle-tree-based proofs—achieves average response times under 40 ms,and the system maintains secure operations with energy consumption below 9 J per authentication cycle.Additionally,the paper presents a security and cost tradeoff analysis using ZKP schemes such as Bulletproofs and STARKs,revealing superior bits-per-byte efficiency and reduced proof sizes.Real-world adoption scenarios,including integration with six major DeFi protocols,indicate a 25%increase in verified users and a 15%improvement in Total Value Locked(TVL).The proposed solution is projected to remain secure until 2041(basic version)and 2043(advanced version),ensuring long-term sustainability and future-proofing against evolving quantum threats.This work establishes a scalable,privacy-preserving identity model that aligns with emerging post-quantum security standards for decentralized ecosystems.展开更多
Traceability and trustiness are two critical issues in the logistics sector.Blockchain provides a potential way for logistics tracking systems due to its traits of tamper resistance.However,it is non-trivial to apply ...Traceability and trustiness are two critical issues in the logistics sector.Blockchain provides a potential way for logistics tracking systems due to its traits of tamper resistance.However,it is non-trivial to apply blockchain on logistics because of firstly,the binding relationship between virtue data and physical location cannot be guaranteed so that frauds may exist.Secondly,it is neither practical to upload complete data on the blockchain due to the limited storage resources nor convincing to trust the digest of the data.This paper proposes a traceable and trustable consortium blockchain for logistics T^(2)L to provide an efficient solution to the mentioned problems.Specifically,the authenticated geocoding data from telecom operators’base stations are adopted to ensure the location credibility of the data before being uploaded to the blockchain for the purpose of reliable traceability of the logistics.Moreover,we propose a scheme based on Zero Knowledge Proof of Retrievability(ZK BLS-PoR)to ensure the trustiness of the data digest and the proofs to the blockchain.Any user in the system can check the data completeness by verifying the proofs instead of downloading and examining the whole data based on the proposed ZK BLS-PoR scheme,which can provide solid theoretical verification.In all,the proposed T^(2)L framework is a traceable and trustable logistics system with a high level of security.展开更多
As the demand for cross-departmental data collaboration continues to grow,traditional encryption methods struggle to balance data privacy with computational efficiency.This paper proposes a cross-departmental privacy-...As the demand for cross-departmental data collaboration continues to grow,traditional encryption methods struggle to balance data privacy with computational efficiency.This paper proposes a cross-departmental privacy-preserving computation framework based on BFV homomorphic encryption,threshold decryption,and blockchain technology.The proposed scheme leverages homomorphic encryption to enable secure computations between sales,finance,and taxation departments,ensuring that sensitive data remains encrypted throughout the entire process.A threshold decryption mechanism is employed to prevent single-point data leakage,while blockchain and IPFS are integrated to ensure verifiability and tamper-proof storage of computation results.Experimental results demonstrate that with 5,000 sample data entries,the framework performs efficiently and is highly scalable in key stages such as sales encryption,cost calculation,and tax assessment,thereby validating its practical feasibility and security.展开更多
Published proof test coverage(PTC)estimates for emergency shutdown valves(ESDVs)show only moderate agreement and are predominantly opinion-based.A Failure Modes,Effects,and Diagnostics Analysis(FMEDA)was undertaken us...Published proof test coverage(PTC)estimates for emergency shutdown valves(ESDVs)show only moderate agreement and are predominantly opinion-based.A Failure Modes,Effects,and Diagnostics Analysis(FMEDA)was undertaken using component failure rate data to predict PTC for a full stroke test and a partial stroke test.Given the subjective and uncertain aspects of the FMEDA approach,specifically the selection of component failure rates and the determination of the probability of detecting failure modes,a Fuzzy Inference System(FIS)was proposed to manage the data,addressing the inherent uncertainties.Fuzzy inference systems have been used previously for various FMEA type assessments,but this is the first time an FIS has been employed for use with FMEDA.ESDV PTC values were generated from both the standard FMEDA and the fuzzy-FMEDA approaches using data provided by FMEDA experts.This work demonstrates that fuzzy inference systems can address the subjectivity inherent in FMEDA data,enabling reliable estimates of ESDV proof test coverage for both full and partial stroke tests.This facilitates optimized maintenance planning while ensuring safety is not compromised.展开更多
The advancement of 6G wireless communication technology has facilitated the integration of Vehicular Ad-hoc Networks(VANETs).However,the messages transmitted over the public channel in the open and dynamic VANETs are ...The advancement of 6G wireless communication technology has facilitated the integration of Vehicular Ad-hoc Networks(VANETs).However,the messages transmitted over the public channel in the open and dynamic VANETs are vulnerable to malicious attacks.Although numerous researchers have proposed authentication schemes to enhance the security of Vehicle-to-Vehicle(V2V)communication,most existing methodologies face two significant challenges:(1)the majority of the schemes are not lightweight enough to support realtime message interaction among vehicles;(2)the sensitive information like identity and position is at risk of being compromised.To tackle these issues,we propose a lightweight dual authentication protocol for V2V communication based on Physical Unclonable Function(PUF).The proposed scheme accomplishes dual authentication between vehicles by the combination of Zero-Knowledge Proof(ZKP)and MASK function.The security analysis proves that our scheme provides both anonymous authentication and information unlinkability.Additionally,the performance analysis demonstrates that the computation overhead of our scheme is approximately reduced 23.4% compared to the state-of-the-art schemes.The practical simulation conducted in a 6G network environment demonstrates the feasibility of 6G-based VANETs and their potential for future advancements.展开更多
2025年6月30日,华盛顿大学研究团队在《Nature Medicine》期刊上发表了一篇题为《Health effects associated with consumption of processed meat,sugar-sweetened beverages and trans fatty acids:a Burden of Proof study》的研究...2025年6月30日,华盛顿大学研究团队在《Nature Medicine》期刊上发表了一篇题为《Health effects associated with consumption of processed meat,sugar-sweetened beverages and trans fatty acids:a Burden of Proof study》的研究论文。研究结果发现,与不摄入加工肉类相比,每天摄入0.6~57克加工肉类,患2型糖尿病的风险平均至少高11%。展开更多
This paper examines the application of the Verkle tree—an efficient data structure that leverages commitments and a novel proof technique in cryptographic solutions.Unlike traditional Merkle trees,the Verkle tree sig...This paper examines the application of the Verkle tree—an efficient data structure that leverages commitments and a novel proof technique in cryptographic solutions.Unlike traditional Merkle trees,the Verkle tree significantly reduces signature size by utilizing polynomial and vector commitments.Compact proofs also accelerate the verification process,reducing computational overhead,which makes Verkle trees particularly useful.The study proposes a new approach based on a non-positional polynomial notation(NPN)employing the Chinese Remainder Theorem(CRT).CRT enables efficient data representation and verification by decomposing data into smaller,indepen-dent components,simplifying computations,reducing overhead,and enhancing scalability.This technique facilitates parallel data processing,which is especially advantageous in cryptographic applications such as commitment and proof construction in Verkle trees,as well as in systems with constrained computational resources.Theoretical foundations of the approach,its advantages,and practical implementation aspects are explored,including resistance to potential attacks,application domains,and a comparative analysis with existing methods based on well-known parameters and characteristics.An analysis of potential attacks and vulnerabilities,including greatest common divisor(GCD)attacks,approximate multiple attacks(LLL lattice-based),brute-force search for irreducible polynomials,and the estimation of their total number,indicates that no vulnerabilities have been identified in the proposed method thus far.Furthermore,the study demonstrates that integrating CRT with Verkle trees ensures high scalability,making this approach promising for blockchain systems and other distributed systems requiring compact and efficient proofs.展开更多
设l∈N,δ=k/p-k+1/2,以及<p<1.本文的主要结果是建立广义BochnerRiesz平均的核的某种分解: ((1-|ξ|~l)~σ+)^(x)=sum from f=1 to J(k,l,p) b_f((1-|ξ|~2)ь+ζ)^(x)+T(|x|),其中T满足 T^(n+1)(s)≤cmin{(1+s)_(k-n-2),(1+s)^(...设l∈N,δ=k/p-k+1/2,以及<p<1.本文的主要结果是建立广义BochnerRiesz平均的核的某种分解: ((1-|ξ|~l)~σ+)^(x)=sum from f=1 to J(k,l,p) b_f((1-|ξ|~2)ь+ζ)^(x)+T(|x|),其中T满足 T^(n+1)(s)≤cmin{(1+s)_(k-n-2),(1+s)^(-k,p)},0<s<∞以及n=[K(1/p-1)]·作为上述分解的一个直接结果,我们得到:临界阶广义Bochner-Riesz平均在H^p(R^k)上的a.e.收敛性。展开更多
During his first year as an entrepreneur,Han Bicheng washed his hair roughly three times a day-more than 800 times in a single year.He and his team had to repeatedly apply conductive gel to their scalps to capture the...During his first year as an entrepreneur,Han Bicheng washed his hair roughly three times a day-more than 800 times in a single year.He and his team had to repeatedly apply conductive gel to their scalps to capture the clean electroencephalogram signals needed for their experiments,a routine that kept them in a near-constant cycle of shampooing.展开更多
In this paper we prove a geometric property of orbits of ve ctor fields on R^n near hyperbolic singular points. Let f: R^n→R^n be an analytic function with f(O)=O, grad f=O at x=O. Then the grad f of f determines a v...In this paper we prove a geometric property of orbits of ve ctor fields on R^n near hyperbolic singular points. Let f: R^n→R^n be an analytic function with f(O)=O, grad f=O at x=O. Then the grad f of f determines a vector field as follows dx_1/ dt=af/ax_1, dx_2/dt = Of/Ox_2, '',dx_n/dt =af/ax_n. suppose x(t)=(x_1(t)),…x_n(t)) is a solution of the above system with propcrty that limx(t)=O. The following problems were posed by profeSsor T-C.Kuo(University of Sydnoy) Probiem 1. Does x have a unique tangent at 0? That is, the li mit lim x(t)/x(t)=O exist? Problem 2. If the above limit exists, is it true that lim x′(t)/x′(t)=lim x(t)/x(t)?展开更多
In 2011, Chan proposed an image authentication method by producing the parity check bits from pixels whose bits have been rearranged. Due to this rearrangement, the value of the most-significant bit of each tampered p...In 2011, Chan proposed an image authentication method by producing the parity check bits from pixels whose bits have been rearranged. Due to this rearrangement, the value of the most-significant bit of each tampered pixel can be determined according to its parity check bits. With the help of the most-significant bit of the pixel, the pixel can be recovered by selecting two possible （7, 4） Hamming code words. However, if the distance between two Hamming code words is within a certain range, incorrect selection may occur. Chan＇s method added one additional bit to indicate the correct one. It is trivial that this may degrade the quality of the authenticated image. In this paper, we group four most-significant bits into different groups to form a mapping codebook and the mapping codebook is used to produce authentication data instead of the （7, 4） Hamming code book. The experimental results show that the proposed method has a greater ability to recover tampered areas.展开更多
文摘The shrink proofing on wool with treatment of protease named Argaenzyme STL was studied. The various pretreating auxiliaries, different parameters for protease treating process and the effect of stabilizer were discussed in detail. The varieties of some properties before and after protease treatment were also investigated.
基金supported by Canada First Research Excellence Fund,Medicine by Design(to CMM)。
文摘Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells could be generated from adult mouse fibroblasts is powerful proof that cell fate can be changed.An exciting extension of the discovery of cell fate impermanence is the direct cellular reprogram ming hypothesis-that terminally differentiated cells can be reprogrammed into other adult cell fates without first passing through a stem cell state.
文摘There is an error in the name of the cell line in the abstract of the published paper“MicroRNA-502-3p regulates GABAergic synapse function in hippocampal neurons”published on pages 2698-2707,Issue 12,Volume 19 of Neural Regeneration Research(Sharma et al.,2024),because of oversight during final proof checking.The correct description should be“human-GABA receptor A-α1/β2/γ2L human embryonic kidney(HEK)recombinant cell line.”The authors apologize for any inconvenience this correction may cause for readers and editors of Neural Regeneration Research.
基金funded by the Office of Gas and Electricity Markets(Ofgem)and supported by De Montfort University(DMU)and Nottingham Trent University(NTU),UK.
文摘This paper introduces the Integrated Security Embedded Resilience Architecture (ISERA) as an advanced resilience mechanism for Industrial Control Systems (ICS) and Operational Technology (OT) environments. The ISERA framework integrates security by design principles, micro-segmentation, and Island Mode Operation (IMO) to enhance cyber resilience and ensure continuous, secure operations. The methodology deploys a Forward-Thinking Architecture Strategy (FTAS) algorithm, which utilises an industrial Intrusion Detection System (IDS) implemented with Python’s Network Intrusion Detection System (NIDS) library. The FTAS algorithm successfully identified and responded to cyber-attacks, ensuring minimal system disruption. ISERA has been validated through comprehensive testing scenarios simulating Denial of Service (DoS) attacks and malware intrusions, at both the IT and OT layers where it successfully mitigates the impact of malicious activity. Results demonstrate ISERA’s efficacy in real-time threat detection, containment, and incident response, thus ensuring the integrity and reliability of critical infrastructure systems. ISERA’s decentralised approach contributes to global net zero goals by optimising resource use and minimising environmental impact. By adopting a decentralised control architecture and leveraging virtualisation, ISERA significantly enhances the cyber resilience and sustainability of critical infrastructure systems. This approach not only strengthens defences against evolving cyber threats but also optimises resource allocation, reducing the system’s carbon footprint. As a result, ISERA ensures the uninterrupted operation of essential services while contributing to broader net zero goals.
基金supported by National Key R&D Program of China for Young Scientists:Cyberspace Endogenous Security Mechanisms and Evaluation Methods(No.2022YFB3102800).
文摘The security of information transmission and processing due to unknown vulnerabilities and backdoors in cyberspace is becoming increasingly problematic.However,there is a lack of effective theory to mathematically demonstrate the security of information transmission and processing under nonrandom noise(or vulnerability backdoor attack)conditions in cyberspace.This paper first proposes a security model for cyberspace information transmission and processing channels based on error correction coding theory.First,we analyze the fault tolerance and non-randomness problem of Dynamic Heterogeneous Redundancy(DHR)structured information transmission and processing channel under the condition of non-random noise or attacks.Secondly,we use a mathematical statistical method to demonstrate that for non-random noise(or attacks)on discrete memory channels,there exists a DHR-structured channel and coding scheme that enables the average system error probability to be arbitrarily small.Finally,to construct suitable coding and heterogeneous channels,we take Turbo code as an example and simulate the effects of different heterogeneity,redundancy,output vector length,verdict algorithm and dynamism on the system,which is an important guidance for theory and engineering practice.
文摘The rapid evolution of quantum computing poses significant threats to traditional cryptographic schemes,particularly in Decentralized Finance(DeFi)systems that rely on legacy mechanisms like RSA and ECDSA for digital identity verification.This paper proposes a quantum-resilient,blockchain-based identity verification framework designed to address critical challenges in privacy preservation,scalability,and post-quantum security.The proposed model integrates Post-quantum Cryptography(PQC),specifically lattice-based cryptographic primitives,with Decentralized Identifiers(DIDs)and Zero-knowledge Proofs(ZKPs)to ensure verifiability,anonymity,and resistance to quantum attacks.A dual-layer architecture is introduced,comprising an identity layer for credential generation and validation,and an application layer for DeFi protocol integration.To evaluate its performance,the framework is tested on multiple real-world DeFi platforms using metrics such as verification latency,throughput,attack resistance,energy efficiency,and quantum attack simulation.The results demonstrate that the proposed framework achieves 90%latency reduction and over 35%throughput improvement compared to traditional blockchain identity solutions.It also exhibits a high quantum resistance score(95/100),with successful secure verification under simulated quantum adversaries.The revocation mechanism—implemented using Merkle-tree-based proofs—achieves average response times under 40 ms,and the system maintains secure operations with energy consumption below 9 J per authentication cycle.Additionally,the paper presents a security and cost tradeoff analysis using ZKP schemes such as Bulletproofs and STARKs,revealing superior bits-per-byte efficiency and reduced proof sizes.Real-world adoption scenarios,including integration with six major DeFi protocols,indicate a 25%increase in verified users and a 15%improvement in Total Value Locked(TVL).The proposed solution is projected to remain secure until 2041(basic version)and 2043(advanced version),ensuring long-term sustainability and future-proofing against evolving quantum threats.This work establishes a scalable,privacy-preserving identity model that aligns with emerging post-quantum security standards for decentralized ecosystems.
基金sponsored by National Natural Science Foundation of China(No.61571049).
文摘Traceability and trustiness are two critical issues in the logistics sector.Blockchain provides a potential way for logistics tracking systems due to its traits of tamper resistance.However,it is non-trivial to apply blockchain on logistics because of firstly,the binding relationship between virtue data and physical location cannot be guaranteed so that frauds may exist.Secondly,it is neither practical to upload complete data on the blockchain due to the limited storage resources nor convincing to trust the digest of the data.This paper proposes a traceable and trustable consortium blockchain for logistics T^(2)L to provide an efficient solution to the mentioned problems.Specifically,the authenticated geocoding data from telecom operators’base stations are adopted to ensure the location credibility of the data before being uploaded to the blockchain for the purpose of reliable traceability of the logistics.Moreover,we propose a scheme based on Zero Knowledge Proof of Retrievability(ZK BLS-PoR)to ensure the trustiness of the data digest and the proofs to the blockchain.Any user in the system can check the data completeness by verifying the proofs instead of downloading and examining the whole data based on the proposed ZK BLS-PoR scheme,which can provide solid theoretical verification.In all,the proposed T^(2)L framework is a traceable and trustable logistics system with a high level of security.
文摘As the demand for cross-departmental data collaboration continues to grow,traditional encryption methods struggle to balance data privacy with computational efficiency.This paper proposes a cross-departmental privacy-preserving computation framework based on BFV homomorphic encryption,threshold decryption,and blockchain technology.The proposed scheme leverages homomorphic encryption to enable secure computations between sales,finance,and taxation departments,ensuring that sensitive data remains encrypted throughout the entire process.A threshold decryption mechanism is employed to prevent single-point data leakage,while blockchain and IPFS are integrated to ensure verifiability and tamper-proof storage of computation results.Experimental results demonstrate that with 5,000 sample data entries,the framework performs efficiently and is highly scalable in key stages such as sales encryption,cost calculation,and tax assessment,thereby validating its practical feasibility and security.
文摘Published proof test coverage(PTC)estimates for emergency shutdown valves(ESDVs)show only moderate agreement and are predominantly opinion-based.A Failure Modes,Effects,and Diagnostics Analysis(FMEDA)was undertaken using component failure rate data to predict PTC for a full stroke test and a partial stroke test.Given the subjective and uncertain aspects of the FMEDA approach,specifically the selection of component failure rates and the determination of the probability of detecting failure modes,a Fuzzy Inference System(FIS)was proposed to manage the data,addressing the inherent uncertainties.Fuzzy inference systems have been used previously for various FMEA type assessments,but this is the first time an FIS has been employed for use with FMEDA.ESDV PTC values were generated from both the standard FMEDA and the fuzzy-FMEDA approaches using data provided by FMEDA experts.This work demonstrates that fuzzy inference systems can address the subjectivity inherent in FMEDA data,enabling reliable estimates of ESDV proof test coverage for both full and partial stroke tests.This facilitates optimized maintenance planning while ensuring safety is not compromised.
文摘The advancement of 6G wireless communication technology has facilitated the integration of Vehicular Ad-hoc Networks(VANETs).However,the messages transmitted over the public channel in the open and dynamic VANETs are vulnerable to malicious attacks.Although numerous researchers have proposed authentication schemes to enhance the security of Vehicle-to-Vehicle(V2V)communication,most existing methodologies face two significant challenges:(1)the majority of the schemes are not lightweight enough to support realtime message interaction among vehicles;(2)the sensitive information like identity and position is at risk of being compromised.To tackle these issues,we propose a lightweight dual authentication protocol for V2V communication based on Physical Unclonable Function(PUF).The proposed scheme accomplishes dual authentication between vehicles by the combination of Zero-Knowledge Proof(ZKP)and MASK function.The security analysis proves that our scheme provides both anonymous authentication and information unlinkability.Additionally,the performance analysis demonstrates that the computation overhead of our scheme is approximately reduced 23.4% compared to the state-of-the-art schemes.The practical simulation conducted in a 6G network environment demonstrates the feasibility of 6G-based VANETs and their potential for future advancements.
文摘2025年6月30日,华盛顿大学研究团队在《Nature Medicine》期刊上发表了一篇题为《Health effects associated with consumption of processed meat,sugar-sweetened beverages and trans fatty acids:a Burden of Proof study》的研究论文。研究结果发现,与不摄入加工肉类相比,每天摄入0.6~57克加工肉类,患2型糖尿病的风险平均至少高11%。
基金funded by the Ministry of Science and Higher Education of Kazakhstan and carried out within the framework of the project AP23488112“Development and study of a quantum-resistant digital signature scheme based on a Verkle tree”at the Institute of Information and Computational Technologies.
文摘This paper examines the application of the Verkle tree—an efficient data structure that leverages commitments and a novel proof technique in cryptographic solutions.Unlike traditional Merkle trees,the Verkle tree significantly reduces signature size by utilizing polynomial and vector commitments.Compact proofs also accelerate the verification process,reducing computational overhead,which makes Verkle trees particularly useful.The study proposes a new approach based on a non-positional polynomial notation(NPN)employing the Chinese Remainder Theorem(CRT).CRT enables efficient data representation and verification by decomposing data into smaller,indepen-dent components,simplifying computations,reducing overhead,and enhancing scalability.This technique facilitates parallel data processing,which is especially advantageous in cryptographic applications such as commitment and proof construction in Verkle trees,as well as in systems with constrained computational resources.Theoretical foundations of the approach,its advantages,and practical implementation aspects are explored,including resistance to potential attacks,application domains,and a comparative analysis with existing methods based on well-known parameters and characteristics.An analysis of potential attacks and vulnerabilities,including greatest common divisor(GCD)attacks,approximate multiple attacks(LLL lattice-based),brute-force search for irreducible polynomials,and the estimation of their total number,indicates that no vulnerabilities have been identified in the proposed method thus far.Furthermore,the study demonstrates that integrating CRT with Verkle trees ensures high scalability,making this approach promising for blockchain systems and other distributed systems requiring compact and efficient proofs.
文摘设l∈N,δ=k/p-k+1/2,以及<p<1.本文的主要结果是建立广义BochnerRiesz平均的核的某种分解: ((1-|ξ|~l)~σ+)^(x)=sum from f=1 to J(k,l,p) b_f((1-|ξ|~2)ь+ζ)^(x)+T(|x|),其中T满足 T^(n+1)(s)≤cmin{(1+s)_(k-n-2),(1+s)^(-k,p)},0<s<∞以及n=[K(1/p-1)]·作为上述分解的一个直接结果,我们得到:临界阶广义Bochner-Riesz平均在H^p(R^k)上的a.e.收敛性。
文摘During his first year as an entrepreneur,Han Bicheng washed his hair roughly three times a day-more than 800 times in a single year.He and his team had to repeatedly apply conductive gel to their scalps to capture the clean electroencephalogram signals needed for their experiments,a routine that kept them in a near-constant cycle of shampooing.
文摘In this paper we prove a geometric property of orbits of ve ctor fields on R^n near hyperbolic singular points. Let f: R^n→R^n be an analytic function with f(O)=O, grad f=O at x=O. Then the grad f of f determines a vector field as follows dx_1/ dt=af/ax_1, dx_2/dt = Of/Ox_2, '',dx_n/dt =af/ax_n. suppose x(t)=(x_1(t)),…x_n(t)) is a solution of the above system with propcrty that limx(t)=O. The following problems were posed by profeSsor T-C.Kuo(University of Sydnoy) Probiem 1. Does x have a unique tangent at 0? That is, the li mit lim x(t)/x(t)=O exist? Problem 2. If the above limit exists, is it true that lim x′(t)/x′(t)=lim x(t)/x(t)?
基金supported by the Asia University,Taiwan under Grant No.100-ASIA-38
文摘In 2011, Chan proposed an image authentication method by producing the parity check bits from pixels whose bits have been rearranged. Due to this rearrangement, the value of the most-significant bit of each tampered pixel can be determined according to its parity check bits. With the help of the most-significant bit of the pixel, the pixel can be recovered by selecting two possible （7, 4） Hamming code words. However, if the distance between two Hamming code words is within a certain range, incorrect selection may occur. Chan＇s method added one additional bit to indicate the correct one. It is trivial that this may degrade the quality of the authenticated image. In this paper, we group four most-significant bits into different groups to form a mapping codebook and the mapping codebook is used to produce authentication data instead of the （7, 4） Hamming code book. The experimental results show that the proposed method has a greater ability to recover tampered areas.
