• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.23 no.3
• /
• pp.91-104
• /
• 2020

This study was conducted to analyze the characteristics of defects according to the type of block and spatial type by quantitatively examining defects occurring in block pavement in apartment complex. According to the research results, depending on the type of block, defects have occurred 1,394.3ea/100㎡ in interlocking paver blocks, 464.8ea/100㎡ in clay brick paver blocks, and 235.1ea/100㎡ in shot blasted paver blocks. By space type, the defects were occurred 1,576.0ea/100㎡ on the access road paved by interlocking paver blocks and the defects were found 1,139.6ea/100㎡ in interlocking paver blocks, 235.1ea/100㎡ in shot blasted paver blocks, and 797.1ea/100㎡ in clay brick paver blocks, on the sidewalk. Also the defects are occurred 455.6ea/100㎡ on the resting space and 403.2ea/100㎡ on the gym space paved by clay brick paver blocks. Through the size analysis of the defects in the block paver, in the case 'peeling', the largest volume of 2,539.0㎣ on the sidewalk paved with shot blasted paver blocks, and 'Subsidence' occurred at the widest area of 2,096.0㎠ on the sidewalk where interlocking paver block was constructed. The difference in defect occurrence according to the type of block is considered to be influenced by the block production process, and the space type is considered to be caused the difference in the occurrence of defects according to the cause of construction and the usage pattern of residents. This study conducted a survey on defects in block and analyzed the defect characteristic according to paver material and space type. Base on this, it is judged that it can be used as an efficient basic data for material replacement, improvement, paver planning and construction in the future.

• The Korean Journal of Pain
• /
• v.13 no.2
• /
• pp.202-207
• /
• 2000

Background: Superior hypogastric plexus block has been advocated as a useful technique for the treatment of cancer related pelvic pain. The aim of this study was to evaluate the effect of neurolytic trans-intervertebrodiscal superior hypogastric plexus block for pelvic cancer pain. Methods: Twenty-eight patients with gynecologic, colorectal or genitourinary cancer who suffered intractable pain were studied. We performed superior hypogastric plexus block by trans-intervertebrodiscal approach at L5/S1 level under the C-arm fluoroscopic guide unilaterally or bilaterally. Ten ml of 100% dehydrated alcohol was injected through each needle. We evaluated the change of visual analog pain score (VAS; 0~100 mm) and daily dose of oral morphine sulphate at the time of pre-block and 7 days after the block. Results: Fourteen patients (50%) had satisfactory pain relief (VAS<30) while five patients (18%) had moderate pain control (VAS 30~60). The remaining nine patients (32%) had mild or little pain relief (VAS>60) and their daily oral morphine doses were above 160 mg. Additional pain control method may be needed for those patients who received high dose of opioid before neurolytic block. Conclusions: We conclude trans-intervertebrodiscal neurolytic superior hypogastric plexus block was effective in relieving pelvic cancer pain. Neurolytic block, earlier stage, may provide better effects for more comfortable life at the end stage for cancer patients.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1299-1309
• /
• 1998

In this paper, we propose a new approach for reducing the blocking artifact that is one of drawbacks of the block-based Discrete Cosine Transform (DCT) without introducing additional information or significant blurring. We modify the inter-block discontinuity minimization technique to preserve edges within a block as well as to reduce visible block boundaries. The homogeneity of each block is decided by the threshold value reated to Q-factor, which is included in a JPEG as well as MPEG streams. The quantization error is estimated by minimizing the discontinuity, which is weighted in proportion to block discontinuity and added to each pixel in the block to compensate block artifacts. The proposed algorithm reconstructs images which have less noticeable block boundaries from a subjective viewpoit without anyconstraints.

• The Korean Journal of Pain
• /
• v.11 no.1
• /
• pp.101-104
• /
• 1998

Backgrouds: Twent five years have passed since the opening of the first pain clinic in korea, in 1973 at Yonsei University Hospital. The number of pain clinics are gradually increasing in recent times. It is important to plan for future pain clinics with emphasis on improving the quality of pain management. Therefore we reviewed the patients in our hospital to help us in planning for the future of our pain clinic. Methods: We analyzed 2656 patients who had visited our Kim Chan Pain Clinic, accordance to age, sex, disease, and type of treatment block, from July 1996 to August 1997. Results: The prevalent age group was in the fifties, 27.3%, seventy years and older compromised 9.2%. The most common disease were as follows: lower back pain(46.2%); cervical and upper extremities pain(23.1%); trigeminal neuralgia(7.2%); and hyperhydrosis(5.8%) Both nerve blocks and medication were prescribed as treatment. Lumbar epidural block(16.3%) and stellate ganglion block(15.6%) were the most frequent blocks performed among various nerve blocks. Among nerve block under C-arm guidance, lumbar facet joint block(24.4%) and lumbar root block(22.5%) were performed most frequently. Trigeminal nerve block(18.4%), thoracic(17.0%) and lumbar sympathetic ganglion block(11.4%) were next most prevalent blocks performed frequent block. Conclusions: Treatments at our hospital were focused on nerve blocks and medications prescriptions. Nerve blocks are of particular importance in the diagnosis and treatment of chronic pain. However in future, to raise the quality of pain management, we need to fucus on a multidisciplinary/interdisciplinary team approach.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.17 no.6
• /
• pp.492-498
• /
• 1984

We have reported the seasonal and portional variation in the composition of uronic acid of alginic acid from Ecklonia cava in the previous study. In the present paper, uronic acid block structure of alginic acid from Ecklonia cave was investigated, and some related properties such as viscosity, the dependence on temperature and substitution of metallic ion were also discussed. The proportion M block was highest amnog three blocks in both of frond and stipe. The average values of M and G block ratios were $51.6|%\;and\;32.3\%$ in the frond, whereas $45.7\%\;and\;38.6\%$ in the stipe, respectively. The proportions of alternating blocks in the frond and stipe were similar, and the values were $16.1\%$ in the frond and $15.6\%$ in the stipe. The viscosity of $1\%$ sodium alginate solution was almost inversely proportional to the M/G and/or M block ratio. Viscosities were marked maximum from summer to autumn and minimum winter to spring. In the value of lower M/G and M block ratio, the viscosity seemed to have a considerable dependence on temperature. The temperature dependence was more appearant in the alginic acid from the frond (M/G ratio, 0.95; M block, $54.2\%$) collected in July and the stipe (M/G ratio, 1.61; M block $47.6\%$) in April. The affinity with metallic ion appeared higher in order of $Pb^{2+}>Cu^{2+}>Co^{2+}>Zn^{2+}$. The amounts of metallic ion exchange of the $Pb^{2+},\;Cu^{2+},\;Co^{2+}\;and\;Zn^{2+}$ were ranged from 3.4. to 4.7, 2.5 to 3.2, 1.8 to 2.2 and 1.6 to 1.7 meq/(g. sodium alginate), respectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.529-539
• /
• 2000

This paper proposes a prefetch-based disk buffer management algorithm, which we call W2R (Veighingjwaiting Room). Instead of using elaborate prefetching schemes to decide which blockto prefetch and when, we simply follow the LRU-OBL (One Block Lookahead) approach and prefetchthe logical next block along with the block that is being referenced. The basic difference is that theW2R algorithm logically partitions the buffer into two rooms, namely, the Weighing Room and theWaiting Room. The referenced, hence fetched block is placed in the Weighing Room, while theprefetched logical next block is placed in the Waiting Room. By so doing, we alleviate some inherentdeficiencies of blindly prefetching the logical next block of a referenced block. Specifically, a prefetchedblock that is never used may replace a possibly valuable block and a prefetched block, thoughreferenced in the future, may replace a block that is used earlier than itself. We show through tracedriven simulation that for the workloads and the environments considered the W2R algorithm improvesthe hit rate by a maximum of 23.19 percentage points compared to the 2Q algorithm and a maximumof 10,25 percentage feints compared to the LRU-OBL algorithm.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.397-408
• /
• 2003

Existing indexing mechanisms of XML data using numbering scheme have a drawback of rebuilding the entire index structure when insertion, deletion, and update occurs on the data. We propose a new indexing mechanism based on split blocks to cope with this problem. The XML data are split into blocks, where there exists at most a relationship between two blocks, and numbering scheme is applied to each block. This mechanism reduces the overhead of rebuilding index structures when insertion, deletion, and update occurs on the data. We also propose two algorithms, Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm which retrieve the relationship between two entities in the XML hierarchy using this indexing mechanism. We also propose a mechanism in which the identifier of a block has the information of its Parents' block to expedite retrieval process of the ancestor-descendent relationship and also propose two algorithms. Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm using this indexing mechanism.

• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.423-429
• /
• 2001

In this paper, we propose the improved method for retrieving images with DC element of DCT that is used in image compression such as JPEG/MPEG. The existing method retrieves images with DC of fixed block size DCT. In this method, the increase in the block size results in faster retrieving speed, but it lessens the accuracy. The decrease in the block size improves the accuracy, however, it degrades the retrieving speed. In order to solve this problem, the proposed method utilizes the variable block size DCT. This method first determines the existence of object regions within each block, and then creates an image region table. Based on this table, it determines the size of each block, following a simple rule; decrease the block size in the object regions, and increase the block size in the background regions. The proposed method using variable block size DCT improves about 15% in terms of the accuracy. Additionally, when there rarely exist images of same pattern, it is able to retrieve faster only by comparing the image region patterns.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.5
• /
• pp.421-429
• /
• 2017

It is very important to manage the position of the blocks in the shipyard where the work is completed, or the blocks need to be moved for the next process operation. The moving distance of the block increases according to the position of the block stockyard. As the travel distance increases, the number of trips and travel distance of the transporter increases, which causes a great deal of operation cost. Currently, the selection of the block position in the shipyard is based on the know-how of picking up a transporter worker by the production schedule of the block, and the location where the block is to be placed is determined according to the situation in the stockyard. The know-how to select the position of the block is the result of optimizing the position of the block in the shipyard for a long time. In this study, we used the accumulated data as a result of the operation of the yard in the shipyard and tried to select the location of blocks by learning it. Decision tree learning algorithm was used for learning, and a prototype was developed using it. Finally, we prove the possibility of selecting a block stockyard through this algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.673-677
• /
• 2010

Recently, NAND flash memory has been widely used in embedded systems, personal computers, and server systems because of its attractive features, such as non-volatility, fast access speed, shock resistance, and low power consumption. Due to its hardware characteristics, specifically its 'erase-before-write' feature, Flash Translation Layer is required for using flash memory like hard disk drive. Many FTL schemes have been proposed, but conventional FTL schemes have problems such as block thrashing and block associativity problem. The KAST scheme tried to solve these problems by limiting the number of associations between data block and log block to K. But it has also block thrashing problem in random access I/O pattern. In this paper, we proposed a new FTL scheme, UDA-LBAST. Like KAST, the proposed scheme also limits the log block association, but does not limit data block association. So we could minimize the cost of merge operations, and reduce merge costs by using a new block reclaim scheme, log block garbage collection.