• Journal of Digital Convergence
• /
• v.18 no.3
• /
• pp.133-138
• /
• 2020

The ability to use ICT is now a prerequisite for living in the information age, and digital literacy, which can access and utilize various digital information such as online banking, shopping, news, and health care, is more important. It is increasing. Accordingly, the social inequality, or digital divide, related to accessing and accepting digital information and knowledge is also an important social issue. In particular, the digital divide by age is becoming a major issue, not only in terms of resolving social imbalances but also in resolving the structural problems of the economy in addition to the survival of the elderly. This study aims to find ways to resolve the digital gap of the elderly in terms of socioemotional selectivity theory and suggests the reasons for the elderly's less access to digital information acquisition and the implications for the solution.

• Journal of Service Research and Studies
• /
• v.12 no.3
• /
• pp.60-69
• /
• 2022

In this study, to verify the effectiveness of the persona-type consumer analysis data service, a study was conducted focusing on the consumer analysis service use case of www.ethno-mining.com. The case was targeted at the 'Small Business Design Difficulty Resolving Support Project' of the Gangwon Institute of Design Promotion. The progress of this study was to develop a questionnaire to measure the user satisfaction and effectiveness of the service, study the consumer analysis data of the persona method of the www.ethno-mining.com system, study related theories, compare similar services, and conduct questionnaires; The results were analyzed and tested. In the result of testing the participants in the 'Small Business Design Difficulty Resolving Support Project' of the Gangwon Design Promotion Institute, the persona-style consumer analysis data got a positive response in terms of user satisfaction, and a regression that measures the effectiveness of the service on the company's R&D In the analysis, it was found that there are practical effects for companies by reducing time, reducing costs, smooth communication between developers, securing expertise in consumer analysis, and improving the overall quality of R&D during R&D.

• The Plant Pathology Journal
• /
• v.40 no.2
• /
• pp.171-191
• /
• 2024

Identification of Helicotylenchus species is very challenging due to phenotypic plasticity and existence of cryptic species complexes. Recently, the use of rDNA barcodes has proven to be useful for identification of Helicotylenchus. Molecular markers are a quick diagnostic tool and are crucial for discriminating related species and resolving cryptic species complexes within this speciose genus. However, DNA barcoding is not an error-free approach. The public databases appear to be marred by incorrect sequences, arising from sequencing errors, mislabeling, and misidentifications. Herein, we provide a comprehensive analysis of the newly obtained, and published DNA sequences of Helicotylenchus, revealing the potential faults in the available DNA barcodes. A total of 97 sequences (25 nearly full-length 18S-rRNA, 12 partial 28S-rRNA, 16 partial internal transcribed spacer [ITS]-rRNA, and 44 partial cytochrome c oxidase subunit I [COI] gene sequences) were newly obtained in the present study. Phylogenetic relationships between species are given as inferred from the analyses of 103 sequences of 18S-rRNA, 469 sequences of 28S-rRNA, 183 sequences of ITS-rRNA, and 63 sequences of COI. Remarks on suggested corrections of published accessions in GenBank database are given. Additionally, COI gene sequences of H. dihystera, H. asiaticus and the contentious H. microlobus are provided herein for the first time. Similar to rDNA gene analyses, the COI sequences support the genetic distinctness and validity of H. microlobus. DNA barcodes from type material are needed for resolving the taxonomic status of the unresolved taxonomic groups within the genus.

• Journal of Korea Multimedia Society
• /
• v.23 no.10
• /
• pp.1236-1249
• /
• 2020

In a most recent object tracking research work, applying Convolutional Neural Network and Recurrent Neural Network-based strategies become relevant for resolving the noticeable challenges in it, like, occlusion, motion, object, and camera viewpoint variations, changing several targets, lighting variations. In this paper, the LSTM Network-based Tracking association method has proposed where the technique capable of real-time multi-object tracking by creating one of the useful LSTM networks that associated with tracking, which supports the long term tracking along with solving challenges. The LSTM network is a different neural network defined in Keras as a sequence of layers, where the Sequential classes would be a container for these layers. This purposing network structure builds with the integration of tracking association on Keras neural-network library. The tracking process has been associated with the LSTM Network feature learning output and obtained outstanding real-time detection and tracking performance. In this work, the main focus was learning trackable objects locations, appearance, and motion details, then predicting the feature location of objects on boxes according to their initial position. The performance of the joint object tracking system has shown that the LSTM network is more powerful and capable of working on a real-time multi-object tracking process.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.7
• /
• pp.1020-1026
• /
• 2013

Multirate filtering process on the biological signals like Electrocardiogram (ECG) and Photoplethysmogram (PPG) can be defined as the digital signal processing algorithm in which the sampling rate varies to omit or interpolate the intermediate values between the sampled data. With this aim, we suggest a new multirate filtering algorithm by deleting the extraneous data to eliminate the unwanted degradations such as granular noise due to the usage of high sampling frequency and simultaneously to detect the fiducial features of ECG and PPG with reducing the complexity of resolving fiducial points such as R-peak, Pulse peak and Pulse Transit Time (PTT). After the experimental simulations performed, we can conclude the fact that we can detect the fiducial features of ECG and PPG signal in terms of R-peak, Pulse peak and PTT without the loss of accuracy even if we do not maintain the original sampling frequency.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.57
• /
• pp.79-108
• /
• 2013

International transactions of plant and construction project need to time to time for completing the contract. During the performing the contract there may arise many claims and disputes it should be settled rapidly for processing schedule of works. However, arbitration and litigation for settlement of dispute are inappropriate in time and expense under the specifications of plant and construction project. Dispute boards are one of the successful resolution method of dispute prior to litigation or arbitration. If the dispute board was failed, of course, it may be allowed to continue into litigation or arbitration. As the creative methods of parties agreement, dispute boards may be expected to avoid claims and dispute in long and medium international contract. The purpose of this paper is to explore the specification and limitations of dispute boards that may clear disputes under long and medium contract of construction and procurement. It needs to be understand to determine whether is the useful methods for resolving dispute in the international project. This paper considers the specific natures of dispute board and its rules, procedures and problems including ICC and FIDIC for the contract of long and medium transaction.

• Journal of Arbitration Studies
• /
• v.14 no.1
• /
• pp.61-101
• /
• 2004

Information and communications technologies are affecting an economic and social transformation of all countries. Without exception international commercial dispute resolution systems are faced with change its mechanism to online technology. Dispute parties can seek redress through arbitration other than litigation or mediation. Traditional dispute resolutions do not match the cyber trade environment which is basically pursuit the speed and efficiency in cyberspace. Arbitration other than resolution methods have been considered to be match with the online environment which is including party autonomy, speed and internationally accepted and binding awards. Traditional arbitration, however is lack of time and different physical location relating all parties. So we now think cyberspace as for the resolving place which is online arbitration. Even the parties exist in different space and time they may meet in the same time and space without moving or trips. Nowadays there are many online arbitration service provider serving the resolution of dispute arising with online transaction. In this paper we study the tendency for online arbitration, the recognize uncertain matters and avoiding programs its matters when use the online arbitration between disputing parties under cyber trade environment.

• The Journal of Information Technology
• /
• v.9 no.4
• /
• pp.49-55
• /
• 2006

In this paper, a new fragile watermarking algorithm for digital image is presented, which makes resolving the security and forgery problem of the digital image to be possible. The most suitable watermarking method that verifies the authentication and integrity of the digital image is the Wong's method, which invokes the hash function (MD5). The algorithm is safe because this method uses the hash function of the cryptology. The operations such as modulus, complement, shift, bitwise exclusive-or, bitwise inclusive-or are necessary for calculating the value of hash function. But, in this paper, an Arithmetic encoding method that only includes the multiplication operation is adopted. This technique prints out accumulative probability interval, which is obtained by multiplying the input symbol probability interval. In this paper, the initial probability interval is determined according to the value of the key, and the input sequence of the symbols is adjusted according to the key value so that the accumulative probability interval will depend on the key value. The integrity of the algorithm has been verified by experiment. The PSNR is above the 51.13db and the verifying time is $1/3{\sim}1/4$ of the verifying time of using the hash function (MD5), so, it can be used in the real-time system.

• Journal of Yeungnam Medical Science
• /
• v.35 no.1
• /
• pp.40-44
• /
• 2018

Background: Pregabalin has been studied as a single or multimodal analgesic drug for postoperative pain management in different types of surgeries. We evaluated the analgesic effect of 150 mg of pregabalin in resolving post-gastrectomy pain. Methods: Forty-four patients were randomized into two groups: a pregabalin group that received oral pregabalin (150 mg) 2 h before anesthetic induction, and a control group that received placebo tablets at the same time. Data on postoperative pain intensity (visual analog scale [VAS], at 30 min, 2 h, 4 h, and 24 h), consumption of fentanyl in patient-controlled analgesia (PCA), and the proportion of patients requiring rescue analgesics at different time intervals (0-2 h, 2-4 h, and 4-24 h) were collected during the 24 h postoperative period. Results: The VAS scores did not show significant differences at any time point and consumption of fentanyl in PCA and the proportion of patients requiring rescue analgesics did not differ between the two groups. The groups did not differ in the occurrence of dizziness, sedation, and dry mouth. Conclusion: A preoperative 150 mg dose of pregabalin exerts no effect on acute pain after gastrectomy.

• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.339-345
• /
• 2021

The rapid development of various applications in networking system, business, medical, education, and other domains that use basic data access operations such as insert, edit, delete and search makes data structure venerable and crucial in providing an efficient method for day to day operations of those numerous applications. One of the major problems of those applications is achieving constant time to search a key from a collection. A number of different methods which attempt to achieve that have been discovered by researchers over the years with different performance behaviors. This work evaluated these methods, and found out that almost all the existing methods have non-constant time for adding and searching a key. In this work, we designed a multi-indexes hashing algorithm that handles a collision in a hash table T efficiently and achieved constant time O(1) for searching and adding a key. Our method employed two-level of hashing which uses pattern extraction h₁(key) and h₂(key). The second hash function h₂(key) is use for handling collision in T. Here, we eliminated the wasted slots in the search space T which is another problem associated with the existing methods.