• Journal of Chest Surgery
• /
• v.26 no.2
• /
• pp.102-107
• /
• 1993

Human atria play an important role in extracellular homeostasis through release of atrial natriuretic peptide. To evaluate the relationship between plasma level of atrial natriuretic peptide (ANP) and many changes which can develop during extracorporeal circulation, we studied 16 patients undergoing, 12 cardiac operation and 4 thoracic operation. Plasma level of ANP in cardiac patients group was significantly higher and more changeable than thoracic patients group. After aortic cross clamp release, blood was filled at right atrium and right atrial pressure was rapidly increased. At the same time, plasma level of ANP was rised suddenly. Increase of ANP level was correlated (p<0.05) with the increase of total bypass time, but was not correlated statistical with aortic cross clamp time. ANP level did not fall rapidly after aortic cross clamp while both atria were completely empty. This result was explained by intraoperative hypothermia at that time, which can inactivate plasmal endopeptidase and catalytic receptors of ANP. The ANP level of atrial fibrillation group in cardiac patients were generally higher than normal sinus group, but there was no statistical correlation.

• Journal of the Semiconductor & Display Technology
• /
• v.7 no.2
• /
• pp.55-58
• /
• 2008

The objective of the research is to design, manufacture and test a Mass Flow Controller(MFC) capable of measuring compressible fluid flows based on a "bucket and stop-watch"method. The basic principle is the measurement of time, where the time taken to fill and empty a bucket of known volume is measured. This method of flow measurement is a new concept when compared to a commercilized current mass flow controller. For the flow meter to be able to compete with established designs it not only must be comparable in cost and robustness, it must be very accurate and reliable as well. This device should be able to handle fluid flows in the range of 0.1ml/min to 10ml/min within an accuracy of ${\pm}$1%. A possible application for a device such as this is in electronics industry where arsenic gas is used in the production of silicon chips.

• Environmental Engineering Research
• /
• v.19 no.4
• /
• pp.309-316
• /
• 2014

The water quality improvement of golf course ponds, as representative stagnant stream channels, was evaluated by applying a biological activated carbon (BAC) process composed of four consecutive activated carbon reactors. The study was performed from autumn to winter in order to evaluate the feasibility of the BAC process under low temperature conditions. In the study, water quality of pond A (target pond) and pond B (reference pond) were monitored. Pond water was pumped into the BAC process, and was then returned to the pond after treatment. The optimal conditions were determined to be 2 hr of empty bed contact time (EBCT) at a temperature above $4^{\circ}C$, in which improvements of chemical oxygen demand (COD), total nitrogen (TN) and total phosphorus (TP) of pond A compared to pond B were 3.62%, 3.48% and 1.81%, respectively. On the other hand, as the temperature was below $4^{\circ}C$, some degree of water quality improvement was achieved even when EBCT were 1 or 0.5 hr, suggesting that the BAC process can be successfully applied for the improvement of pond water quality in winter months. The values of biomass concentration and microorganism activity in each condition were highest where 2 hr of EBCT was applied at a temperature above $4^{\circ}C$, but values were similar throughout all treatment conditions, and thus, adsorption is considered to be the dominant factor affecting process efficiency. From the denaturing gel gradient electrophoresis (DGGE) results, no significant differences were observed among the activated carbon reactors, suggesting that the number of reactors in the system could be decreased for a more compact application of the system.

• Journal of Korea Multimedia Society
• /
• v.14 no.3
• /
• pp.339-347
• /
• 2011

As the volume visualization has been applied to render medical datasets, there has been a requirement to produce high quality images. Even though nice images can be generated by using previous linear filter, high order filter is required for better images. However, it takes much time for high order resampling, so that, overall rendering time is increased. In this paper, we perform high quality volume visualization using the cardinal interpolation. By enabling the empty space leaping which reduces the number of resampling, we achieve the efficient visualization. In detail, we divide the volume data into small blocks and leap empty blocks by referring the upper and lower bound value for each block. We propose a new method to estimate upper and lower bound value of for each block. As the result, we noticeably accelerated high quality volume visualization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.753-761
• /
• 2010

In this paper, we propose a novel tag collection algorithm to improve tag collection performance in active RFID systems. In the proposed algorithm, the reader detects the occurrence of empty slots and collided slots through the identified slot scan process and reduces the time wasted by empty slots and collided slots, resulting in improvement of tag collection performance. To evaluate the performance improvement by the proposed tag collection algorithm via the experiments in a real-world environment, we implemented an active RFID reader and tags. The experimental results with the reader and 60 tags showed that the proposed algorithm could reduce the average tag collection time by 21.7% and improve the average identification throughput by 28.3%, compared with the standard tag collection algorithm in ISO/IEC 18000-7. In addition, the proposed algorithm reduced the average battery consumption on tags by 22.7% in the battery consumption experiment with 20 tags.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.7
• /
• pp.1422-1428
• /
• 2009

In this paper, we consider an independent type cognitive radio system where secondary users can utilize empty channels that are not currently used by primary users having the license to these channels. In the previous works, secondary users search channels sequently or randomly to detect activities of primary user on channels. These channel searching methods however are not suitable to the characteristics of the wireless environment. Therefore, we propose a channel searching method based on the channel list for the purpose of reducing the channel searching time and improving the throughput of secondary users. In the proposed method, we firstly determine weighting value of each channel based on the history of channel activities of primary users and add the weighing value to current channel state buffer. And then, we search an empty channel from channel with smallest value to one with the biggest value. Finally, we compare the performances of the proposed method with those of the sequential channel searching and the random channel searching methods in terms of average channel searching time and average number of transmissions of secondary user.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.681-683
• /
• 2016

Recently, sharing economy is getting the attention of the public. So this phenomenon to share their goods, home, gifts, etc. in various fields has been increased. Typically when traveling away from home to host as "Airbnb", the share house to share their homes are traded most actively. Through a share house host can make money using house empty, customers can take advantage of the hostel while traveling at low prices. The existing share house system must ensure that every time they empty the house Customers, host had the inconvenience of having to wait for the application of the tenant customers. To solve this problem and to implement a service platform based on the waiting list. Through this platform, customers will be able to eliminate the inconvenience of having to find the house every time you want to apply for a tenant waiting to get home, give the order to wait.

• International conference on construction engineering and project management
• /
• 2009.05a
• /
• pp.1278-1282
• /
• 2009

In apartment type of housing, if resident's vehicle is registered in central control office and RFID TAG is issued, identification can be recognized from the time of entrance into parking lot and intelligent parking guide system can be activated based on the residents' profile. Parking Guide System leads a vehicle to the available parking space which is closest to the entrance gate of the vehicle's owner. And when residents forget where they parked their cars, they can query to the Parking Guide and Management System and get responses about the location. For the correct operation of this system, it is necessary to find out where the residents' cars have parked in real time and which lot is available for parking of other cars. RFID is very fancy solution for this system. RFID reader gathers the ID information in RFID TAGs in parked cars and updates the DB up to date. But, when non-residents' cars are parked inside apartment, RFID reader cannot identify them nor know the exact empty/occupied status of parking spaces because they don't react to RFID reader's query. So for the exact detection of empty/occupied status, we suggest the combined use of ultrasonic sensors and RFID. We designed a tree topology with intermediate data aggregators. The depth of tree is normally more than 3 from root (central office) to leaves (individual parking lots). The depth of 2 in tree topology brings about the bottleneck in communication and maintenance. We also designed the information fields used in RFID networks and Sensor Networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.3
• /
• pp.95-101
• /
• 2024

The numberlink puzzle(NLP), which non-crossings with other numbers of connection in connecting lines through empty cells between a given pair of numbers, is an NP-complete problem with no known way to solve the puzzle in polynomial time. Until now, arbitrary numbers have been selected and puzzles have been solved using trial-and-error methods. This paper converts empty cells into vertices in lattice graphs connected by edge between adjacent cells for a given problem. Next, a straight line was drawn between the pairs of numbers and divided into groups of numbers where crossing occurred. A bypass route was established to avoid intersection in the cross-number group. Applying the proposed algorithm to 18 benchmarking data showed that the puzzle could be solved with a linear time complexity of O(n) for all data.