• Communications for Statistical Applications and Methods
• /
• 제15권4호
• /
• pp.587-595
• /
• 2008

Parallel coordinate plot of Inselberg (1985) is useful for visualizing dozens of variables, but so far the plot's applicability is limited to the variables of numerical type. The aim of this study is to extend the parallel coordinate plot so that it can accommodate both numerical and categorical variables. We combine Hayashi's (1950, 1952) quantification method of categorical variables and Hurley's (2004) endlink algorithm of ordering variables for the parallel coordinate plot. In line with our former study (Kwak and Huh, 2008), we develop Andrews' type modification of conventional straight-lines parallel coordinate plot to visualize the mixed-type data.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 추계학술대회 논문집
• /
• pp.89-92
• /
• 2002

As the use of Internet being generalized, ordering system can be easily achieved on the Web so that the direct sailing system is replaced the various types of Built-To-Order system. It is important to give the up-to-date information to the end-user in order to build the Built-To-Order system. Recently, the way of providing information is updating the product related information continuously. In this study, we provide the method that can be streamlined Product Data Management System which manages a creation and update for product information into the direct BTO system in order to achieve the newest information. This methodology is not only transferring the information but also processing the information in an appropriate form. So this paper is going to cover the various point of view of information processing.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.745-746
• /
• 2006

In this paper, we propose a new predictive coding scheme for color data of three-dimensional (3-D) mesh models. We exploit connectivity and geometry information to improve coding efficiency. After ordering all vertices in a 3-D mesh model with a vertex traversal technique, we employ a geometry predictor to compress the color data. The predicted color can be acquired by a weighted sum of reconstructed colors for adjacent vertices using both angles and distances between the current vertex and adjacent vertices.

• International Journal of Reliability and Applications
• /
• 제4권4호
• /
• pp.171-181
• /
• 2003

This paper proposes a U-test statistic for the problem of testing that a life distribution is exponential against the alternative that it is harmonic new better (worse) than used in expectation upper tail HNBUET (HNWUET), but not exponential on complete data. Selected critical values are tabulated for sample sizes n =5(1)60. The asymptotic normality of the statistic is proved and a comparison is made of the asymptotic efficiency between the statistic and other statistics. The power of the test is studied by simulation. A test for HNBUET in the case of randomly right-censored data is also considered. An application of the proposed test statistic in medical sciences is given.

• International journal of advanced smart convergence
• /
• 제8권3호
• /
• pp.46-53
• /
• 2019

When a partitioned structure is derived from a data set using a clustering algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of data. This problem is known as the order bias problem. Many algorithms in machine learning fields try to achieve optimized result from available training and test data. Optimization is determined by an evaluation function which has also a tendency toward a certain goal. It is inevitable to have a tendency in the evaluation function both for efficiency and for consistency in the result. But its preference for a specific goal in the evaluation function may sometimes lead to unfavorable consequences in the final result of the clustering. To overcome this bias problems, the first clustering process proceeds to construct an initial partition. The initial partition is expected to imply the possible range in the number of final clusters. We apply the data centric sorting to the data objects in the clusters of the partition to rearrange them in a new order. The same clustering procedure is reapplied to the newly arranged data set to build a new partition. We have developed an algorithm that reduces bias effect resulting from how data is fed into the algorithm. Experiment results have been presented to show that the algorithm helps minimize the order bias effects. We have also shown that the current evaluation measure used for the clustering algorithm is biased toward favoring a smaller number of clusters and a larger size of clusters as a result.

• 한국도서관정보학회지
• /
• 제12권
• /
• pp.133-160
• /
• 1985

In college or university libraries, the data of dissertations is one of the important academic information data. But traditional cataloging rules of dissertations and the method of operation is not only didn't unify but also fit to actual circumstances of library. This reason make librarians waste of time and the situation about piling up of unprocessed data don't make library services properly. In this papers, to analyze the above mentioned problems, I have investigated with questionaries about actual examples of construction methods of call number and item describing form of dissertations which is being used now in every college library in Korea. With the replied 61 questionaries which was compared with and investigated to merits and faults about library itself, I have showed revision ways. The characteristics of the revision ways are the followings. 1) Deleted informal and unmeaning descriptions and simplified describing. 2) Recommended to operating one or two kinds describing items which are only necessary. 3) Made call number specifically and then it make us easy to identify data and simultaneously call number can do its original action. 4) shelving range of data is made to colleges, years, departments, majors but in same departments, author's name is recommended by Korean alphabetical ordering. Besides, for proper and systematic management and operating of data. It must be necessary to recommend that reading systems of closed shelves type, incoming and outgoing and shelving by fulltime exclusive charged librarian, separate management of items and data are recommended.

• 정보처리학회논문지D
• /
• 제15D권2호
• /
• pp.163-170
• /
• 2008

인터넷과 인트라넷의 확산에 따라, 스트림 데이터 처리 (stream data processing) 와 같은 새로운 분야가 등장하게 되었다. 스트림 데이터는 실시간적이고 연속적으로 생성된다. 본 논문에서는 시간에 따라서 예측할 수 없게 특성이 바뀌는 데이터 스트림에 대한 처리에 대하여 다룬다. 특별히, 본 논문에서는 스트림 데이터에 대한 질의문을 구성하는 연산자들 간의 효율적인 수행 순서 생성 기법인 WT-Heuristics를 제안한다. WT-Heuristics 기법은 연산 실행 순서에서 인접한 두 연산자들의 연산 순서만을 고려함으로써 효율적으로 연산자 순서를 결정할 수 있다. 또한 본 논문에서 제안하는 방법은 시스템의 부담을 적게 주면서도 데이터의 변화에 따라 수행 순서를 변화시킨다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 봄 학술발표논문집 Vol.30 No.1 (B)
• /
• pp.193-195
• /
• 2003

The analysis of EEG data is an important task in the domain of Brain Computer Interface (BCI). In general, this task is extremely difficult because EEG data is very noisy and contains many artifacts and consists of mixtures of several brain waves. The P300 component of the evoked potential is a relatively evident signal which has a large positive wave that occurs around 300 msec after a task-relevant stimulus. Thus automatic detection of P300 is useful in BCI. To this end, in this paper we employ a method of reference-based independent component analysis (ICA) which overcomes the ordering ambiguity in the conventional ICA. We show here. that ICA incorporating with prior knowledge is useful in the task of automatic P300 detection.

• 경영과학
• /
• 제15권1호
• /
• pp.49-62
• /
• 1998

The purpose of this paper is to develope a large-scale simplex method program LPAKO. Various up-to-date techniques are argued and implemented. In LPAKO, basis matrices are stored in a LU factorized form, and Reid's method is used to update LU maintaining high sparsity and numerical stability, and further Markowitz's ordering is used in factorizing a basis matrix into a sparse LU form. As the data structures of basis matrix, Gustavson's data structure and row-column linked list structure are considered. The various criteria for reinversion are also discussed. The dynamic steepest-edge simplex algorithm is used for selection of an entering variable, and a new variation of the MINOS' perturbation technique is suggested for the resolution of degeneracy. Many preprocessing and scaling techniques are implemented. In addition, a new, effective initial basis construction method are suggested, and the criteria for optimality and infeasibility are suggested respectively. Finally, LPAKO is compared with MINOS by test results.

• 경영과학
• /
• 제12권2호
• /
• pp.89-103
• /
• 1995

Traditionally, the scarce and expensive resources in communication networks has been the bandwidth of transmission facilities; accordingly, the techniques used for networking and switching have been chosen so as to optimize the efficient use of that resource. One of them is the packet switching for data communications, which is much different from the circuit switching. It allows multiple users to share the data network facilities and bandwidth, rather than providing specific amounts of dedicated bandwidth to each users. One main challenge therefore has been to design and build cost-effective packet switching networks. In this paper, we develop a mathematical programming medel and heuristic algorithm for designing the packet switching networks with hop-count constraints. To develop an efficient heuristic, we apply the Lagrangian relaxation method. Some valid inequalities, which have been known as the tight constraints, are considered to improve the bound for Lagrangian sub-problem. The computational experiments show that the performance of the proposed heuristic is very satisfactory in both the speed and the quality of design solutions generated.