• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2723-2740
• /
• 2017

Steganographic schemes which are based on minimizing an additive distortion function defined the overall impacts after embedding as the sum of embedding costs for individual image element. However, mutual impacts during embedding are often ignored. In this paper, an adaptive JPEG steganographic method based on weight distribution for embedding costs is proposed. The method takes mutual impacts during embedding in consideration. Firstly, an analysis is made about the factors that affect embedding fluctuations among JPEG coefficients. Then the Distortion Update Strategy (DUS) of updating the distortion costs is proposed, enabling to dynamically update the embedding costs group by group. At last, a kind of adaptive JPEG steganographic algorithm is designed combining with the update strategy and well-known additive distortion function. The experimental result illustrates that the proposed algorithm gains a superior performance in the fight against the current state-of-the-art steganalyzers with high-dimensional features.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.6
• /
• pp.1027-1034
• /
• 2017

In this paper, we propose a new function embedding method that can measure mathematical projections of probability amplitude, probability, average expectation and matrix elements of stationary-state unit matrix at all control operation points of quantum gates. The function embedding method in this paper is to embed orthogonal normalization condition of probability amplitude for each control operating point into a binary scalar operator by using Dirac symbol and Kronecker delta symbol. Such a function embedding method is a very effective means of controlling the arithmetic power function of a unitary gate in a unitary transformation which expresses a quantum gate function as a tensor product of a single quantum. We present the results of evolutionary operation and projective measurement when we apply the proposed function embedding method to the ternary 2-qutrit cNOT gate and compare it with the existing methods.

• 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 Institute of Convergence Signal Processing
• /
• v.12 no.3
• /
• pp.176-180
• /
• 2011

Even though algorithms for watermark embedding and extraction step are important issue for digital watermarking, watermark selection and post-processing can give us an opportunity to improve our algorithms and achieve higher performance. For this reason, we summarized the possibilities of improvements for digital watermarking by referring to the watermark merging techniques rather than embedding and extraction algorithms in this paper. We chose Cox's function as main embedding and extraction algorithm, and multiple barcode watermarks as a watermark. Each bit of the multiple copies of barcode watermark was embedded into a gray-scale image with Cox's embedding function. After extracting the numbers of watermark, we applied the watermark merging techniques; including the simple merging, N-step iterated merging, recover merging and combination of iterated-recover merging. Main consequence of our paper was the fact of finding out how multiple barcode watermarks and merging techniques can give us opportunities to improve the performance of algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.3
• /
• pp.600-612
• /
• 2013

In 2006, Zhang and Wang proposed a data hiding scheme based on Exploiting Modification Direction (EMD) to increase data hiding capacity. The major benefit of EMD is providing embedding capacity greater than 1 bit per pixel. Since then, many EMD-type data hiding schemes have been proposed. However, a serious disadvantage common to these approaches is that the embedded data is compromised when the embedding function is disclosed. Our proposed secure data hiding scheme remedies this disclosure shortcoming by employing an additional modulus function. The provided security analysis of our scheme demonstrates that attackers cannot get the secret information from the stegoimage even if the embedding function is made public. Furthermore, our proposed scheme also gives a simple solution to the overflow/underflow problem and maintains high embedding capacity and good stegoimage quality.

• Communications of the Korean Mathematical Society
• /
• v.24 no.2
• /
• pp.187-195
• /
• 2009

We investigate the boundary values of the holomorphic mean Lipschitz function. In fact, we prove that the admissible limit exists at every boundary point of the unit ball for the holomorphic mean Lipschitz functions under some assumptions on the Lipschitz order. Moreover, we get embedding theorems of holomorphic mean Lipschitz spaces into Hardy spaces or into the Bloch space on the unit ball in $\mathbb{C}_n$.

• The Journal of Korean Medicine Ophthalmology and Otolaryngology and Dermatology
• /
• v.34 no.1
• /
• pp.1-12
• /
• 2021

Objectives : This study was to investigate the effectiveness of thread-embedding therapy for the treatment of acute phase of Bell's palsy. Methods : Thread-embedding therapy was performed once a week on 29 patients within 1 weeks after the onset. We investigated the general characters, Yanagihara's score, House-Brackmann scale and FDI were used to evaluate the effectiveness of thread-embedding therapy. Results : Facial muscle recovery began at 13.37th day, that was about 0.36 day earlier than the previous patients who were treated without thread-embedding therapy in 2017 at the same hospital, but there was no statistical significance. In the change of each scale before and after treatment, Yanagihara's score, House-Brackmann scale, physical function and social function of FDI were changed significantly. Compared with the patients treated without thread-embedding therapy in 2017, Yanagihara's score was a little higher and House-Brackmann scale was a little lower. Conclusions : These findings suggested that thread-embedding therapy on acute phase of Bell's palsy was a little more effective than the conventional therapy without thread-embedding therapy.

• Journal of Acupuncture Research
• /
• v.30 no.5
• /
• pp.227-233
• /
• 2013

Objectives : The purpose of this study was to report the clinical effects of catgut-embedding acupuncture therapy on plantar fasciitis. Methods : Two patients were treated mainly with catgut-embedding acupuncture therapy and partly with other Korean medicine modalities. Catgut-embedding acupuncture therapy was applied once a week for three weeks, and follow-up observation was conducted by telephone survey two months after the first treatment. Results : In these two cases, the pain numerical rating scale(NRS) gradually decreased from 8 to 1, and the pain relief as well as the improvement in ambulatory function was maintained at two-month follow-up. Conclusions : Catgut-embedding acupuncture therapy could be effective for pain-reduction and functional improvement in plantar fasciitis.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.265-267
• /
• 1999

XML 언어로 설계된 SMIL(Synchronized Multimedia Integration Language)은 멀티미디어 객체들의 순차적 혹은 병렬적 동기화를 효율적으로 할 수 있는 마크업 언어로써, web을 이용한 원격 강의나 홍보 등을 더욱 생성하고 dynamic하게 보여 줄 수 있어, 그 사용이 확대될 전망이다. 본 논문에서는 각종 웹 단말기에 손쉽게 embedding 될 수 있는 SMIL 프로세서에 대한 설계가 제안된다. 웹 응용을 위해, 속도의 개선과 시스템 독립적인 function들로 구성되는 parser와 응용에 적합한 API의 설계에 주안점을 두었으며, 추후 XML parser function들과 API 설계를 위해 가능한 적은 수정을 통하여 재사용이 가능하도록 하는데 또한 주안점을 두고 있다.