• Journal of The Korean Association For Science Education
• /
• v.15 no.3
• /
• pp.332-348
• /
• 1995

The use of attitude as a psychological concepts dates back to 1918(Thomas and Znaniecki). Assessment of attitudes has been conducted by a number of researchers since then in a wide range of contexts: religion, government, industry, community interrelations, and education; and sociology and psychology. In science, the number of research summaries and meta-analyses points to the significance of the concept of attitude toward science. However, in spite of the wide spread use of attitude assessment in science, many of the existing instruments have severe limitations. Those limitations serve as the rationale for the construction of a new instrument to assess attitudes toward science The term "attitude" and "science" are somewhat ambiguous, taking on different meanings for different people in different contexts. Very often an assessment includes several dimensions of attitude and, therefore, provides no clear idea of what was really measured. As a result there is no consistency with respect to the construct among attitude instruments. To clarify this issue, Gauld(1982), Munby(1983a, 1983b), Blosser(1984) and Haladyna and Shaughnessy(1982) offer some guiding descriptions. Attitude as it relates to science is divided into two areas-scientific attitude and attitude toward science. Scientific attitude refers to a particular approach a person assumes for solving problems, for assessing ideas and information, and for making decisions. It includes such scientific methods and predispositions as objectivity, suspended judgement, critical evaluation, and skepticism. Munby(1983a, 1983b) characterized scientific attitude as thinking as scientists do, that is, acting on evidence in a disciplined way. Attitude toward science. on the other hand, may address scientific attitudes, scientists, scientific careers, methods of teaching science, scientific interests, parts of curriculum, or the subject of science in the classroom (Blosser,1984). It may refer to belief about processes, theoretical products, technological products, or the science-technology relationship (Munby, 1983).

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.2
• /
• pp.144-150
• /
• 1990

This paper describes radix-4 Fast Fourier Transform (FFT) Processor designed with the new twice perfect shuffle developed from a perfect shuffle used in radix-2 FFT algorithm. The FFT Processor consists of a butterfly arithmetic circuit, address generators for input, output and coefficient, input and output registers and controller. Also, it requires the external ROM for storage of coefficient and RAM for input and output. The butterfly circuit includes 12 bit-serial ($16{\times}8$) multipliers, adders, subtractors and delay shift registers. Operating on 25 MHz two phase clock, this processor can compute 256 point FFT in 6168 clocks, i.e. 247 us and provides flexibility by allowing the user to select any size among 4,16,64,and256points. Being fabricated with 2-um double metal CMOS process, it includes about 28000 transistors and 55 pads in $8.0{\times}8.2mm^2$area.

• The KIPS Transactions:PartC
• /
• v.13C no.1 s.104
• /
• pp.121-128
• /
• 2006

In Mobile IPv6, a handover latency is an important issue. To reduce the handover latency, mipshop working group in IETF has studied the fast handover(FMIPv6) which creates and verifies a new care-of address(NCoA) in advance before a layer 2 handover resulting in reduced handover latency. Even in FMIPv6, the NCoA must be registered in a home agent(HA). This registration still creates a significant amount of delay. To reduce registration latency, we propose a tentative and early binding update(TEBU) scheme that the NCoA is registered in the HA in advance during the layer 2 handover based on FMIPv6. We use cost analysis for the performance evaluation. As a result, we found that the TEBU scheme guarantees lower handover latency than FMIPv6 as much as approximately 21%.

• Journal of Service Research and Studies
• /
• v.2 no.1
• /
• pp.61-68
• /
• 2012

Much technologies building cloud computing environment and supporting sevices on the cloud computing have been developing. Through the environment, accessing new services and sharing knowledge become easy. So far, they have just focused on companies which can support services and people who can use those services. In other words, the environment and models for cloud computing are the most important issue. However, the environment changes rapidly, mobile devices that are connected with each other not only will replace the computing environment based on desktop, but also can create Big data. Therefore, technologies and models are need to follow the trend including mobile based cloud computing environment. In this paper, we explain the cloud computing technologies and trend. Also we address Machine to Machine(M2M) technology and Web of things(WoT) in order to apply those into the cloud computing environment because these two concepts will enhance effectiveness and service reusability in the coming days.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.363-372
• /
• 2009

For large scale VOD service, cluster servers are spotlighted to their high performance and low cost. A cluster server usually consists of a front-end node and multiple back-end nodes. Though increasing the number of back-end nodes can result in the more QoS streams for clients, the possibility of failures in back-end nodes is proportionally increased. The failure causes not only the stop of all streaming service but also the loss of the current playing positions. In this paper, when a back-end node becomes a failed state, the recovery mechanisms are studied to support the unceasing streaming service. For the actual VOD service environment, we implement a cluster-based VOD servers composed of general PCs and adopt the parallel processing for MPEG movies. From the implemented VOD server, a video block recovery mechanism is designed on parity algorithms. However, without considering the architecture of cluster-based VOD server, the application of the basic technique causes the performance bottleneck of the internal network for recovery and also results in the inefficiency CPU usage of back-end nodes. To address these problems, we propose a new failure recovery mechanism based on the pipeline computing concept.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.6
• /
• pp.448-459
• /
• 2004

Interoperability is an important requirement of portable storage devices that are used to exchange and share data among diverse hosts. However, the required interoperability cannot be provided if different host systems use different file systems. To address this problem, we propose a new type of storage device called FSOC(File System On a Chip) that contains the file system within the storage device. In this paper, we give an example of the design and implementation of a flash memory-based FSOC and propose the performance models of the conventional storage device and the FSOC. We also analyze the performance characteristics of the conventional storage device and the FSOC based on the proposed performance models, and provide several experimental results using real applications that validate the performance models.

• The KIPS Transactions:PartA
• /
• v.13A no.4 s.101
• /
• pp.305-316
• /
• 2006

Current rendering processors are organized mainly to process a triangle as fast as possible and recently parallel 3D rendering processors, which can process multiple triangles in parallel with multiple rasterizers, begin to appear. For high performance in processing triangles, it is desirable for each rasterizer have its own local pixel cache. However, the consistency problem may occur in accessing the data at the same address simultaneously by more than one rasterizer. In this paper, we propose a parallel rendering processor architecture resolving such consistency problem effectively. Moreover, the proposed architecture reduces the latency due to a pixel cache miss significantly. For the above two goals, effective memory organizations including a new pixel cache architecture are presented. The experimental results show that the proposed architecture achieves almost linear speedup at best case even in sixteen rasterizers.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.03a
• /
• pp.163-181
• /
• 1997

This dissertation provides a theroetic study on the network security in general , the firewall in particular . In fact, the firewall has been recognized as a very promising option to obtain the security in the real world network environment . The dissertation provides a thorough theoretic investigation on the various problems raised in the computer network, and also explores a methodology of the security against IP spoofing. Moreover, it investigates a systematic procedure to make analysis plans of the firewall configuration. Based on the above investigation and analysis , this dissertation provides two approaches to network security, which address a number of issues both at the network and at application level. At the network level. a new methdo is proposed which uses packet filtering based on the analysis of the counter plot about the screen router. On the other hand at the application level, a novel method is exlored which employs security software , Firewall-1, on Bastion host. To demonstrate the feasibility and the effectiveness of the proposed methodologes, a prototype implementation is made. The experiment result shows that the screen router employing the proposesed anti-IP spoofing method at the network level is effective enough for the system to remain secure without being invaded by any illegarl packets entering from external hackers. Meanwhile , at the application level. the proposed software approach employing Firewall -1 is proved to be robust enough to provent hackings from the outer point to point protocol connection. Theoretically, it is not possible to provide complete secuirty to the network system, because the network security involove a number of issues raised from low level network equipments form high level network protocol. The result in this dissertation provides a very promising solution to network security due to its high efficiency of the implementation and superb protectiveness from a variety of hacking.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.566-575
• /
• 2009

Clinical Data Interchange Standards Consortium (CDISC) developed global and platform-independent data standards to improve ineffective processes of clinical trial studies. Regardless of its objective toward global cooperation, the current version of the CDISC standard cannot describe clinical trial data in various languages for multi-national investigators or reviewers. This problem applies not only to tabulated datasets in Study Data Tabulation Model (SDTM) but also to extensible markup language representation of the datasets in Operational Data Model (ODM) instances. In order to address this issue, we propose to extend the current version of SDTM and ODM to collect clinical data for multi-national clinical trials. SDTM needs to have new special-purpose domain for multi-language representation purpose. Additionally, ODM is recommended to extend its XML schema using subtyping or type inheritance mechanism respectively. Our extension of SDTM and ODM enable to represent any granule of study data tabulation model or XML data entities to describe in efficient languages. This result will contribute to collect multi-language data easily for multi-national clinical trials.

• International Journal of Advanced Culture Technology
• /
• v.6 no.4
• /
• pp.275-283
• /
• 2018

Cancer show distinct pattern of gene expression when it is compared to normal. This difference results malignant characteristic of cancer. Many cancer drugs are targeting this difference so that it can selectively kill cancer cells. One of the recent demand for personalized treating cancer is retrieving normal tissue from a patient so that the gene expression difference between cancer and normal be assessed. However, in most clinical situation it is hard to retrieve normal tissue from a patient. This is because biopsy of normal tissues may cause damage to the organ function or a risk of infection or side effect what a patient to take. Thus, there is a challenge to estimate normal cell's gene expression where cancers are originated from without taking additional biopsy. In this paper, we propose in-silico based prediction of normal cell's gene expression from gene expression data of a tumor sample. We call this challenge as reverting the cancer into normal. We divided this challenge into two parts. The first part is making a generator that is able to fool a pretrained discriminator. Pretrained discriminator is from the training of public data (9,601 cancers, 7,240 normals) which shows 0.997 of accuracy to discriminate if a given gene expression pattern is cancer or normal. Deceiving this pretrained discriminator means our method is capable of generating very normal-like gene expression data. The second part of the challenge is to address whether generated normal is similar to true reverse form of the input cancer data. We used, cycle-consistent adversarial networks to approach our challenges, since this network is capable of translating one domain to the other while maintaining original domain's feature and at the same time adding the new domain's feature. We evaluated that, if we put cancer data into a cycle-consistent adversarial network, it could retain most of the information from the input (cancer) and at the same time change the data into normal. We also evaluated if this generated gene expression of normal tissue would be the biological reverse form of the gene expression of cancer used as an input.