• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.201-204
• /
• 2002

Although the reuse of the cached data for scrolling the map reduces the amount of passed data between client and server, it needs the conversions of data coordinates, selective deletion of objects and cache compaction at client. The conversion is time intensive operation due to limited resources of mobile phones such as low computing power, small memory. Therefore, for the efficient map control in the vector map service based mobile phone, it is necessary to study the method for reducing wireless network bandwidth and for overwhelming the limited resources of mobile phone as well. This paper proposes the methods for caching pre-received spatial objects in client-server systems for mobile GIS. We also analyze the strengths and drawbacks between the reuse of cached data and transmission of raw data respectively.

• Journal of Microbiology and Biotechnology
• /
• v.10 no.5
• /
• pp.690-693
• /
• 2000

Efficient intron deletion with the correct splicing of the two exons of the human proinsulin gene was accomplished by a novel stepwise method using genomic DNA [5]. The two exons were separately amplified in two steps, using the second step primers that incorporated additional bases complementary to the other exon. The fragments were combined in a third PCR reaction. Cloning and sequencing of the PCR product demonstrated the correct splicing of the two exons. Expression studies, using the pET9a vector, revealed a protein band with the correct size with respect to human proinsulin as confirmed by SDS-PAGe and Western blot. Proinsulin concentration was estimated to be around 200 mg per liter culture, expressed as inclusion bodies. Protein secretion to the culture medium and periplasmic space was achieved by cloning in the pEZZ18 vector.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1240-1242
• /
• 1996

In a still mill, the effective surface defect inspection algorithm is necessary. For this purpose, this paper proposed the preprocessing algorithm for surface defect inspection of cold mill strip. This consists of live steps. They are edge detection, binarizing, noise deletion, combining of fragmented defect and selecting the largest defect. Especially, binarizing is a critical problem. Bemuse the performance of the preprocessing is largely depend on the binarized image. So, we develope the adaptive thresholding method, which is multilevel thresholding. The thresholding value is varied according to the mean graylevel value of each test image. To investigate the performance of the proposed algorithm, we classified the detected defect using neural network. The test image is 20 defect images captured at German Sick Co. This algorithm is proved to have good property in cold mill strip surface inspection.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.372-380
• /
• 2003

Temporal databases support time-varying events so that conventional aggregate functions are extended to be processed with time for temporal aggregate functions. In the previous approach, it is done repeatedly to find time intervals and is calculated the result of each interval whenever target events are different. This paper proposes a method which processes temporal aggregate function queries using time point sequence. We can make time point sequence storing the start time and the end time of events in temporal databases in advance. It is also needed to update time point sequence due to insertion or deletion of events in temporal databases. Because time point sequence maintains the information of time intervals, it is more efficient than the previous approach when temporal aggregate function queries are continuously requested, which have different target events.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.250-257
• /
• 2003

As the memory access time becomes slower relative to the fast processor speed, most systems use cache memory to reduce the gap. The cache performance has an increasingly large impact on the performance of algorithms. Blocking is the well known method to utilize cache and has shown good results in multiplying matrices and search trees like d-heap. But if we use blocking in the data structures which require rotation during insertion or deletion, the execution time increases as the data movements between blocks are necessary. In this paper, we have proposed the extended pairing heap algorithms using block node and shown by experiments that our structure is superior Also in case of using block node, we use less memory space as the number of pointers decreases.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.9
• /
• pp.35-42
• /
• 2018

In this paper, we propose an optimal streaming service method based on Hybrid CDN/P2P architecture. Recently, video streaming utilizes a CDN (Content Delivery Network) operation technique based on a Proxy Server, which is an end node located close to a user. However, since CDN has a fixed network traffic bandwidth and data information exchange among CDNs in the network is not smooth, it is difficult to guarantee traffic congestion and quality of image service. In the hybrid CDN/P2P network, a data selection technique is used to select only the data that is expected to be continuously requested among all the data in order to guarantee the QoS of the user who utilizes the limited bandwidth efficiently. In order to search user requested data, this technique effectively retrieves the storage information of the constituent nodes of CDN and P2P, and stores the new image information and calculates the deletion priority based on the request possibility as needed. Therefore, the streaming service scheme proposed in this paper can effectively improve the quality of the video streaming service on the network.

• Journal of Internet Computing and Services
• /
• v.21 no.6
• /
• pp.51-56
• /
• 2020

Cryptocurrencies, including Bitcoin, has decentralization, distribution and P2P properties unlike traditional currencies relies on trusted central party such as banks. All transactions are stored transparently and distributively, hence all participants can check the details of those transactions. Due to the properties of cryptographic hash function, deletion or modification of the stored transations is computationally not possible. However, cryptocurrencies only provide pseudonymity, not anonymity, which is provided by traditional currencies. Therefore many researches were conducted to provide anonymity to cryptocurrencies such as mix-based methods. In this paper, I will propose more efficient hybrid mix-based method for anonymity than previous mix-based one.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.145-152
• /
• 2022

Recently, interest in the precast concrete (PC) construction method has been increasing. The PC construction process consists of i) design, ii) production, iii) transportation, and iv) installation. A PC field manager at the site submits a shipment request form to the factory one to three days before the installation of the PC component. Numerous matters should be considered in writing a shipment request form. Incorrect shipment request forms may cause standby resources, waste of resources, premature work conclusion, or excessive work. These issues can lead to an increase in construction costs, replanning of PC component installation, or rework. In order to prevent such problems, PC component installation should be simulated based on the shipment request form. Accordingly, this study aims to identify factors influencing the operability of shipment request forms for PC construction. To this end, this study derived factors influencing i) initiation of the activity, ii) addition or deletion of activities, and iii) an increase or decrease in the activity execution time. As a result, this study identified flow, the features of PC components, condition of PC components, unloading location, installation location, input equipment and labor, number of anchors, number of supports, weather, strike, and accident. Further studies should verify the factors derived in this study based on focus group interviews.

• Korean Journal of Microbiology
• /
• v.27 no.1
• /
• pp.1-9
• /
• 1989

The locations of 5' ends as well as the splicing pattern of viral poly A(-) 19S RNA from monkey cells infected with SV40 were determined by a modification of primer extension method. The 5' end of this RNA mapped at the major cap site at nucleotide residue 325, used most frequently by SV40 late RNAs. The intron from nt.373 to nt.558 was removed as the ordinary cytoplasmic poly A(+) 19S RNA. The 3'end of this RNA was very heterogeneous and distributed over 1 kb upstream of polyadenylation site, as determined by S1 nuclease mapping. The reason for this normally initiated and spliced RNA to accumulate in the nucleus was investigated. In order to test whether the presence of unused 3' splice region on this RNA caused such subcellular distribution, cells were transfected with SV40 mutant KNA containing deletion around 3' splice site. The RNA deleted of 3' splice region accumulated mainly in the cytoplasm. This accumulation did not result from the increased stability of the RNA due to the deletion, since the wild type and mutant RNAs exhibited similar half lives after chase with actinomycin D. Therefore it is likely that the 19S spliced RNA is hindered from being transported into the cytoplasm due to some pre-splicing complexes formed at the unused 3' splice site.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1680-1686
• /
• 1996

The deterministic update method of intensional predicates in a parallel deductive database that deductive database is distributed in a parallel computer architecture in needed. Using updated data from the deterministic update method, a strategy for parallel evaluation of intensional predicates is required. The paper is concerned with an approach to updating parallel deductive database in which very insertion or deletion can be performed in a deterministic way, and an extended parallel semi-naive evaluation algorithm in a parallel computer architecture. After presenting an approach to updating intensional predicates and strategy for parallel evaluation, its implementation is discussed. A parallel deductive database consists of the set of facts being the extensional database and the set of rules being the intensional database. We assume that these sets are distributed in each processor, research how to update intensional predicates and evaluate using the update method. The parallel architecture for the deductive database consists of a set of processors and a message passing network to interconnect these processors.