• Applied Microscopy
• /
• 제29권3호
• /
• pp.303-313
• /
• 1999

In this paper, five kinds of neurosecretory cells-light green (LG) cell, dark green (DG) cell, caudo-dorsal (CD) cell, blue green (BG) cell, and yellow (Y) cell- and neuropils in the cerebral ganglion of the African giant snail, Achatina fulica, were observed with an electron microscope. The following results were obtained. The LG cells are circular or ovoid in shape, and about $60{\mu}m$ in size. The nucleus and cytoplasm of the LG cell look light due to their electron-low density. Large granular chromatins are evenly developed in the karyolymph, where round nucleoli are also found. In the cytoplasm, electron -high dense round granules of $0.4{\mu}m$ in average size are crowded. The DG cells are ovoid in shape, and $50\sim20{\mu}m$ in size. These relatively electron-high dense cells were rarely found. In their cytoplasm, cell organelles such as rough endoplasmic reticulum and mitochondria are found together with electron -high dense round granules of $0.2{\mu}m$ in average size. The CD cells are ellipsoidal cells densely distributed in caudo-dorsal parts of the cerebral ganglion. They have large nuclei compared with the cytoplasm. The developed granular heterochromatins are observed in the karyolymph, and lots of small round granules of $0.12{\mu}m$ in average size in the cytoplasm. The 3G cells, rarely found around endoneurium of the cerebral ganglion, take the shapes of long ellipses. They look dark due to their electron -high density. In the cytoplasm, small round granules of $0.1{\mu}m$ in average size are found. The Y cells are the smallest among the neurosecretory cells($9\times6.6{\mu}m$ in size). They are found mostly between the medio-dorsal parts and the caudo-dorsal parts of the cerebral ganglion. In the cytoplasm, tiny round granules of $0.08{\mu}m$ in average size form a group. The neuropils are found in the middle of the cerebral ganglion. In the axon ending, round granules with electron -high density ($0.07\sim0.03{\mu}m$ in diameter) and lucent vesicles ($0.03{\mu}m$ in diameter) are found in large quantities. They are excreted in the state of exocytosome formed by the invagination of the limiting membrane of the axon ending.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• 제46권3호
• /
• pp.204-213
• /
• 2010

Test fishing was carried out using six kinds of different mesh sizes (20, 22, 24, 28, 35, 40mm) for springnet-pot to study bycatches according to the mesh size and catches survey was done for another one (mesh size : 22mm, entrance round : 350mm) in Geo-je & Tong-young waters of Korea. On the first sea experiment, it was thought that suitable mesh size of spring-net-pot catching conger-eel over 35cm with decreasing the catches of conger-eel (Conger myriaster) below 35cm was 24mm. On the second sea experiment, commercial catches were crabs (Charybdis bimaculata), octopus minor (Octopus variabilis) and others including conger-eel, and catches proportion was 60% of total catches weights. There was no big difference for the monthly catches. Self-consumption catches were 9 species including conger-eel below 35cm holding 50% of catches in the side of weights. There were 40% of bycatches for the catches weights and 63% for catches numbers in the 22mm mesh size of spring-net-pot having entrance round over 140mm. It showed that 50% of catches weights were discarded.

• Journal of information and communication convergence engineering
• /
• 제9권2호
• /
• pp.172-176
• /
• 2011

In the Gen-2 Q-algorithm, the values of weight C, which is the parameter for incrementing or decrementing the slot-count size, are not optimized in the standard. However, the standard suggests that the reader uses small values of C when the slot-count is large and larger values of C when the slot-count is small. In this case, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to select the weight based on the slot-count size of current query round. Through various computer simulations, it is demonstrated that the proposed scheme achieves more stable performances than Gen-2 Q-algorithm.

• Journal of the Korean Crystal Growth and Crystal Technology
• /
• 제13권1호
• /
• pp.46-50
• /
• 2003

This paper is a study on the method that it is bruting a peace of a rough diamond with keeping the maximum volume of it. When a diamond will be bruting, how to keep the maximum diameter of one is very important because of its own characteristics that include shapes, mineral characteristics, and so on. In the middle of bruting. concentrating on the work is also required because girdle will be break down. We tried to bruting with gaining maximum diameters of rough diamond. As the result. an octahedron is made into the round shape with size $6.75\times 6.75\times 3.83$ mm , a dodecahedron the cushion shape with size $6.86\times 6.86\times 3.95$mm , a fancy the marquise with size $6.92\times 3.78\times 3.46$mm . Their rates of loss are round brilliant 24.5%, cushion barion 15.5 %, and marquise 18.7 %, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5773-5784
• /
• 2019

ARIA is an involutory SPN block cipher. Its block size is 128-bit and the master key sizes are 128/192/256-bit, respectively. Accordingly, they are called ARIA-128/192/256. As we all know, ARIA is a Korean Standard block cipher nowadays. This paper focuses on the security of ARIA against impossible differential attack. We firstly construct a new 4-round impossible differential of ARIA. Furthermore, based on this impossible differential, a new 7-round impossible differential attack on ARIA-256 is proposed in our paper. This attack needs 2¹¹⁸ chosen plaintexts and 2²¹⁰ 7-round encryptions. Comparing with the previous best result, we improve both the data complexity and time complexity. To our knowledge, it is the best impossible differential attack on ARIA-256 so far.

• Journal of the Institute of Electronics and Information Engineers
• /
• 제50권1호
• /
• pp.196-204
• /
• 2013

In this paper, a scheduling algorithm is proposed for military satellite networks to improve QoS(Quality of Service) based on WDRR(Weighted Deficit Round Robin) method. When the packet size that has been queued to be larger, the proposed scheme DWDRR(Dynamic WDRR) method give appropriate additional quantum using EWMA(Exponentially Weighted Moving Average). To demonstrate an usefulness of proposed algorithm using OPNET modeler that built the simulation environment, reliability and real-time availability of the proposed algorithm is analyzed. The simulation results show an availability of proposed scheme in terms of reduce queuing delay and packet drop rate compared and analyzed the existing algorithms WRR(Weighted Round Robin), DRR(Deficit Round Robin) and WDRR with DWDRR.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권10호
• /
• pp.3815-3833
• /
• 2021

MILP-based automatic search is the most common method in analyzing the security of cryptographic algorithms. However, this method brings many issues such as low efficiency due to the large size of the model, and the difficulty in finding the contradiction of the impossible differential distinguisher. To analyze the security of ESF algorithm, this paper introduces a simplified MILP-based search model of the differential distinguisher by reducing constrains of XOR and S-box operations, and variables by combining cyclic shift with its adjacent operations. Also, a new method to find contradictions of the impossible differential distinguisher is proposed by introducing temporary variables, which can avoid wrong and miss selection of contradictions. Based on a 9-round impossible differential distinguisher, 15-round attack of ESF can be achieved by extending forward and backward 3-round in single-key setting. Compared with existing results, the exact lower bound of differential active S-boxes in single-key setting for 10-round ESF are improved. Also, 2108 9-round impossible differential distinguishers in single-key setting and 14 12-round impossible differential distinguishers in related-key setting are obtained. Especially, the round of the discovered impossible differential distinguisher in related-key setting is the highest, and compared with the previous results, this attack achieves the highest round number in single-key setting.

• Journal of Mechanical Science and Technology
• /
• 제16권6호
• /
• pp.785-798
• /
• 2002

A reliable analytic model that predicts the surface profile of the exit cross section of workpiece in round-oval (or oval-round) pass sequence is established. The presented model does not require any plasticity theory but needs the only geometric information on workpiece and roll groove. Formulation is based on the linear interpolation of the radius of curvature of an incoming workpiece and that of roll groove in the roll axis direction when the maximum spread of workpiece is known beforehand. The validity of the analytic model is examined by hot rod rolling experiment with the roll gap, specimen size, design parameter of oval groove and steel grade changed. Results revealed that the cross sectional shapes predicted by the model were in good agreement with those obtained experimentally. We found that the analytic model not only has simplicity and accuracy for practical usage but also saves a large amount of computational time in comparison with finite element method.

• Journal of information and communication convergence engineering
• /
• 제3권1호
• /
• pp.5-8
• /
• 2005

Dynamic cipher has the property that the key-size, the number of round, and the plaintext-size are scalable simultaneously. We present the method for designing secure Dynamic cipher against meet-in-the-middle attack and linear cryptanalysis. Also, we show that the differential cryptanalysis to Dynamic cipher is hard. In this paper we propose a new network called Dynamic network for symmetric block ciphers.

• Information and Communications Magazine
• /
• 제4권4호
• /
• pp.505-524
• /
• 1987

Nowaday all the countries of the world have studied the various problems caused in operating their own ports efficiently. Ship delay in the port is attributal to the inefficient operation in the navigation aids, the cargo handling, the storage and transfer facilities, and to the inefficient allocation of gangs or to a bad service for ships. Among these elements the allocation of gangs is the predominating factor in minimizing ship's turn round time. At present, in the case of Pusan Port. the labour union and stevedoring companies allocate gangs in every hatches of ships by a rule of thumb, just placing emphasis on minimizing ship's turn round time, without applying the principle of allocation during the cargo handling. Owing to this the efficiency of the cargo handling could not be expected to be maximized and this unsystematic operation result in supplying human resources of much unnecessary surplus gangs. Therefore in this paper the optimal size and allocation of gangs for minimizing the ship's turn round time is studied and formularized. For the determination of the priority for allocation the evaluation function, namely $F=PHi^{n}{\times}(W+H)$, can be obtained; where, PHI : Principal Hatch Index W : Total Cargo Weight represented in Gang-Shifts H : Total Number of Ship's hatches and also for the optimal size of gangs the average number of gang allocated per shift (Ng), namely Ng=W/PHI, is used. The proposed algorithm is applied to Pusan Port and its validity is verified.