• Bulletin of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.717-734
• /
• 2018

By choosing defining set properly, several classes of linear codes with a few weights over the finite field ${\mathbb{F}}_p$ are constructed for an odd prime p, and the complete weight enumerators of these classes of codes are determined.

• Journal of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.29-44
• /
• 2021

The set D of column vectors of a generator matrix of a linear code is called a defining set of the linear code. In this paper we consider the problem of constructing few-weight (mainly two- or three-weight) linear codes from defining sets. It can be easily seen that we obtain an one-weight code when we take a defining set to be the nonzero codewords of a linear code. Therefore we have to choose a defining set from a non-linear code to obtain two- or three-weight codes, and we face the problem that the constructed code contains many weights. To overcome this difficulty, we employ the linear codes of the following form: Let D be a subset of ��2n, and W (resp. V ) be a subspace of ��2 (resp. ��2n). We define the linear code ��D(W; V ) with defining set D and restricted to W, V by $${\mathcal{C}}_D(W;V )=\{(s+u{\cdot}x)_{x{\in}D^{\ast}}|s{\in}W,u{\in}V\}$$. We obtain two- or three-weight codes by taking D to be a Vasil'ev code of length n = 2m - 1(m ≥ 3) and a suitable choices of W. We do the same job for D being the complement of a Vasil'ev code. The constructed few-weight codes share some nice properties. Some of them are optimal in the sense that they attain either the Griesmer bound or the Grey-Rankin bound. Most of them are minimal codes which, in turn, have an application in secret sharing schemes. Finally we obtain an infinite family of minimal codes for which the sufficient condition of Ashikhmin and Barg does not hold.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11C
• /
• pp.1025-1028
• /
• 2009

This paper presents upper bounds of Maximum Likelihood (ML) decoding performance of a few irregular LDPC codes using the simple bound and ML input output weight distributions and it is shown that contrary to general opinion that as block length becomes longer, BP decoding performance becomes simply closer to ML decoding performance, before peak degradation, as block length becomes longer, BP decoding performance falls behind ML decoding performance more and after peak degradation, general opinion holds.

• Nuclear Engineering and Technology
• /
• v.38 no.3
• /
• pp.225-230
• /
• 2006

With the advent of inexpensive computing power over the past two decades, applications of Monte Carlo radiation transport techniques have proliferated dramatically. At Los Alamos, the Monte Carlo codes MCNP5 and MCNPX are used routinely on personal computer platforms for radiation shielding analysis and dosimetry calculations. These codes feature a rich palette of variance reduction (VR) techniques. The motivation of VR is to exchange user efficiency for computational efficiency. It has been said that a few hours of user time often reduces computational time by several orders of magnitude. Unfortunately, user time can stretch into the many hours as most VR techniques require significant user experience and intervention for proper optimization. It is the purpose of this paper to outline VR strategies, tested in practice, optimized for several common radiation shielding tasks, with the hope of reducing user setup time for similar problems. A strategy is defined in this context to mean a collection of MCNP radiation transport physics options and VR techniques that work synergistically to optimize a particular shielding task. Examples are offered in the areas of source definition, skyshine, streaming, and transmission.

• Advances in concrete construction
• /
• v.3 no.4
• /
• pp.295-316
• /
• 2015

A bridge widening technology using steel-concrete composite system was developed and is presented in this paper. The widened superstructure system consists of a newly built composite steel-concrete girder with concrete deck and steel diaphragms attached to the existing concrete girders. This method has been applied in several bridge widening projects in China, and one of those projects is presented in detail. Due to the higher stiffness-to-weight ratio and the rapid erection of composite girders, this widening method reveals benefits in both mechanical performance and construction. As only a few methods for the design of bridges with different types of girders are recommended in current design codes, a more accurate analytical method of estimating live load distribution on girder bridges was developed. In the analytical model, the effects of span length, girder pacing, diaphragms, concrete decks were considered, as well as the torsional and flexural stiffness of both composite box girders and concrete T girders. The study shows that the AASHTO LRFD specification procedures and the analytical models proposed in this paper closely approximate the live load distribution factors determined by finite element analysis. A parametric study was also conducted using the finite element method to evaluate the potential load carrying capacities of the existing concrete girders after widening.

• The KIPS Transactions:PartD
• /
• v.17D no.6
• /
• pp.431-442
• /
• 2010

Because embedded system is combined system of hardware and software, we should design by considering elements such as real-time, reactive, small size, low weight, safe, reliable, harsh environment, low cost, and so on. However, those are poorly reflected on current embedded system development. Especially, there is few existed framework-based embedded system development. As a result, there are many internal codes which is not related with system operation in currently developed embedded system, and reusability or variability is not considered into embedded system development. Therefore we propose a formal specification technique using Z language to guarantee completeness or consistency of design of reusability framework proposed for improving reusability of embedded system. Also we assure correctness of framework design by checking Z model through Z-Eves Tool.

• Fashion & Textile Research Journal
• /
• v.24 no.1
• /
• pp.117-126
• /
• 2022

This study aims to analyze the sizing information of women's ready-to-wear pants as indicated on online retail websites and to suggest better sizing communication that can assist customers in making successful apparel size selections. We gathered size specifications and size reference information for basic straight pants from 34 online apparel retail websites. Although the Korean standard recommends labeling the body dimension-based sizing code and specification, most websites preferred to use various types of sizing codes. Body measurements were only used by a few websites, and garment dimension descriptions were the most common method to indicate product size. Many websites provided size reference information through customer review boards and fit model images, however, there was insufficient body size information to allow customers to infer the fit of their body type. When using the size guidance tools, the major data input points were stature and weight measurements. However, the waist measurements of pants sizes guided only by stature and weight values revealed inconsistent ease allowance for corresponding body size populations, especially in the overweight group. Based on our findings, we propose a more effective method of communicating the size information of pants online. We expect that this will contribute to the efficiency of online apparel product display and build a better shopping environment that satisfies both sellers and consumers.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.63-72
• /
• 2011

Binary translation is a kind of the emulation method which converts a binary code compiled on the particular instruction set architecture to the new binary code that can be run on another one. It has been mostly used for migrating legacy systems to new architecture. In recent, binary translation is used for instrumenting programs without modifying source code, because it enables inserting additional codes dynamically, For general application, there already exists some instrumentation software using binary translation, such as dynamic binary analyzers and virtual machine monitors. On the other hand, in order to be benefited from binary translation in kernel-level, a few issues, which include system performance, memory management, privileged instructions, and synchronization, should be treated. These matters are derived from the structure of the kernel, and the difference between the kernel and user-level application. In this paper, we present a scheme to apply binary translation and dynamic instrumentation on kernel. We implement it on Linux kernel and demonstrate that kernel-level binary translation adds an insignificant overhead to performance of the system.