A Leaking-Proof Theranostic Nanoplatform for Tumor-Targeted and Dual-Modality Imaging-Guided Photodynamic Therapy

Objective:A protein-based leaking-proof theranostic nanoplatform for dual-modality imaging-guided tumor photodynamic therapy(PDT)has been designed.Impact Statement:A site-specific conjugation of chlorin e6(Ce6)to ferrimagnetic ferritin(MFtn-Ce6)has been constructed to address the challenge of unexpected leakage that often occurs during small-molecule drug delivery.Introduction:PDT is one of the most promising approaches for tumor treatment,while a delivery system is typically required for hydrophobic photosensitizers.However,the nonspecific distribution and leakage of photosensitizers could lead to insufficient drug accumulation in tumor sites.Methods:An engineered ferritin was generated for site-specific conjugation of Ce6 to obtain a leaking-proof delivery system,and a ferrimagnetic core was biomineralized in the cavity of ferritin,resulting in a fluorescent ferrimagnetic ferritin nanoplatform(MFtn-Ce6).The distribution and tumor targeting of MFtn-Ce6 can be detected by magnetic resonance imaging(MRI)and fluorescence imaging(FLI).Results:MFtn-Ce6 showed effective dual-modality MRI and FLI.A prolonged in vivo circulation and increased tumor accumulation and retention of photosensitizer was observed.The time-dependent distribution of MFtn-Ce6 can be precisely tracked in real time to find the optimal time window for PDT treatment.The colocalization of ferritin and the iron oxide core confirms the high stability of the nanoplatform in vivo.The results showed that mice treated with MFtn-Ce6 exhibited marked tumor-suppressive activity after laser irradiation.Conclusion:The ferritin-based leaking-proof nanoplatform can be used for the efficient delivery of the photosensitizer to achieve an enhanced therapeutic effect.This method established a general approach for the dual-modality imagingguided tumor delivery of PDT agents.

Block Verification Mechanism Based on Zero-Knowledge Proof in Blockchain

Since transactions in blockchain are based on public ledger verification,this raises security concerns about privacy protection.And it will cause the accumulation of data on the chain and resulting in the low efficiency of block verification,when the whole transaction on the chain is verified.In order to improve the efficiency and privacy protection of block data verification,this paper proposes an efficient block verification mechanism with privacy protection based on zeroknowledge proof(ZKP),which not only protects the privacy of users but also improves the speed of data block verification.There is no need to put the whole transaction on the chain when verifying block data.It just needs to generate the ZKP and root hash with the transaction information,then save them to the smart contract for verification.Moreover,the ZKP verification in smart contract is carried out to realize the privacy protection of the transaction and efficient verification of the block.When the data is validated,the buffer accepts the complete transaction,updates the transaction status in the cloud database,and packages up the chain.So,the ZKP strengthens the privacy protection ability of blockchain,and the smart contracts save the time cost of block verification.

A Comparative Analysis of the New -3(-n) - 1 Remer Conjecture and a Proof of the 3n + 1 Collatz Conjecture

This scientific paper is a comparative analysis of two mathematical conjectures. The newly proposed -3(-n) - 1 Remer conjecture and how it is related to and a proof of the more well known 3n + 1 Collatz conjecture. An overview of both conjectures and their respective iterative processes will be presented. Showcasing their unique properties and behavior to each other. Through a detailed comparison, we highlight the similarities and differences between these two conjectures and discuss their significance in the field of mathematics. And how they prove each other to be true.

A Blockchain-Based Efficient Cross-Domain Authentication Scheme for Internet of Vehicles

The Internet of Vehicles(IoV)is extensively deployed in outdoor and open environments to effectively address traffic efficiency and safety issues by connecting vehicles to the network.However,due to the open and variable nature of its network topology,vehicles frequently engage in cross-domain interactions.During such processes,directly uploading sensitive information to roadside units for interaction may expose it to malicious tampering or interception by attackers,thus compromising the security of the cross-domain authentication process.Additionally,IoV imposes high real-time requirements,and existing cross-domain authentication schemes for IoV often encounter efficiency issues.To mitigate these challenges,we propose CAIoV,a blockchain-based efficient cross-domain authentication scheme for IoV.This scheme comprehensively integrates technologies such as zero-knowledge proofs,smart contracts,and Merkle hash tree structures.It divides the cross-domain process into anonymous cross-domain authentication and safe cross-domain authentication phases to ensure efficiency while maintaining a balance between efficiency and security.Finally,we evaluate the performance of CAIoV.Experimental results demonstrate that our proposed scheme reduces computational overhead by approximately 20%,communication overhead by around 10%,and storage overhead by nearly 30%.

A Proof of Brouwer’s Fixed Point Theorem Using Sperner’s Lemma

This article offers a simple but rigorous proof of Brouwer’s fixed point theorem using Sperner’s Lemma.The general method I have used so far in the proof is mainly to convert the n-dimensional shapes to the corresponding case under the Sperner’s Labeling and apply the Sperner’s Lemma to solve the question.

Mathematical Wave Functions and 3D Finite Element Modelling of the Electron and Positron

The wave/particle duality of particles in Physics is well known. Particles have properties that uniquely characterize them from one another, such as mass, charge and spin. Charged particles have associated Electric and Magnetic fields. Also, every moving particle has a De Broglie wavelength determined by its mass and velocity. This paper shows that all of these properties of a particle can be derived from a single wave function equation for that particle. Wave functions for the Electron and the Positron are presented and principles are provided that can be used to calculate the wave functions of all the fundamental particles in Physics. Fundamental particles such as electrons and positrons are considered to be point particles in the Standard Model of Physics and are not considered to have a structure. This paper demonstrates that they do indeed have structure and that this structure extends into the space around the particle’s center (in fact, they have infinite extent), but with rapidly diminishing energy density with the distance from that center. The particles are formed from Electromagnetic standing waves, which are stable solutions to the Schrödinger and Classical wave equations. This stable structure therefore accounts for both the wave and particle nature of these particles. In fact, all of their properties such as mass, spin and electric charge, can be accounted for from this structure. These particle properties appear to originate from a single point at the center of the wave function structure, in the same sort of way that the Shell theorem of gravity causes the gravity of a body to appear to all originate from a central point. This paper represents the first two fully characterized fundamental particles, with a complete description of their structure and properties, built up from the underlying Electromagnetic waves that comprise these and all fundamental particles.

Simulation and Experimental Study of Staple Line Reinforcement Surgery

The aim of this study was to evaluate the effectiveness of BM (basement membrane) and SIS (small intestine submucosa) composite extracellular matrix staple line reinforcement in surgical procedures through finite element modelling simulations and leak-proof performance experiments. The mechanical analyses of soft tissues with and without staple line reinforcement were performed by establishing finite element models of three tissues, namely, stomach, intestine and lungs, under the use scenarios of different anastomosis staple models;and the leak-proof performance of the staple line reinforcement was evaluated by simulating leak-proof experiments of gastric incision margins, intestinal sections, and lung incision margins in vitro. The results showed that the equivalent average stresses of the staple line reinforcement were increased by 20 kPa-68 kPa in gastric and intestinal tissues, and 8 kPa-22 kPa in lung tissues. and that the BM and SIS composite extracellular matrix staple line reinforcement could strengthen the anastomotic structure, and at the same time disperse the high stresses of the anastomosed tissues, which could effectively reduce the postoperative complications such as anastomotic bleeding and anastomotic leakage, and provide a safer and more effective optimized design for surgical mechanical anastomosis. It can effectively reduce postoperative complications such as anastomotic bleeding and anastomotic leakage, and provide a safer and more effective optimized design for surgical mechanical anastomosis.

Fool-Proof法在图书馆工作中的应用浅探

防呆法在企业生产中有大量的应用,在一些大型企业中也取得了显著的效果。作为一个服务部门和信息生产部门,图书馆应用防呆法无疑有助于图书馆的自动化和规范化。根据防呆法原理从10个方面详细列举了防呆法在图书馆的可能应用。

电影《相助》片尾曲《The Living Proof》的功能文体学分析

电影歌曲作为整部电影的有机组成部分,其重要性不可小觑,一首好的歌曲能达到锦上添花的观影效果。目前国内对电影歌词的研究,大多集中在音乐学、美学、文学等语言学之外的领域,从功能语言学的角度对电影歌曲的解读尚且不多。本文拟以系统功能语法理论为指导,从语境、经验功能、人际功能着手解析电影《相助》片尾曲《The Living Proof》,以期丰富系统功能语法的研究内容,为电影歌词的分析提供新的视角,帮助观影者深度理解影片主题。

FORMAL PROOF OF RELATIVE STRENGTH OF SECURITY AMONG ECK2007 MODEL AND OTHER PROOF MODELS FOR KEY AGREEMENT PROTOCOLS

The differences among the extended Canetti ＆ Krawezyk 2007 model （ECK2007） and other four models, i.e., the Bellare ＆ Rogaway （1993, 1995）models （BR93,BR95）, the Bellare, Pointcheval ＆ Rogaway （2000） model （BPR2000） and the Canetti ＆ Krawczyk （2001） model （CK2001） are given. The relative strength of security among these models is analyzed. To support the implication or non-implication relation among these models, the formal proof or the counter-example is provided.

Comments and Research on Proofs of Chain Rule

In this paper we point out that the proofs of Chain Rule in many intensively used textbooks are not strict an construct anexa mple of a composite function f(u) which is differentiable with respects t o the independednt variable u, but is not differentiable with respect to the dependent variable u=g(x). A strict proof of Chain Rule is presented. Incon sistency of the form and content of Chain Rule is disclosed.

Study on Ignition Proof AZ91D Magnesium Alloy Chips with Cerium Addition

The effect of Ce on ignition point of AZ91D magnesium alloy chips was studied. For the AZ91D and the AZ91D-xCe magnesium alloys, changing the sizes of the chips in the range of 58 - 270 μm has a limited influence on ignition point, however, the shift of the content of Ce has much effect on ignition point. Increasing the Ce content, x from 0.15 to 0.25, the ignition point increases with increasing of Ce; however, x from 0.25 to 0.45, the ignition point decreases with increasing of Ce. By the addition of Ce of 0.25 %. the ignition point is raised by 43℃.

Group Signature Based on Non-interactive Zero-Knowledge Proofs

Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for short) with NIZK proofs is proposed which can prove and sign the multiple values rather than individual bits based on DLIN assumption. DLAGS does not need to interact between the verifier and issuer,which can decrease the communication times and storage cost compared with the existing interactive group signature schemes. We prove and sign the blocks of messages instead of limiting the proved message to only one bit(0 or 1) in the conventional non-interactive zero-knowledge proof system,and we also prove that our scheme satisfy the property of anonymity,unlinkability and traceability. Finally,our scheme is compared with the other scheme(Benoitt's scheme) which is also based on the NIZK proofs system and the DLIN assumption,and the results show that our scheme requires fewer members of groups and computational times.

A SIMPLE PROOF OF STABILITY AND CONVERGENCE IN L＿2 FOR SOME DIFFERENCE SCHEMES AND THEIR EXTRAPOLATION METHOD FOR PARABOLIC EQUATIONS

ＡＳＩＭＰＬＥＰＲＯＯＦＯＦＳＴＡＢＩＬＩＴＹＡＮＤＣＯＮＶＥＲＧＥＮＣＥＩＮＬ＿２ＦＯＲＳＯＭＥＤＩＦＦＥＲＥＮＣＥＳＣＨＥＭＥＳＡＮＤＴＨＥＩＲＥＸＴＲＡＰＯＬＡＴＩＯＮＭＥＴＨＯＤＦＯＲＰＡＲＡＢＯＬＩＣＥＱＵＡＴＩＯＮＳＳｕｎＺｈｉｚｈｏｎｇ...

Game-Based Automated Security Proofs for Cryptographic Protocols

Provable security has become a popular approach for analyzing the security of cryptographic protocols.However,writing and verifying proofs by hand are prone to errors.This paper advocates the automatic security proof framework with sequences of games.We make slight modifications to Blanchet's calculus to make it easy for parsing the initial game.The main contribution of this work is that it introduces algebraic properties with observational equivalences to automatic security proofs,and thus can deal with some practical cryptographic schemes with hard problems.We illustrate the use of algebraic properties in the framework by proving the semantic security of the ElGamal encryption scheme.

Local Geometric Proof of Riemann Conjecture

Riemann hypothesis (RH) is a difficult problem. So far one doesn’t know how to go about it. Studying ζ and using analysis method likely are two incor-rect guides. Actually, a unique hope may study Riemann function , , by geometric analysis, which has the symmetry: v=0 if β=0, and basic expression . We show that |u| is single peak in each root-interval of u for fixed β ∈(0,1/2]. Using the slope ut, we prove that v has opposite signs at two end-points of Ij. There surely exists an inner point such that , so {|u|,|v|/β} form a local peak-valley structure, and have positive lower bound in Ij. Because each t must lie in some Ij, then ||ξ|| > 0 is valid for any t (i.e. RH is true). Using the positivity of Lagarias (1999), we show the strict monotone for β > β0 ≥ 0 , and the peak-valley structure is equiva-lent to RH, which may be the geometric model expected by Bombieri (2000). This research follows Liuhui’s methodology: “Computing can detect the un-known and method”.

A Privacy-Preserving Grouping Proof Protocol Based on ECC with Untraceability for RFID

An RFID (Radio-Frequency IDentification) system provides the mechanism to identify tags to readers and then to execute specific RFID-enabled applications. In those applications, secure protocols using lightweight cryptography need to be developed and the privacy of tags must be ensured. In 2010, Batina et al. proposed a privacy-preserving grouping proof protocol for RFID based on ECC (Elliptic Curve Cryptography) in public-key cryptosystem. In the next year, Lv et al. had shown that Batina et al.’s protocol was insecure against the tracking attack such that the privacy of tags did not be preserved properly. Then they proposed a revised protocol based on Batina et al.’s work. Their revised protocol was claimed to have all security properties and resisted tracking attack. But in this paper, we prove that Lv et al.’s protocol cannot work properly. Then we propose a new version protocol with some nonce to satisfy the functions of Batina et al.’s privacy-preserving grouping proof protocol. Further we try the tracing attack made by Lv et al. on our protocol and prove our protocol can resist this attack to recover the untraceability.

Proof of concept study to identify candidate biomarkers of fibrosis using high throughput peptide aptamer microarray and validate by enzyme linked immunosorbant assay

Background: Nine proteins were identified as putative profibrotic biomarkers in systemic sclerosis (SSc) and an unrelated fibrotic disease in a previously published proteomic study. As the majority of these proteins were orphans of commercially available antibodies, the nine proteins were investigated to determine whether binding peptide aptamers of the Stefin A quadruple mutant-Tracy variant (referred to as “affimers”) could be validated by enzyme linked immunosorbant assay (ELISA) to allow the quantification of these candidate biomarkers in the sera of SSc patients. Materials and Methods: Candidate biomarker peptides were analysed by high throughput affimer microarray to identify binding affimers. Two candidate biomarkers were prioritised, and binding affimers were expressed from genetically modified BL21 competent E. coli strains and purified. These affimers were used in indirect ELISA, and then sandwich ELISA formats against the candidate biomarker recombinant proteins osteonectin and pigment epi-thetlium-derived factor (PEDF). Results: 39 affimers were identified as binders for eight of the nine candidate biomarker peptides were by affimer microarray;six for osteonectin and eleven for PEDF. Two of the six and all eleven were able to recognize physiological concentrations (5 and 1 μg·ml﹣1) of osteonectin and PEDF, respectively by indirect ELISA. In sandwich ELISA format: two affimers were able to detect recombinant PEDF;however, the two affimers identified in indirect ELISA were unable to recognise recombinant osteonectin, and were thus hypothesised to bind to osteonectin at the same binding site. Discussion: SSc is currently an orphan of fully validated biomarkers, which is required for the development of stratified medicine in this field. This approach has laid the groundwork for an affimer based on multiplexed assay, to validate biomarkers in the sera of SSc patients in the future.

An Elementary Proof of Fermat’s Last Theorem for Epsilons

The author presents a new approach which is used to solve an important Diophantine problem. An elementary argument is used to furnish another fully transparent proof of Fermat’s Last Theorem. This was first stated by Pierre de Fermat in the seventeenth century. It is widely regarded that no elementary proof of this theorem exists. The author provides evidence to dispel this belief.

Evaluating Pedagogical Quality of Learning Activities Using Fuzzy Evaluation Mappings: The Case of Pedagogical Games of Mathematical Proof

This paper introduces a conceptual framework for developing pedagogical games of mathematical proof (PGMP) designed to help non-STEM students learn mathematical reasoning in a playful manner and without “fear”. Within the constructivist learning paradigm it develops an in-class learning activity where social science students learn the concept of mathematical deduction playfully using toys to construct tables from which formal proofs of propositions are derived without calculations. A PGMP pedagogy quality assurance evaluation method based on fuzzy evaluation mappings capturing learning effectiveness, learning efficiency, and learning satisfaction is introduced. Our results from an in-class experiment show that pedagogical games of mathematical proof help non-STEM students to effectively engage with mathematical reasoning playfully. The results are consistent according to a quality assurance consistency index.