• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1961-1974
• /
• 2019

In this letter, a harmonic-mean-based dual-antenna selection scheme at relay node is proposed in two-way relaying networks (TWRNs). With well-designed distributed orthogonal concatenated Alamouti space-time block code (STBC), a dual-antenna selection problem based on the instantaneous achievable sum-rate criterion is formulated. We propose a low-complexity selection algorithm based on the harmonic-mean criterion with linearly complexity $O(N_R)$ rather than the directly exhaustive search with complexity $O(N^2_R)$. From the analysis of network outage performance, we show that the asymptotic diversity gain function of the proposed scheme achieves as $1/{\rho}{^{N_R-1}}$, which demonstrates one degree loss of diversity order compared with the full diversity. This slight performance gap is mainly caused by sacrificing some dual-antenna selection freedom to reduce the algorithm complexity. In addition, our proposed scheme can obtain an extra coding gain because of the combination of the well-designed orthogonal concatenated Alamouti STBC and the corresponding dual-antenna selection algorithm. Compared with the common-used selection algorithms in the state of the art, the proposed scheme can achieve the best performance, which is validated by numerical simulations.

• Journal of Dental Anesthesia and Pain Medicine
• /
• v.19 no.1
• /
• pp.1-10
• /
• 2019

Periodontal procedures require adequate anesthesia not only to ensure the patient's comfort but also to enhance the operator's performance and minimize chair time. In the maxilla, anesthesia is often achieved using highly traumatic nerve blocks, apart from multiple local infiltrations through the buccal vestibule. In recent years, anterior middle superior alveolar (AMSA) field block has been claimed to be a less traumatic alternative to several of these conventional injections, and it has many other advantages. This critical review of the existing literature aimed to discuss the rationale, mechanism, effectiveness, extent, and duration of AMSA injections for periodontal surgical and non-surgical procedures in the maxilla. It also focused on future prospects, particularly in relation to computer-controlled local anesthetic delivery systems, which aim to achieve the goal of pain-free anesthesia. A literature search of different databases was performed to retrieve relevant articles related to AMSA injections. After analyzing the existing data, it can be concluded that this anesthetic technique may be used as a predictable method of effective palatal anesthesia with adequate duration for different periodontal procedures. It has additional advantages of being less traumatic, requiring lesser amounts of local anesthetics and vasoconstrictors, as well as achieving good hemostasis. However, its effect on the buccal periodontium appears highly unpredictable.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.8
• /
• pp.77-85
• /
• 2019

In this paper, we propose a "Safe Web Using Scrapable Headless Browse" Because in a network separation environment for security, It does not allow the Internet. The reason is to physically block malicious code. Many accidents occurred, including the 3.20 hacking incident, personal information leakage at credit card companies, and the leakage of personal information at "Interpark"(Internet shopping mall). As a result, the separation of the network separate the Internet network from the internal network, that was made mandatory for public institutions, and the policy-introduction institution for network separation was expanded to the government, local governments and the financial sector. In terms of information security, network separation is an effective defense system. Because building a network that is not attacked from the outside, internal information can be kept safe. therefore, "the separation of the network" is inefficient. because it is important to use the Internet's information to search for it and to use it as data directly inside. Using a capture method using a Headless Web browser can solve these conflicting problems. We would like to suggest a way to protect both safety and efficiency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.5
• /
• pp.57-68
• /
• 2004

The rectangle attack and the related-key attack on block ciphers are well-known to be very powerful. In this paper we combine the rectangle attack with the related-key attack. Using this combined attack we can attack the SHACAL-1 cipher with 512-bit keys up to 59 out of its 80 rounds. Our 59-round attack requires a data complexity of $2^{149.72}$ chosen plaintexts and a time complexity of $2^{498.30}$ encryptions, which is faster than exhaustive search.

• Journal of Advanced Navigation Technology
• /
• v.24 no.6
• /
• pp.549-556
• /
• 2020

This paper proposes several suboptimal methods of designing a controller for a networked control system with state feedback where delay due to transmission error and transmission delay is modeled as a Markov process. A stability condition for a control system with Markov delay is found through an equivalent relationship that corresponding delay-dependent Lyapunov-Krasovskii functional has the same form of the Lyapunov function of an augmented control system. Several suboptimal methods of designing a controller from the stability condition are proposed to reduce complexity. A simple numerical experiment shows that a restricted subspace method which limits the search space of a matrix variable to a block diagonal form provides the best tradeoff between the complexity and performance.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.6
• /
• pp.1035-1043
• /
• 2022

With the spread of the Internet of Things (IoT), cloud computing, and big data, the need for high-speed encryption for applications is emerging. GPU optimization can be used to validate cryptographic analysis results or reduced versions theoretically obtained by the GPU in a reasonable time. In this paper, PIPO lightweight encryption implemented in various environments was implemented on GPU. Optimally implemented considering the brute force attack on PIPO. In particular, the optimization implementation applying the bit slicing technique and the GPU elements were used as much as possible. As a result, the implementation of the proposed method showed a throughput of about 19.5 billion per second in the RTX 3060 environment, achieving a throughput of about 122 times higher than that of the previous study.

• Journal of Korean Medicine Rehabilitation
• /
• v.33 no.1
• /
• pp.13-29
• /
• 2023

Objectives To evaluate the evidence supporting the effectiveness of acupuncture for facet joint syndrome. Methods We conducted search across 9 electronic databases (PubMed, EMBASE, Cochrane CENTRAL (CENTRAL), KoreaMed, Kmbase, Koreanstudies Information Service System (KISS), ScienceOn, China National Knowledge Infrastructure (CNKI), and Wanfang) to find clinical trials that used acupuncture as treatment for facet joint syndrome. The methodological quality of randomized controlled clinical trials (RCTs) were assessed using the Cochrane Risk of Bias (RoB) tool, while non-randomized controlled clinical trials (nRCTs) were assessed using the Cochrane Risk of Bias Assessment tool for Non-randomized Study (RoBANS) tool. Results Nine RCTs and one nRCT met our inclusion criteria. Fire needle was more effective than medial branch block in terms of visual analogue scale (VAS) after 1 month (p=0.02). Also, Fire needle was more effective than Ibuprofen in terms of VAS and oswestry disability index (ODI) (p<0.05). However, in the rest of the study results, the intervention group did not show a statistically significant difference than the control group. Conclusions Although our review found encouraging but limited evidence of acupuncture for facet joint syndrome, most of the studies included in the analysis were evaluated as methodologically high risk of bias. From now on further well-designed RCTs should be encouraged.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2101-2123
• /
• 2023

Recent studies have shown that the neural network-based binary code similarity detection technology performs well in vulnerability mining, plagiarism detection, and malicious code analysis. However, existing cross-architecture methods still suffer from insufficient feature characterization and low discrimination accuracy. To address these issues, this paper proposes a cross-architecture binary function similarity detection method based on composite feature model (SDCFM). Firstly, the binary function is converted into vector representation according to the proposed composite feature model, which is composed of instruction statistical features, control flow graph structural features, and application program interface calling behavioral features. Then, the composite features are embedded by the proposed hierarchical embedding network based on a graph neural network. In which, the block-level features and the function-level features are processed separately and finally fused into the embedding. In addition, to make the trained model more accurate and stable, our method utilizes the embeddings of predecessor nodes to modify the node embedding in the iterative updating process of the graph neural network. To assess the effectiveness of composite feature model, we contrast SDCFM with the state of art method on benchmark datasets. The experimental results show that SDCFM has good performance both on the area under the curve in the binary function similarity detection task and the vulnerable candidate function ranking in vulnerability search task.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.2
• /
• pp.311-326
• /
• 2018

This paper has experimented using News sample video with QCIF ($176{\times}144$) resolution in JM v10.2 code of H.264/AVC-MPEG. The region of interest (ROI) to be encrypted occurred the drift by unnecessarily referring to each frame continuously in accordance with the characteristics of the motion prediction and compensation of the H.264 standard. In order to mitigate the drift, the latest related research method of re-inserting encrypted I-picture into a certain period leads to an increase in the amount of additional computation that becomes the factor increasing the bit-rate overhead of the entire video. Therefore, the reference search range of the block and the frame in the ROI to be encrypted is restricted in the motion prediction and compensation for each frame, and the reference search range in the non-ROI not to be encrypted is not restricted to maintain the normal encoding efficiency. In this way, after encoding the video with restricted reference search range, this article proposes a method of RC4 bit-stream encryption for the ROI such as the face to be able to identify in order to protect personal information in the video. Also, it is compared and analyzed the experimental results after implementing the unencrypted original video, the latest related research method, and the proposed method in the condition of the same environment. In contrast to the latest related research method, the bit-rate overhead of the proposed method is 2.35% higher than that of the original video and 14.93% lower than that of the latest related method, while mitigating temporal drift through the proposed method. These improved results have verified by experiments of this study.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.27-34
• /
• 2011

In this paper, it was presented a design on the dynamic multimedia fingerprinting code for anti-collusion code(ACC) in the protection of multimedia content. Multimedia fingerprinting code for the conventional ACC, is designed with a mathematical method to increase k to k+1 by transform from BIBD's an incidence matrix to a complement matrix. A codevector of the complement matrix is allowanced fingerprinting code to a user' authority and embedded into a content. In the proposed algorithm, the feature points were drawing from a content which user bought, with based on these to design the dynamical multimedia fingerprinting code. The candidate codes of ACC which satisfied BIBD's v and k+1 condition is registered in the codebook, and then a matrix is generated(Below that it calls "Rhee matrix") with ${\lambda}+1$ condition. In the experimental results, the codevector of Rhee matrix based on a feature point of the content is generated to exist k in the confidence interval at the significance level ($1-{\alpha}$). Euclidean distances between row and row and column and column each other of Rhee matrix is working out same k value as like the compliment matrices based on BIBD and Graph. Moreover, first row and column of Rhee matrix are an initial firing vector and to be a forensic mark of content protection. Because of the connection of the rest codevectors is reported in the codebook, when trace a colluded code, it isn't necessity to solve a correlation coefficient between original fingerprinting code and the colluded code but only search the codebook then a trace of the colluder is easy. Thus, the generated Rhee matrix in this paper has an excellent robustness and fidelity more than the mathematically generated matrix based on BIBD as ACC.