• Journal of Internet Computing and Services
• /
• v.12 no.2
• /
• pp.37-46
• /
• 2011

The importance of data service with mobile is becoming more and more significant with the development of wireless network. However, due to the several type of mobile devices and contents, there is a problem that mobile contents should be edited according to the features of the mobile devices and the service providers. Fortunately, there is some solutions that convert mobile contents automatically according to mobile operator. Nevertheless, it has some issues that the response time of content service is delayed when converting mobile contents in real-time. In this paper, we propose an image cache replacement algorithm for minizing the volume of the real-time image transformation. Also, using both of the pre-conversion method and the real-time conversion method to improve storage space and response time.

• Journal of Internet Computing and Services
• /
• v.20 no.6
• /
• pp.119-127
• /
• 2019

This paper proposes a new authentication model to solve the problem of personal information takeover and personal information theft by service providers using centralized servers for user authentication and management of personal information. The centralization issue is resolved by providing user authentication and information storage space through a decentralize platform, blockchain, and ensuring confidentiality of information through user-specific symmetric key encryption. The proposed model was implemented using the public-blockchain Ethereum and the web-based wallet extension MetaMask, and users access the Ethereum main network through the MetaMask on their browser and store their encrypted personal information in the Smart Contract. In the future, users will provide their personal information to the service provider through their Ethereum Account for the use of the new service, which will provide user authentication and personal information without subscription or a new authentication process. Service providers can reduce the costs of storing personal information and separate authentication methods, and prevent problems caused by personal information leakage.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.39-46
• /
• 2009

Generally, Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, we propose an abstract graph for path-finding with dynamic information. The abstract graph is a simple graph as real road network is abstracted. The abstract graph is created by fixed-size cells and real road network. Path-finding with the abstract graph is composed of two step searching, path-finding on the abstract graph and on the real road network. We performed path-finding algorithm with the abstract graph against A* algorithm based on fixed-size cells on road network that consists of 106,254 edges. In result of evaluation of performance, cost of exploring in path-finding with the abstract graph is about 3~30% less than A* algorithm based on fixed-size cells. Quality of path in path-finding with the abstract graph is, However, about 1.5~6.6% more than A* algorithm based on fixed-size cells because edges eliminated are not candidates for path-finding.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2006.05a
• /
• pp.189-194
• /
• 2006

The internal construction industry is not situation of cost reduction based on low wages anymore by the increase in wages as insufficient supply of stilled workers. Recently remodeling constructions that only need to change facilities as to stay the existing structures are on the increase. Now the method of piping facility used to remodeling construction needs stilled workers, large work space and a variety of tools. These complex construction process have a difficulty of high-quality and economical construction. In addition it have the hish incidence of warranty and a problem of cost increase as a commitment of manpower by warranty repair. In order to solve these problems it is necessary for appropriate new technology to the internal construction environment. Piping fittings by Insert & Coupling Joint is a method that unskilled workers can be easily constructed though one touch set up and it is convenient to maintain for repair work of piping facility. This technology show the effect of 3 percentages labor cost reduction as compared with piping fittings by press joint on apartment 500 households. Therefore this technology is supposed that attain a cost reduction though the technical and economical construction and a client satisfaction though the high-quality construction on the present construction market.

• Journal of the Korean Geographical Society
• /
• v.48 no.5
• /
• pp.629-650
• /
• 2013

This study reviews geographical research trends on 'New industrial agglomeration' in Korea and recommends research issues for further studies. Recent studies on industrial agglomeration region have typically concentrated on empirical case studies from new 'perspectives'. As a result, the establishment and theorizing of frameworks for analysis on industrial agglomeration have been given too little attention. To solve this problem research should be conducted to develop frameworks for analysis integrating noneconomic factors and existing economic factors, a strategy emphasized in new industrial agglomeration theory. By doing so, research investigating viability mechanism and generalization will be invigorated. Meanwhile, research focused excessively on social and cultural conditions of region-related networks between actors in economic space at specific scales should be excluded. In addition, academic research on vitalizing industrial agglomeration region, such as cluster policy, should be strengthened. In order to conduct these research objectives effectively, it is necessary to vitalize overall understanding among researchers of industrial agglomeration and provide a place for collaborative learning.

• Journal of the korean academy of Pediatric Dentistry
• /
• v.32 no.4
• /
• pp.687-692
• /
• 2005

Delayed eruption of a maxillary incisor results in midline shift, the space occupied by adjacent teeth and different levels of alveolar height. Extraction or surgical/orthodontic therapy is the most common treatment for a impacted maxillary incisor. Surgical repositioning provides another option for treatment of this problem. The advantages of this approach include immediate esthetic improvement, use of a single and simplified surgical procedure, simple and short orthodontic therapy, a normal gingival margin and the possibility of the developing root adapting to the new position. Autotransplantation of an immature tooth provides for possible adaptation of the developing root apex to the new position. A root with an open apex has good chance of pulp revascularization after transplantation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.8 no.3
• /
• pp.105-112
• /
• 1983

This paper discribes technique of the recursive restoration for the images degraded by linear space invariant blur and additive white Gaussian noise. The image is characterized statistically by tis mean and correlation function. An exponential autocorrelation function has been used to model neighborhood model. The vector model was used because of analytical simplicitly and capability to implement brightness correlation function. Base on the vector model, a two-dimensional discrete stochastic a 12 point neighborhood model for represeting images was developme and used the technique of moving window processing to restore blurred and noisy images without dimensionality increesing, It has been shown a 12 point neighborhood model was found to be more adequate than a 8 point pixel model to obtain optimum pixel estimated. If the image is highly correlated, it is necessary to use a large number of points in the neighborhood in order to have improvements in restoring image. It is believed that these result could be applied to a wide range of image processing problem. Because image processing thchniques normally required a 2-D linear filtering.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.979-986
• /
• 2005

In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A RWA problem for scheduled lightpath demands (SLDs) has been solved by combinatorial optimal solution (COS) and graph coloring, or heuristic sequential RWA (sRWA). Such methods are very complex and incurs large computational overhead. In this paper, we propose an efficient RWA algorithm to utilize the time disjoint property as well as space disjoint property through fast grouping of SLDs. The computer simulation shows that our proposed algorithm indeed achieves up to $54\%$ faster computation with similar number of wavelengths than the existing heuristic sRWA algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.360-370
• /
• 2010

In this paper, a distributed beamforming problem is considered in an amplify-and-forward (AF) wireless relay network consist of multiple source-destination pairs and relaying nodes. To exploit degree of freedom of the number of beamformers, in the first step, we proposed that the sources transmit their signals through orthogonal channels. During the second step, the relays transmit their received signals multiplied by complex weights to amplify and compensate for phase changes introduced by the backward channels through one common channel. The optimal beamforming vectors are obtained through minimization of the total relay transmit power while the signal-to-interference-plus-noise ratios (SINRs) at the destinations are above certain thresholds to meet a quality of services (QoSs) level. In the numerical example, it is shown that the proposed scheme needs less transmit power for moderate network data rates than other schemes, such as space division multiplexing or time-division multiplexing scheme.

• Structural Engineering and Mechanics
• /
• v.4 no.5
• /
• pp.553-568
• /
• 1996

Finite element stiffness matrix methods are presented for finding natural frequencies (or buckling loads) and modes of repetitive structures. The usual approximate finite element formulations are included, but more relevantly they also permit the use of 'exact finite elements', which account for distributed mass exactly by solving appropriate differential equations. A transcendental eigenvalue problem results, for which all the natural frequencies are found with certainty. The calculations are performed for a single repeating portion of a rotationally or linearly (in one, two or three directions) repetitive structure. The emphasis is on rotational periodicity, for which principal advantages include: any repeating portions can be connected together, not just adjacent ones; nodes can lie on, and members along, the axis of rotational periodicity; complex arithmetic is used for brevity of presentation and speed of computation; two types of rotationally periodic substructures can be used in a multi-level manner; multi-level non-periodic substructuring is permitted within the repeating portions of parent rotationally periodic structures or substructures and; all the substructuring is exact, i.e., the same answers are obtained whether or not substructuring is used. Numerical results are given for a rotationally periodic structure by using exact finite elements and two levels of rotationally periodic substructures. The solution time is about 500 times faster than if none of the rotational periodicity had been used. The solution time would have been about ten times faster still if the software used had included all the substructuring features presented.