• Journal of Korea Multimedia Society
• /
• v.18 no.12
• /
• pp.1547-1554
• /
• 2015

Because there are numerous near field communication (NFC) technical standards and each standard has an independent communication protocol, an NFC software for controlling the protocols are significantly complicated. Especially, the anticollision algorithm for establishing the initial communication connection is classified into bit-oriented or time slot method according to the technical standards. Moreover, the anticollision algorithm is generally manipulated in software because of its complexity. In addition, since one host processor is shared by multiple modems in a connectivity SoC, embedding several communication modems with an NFC modem, the spare computing resources can be utilized for other modems by reducing the software cost to control the NFC modem. In this paper, we propose new design methods of the NFC modem for supporting anticollision, framing and bit rate detection in the hardware to reduce the software overhead. Therefore, the utilization of the NFC technology is enhanced in the connectivity SoC by minimizing the cost of software.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.651-661
• /
• 2007

Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies an identity $s{\approx}t$ if the corresponding graph algebra $\underline{A(G)}$ satisfies $s{\approx}t$. A graph G=(V,E) is called an $(xy)x{\approx}x(yy)$ graph if the graph algebra $\underline{A(G)}$ satisfies the equation $(xy)x{\approx}x(yy)$. An identity $s{\approx}t$ of terms s and t of any type ${\tau}$ is called a hyperidentity of an algebra $\underline{A}$ if whenever the operation symbols occurring in s and t are replaced by any term operations of $\underline{A}$ of the appropriate arity, the resulting identities hold in $\underline{A}$. In this paper we characterize $(xy)x{\approx}x(yy)$ graph algebras, identities and hyperidentities in $(xy)x{\approx}x(yy)$ graph algebras.

• Korean Journal of Oriental Medicine
• /
• v.2 no.1
• /
• pp.40-70
• /
• 1996

In the literatual study on the cerebral vascular dementia, the results were as follows : 1. Cerebral vascular dementia is so called apoplectic dementia, because it almost occurs after apoplexy, the attack rate has gradually increased by increase of life, so it exert a harmful influence to geriatric diseases. 2. The etiological factors are summarized on deficiency in the heart, kidney, liver(心, 腎, 肝虛), pathogenic wind(豊) pathogenic fire(火) phlegm(痰) and stagnated blood(瘀血) in the oriental medicine, and multiple cerebral infarction, cerebral anemia, decrease of cerebral vascular flow are etiological factors in the occidental medicine. 3. The region of infarction and attack of cerebral vascular dementia have a close connection, and generally the cerebral vascular dementia easily occur in injury of white matter of brain. 4. Symptoms of cerebral vascular dementia are dysphasia, walking disorder, hemiplegia, sensory paralysis, disturbance of memory, judgement, calculation, emotion incontinence, speech impediment, silence or talkative, lower thinking ability and depersonalization, and symptoms are aggravated by stage. 5. Therapeutic herb medicines are Palpungsan(八風散), Baepungsan(排風散), Jinsaanshinhwan(辰砂安神丸), Sabacksan(四白散), Kanghwalyupungsan(姜活愈風散), Woohwangchungshimhwan(牛黃淸心丸), and they are used to dispelling pathogenic wind(祛風), soothe the nerves(安神), dispel pathogenic heat from lung, nourish the blood(淸肺養血).

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1112-1125
• /
• 1999

최근 들어 멀티미디어를 지원하는 응용들의 서비스 품질 보장과 멀티캐스트 지원에 대한 요구가 증가되고 있으나 기존의 멀티캐스트 프로토콜로는 이러한 요구를 수용할 수 없는 문제가 발생하고 있다. 현재 인터넷에서 사용되고 있는 라우팅 메커니즘은 네트워크 자원 정보나 세션의 QoS 요구사항을 고려하지 않고 단순히 종단간의 연결에만 초점을 맞추고 있기 때문이다. 따라서 본 논문에서는 멀티캐스트 환경에서 서비스 품질보장을 지원하기 위한 새로운 프로토콜, LayeredQoS을 제안한다. 다중의 CP (Central Point)를 채택하고 각각의 CP에 적절한 QoS 레벨을 부여하여 사용함으로써 대역폭의 공유정도를 높일 뿐만 아니라 전체 트리 비용을 감소시켜 궁극적으로 네트워크 처리량이 증가되도록 하였다. 또한 시뮬레이션 방법을 통하여 다른 프로토콜보다 나은 성능을 가지는 것으로 평가하였다.Abstract Many emerging multimedia applications often require a guaranteed quality of service and multicast connection. But the traditional multicast protocol can't meet the needs since the routing mechanisms deployed in today's Internet are focused on connectivity, not on resource availability in the network or QoS requirements of flows. In this paper, we present LayeredQoS, a new QoS-based multicast routing algorithm. We adopt the multiple CPs(Central Points) and allocate QoS-levels for each CP in order to improve the degree of resource sharing and decrease the total tree cost, and then network throughput is increased. The proposed protocol is verified by simulations and it is shown that the performance of LayeredQoS is much better than the existing protocols.

• Journal of the Korean Professional Engineers Association
• /
• v.10 no.3
• /
• pp.8-16
• /
• 1977

The pbjective of this study to clarify the varietal resistance to green leaf-and planthopper and the evaluate the nature of the resistance to the insects in connection with the Antibiosis. this study was investigated the reaction of the varieties to insects with 46 rice varieties including recommended varieties of korea, At seedling stage they were in fested with second of third inster nymphs. the results were as follows. 1. Most of the rice vari eties tested showed highly susceptible reaction to Brown planthopper except Mudgo, KR 108-143- and HR529-41-3-2 as resistance, and Akamoch, Satominori, IR 24 and IR 8 asmoderately suscptible. 2. In the test of varietal resistance to white backed planthopper Mudgo, KR 108-243-1, KR 109-154-2 and HR 529-45-3-2 were resistance, and Suweon 82, Tongil, IR 8 palkeum, Iri 309, Hokwang and Chuhoku #31 were Moderatly susceptible. 3. Most of the varieties tested were observed highly resistance to green leafhopper, but Tongil, Suweon 82, IR 24, Milsung and Chuhoku #31 were Moderatly susceptible. 4. the new bred lines HR 108-243-1 are multiple resistance of Brown planthopper, green leafhopper and white babked planthopper, and some others showed moderatly susceptible as. IR 8: Brown planthopper, white backed planthopper. IR 24: Brown poanthopper, green leafhopper. Tongil: suweon #82, Chukoku #31, whist backed planthopper, Green leafhopper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.671-690
• /
• 2010

The continuous growth of attacks in the Internet causes to generate a number of rules in security devices such as Intrusion Prevention Systems, firewalls, etc. Policy anomalies in security devices create security holes and prevent the system from determining quickly whether allow or deny a packet. Policy anomalies exist among the rules in multiple security devices as well as in a single security device. The solution for policy anomalies requires complex and complicated algorithms. In this paper, we propose a new method to remove policy anomalies in a single security device and avoid policy anomalies among the rules in distributed security devices. The proposed method classifies rules according to traffic direction and checks policy anomalies in each device. It is unnecessary to compare the rules for outgoing traffic with the rules for incoming traffic. Therefore, classifying rules by in-out traffic, the proposed method can reduce the number of rules to be compared up to a half. Instead of detecting policy anomalies in distributed security devices, one adopts the rules from others for avoiding anomaly. After removing policy anomalies in each device, other firewalls can keep the policy consistency without anomalies by adopting the rules of a trusted firewall. In addition, it blocks unnecessary traffic because a source side sends as much traffic as the destination side accepts. Also we explain another policy anomaly which can be found under a connection-oriented communication protocol.

• The Journal of Korean Physical Therapy
• /
• v.24 no.1
• /
• pp.35-40
• /
• 2012

Purpose: This study was to analyze the factors that affect the service relationship of long term care workers for the elderly and to provide basic resource for the successful connection of long term care services. Methods: 259 subjects who were engaged in long term care units completed a self-administered questionnaire that measured the extent of service linkage among one another. The Cronbach's ${\alpha}$ score determined the internal consistency of the acquired data and the discriminated validity was estimated by Pearson's correlation coefficient. Multiple regression analysis was conducted to investigate the influence of the known factors on the service linkage. Results: Acceptance and participation negatively influenced on the service linkage. Reliance, comprehension, recognition on service, and frequent contact with others positively activated the service linkage of long term care workers. Conclusion: The establishments of systemic training courses providing education that emphasizes reliability and recognizes other services, including work environment to contact easily are needed to improve the service-linkage of long-term care workers for the elderly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5322-5342
• /
• 2016

In vehicle-to-vehicle (V2V) networks, where selfishness degrades node activity, countermeasures for collaboration enforcement must be provided to enable application of a sage and efficient network environment. Because vehicular networks feature both high mobility and various topologies, selfish behavior judgment and establishment of a stable routing protocol become intensely challenging. In this paper, a two-phase-based generous cooperative routing protocol (called GEC) is presented for V2V networks to provide resistance to selfishness. To detect selfish behaving vehicles, a packet forwarding watchdog and an average connection rate based on the multipath weight method are used, where evidence is gathered from different watchdogs. Then, multihop relay decisions are made using a generous cooperative algorithm based on game theory. Finally, through buffering of the multiple end-to-end paths and judicious choice of optimal cooperative routes, route maintenance phase is capable of dealing with congestion and rapidly exchanging traffic. Specifically, it is proved that the GEC is theoretically subgame perfect. Simulation results show that for V2V networks with inherently selfish nodes, the proposed method isolates uncooperative vehicles and is capable of accommodating both the mobility and congestion circumstances by facilitating information dissemination and reducing end-to-end delay.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.2
• /
• pp.75-89
• /
• 2003

Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

• The Journal of the Korea Contents Association
• /
• v.13 no.4
• /
• pp.407-417
• /
• 2013

The purpose of this study is to investigate leisure types of casino dealers, and how these leisure types effect the organization trust, customer orientation, organization commitment. This study was performed survey questionnaire on casino dealers at Kangwondo and Seoul. To achieve the research objectives, analysis methods were used: regression analysis and multiple regression analysis. The results of the study were as follows. First, leisure types had a effect on organization trust. Second, leisure types had a effect on customer orientation and organization commitment. Third, organization trust had a effect on organization commitment. Finally, customer orientation had a effect on organization commitment. The results of this study suggested implications for effective human resource management practices on casino dealers in leisure activities and support measures for the organization in connection with the leisure types.