• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.1020-1042
• /
• 2019

Reversible data hiding in encrypted images (RDHEI) provides some real-time cloud applications; i.e. the cloud, acting as a data-hider, automatically embeds timestamp in the encrypted image uploaded by a content owner. Many existing methods of RDHEI only satisfy user privacy in which the data-hider does not know the original image, but leaks owner privacy in which the receiver can obtains the original image by decryption and extraction. In the literature, the method of Zhang et al. is the one providing weak content-owner privacy in which the content-owner and data-hider have to share a data-hiding key. In this paper, we take care of the stronger notion, called strong content-owner privacy, and achieve it by presenting a new reversible data hiding in encrypted images. In the proposed method, image decryption and message extraction are separately controlled by different types of keys, and thus such functionalities are decoupled to solve the privacy problem. At the technique level, the original image is segmented along a Hilbert filling curve. To keep image privacy, segments are transformed into an encrypted image by using random permutation. The encrypted image does not reveal significant information about the original one. Data embedment can be realized by using pixel histogram-style hiding, since this property, can be preserved before or after encryption. The proposed method is a modular method to compile some specific reversible data hiding to those in encrypted image with content owner privacy. Finally, our experimental results show that the image quality is 50.85dB when the averaged payload is 0.12bpp.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.4
• /
• pp.127-134
• /
• 2023

This paper describes how to port the eCos operating system and PROFINET communication stack developed based on gcc to the IAR compiler. The eCos operating system provides basic functions such as multi-thread, TCP/IP, and device driver for PROFINET operation, so there is no need to change it when developing PROFINET applications. Therefore, in this study, we reuse an eCos library built with gcc and it link with PROFINET communication stack that are ported to IAR complier. Due to the different of the gcc and IAR linker, symbol definitions and address of the constructors should be changed using the external tool that generates symbol definitions and address of the constructors from MAP file. In order to verify the proposed method, it was confirmed that the actual I/O was operating normally through PROFINET IRT communication by connecting to the Siemens PLC. IAR compiler has better performance in both the compile time and the size of the generated binary. The proposed method in this study is expected to help port various open sources as well as eCos and PROFINET communication stacks to other compilers.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.35-41
• /
• 2002

This research introduces the development of a project-level cash flow forecasting model in construction stage based on the planned earned value and the cost from a general contractors view on a jobsite. Most previous models have been developed to assist contractors in their pre-tendering or planning stage cash flow forecasts. The critical key to cash flow forecasting at the project level is how to build a cash-out model. The basic concept is to use moving weights of cost categories in a budget over project duration. The cost categories are classified to compile resources with almost the same time lags that are based on contracting payment conditions and credit times given by suppliers or venders. For cash-in, net planned monthly-earned values are simply transferred to the cash-in forecast, to be applied there with billing time and retention money. Validation of the model involves applying data from on-going 4 projects in progress for 12 months. Based on the results of the comparative analyses through the simulation of the proposed model and the existing models, the proposed model is more accurate, flexible and simpler than traditional models to the employee of construction jobsite who is not oriented financial knowledge.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.675-688
• /
• 2007

Memory access errors are frequently occurred in C programs. A number of tools and research works have been trying to detect the errors automatically. However, they have one or more of the following problems: inability to detect all memory errors, changing the memory allocation mechanism, incompatibility with libraries, and excessive performance overhead. In this paper, we suggest a new method to solve these problems, and then present a result of comparison to the previous research works through the experiments. Our approach consists of two phases. First is to transform source code at compile time through inserting instrumentation into the source code. And second is to detect memory errors at run time with a bitmap that maintains information about memory allocation. Our approach has improved the error detection abilities against the binary code analysis based ones by using the source code analysis technique, and enhanced performance in terms of both space and time, too. In addition, our approach has no problem with respect to compatibility with shared libraries as well as does not need to modify memory allocation mechanism.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.615-622
• /
• 2006

Caching in a Wireless Internet Proxy Server Cluster Environment has an effect that minimizes the time on the request and response of Internet traffic and Web user As a way to increase the hit ratio of cache, we can use a hash function to make the same request URLs to be assigned to the same cache server. The disadvantage of the hashing scheme is that client requests cannot be well-distributed to all cache servers so that the performance of the whole system can depend on only a few busy servers. In this paper, we propose an improved load balancing scheme using hashing and Round Robin scheme that distributes client requests evenly to cache servers. In the existing hashing scheme, if a hashing value for a request URL is calculated, the server number is statically fixed at compile time while in the proposed scheme it is dynamically fixed at run time using round robin method. We implemented the proposed scheme in a Wireless Internet Proxy Server Cluster Environment and performed experiments using 16 PCs. Experimental results show the even distribution of client requests and the 52% to 112% performance improvement compared to the existing hashing method.

• Nuclear Engineering and Technology
• /
• v.55 no.5
• /
• pp.1593-1603
• /
• 2023

In deterministic and Monte Carlo transport codes, b-delayed emission is included using a group structure where all of the precursors are grouped together in 6 groups or families, but given the increase in computational power, nowadays there is no reason to keep this structure. Furthermore, there have been recent efforts to compile and evaluate all the available b-delayed neutron emission data and to measure new and improved data on individual precursors. In order to be able to perform a transient Monte Carlo simulation, data from individual precursors needs to be implemented in a transport code. This work is the first step towards the development of a tool to explore the effect of individual precursors in a fissile system. In concrete, individual precursor data is included by expanding the capabilities of the open source Monte Carlo code OpenMC. In the modified code - named Time Dependent OpenMC or OpenMC(TD)- time dependency related to β-delayed neutron emission was handled by using forced decay of precursors and combing of the particle population. The data for continuous energy neutron cross-sections was taken from JEFF-3.1.1 library. Regarding the data needed to include the individual precursors, cumulative yields were taken from JEFF-3.1.1 and delayed neutron emission probabilities and delayed neutron spectra were taken from ENDF-B/VIII.0. OpenMC(TD) was tested in a monoenergetic system, an energy dependent unmoderated system where the precursors were taken individually or in a group structure, and in a light-water moderated energy dependent system, using 6-groups, 50 and 40 individual precursors. Neutron flux as a function of time was obtained for each of the systems studied. These results show the potential of OpenMC(TD) as a tool to study the impact of individual precursor data on fissile systems, thus motivating further research to simulate more complex fissile systems.

• Journal of Embryo Transfer
• /
• v.23 no.3
• /
• pp.155-160
• /
• 2008

Serial ultrasonographic examinations were performed to establish a prediction table of parturition date in pregnant Maltese, Yorkshire Terrier, Shih-tzu and Miniature Schnauzer bitches. The inner chorionic cavity diameter and fetal head diameter in 45 pregnant bitches were converted retrospectively based on the day of parturition. The data of inner chorionic cavity diameter obtained from Day-44 to Day-25 and fetal head diameter obtained from Day-25 to Day-1 were used to compile a equations of prediction of parturition date. The 70 pregnant bitches with unknown mating time were examined to assess an accuracy of the equations established in this study. And these results were applied to the prediction of parturition date and compared to actual parturition date. The accuracy for parturition date within 0, $\pm$1, and $\pm$2 days interval using the equations of prediction of parturition date were 64.3%, 22.8% and 12.8%, respectively. The overall accuracy of prediction table of parturition day based on the ICCD and HD was 100% accurate within $\pm$2 days. Therefore, the prediction table seems to be a useful tool of the prediction of parturition day in practice.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.416-425
• /
• 1999

복잡한 무결성 제약 조건을 효율적으로 확인하기 위해 제약 조건들을 룰 베이스(rule base)에 저장하고 별도의 룰 관리 시스템과 제약 조건 관리 시스템을 통해 제약 조건을 확인하는 기법이 많은 연구자들에 의해 연구되고 발표되었다. 그러나 제약 조건 관리 시스템이 실행시간에 응용 프로그램을 항상 모니터링하고 있다가 데이타의 수정이 요청될 때마다 개입하여 프로세스를 중단시키고 관련 제약 조건을 확인하는 기존의 방법들은 처리 시간의 지연을 피할 수 없다. 본 논문은 컴파일 시간에 제약 조건 확인 코드를 응용 프로그램에 미리 삽입할 것을 제안한다. 응용 프로그램 자체 내에 제약 조건 확인 코드가 삽입되기 때문에 실행 시간에 다른 시스템의 제어를 받지 않고 직접 제약 조건의 확인 및 데이타베이스의 접근이 가능해져서 처리 시간의 지연을 피할 수 있을 것이다. 이를 위해 어떤 구문이 제약 조건의 확인을 유발하는 지를 추적하였고, 컴파일러가 그러한 구문을 어떻게 전처리 과정에서 검색하는지 그리고 그러한 구문마다 어떻게 해당 제약 조건 확인 코드를 삽입할 수 있는 지를 객체지향1) 데이타베이스 언어인 Objectivity/C++에 대해 gcc의 YACC 코드를 변경함으로써 보여 주었다.Abstract To cope with the complexity of handling integrity constraints, numerous researchers have suggested to use a rule-based system, where integrity constraints are expressed as rules and stored in a rule base. A rule manager and an integrity constraint manager cooperate to check the integrity constraints efficiently. In this approach, however, the integrity constraint manager has to monitor the activity of an application program constantly to catch any database operation. For each database operation, it has to check relevant rules with the help of the rule manager, resulting in considerable delays in database access. We propose to insert the constraints checking code in the application program directly at compile time. With constraints checking code inserted, the application program can check integrity constraints by itself without the intervention of the integrity constraint manager. We investigate what kind of statements require the checking of constraints, show how the compiler can detect those statements, and show how constraints checking code can be inserted into the program, by modifying the GCC YACC file for Objectivity/C++, an object-oriented database programming language.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.8
• /
• pp.619-630
• /
• 2003

We present a method of runtime configuration scheduling in reconfigurable SoC design. As a model of computation, we use a popular formal model of computation, hierarchical FSM (HFSM) with synchronous dataflow (SDF) model, in short, HFSM-SDF model. In reconfigurable SoC design with HFSM-SDF model, the problem of configuration scheduling becomes challenging due to the dynamic behavior of the system such as concurrent execution of state transitions (by AND relation), complex control flow (HFSM), and complex schedules of SDF actor firing. This makes it hard to hide configuration latency efficiently with compile-time static configuration scheduling. To resolve the problem, it is necessary to know the exact order of required configurations during runtime and to perform runtime configuration scheduling. To obtain the exact order of configurations, we exploit the inherent property of HFSM-SDF that the execution order of SDF actors can be determined before executing the state transition of top FSM. After obtaining the order information and storing it in the ready configuration queue (ready CQ), we execute the state transition. During the execution, whenever there is FPGA resource available, a new configuration is selected from the ready CQ and fetched by the runtime configuration scheduler. We applied the method to an MPEG4 decoder and IS95 design and obtained up to 21.8% improvement in system runtime with a negligible overhead of memory usage.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.2
• /
• pp.305-318
• /
• 2023

The complexity of software products led many manufacturers to stitch open-source software for composing a product. Using open-source help reduce the development cost, but the difference in the different development life cycles makes it difficult to keep the product up-to-date. For this reason, even the patches for known vulnerabilities are not adopted quickly enough, leaving the entire product under threat. Existing studies propose to use binary differentiation techniques to determine if a product is left vulnerable against a particular vulnerability. Despite their effectiveness in finding real-world vulnerabilities, they often fail to locate the evidence of a vulnerability if it is a small function that usually is inlined at compile time. This work presents our tool FunRank which is designed to identify the short functions. Our experiments using synthesized and real-world software products show that FunRank can identify the short, inlined functions that suggest that the program is left vulnerable to a particular vulnerability.