• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.500-505
• /
• 2009

In this paper, We present a low complexity candidate list generation scheme in iterative MIMO receiver. Since QAM modulation can be decomposed into HP symbols and LP symbol and HP symbol is robust in error capability, we generate HP symbol list with simple ZF detector output and its corresponding neighbor HP symbols, Then, based on HP symbol list, the LP symbol list is generated by using the sphere decoder. From the second iteration, since apriori value from channel decoder is available, the candidate list is updated based on demodulated apriori value. Through the simulation, we observe that at the first iteration, the BER performance is worse than LSD. However, as the number of iteration is increased, the proposed scheme has almost same performance as LSD. Moreover, the proposed one has reduced candidate list generation time and lower number of candidate list compared with LSD.

• Analyses & Alternatives
• /
• v.3 no.1
• /
• pp.63-92
• /
• 2019

What motivates split-ticket voting in mixed electoral systems, where voters choose one party in district races and another party on the party list ballot? While much of the literature assumes strategic intent, three aspects commonly are overlooked: the competitiveness of district races, the presence of a district candidate from one's preferred party, and whether voters know the electoral threshold for party list seats. Furthermore, few studies disaggregate types of split-ticket voting (e.g. not voting for one's preferred party in a district vs. party list). Taiwan provides an intriguing case study for analysis, not only as a relatively new adopter of a mixed system, but also the presence of additional conditions that would encourage at least the consideration of a split ticket. Using survey data from the Taiwan's Election and Democratization Studies (TEDS) after the Taiwan's 2016 Legislative Yuan election, this analysis finds that knowing the threshold, the winner's margin, and the placement of a district candidate from one's preferred party all influence split-ticket voting among those with a partisan preference. However, closer inspection identifies a distinction between defecting from the district versus the party list. Evidence shows that district competitiveness and candidate placement influences defection from the district candidate, while the electoral threshold influences defection from the party list. The results add to our understanding of strategic and non-strategic incentives in mixed systems.

• Journal of Broadcast Engineering
• /
• v.24 no.1
• /
• pp.41-47
• /
• 2019

Recently, enhanced methods on the inter merging have been being investigated in Versatile Video Coding (VVC) standardization which will be a next generation video coding standard with capability beyond the High Efficiency Video Coding (HEVC). If there is not enough motion information available in the neighboring blocks in the merge mode, zero motion candidate is inserted into the merge candidate list, which could make the coding efficiency decreased. In this paper, we propose an efficient method of constructing the merge mode candidate list to reduce the case that the zero motion is used as a candidate by generating an alternative merge candidate. Experimental results show that the proposed method gives the average BD-rate gain of 0.2% with the decoding time increase of 3% in the comparison with VTM 1.0.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.422-425
• /
• 2012

This paper proposes the CU-based approach for merge candidate list construction for providing reduced complexity and improved parallelism compared to the PU-based one. In the proposed method, a CU can have only one merge candidate list. So, Only one common merge candidate list is used for all PUs in a CU regardless of the PU partition type. The simulation results of proposed method showed that the encoder computational complexity was decreased by 3% to 6% and the decoder computational complexity was negligible change with the penalty of roughly 0.2% - 0.5% coding loss. The proposed method has several advantages: it provides simpler design, reduced complexity, and improved parallelism.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.233-236
• /
• 2003

In this paper, we propose a method to search the evidence such as a knife found in the crime scene based on GHT from an image database Such objects like knives are simitar in shape. The proposed method utilizes the small shape differences among objects as much as possible to distinguish an object from similar shaped objects. It consists of the GHT based candidate generation and top-down candidate verification. For the fast generation of the candidate 1ist, the GHT operation is performed un the down sampled edge list. The test results show that it can retrieve the correct object even with a pan of object in reasonable time.

• Journal of the Korea Safety Management & Science
• /
• v.15 no.1
• /
• pp.303-315
• /
• 2013

The purpose of this study is to explore the mediator effect of the presidential candidate brand affiliated to the certain party toward enhancing the party brand equity and the presidential candidate brand value. In detail, firstly, the study attempts to identify the determinants of the party brand equity. Secondly, we clarify the factors of presidential candidate brand value. Finally, the paper testifies the proposed mediator model of the presidential candidate brand with respect to the impact of the belonging party brand equity in voting intention. Results show that the mediator effect of candidate brand exists between the affiliated party and the voting intention. In voting intention, the perceived quality of the party brand equity significantly influences on the candidate brand. Brand loyalty and Brand association of the party brand equity don't impact on the candidate brand significantly. In addition, the result proposes the all components of candidate brand value have significant impacts on voting intention. This paper is an initial attempts to regard the political parties and affiliated candidates in terms of brand marketing as the party brand equity and the candidate brand value respectively. With respect to better enhancing an approval rating, the study is proposed to the parties and candidates to-do list and direction of brand equity management.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.2
• /
• pp.51-62
• /
• 2018

High utility sequential pattern (HUSP) mining has been considered as an important research topic in data mining. Although some algorithms have been proposed for this topic, they incur the problem of producing a large search space for HUSPs. The tighter utility upper bound of a sequence can prune more unpromising patterns early in the search space. In this paper, we propose a sequence expected utility (SEU) as a new utility upper bound of each sequence, which is the maximum expected utility of a sequence and all its descendant sequences. A sequence utility list for each pattern is used as a new data structure to maintain essential information for mining HUSPs. We devise an algorithm, high sequence utility list-span (HSUL-Span), to identify HUSPs by employing SEU. Experimental results on both synthetic and real datasets from different domains show that HSUL-Span generates considerably less candidate patterns and outperforms other algorithms in terms of execution time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.3
• /
• pp.98-105
• /
• 2021

The sensory stimulation of a cosmetic product has been deemed to be an ancillary aspect until a decade ago. That point of view has drastically changed on different levels in just a decade. Nowadays cosmetic formulators should unavoidably meet the needs of consumers who want sensory satisfaction, although they do not have much time for new product development. The selection of new products from candidate products largely depend on the panel of human sensory experts. As new product development cycle time decreases, the formulators wanted to find systematic tools that are required to filter candidate products into a short list. Traditional statistical analysis on most physical property tests for the products including tribology tests and rheology tests, do not give any sound foundation for filtering candidate products. In this paper, we suggest a deep learning-based analysis method to identify hand cream products by raw electric signals from tribological sliding test. We compare the result of the deep learning-based method using raw data as input with the results of several machine learning-based analysis methods using manually extracted features as input. Among them, ResNet that is a deep learning model proved to be the best method to identify hand cream used in the test. According to our search in the scientific reported papers, this is the first attempt for predicting test cosmetic product with only raw time-series friction data without any manual feature extraction. Automatic product identification capability without manually extracted features can be used to narrow down the list of the newly developed candidate products.

• The Journal of Information Systems
• /
• v.25 no.1
• /
• pp.159-182
• /
• 2016

Purpose This paper aims to develop a novel tabu search algorithm for solving the sequencing problems with precedence constraints. Due to constraints, the traditional meta heuristic methods can generate infeasible solutions during search procedure, which must be carefully dealt with. On the contrary, the candidate order based tabu search (COTS) is based on a novel neighborhood structure that guarantees the feasibility of solutions, and can dealt with a wide range of sequencing problems in flexible manner. Design/methodology/approach Candidate order scheme is a strategy for constructing a feasible sequence by iteratively appending an item at a time, and it has been successfully applied to genetic algorithm. The primary benefit of the candidate order scheme is that it can effectively deal with the additional constraints of sequencing problems and always generates the feasible solutions. In this paper, the candidate order scheme is used to design the neighborhood structure, tabu list and diversification operation of tabu search. Findings The COTS has been applied to the single machine job sequencing problems, and we can see that COTS can find the good solutions whether additional constraints exist or not. Especially, the experiment results reveal that the COTS is a promising approach for solving the sequencing problems with precedence constraints. In addition, the operations of COTS are intuitive and easy to understand, and it is expected that this paper will provide useful insights into the sequencing problems to the practitioners.

• Journal of the military operations research society of Korea
• /
• v.25 no.1
• /
• pp.29-36
• /
• 1999

In this paper, we are concerned with the K-shortest loopless path problem. The MPS algorithm, recently proposed by Martins et al., finds paths efficiently because it solves the shortest path problem only one time unlike other algorithms. But its computational complexity has not been known yet. We propose a few techniques by which the MPS algorithm can be implemented efficiently. First, we use min-heap data structure for the storage of candidate paths in order to reduce searching time for finding minimum distance path. Second, we prevent the eliminated paths from reentering in the list of candidate paths by lower bounding technique. Finally, we choose the source mode as a deviation node, by which selection time for the deviation node is reduced and the performance is improved in spite of the increase of the total number of candidate paths.