A Novel Structure and Operation Scheme of Vertical Channel NAND Flash with Ferroelectric Memory for Multi String Operations

In this study, the operation method of the proposed ferroelectric memory structure as a method to overcome the limitations of the existing Charge Trap Flash (CTF) memory Vertical NAND (V-NAND) structure was presented and verified through device simulation. The proposed structure and operation method applied the BiCS (Bit Cost Scalable) structure GIDL (Gate Induce Drain Leakage) deletion method to confirm that selective program operation is possible in the ferroelectric memory V-NAND (Vertical Channel NAND) structure. In particular, we confirmed that the proposed method can easily suppress the program operation by adjusting the hole density of the channel even in the “Y-mode” operation. The channel hole density adjustment that makes this possible can be easily controlled by the voltage difference between the bit line (BL) and drain select line (DSL) contacts. The proposed structure was verified through a device simulation, and as a result of the verification, it was confirmed that the channel hole can be selectively charged in the program operation. Through this, when the cell to be programmed shows the program operation of 2.3 V, the other cells do not. It was confirmed that it could be suppressed to 0.4 V.

The globalization in highlights: achievements and genetic risks

Aim. A large-scale selection is based on the use of modern achievements of population genetics, creation of automatic informative systems with the help of electronic counting equipment, modelling and optimization of the selecting programs on EOM and modern biological technologies of recreation of animals. Centralization of selecting work enables to conduct genetic development of large number of dairy cattle within separate breeds with the effective use of achievements of practical selection in separate herds. Methods. In the conditions of large-scale selection the combination of pedigree, reproductive and marketable herds takes place in the only selective process. The aim of selective program is to transfer the selective achievements from the active part of the breed to the whole herd of the population. In terms of implementation of large-scale selection system there is a problem of optimal amount of lines in the population of separate breeds. There are three lines and three genealogical groups in the Holstein breed (more than 10 ml cows). Due to F.F. Eysner (1986), to conduct effective selective work in the breeds of narrow natural habitat of distribution it is necessary to have 6-8 lines and for wide natural habitat – not less than 15–20 lines. Results. Reduction of factory lines and genealogical groups in Holstein breed leads to reduction of genetic variety and unsystematic use of sperm of male-leaders results in the family mating. Moreover if males with their own genes and genes of their cubs in genotype are used, the frequency of genetic anomalies in pedigree population increases very fast. Conclusions. The work with the use of male-producers must be conducted under permanent genetic control. All males and their female cubs selected for the experiment must be identified according to the factors of blood types. Besides, male-producer leaders must be checked to determine if they have anomalies in chromosomes and lethal factors in perspective. Intensive use of male-improvers, estimated by their cubs is the base for effective large-scale selection of dairy cattle breed. Keywords: large-scale selection, breed, line, genotype, chromosome anomalies.

On the systematic method of conditional control program execution by a PLC

The paper presents an original idea of the selective control program execution that allows significant response time reduction. The exhaustive analysis of the PLC program performance is given. An analytic approach explains the idea of the selective control program evaluation and gives the requirements for its feasibility. There is presented a systematic and formal method of program analysis based on a data flow graph approach. The method generates acyclic graph from the control program that is subject of optimization, variable allocation and instruction generation. The graph approach allows determining variables dependencies and task partitioning required by selective program execution. The method utilize the hardware supported variable changes detection. It is transparent for system operation and enables evaluation of blocks that require update.