• Proceedings of the Korean Society of Veterinary Pathology Conference
• /
• 2003.10a
• /
• pp.48-48
• /
• 2003

Mammary cancer is the most common malignant neoplasm in the bitch. It constitute 40 percent of all tumors in female dogs, which is three times higher than incidence of mammary tumors in humans[2]. Cytological differentiation between benign and malignant canine mammary tumors is difficult, however, an irregular chromatin pattern was reported to be a significant criterion for malignancy[1]. It can be estimated that approximately 30 percent of the surgically removed mammary tumors are malignant[4]. Malignant mammary tumors often have some degree of infiltrative/destructive growth into adjacent tissues and/or invasion of vessels. Malignant mammary tumors often metastasize into local lymph nodes and lungs, and less frequently into other organs[3]. Based on histological and cytological criteria, this case was diagnosed as tubulopapillary carcinoma of the mammary gland. (omitted)

• ALGAE
• /
• v.20 no.3
• /
• pp.225-232
• /
• 2005

Optical microscopy of recently living and cleared material of the fucoid, Ascophyllum nodosum (L.) Le Jolis, revealed novel aspects of its interaction with the ascomycete Mycophycias ascophylli (Cotton) Kohlmeyer and Kohlmeyer (previously Mycosphaerella ascophylli Cotton). Most host cells are associated with hyphae by lateral attachment of cell walls. Hyphae form extensive networks throughout the host thallus and show considerable differentiation in the various host tissues. In the base of epidermal cells, hyphae form multicellular rings around each host cell to produce a continuous network. In medullary regions, long, relatively unbranched and longitudinally aligned hyphae occur, with radial branches extending into cortical regions. Scattered in the inner cortex of host tissue are numerous multicellular nodes of smaller, polygonal to irregular shaped cells with five or more radiating arms of hyphae. Individual hyphal cells show a variety of specializations including swellings and appressoria-like attachments to some host cells. These observations provide the morphological basis for the mutualistic symbiosis supported by recent experimental work. We conclude that this association is best described by the term “symbiotum.”

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.1
• /
• pp.30-35
• /
• 2015

The most important factor within the wireless sensor network is to have effective network usage and increase the lifetime of the individual nodes in order to operate the wireless network more efficiently. Therefore, many routing protocols have been developed. The LEACH protocol presented by Wendi Hein Zelman, especially well known as a simple and efficient clustering based routing protocol. However, because LEACH protocol in an irregular network is the total data throughput efficiency dropped, the stability of the cluster is declined. Therefore, to increase the stability of the cluster head, in this paper, it proposes a stochastic cluster head selection method for improving the LEACH protocol. To this end, it proposes a SH-LEACH (Stochastic Cluster Head Selection Method-LEACH) that it is combined to the HEED and LEACH protocol and the proposed algorithm is verified through the simulation.

• Korean Journal of Veterinary Research
• /
• v.62 no.1
• /
• pp.2.1-2.5
• /
• 2022

An 8-year-old spayed female, mixed dog presented multiple, bloody exudative skin lesions on the bilateral flank which spread 1 week after mastectomy for treatment of mammary gland tumor (MGT). Multiple, ill-marginated, irregular, and heterogeneously thickened cutaneous and subcutaneous lesions and enlarged lymph nodes were identified in ultrasound and computed tomography. Histopathological examination confirmed adenocarcinoma with lymphatic invasion presumed to be metastatic MGT. Clinical signs improved after chemotherapy but died after 1 month. This study suggests that cutaneous metastasis be considered for differential diagnosis of cutaneous lesions in dogs with a history of MGT, although skin metastasis from MGT is rare.

• Structural Engineering and Mechanics
• /
• v.91 no.3
• /
• pp.239-250
• /
• 2024

With the aim to provide better predication about fracture behavior, a numerical simulating strategy based on the rigid spring model is proposed for reinforced concrete (RC) structures in this study. According to the proposed strategy, concrete is partitioned into a series of irregular rigid blocks based on the Voronoi diagram, which are connected by interface springs. Steel bars are simulated by bar elements, and the bond slip element is defined at bar element nodes to describe the interaction between reinforcement and concrete. A concrete damage evolution model based on the separation criterion is adopted to describe the weakening process of interface spring between adjacent blocks, while a nonlinear bond slip model is introduced to simulate the synergy behaviour of reinforced steel bars and concrete. In the damage evolution model of concrete, the influence of compressive stress perpendicular to the interface on the shear strength is considered. To check the effectiveness and applicability of the proposed modelling, experimental and numerical studies about a simply-supported RC beam and the two-notched concrete plates in Nooru-Mohamed's experiment are conducted, and the grid sensitivity are investigated.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1318-1332
• /
• 1999

본 논문에서는 입출력 응용을 위해 collective I/O 기법을 기반으로 한 실행시간 시스템의 설계, 구현 그리고 그 성능평가를 기술한다. 여기서는 모든 프로세서가 동시에 I/O 요구에 따라 스케쥴링하며 I/O를 수행하는 collective I/O 방안과 프로세서들이 여러 그룹으로 묶이어, 다음 그룹이 데이터를 재배열하는 통신을 수행하는 동안 오직 한 그룹만이 동시에 I/O를 수행하는 pipelined collective I/O 등의 두 가지 설계방안을 살펴본다. Pipelined collective I/O의 전체 과정은 I/O 노드 충돌을 동적으로 줄이기 위해 파이프라인된다. 이상의 설계 부분에서는 동적으로 충돌 관리를 위한 지원을 제공한다. 본 논문에서는 다른 노드의 메모리 영역에 이미 존재하는 데이터를 재 사용하여 I/O 비용을 줄이기 위해 collective I/O 방안에서의 소프트웨어 캐슁 방안과 두 가지 모형에서의 chunking과 온라인 압축방안을 기술한다. 그리고 이상에서 기술한 방안들이 입출력을 위해 높은 성능을 보임을 기술하는데, 이 성능결과는 Intel Paragon과 ASCI/Red teraflops 기계 상에서 실험한 것이다. 그 결과 응용 레벨에서의 bandwidth는 peak point가 55%까지 측정되었다.Abstract In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O simultaneously, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined to reduce I/O node contention dynamically. In other words, the design provides support for dynamic contention management. Then we present a software caching method using collective I/O to reduce I/O cost by reusing data already present in the memory of other nodes. Finally, chunking and on-line compression mechanisms are included in both models. We demonstrate that we can obtain significantly high-performance for I/O above what has been possible so far. The performance results are presented on an Intel Paragon and on the ASCI/Red teraflops machine. Application level I/O bandwidth up to 55% of the peak is observed.he peak is observed.

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

Clusters of workstations (COW) are becoming an attractive option for parallel scientific computing, a field formerly reserved to the MPPs, because their cost-performance ratio is usuallybetter than that of comparable MPPS, and their hardware and software can be easily enhanced to thelatest generations. In this paper we present the design and implementation of our runtime library forclusters of workstations, called "Collective I/O Clustering". The library provides a friendlyprogramming model for the I/O of irregular applications on clusters of workstations, being completelyintegrated with the underlying communication and I/O system. In the collective I/O clustering, two I/Oconfigurations are possible. In the first I/O configuration, all processors allocated can act as I/Oservers as well as compute nodes. In the second I/O configuration, only a subset of processors canact as I/O servers, The compression and software caching facilities have been incorporated into thecollective 1/0 clustering to optimize the communication and I/O costs. All the performance results wereobtained on the IBM-SP machine, located at Argonne National Labs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9B
• /
• pp.847-856
• /
• 2009

In geographic routing for wireless sensor networks, sources need the location of sinks destined for delivering their data packets. Most of the existing geographic routing protocols merely assume that the sources can get the locations of sinks by some location service. How source nodes find out the location of sinks is not easy. In this paper, we propose a sink location dissemination scheme in geographic routing for wireless sensor networks. In this scheme, a source node and a sink node send sink location announcement and query messages along two paths respectively by geographic routing. The node located on the crossing point of the two paths informs the source about the sink location. Then the source can send data packet to the sink by geographic routing. How to guarantee that these two paths have at least one crossing point in any irregular profile of sensor network is the challenge of this paper Simulation results show that our protocol is significantly superior to other protocols in terms of energy consumption and control overhead.

• Journal of Veterinary Clinics
• /
• v.16 no.2
• /
• pp.439-442
• /
• 1999

An animal health monitoring system in Gyeongnam area (near-Chinju) was studied to evaluate the environmental risk factors, physical examinations and 4 disease entities(abomasal displacement, traumatic reticulopericarditis ＆ -peritonitis, milk fever and lameness) in 40(34 in second year)dairy herds (total 1253 dairy cattle). In feeding environments, we examined housing system, forage percentage in ration, stall types, playground, cleanness of stall. In housing system, most of herds (60%) have tie-stall types and 36 herds are open-type housing. The forage ratio of ration was less than 50% in most of herds (67%). 39 herds had their own playgrounds and the frequency of playground cleanness was irregular, Physical examinations included the T(temperature), P (pulse), R (respiration), abnormalities of superficial lymph nodes, claw examination and total CBC with blood from tail veins. T, P, R are within normal limits (T : 38.1$\pm$0.6$^{\circ}C$, P : 84.6$\pm$12.9/min., R : 24.0$\pm$7.6/min. ,respectively), the swelling of lymph nodes were shown in 13 cattle and overall claw trimming was required in 3 herds. In blood examination, 23 cattle showed leuko-cytosis and 7 cattle showed low RBC and hemoglobin level, the other cattle were within normal limits (WBC : 8.90$\pm$2.06 10$^3$/ul., RBC : 6.36$\pm$1.02 10$^{6}$ ul, Hb : 9.83$\pm$ 1.20 g/dl PCV : 27.43$\pm$5.67 %, respectively). In 4 disease entities, we found some metallic foreign bodies in men of 13 cattle, which had predisposing factors of traumatic reticulopericarditis and reticuloperitonitis, 13 abomasal displacement, 51 milk fever and lameness in 39 cattle.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.240-243
• /
• 2007

Geographic routing has been considered as an efficient simple, and scalable routing protocol for wireless sensor networks since it exploits pure location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of the sinks. In this paper, we propose a scheme named Sink Location Service for geographic routing in wireless Sensor Networks, in which the source nodes can get and update the location of sinks with low overhead. In this scheme, a source and a sink send data announcement and query messages along two paths respectively by geographic routing. The node located on the crossing point of the two paths informs the source about the location of the sink. Then the source can send data packet to the sink by geographic routing. How to guarantee that these two paths have at least one crossing point in any irregular profile of sensor network is the challenge of this paper.