• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12C
• /
• pp.1020-1028
• /
• 2010

Relay has attracted great attention due to its inherent capability to extend the service coverage and combat shadowing in next generation mobile communication systems. So far, most relay technologies have been developed under the half-duplex (HD) constraint that prevents relays from transmitting and receiving at the same time. Although half-duplex relay (HDR) is easy to implement, it requires partitioning of resource for transmission and reception, reducing the whole system capacity. In this paper, we propose a multinser precoding and power control scheme with sum rate matching for a full-duplex (FD) multiple-input multiple-output (MIMO) relay. Full-duplex relay (FDR) can overcome the drawback of HDR by transmitting and receiving on the same frequency at the same time, while it is crucial to reduce the effect of self-interference that is caused by its own transmitter to its own receiver. The proposed precoding scheme cancels the self-interference of the FDR as well as to support multiuser MIMO. Moreover, we suggest a power allocation scheme for FD MIMO relay with the constraint that the sum rate of the relay's received data streams is equal to that of the relay's transmit data streams.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3223-3231
• /
• 2010

For a long time, most of advanced countries have supported the innovative firms with various support methods such as tax credit, subsidy, human resource education, and so on. Tax credit for innovation is the most popular industrial policy in these countries including Korea. However, in Korea, the effect of tax credit policy has been rarely analyzed. On the other hand, a considerable number of studies discover that tax credit policy in other countries influences positively on invest of R&D expenditure. This paper shows that tax credit policy positively influences on firm's innovation performances in Korea. The evaluated innovative effect of tax credit policy in this paper is more persuasive because it introduces various innovation performance variables including patent application with Propensity score matching method(PSM).

• Journal of Information Management
• /
• v.41 no.3
• /
• pp.191-209
• /
• 2010

A reference linking service that is connection of each other different information resource need to setup the reference database and to match identifier. CrossRef, PubMed and Web Of Science etc. the many overseas agencies developed reference linking service, that they used the automatic tools of Inera eXstyles, Parity Computings Reference Extractor etc. and setup in base DOI and PMID etc. Domestic the various agencies of KISTI(Korea Institute Science and Technology of Information), KRF(Korea Research Foundation) etc are construction reference database. But each research communities adopts a various reference bibliography writing format. As, the data base construction which is collect is confronting is many to being difficult. In this paper, We developed the Citation Matcher System. This system is automatic parsing the reference string to metadata and matching DOI, PMID and KOI as Identifier. It is improved the effectiveness of reference database setup.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.476-485
• /
• 2006

The Resource Description Framework(RDF), which emerged with the semantic web, is settling down as a standard for representing information about the resources in the World Wide Web Hence, a lot of research on storing and query processing RDF documents has been done and several RDF storage systems, such as Sesame and Jena, have been developed. But the research on updating RDF documents is still insufficient. When a RDF document is changed, data in the RDF triple store also needs to be updated. However, current RDF triple stores don't support incremental update. So updating can be peformed only by deleting the old version and then storing the new document. This updating method is very inefficient because RDF documents are steadily updated. Furthermore, it makes worse when several RDF documents are stored in the same database. In this paper, we propose an incremental update algorithm on RDF, documents in triple stores. We use a text matching technique for two versions of a RDF document and compensate for the text matching result to find the right target triples to be updated. We show that our approach efficiently update RDF documents through experiments with real-life RDF datasets.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.2
• /
• pp.85-92
• /
• 2009

This paper proposes a full-search block-matching motion estimation circuit with hybrid architecture combining systolic arrays and adder trees for an MPEG-4 encoder. The proposed circuit uses systolic arrays for motion estimation with a small number of clock cycles and adder trees to reduce required circuit resources. The interpolation circuit for 1/2 pixel motion estimation consists of six adders, four subtracters and ten registers. We improved the circuit performance by resource sharing and efficient scheduling techniques. We described the motion estimation circuit for integer and 1/2 pixels at RTL in Verilog HDL. The logic-level circuit synthesized by using 130nm standard cell library contains 218,257 gates and can process 94 D1($720{\times}480$) image frames per second.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.87-103
• /
• 2009

Grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because Grid middleware does not have common sharable information system. In order to use Grid computing environment efficiently which consists of various Grid middlewares, it is necessary to have application-independent information system which can share information description and services, and expand them easily. Thus, in this paper, we propose a semantic information system framework based on web services and ontology for Grid computing environment, called WebSIS. It makes application and middleware developer easy to build sharable and extensible information system which is easy to share information description and can provide ontology based platform-independent information services. We present efficient ontology based information system architecture through WebSIS. Discovering appropriate resource for task execution on Grid needs more high-level information processing because Grid computing environment is more complex than other traditional distributed computing environments and has various considerations which are needed for Grid task execution. Thus, we design and implement resource information system and services by using WebSIS which enables high-level information processing by ontology reasoning and semantic-matching, for automation of task execution on Grid.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.3
• /
• pp.15-20
• /
• 2005

Since the invention of Web, it became part of our daily life replacing the routine information search and effecting many activities which otherwise could have been done off-line without it. It was a natural evolution of the web technology, which had started out as a simple test based pattern matching, to be based on the optimized match process for its multi-media Web environment, like still images, music and movies that we are to face today. In this paper, we proposed and implemented the model which the multimedia resources can be efficiently shared in semantic web. After converting multimedia resource information(metadata) into RDF, for efficient management, the model separate and allotment actual multimedia resource and corresponding metadata changed to RDF to each server. The proposed model could be applied in all multimedia resources. For easy explanation and implementation, however, we applied it to the digital photograph in example.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.4
• /
• pp.116-122
• /
• 2020

Human and material resource planning is one representative example of Operations Research. Resource planning is important not only in civilian settings but also in military ones. In the Air Force, flight scheduling is one of the primary issues that must be addressed by the personnel who are connected to flight missions. However, although the topic is of great importance, relatively few studies have attempted to resolve the problem on a scientific basis. Each flight squadron has its own scheduling officers who manually draw up the flight schedules each day. While mistakes may not occur while drafting schedules, officers may experience difficulties in systematically adjusting to them. To increase efficiency in this context, this study proposes a mathematical model based on a binary variable. This model automatically drafts flight schedules considering pilot's mission efficiency. Furthermore, it also recommends that schedules be drawn up monthly and updated weekly, rather than being drafted from scratch each day. This will enable easier control when taking the various relevant factors into account. The model incorporates several parameters, such as matching of the main pilots and co-pilots, turn around time, availability of pilots and aircraft, monthly requirements of each flight mission, and maximum/minimum number of sorties that would be flown per week. The optimal solution to this model demonstrated an average improvement of nearly 47% compared with other feasible solutions.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.10 s.352
• /
• pp.34-44
• /
• 2006

A system-on-a-chip (SoC) design uses pre-verified IP hardware blocks in order to reduce design time. We need interface circuits to connect IPs with different protocols. In SoC design we should design interface circuits frequently and these tasks are somewhat time-consuming and error-prone. So it is necessary to generate the interface circuits automatically. Several studies have been made on generating interface circuits only from the communication protocols of IPs. With existing approaches, it is not easy to generate interface circuits connecting two IPs only from communication protocols: connection between IP with address and W without address, connection between IP with only one port to transfer address/data and IP with different ports for address and data connection between IP that transfer address and data together and IP that transfer only one address with a number of data in a burst. No consideration of various characteristics of IPs and no changed algorithm are responsible for it. In order to solve this problem, the proposed approach categorizes communication protocols of IPs, and takes characteristics matching of IPs into account during the interface synthesis. In experiments, we show that we could correctly generate and verify interface circuits for IPs with different characteristics.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.946-952
• /
• 2014

Mobility prediction is one of hot topics using location history information. It is useful for not only user-level applications such as people finder and recommendation sharing service but also for system-level applications such as hand-off management, resource allocation, and quality of service of wireless services. Most of current prediction techniques often use a set of significant locations without taking into account possible location information changes for prediction. Markov-based, LZ-based and Prediction by Pattern Matching techniques consider interesting locations to enhance the prediction accuracy, but they do not consider interesting location changes. In our paper, we propose an algorithm which integrates the changing or emerging new location information. This approach is based on Active LeZi algorithm, but both of new location and all possible location contexts will be updated in the tree with the fixed depth. Furthermore, the tree will also be updated even when there is no new location detected but the expected route is changed. We find that our algorithm is adaptive to predict next location. We evaluate our proposed system on a part of Dartmouth dataset consisting of 1026 users. An accuracy rate of more than 84% is achieved.