• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.199-201
• /
• 2003

Ad hoc network은 stationary infrastructure의 도움 없이 이동 노드들이 필요 시 network 형태을 구성하여 통신이 이루어지게 하는 network으로 ad hoc network 환경에 맞는 다양한 라우팅 프로토콜들이 개발되었고 크게는 table­driven, on­demand 방식으로 나눌 수 있는데 on­demand 방식의 AODV 프로토콜은 routing overhead가 적다는 장점이 있는 반면 single path로 data forwarding을 진행하여 중간노드의 이동에 의한 path가 broken되는 경우 local routing을 하거나 새로이 source­initialed route rediscovery을 수행하여 전송 delay 및 control traffic overhead 등을 높이는 결과를 발생 시켰다. 본 논문은 single path로 구성되는 AODV 프로토콜의 route failures시 문제점을 보완한 Associativity Based Redundancy path Routing(ABRR) 및 Alternate Redundancy path Routing(ARR) schemes을 제안한다. 첫째, ABRR은 main path상에 있는 각 노드들은 associativity based stable node 정보를 이용하여 path broken 이전에 local redundancy path을 구성하여 path broken시 local routing없이 route을 복구할 수 있게 하고 둘째, ARR은 source­initialed route discovery에 의해 alternate path을 구성하여 ABRR 그리고 local routing에 의해 main route recovery 실패 시 alternate path을 main path로 전환하여 control traffic overhead 및 전송 delay을 줄이게 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.475-491
• /
• 2009

This paper is primarily concerned with multi-path routing in Mobile Ad hoc Networks (MANETs). We propose a novel associativity-based on-demand source routing protocol for MANETs that attempts to establish relatively stable path(s) between the source and the destination. We introduce a new notion for gauging the temporal and spatial stability of nodes, and hence the paths interconnecting them. The proposed protocol is compared with other unipath (DSDV and AODV) and multi-path (AOMDV) routing protocols. We investigate the performance in terms of throughput, normalized routing overhead, packet delivery ratio etc. All on-demand protocols show good performance in mobile environments with less traffic overhead compared to proactive approaches, but they are prone to longer end-to-end delays due to route discovery and maintenance.

• Korean Journal of Logic
• /
• v.12 no.1
• /
• pp.89-110
• /
• 2009

This paper investigates generalizations of weakening-free uninorm logics not assuming associativity of intensional conjunction (so called fusion) &, as non-associative fuzzy-relevance logics. First, the strong t-associative monoidal uninorm logic StAMUL and its schematic extensions are introduced as non-associative propositional fuzzy-relevance logics. (Non-associativity here means that, differently from classical logic, & is no longer associative.) Then the algebraic structures corresponding to the systems are defined, and algebraic completeness results for them are provided. Next, predicate calculi corresponding to the propositional systems introduced here are considered.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.2
• /
• pp.90-102
• /
• 2010

Flash memory has been widely used as an important storage device for consumer electronics. For the flash memory-based storage systems, FTL (Flash Translation Layer) is used to handle the mapping between a logical page address and a physical page address. Especially, log buffer-based FTLs provide a good performance with small-sized mapping information. In designing the log buffer-based FTL, one important factor is to determine the mapping structure between data blocks and log blocks, called associativity. While previous works use static associativity fixed at the design time, we propose a new log block mapping scheme which adjusts associativity based on the run-time workload. Our proposed scheme improves the I/O performance about 5~16% compared to the static scheme by adjusting the associativity to provide the best performance.

• Korean Journal of Logic
• /
• v.19 no.3
• /
• pp.437-461
• /
• 2016

This paper investigates weakening-free fuzzy logics with three weak forms of associativity (of multiplicative conjunction &). First, the wta-uninorm (based) logic $WA_tMUL$ and its two axiomatic extensions are introduced as weakening-free weakly associative fuzzy logics. The algebraic structures corresponding to the systems are then defined, and algebraic completeness results for them are provided. Next, standard completeness is established for $WA_tMUL$ and the two axiomatic extensions with an additional axiom using construction in the style of Jenei-Montagna.

• The Mathematical Education
• /
• v.50 no.1
• /
• pp.41-59
• /
• 2011

Given the importance of algebra in the early grades, this paper analyzed the contents of whole numbers and their operations from the perspectives of generalized arithmetic. In particular, the focus of analysis was given to the properties of 0 and 1, those of operations such as commutativity, associativity, and distributivity, and the relations between operations. As such, this paper analyzed in detail how such properties and relations were introduced and expanded across different grades. It is expected that many issues in this paper will serve basic information to develop instructional materials in a way to fostering students' algebraic thinking in the elementary grades.

• Journal of English Language & Literature
• /
• v.55 no.6
• /
• pp.937-959
• /
• 2009

The Queen of the Air, John Ruskin-s highly elliptical publication of 1869, elaborates a complex mythology as a way of responding to the prevalence of scientific thinking, widespread environmental degradation, the pernicious effects of political economy, and mechanistic labor. Benjamin-s desire to rescue human experience from prevailing scientific conceptions is reminiscent of Ruskin-s fear that the peculiar power that shapes the unities of the natural world is simultaneously being "beaten down by the philosophers into a metal or evolved by them into a gas" and obscured by the dreams and theories of philosophers and theologians. As a critic remarks, in Benjamin-s-and, we would add, Ruskin-s-view, "what the modern era lacked was a basis for continuity which would prevent experience from disintegrating into a desultory and meaningless series of events." Despite its frenetic hyper-associativity, then, The Queen of the Air contains a key element that Benjamin believes is necessary for "redemption": the desire for a new form of consciousness that recognizes links to the past and thus to the longings and dreams of our forebears. Thus, although Ruskin most immediately influences Proust, who in turn influences Benjamin, Benjamin-s thought is far more Ruskinian than critics have heretofore observed. Just as Benjamin helps us make sense of the ways in which The Queen of the Air is caught in the grip of the shocking associativity of modern life, so Ruskin assists us in discerning similar impulses in Benjamin-s attraction to a form of archaic consciousness that can, by altering the modern form of perception, reenchant the present.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.673-677
• /
• 2010

Recently, NAND flash memory has been widely used in embedded systems, personal computers, and server systems because of its attractive features, such as non-volatility, fast access speed, shock resistance, and low power consumption. Due to its hardware characteristics, specifically its 'erase-before-write' feature, Flash Translation Layer is required for using flash memory like hard disk drive. Many FTL schemes have been proposed, but conventional FTL schemes have problems such as block thrashing and block associativity problem. The KAST scheme tried to solve these problems by limiting the number of associations between data block and log block to K. But it has also block thrashing problem in random access I/O pattern. In this paper, we proposed a new FTL scheme, UDA-LBAST. Like KAST, the proposed scheme also limits the log block association, but does not limit data block association. So we could minimize the cost of merge operations, and reduce merge costs by using a new block reclaim scheme, log block garbage collection.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09b
• /
• pp.23-26
• /
• 2003

In this paper, a methodolgy for customizing web pages for indivisual users is suggested. It shows an efficient way to personalize web pages by predicting one's site access pattern. In addition, the prediction can reflect one's tendency after actual purchase. By using the APRIORI algorithm, one of the association rule search methods, the associativity among the purchase items can be inferred. This inferrence is based on the log data in a web server and database about purchase. Finally, a web page which contains the relationship, relative links on other web pages, and inferred items can be generated after this process.

• Korean Journal of Logic
• /
• v.21 no.2
• /
• pp.155-174
• /
• 2018

This paper deals with Kripke-style semantics, which will be called algebraic Kripke-style semantics, for weakly associative fuzzy logics. First, we recall algebraic semantics for weakly associative logics. W next introduce algebraic Kripke-style semantics, and also connect them with algebraic semantics.