Programmable and precise regulation of genetic information is crucial in bioengineering and biomedicine;however, it remains challenging to implement this objective. Here we deployed DNA-functionalized MXenes as a smar...Programmable and precise regulation of genetic information is crucial in bioengineering and biomedicine;however, it remains challenging to implement this objective. Here we deployed DNA-functionalized MXenes as a smart delivery system for spatiotemporally controllable genome editing. The MXene nanovehicles rationally integrated photothermal effect with nucleic acid strand displacement reaction, thereby allowing for the binary logic gate-controlled release of Cas ribonucleoprotein complexes in response to different input patterns of NIR light and nucleic acids. This system was highly programmable and could be harnessed to construct 2-input(AND, OR, and N-IMPLY) and 3-input(AND/OR and N-IMPLY/OR) logic gates for precise gene editing in mammalian cells. Moreover, an AND logic gate-controlled delivery system achieved selective induction of tumor cell death in a xenograft mice model using tissue-penetrating NIR light and cancer-relevant microRNA as the inputting cues.Therefore, the MXene nanovehicles adopted both the external and endogenous signals as the stimuli to precisely control gene editing under logic computation, presenting a helpful strategy for therapeutic genome editing.展开更多
By means of Logic symmetric relation,the single neighboring Logic path for Ndimensions Boolean ordered set is solved.A new method of determining any logic neighboringsubset in limited dimension is proposed.Its results...By means of Logic symmetric relation,the single neighboring Logic path for Ndimensions Boolean ordered set is solved.A new method of determining any logic neighboringsubset in limited dimension is proposed.Its results are intuitional and realizable for computer.展开更多
The paper consists in the use of some logical functions decomposition algorithms with application in the implementation of classical circuits like SSI, MSI and PLD. The decomposition methods use the Boolean matrix cal...The paper consists in the use of some logical functions decomposition algorithms with application in the implementation of classical circuits like SSI, MSI and PLD. The decomposition methods use the Boolean matrix calculation. It is calculated the implementation costs emphasizing the most economical solutions. One important aspect of serial decomposition is the task of selecting “best candidate” variables for the G function. Decomposition is essentially a process of substituting two or more input variables with a lesser number of new variables. This substitutes results in the reduction of the number of rows in the truth table. Hence, we look for variables which are most likely to reduce the number of rows in the truth table as a result of decomposition. Let us consider an input variable purposely avoiding all inter-relationships among the input variables. The only available parameter to evaluate its activity is the number of “l”s or “O”s that it has in the truth table. If the variable has only “1” s or “0” s, it is the “best candidate” for decomposition, as it is practically redundant.展开更多
This paper begins with an overview of quantum mechanics, and then recounts a relatively recent algebraic extension of the Boolean algebra of probabilistic events to “conditional events” (order pairs of events). The ...This paper begins with an overview of quantum mechanics, and then recounts a relatively recent algebraic extension of the Boolean algebra of probabilistic events to “conditional events” (order pairs of events). The main point is to show that a so-called “superposition” of two (or more) quantum events (usually with mutually inconsistent initial conditions) can be represented in this algebra of conditional events and assigned a consistent conditional probability. There is no need to imagine that a quantum particle can simultaneously straddle two inconsistent possibilities.展开更多
In this paper, the authors continue the researches described in [1], that consists in a comparative study of two methods to eliminate the static hazard from logical functions, by using the form of Product of Sums (POS...In this paper, the authors continue the researches described in [1], that consists in a comparative study of two methods to eliminate the static hazard from logical functions, by using the form of Product of Sums (POS), static hazard “0”. In the first method, it used the consensus theorem to determine the cover term that is equal with the product of the two residual implicants, and in the second method it resolved a Boolean equation system. The authors observed that in the second method the digital hazard can be earlier detected. If the Boolean equation system is incompatible (doesn’t have solutions), the considered logical function doesn’t have the static 1 hazard regarding the coupled variable. Using the logical computations, this method permits to determine the needed transitions to eliminate the digital hazard.展开更多
This paper proposes a kind of programmable logic element(PLE)based on Sense-Switch pFLASH technology.By programming Sense-Switch pFLASH,all three-bit look-up table(LUT3)functions,partial four-bit look-up table(LUT4)fu...This paper proposes a kind of programmable logic element(PLE)based on Sense-Switch pFLASH technology.By programming Sense-Switch pFLASH,all three-bit look-up table(LUT3)functions,partial four-bit look-up table(LUT4)functions,latch functions,and d flip flop(DFF)with enable and reset functions can be realized.Because PLE uses a choice of operational logic(COOL)approach for the operation of logic functions,it allows any logic circuit to be implemented at any ratio of combinatorial logic to register.This intrinsic property makes it close to the basic application specific integrated circuit(ASIC)cell in terms of fine granularity,thus allowing ASIC-like cell-based mappers to apply all their optimization potential.By measuring Sense-Switch pFLASH and PLE circuits,the results show that the“on”state driving current of the Sense-Switch pFLASH is about 245.52μA,and that the“off”state leakage current is about 0.1 pA.The programmable function of PLE works normally.The delay of the typical combinatorial logic operation AND3 is 0.69 ns,and the delay of the sequential logic operation DFF is 0.65 ns,both of which meet the requirements of the design technical index.展开更多
基金supported by the National Key Research and Development Program of China (2020YFA0907500)the National Natural Science Foundation of China (22034002, 21974038, 21725503, 22074034)+1 种基金the Natural Science Foundation of Hunan Province (2022JJ20004)。
文摘Programmable and precise regulation of genetic information is crucial in bioengineering and biomedicine;however, it remains challenging to implement this objective. Here we deployed DNA-functionalized MXenes as a smart delivery system for spatiotemporally controllable genome editing. The MXene nanovehicles rationally integrated photothermal effect with nucleic acid strand displacement reaction, thereby allowing for the binary logic gate-controlled release of Cas ribonucleoprotein complexes in response to different input patterns of NIR light and nucleic acids. This system was highly programmable and could be harnessed to construct 2-input(AND, OR, and N-IMPLY) and 3-input(AND/OR and N-IMPLY/OR) logic gates for precise gene editing in mammalian cells. Moreover, an AND logic gate-controlled delivery system achieved selective induction of tumor cell death in a xenograft mice model using tissue-penetrating NIR light and cancer-relevant microRNA as the inputting cues.Therefore, the MXene nanovehicles adopted both the external and endogenous signals as the stimuli to precisely control gene editing under logic computation, presenting a helpful strategy for therapeutic genome editing.
文摘By means of Logic symmetric relation,the single neighboring Logic path for Ndimensions Boolean ordered set is solved.A new method of determining any logic neighboringsubset in limited dimension is proposed.Its results are intuitional and realizable for computer.
文摘The paper consists in the use of some logical functions decomposition algorithms with application in the implementation of classical circuits like SSI, MSI and PLD. The decomposition methods use the Boolean matrix calculation. It is calculated the implementation costs emphasizing the most economical solutions. One important aspect of serial decomposition is the task of selecting “best candidate” variables for the G function. Decomposition is essentially a process of substituting two or more input variables with a lesser number of new variables. This substitutes results in the reduction of the number of rows in the truth table. Hence, we look for variables which are most likely to reduce the number of rows in the truth table as a result of decomposition. Let us consider an input variable purposely avoiding all inter-relationships among the input variables. The only available parameter to evaluate its activity is the number of “l”s or “O”s that it has in the truth table. If the variable has only “1” s or “0” s, it is the “best candidate” for decomposition, as it is practically redundant.
文摘This paper begins with an overview of quantum mechanics, and then recounts a relatively recent algebraic extension of the Boolean algebra of probabilistic events to “conditional events” (order pairs of events). The main point is to show that a so-called “superposition” of two (or more) quantum events (usually with mutually inconsistent initial conditions) can be represented in this algebra of conditional events and assigned a consistent conditional probability. There is no need to imagine that a quantum particle can simultaneously straddle two inconsistent possibilities.
文摘In this paper, the authors continue the researches described in [1], that consists in a comparative study of two methods to eliminate the static hazard from logical functions, by using the form of Product of Sums (POS), static hazard “0”. In the first method, it used the consensus theorem to determine the cover term that is equal with the product of the two residual implicants, and in the second method it resolved a Boolean equation system. The authors observed that in the second method the digital hazard can be earlier detected. If the Boolean equation system is incompatible (doesn’t have solutions), the considered logical function doesn’t have the static 1 hazard regarding the coupled variable. Using the logical computations, this method permits to determine the needed transitions to eliminate the digital hazard.
基金supported by the National Natural Science Foundation of China(No.62174150)the Natural Science Foundation of Jiangsu Province,China(Nos.BK20211040 and BK20211041)。
文摘This paper proposes a kind of programmable logic element(PLE)based on Sense-Switch pFLASH technology.By programming Sense-Switch pFLASH,all three-bit look-up table(LUT3)functions,partial four-bit look-up table(LUT4)functions,latch functions,and d flip flop(DFF)with enable and reset functions can be realized.Because PLE uses a choice of operational logic(COOL)approach for the operation of logic functions,it allows any logic circuit to be implemented at any ratio of combinatorial logic to register.This intrinsic property makes it close to the basic application specific integrated circuit(ASIC)cell in terms of fine granularity,thus allowing ASIC-like cell-based mappers to apply all their optimization potential.By measuring Sense-Switch pFLASH and PLE circuits,the results show that the“on”state driving current of the Sense-Switch pFLASH is about 245.52μA,and that the“off”state leakage current is about 0.1 pA.The programmable function of PLE works normally.The delay of the typical combinatorial logic operation AND3 is 0.69 ns,and the delay of the sequential logic operation DFF is 0.65 ns,both of which meet the requirements of the design technical index.
