• Title/Summary/Keyword: Network theory

Search Result 1,835, Processing Time 0.021 seconds

CLUSTERING DNA MICROARRAY DATA BY STOCHASTIC ALGORITHM

  • Shon, Ho-Sun;Kim, Sun-Shin;Wang, Ling;Ryu, Keun-Ho
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.438-441
    • /
    • 2007
  • Recently, due to molecular biology and engineering technology, DNA microarray makes people watch thousands of genes and the state of variation from the tissue samples of living body. With DNA Microarray, it is possible to construct a genetic group that has similar expression patterns and grasp the progress and variation of gene. This paper practices Cluster Analysis which purposes the discovery of biological subgroup or class by using gene expression information. Hence, the purpose of this paper is to predict a new class which is unknown, open leukaemia data are used for the experiment, and MCL (Markov CLustering) algorithm is applied as an analysis method. The MCL algorithm is based on probability and graph flow theory. MCL simulates random walks on a graph using Markov matrices to determine the transition probabilities among nodes of the graph. If you look at closely to the method, first, MCL algorithm should be applied after getting the distance by using Euclidean distance, then inflation and diagonal factors which are tuning modulus should be tuned, and finally the threshold using the average of each column should be gotten to distinguish one class from another class. Our method has improved the accuracy through using the threshold, namely the average of each column. Our experimental result shows about 70% of accuracy in average compared to the class that is known before. Also, for the comparison evaluation to other algorithm, the proposed method compared to and analyzed SOM (Self-Organizing Map) clustering algorithm which is divided into neural network and hierarchical clustering. The method shows the better result when compared to hierarchical clustering. In further study, it should be studied whether there will be a similar result when the parameter of inflation gotten from our experiment is applied to other gene expression data. We are also trying to make a systematic method to improve the accuracy by regulating the factors mentioned above.

  • PDF

SNS as a Method of Election Campaign: A Case study of the 2015's Special Election in South Korea (정치인들의 선거 캠페인 수단으로서의 SNS 활용: 2015년 4·29 재·보궐선거를 중심으로)

  • Park, SeMi;Hwang, HaSung
    • Journal of Internet Computing and Services
    • /
    • v.17 no.2
    • /
    • pp.87-95
    • /
    • 2016
  • Considerable research over the years has been devoted to ascertaining the impact of social media on political settings.In recent days, Social Network Sites (SNS) such as Facebook allowed users to share their political beliefs, support specific candidates, and interact with others on political issues. This study examines the role of SNS as the means of political campaign. The study tasks the case of the 2015'sspecial election, Seoul Korea. The analysis aims to identify how candidates use Facebook or Twitter to interact with voters by applying functional theory of political campaign discourse developed by Benoit. In this study, we analyzed the candidates' SNS messages in terms of political behavior such as self-expression, informing policy, asking voters to participate in political events. Among them the results indicated that two candidates, Jung, Dong Young and Byun, Hee Jae, both of them used SNS to express themselves the most. The study also found that two candidates used mainly the strategy called 'acclaim' which praises their own strengths. In terms of topics of SNS messages (policy versus character) there was different between two candidates. Jung, sent message in relation to 'character' the most, while Byun contained 'policy' message on SNS the most. Based on these findings implications and directions for future studies are discussed.

Lower bound on the Number of Rounds for Optimistic Multi-party Contract Signing Protocol (낙관적 다자간 계약서 서명 프로토콜 라운드의 하한)

  • Joo, Hong-Don;Chang, Jik-Hyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.10
    • /
    • pp.499-506
    • /
    • 2005
  • The growth of networks increase the importance of electronic commerces. Since the fair exchange protocol is an important part of electronic commerces, a number of researches have been done in relation to the fair exchange protocol. As the contract signing protocol is a part of fair exchange protocol, many protocols have been proposed, but most of them were focused on two-party protocol. Only a few were on the multi-party contract signing protocol. So far the optimistic multi-party contract signing protocol presented by Baum-Waidner has the least number of rounds in asynchronous network[4]. But, the lower bound on the number of rounds required by any optimistic multi-party contract signing protocol has been not known. In this paper, we present a tight lower bound on the number of rounds for optimistic multi-party contract signing protocol.

An Energy Harvesting Aware Routing Algorithm for Hierarchical Clustering Wireless Sensor Networks

  • Tang, Chaowei;Tan, Qian;Han, Yanni;An, Wei;Li, Haibo;Tang, Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.504-521
    • /
    • 2016
  • Recently, energy harvesting technology has been integrated into wireless sensor networks to ameliorate the nodes' energy limitation problem. In theory, the wireless sensor node equipped with an energy harvesting module can work permanently until hardware failures happen. However, due to the change of power supply, the traditional hierarchical network routing protocol can not be effectively adopted in energy harvesting wireless sensor networks. In this paper, we improve the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol to make it suitable for the energy harvesting wireless sensor networks. Specifically, the cluster heads are selected according to the estimation of nodes' harvested energy and consumed energy. Preference is given to the nodes with high harvested energy while taking the energy consumption rate into account. The utilization of harvested energy is mathematically formulated as a max-min optimization problem which maximizes the minimum energy conservation of each node. We have proved that maximizing the minimum energy conservation is an NP-hard problem theoretically. Thus, a polynomial time algorithm has been proposed to derive the near-optimal performance. Extensive simulation results show that our proposed routing scheme outperforms previous works in terms of energy conservation and balanced distribution.

A Probabilistic Model of Damage Propagation based on the Markov Process (마코프 프로세스에 기반한 확률적 피해 파급 모델)

  • Kim Young-Gab;Baek Young-Kyo;In Hoh-Peter;Baik Doo-Kwon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.8
    • /
    • pp.524-535
    • /
    • 2006
  • With rapid development of Internet technology, business management in an organization or an enterprise depends on Internet-based technology for the most part. Furthermore, as dependency and cohesiveness of network in the communication facilities are increasing, cyber attacks have been increased against vulnerable resource in the information system. Hence, to protect private information and computer resource, research for damage propagation is required in this situation. However the proposed traditional models present just mechanism for risk management, or are able to be applied to the specified threats such as virus or worm. Therefore, we propose the probabilistic model of damage propagation based on the Markov process, which can be applied to diverse threats in the information systems. Using the proposed model in this paper, we can predict the occurrence probability and occurrence frequency for each threats in the entire system.

One-round Protocols for Two-Party Authenticated Key Exchange (1-라운드 양자간 키 교환 프로토콜)

  • Jeong, Ik-Rae;Lee, Dong-Hoon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.1_2
    • /
    • pp.110-118
    • /
    • 2006
  • Cryptographic protocol design in a two-party setting has of tel ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channel). In particular, most protocols for two-party key exchange have been designed assuming that parties alternate sending their messages (i.e., assuming a bidirectional half-duplex channel). However, by taking advantage of the communication characteristics of the network it may be possible to design protocols with improved latency. This is the focus of the present work. We present three provably-secure protocols for two-party authenticated key exchange (AKE) which require only a single round. Our first, most efficient protocol provides key independence but not forward secrecy. Our second scheme additionally provides forward secrecy but requires some additional computation. Security of these two protocols is analyzed in the random oracle model. Our final protocol provides the same strong security guarantees as our second protocol, but is proven secure in the standard model. This scheme is only slightly less efficient (from a computational perspective) than the previous ones. Our work provides the first provably- secure one-round protocols for two-party AKE which achieve forward secrecy.

Design and Implementation of a User-based MPI Checkpointer for Portability (이식성을 고려한 사용자기반 MPI 체크포인터의 설계 및 구현)

  • Ahn Sun-Il;Han Sang-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.1_2
    • /
    • pp.35-43
    • /
    • 2006
  • An MPI Checkpointer is a tool which provides fault-tolerance through checkpointing The previous researches related to the MPI checkpointer have focused on automatic checkpointing and recovery capabilities, but they haven't considered portability issues. In this paper, we discuss design and implementation issues considered for portability when we developed an MPI checkpointer called STFT. In order to increase portability, firstly STFT supports the abstraction interface for a single process checkpointer. Secondly, STFT uses a user-based checkpointing method, and limits possible checkpointing places a user can make. Thirdly, STFT lets the MPI_Init create network connections to the other MPI processes in a fixed order. With these features, we expect STFT can be easily adaptable to various platforms and MPI implementations, and confirmed STFT is easily adaptable to LAM and MPICH/P4 with the prototype Implementation.

The impact of the Formation Factor of Loyalty Of Mongolian Consumers Attitudes toward M-Commerce

  • Altanzul, Ganbaatar;Lee, Dong-Man
    • 한국정보컨버전스학회:학술대회논문집
    • /
    • 2008.06a
    • /
    • pp.135-140
    • /
    • 2008
  • Recently in the Mongolian wireless marketplace, many E-commerce companies have been making considerable investments in the technological development of M-commerce, taking competitive advantage of new business possibilities offered by Internet-based wireless technologies. In the Mongolian wireless marketplace, this new mobile environment opens the door for new and exciting market opportunities in mobile services and applications. In the near future, these companies will be looking toward M-commerce services as a supplemental source of revenue in the mobile marketplace. This paper examines the roles of M-commerce in the consumers' in order to promote the consumers' loyalty in the booming M-commerce. This paper contains theory that focuses on the basic concepts of the M-commerce environment, its wireless network technologies, and its applications infrastructure. Upon searching for references to assist us in establishing a market hypothesis, we discovered that few comprehensive studies on consumer perspective and behavior related to M-commerce services actually exist in the literature. In the area of M-commerce, many companies neglect the consumer perspective, concentrating only on technological factors only when formulating their market strategies. And, due to technological blindness, many companies were not able to succeed in end-user E-commerce services. Given that fact, this paper formulates a consumer-centric research model. In order to prove the research model, we chose the survey method which allows for the collection of large amounts of data from a sizeable population in a highly economical way. Through the survey, this paper defines consumer's attitudes towards M-commerce services by identifying potential Business-to-Commerce(B2C) applications and its primary target groups in terms of gender and age, and by investigating whether consumers recognize the value proposition of M-commerce applications and services. As shown in the data analysis and results, this research concludes that M-commerce development in Mongolia is still at its infancy, and that the implementation of M-commerce depends not only on technological progress, but also on consumer attitudes and their willingness to adopt M-commerce services. As well, other complex cross-cultural factors-socially, economically, culturally, et cetera-enter strongly into the equation.

  • PDF

A Case Study of Family Therapy for a Daughter with a Binge-Drinking Problem (폭음문제를 가진 성인자녀(딸)에 대한 가족치료 사례연구)

  • Lim, A Ri;Park, Tai Young
    • Journal of Families and Better Life
    • /
    • v.33 no.3
    • /
    • pp.31-48
    • /
    • 2015
  • This study examined the factors affecting the client's binge drinking, and the client and parents' change led by family therapy. From August to November 2011, the counseling case of this research was consisted of a total of 9 sessions-individual, parents, mother-daughter, father-daughter, and family counseling. This study utilized verbatim and audio recordings, and employed Miles and Huberman(1994) matrix and network to analyze the data. The findings of the study revealed that the factors that influenced the client's binge drinking included the family's dysfunctional communication method, adverse rearing attitude owing to unresolved emotional problems from the family-of-origin, and the client family's peculiar environment and culture. The therapist's intervention included making the client aware of his own problem, helping to gain insight and understand the parents' family-of-origin, connecting the past family-of-origin and the present, identifying attempted solutions, making aware of new change, and suggesting new communication methods. Through the therapist's intervention employing MRI interactional family therapy model and Bowen's family systems theory, the family members experienced changes; perception of all family members that participated in the counseling changed, and accordingly, their communication method and attitude changed as well. Through these changes in the family, the client's alcohol consumption reduced in terms of both frequency and amount, thus was able to solve their binge drinking problem.

Resource Demand and Price Prediction-based Grid Resource Transaction Model (자원 요구량과 가격 예측 기반의 그리드 자원 거래 모델)

  • Kim, In-Kee;Lee, Jong-Sik
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.5
    • /
    • pp.275-285
    • /
    • 2006
  • This paper proposes an efficient market mechanism-based resource transaction model for grid computing. This model predicts the next resource demand of users and suggests reasonable resource price for both of customers and resource providers. This model increases resource transactions between customers and resource providers and reduces the average of transaction response times from resource providers. For prediction accuracy improvement of resource demands and suggestion of reasonable resource price, this model introduces a statistics-based prediction model and a price decision model of microeconomics. For performance evaluating, this paper measures resource demand prediction accuracy rate of users, response time of resource transaction, the number of resource transactions, and resource utilization. With 87.45% of reliable prediction accuracy, this model works on the less 72.39% of response time than existing resource transaction models in a grid computing environment. The number of transactions and the resource utilization increase up to 162.56% and up to 230%, respectively.