• Microbiology and Biotechnology Letters
• /
• v.30 no.4
• /
• pp.298-304
• /
• 2002

A family shuffling associating PCR-based and in vitro recombination and expression in Escherichia coli cdd mutant was carried out. Two cdd genes encoding cytidine deaminases (CDase) from thermophilic Bacillus caldolyticus and B. stearothermophilus were shuffled. Around 150 viable mutant colonies screened on AB minimal medium without uracil by E. coli cdd complementation were selected for cytidine deaminase assay and 4 candidates (SH1067, SH1077, SH1086, and SH1118) were chosen for the detailed study. The nucleotide sequence analyses of 4 selected mutants revealed that they have several point mutations and recombinations. Surprisingly, the SH 1067 showed 770 fold more specific CDase activity at $80^{\circ}C$ than that of T101 from parental B. stearothermophilus.

• Journal of Advanced Navigation Technology
• /
• v.16 no.4
• /
• pp.697-702
• /
• 2012

With an elevator supply and demand increases, It has been enlarged various requirements for the safety of the elevator. Elevator safety requirements can be the ability to respond to emergencies quickly. Recently, QR code was attached to all elevator for the elevator safety and it is established by law for the Elevator rescue work. And also the elevator system is seeking to utilize more secure elevator with mandatory installation of CCTV and direct call devices. However, CCTV and direct call service is operating on an individual method and it has not been proposed integrated model. In this paper, we propose the safety elevator integration model with CCTV, direct call service and remote control based on smart phone. Using the proposed model, we can be improved the efficiency of maintenance and ability of prompt action in the event of a disaster.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.592-600
• /
• 2018

As the field of robots is evolving to intelligent robots that can replace even humans' mental or emotional labor, 'robot ethics' needed in relationship between humans and robots is becoming a crucial issue these days. The purpose of this study is to consider the ethics of robots and humans that is essential in this post-human age. It will deal with the followings as the main contents. First, with the cases of developing ethics software intended to make robots practice ethics, the authors begin this research being conscious about the matter of whether robots can really judge what is right or wrong only with the ethics codes entered forcibly. Second, regarding robot ethics, we should consider unethicality that might arise from learning data internalizing human biasness and also reflect ethical differences between countries or between cultures, that is, ethical relativism. Third, robot ethics should not be just about ethics codes intended for robots but reflect the new concept of 'human ethics' that allows humans and robots to coevolve.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.3
• /
• pp.41-48
• /
• 2017

Recently, there has been a lot of ongoing research regarding financial transactions and payments due to the emergence of financial technology (FinTech). Payments have been processed through cash and credit cards, and payment methods have been simplified and are more convenient, with mobile payment via mobile cards and mobile phones. This study offers a new mobile payment method by using a mobile phone instead of a card reader or terminal. For payments, authentication is processed with the user's biometrics and a built-in fingerprint scanner, and the payment is processed after receiving an authentication code issued by the authorizing institution to confirm the user's identity. User biometrics and payment information is secured from any kind of malicious hacker by saving it in a Fast Identity Online (FIDO) Trusted Execution Environment (TEE) section in a smartphone. Regarding key security, every key is securely created in the FIDO TEE section, providing secure mobile payment by neutralizing various malicious attacks, including sniffing and the man-in-the middle attack.

• KIISE Transactions on Computing Practices
• /
• v.20 no.9
• /
• pp.519-524
• /
• 2014

The operating systems in the system architecture, which is integrated several applications and modular electronic devices in the same computing device, demand partitioning technology for safety. Thus, operation system requires partition scheduler for partition scheduling. When we design partition scheduler in embedded system, which has small memory and low performance, such as space system, we must consider not only performance but also memory. In this paper, we introduces a linux-based memory efficient partition scheduler using partition bitmap. This partition scheduler demands small memory space and produce low partition switching overhead. The prototype was executed on a LEON4 processor, which is the Next Generation Multicore Processor (NGMP) in the space sector. In evaluation, this prototype shows accuracy, additional memory space and low partition switching overhead.

• Nuclear Engineering and Technology
• /
• v.19 no.4
• /
• pp.317-324
• /
• 1987

The purpose of this work is to present a spatial neutron kinetics computational scheme for the analysis of space-dependent transients like rod ejection accident of pressurized water reactors. In this work modified Borresen's 1.5 group coarse mesh scheme was formulated for the neutronic computation of the space-dependent transients and applied to the analysis of hypothetical rod ejection accident of KNU no. 1 PWR core at BOC, HZP. The computational accuracy of the modified Borresen's scheme is examined by comparing calculations for core power and control rod worths with startup core physics test results. Effects of such parameters as ejected rod worths and number of delayed neution group ell transient results as well as computational efficiency are also examined. OB this basis it is suggested that the modified Borresen's method is a useful scheme for the analysis of spatial neutron transients of PWR's.

• The Journal of Society for e-Business Studies
• /
• v.12 no.4
• /
• pp.1-15
• /
• 2007

Traceability links are logical links between individual requirements and other system elements such as architecture descriptions, source code, and test cases. These are useful for requirements change impact analysis, requirements conflict analysis, and requirements consistency checking. However, establishing and maintaining traceability links places a big burden since complex systems have especially yield an enormous number of various artifacts. We propose a feature-oriented requirements tracing method to manage requirements with cost benefit analysis, including value consideration and intermediate catalysis using features. Our approach offers two contributions to the study of requirements tracing: (1)We introduce feature modeling as intermediate catalysis to generate traceability links between user requirements and implementation artifacts. (2)We provide value consideration with cost and efforts to identify traceability links based on prioritized requirements, thus assigning a granularity level to each feature. In this paper, we especially present the results of a case study which is carried out in Apartment Ubiquitous Platform to integrate and connect home services in an apartment complex in details.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.35-45
• /
• 2000

The vertex-based boundary encoding scheme is widely used in object-based video coding area and computer graphics due to its scalability with natural looking approximation. Existing single framebased vertex encoding algorithm is not efficient for temporally correlated video sequences because it does not remove temporal redundancy. In the proposed method, a vertex point is selected from not only the boundary points of the current frame but also the vertex points of the previous frame to remove temporal redundancy of shape information in video sequences. The problem of selecting optimal vertex points is modeled as finding shortest path in the directed acyclic graph with weight The boundary is approximated by a polygon which can be encoded with the smallest number of bits for maximum distortion. The temporal redundancy between two successive frames is efficiently removed with the proposed scheme, resulting in lower bit-rate than the conventional algorithms.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.6
• /
• pp.42-49
• /
• 2000

In this paper, we propose the parallel ternary logic circuit design algorithm to DCG Property with 2$^n$ nodes. To increase circuit integration, one of the promising approaches is the use of multiple-valued logic(MVL). It can be useful methods for the realization of compact integrated circuit, the improvement of high velocity signal processing using parallel signal transmission and the circuit design algorithm to optimize and satisfy the circuit property. It is all useful method to implement high density integrated circuit. In this paper, we introduce matrix equation to satisfy given DCG with 2$^n$ nodes, and propose the parallel ternary logic circuit design process to circuit design algorithm. Also, we propose code assignment algorithm to satisfy for the given DCG property. According to the simulation result of proposed circuit design algorithm, it have the following advantage ； reduction of the circuit signal lines, computation time and costs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4B
• /
• pp.397-402
• /
• 2004

In this paper, we have designed and simulated a new file transmission method. This method restricts memory copy and context switching happened in traditional file transmission. This method shows an improved performance than traditional method in network environment. When the UNIX/LINUX system that uses the existing file transfer technique transmits a packet to the remote system, a memory copy between the user and kernel space occurs over twice at least. Memory copy between the user and kernel space increase a file transmission time and the number of context switching. As a result, the existing file transfer technique has a problem of deteriorating the performance of file transmission. We propose a new algorithm for solving these problems. It doesn't perform memory copy between the user and kernel space. Hence, the number of memory copy and context switching is limited to the minimum. We have modified the network related source code of LINUX kernel 2.6.0 to analyzing the performance of proposed algorithm and implement new network system calls.