• Journal of Chest Surgery
• /
• v.32 no.3
• /
• pp.270-275
• /
• 1999

Background: In the patients with thoracic injury, we suspect simultaneous cardiac contusion or concussion. We analyzed the patients with possible cardiac injury by electrocardiography, serum creatine kinase (CK), creatine kinase isoenzyme fraction (CK-MB) screening, followed by two dimentional echocardiogram (2-DE) to access the severity of injury. Material and Method: From January 1997 to April 1998, 15-month retrospective study of suspicious myocardial injury was undertaken in including 24 patients admitted for suspected cardiac injury. All patients with history or signs of blunt chest injury were checked serially and the serial CK, CK-MB fraction, electrocardiography (EKG) analysis screening were followed by 2-DE. Result: The age range was between 20-40 years and were predominant male patients in(M:F=3:1). Most common causes of injury were traffic accidents, 15 patients(62.5%). Associated injuries involved multiple rib fractures, sternal fracture and such. EKG findings on the cardiac concussion were within normal limits, EKG findings on the cardiac contusion were nonspecific ST and T wave abnormality. In cardiac contusion patients, CK-MB fraction did not increase significantly on admission but on 2nd, 3rd, 4th hospital days, it increased significantly (p=0.0080, 0.0130, 0.0130). The average admission days were 9.22 in concussion and 26.18 in contusion patients(p=0.0075). Most common complication was the adult respiratory distress syndrome(7 cases), 5 out of the patients with ARDS were mechanically ventilated. There were no deaths. Conclusion: We believe the serial checks of CK-MB, EKG and subsquent two-dementional echocardiographic sector scanning are presently the most sensitive indicators available for structural and functional cardiac injury.

• Journal of Advanced Navigation Technology
• /
• v.27 no.3
• /
• pp.306-313
• /
• 2023

Realistic and graphics-based virtual reality content is based on 360-degree videos, and viewport extraction through the viewer's intention or automatic recommendation function is essential. This paper designs a viewport extraction system based on multiple object tracking in 360-degree videos and proposes a parallel computing structure necessary for multiple viewport extraction. The viewport extraction process in 360-degree videos is parallelized by composing pixel-wise threads, through 3D spherical surface coordinate transformation from ERP coordinates and 2D coordinate transformation of 3D spherical surface coordinates within the viewport. The proposed structure evaluated the computation time for up to 30 viewport extraction processes in aerial 360-degree video sequences and confirmed up to 5240 times acceleration compared to the CPU-based computation time proportional to the number of viewports. When using high-speed I/O or memory buffers that can reduce ERP frame I/O time, viewport extraction time can be further accelerated by 7.82 times. The proposed parallelized viewport extraction structure can be applied to simultaneous multi-access services for 360-degree videos or virtual reality contents and video summarization services for individual users.

• Journal of Mushroom
• /
• v.3 no.3
• /
• pp.109-114
• /
• 2005

Attempts were made to control Diatrype stigma occurred on the bed-log of shiitake by resistant shiitake strains. In selection test of resistant shiitake strains, 67 out of 77 strains tested were proved to be resistant to D. stigma. Among them, 13 strains including KFRI 5 were effective to inhibit the access of D. stigma, and 7 strains including KFRI 180 remarkably invaded the territory of D. stigma. Among 31 shiitake strains made by hybridization of resistant strains for D. stigma, 8 strains including KFRI 537 inhibited the access of D. stigma, and 4 strains including KFRI 545 invaded the territory of D. stigma. The effects of temperatures and inoculation orders to the resistance were confirmed in PDA plates and test tubes filled with sawdust of Quercus acutissima. Four kinds of temperature treatments as follows were tested: (1) continuous incubation at $14^{\circ}C$, (2) continuous incubation at $25^{\circ}C$, (3) changing of incubation temperature from $14^{\circ}C$ to $25^{\circ}C$ as soon as mycelia of both shiitake and D. stigma meet together, (4) changing of incubation temperature from $25^{\circ}C$ to $14^{\circ}C$ as soon as mycelia of both shiitake and D. stigma meet together. Three kinds of inoculation procedure were tested: (1) inoculation of shiitake 3 days ahead of D. stigma inoculation, (2) inoculation of D. stigma 3 days ahead of shiitake inoculation, (3) simultaneous inoculation of both fungi. In PDA plate test, the strain KFRI 137 showed outstanding ability to inhibit mycelial growth of D. stigma and the strain KFRI 180 invaded into the territory of D. stigma in most of treatments. Hybrid strains, KFRI 545, 546, and 547 were more resistant than their parent strains, KFRI 488 and 405. In test tube examinations, all the strains of shiitake showed high resistance at the treatment of change in temperature from $14^{\circ}C$ to $25^{\circ}C$ when mycelia of both shiitake and D. stigma meet together. On the other hand, resistance of all the strains growing at $25^{\circ}C$ decreased when the temperature was changed into $14^{\circ}C$ after mycelia of both fungi. In these cases, the resistance reached to 7~20% of the highest resistance. The strain KFRI 259 invaded the territory of D. stigma, contrary to PDA plate test. Among the strains, KFRI 393 strain was the most resistant under the continuous incubation at $25^{\circ}C$.

• Radiation Oncology Journal
• /
• v.18 no.1
• /
• pp.67-72
• /
• 2000

Background :The authors have developed a Digital image chart(DIC) and digital Radiotherapy Record System (DRRS). We have evaluated the DIC and DRRS for reliability, usefulness, ease of use, and efficiency. Materials and Methods :The basic design of the DIC and DRRS was to build an digital image database of radiation therapy Patient records for a more efficient and timely flow of critical image information throughout the department. This system is a submit of comprehensive radiation oncology management system (C-ROMS) and composed of a picture archiving and communication system (PACS), a radiotherapy information database, and a radiotherapy imaging database. The DIC and DRRS were programmed using Delphi under a Windows 95 environment and is capable of displaying the digital images of patients identification photos, simulation films, radiotherapy setup, diagnostic radiology images, gross lesion Photos, and radiotherapy Planning isodose charts with beam arrangements. Twenty-three clients in the department are connected by Ethernet (10 Mbps) to the central image server (Sun Ultra-sparc 1 workstation). Results :From the introduction of this system in February 1998 through December 1999, we have accumulated a total of 15,732 individual images for 2,556 patients. We can organize radiation therapy in a 'paperless' environment in 120 patients with breast cancer. Using this system, we have succeeded in the prompt, accurate, and simultaneous access to patient care information from multiple locations throughout the department. This coordination has resulted in improved operational efficiency within the department. Conclusion :The authors believe that the DIC and DRRS has contributed to the improvement of radiation oncology department efficacy as well as to time and resource savings by providing necessary visual information throughout the department conveniently and simultaneously. As a result, we can also achieve the 'paperless' and 'filmless' practice of radiation oncology with this system.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.