• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.841-849
• /
• 2012

This paper proposes an low-complexity soft-output multiple-input multiple-output (soft-MIMO) detection algorithm for achieving soft-output maximum-likelihood (soft-ML) performance under max-log approximation. The proposed algorithm is based on a parallel tree-search (PTS) applying a channel ordering by a sorted-QR decomposition (SQRD) with altered sort order. The empty-set problem that can occur in calculation of log-likelihood ratio (LLR) for each bit is solved by inserting additional nodes at each search level. Since only the closest node is inserted among nodes with opposite bit value to a selected node, the proposed node insertion scheme is very efficient in the perspective of computational complexity. The computational complexity of the proposed algorithm is approximately 37-74% of that of existing algorithms, and from simulation results for a $4{\times}4$ system, the proposed algorithm shows a performance degradation of less than 0.1dB.

• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.315-321
• /
• 2009

Erd$\"{o}$s posed the problem of determining the minimum number g(n) such that any set of g(n) points in general position in the plane contains an empty convex n-gon. In 1978, Harborth proved that g(5) = 10. We reprove the result in a geometric approach.

• Communications of Mathematical Education
• /
• v.22 no.4
• /
• pp.471-487
• /
• 2008

Inventive mathematical thinking, original mathematical problem solving ability, mathematical invention and so on are core concepts, which must be emphasized in all branches of mathematical education. In particular, Polya(1981) insisted that inventive thinking must be emphasized in a suitable level of university mathematical courses. In this paper, the author considered two cases of inventive problem solving ability shown by his many students via real analysis courses. The first case is about the proof of the problem "what is the derived set of the integers Z?" Nearly all books on mathematical analysis sent the question without the proof but some books said that the answer is "empty". Only one book written by Noh, Y. S.(2006) showed the proof by using the definition of accumulation points. But the proof process has some mistakes. But our student Kang, D. S. showed the perfect proof by using The Completeness Axiom, which is very useful in mathematical analysis. The second case is to show the infinite countability of NxN, which is shown by informal proof in many mathematical analysis books with formal proofs. Some students who argued the informal proof as an unreasonable proof were asked to join with us in finding the one-to-one correspondences between NxN and N. Many students worked hard and find two singled-valued mappings and one set-valued mapping covering eight diagrams in the paper. The problems are not easy and the proofs are a little complicated. All the proofs shown in this paper are original and right, so the proofs are deserving of inventive mathematical thoughts, original mathematical problem solving abilities and mathematical inventions. From the inventive proofs of his students, the author confirmed that any students can develope their mathematical abilities by their professors' encouragements.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.59-66
• /
• 2004

We define a SG(String Graph) and an ASG(Alive String Graph) to the purpose to do static analysis. For a life and death judgment, we apply the rule to the situation which the stone is included and not included. We define the rules that are SR(String Reduction), ER(Empty Reduction), ET(Edge Transform), and CG(Circular Graph), when the stone is not included. We define the rules that are DESR(Dead Enemy Strings Reduction) and SCSR(Same Color String Reduction), when the stone is included. We evaluate a SG that it is an ASG or not by using rules. And we use APC(Articulation Point Check) nile according to number of articulation points lot a life and death judgment. The performance of our method has been tested on the problem set IGS_31_counted form the Computer Go Test Collection. The test set contains 11,191 Points and 1,123 Strings. We obtain 92.5% accuracy of Points and 95.7% accuracy of Strings.

• Proceedings of the KSR Conference
• /
• 2003.10c
• /
• pp.103-108
• /
• 2003

Among welded structure bogies in use for high speed freight car, a part of bogies manufactured in 1999 and 2000 have found problems that failure occurs in its end beam. In case of a freight car a difference of weight between empty and loading conditions are worse than in case of a passenger car. Moreover its brake system is tread brake without second suspension system. A failure of end beam is supposed to be due to loading by brake rather than vertical loading by freight. This failure can make brake system useless and may be a cause of derailment in the worst case. In this study, in order to be proved the cause of failure and to solve the problem it is described that we have measured load history acted on end beam and set up the procedures.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.7
• /
• pp.677-682
• /
• 2007

Concurrent competition for finite resources by multiple parts in flexible manufacturing systems(FMS's) and inappropriate initial marking or net structure of Petri net with share resources results in deadlock. This is an important issue to be addressed in the operation of the systems. Deadlock is a system state so that some working processes can never be finished. Deadlock situation is due to a wrong resource allocation policy. In fact, behind a deadlock problem there is a circular wait situation for a set of resources. Deadlock can disable an entire system and make automated operation impossible. Particularly, an unmanned system cannot recover from such a status and a set of jobs waits indefinitely for never-to-be-released resources. In this paper, we proposed a deadlock prevention method using siphon and trap of Petri net. It is based on potential deadlock which are siphon that eventually became empty. This method prevents the deadlock by the control of transition fire and initial marking in the Petri net. An given example of FMS is shown to illustrate our results with deadlock-free.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.627-629
• /
• 2017

There are a lot of research results on the problem of finding the union and intersection of n rectangles on a plane. Lipski와 Preparata(1981) presented a sequential algorithm with O(nlogn) time and O(nlogn) space for the problem of finding the union of rectangles whose sides are parallel to the coordinate axes[1]. Alevizos(2013) presented an improved O(nlogn) time and O(n) space algorithm for the same problem[2]. In this paper, we consider the problem of finding the union of iso-oriented rectangles such that the intersection of them is not an empty set. In this case, the union of the rectangles becomes a connected area, that is, an orthogonal polygon. In this paper, we propose a parallel algorithm that solves this problem in constant time in a reconfigurable mesh(in short, RMESH) model.

• Journal of the Korean Geographical Society
• /
• v.48 no.2
• /
• pp.259-271
• /
• 2013

This paper addresses the efficient facility placements to adopt a super WiFi network, taking significant considerations as the next generation 'information highway'. Since the super WiFi has a wider geographic coverage by utilizing the white spaces of TV broadcasting which are empty and available frequencies for the wireless communications, it would play an important role in releasing digital divide of the internet access for low populated or mountainous areas. The purpose of this paper is to explore systematic and efficient spatial plans for the super WiFi. For doing this, we applied optimal location covering models to Gurye-gun, Jeonlanamdo. From the application, we presented optimal locations for super WiFi facilities and significant analytical results, such as the tradeoff between the number of facilities and coverage and marginal coverage for establishing super WiFi network. The results of this research would be usefully utilized for decision makers who wish to adopt a super WiFi, to extend wireless networks in a city or build a regional infrastructure of wireless facilities.

• Journal of Intelligence and Information Systems
• /
• v.20 no.2
• /
• pp.137-148
• /
• 2014

Recommender system has become one of the most important technologies in e-commerce in these days. The ultimate reason to shop online, for many consumers, is to reduce the efforts for information search and purchase. Recommender system is a key technology to serve these needs. Many of the past studies about recommender systems have been devoted to developing and improving recommendation algorithms and collaborative filtering (CF) is known to be the most successful one. Despite its success, however, CF has several shortcomings such as cold-start, sparsity, gray sheep problems. In order to be able to generate recommendations, ordinary CF algorithms require evaluations or preference information directly from users. For new users who do not have any evaluations or preference information, therefore, CF cannot come up with recommendations (Cold-star problem). As the numbers of products and customers increase, the scale of the data increases exponentially and most of the data cells are empty. This sparse dataset makes computation for recommendation extremely hard (Sparsity problem). Since CF is based on the assumption that there are groups of users sharing common preferences or tastes, CF becomes inaccurate if there are many users with rare and unique tastes (Gray sheep problem). This study proposes a new algorithm that utilizes Social Network Analysis (SNA) techniques to resolve the gray sheep problem. We utilize 'degree centrality' in SNA to identify users with unique preferences (gray sheep). Degree centrality in SNA refers to the number of direct links to and from a node. In a network of users who are connected through common preferences or tastes, those with unique tastes have fewer links to other users (nodes) and they are isolated from other users. Therefore, gray sheep can be identified by calculating degree centrality of each node. We divide the dataset into two, gray sheep and others, based on the degree centrality of the users. Then, different similarity measures and recommendation methods are applied to these two datasets. More detail algorithm is as follows: Step 1: Convert the initial data which is a two-mode network (user to item) into an one-mode network (user to user). Step 2: Calculate degree centrality of each node and separate those nodes having degree centrality values lower than the pre-set threshold. The threshold value is determined by simulations such that the accuracy of CF for the remaining dataset is maximized. Step 3: Ordinary CF algorithm is applied to the remaining dataset. Step 4: Since the separated dataset consist of users with unique tastes, an ordinary CF algorithm cannot generate recommendations for them. A 'popular item' method is used to generate recommendations for these users. The F measures of the two datasets are weighted by the numbers of nodes and summed to be used as the final performance metric. In order to test performance improvement by this new algorithm, an empirical study was conducted using a publically available dataset - the MovieLens data by GroupLens research team. We used 100,000 evaluations by 943 users on 1,682 movies. The proposed algorithm was compared with an ordinary CF algorithm utilizing 'Best-N-neighbors' and 'Cosine' similarity method. The empirical results show that F measure was improved about 11% on average when the proposed algorithm was used