• Title/Summary/Keyword: MAPS

Search Result 4,915, Processing Time 0.03 seconds

Pathway Retrieval for Transcriptome Analysis using Fuzzy Filtering Technique andWeb Service

  • Lee, Kyung-Mi;Lee, Keon-Myung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.2
    • /
    • pp.167-172
    • /
    • 2012
  • In biology the advent of the high-throughput technology for sequencing, probing, or screening has produced huge volume of data which could not be manually handled. Biologists have resorted to software tools in order to effectively handle them. This paper introduces a bioinformatics tool to help biologists find potentially interesting pathway maps from a transcriptome data set in which the expression levels of genes are described for both case and control samples. The tool accepts a transcriptome data set, and then selects and categorizes some of genes into four classes using a fuzzy filtering technique where classes are defined by membership functions. It collects and edits the pathway maps related to those selected genes without analyst' intervention. It invokes a sequence of web service functions from KEGG, which an online pathway database system, in order to retrieve related information, locate pathway maps, and manipulate them. It maintains all retrieved pathway maps in a local database and presents them to the analysts with graphical user interface. The tool has been successfully used in identifying target genes for further analysis in transcriptome study of human cytomegalovirous. The tool is very helpful in that it can considerably save analysts' time and efforts by collecting and presenting the pathway maps that contain some interesting genes, once a transcriptome data set is just given.

Topic maps Matching and Merging Techniques based on Partitioning of Topics (토픽 분할에 의한 토픽맵 매칭 및 통합 기법)

  • Kim, Jung-Min;Chung, Hyun-Sook
    • The KIPS Transactions:PartD
    • /
    • v.14D no.7
    • /
    • pp.819-828
    • /
    • 2007
  • In this paper, we propose a topic maps matching and merging approach based on the syntactic or semantic characteristics and constraints of the topic maps. Previous schema matching approaches have been developed to enhance effectiveness and generality of matching techniques. However they are inefficient because the approaches should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. Now, standard languages for developing ontologies are RDF/OWL and Topic Maps. In this paper, we propose an enhanced version of matching and merging technique based on topic partitioning, several matching operations and merging conflict detection.

Stage-GAN with Semantic Maps for Large-scale Image Super-resolution

  • Wei, Zhensong;Bai, Huihui;Zhao, Yao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.8
    • /
    • pp.3942-3961
    • /
    • 2019
  • Recently, the models of deep super-resolution networks can successfully learn the non-linear mapping from the low-resolution inputs to high-resolution outputs. However, for large scaling factors, this approach has difficulties in learning the relation of low-resolution to high-resolution images, which lead to the poor restoration. In this paper, we propose Stage Generative Adversarial Networks (Stage-GAN) with semantic maps for image super-resolution (SR) in large scaling factors. We decompose the task of image super-resolution into a novel semantic map based reconstruction and refinement process. In the initial stage, the semantic maps based on the given low-resolution images can be generated by Stage-0 GAN. In the next stage, the generated semantic maps from Stage-0 and corresponding low-resolution images can be used to yield high-resolution images by Stage-1 GAN. In order to remove the reconstruction artifacts and blurs for high-resolution images, Stage-2 GAN based post-processing module is proposed in the last stage, which can reconstruct high-resolution images with photo-realistic details. Extensive experiments and comparisons with other SR methods demonstrate that our proposed method can restore photo-realistic images with visual improvements. For scale factor ${\times}8$, our method performs favorably against other methods in terms of gradients similarity.

Optical Transmission Link with Dispersion Map of Antipodal Symmetry and OPC (원점 대칭 분산 맵과 OPC를 가진 광전송 링크)

  • Lee, Seong-Real
    • Journal of Advanced Navigation Technology
    • /
    • v.25 no.4
    • /
    • pp.286-292
    • /
    • 2021
  • Dispersion maps of antipodal symmetric type for improvement of compensation effect in dispersion managed link combined with optical phase conjugation, which can compensate for the distorted wavelength division multiplexed (WDM) signals due to chromatic dispersion and nonlinear Kerr effects of single-mode fiber, were proposed. It was confirmed that the proposed all of antipodal symmetric dispersion maps was more effective to compensate for the distorted WDM channels than the conventional link of uniform type dispersion map. Especially, dispersion maps formed like the inversion of alphabet S were more advantageous as the distorted WDM channels were compensated than dispersion maps formed like alphabet S. It was expected that the variety of optical network topology was more expanded by applying the proposed antipodal symmetric dispersion maps into transmission link.

ON LIFT OF HOMOTOPIC MAPS

  • Srivastava, Anjali;Khadke, Abha
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.16 no.1
    • /
    • pp.1-6
    • /
    • 2003
  • By considering a hyperspace CL(X) of a Hausdorffspace X with the Vietoris topology [6] also called the finite topology and treating X as a subspace of CL(X) with the natural embedding, it is obtained that homotopic maps f, g : $X{\rightarrow}Y$ are lifted to homotopic maps on the respective hyperspaces.

  • PDF

COMMON FIXED POINT THEOREMS FOR HYBRID MAPS IN NON-ARCHIMEDEAN FUZZY METRIC SPACES

  • Samanta, T.K.;Mohinta, Sumit
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.1_2
    • /
    • pp.155-164
    • /
    • 2013
  • In this paper, we have established some common fixed point theorems for two pairs of occasionally weakly compatible hybrid maps sat-isfying a strict contractive condition in a non-archimedean fuzzy metric space. Our result extend, generalized and fuzzify several fixed point theo-rems on metric space.

CONTINUITY OF THE ORBITAL AND LIMIT SET MAPS IN GENERAL DYNAMICAL SYSTEMS

  • Lee, Kyung-Bok;Park, Jong-Suh
    • Communications of the Korean Mathematical Society
    • /
    • v.26 no.4
    • /
    • pp.649-660
    • /
    • 2011
  • S. M. Saperstone and M. Nishihama [6] had showed both continuity and stability of the orbital and limit set maps, K(x) and L(x), where K and L are considered as maps from X to $2^X$. The main purpose of this paper is to extend continuity and stability for dynamical systems to general dynamical systems.

On Common Fixed Point for Single and Set-Valued Maps Satisfying OWC Property in IFMS using Implicit Relation

  • Park, Jong Seo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.15 no.2
    • /
    • pp.132-136
    • /
    • 2015
  • In this paper, we introduce the notion of single and set-valued maps satisfying OWC property in IFMS using implicit relation. Also, we obtain common fixed point theorems for single and set-valued maps satisfying OWC properties in IFMS using implicit relation.

ON SET-VALUED MAPS AND HYPERSPACES

  • Kim, Rae-Seon;Lee, Eui-Chul
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.2
    • /
    • pp.635-640
    • /
    • 2001
  • Let X be a T-admissible space and A(x) be the set of all admissible fibers at x∈X. In this paper, we introduce some basic concepts, properties, and known results about set-valued maps, hyperspaces and especially T-admissible spaces. And then, we construct a certain set-valued map(Theorem 2.3) and an arc from {x} to X∈A(x) in use of the set-valued maps(Theorem 2.3 through Theorem 2.7).