• Title/Summary/Keyword: graph type

Search Result 329, Processing Time 0.025 seconds

A Method for Microarray Data Analysis based on Bayesian Networks using an Efficient Structural learning Algorithm and Data Dimensionality Reduction (효율적 구조 학습 알고리즘과 데이타 차원축소를 통한 베이지안망 기반의 마이크로어레이 데이타 분석법)

  • 황규백;장정호;장병탁
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.11
    • /
    • pp.775-784
    • /
    • 2002
  • Microarray data, obtained from DNA chip technologies, is the measurement of the expression level of thousands of genes in cells or tissues. It is used for gene function prediction or cancer diagnosis based on gene expression patterns. Among diverse methods for data analysis, the Bayesian network represents the relationships among data attributes in the form of a graph structure. This property enables us to discover various relations among genes and the characteristics of the tissue (e.g., the cancer type) through microarray data analysis. However, most of the present microarray data sets are so sparse that it is difficult to apply general analysis methods, including Bayesian networks, directly. In this paper, we harness an efficient structural learning algorithm and data dimensionality reduction in order to analyze microarray data using Bayesian networks. The proposed method was applied to the analysis of real microarray data, i.e., the NC160 data set. And its usefulness was evaluated based on the accuracy of the teamed Bayesian networks on representing the known biological facts.

Semantics Aware Packet Scheduling for Optimal Quality Scalable Video Streaming (다계층 멀티미디어 스트리밍을 위한 의미기반 패킷 스케줄링)

  • Won, Yo-Jip;Jeon, Yeong-Gyun;Park, Dong-Ju;Jeong, Je-Chang
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.10
    • /
    • pp.722-733
    • /
    • 2006
  • In scalable streaming application, there are two important knobs to tune to effectively exploit the underlying network resource and to maximize the user perceivable quality of service(QoS): layer selection and packet scheduling. In this work, we propose Semantics Aware Packet Scheduling (SAPS) algorithm to address these issues. Using packet dependency graph, SAPS algorithm selects a layer to maximize QoS. We aim at minimizing distortion in selecting layers. In inter-frame coded video streaming, minimizing packet loss does not imply maximizing QoS. In determining the packet transmission schedule, we exploit the fact that significance of each packet loss is different dependent upon its frame type and the position within group of picture(GOP). In SAPS algorithm, each packet is assigned a weight called QoS Impact Factor Transmission schedule is derived based upon weighted smoothing. In simulation experiment, we observed that QOS actually improves when packet loss becomes worse. The simulation results show that the SAPS not only maximizes user perceivable QoS but also minimizes resource requirements.

Automatic Extraction Method for Basic Insect Footprint Segments (곤충 발자국 인식을 위한 자동 영역 추출기법)

  • Shin, Bok-Suk;Woo, Young-Woon;Cha, Eui-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.275-278
    • /
    • 2007
  • In this paper, we proposed a automatic extraction method as a preprocessing stage for extraction of basic insect footprint segments. In general, sizes and strides of footprints may be different according to type and size of an insect for recognition. Therefore we proposed an improved algorithm for extraction of basic insect footprint segments regardless of size and stride of footprint pattern. In the proposed algorithm, threshold value for clustering is determined automatically using contour shape of the graph created by accumulating distances between all the spots of footprint pattern. In the experimental results applying the proposed method, The basic footprint segments should be extracted from a whole insect footprint image using significant information in order to find out appropriate features for classification.

  • PDF

Comparison Analysis of Building's Heating Energy Consumption in the Apartment Complex - Focused on Apartment in Daejeon - (공동주택 단지 내 동별 난방에너지소요량 비교 분석 - 대전지역 아파트단지를 중심으로 -)

  • Jang, Young-Hye;Kim, Jeong-Gook;Kim, Jonghun;Jeong, Hakgeun;Hong, Won-Hwa;Jang, Cheol-Yong
    • KIEAE Journal
    • /
    • v.15 no.3
    • /
    • pp.37-42
    • /
    • 2015
  • Purpose: Apartment is a typical residential type in Korea. In the past, apartment types were very monotonous. But today, the types of complex are changed because personal needs have been diversified and personalized. In order to meet those needs, construction companies are constructing various types of apartments. The more apartment types are diverse, the more the energy problems are taken place. So, the purpose of this study is to solve the problem of energy gap in the same complex through improving the thermal transmittance of wall. Method: Heating energy consumption of Building Energy Efficiency Rating System and heating energy usage of apartment show a similar trend on the graph. In order to identify the best position of heating energy consumption difference reduction, we change the building's U-value of front, back, side walls. Result: In the A complex, maximum and minimum heating energy consumption building's shapes are flat. the best efficiency is side U-value change and the worst is front change. In the E complex, maximum heating energy consumption building's shape is tower and minimum building shape is flat. Consequently, the front and back wall performance change was little effect to reduce energy gap, while the change of side wall's U-value show the great reduction between building's energy consumptions.

Development of Technology Mapping Algorithm for CPLD by Considering Time Constraint (시간제약 조건을 고려한 CPLD 기술 매핑 알고리즘 개발)

  • Kim, Hi-Seok;Byun, Sang-Zoon
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.6
    • /
    • pp.9-17
    • /
    • 1999
  • In this paper, we propose a new technology mapping algorithm for CPLD under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result, it makes delay time and the number of CLBs to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces delay time and the number of CLBs much more than the existing tools of technology mapping algoritm.

  • PDF

Prognostic Factors and Survival in Acute Myeloid Leukemia Cases: a Report from the Northeast of Iran

  • Allahyari, Abolghasem;Tajeri, Tarane;Sadeghi, Masoud
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.17 no.3
    • /
    • pp.1547-1551
    • /
    • 2016
  • Background: Acute myeloid leukemia (AML) is a clonal hematopoietic disorder resulting from genetic alterations in normal hematopoietic stem cells. The aim of this study was to evaluate prognostic factors and survival of AML patients in the Northeast of Iran. Materials and Methods: This retrospective study covered 96 patients with AML referred to Emam Reza Hospital, Mashhad city, Iran, from 2009 to 2015. Age, sex, blood group, type of AML, fever, consumption of amphotericin B, cytogenetic forms and survival were analyzed. Also, WBC, hemoglobin and platelet levels were checked. Mean follow-up was 30.5 months (60.4% mortality). Survival was plotted by GraphPad Prism 5 with Log-rank test. Results: The mean age for all AML patients at diagnosis was 40.4 years (range, 17-77 years). Some 42.7% patients were aged <35 years and 40.6% were male. In all patients, 76% had fever and 50% consumed amphotericin. T(15;17)(q22;q21) had the most prevalence (37.7%) compared to other forms. Out of 92 patients, O+(30.4%) was the most common blood group and AML-M5 (28.3%) the most common subtype. There was a significant difference in survival based on WBC and consumption of amphotericin B (P<0.05). Conclusions: WBC level, fever and consumption of amphotericin B proved to be factors for survival of AML patients. The mean age for patients in Iran is lower than other areas in the World and also survival in this study was higher than in other studies.

Processing large-scale data with Apache Spark (Apache Spark를 활용한 대용량 데이터의 처리)

  • Ko, Seyoon;Won, Joong-Ho
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.6
    • /
    • pp.1077-1094
    • /
    • 2016
  • Apache Spark is a fast and general-purpose cluster computing package. It provides a new abstraction named resilient distributed dataset, which is capable of support for fault tolerance while keeping data in memory. This type of abstraction results in a significant speedup compared to legacy large-scale data framework, MapReduce. In particular, Spark framework is suitable for iterative machine learning applications such as logistic regression and K-means clustering, and interactive data querying. Spark also supports high level libraries for various applications such as machine learning, streaming data processing, database querying and graph data mining thanks to its versatility. In this work, we introduce the concept and programming model of Spark as well as show some implementations of simple statistical computing applications. We also review the machine learning package MLlib, and the R language interface SparkR.

Evaluation of KRAS Gene Mutations in Metastatic Colorectal Cancer Patients in Kermanshah Province

  • Amirifard, Nasrin;Sadeghi, Edris;Farshchian, Negin;Haghparast, Abbas;Choubsaz, Mansour
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.17 no.7
    • /
    • pp.3085-3088
    • /
    • 2016
  • Background: Worldwide, colorectal cancer (CRC) is reported to be the fourth most common cancer in men and the third most common in women. KRAS is a proto-oncogene located on the short arm of chromosome 12. The aim of this study was to evaluate the KRAS oncogene and its relationship it with clinicopathologic features in 33 Kurdish patients. Materials and Methods: Metastatic CRC between 2012 and 2016 that came to Imam Reza hospital, Kermanshah province, Iran, were analysed for KRAS mutations using allele specific PCR primers and pyrosequencing. Correlations between variables was analyzed in PASW SPSS and overall survival curves were plotted in Graph Pad prism 5. Results: The mean age for them at diagnosis was $51.5{\pm}12.6$ years (range, 22-76 years). Among the 33 patients that were sequenced, 12 samples in the KRAS gene had a nucleotide change, 11 in codon 12 and 1 in codon 13.There was no significant relationship between the mutation and clinical and pathological aspects of the disease. Conclusions: Knowledge of the KRAS status can help in decision-making to treat metastatic colorectal cancer patients more efficiently and increase survival. However, many Kurdish people due to economic problems are not able to do this valuable genetic test. In addition, we need more careful research of KRAS oncogene at the molecular level in young populations with more patients.

A Form Clustering Algorithm for Web-based Application Reengineering (웹 응용 재구성을 위한 폼 클러스터링 알고리즘)

  • 최상수;박학수;이강수
    • The Journal of Society for e-Business Studies
    • /
    • v.8 no.2
    • /
    • pp.77-98
    • /
    • 2003
  • A web-based information system, that is a dominant type of information systems, suffers from the "web crisis" in development and maintenance of the system. To cope with the problem, a technology of software clustering to web-based application, which is one of web engineering, is strongly needed. In this paper, we propose a Form Clustering Algorithm along with an application example, which are used for internal-system reengineering to web-based information system. A Form Clustering Algorithm focuses on Page-model which is the feature of the web among the various web-based information system's structural model. Specially, we applying distance matrix to navigation model of graph form for easily analyzing, and web log analysis for identifying core function object that have a highly loading. Also, we create web software structure that can be used to maximize reusability and assign hardware effectively through 2-phase clustering step. Form Clustering Algorithm might be used at web-based information system development and maintenance for reusable web component development and hardware assignment, respectively.

  • PDF

A Web Services-based Client OLAP API and Its Application to Cube Browsing (웹 서비스 기반의 클라이언트 OLAP API와 큐브 브라우징에의 응용 사례)

  • Bae, Eun-Ju;Kim, Myung
    • The KIPS Transactions:PartD
    • /
    • v.10D no.1
    • /
    • pp.143-152
    • /
    • 2003
  • XML and Web Services draw a lot of attention as standard technologies for data exchange and integration among heterogeneous platforms XML/A, which supports such technologies, is a SOAP based XML APl that facilitates data exchange between a client application and a data analysis engine through the Internet. The fact that the XML format is used for data exchange makes XML/A to be platform-independent. However. client application developers have to go through a tedious Job of treating the same type of XML documents fur downloading data from the server. Also, an XML query language is needed for extracting data from the XML documents sent by the server. In this paper, we present a high level client OLAP API, called DXML, for the client application developers in the windows environment to easily use the OLAP services of XML/A. XMLMD consists of properties and methods needed for OLAP application development. XMLMD is to XML/A what ADOMD is to OLEDB for OLAP. We also present a web OLAP cube browser that is developed using XMLMD. The browser display's data in various formats such as XML, HTML, Excel, and graph.