• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.151-154
• /
• 2007

This paper describes the project for constructing a traceability system for producing using RFID antenna in 900MHz frequency band and the consideration. In this project we reviewed analysis of properties classified by production process and RFID system through each frequency band, and designed a single unit RFID reader including antenna. The developed antenna is optimized to a field condition and this paper will show the test results. Also, we designed a single unit RFID reader by adding a reader to a designed antenna and explained the rule of tag memory allocation. Lastly, after running the system we could calculate visible and invisible effects of operation results and check up a wide possibility of application for RFID.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.49
• /
• pp.43-59
• /
• 2011

Incoterms 2010 have been revised in line with the latest changes in contemporary commercial practice. An understanding of Incoterms 2010 is essential. The Incoterms rules on the use of domestic and international trade terms, facilitate the conduct of global trade. Reference to an Incoterms 2010 rule in a sale contract clearly defines the parties' respective obligations and reduces the risk of legal complications. In 1980 the United Nations Convention on Contracts for the International Sale of Goods(CISG) was introduced to create international certainty and uniformity in the law and to govern issues that arise in an international sale of goods transaction. This paper focuses on harmony and ability of the CISG and Incoterms 2010 to govern contracts for the sale of goods.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.7
• /
• pp.885-895
• /
• 2004

Generally, automatic design is carried out with computer simulation and the simulation models are established by investigating the correlations between the simulation and real experiments. Therefore, the experiment results are utilized as complimentary data although they are considered to be precise. Orthogonal arrays have been adopted for discrete design. A method is proposed to directly exploit the experiment results in the design process with orthogonal arrays. Experiments are allocated to some rows of an orthogonal array and computer simulations are allocated to the others. A rule for the allocation is found to keep the orthogonality. Error analysis of the design results is performed. Mathematical examples are made to verify the validity of the proposed method. Error models are defined with the examples and the design solutions from the examples are discussed.

• IE interfaces
• /
• v.12 no.2
• /
• pp.210-221
• /
• 1999

Several researchers have previously studied the problem of allocating buffer storage to maximize the throughput rate and/or minimize the mean buffer average of a transfer line for a given total amount of buffer space. But there seems to be very little difference in performance between intuitively reasonable and optimal allocations. This paper proposes and illustrates a methodology, based on the robust design concept of Taguchi, to allocate buffer storage of long transfer lines with a given total amount of buffer capacity when up and down times follow exponential distributions, respectively. We show how this procedure using simple heuristic rule can be used for design of long transfer lines.

• Journal of Intelligence and Information Systems
• /
• v.4 no.2
• /
• pp.45-59
• /
• 1998

다양한 산업영역에서 수행되는 스케줄링 문제를 해결하기 위하여 AI분야에서는 지식을 기반으로한 방법이 적용되어 왔다. 그러나 최근 CSP(Constraints Satisfaction Problem) 개념이 소개되어 그 효율성이 입증되고 있으며 스케줄링 응용 문제들이 CSP로 정형화되면서부터 지식 기반 기법과 제약만족 기법의 적용이 공존하고 있다. 지식을 기반으로 한 방법은 도메인 전문가(domain expert)의 지식을 습득하여 시스템에 반영하는데 이러한 지식은 문제해결에 중심적 역할을 수행하게 된다. 제약조건을 기반으로 한 방법은 문제를 CSP로 정형화 한 후 제약조건에 따른 일관성 유지 및 휴리스틱 탐색 방법을 적용하여 문제의 해를 효율적으로 구하게 된다. 본 연구에서는 스케줄링 문제를 해결하기 위한 지식기반 기법과 제약만족 기법을 주기장 할당 문제에 적용하여 실제 항공사의 운항 데이터를 바탕으로 실험하고 분석 및 비교를 통해 제약 만족 기법이 시스템의 유지 및 보수 측면에서 효율적이며 근사해가 아닌 최적해를 통한 문제 해결이 가능함을 보였다.

• Asia pacific journal of information systems
• /
• v.18 no.2
• /
• pp.95-114
• /
• 2008

Recent interests in data mining result from the expansion of the amount of business data and the growing business needs for extracting valuable knowledge from the data and then utilizing it for decision making process. In particular, recent advances in association rule mining techniques enable us to acquire knowledge concerning sales patterns among individual items from the voluminous transactional data. Certainly, one of the major purposes of association rule mining is to utilize acquired knowledge in providing marketing strategies such as cross-selling, sales promotion, and shelf-space allocation. In spite of the potential applicability of association rule mining, unfortunately, it is not often the case that the marketing mix acquired from data mining leads to the realized profit. The main difficulty of mining-based profit realization can be found in the fact that tremendous numbers of patterns are discovered by the association rule mining. Due to the many patterns, data mining experts should perform additional mining of the results of initial mining in order to extract only actionable and profitable knowledge, which exhausts much time and costs. In the literature, a number of interestingness measures have been devised for estimating discovered patterns. Most of the measures can be directly calculated from what is known as a contingency table, which summarizes the sales frequencies of exclusive items or itemsets. A contingency table can provide brief insights into the relationship between two or more itemsets of concern. However, it is important to note that some useful information concerning sales transactions may be lost when a contingency table is constructed. For instance, information regarding the size of each market basket(i.e., the number of items in each transaction) cannot be described in a contingency table. It is natural that a larger basket has a tendency to consist of more sales patterns. Therefore, if two itemsets are sold together in a very large basket, it can be expected that the basket contains two or more patterns and that the two itemsets belong to mutually different patterns. Therefore, we should classify frequent itemset into two categories, inter-pattern co-occurrence and intra-pattern co-occurrence, and investigate the effect of the market basket size on the two categories. This notion implies that any interestingness measures for association rules should consider not only the total frequency of target itemsets but also the size of each basket. There have been many attempts on analyzing various interestingness measures in the literature. Most of them have conducted qualitative comparison among various measures. The studies proposed desirable properties of interestingness measures and then surveyed how many properties are obeyed by each measure. However, relatively few attentions have been made on evaluating how well the patterns discovered by each measure are regarded to be valuable in the real world. In this paper, attempts are made to propose two notions regarding association rule measures. First, a quantitative criterion for estimating accuracy of association rule measures is presented. According to this criterion, a measure can be considered to be accurate if it assigns high scores to meaningful patterns that actually exist and low scores to arbitrary patterns that co-occur by coincidence. Next, complementary measures are presented to improve the accuracy of traditional association rule measures. By adopting the factor of market basket size, the devised measures attempt to discriminate the co-occurrence of itemsets in a small basket from another co-occurrence in a large basket. Intensive computer simulations under various workloads were performed in order to analyze the accuracy of various interestingness measures including traditional measures and the proposed measures.

• Journal of Arbitration Studies
• /
• v.22 no.2
• /
• pp.53-77
• /
• 2012

Competence-competence refers to an arbitratorpower to determine whether he or she has jurisdiction to decide a controversy. Although arbitrators power to rule on their own jurisdiction is generally recognized throughout the world, in the United States, neither the courts nor legislative bodies have recognized its significance or the reasoning behind its widespread adoption. Section 3 of the Federal Arbitration Act (FAA) is notorious among arbitration statues for its failure to incorporate competence-competence. When courts rule on an issue of competence-competence, it is referred to as a question of who decides the arbitrability of the case. In the United States, the use of competence-competence as a term of art is still limited to scholarly writings. The answer to the competence-competence inquiry is found in an interpretation of section 3 of the FAA which empowers the courts to decide arbitrability issues. The cases of the Supreme Court and most commentators interpreted sections 2 and 3 of the FAA as conferring issues of arbitrability on the federal courts, including the ability to rule on the validity and scope of the arbitral agreement. Traditionally, United States courts have denied the competence-competence to arbitral tribunal. Recently, however, they have confounded the rules by placing primary importance on the arbitration agreement between the parties. The Supreme Court, in a series of cases, has underscored the necessity of giving full effect to the intentions of the parties as expressed in their agreement to arbitrate. The result of the Supreme Court's emphasis on contractualism in determining the issue of arbitrability is most evident in the Courtdecision in the First Options case. Under First Options, courts are to decide arbitrability issues unless there is a clear and unmistakable contractual assignment of these issues to the tribunal itself. The Court is appraised that it has attempted to compromise between contractual freedom in the arbitration setting and the rule of law that is necessary in a society that depends on the concept of ordered liberty. In the decision in Howsam, the Court clarified the definition of arbitrability by attempting to draw a clear line between questions of arbitrability that are to be decided by courts and those matters that bear on the allocation of decisions between courts and arbitrators but are not questions of arbitrability.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.3
• /
• pp.155-164
• /
• 2016

For frequency pattern analysis of large databases, the new tree-based frequency pattern analysis algorithm which can compensate for the disadvantages of the Apriori method has been variously studied. In frequency pattern tree, the number of nodes is associated with memory allocation, but also affects memory resource consumption and processing speed of the growth. Therefore, reducing the number of nodes in the tree is very important in the frequency pattern mining. However, the absolute criteria which need to order the transaction items for construction frequency pattern tree has lowered the compression ratio of the tree nodes. But most of the frequency based tree construction methods adapted the absolute criteria. FP-tree is typically frequency pattern tree structure which is an extended prefix-tree structure for storing compressed frequent crucial information about frequent patterns. For construction the tree, all the frequent items in different transactions are sorted according to the absolute criteria, frequency descending order. CanTree also need to absolute criteria, canonical order, to construct the tree. In this paper, we proposed a novel frequency pattern tree construction method that does not use the absolute criteria, IRFP-tree algorithm. IRFP-tree(Intersection Rule based FP-tree). IRFP-tree is constituted with the new paradigm of the intersection rule without the use of the absolute criteria. It increased the compression ratio of the tree nodes, and reduced the tree construction time. Our method has the additional advantage that it provides incremental mining. The reported test result demonstrate the applicability and effectiveness of the proposed approach.

• The KIPS Transactions:PartD
• /
• v.17D no.1
• /
• pp.1-8
• /
• 2010

Association rule mining techniques enable us to acquire knowledge concerning sales patterns among individual items from voluminous transactional data. Certainly, one of the major purposes of association rule mining is utilizing the acquired knowledge to provide marketing strategies such as catalogue design, cross-selling and shop allocation. However, this requires too much time and high cost to only extract the actionable and profitable knowledge from tremendous numbers of discovered patterns. In currently available literature, a number of interest measures have been devised to accelerate and systematize the process of pattern evaluation. Unfortunately, most of such measures, including support and confidence, are prone to yielding impractical results because they are calculated only from the sales frequencies of items. For instance, traditional measures cannot differentiate between the purchases in a small basket and those in a large shopping cart. Therefore, some adjustment should be made to the size of market baskets because there is a strong possibility that mutually irrelevant items could appear together in a large shopping cart. Contrary to the previous approaches, we attempted to consider market basket's size in calculating interest measures. Because the devised measure assigns different weights to individual purchases according to their basket sizes, we expect that the measure can minimize distortion of results caused by accidental patterns. Additionally, we performed intensive computer simulations under various environments, and we performed real case analyses to analyze the correctness and consistency of the devised measure.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.227-237
• /
• 2000

A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.