• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.831-835
• /
• 2009

Volunteer computing is a computing paradigm in which the operations of a large-scale application are processed using idle resources of Internet-connected computers. The redundant-work distribution techniques used in the volunteer computing environment cause some problems like delay of the work completion time or inefficiency of the work execution due to continuous requests of the work redistribution because the techniques do not consider the characteristics of works and dynamic resources. To cope with such problems this paper suggests a P2P based regional matchmaking technique which can redistribute works in consideration of the characteristics of the works and the participant resources. The techniques consist of the profiles for works/resources, the module for monitoring the available resources spaces, the protocols for the matching request/reply, the module for match-ratio calculation, and so on.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1289-1292
• /
• 1997

Typical biomechanical system such as human body and mammals possess abundant muscles which are more than required for motion generation of such systems. We have shown that the excess number of muscles play important roles in spring-like impedance modulation. redundant kinematic structure, which is another feature of biomechanical systems, allows modulations of inertia and damping properties of such systems. In this work, we propose a frequency modulation algorithm which combines the spring-like impedance with inertia impedance. also, a load distribution method for frequency modulation is also introduced. The frequency modulation represents a simulataneous control of force and kinematic redundancies, which has not been addressed in the literature.

• Cross-Cultural Studies
• /
• v.29
• /
• pp.85-111
• /
• 2012

Zhong-lie-xiao-wu-yi(忠烈小五義), whose author was Shiyukun(石玉昆), is a Xia-Yi-Gong-An(俠義公案) novel in the late Qing Dynasty. This work published in 1890 when Emperor Guangxu(光緖) governed China. This work's author is Shiyukun, distribution books has an amender. The amender will be a shuoshuyiren (說書藝人). Zhong-lie-xiao-wu-yi is Zhong-lie-xia-yi-zhuan(忠烈俠義傳)'s a sequel, the story leads from Zhong-lie-xia-yi-zhuan. It is just the beginning of Zhong-lie-xiao-wu-yi is redundant. Zhong-lie-xiao-wu-yi was introduced to the late Chosun(朝鮮) Dynasty. This work was translated in Hangeul, Chosun's readers read Zhong-lie-xiao-wu-yi. This work's circulation is not clear, But this work's exciting story is interested in the readers. This work is characterized as follows: First of all, Zhong-lie-xia-yi-zhuan's charaters appear equally, the readers feels familiar. The readers like the familiar characters, because the readers read the book. The familiar characters can have a sense of speed in reading. Second, the story is continuous. Zhong-lie-xiao-wu-yi is narrated by connecting Zhong-lie-xia-yi-zhuan's story. Third, Zhong-lie-xiao-wu-yi was seeking an open ending. Classical novels prefer happy ending, this work is open ending, the expectations for the sequel became more doubled. The fourth, this work took advantage of the colloquial expressions. Zhong-lie-xiao-wu-yi is Huabenti(話本體) novel, took advantage of the spoken language. Suyu(俗語) and xiehouyu(歇後語) was represented in this work. Fifth, this work is formed a universal consensus. Ordinary people must empathize about xia-yi(俠義) and retribution, this work was well represented. Because the readers would have liked to this story.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.9-16
• /
• 2006

Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.

• ETRI Journal
• /
• v.42 no.4
• /
• pp.608-618
• /
• 2020

We present a novel GPU-based ray-casting algorithm for volume rendering of unstructured grid data. Our volume rendering system uses a ray-casting method that guarantees accurate rendering results. We also employ the per-pixel intersection list concept in the Bunyk algorithm to guarantee an accurate result for non-convex meshes. For efficient memory access for the lists on the GPU, we represent the intersection lists for all faces as an array with our novel construction algorithm. With the intersection lists, we perform ray-casting on a GPU, and a GPU thread handles each ray. To increase ray-coherency in a thread block and improve memory access efficiency, we extend a prior image-tile-based work distribution method to fit modern GPU architectures. We also show that a prior approach using a per-thread local buffer to reduce redundant computation is not appropriate for modern GPU architectures. Instead, we take an on-demand calculation strategy that achieves better performance even though it allows duplicate computations. We applied our method to three unstructured grid datasets with different characteristics. With a GPU, our method achieved up to 36.5 times higher performance for the ray-casting process and 19.7 times higher performance for the whole volume rendering process compared with the Bunyk algorithm using a CPU core. Also, our approach showed up to 8.2 times higher performance than a GPU-based cell projection method while generating more accurate rendering results. These results demonstrate the efficiency and accuracy of our method.