• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.2
• /
• pp.29-36
• /
• 1980

This paper presents a method for constructing multiple- valued switching functions based on Galois fields. First the constructing Inethod for single- variable switching functions is developers and the results are extended to multiple- variable functions. The fundalnental Inathelnatical properties used in this paper are. (1) The sum of all elements over CF of is zero. (2) The Product of nonzero elements over GF(N) is equal to e1 for Neven, and e1( ) for N odd. With these properties, a relatlvely simple constructing method is developed, and a process for determining the coefficients of the expanded forms of switching functions is also obtained without successive multiplication of the polynomials. Some examples are given to illustrate the method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.265-272
• /
• 2007

The purpose of Vehicle Routing Problem (VRP) is to design the least costly (distance, time) routes for a fleet of identically capacitated vehicles to serve geographically scattered customers. There may be some restrictions such as the maximal capacity for each vehicle, maximal distance for each vehicle, time window to visit the specific customers, and so forth. This paper is concerned with VRP to minimize the sum of elapsed time from departure, where the elapsed time is defined as the time taken in a moving vehicle from the depot to each customer. It is important to control the time taken from departure in the delivery of perishable products or foods, whose freshness may deteriorate during the delivery time. An integer linear programming formulation is suggested and a heuristic for practical use is constructed. The heuristic is based on the set partitioning problem whose performances are compared with those of ILOG dispatcher. It is shown that the suggested heuristic gave good solutions within a short computation time by computational experiments.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.6
• /
• pp.547-557
• /
• 2016

Due to threats caused by social disasters, operating surveillance devices are essential for social safety. CCTV, infrared cameras and other surveillance equipment are used to observe threats. This research proposes a method for searching for the optimum location of surveillance sensors. A GA (Genetic Algorithm) was used, since this algorithm is one of the most reasonable and efficient methods for solving complex non-linear problems. The sensor specifications, a DEM (Digital Elevation Model) and VITD (Vector Product Interim Terrain Data) maps were used for input data. We designed a chromosome using the sensor pixel location, and used elitism selection and uniform crossover for searching final solution. A fitness function was derived by the number of detected pixels on the borderline and the sum of the detection probability in the surveillance zone. The results of a 5-sensor and a 10-sensor were compared and analyzed.

• The Korean Journal of Applied Statistics
• /
• v.29 no.5
• /
• pp.823-833
• /
• 2016

The lifetime is a key characteristic of product quality. It is best to obtain the lifetime data of all samples, but they are often censored due to time or expense limitations. In this paper, we propose a binomial cumulative sum (CUSUM) chart to monitor the mean of type I right-censored Weibull lifetime data, for a xed value of the Weibull shape parameter. We compare the performance of the proposed binomial CUSUM chart with CUSUM charts studied previously using the steady-state average run length (ARL). The results show that the performance of the binomial CUSUM chart is better when the censoring rate is high and/or the sample size is small.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.1
• /
• pp.8-14
• /
• 2013

A low density parity check (LDPC) decoder provides a most powerful error control capability for mobile communication devices and storage systems, due to its performance being close to Shannon's limit. In this paper, we introduce an efficient overlapped LDPC decoding algorithm using a upper dual-diagonal parity check matrix structure. By means of this algorithm, the LDPC decoder can concurrently execute parts of the check node update and variable node update in the sum-product algorithm. In this way, we can reduce the number of clock cycles per iteration as well as reduce the total latency. The proposed decoding structure offers a very simple control and is very flexible in terms of the variable bit length and variable code rate. The experiment results show that the proposed decoder can complete the decoding of codewords within 70% of the number of clock cycles required for a conventional non-overlapped decoder. The proposed design also reduces the power consumption by 33% when compared to the non-overlapped design.

• Journal of Technologic Dentistry
• /
• v.21 no.1
• /
• pp.67-75
• /
• 1999

The purpose of this study is to evaluate the friction coefficients between abutment materials and clasp materials, and to an estimation formula for retention force. The coefficients of friction between three clasp materials and four abutment materials were measured under various conditions, polished and sandblasted and wet and dry. The measurement was repeated for each combination up to a total measurement of 1200 times. Estimation formula for retention force is measured as sum of two terms, which the one time is proportional to the product of friction coefficient ${\mu}$ and undercut u and the other term is proportional to u-squared. Two proportional coefficient were obtained by least square method. The results are as follows: 1. Friction coefficients were ranged from 0.08 to 0.53 under various conditions. 2. Friction coefficients of non-metal abutment materials are greater in wet conditions than dry conditions. 3. Friction coefficients of sandblasted clasp against abutment are greater than that of polished clasp. 4. Clasp retention force can be estimated with the model as F=$F_d(3.0{\mu}u+1.5u^2/h)$ with minor error.

• Industrial Engineering and Management Systems
• /
• v.15 no.4
• /
• pp.364-373
• /
• 2016

Disassembly is one of the important activities in treating with the product at the End of Life time (EOL). Disassembly is defined as a systematic technique in dividing the products into its constituent elements, segments, sub-assemblies, and other groups. We concern with a Fuzzy Disassembly Line Balancing Problem (FDLBP) with multiple objectives in this article that it needs to allocation of disassembly tasks to the ordered group of disassembly Work Stations. Tasks-processing times are fuzzy numbers with triangular membership functions. Four objectives are acquired that include: (1) Minimization of number of disassembly work stations; (2) Minimization of sum of idle time periods from all work stations by ensuring from similar idle time at any work-station; (3) Maximization of preference in removal the hazardous parts at the shortest possible time; and (4) Maximization of preference in removal the high-demand parts before low-demand parts. This suggested model was initially solved by GAMS software and then using Genetic Algorithm (GA) in MATLAB software. This model has been utilized to balance automotive engine disassembly line in fuzzy environment. The fuzzy results derived from two software programs have been compared by ranking technique using mean and fuzzy dispersion with each other. The result of this comparison shows that genetic algorithm and solving it by MATLAB may be assumed as an efficient solution and effective algorithm to solve FDLBP in terms of quality of solution and determination of optimal sequence.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2007.11a
• /
• pp.5-9
• /
• 2007

The construction method for Foamed-Concrete has not been important due to following process of construction work. However, according to the code about enhance of energy saving design policy and impact noise, noised isolation has been used in construction site so that the resistance for cracking and capability for insulating of Foamed-Concrete has been required. Therefore, new alternatives are demanded. Optimum mixing design, which can get the improvement of insulation and resistance of crack for Foamed-Concrete adding EVA chip, was derived and also the device, applying to construction site, was invented to equalize quality. This device can measure quantity of all input and placement, and show up the sum of placement and mixing design on a touch screen. This valuable construction method is friendly environment and recycling method because of using EVA chip, by-product of an EVA insole scrap burned or embedded, as a light-weight aggregate.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.217-221
• /
• 2013

Quantum low-density parity-check (LDPC) codes based on the Calderbank-Shor-Steane construction have low encoding and decoding complexity. The sum-product algorithm(SPA) can be used to decode quantum LDPC codes; however, the decoding performance may be significantly decreased by the many four-cycles required by this type of quantum codes. All four-cycles can be eliminated using the entanglement-assisted formalism with maximally entangled states (ebits). The proposed entanglement-assisted quantum error-correcting code based on Euclidean geometry outperform differently structured quantum codes. However, the large number of ebits required to construct the entanglement-assisted formalism is a substantial obstacle to practical application. In this paper, we propose a novel class of entanglement-assisted quantum LDPC codes constructed using classical Euclidean geometry LDPC codes. Notably, the new codes require one copy of the ebit. Furthermore, we propose a construction scheme for a corresponding zigzag matrix and show that the algebraic structure of the codes could easily be expanded. A large class of quantum codes with various code lengths and code rates can be constructed. Our methods significantly improve the possibility of practical implementation of quantum error-correcting codes. Simulation results show that the entanglement-assisted quantum LDPC codes described in this study perform very well over a depolarizing channel with iterative decoding based on the SPA and that these codes outperform other quantum codes based on Euclidean geometries.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.71-76
• /
• 2013

A new class of quantum low-density parity-check (LDPC) codes whose parity-check matrices are dual-containing matrices constructed based on lines of Euclidean geometries (EGs) is presented. The parity-check matrices of our quantum codes contain one and only one 4-cycle in every two rows and have better distance properties. However, the classical parity-check matrix constructed from EGs does not satisfy the condition of dual-containing. In some parameter conditions, parts of the rows in the matrix maybe have not any nonzero element in common. Notably, we propose four families of fascinating structure according to changes in all the parameters, and the parity-check matrices are adopted to satisfy the requirement of dual-containing. Series of matrix properties are proved. Construction methods of the parity-check matrices with dual-containing property are given. The simulation results show that the quantum LDPC codes constructed by this method perform very well over the depolarizing channel when decoded with iterative decoding based on the sum-product algorithm. Also, the quantum codes constructed in this paper outperform other quantum codes based on EGs.