• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.775-782
• /
• 2005

In this paper, we propose multicast technique in order to reduce the required network bandwidth by n times, by merging the adjacent multicasts depending on the number of HENs (Head-End-Nodes) n that request the same video. Allowing new clients to immediately join an existing multicast through patching improves the efficiency of the multicast and offers services without any initial latency. A client might have to download data through two channels simultaneously, one for multicast and the other for patching. The more the frequency of requesting the video is, the higher the probability of caching it among HENs increases. Therefore, the requests for the cached video data can be served by HENs. Multicast from server is generated when the playback time exceeds the amount of cached video data. Since the interval of multicast can be dynamically expanded according to the popularity of videos, it can be reduced the server's workload and the network bandwidth. We perform simulations to compare its performance with that of conventional multicast. From simulation results, we confirm that the Proposed multicast technique offers substantially better performance.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.803-810
• /
• 2005

Information retrieval is one of the most challenging areas in which the ontology technology is effectively used. Among them image retrieval using the image meta data and ontology is the one that can substitute the keyword-based image retrieval. In the paper, the retrieval of visual media such as the art image and photo picture is handled. It is assumed that there are more than one service providers of the visual media and also there is one central service broker that mediates the user's query. Given the user's query the first step that must be done in the service broker is to get the list of candidate service providers that fit the query. This is done by defining various ontologies such as the service ontology and matching the query against the ontology and providers. A novel matching method based on the ASN.1. The experiment shows that the method is more effective than existing tree-based and interval-based methods. Ontology merging issue is also handled that can happen when the service providers register their service into the service broker. An effective method is also proposed.

• The Journal of the Korea Contents Association
• /
• v.13 no.9
• /
• pp.143-154
• /
• 2013

This study reviewed reorganization of bureaucrats in the beginning of Lee Myung bak's government from the perspective of the relationship between politicians and bureaucrats. In other words, it analyzed the reorganization of central office group of Korean government in 2008 as the relationship between calling to account by politicians and avoiding calling to account by bureaucrats. Conclusively, first, separation or abolition of a certain organization was resulted from calling to account by president (the ruling party). Second, merging organizations was done because president wanted strong control on that agency or he wanted to realize presidential election pledge (policy) through the agency. Third, if an organization was not changed even though it was selected as the target of abolition, it meant that the organization succeeded in defense. As seen from the above cases, it was found that politicians and bureaucrats played a kind of game for reorganization of government organizations. First of all, if politicians succeeded in calling to account, the bureaucratic organization was separated or abolished. If bureaucrats succeeded in self defense, the organization became expanded. Finally, if both parties were even, corresponding organizations would not have changes.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.257-262
• /
• 2010

SOA (Service-Oriented Architecture), which has become very popular recently, is a new paradigm for software development and application. In this paper, we propose an integrated architecture which is able to effectively manage and control a variety of services for U-City projects focusing on the importance of service integration. SOA has a number of important features such as loose coupling, standard bases, and distributed computing, all of which are the essential elements for merging and providing various services in U-City projects. We exploit the ESB (Enterprise Service Bus) for reflecting those features, which is a core module linking mutually heterogeneous components so that the communication of services can be implemented. In this paper, we discuss the necessity of SOA in U-City services and a possible scenario and method for the implementation. Finally, we propose an integrated architecture for the U-City Integration and Management Center.

• Journal of Information Management
• /
• v.40 no.1
• /
• pp.199-215
• /
• 2009

The web 2.0 concept rapidly spreads to the various field which is based on an opening, the participation, and a share. And the research about the recommendation system, that is the personalize feature, and social network is very active. In the case of the recommendation system and social network, it had been developing in the respectively different area and the new research toward the service model of a form that it fuses these is insignificant. In this paper, I'm going to introduce efficient social network which is called the researcher connection network. It is possible to recommend the researcher intellectually who studies the similar field by analyzing the usage log and user profile. Through this study, we could solved the network expandability problem which is due to the user passive participation and the difficulty of the initial network construction that is the conventional social network problem.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2061-2074
• /
• 1998

In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.61-74
• /
• 2002

This paper presents a method which synthesizes asynchronous circuits from free-choice Signal Transition Graphs (STGs) with timing constraints. The proposed method synthesizes asynchronous circuits by analyzing: the relations between signal transitions directly from the STGs without generating state graphs. The synthesis procedure decomposes a free-choice STG into deterministic STGs which do not have choice behavior. Then, a timing analysis extracts the timed concurrency and tamed causality relations between any two signal transitions for each deterministic STG. The synthesis procedure synthesizes circuits for each deterministic STG and synthesizes the final circuit by merging the circuits for each deterministic STG. The experimental results show that our method achieves significant reductions in synthesis time for the circuits which have a large state space, and generates circuits that have nearly the same area as compared to previous methods.

• Journal of Korean Society of Transportation
• /
• v.34 no.4
• /
• pp.354-372
• /
• 2016

This study identified factors affecting the crash severity at freeway work zones. A nice feature of this study was to take into account the characteristics of work zone traffic management in analyzing traffic safety concerns. In addition to crash records, vehicle detection systems (VDS) data and work zone historical data were used for establishing a dataset to be used for statistical analyses based on an ordered probit model. A total of six safety improvement strategies for freeway work zones, including traffic merging method, guidance information provision, speed management, warning information systems, traffic safety facility, and monitoring of effectiveness for countermeasures, were also proposed.

• Journal of Veterinary Clinics
• /
• v.28 no.5
• /
• pp.526-529
• /
• 2011

The brachiocephalic trunk (Bct) branches from the aortic arch (Aa) and consists, in ruminants, of the common trunk of the left subclavian artery (LSb), the bicarotid artery (Bc) or left and right common carotid artery (LCc and RCc), and the right subclavian artery (RSb). This pattern differs from the primitive mammalian Aa pattern due to the fact that the analogs of the LCc and LSb migrate cranially and merge with the common trunk of the RCc and RSb in the embryonic stage. A Bct having a septal remnant that consisted of the tunica media was observed in a female Korean water deer (Hydropotes inermis argyropus), which was deemed to have resulted from an incomplete merging of the vessel walls between a carnivoran-type Bct and an incomplete LSb. This is the first report of an abnormal Bct in a Korean water deer.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.32 no.5
• /
• pp.551-563
• /
• 2012

Medical ultrasound systems have been used since 1950s, and are now widely used in most hospitals as indispensable diagnostic imaging systems. Since array probe was introduced in 1970s, beamforming technology using electronic signal processing has been adopted to the medical ultrasound system, and has been improved. Beamforming is a important technology which defines the resolution of the ultrasound system. In this paper, the technologies are introduced from basic beamforming principles to current trend. They include principles of beamforming using array probe, basic theory, and practical implementation, and recent topics of synthetic aperture imaging, adaptive beamforming, 2-dimensional beamforming using 2-dimensional array are also introduced. These various technologies will improve system performances continuously by merging innovatively with various technologies in other fields.