• The Journal of Engineering Research
• /
• v.3 no.1
• /
• pp.65-73
• /
• 1998

One approach to improved image restoration methods has been the incorporation of additional source information via Gibbs priors that assume a source that is piecewise smooth. A natural Gibbs prior for expressing such constraints is an energy function defined on binary valued line processes as well as source intensities. However, the estimation of both continuous variables and binary variables is known to be a difficult problem. In this work, we consider the application of the deterministic annealing method. Unlike other methods, the deterministic annealing method offers a principled and efficient means of handling the problems associated with mixed continuous and binary variable objectives. The application of the deterministic annealing method results in a sequence of objective functions (defined only on the continuous variables) whose sequence of solutions approaches that of the original mixed variable objective function. The sequence is indexed by a control parameter (the temperature). The energy functions at high temperatures are smooth approximations of the energy functions at lower temperatures. Consequently, it is easier to minimize the energy functions at high temperatures and then track the minimum through the variation of the temperature. This is the essence of a continuation method. We show experimental results, which demonstrate the efficacy of the continuation method applied to a Bayesian restoration model.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.10
• /
• pp.602-608
• /
• 2020

Development of Internet technology and the spread of various smart devices provide a convenient computing environment for people, which is becoming common thanks to the Internet of Things (IoT). However, attacks by hackers have caused various problems, such as leaking personal information or violating privacy. In the IoT environment, various smart devices are connected, and network attacks that are used in the PC environment are occurring frequently in the IoT. In fact, security incidents such as conducting DDoS attacks by hacking IP cameras, leaking personal information, and monitoring unspecified numbers of personal files without consent are occurring. Although attacks in the existing Internet environment are PC-oriented, we can now confirm that smart devices such as IP cameras and tablets can be targets of network attacks. Through performance evaluation, the proposed protocol shows 11% more energy efficiency on servers than RSA, eight times greater energy efficiency on clients than Kerberos, and increased efficiency as the number of devices increases. In addition, it is possible to respond to a variety of security threats that might occur against the network. It is expected that efficient operations will be possible if the proposed protocol is applied to the IoT environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.671-674
• /
• 2012

Recently, depending on the development of smart devices, a variable services have been offered to meet user's convenience. Due to these advance, the needs of users are extremely being diversified and more specific. In that situation, the needs for the N-Screen system has been varied and gradually evolved. An existing N-Screen system that use the way of video streaming upload its multimedia contents to their own cloud server so that might take a long play-reaction time and the number of user is limited by the server's performance. Because of the web based protocol adopted by existing N-Screen system, there are many different problems like high delay, overhead and something caused by simplex data communications. Therefore, to solve the problems above, this study proposes an application based on HTML5. This application supports Video tag and Progressive download via HTML5 so that improves the play-reaction time for multimedia contents. This system can also get rid of the chronic problems such as an access limitation for lots of users as per video streaming encoding. Also, through web sockets, this study proposes a system that has lower delay than the existing system and communicates in full duplex to be able to link dynamically.

• The KIPS Transactions:PartD
• /
• v.12D no.7 s.103
• /
• pp.1049-1064
• /
• 2005

The demands of increasingly complicated software have led to the proliferation of object-oriented design methodologies in embedded systems. To execute a system designed with objects in target hardware, a task set should be derived from the objects, representing how many tasks reside in the system and which task processes which event arriving at an object. The derived task set greatly influences the responsiveness of the system. Nevertheless, it is very difficult to derive an optimal task set due to the discrepancy between objects and tasks. Therefore, the common method currently used by developers is to repetitively try various task sets. This paper proposes Scenario-based Implementation Synthesis Architecture (SISA) to solve this problem. SISA encompasses a method for deriving a task set from a system designed with objects as well as its supporting development tools and run-time system architecture. A system designed with SISA not only consists of the smallest possible number of tasks, but also guarantees that the response time for each event in the system is minimized. We have fully implemented SISA by extending the ResoRT development tool and applied it to an existing industrial PBX system. The experimental results show that maximum response times were reduced $30.3\%$ on average compared to when the task set was derived by the best known existing methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.629-638
• /
• 2005

In the System on a Chip design, the on chip bus is one of the critical factors that decides the overall system performance. Especially, in the case or reusing the IPs such as processors, DSPs and multimedia IPs that requires higher bandwidth, the bandwidth problems of on chip bus are getting more serious. Recently ARM proposes the Multi-Layer AHB BusMatrix that is a highly efficient on chip bus to solve the bandwidth problems. The Multi-Layer AHB BusMatrix allows parallel access paths between multiple masters and slaves in a system. This is achieved by using a more complex interconnection matrix and gives the benefit of increased overall bus bandwidth, and a more flexible system architecture. However, there is one clock cycle delay for each master in existing Multi-Layer AHB BusMatrix whenever the master starts new transactions or changes the slave layers because of the Input Stage and arbitration logic realized with Moore type. In this paper, we improved the existing Multi-Layer AHB BusMatrix architecture to solve the one clock cycle delay problems and to reduce the area overhead of the Input Stage. With the elimination of the Input Stage and some restrictions on the arbitration scheme, we tan take away the one clock cycle delay and reduce the area overhead. Experimental results show that the end time of total bus transaction and the average latency time of improved Multi-Layer AHB BusMatrix are improved by $20\%\;and\;24\%$ respectively. in ease of executing a number of transactions by 4-beat incrementing burst type. Besides the total area and the clock period are reduced by $22\%\;and\;29\%$ respectively, compared with existing Multi-layer AHB BusMatrix.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.370-379
• /
• 2006

Computational grid provides the environment which integrates v 따 ious computing resources. Grid environment is more complex and various than traditional computing environment, and consists of various resources where various software packages are installed in different platforms. For more efficient usage of computational grid, therefore, some kind of integration is required to manage grid resources more effectively. In this paper, a global scheduler is suggested, which integrates grid resources at meta level with applying various scheduling policies. The global scheduler consists of a mechanical part and three policies. The mechanical part mainly search user queues and resource queues to select appropriate job and computing resource. An algorithm for the mechanical part is defined and optimized. Three policies are user selecting policy, resource selecting policy, and executing policy. These can be defined newly and replaced with new one freely while operation of computational grid is temporarily holding. User selecting policy, for example, can be defined to select a certain user with higher priority than other users, resource selecting policy is for selecting the computing resource which is matched well with user's requirements, and executing policy is to overcome communication overheads on grid middleware. Finally, various algorithms for user selecting policy are defined only in terms of user fairness, and their performances are compared.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.6
• /
• pp.237-247
• /
• 2008

A virtual screening is the process of reducing an unmanageable number of compounds to a limited number of compounds for the target of interest by means of computational techniques such as molecular docking. And it is one of a large-scale scientific application that requires large computing power and data storage capability. Previous applications or softwares for molecular docking such as AutoDock, FlexX, Glide, DOCK, LigandFit, ViSION were developed to be run on a supercomputer, a workstation, or a cluster-computer. However the virtual screening using a supercomputer has a problem that a supercomputer is very expensive and the virtual screening using a workstation or a cluster-computer requires a long execution time. Thus we propose a service-based virtual screening system using Grid computing technology which supports a large data intensive operation. We constructed 3-dimensional chemical molecular database for virtual screening. And we designed a resource broker and a data broker for supporting efficient molecular docking service and proposed various services for virtual screening. We implemented service based virtual screening system with DOCK 5.0 and Globus 3.2 toolkit. Our system can reduce a timeline and cost of drug or new material design.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.4
• /
• pp.552-557
• /
• 2020

The Radar Cross Section (RCS) is a virtual region indicating the strength of a wavelength at which a radar signal is reflected and received. As the ship's RCS represents its own stealth performance and survivability, efforts have been made in various areas from design to construction to reduce the RCS. The RCS can be predicted using design drawings and CAD models, but it is necessary to measure the RCS at sea since sea clutter and multipath reflections occur in the sea environment. However, such RCS predictions and measured values provide only a simple relative magnitude to the user, and there has not been much research on this topic. In this paper, a missile countermeasure technique was studied using 3D RCS measurement data in an operating environment. The elevation and azimuth angle of the ship viewed from the missile were estimated using the location information of the missile, and the RCS value was inverted by mapping it to previously measured 3D RCS measurement data. In addition, by using the movement information of the missile, the RCS observed by the missile could be predicted in advance, and this method can be used to propose a response plan based on the maneuvering and chaff system.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.658-667
• /
• 2017

The demand for large-scale storage systems has continued to grow due to the emergence of multimedia, social-network, and big-data services. In order to improve the response time and reduce the load of such large-scale storage systems, DRAM-based in-memory cache systems are becoming popular. However, the high cost of DRAM severely restricts their capacity. While the method of compressing cache entries has been proposed to deal with the capacity limitation issue, compression and decompression, which are technically difficult to parallelize, induce significant processing overhead and in turn retard the response time. A selective compression scheme is proposed in this paper for in-memory file system caches that rapidly estimates the compression ratio of incoming cache entries with their Shannon entropies and compresses cache entries with low compression ratio. In addition, a description is provided of the design and implementation of an in-kernel in-memory file system cache with the proposed selective compression scheme. The evaluation showed that the proposed scheme reduced the execution time of benchmarks by approximately 18% in comparison to the conventional non-compressing in-memory cache scheme. It also provided a cache hit ratio similar to the all-compressing counterpart and reduced 7.5% of the execution time by reducing the compression overhead. In addition, it was shown that the selective compression scheme can reduce the CPU time used for compression by 28% compared to the case of the all-compressing scheme.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.67-84
• /
• 2004

Real-time database systems (RTDBS) are database systems whose transactions are associated with timing constraints such as deadlines. Therefore transaction needs to be completed by a certain deadline. Besides meeting timing constraints, a RTDBS needs to observe data consistency constraints as well. That is to say, unlike a conventional database system, whose main objective is to provide fast average response time, RTDBS may be evaluated based on how often transactions miss their deadline, the average lateness or tardiness of late transactions, the cost incurred in transactions missing their deadlines. Therefore, in RTDBS, transactions should be scheduled according to their criticalness and tightness of their deadlines, even If this means sacrificing fairness and system throughput, And It always must guarantee preceding process of the transaction with the higher priority. In this paper, we propose an efficient real-time scheduling algorithm (Multi-level EFDF) that alleviates problems of the existing real-time scheduling algorithms, a real-time concurrency control algorithm(2PL-FT) for firm and soft real-time transactions. And we compare the proposed 2PL F[ with AVCC in terms of the restarting ratio and the deadline missing ratio of transactions. We show through experiments that our algorithms achieve good performance over the other existing methods proposed earlier.