• Communications of the Korean Mathematical Society
• /
• v.9 no.3
• /
• pp.687-700
• /
• 1994

Throughout this paper we will let H denote the complete Heyting algebra ($H, \vee, \wedge, *$) with order reversing involution *. 0 and 1 denote the supermum and the infimum of $\emptyset$, respectively. Given any set X, any element of $H^X$ is called H-fuzzy set (or, simply f.set) in X and will be denoted by small Greek letters, such as $\mu, \nu, \rho, \sigma$. $H^X$ inherits a structure of H with order reversing involution in natural way, by definding $\vee, \wedge, *$ pointwise (sam notations of H are usual). If $f$ is a map from a set X to a set Y and $\mu \in H^Y$, then $f^{-1}(\mu)$ is the f.set in X defined by f^{-1}(\mu)(x) = \mu(f(x))$. Also for $\sigma \in H^X, f(\sigma)$ is the f.set in Y defined by $f(\sigma)(y) = sup{\sigma(x) : f(x) = y}$ ([4]). A preorder R on a set X is reflexive and transitive relation on X, the pair (X,R) is called preordered set. A map $f$ from a preordered set (X, R) to another one (Y,T) is said to be preorder preserving (inverting) if for $x,y \in X, xRy$ implies $f(x)T f(y) (resp. f(y)Tf(x))$. For the terminology and notation, we refer to [10, 11, 13] for category theory and [7] for H-fuzzy semitopogenous spaces.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.400-402
• /
• 2006

Matrix multiplication is an important problem in linear algebra. its main significance for combinatorial algorithms is its equivalence to a variety of other problems, such as transitive closure and reduction, solving linear systems, and matrix inversion. Thus the development of high-performance matrix multiplication implies faster algorithms for all of these problems. In this paper. we present a quantitative comparison of the theoretical and empirical performance of key matrix multiplication algorithms and use our analysis to develop a faster algorithm. We propose a Hybrid approach on Winograd's and Strassen's algorithms that improves the performance and discuss the performance of the hybrid Winograd-Strassen algorithm. Since Strassen's algorithm is based on a $2{\times}2$ matrix multiplication it makes the implementation very slow for larger matrix because of its recursive nature. Though we cannot get the theoretical threshold value of Strassen's algorithm, so we determine the threshold to optimize the use of Strassen's algorithm in nodes through various experiments and provided a summary shown in a table and graphs.

• Journal of the Korea Society for Simulation
• /
• v.12 no.4
• /
• pp.73-81
• /
• 2003

An Ad Hoc network is a dynamic multi-hop wireless network that is established by a group of mobile hosts on a shared wireless channel by virtue of their proximity to each other. Since wireless transmissions are locally broadcast in the region of the transmitting host, hosts that are in close proximity can hear each other and are said to be neighbors. The transitive closure of the neighborhood of all the hosts in the set of mobile hosts under consideration forms an Ad Hoc network. Thus, each host is potentially a router and it is possible to dynamically establish routes by chaining together a sequence of neighboring hosts from a source to a destination in the Ad Hoc network. In a network, various real-time services require the network to guarantee the Quality of Services provided to the receiver. End-to-end QoS can be provided most efficiently when each layer of the protocol stack translates the requirements of the application into layer classified requirements and satisfies them. In this study, a mechanism to guarantee the QoS in Ad Hoc networks with buffer nodes is proposed. They effectively prevent traffic congestion and yield better transmission rate. In this way QoS is enhanced.

• Journal of Information Technology Applications and Management
• /
• v.20 no.4
• /
• pp.191-205
• /
• 2013

Recently, the topic of predicting interpersonal trust in online social networks is receiving considerable attention, because trust plays a critical role in controlling the spread of distorted information and vicious rumors, as well as reducing uncertainties and risk from unreliable users in social networks. Several trust prediction models have been developed on the basis of transitivity and composability properties of trust; however, it is hard to find empirical studies on whether and how transitivity and composability properties of trust are operated in real online social networks. This study aims to predict interpersonal trust between two unknown users in social networks and verify the proposition on whether and how transitivity and composability of trust are operated in social networks. For this purpose, we chose three social network sites called FilmTrust, Advogato, and Epinion, which contain explicit trust information by their users, and we empirically investigated the proposition. Experimental results showed that trust can be propagated farther and farther along the trust link; however, when path distance becomes distant, the accuracy of trust prediction lowers because noise is activated in the process of trust propagation. Also, the composability property of trust is operated as we expected in real social networks. However, contrary to our expectations, when the path is synthesized more during the trust prediction, the reliability of predicted trust did not tend to increase gradually.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.551-562
• /
• 2000

Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.5
• /
• pp.231-242
• /
• 2016

In order to meet rapid changes of Web information, it is necessary to extend the current Web technologies to represent both the valid time and location of each fact and knowledge, and reason their relationships. Until recently, many researches on qualitative temporal reasoning have been conducted in laboratory-scale, dealing with small knowledge bases. However, in this paper, we propose the design and implementation of a parallel qualitative temporal reasoner, MRQUTER, which can make reasoning over Web-scale large knowledge bases. This parallel temporal reasoner was built on a Hadoop cluster system using the MapReduce parallel programming framework. It decomposes the entire qualitative temporal reasoning process into several MapReduce jobs such as the encoding and decoding job, the inverse and equal reasoning job, the transitive reasoning job, the refining job, and applies some optimization techniques into each component reasoning job implemented with a pair of Map and Reduce functions. Through experiments using large benchmarking temporal knowledge bases, MRQUTER shows high reasoning performance and scalability.

• The Journal of the Convergence on Culture Technology
• /
• v.1 no.2
• /
• pp.21-36
• /
• 2015

This study is a descriptive study to examine how poem causes effects of literary treatment for the contemporary people and how to improve therapeutic effect with poem by illustrating the process of therapeutic effect by poem. Each poem in the poetry book has a well-organized flow. While those poems are mixed, it can be synapsed into the cognitive system of readers by their taste in the form of introduction, development, turn, and conclusion.' The poetry book is structured with the transition of literary treatment. Such transition structure is embodied in a circle. If poetic contents are positive and creative in such transitive structure, it gives more comfort and excitement to readers increasing therapeutic effect. Therefore, it is very important to progress literatherapy narrative with such creative works.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.992-1005
• /
• 2014

Coreference resolution finds all expressions that refer to the same entity in a document. Coreference resolution is important for information extraction, document classification, document summary, and question answering system. In this paper, we adapt Stanford's Multi-pass sieve system, the one of the best model of rule based coreference resolution to Korean. In this paper, all noun phrases are considered to mentions. Also, unlike Stanford's Multi-pass sieve system, the dependency parse tree is used for mention extraction, a Korean acronym list is built 'dynamically'. In addition, we propose a method that calculates weights by applying transitive properties of centers of the centering theory when refer Korean pronoun. The experiments show that our system obtains MUC 59.0%, $B_3$ 59.5%, Ceafe 63.5%, and CoNLL(Mean) 60.7%.

• Korean Institute of Interior Design Journal
• /
• no.15
• /
• pp.86-93
• /
• 1998

An Apartment Veranda is a transitive space which is being used for many different purpose. A Rear Veranda which is connected to the kitchen is an important space for the housekeeping work and it should be planned carefully to reflect the rational and functional designs. Therefore the objective of this research is to suggest a systematic basis for the practical space planning of the Rear veranda that meets the varied needs of consumers by examining its usage pattern through the analysis of the apartment occupant's behavior pattern stored item the degree of satisfaction and consumer requirements. The research was conducted mainly on apartments built after 1990. The following are the conclusions from the research : 1. Most of the research respondents were aware of the absolute need for the Rear veranda. But they expressed dissatisfaction with the space usage. This indicates that the Rear Veranda planning does not reflect the functionality of the space and concentrates on the idea of providing consumers a service space based on the size of the apartment instead. 2. Although the Rear veranda is used as the multipurpose housework space it is mainly used as the laundry and storage space. This shows a big deviation from the concept of the utility space. Because the behavior pattern associated with the Rear Veranda is largely influenced by the traditional life pattern the development of the Rear Veranda as an exclusive space for the housekeeping work. 3. According to a high frequency of the storage of the laundry related item in the Rear Veranda indicated by the research the Rear veranda is used as the laundry room as well as a auxiliary storage space by most people. The installation of gas range is expected to increase due to the expansion of the usage function of the Rear Veranda space. The installation of a specialized refrigerator to store the traditional food is demanded. 4. Consumers need more efficient and functional storage device because the temporary shelves are often being used as the storage device. The perception of the storage device is assumed to have been influence by the traditional life style.

• Korean Journal of Cognitive Science
• /
• v.18 no.2
• /
• pp.91-112
• /
• 2007

Two experiments were conducted to examine psychological reality and incremental nature of thematic processing in Korean sentence comprehension. By using two different types of verbs (i.e., transitive and causative verbs), we manipulated necessity of the thematic reanalysis (i.e., consistent vs. inconsistent condition) in the coordinated sentence structures. In Experiment 1, there was no significant difference in the reading times of the verbs between the consistent and the inconsistent condition. However, there was significant differences in question answering times between the two conditions. In Experiment 2 in which we changed a noun phrase of the test sentences into inanimate one, we found significant thematic reanalysis effects in the reading times of the final verbs. Based on these results we discussed the theoretical importance and universality of the thematic processes.