• Journal of Dental Anesthesia and Pain Medicine
• /
• v.21 no.1
• /
• pp.71-80
• /
• 2021

Background: The options for stabilization appliance therapy for masticatory muscle pain include soft occlusal and hard stabilization appliances. A previous study suggested that hard stabilization appliance therapy was effective for patients with local myalgia who developed long facets on their occlusal appliances. The objective of this study was to identify patients in whom a soft occlusal appliance should be used to treat masticatory muscle pain by analyzing the type of muscle pain present and patient factors that influenced the effectiveness of this treatment. Methods: The study included 42 patients diagnosed with local myalgia or myofascial pain according to the Diagnostic Criteria for Temporomandibular Disorders Diagnostic Decision Tree. The analysis of patient factors included variables believed to be associated with temporomandibular disorders. First, a temporary screening appliance was used for 2 weeks to assess each patient for bruxism during sleep. Soft appliance therapy was then started. For each patient, the effectiveness of the appliance was evaluated according to the intensity of tenderness during muscle palpation and the treatment satisfaction score at one month after starting treatment. Results: Data from 37 of the 42 patients were available for analysis. Twenty-five patients reported satisfaction with the appliance. In logistic regression analysis, the odds ratio for reduction of facet length was 1.998. Nineteen patients showed at least a 30% improvement in the visual analog scale score. The odds ratio for local myalgia was 18.148. Conclusion: Soft appliance therapy may be used in patients with local myalgia. Moreover, patients who develop short facets on the appliance surface are likely to be satisfied with soft appliance therapy. Soft appliance therapy may be appropriate for patients with local myalgia who develop short facets on their occlusal appliance.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.1026-1035
• /
• 2011

This paper presents generalization and application for the conventional SISO decoding algorithm of Block Turbo Codes. R. M. Pyndiah suggested an iterative SISO decoding algorithm for Product Codes, two-dimensionally combined linear block codes, on AWGN channel. It wascalled Block Turbo Codes. Based on decision of Chase algorithm which is SIHO decoding method, SISO decoder for BTC computes soft decision information and transfers the information to next decoder for iterative decoding. Block Turbo Codes show Shannon limit approaching performance with a little iteration at high code rate on AWGN channel. In this paper we generalize the conventional decoding algorithm of Block Turbo Codes, under BPSK modulation and AWGN channel transmission assumption, to the LLR value based algorithm and suggest an application example such as concatenated structure of LDPC codes and Block Turbo Codes.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.12
• /
• pp.35-41
• /
• 2016

In this paper, we propose a new real-time dead pixel detection method based on spatial compare filtering, which are usually used in the small target detection. Actually, the soft dead and the small target are cast in the same mold. Our proposed method detect and remove the dead pixels as applying the spatial compare filtering, into the pixel outputs of a detector after the non-uniformity correction. Therefore, we proposed method can effectively detect and replace the dead pixels regardless of the non-uniformity correction performance. In infrared camera, there are usually many dead detector pixels which produce abnormal output caused by manufactural process or operational environment. There are two kind of dead pixel. one is hard dead pixel which electronically generate abnormal outputs and other is soft dead pixel which changed and generated abnormal outputs by the planning process. Infrared camera have to perform non-uniformity correction because of structural and material properties of infrared detector. The hard dead pixels whose offset values obtained by non-uniformity correction are much larger or smaller than the average can be detected easily as dead pixels. However, some dead pixels(soft dead pixel) can remain, because of the difficulty of uncleared decision whether normal pixel or abnormal pixel.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.3
• /
• pp.149-154
• /
• 2017

The MCT-Adaboost algorithm chooses an optimal set of features in each rounds. On each round, it chooses the best feature by calculate minimizing error rate using feature index and MCT kernel distribution. The involved process of weak classification executed by a hard decision. This decision occurs some problems when it chooses ambiguous kernel feature. In this paper, we propose the modified MCT-Adaboost classification using soft decision. The typical MCT-Adaboost assigns a same initial weights to each datum. This is because, they assume that all information of database is blind. We assign different initial weights with our propose new algorithm using some statistical properties of involved features. In experimental results, we confirm that our method shows better performance than the traditional one.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.75-80
• /
• 2004

An iterative soft-decision decoding algorithm of block codes is proposed. With careful examinations of the first hard-decision decoding result, the candidate codewords are efficiently searched for. An approach to reducing decoding complexity and lowering error probability is to select a small number of candidate codewords. With high probability, we include the codewords which are at the short distance from the received signal. The decoder then computes the distance to each of the candidate codewords and selects the codeword which is the closest. We can search for the candidate codewords which make the error patterns contain the bits with small reliability values. Also, we can reduce the cases that we select the same candidate codeword already searched for. Computer simulation results are presented for (23,12) Golay code. They show that decoding complexity is considerably reduced and the block error probability is lowered.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.734-742
• /
• 2008

In spatially multiplexed MIMO systems that enable high data rate transmission over wireless communication channels, the spatial demultiplexing at the receiver is a challenging task and various demultiplexing methods have been developed. Among the previous methods, maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD), sphere decoding (SD), QOC, and MOC schemes have been reported to achieve a (near) maximum likelihood (ML) hard decision performance. In general, however, the reliability of soft output of these schemes is not satisfactory. In this paper, we propose a method which enhances the reliability of soft output. By computer simulations, we demonstrate the improved performance by the proposed method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.2
• /
• pp.105-116
• /
• 2018

In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.

• The Journal of the Korea Contents Association
• /
• v.12 no.10
• /
• pp.82-92
• /
• 2012

This study is on the color expression of 100 male bike helmet products examining color image scale with high preference, PCCS color system applied color analysis and influence of color in decision making. The targets are all domestically distributed male bike helmets. The image scale was divided into 4 sections (Soft, Hard, Dynamic and Static) by color, and color image scale was analyzed to top 10 priority products. And analysis according to PCCS color system was made. Finally, questionnaire survey was carried out to analyze the influence of color on purchase decision making. The questionnaire survey was carried out to male in 20s~50s who were the member of 18 bike clubs in S agent in Seoul. 414 out of 422 sheets except for 8 insufficient ones were used. The results can be divided into 3.

• Industrial Engineering and Management Systems
• /
• v.15 no.4
• /
• pp.354-363
• /
• 2016

Due to uncertain environment, various parameters such as price, queuing length, warranty, and so on influence on inventory models. In this paper, an inventory-queuing-pricing problem with continuous review inventory control policy and batch arrival queuing approach, is presented. To best of our knowledge, (I) demand function is stochastic and price dependent; (II) due to the uncertainty in real-world situations, a fuzzy programming approach is applied. Therefore, the presented model with goal of maximizing total profit of system analyzes the price and order quantity decision variables. Since the proposed model belongs to NP-hard problems, Pareto-based approaches based on non-dominated ranking and sorting genetic algorithm are proposed and justified to solve the model. Several numerical illustrations are generated to demonstrate the model validity and algorithms performance. The results showed the applicability and robustness of the proposed soft-computing-based approaches to analyze the problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1412-1430
• /
• 2024

The soft cancellation list (SCANL) decoding algorithm for polar codes runs L soft cancellation (SCAN) decoders with different decoding factor graphs. Although it can achieve better decoding performance than SCAN algorithm, it has high latency. In this paper, a fast simplified SCANL (Fast-SSCANL) algorithm that runs L independent Fast-SSCAN decoders is proposed. In Fast-SSCANL decoder, special nodes in each factor graph is identified, and corresponding low-latency decoding approaches for each special node is propose first. Then, syndrome check aided Fast-SSCANL (SC-Fast-SSCANL) algorithm is further put forward. The ordinary nodes satisfied the syndrome check will execute hard decision directly without traversing the factor graph, thereby reducing the decoding latency further. Simulation results show that Fast-SSCANL and SC-Fast-SSCANL algorithms can achieve the same BER performance as the SCANL algorithm with lower latency. Fast-SSCANL algorithm can reduce latency by more than 83% compared with SCANL, and SC-Fast-SSCANL algorithm can reduce more than 85% latency compared with SCANL regardless of code length and code rate.