• The Korean Journal of Archival Studies
• /
• no.5
• /
• pp.111-148
• /
• 2002

Digitalization of public administration information shall be accelerated more. When information exists both in the form of electronic and paper record, even the disclosure of paper record make it possible the access to public administration information itself, but there may some needs for the disclosure of electronic record in applicant's situation. Similarly, when only electronic record exists, there may be some problem about whether to disclose the record as print-out or as being electronic format itself. Thus, the method and format of disclose are very sensitive issues, and it is very important to clarify who has the competence to decide the method and format of disclosure, applicant or the public agency. In making any record available to an applicant under the EFOIA in America, the public agency shall provide the record in any form or format requested by the applicant, if the record is readily reproducible by the agency in that form or format. And for the convenience of the applicant with sensory disability, the AIA in Canada also permits the right to access to information in an alternative format. It is desirable also in our country that disclosure of information is done by public agencies in the format that applicant wants, as possible. In the meantime, we should consider the costs and technological restrictions corresponding to the change of format of information to the format that applicant specifies. In the case of electronic record, efforts required for searching cause some hard problems. Information disclosure system requires disclosure of record that exists at the demand point, and creation of new record that does not exist at that them is not required on the public agency. For the search of electronic information, we need some code or program. So, if we evaluate that act of coding or programming as creation of new record, demand on disclosure of electronic record becomes impossible, in fact. Therefore, when we include electronic record as the object of information disclosure system, we need to clarify the degree of reasonable efforts for searching the information included in that record, as long as possible, although it is very difficult problem. Also, we should consider the way to make it permitted to demand the disclosure of electronic record by FAX or E-mail. Disclosure of electronic record itself by E-mail is not generalized yet, even in America or Canada. There are many technological and legal problems to solve, before permitting or enforcing the disclosure of electronic record by E-mail. But, it is desirable to expand the method of disclosure to including disclosure by E-mail in possible spheres. Also, as well as disclosure on demands, we need to expand electronic access to information, so far as possible, in the process of information offer.

• The Journal of the Korea Contents Association
• /
• v.21 no.5
• /
• pp.488-498
• /
• 2021

This study applied Flipped Learning teaching and learning method to Basics Cooking Practice Subject using YouTube. The purpose of this study is to investigate whether the curriculum is properly progressing by grasping the effects of before and after learning and analyzing learners' subjectivity through the learning process. The investigation period was conducted from August 01, 2020 to September 10, 2020. According to the research design of Q Methodology, it was divided into five stages: Q sample selection, P sample selection, Q sorting, coding and recruiting, conclusion and discussion. As a result of the analysis, the first type (N=5): Prior Learning effect, the second type (N=7): Simulation practice effect, and the third type (N=3): self-efficacy effect. As a result, by applying the flipped learning teaching method of the Basics Cooking Practice Subject using YouTube, positive effects such as inducing interest in the class and increasing confidence were found in active learners, but some learners lacked understanding of the system of the class operation method. However, the lack of number of training sessions compared to other subjects is considered to be a solution to be solved later.

• Journal of Animal Science and Technology
• /
• v.50 no.6
• /
• pp.753-762
• /
• 2008

The primers for RT-PCR and RACE-PCR were designed by aligning the pig genomic sequence and the human complement factor B(CFB) coding sequence(CDS) from the GenBank. Each PCR product was amplified in pig cDNA and sequencing was carried out. The CDS length of pig CFB gene was determined to be 2298 bp. In addition, the pig CDS was more longer than human and mouse orthologs because of insertion and deletion. The identities of porcine nucleotide sequences with those of human and mice were 84% and 80%, and the identities of amino acids were 79% to 77%, respectively. Three complement control protein(CCP) domains, one Von Willebrand factor A(VWFA) domain and a serine protease domain, that are revealed typically in mammals, were found in the pig CFB gene. Based on the CDSs determined, the primers were designed in intron regions for amplification of entire length of exons. In amplification and direct sequencing with genomic DNAs of six pig breeds, three cSNPs(coding single nucleotide polymorphisms) were identified and verified as missense mutations. Using the Multiplex-ARMS method, we genotyped and verified the mutations identified from direct sequencing. To demonstrate recrudescence, we performed both direct sequencing and Multiplex-ARMS with two randomly selected DNA samples. The genotype of each sample exhibited the same results using both methods. Therefore, three cSNPs were identified from pig CFB gene and that can be used for haplotype analysis of the swine leukocyte antigen(SLA) class III region. Moreover, the results indicate that the Multiplex-ARMS method should be powerful for genotyping of genes in the SLA region.

• Radiation Oncology Journal
• /
• v.17 no.2
• /
• pp.151-157
• /
• 1999

Purpose : By sequencing the Erpressed Sequence Tags of human 걸ermal papilla CDNA library, we identified a clone named K872 of which the expression decreased during differentiation of HL6O cell line. Materials and Methods : K872 plasmid DNA was isolated according to QIA plasmid extraction kit (Qiagen GmbH, Germany). The nucleotide sequencing was performed by Sanger's method with K872 plasmid DNA. The most updated GenBank EMBL necleic acid banks were searched through the internet by using BLAST (Basic Local Alignment Search Tools) program. Nothern bots were performed using RNA isolated from various human tissues and cancer cell lines. The gene expression of the fusion protein was achieved by His-Patch Thiofusicn expression system and the protein product was identified on SDS-PAGE. Results : K872 clone is 1006 nucleotides long, and has a coding region of 675 nucleotides and a 3' non-coding region of 280 nucleotides. The presumed open reading frame starting at the 5' terminus of K872 encodes 226 amino acids, including the initiation methionine residue. The amino acid sequence deduced from the open reading frame of K872 shares $70\%$, identity with that of rat glutathione 5-transferase kappa 1 (rGSTKl). The transcripts were expressed in a variety of human tissues and cancer cells. The levels of transcript were relatively high in those tissues such as heart, skeletal muscle, and peripheral blood leukocyte. It is noteworthy that K872 was found to be abundantly expressed in coloreetal cancer and melanoma cell lines. Conclusion : Homology search result suggests that K872 clone is the human homolog of the rGSTK1 which is known to be involved in the resistance of cytotoxic therapy. We propose that meticulous functional analysis should be followed to confirm that.

• Journal of Digital Convergence
• /
• v.18 no.6
• /
• pp.9-16
• /
• 2020

The purpose of this study is to understand the public needs for AI education actively promoted and supported by the current government. In doing so, 11 metropolitan news articles and Twitter posts regarding AI education that have been posted from January 1, 2018 to December 31, 2019 were collected. Then, word frequency analysis using TF(Term Frequency) method and LDA(Latent Dirichlet Allocation) method of topic modeling analysis were conducted. The topics of the news articles turn out to be a macroscopic policy support such as 'training female manpower in the AI field' and 'curriculum reform of university and K-12', whereas the topics of twitter delineate more detailed social perception on future society, such as future competencies and pedagogical methods, including 'coexistence with intelligent robots', 'coding education', and 'humane education competence development'. The findings are expected to be used to suggest the implications for the composition and management of AI curriculum as well as the basic framework of human resources development in the future industry.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.54-63
• /
• 2000

We present a multi-resolution block matching algorithm (BMA) for fast motion estimation At the coarsest level, a motion vector (MV) having minimum matching error is chosen via a full search, and a MV with minimum matching error is concurrently found among the MVs of the spatially adjacent blocks Here, to examine the spatial MVs accurately, we propose an efficient method for searching full resolution MV s without MV quantization even at the coarsest level The chosen two MV s are used as the initial search centers at the middle level At the middle level, the local search is performed within much smaller search area around each search center If the method used at the coarsest level is adopted here, the local searches can be done at integer-pel accuracy A MV having minimum matching error is selected within the local search areas, and then the final level search is performed around this initial search center Since the local searches are performed at integer-pel accuracy at the middle level, the local search at the finest level does not take an effect on the overall performance So we can skip the final level search without performance degradation, thereby the search speed increases Simulation results show that in comparison with full search BMA, the proposed BMA without the final level search achieves a speed-up factor over 200 with minor PSNR degradation of 02dB at most, under a normal MPEG2 coding environment Furthermore, our scheme IS also suitable for hardware implementation due to regular data-flow.

• Journal of Gifted/Talented Education
• /
• v.27 no.1
• /
• pp.17-35
• /
• 2017

The purpose of this study is to analyze the learning objectives characteristics of educational programs of centers for the university affiliated science-gifted education using semantic network analysis, we examined the applicability of semantic network analysis in analyzing learning objectives by comparing the results of analysis with Bloom's revised taxonomy. For this purpose, 702 learning objectives presented in 169 science subjects were selected as subjects to be analyzed. After classifying and coding the learning objectives according to Bloom's revised taxonomy, we conducted a semantic network analysis to investigate the relationship between learning objectives. The results of the analysis are as follows. First, we looked at the number of learning objectives used for each subject, and about 3 elementary school levels and about 6 middle school levels were used. Second, the knowledge dimension such as 'factual and conceptual knowledge' and cognitive process dimension such as 'remember', 'understand', and 'create' was high regardless of the research method and school level. Third, the results of analysis based on the weighting through the semantic network analysis method, the elementary school level emphasize activities th be applied to the actual experimental process through learning about scientific facts, while the middle school level emphasize the understanding of scientific facts and concepts themselves. As a result, it can be seen that the semantic network analysis can analyze characteristics of various learning objectives rather than the conventional simple statistical analysis.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.11
• /
• pp.73-81
• /
• 2016

In general, infrared images have less sharpness and image details than visible images. So, the prior image upscaling methods are not effective in the infrared images. In order to solve this problem, this paper proposes an algorithm which initially up-scales an input infrared (IR) image by using adaptive dynamic range encoding (ADRC)-based super-resolution (SR) method, and then fuses the result with the corresponding visible images. The proposed algorithm consists of a up-scaling phase and a fusion phase. First, an input IR image is up-scaled by the proposed ADRC-based SR algorithm. In the dictionary learning stage of this up-scaling phase, so-called 'pre-emphasis' processing is applied to training-purpose high-resolution images, hence better sharpness is achieved. In the following fusion phase, high-frequency information is extracted from the visible image corresponding to the IR image, and it is adaptively weighted according to the complexity of the IR image. Finally, a up-scaled IR image is obtained by adding the processed high-frequency information to the up-scaled IR image. The experimental results show than the proposed algorithm provides better results than the state-of-the-art SR, i.e., anchored neighborhood regression (A+) algorithm. For example, in terms of just noticeable blur (JNB), the proposed algorithm shows higher value by 0.2184 than the A+. Also, the proposed algorithm outperforms the previous works even in terms of subjective visual quality.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.1 s.13
• /
• pp.25-37
• /
• 2005

Recently, with the development of wireless communications and mobile computing, interest about mobile computing is rising. Mobile computing can be regarded as an environment where a user carries mobile devices, such as a PDA or a notebook, and shares resources with a server computer via wireless communications. A mobile database refers to a database which is used in these mobile devices. The mobile database can be used in the fields of insurance business, banking business, medical treatment, and so on. Especially, LBS(Location Based Service) which utilizes location information of users becomes an essential field of mobile computing. In order to support LBS in the mobile environment, there must be an Embedded Spatial MMDBMS(Main-Memory Database Management System) that can efficiently manage large spatial data in spatial mobile devices. Therefore, in this paper, we designed and implemented the Embedded Spatial MMDBMS, extended from the HSQLDB which is an existing MMDBMS for PC, to manage spatial data efficiently in spatial mobile devices. The Embedded Spatial MMDBMS adopted the spatial data model proposed by ISO(International Organization for Standardization), provided the arithmetic coding method that is suitable for spatial data, and supported the efficient spatial index which uses the MBR compression and hashing method suitable for spatial mobile devices. In addition, the system offered the spatial data display capability in low-performance processors of spatial mobile devices and supported the data caching and synchronization capability for performance improvement of spatial data import/export between the Embedded Spatial MMDBMS and the GIS server.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.129-137
• /
• 2001

Matching pursuit algorithm was successfully demonstrated useful in low bit-rate video coding, However, one of the practical concerns related to applying the matching pursuit algorithm to application is its massive computation required for finding bases whose weighted sum best approximates the given input image. The main contribution of this paper is that we provide a new method that can drastically reduce the computational load without any degradation of image quality. Its main idea is based on reducing the number of inner product calculation required for finding best bases because the complexity of matching pursuit algorithm is due to the exhaustive local inner product calculation. As the first step, we compute a matrix which is the 1-D inner product of the given motion-compensated error input image with the 1-D vertical Gabor functions using the separable property of Gabor bases. In the second step, we calculate length of each vector in the matrix that corresponds to 1-D horizontal Gabor function, and compare the length with the current maximum absolute inner product value so far. According to the result of this comparison, one can decide whether or not to calculate the inner product. Since most of them do not need to calculate the inner product value, one can significantly reduce the computational load. Experimental results show that proposed method reduces about 70% of inner product calculation compared to the Neff's fast algorithm without any degradation of image quality.