• Title/Summary/Keyword: optimal pairs

Search Result 153, Processing Time 0.025 seconds

Public Transport Network Connectivity using GIS-based Space Syntax (GIS 기반 Space Syntax를 이용한 대중교통 접근성)

  • Jun, Chul-Min
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.3
    • /
    • pp.25-33
    • /
    • 2007
  • The local governments of major cities in Korea are giving focus on public transportation to reduce congestion and improve accessibility in city areas. In this regards, the proper measurement of accessibility is now a key policy requirement for reorganizing the public transport network. Public transport routing problems, however, are considered to be highly complicated since a multi-mode travel generates different combinations of accessibility. While most of the previous research efforts on measuring transport accessibility are found at zone-levels, an alternative approach at a finer scale such as bus links and stops is presented in this study. We proposes a method to compute the optimal route choice of origin-destination pairs and measure the accessibility of the chosen modes combination based on topological configuration. The genetic algorithm is used for the computation of the journey paths, whereas the space syntax theory is used for the accessibility. This study used node-link data in GIS instead of axial lines which are manually drawn in space syntax. The resulting accessibilities of bus stops are calibrated by O-D survey data and the proposed process is tested on a CBD of Seoul.

  • PDF

In situ Hybridization for the Detection and Localization of the Bitter Taste Receptor Tas2r108 in the Murine Submandibular Gland

  • Ki, Su-Young;Cho, Young-Kyung;Chung, Ki-Myung;Kim, Kyung-Nyun
    • International Journal of Oral Biology
    • /
    • v.41 no.2
    • /
    • pp.97-103
    • /
    • 2016
  • Mammals have 3 pairs of major salivary glands i.e., the parotid, submandibular, and sublingual glands. Saliva secretion of these glands is modulated by taste perception. Salivary glands are composed mainly of acinar and ductal cells. Primary saliva is secreted by acinar cells and modified during ductal flow. Recently, of the murine 35 bitter taste receptors, Tas2r108 was expressed at highest levels in the submandibular gland by qPCR. Further, Tas2r108-transfected cells respond to a range of bitter compounds, such as denatonium, quinine, colchicine, diphenidol, caffeine and dapson. The objective of the present study was to characterize the expression of Tas2r108 mRNA in acinar and/or ductal cells of the submandibular gland using in situ hybridization (ISH). Male 42-60 days old DBA2 mice were used in the study. Messenger RNAs were extracted from the submandibular gland for generating digoxigenin (DIG) labeled-cRNA probes. These probes were transcribed in anti-sense and sense orientation using T7 RNA polymerase. Dot blot hybridization was performed using DIG labeled-cRNA probes, in order to estimate integrity and optimal diluting concentration of these probes. Subsequently, ISH was performed on murine submandibular gland to detect Tas2r108 mRNA. Dot blot hybridization data demonstrated that Tas2r108 DIG labeled-cRNA anti-sense probes specifically detected Tas2r108 cDNA. ISH results showed that the anti-sense probes labeled acinar and ductal cells in the submandibular gland, whereas no staining was visible in sense controls. Interestingly, the Tas2r108 expression levels were higher in acinar than ductal cells. These results suggested that Tas2r108 might be more associated with primary saliva secretion than with ductal modification of saliva composition.

Characterization of n-type In3Sb1Te2 and p-type Ge2Sb2Te5 Thin Films for Thermoelectric Generators (박막 열전 발전 소자를 위한 In3Sb1Te2와 Ge2Sb2Te5 박막의 열전 특성에 관한 연구)

  • Kang, So-Hyeon;Seo, Hye-Ji;Yoon, Soon-Gil
    • Korean Journal of Materials Research
    • /
    • v.27 no.2
    • /
    • pp.89-93
    • /
    • 2017
  • A thin film thermoelectric generator that consisted of 5 p/n pairs was fabricated with $1{\mu}m$-thick n-type $In_3Sb_1Te_2$ and p-type $Ge_2Sb_2Te_5$ deposited via radio frequency magnetron sputtering. First, $1{\mu}m$-thick GST and IST thin films were deposited at $250^{\circ}C$ and room temperature, respectively, via radio-frequency sputtering; these films were annealed from 250 to $450^{\circ}C$ via rapid thermal annealing. The optimal power factor was found at an annealing temperature of $400^{\circ}C$ for 10 min. To demonstrate thermoelectric generation, we measured the output voltage and estimated the maximum power of the n-IST/p-GST generator by imposing a temperature difference between the hot and cold junctions. The maximum output voltage and the estimated maximum power of the $1{\mu}m$-thick n-IST/p-GST TE generators are approximately 17.1 mV and 5.1 nW at ${\Delta}T=12K$, respectively.

Multi GPU Based Image Registration for Cerebrovascular Extraction and Interactive Visualization (뇌혈관 추출과 대화형 가시화를 위한 다중 GPU기반 영상정합)

  • Park, Seong-Jin;Shin, Yeong-Gil
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.6
    • /
    • pp.445-449
    • /
    • 2009
  • In this paper, we propose a computationally efficient multi GPU accelerated image registration technique to correct the motion difference between the pre-contrast CT image and post-contrast CTA image. Our method consists of two steps: multi GPU based image registration and a cerebrovascular visualization. At first, it computes a similarity measure considering the parallelism between both GPUs as well as the parallelism inside GPU for performing the voxel-based registration. Then, it subtracts a CT image transformed by optimal transformation matrix from CTA image, and visualizes the subtracted volume using GPU based volume rendering technique. In this paper, we compare our proposed method with existing methods using 5 pairs of pre-contrast brain CT image and post-contrast brain CTA image in order to prove the superiority of our method in regard to visual quality and computational time. Experimental results show that our method well visualizes a brain vessel, so it well diagnose a vessel disease. Our multi GPU based approach is 11.6 times faster than CPU based approach and 1.4 times faster than single GPU based approach for total processing.

Gene Cloning, Expression, and Characterization of a Novel ${\beta}$-Mannanase from Bacillus circulans CGMCC 1416

  • Li, Yanan;Yang, Peilong;Meng, Kun;Wang, Yaru;Luo, Huiying;Wu, Ningfeng;Fan, Yuliu;Yao, Bin
    • Journal of Microbiology and Biotechnology
    • /
    • v.18 no.1
    • /
    • pp.160-166
    • /
    • 2008
  • A DNA fragment containing 2,079 base pairs from Bacillus circulans CGMCC 1416 was cloned using degenerate PCR and inverse PCR. An open reading frame containing 981 bp was identified that encoding 326 amino acids residues, including a putative signal peptide of 31 residues. The deduced amino acid sequence showed the highest identity (68.1%) with $endo-{\beta}-1,4-D-mannanase$ from Bacillus circulans strain K-1 of the glycoside hydrolase family 5 (GH5). The sequence encoding the mature protein was cloned into the pET-22b(+) vector and expressed in Escherichia coli as a recombinant fusion protein containing an N-terminal hexahistidine sequence. The fusion protein was purified by $Ni^{2+}$ affinity chromatography and its hexahistidine tag cleaved to yield a 31-kDa ${\beta}$-mannanase having a specific activity of 481.55U/mg. The optimal activity of the purified protein, MANB48, was at $58^{\circ}C$ and pH 7.6. The hydrolysis product on substrate locust bean gum included a monosaccharide and mainly oligosaccharides. The recombinant MANB48 may be of potential use in the feed industry.

Rapid Detection of Lily mottle virus and Arabis mosaic virus Infecting Lily (Lilium spp.) Using Reverse Transcription Loop-Mediated Isothermal Amplification

  • Zhang, Yubao;Wang, Yajun;Xie, Zhongkui;Wang, Ruoyu;Guo, Zhihong;He, Yuhui
    • The Plant Pathology Journal
    • /
    • v.36 no.2
    • /
    • pp.170-178
    • /
    • 2020
  • The Lily mottle virus (LMoV) impedes the growth and quality of lily crops in Lanzhou, China. Recently Arabis mosaic virus (ArMV) has been detected in LMoV-infected plants in this region, causing plant stunting as well as severe foliar symptoms, and likely posing a threat to lily production. Consequently, there is a need to develop simple, sensitive, and reliable detection methods for these two viruses to prevent them from spreading. Reverse transcription (RT) loop-mediated isothermal amplification (LAMP) assays have been developed to detect LMoV and ArMV using two primer pairs that match six conserved sequences of LMoV and ArMV coat proteins, respectively. RT-LAMP assay results were visually assessed in reaction tubes using green fluorescence and gel electrophoresis. Our assays successfully detected both LMoV and ArMV in lily plants without the occurrence of viral cross-reactivity from other lily viruses. Optimal conditions for LAMP reactions were 65℃ and 60℃ for 60 min for LMoV and ArMV, respectively. Detection sensitivity for both RT-LAMP assays was a hundredfold greater than that of our comparative RT-polymerase chain reaction assays. We have also found this relatively rapid, target specific and sensitive method can also be used for samples collected in the field and may be especially useful in regions with limited or no laboratory facilities.

A Border Line-Based Pruning Scheme for Shortest Path Computations

  • Park, Jin-Kyu;Moon, Dae-Jin;Hwang, Een-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.939-955
    • /
    • 2010
  • With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, $A^*$ algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.

Optimization of Resource Allocation for Inter-Channel Load Balancing with Frequency Reuse in ASO-TDMA-Based VHF-Band Multi-Hop Data Communication System (ASO-TDMA기반 다중-홉 VHF 대역 데이터 통신 시스템의 주파수 재사용을 고려한 채널간 부하 균형을 위한 자원 할당 최적화)

  • Cho, Kumin;Lee, Junman;Yun, Changho;Lim, Yong-Kon;Kang, Chung G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1457-1467
    • /
    • 2015
  • Depending on the type of Tx-Rx pairs, VHF Data Exchange System (VDES) for maritime communication is expected to employ the different frequency channels. Load imbalance between the different channels turns out to be a critical problem for the multi-hop communication using Ad-hoc Self-Organizing TDMA (ASO-TDMA) MAC protocol, which has been proposed to provide the connectivity between land station and remote ship stations. In order to handle the inter-channel load imbalance problem, we consider a model of the stochastic geomety in this paper. After analyzing the spatial reuse efficiency in each hop region by the given model, we show that the resource utility can be maximized by balancing the inter-channel traffic load with optimal resource allocation in each hop region.

Development and Evaluation of a Portfolio Selection Model and Investment Algorithm in Foreign Exchange Market (외환 시장 포트폴리오 선정 모형과 투자 알고리즘 개발 및 성과평가)

  • Choi, Jaeho;Jung, Jongbin;Kim, Seongmoon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.39 no.2
    • /
    • pp.83-95
    • /
    • 2014
  • In this paper, we develop a portfolio selection model that can be used to invest in markets with margin requirements such as the foreign exchange market. An investment algorithm to implement the proposed portfolio selection model based on objective historical data is also presented. We further conduct empirical analysis on the performance of a hypothetical investment in the foreign exchange market, using the proposed portfolio selection model and investment algorithm. Using 7 currency pairs that recorded the highest trading volume in the foreign exchange market during the most recent 10 years, we compare the performance of 1) the Dollar Index, 2) a 1/N Portfolio which equally allocates capital to all N assets considered for investment, and 3) a hypothetical investment portfolio selected and managed according to the portfolio selection model and investment algorithm proposed in this paper. Performance is compared in terms of accumulated returns and Sharpe ratios for the 10-year period from January 2003 to December 2012. The results show that the hypothetical investment portfolio outperforms both benchmarks, with superior performance especially during the period following financial crisis. Overall, this paper suggests that a mathematical approach for selecting and managing an optimal investment portfolio based on objective data can achieve outstanding performance in the foreign exchange market.

Optimal Utilization of a Cognitive Shared Channel with a Rechargeable Primary Source Node

  • Pappas, Nikolaos;Jeon, Jeong-Ho;Ephremides, Anthony;Traganitis, Apostolos
    • Journal of Communications and Networks
    • /
    • v.14 no.2
    • /
    • pp.162-168
    • /
    • 2012
  • This paper considers the scenario in which a set of nodes share a common channel. Some nodes have a rechargeable battery and the others are plugged to a reliable power supply and, thus, have no energy limitations. We consider two source-destination pairs and apply the concept of cognitive radio communication in sharing the common channel. Specifically, we give high-priority to the energy-constrained source-destination pair, i.e., primary pair, and low-priority to the pair which is free from such constraint, i.e., secondary pair. In contrast to the traditional notion of cognitive radio, in which the secondary transmitter is required to relinquish the channel as soon as the primary is detected, the secondary transmitter not only utilizes the idle slots of primary pair but also transmits along with the primary transmitter with probability p. This is possible because we consider the general multi-packet reception model. Given the requirement on the primary pair's throughput, the probability p is chosen to maximize the secondary pair's throughput. To this end, we obtain two-dimensional maximum stable throughput region which describes the theoretical limit on rates that we can push into the network while maintaining the queues in the network to be stable. The result is obtained for both cases in which the capacity of the battery at the primary node is infinite and also finite.