• Title/Summary/Keyword: Search space

Search Result 1,433, Processing Time 0.03 seconds

Disease Classification using Random Subspace Method based on Gene Interaction Information and mRMR Filter (유전자 상호작용 정보와 mRMR 필터 기반의 Random Subspace Method를 이용한 질병 진단)

  • Choi, Sun-Wook;Lee, Chong-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.2
    • /
    • pp.192-197
    • /
    • 2012
  • With the advent of DNA microarray technologies, researches for disease diagnosis has been actively in progress. In typical experiments using microarray data, problems such as the large number of genes and the relatively small number of samples, the inherent measurement noise and the heterogeneity across different samples are the cause of the performance decrease. To overcome these problems, a new method using functional modules (e.g. signaling pathways) used as markers was proposed. They use the method using an activity of pathway summarizing values of a member gene's expression values. It showed better classification performance than the existing methods based on individual genes. The activity calculation, however, used in the method has some drawbacks such as a correlation between individual genes and each phenotype is ignored and characteristics of individual genes are removed. In this paper, we propose a method based on the ensemble classifier. It makes weak classifiers based on feature vectors using subsets of genes in selected pathways, and then infers the final classification result by combining the results of each weak classifier. In this process, we improved the performance by minimize the search space through a filtering process using gene-gene interaction information and the mRMR filter. We applied the proposed method to a classifying the lung cancer, it showed competitive classification performance compared to existing methods.

Re-ranking the Results from Two Image Retrieval System in Cooperative Manner (두 영상검색 시스템의 협력적 이용을 통한 재순위화)

  • Hwang, Joong-Won;Kim, Hyunwoo;Kim, Junmo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.1
    • /
    • pp.7-15
    • /
    • 2014
  • Image retrieval has become a huge part of computer vision and data mining. Although commercial image retrieval systems such as Google show great performances, the improvement on the performances are constantly on demand because of the rapid growth of data on web space. To satisfy the demand, many re-ranking methods, which enhance the performances by reordering retrieved results with independent algorithms, has been proposed. Conventional re-ranking algorithms are based on the assumption that visual patterns are not used on initial image retrieval stage. However, image search engines in present have begun to use the visual and the assumption is required to be reconsidered. Also, though it is possible to suspect that integration of multiple retrieval systems can improve the overall performance, the research on the topic has not been done sufficiently. In this paper, we made the condition that other manner than cooperation cannot improve the ranking result. We evaluate the algorithm on toy model and show that propose module can improve the retrieval results.

High Bit-Rates Quantization of the First-Order Markov Process Based on a Codebook-Constrained Sample-Adaptive Product Quantizers (부호책 제한을 가지는 표본 적응 프로덕트 양자기를 이용한 1차 마르코프 과정의 고 전송률 양자화)

  • Kim, Dong-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.1
    • /
    • pp.19-30
    • /
    • 2012
  • For digital data compression, the quantization is the main part of the lossy source coding. In order to improve the performance of quantization, the vector quantizer(VQ) can be employed. The encoding complexity, however, exponentially increases as the vector dimension or bit rate gets large. Much research has been conducted to alleviate such problems of VQ. Especially for high bit rates, a constrained VQ, which is called the sample-adaptive product quantizer(SAPQ), has been proposed for reducing the hugh encoding complexity of regular VQs. SAPQ has very similar structure as to the product VQ(PQ). However, the quantizer performance can be better than the PQ case. Further, the encoding complexity and the memory requirement for the codebooks are lower than the regular full-search VQ case. Among SAPQs, 1-SAPQ has a simple quantizer structure, where each product codebook is symmetric with respect to the diagonal line in the underlying vector space. It is known that 1-SAPQ shows a good performance for i.i.d. sources. In this paper, a study on designing 1-SAPQ for the first-order Markov process. For an efficient design of 1-SAPQ, an algorithm for the initial codebook is proposed, and through the numerical analysis it is shown that 1-SAPQ shows better quantizer distortion than the VQ case, of which encoding complexity is similar to that of 1-SAPQ, and shows distortions, which are close to that of the DPCM(differential pulse coded modulation) scheme with the Lloyd-Max quantizer.

Advanced Optimization of Reliability Based on Cost Factor and Deploying On-Line Safety Instrumented System Supporting Tool (비용 요소에 근거한 신뢰도 최적화 및 On-Line SIS 지원 도구 연구)

  • Lulu, Addis;Park, Myeongnam;Kim, Hyunseung;Shin, Dongil
    • Journal of the Korean Institute of Gas
    • /
    • v.21 no.2
    • /
    • pp.32-40
    • /
    • 2017
  • Safety Instrumented Systems (SIS) have wide application area. They are of vital importance at process plants to detect the onset of hazardous events, for instance, a release of some hazardous material, and for mitigating their consequences to humans, material assets, and the environment. The integrated safety systems, where electrical, electronic, and/or programmable electronic (E/E/PE) devices interact with mechanical, pneumatic, and hydraulic systems are governed by international safety standards like IEC 61508. IEC 61508 organises its requirements according to a Safety Life Cycle (SLC). Fulfilling these requirements following the SLC can be complex without the aid of SIS supporting tools. This paper presents simple SIS support tool which can greatly help the user to implement the design phase of the safety lifecycle. This tool is modelled in the form of Android application which can be integrated with a Web-based data reading and modifying system. This tool can reduce the computation time spent on the design phase of the SLC and reduce the possible errors which can arise in the process. In addition, this paper presents an optimization approach to SISs based on cost measures. The multi-objective genetic algorithm has been used for the optimization to search for the best combinations of solutions without enumeration of all the solution space.

SOM-Based $R^{*}-Tree$ for Similarity Retrieval (자기 조직화 맵 기반 유사 검색 시스템)

  • O, Chang-Yun;Im, Dong-Ju;O, Gun-Seok;Bae, Sang-Hyeon
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.507-512
    • /
    • 2001
  • Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.

  • PDF

Using Numerical Maps to Select Solar Panel Installation Sites no Expressway Slopes (수치지도를 이용한 고속국도 주변 태양광 패널 설치 대상지 선정)

  • Jung, Jaehoon;Kim, Byungil
    • Korean Journal of Construction Engineering and Management
    • /
    • v.17 no.5
    • /
    • pp.71-77
    • /
    • 2016
  • Solar energy is a viable source to replace fossil fuels. However, challenges associated with site selection for solar panel installation inhibit the uptake of solar energy systems. Expressway slopes offer a potentially attractive alternative for solar panel installation for the following reasons: expressway slopes are vacant public sites, they are abundant (about 4,193km in South Korea), and they are linear in nature. Traditoinally when selecting sites for solar systems conventional surveying methods are employed. Unfortunately, these methods can be dangerous, time consuming, and labor intensive. To overcome these limitations of conventional site selection methodologies, we propose an automated approach using numerical maps. First, contour and expressway polylines are extracted separately from numeric maps. The extracted contour lines are then converted into a digital terrain model; this is used to calculate aspect and slope information. Next, the extracted expressway lines are projected onto a binary image and refined to recover the disconnections, and then applied to create a buffer zone to narrow the search space. Finally, all data sets are overlaid to identify candidate sites for solar panel systems and are visually verified through comparisons with aerial photos.

LATEST RESULTS OF THE MAXI MISSION

  • MIHARA, TATEHIRO
    • Publications of The Korean Astronomical Society
    • /
    • v.30 no.2
    • /
    • pp.559-563
    • /
    • 2015
  • Monitor of All-sky X-ray Image (MAXI) is a Japanese X-ray all-sky surveyer mounted on the International Space Station (ISS). It has been scanning the whole sky since 2009 during every 92-minute ISS rotation. X-ray transients are quickly found by the real-time nova-search program. As a result, MAXI has issued 133 Astronomer's Telegrams and 44 Gamma-ray burst Coordinated Networks so far. MAXI has discovered six new black holes (BH) in 4.5 years. Long-term behaviors of the MAXI BHs can be classified into two types by their outbursts; a fast-rise exponential-decay type and a fast-rise flat-top one. The slit camera is suitable for accumulating data over a long time. MAXI issued a 37-month catalog containing 500 sources above a ~0.6 mCrab detection limit at 4-10 keV in the region ${\mid}{b}{\mid}$ > $10^{\circ}$. The SSC instrument utilizing an X-ray CCD has detected diffuse soft X-rays extending over a large solid angle, such as the Cygnus super bubble. MAXI/SSC has also detcted a Ne emission line from the rapid soft X-ray nova MAXI J0158-744. The overall shapes of outbursts in Be X-ray binaries (BeXRB) are precisely observed with MAXI/GSC. BeXRB have two kinds of outbursts, a normal outburst and a giant one. The peak dates of the subsequent giant outbursts of A0535+26 repeated with a different period than the orbital one. The Be stellar disk is considered to either have a precession motion or a distorted shape. The long-term behaviors of low-mass X-ray binaries (LMXB) containing weakly magnetized neutron stars are investigated. Transient LMXBs (Aql X-1 and 4U 1608-52) repeated outbursts every 200-1000 days, which is understood by the limit-cycle of hydrogen ionization states in the outer accretion disk. A third state (very dim state) in Aql X-1 and 4U 1608-52 was interpreted as the propeller effect in the unified picture of LMXB. Cir X-1 is a peculiar source in the sense that its long-term behavior is not like typical LMXBs. The luminosity sometimes decreases suddenly at periastron. It might be explained by the stripping of the outer accretion disk by a clumpy stellar wind. MAXI observed 64 large flares from 22 active stars (RS CVns, dMe stars, Argol types, young stellar objects) over 4 years. The total energies are $10^{34}-10^{36}$ erg $s^{-1}$. Since MAXI can measure the spectrum (temperature and emission measure), we can estimate the size of the plasma and the magnetic fields. The size sometimes exceeds the size of the star. The magnetic field is in the range of 10-100 gauss, which is a typical value for solar flares.

MISCLASSIFIED TYPE 1 AGNS IN THE LOCAL UNIVERSE

  • Woo, Jong-Hak;Kim, Ji-Gang;Park, Daeseong;Bae, Hyun-Jin;Kim, Jae-Hyuk;Lee, Seung-Eon;Kim, Sang Chul;Kwon, Hong-Jin
    • Journal of The Korean Astronomical Society
    • /
    • v.47 no.5
    • /
    • pp.167-178
    • /
    • 2014
  • We search for misclassified type 1 AGNs among type 2 AGNs identified with emission line flux ratios, and investigate the properties of the sample. Using 4 113 local type 2 AGNs at 0.02 < z < 0.05 selected from Sloan Digital Sky Survey Data Release 7, we detected a broad component of the $H{\alpha}$ line with a Full-Width at Half-Maximum (FWHM) ranging from 1 700 to $19090km\;s^{-1}$ for 142 objects, based on the spectral decomposition and visual inspection. The fraction of the misclassified type 1 AGNs among type 2 AGN sample is ~3.5%, implying that a large number of missing type 1 AGN population may exist. The misclassified type 1 AGNs have relatively low luminosity with a mean broad $H{\alpha}$ luminosity, log $L_{H\alpha}=40.50{\pm}0.35\;erg\;s^{-1}$, while black hole mass of the sample is comparable to that of the local black hole population, with a mean black hole mass, log $M_{BH}=6.94{\pm}0.51\;M_{\odot}$. The mean Eddington ratio of the sample is log $L_{bol}/L_{Edd}=-2.00{\pm}0.40$, indicating that black hole activity is relatively weak, hence, AGN continuum is too weak to change the host galaxy color. We find that the O III lines show significant velocity offsets, presumably due to outflows in the narrow-line region, while the velocity offset of the narrow component of the $H{\alpha}$ line is not prominent, consistent with the ionized gas kinematics of general type 1 AGN population.

The Negotiation Model of Negotiation Agents for m-Commerce (모바일 전자상거래를 위한 협상 에이전트의 협상모델)

  • 정진국;이순근;조근식
    • Journal of Intelligence and Information Systems
    • /
    • v.9 no.3
    • /
    • pp.155-175
    • /
    • 2003
  • In context of e-commerce, negotiation is a procedure to help negotiate between buyer and seller by adjusting their negotiation issues such as price and in terms of payment. We used intelligent agent and mobile device to promote new framework of e-commerce. Moreover, this framework can help buyers and sellers to carry their commercial transactions effectively. In regard to that issue, we need to carry out the research of negotiation agent that can be used in e-commerce fields. In this paper, we modeled the negotiation using CSP for the performance of agent in m-commerce environment. Furthermore we implemented interface for mobile device to extract buyer's requirement and preference easily Besides that we used utility function to make a decision for various evaluation functions and suggestions that are used for evaluation of negotiation issues. A difficulty of generating offer is dependent on the number of negotiation issues and the range of the values. Therefore, if any offer has a number of negotiation issues and the range of values are wide, the search space will be exponentially expanded. There have been many studies fur solving this problem, we applied those techniques to improve the agent's ability of negotiation. For example, a contract can be accomplished by exchanging seller and buyer's offer that is generated by agent to adjust the requisite profit for each party. Finally, we show the improvement of satisfaction as the negotiation is processed.

  • PDF

A Secure Mobile Message Authentication Over VANET (VANET 상에서의 이동성을 고려한 안전한 메시지 인증기법)

  • Seo, Hwa-Jeong;Kim, Ho-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.5
    • /
    • pp.1087-1096
    • /
    • 2011
  • Vehicular Ad Hoc Network(VANET) using wireless network is offering the communications between vehicle and vehicle(V2V) or vehicle and infrastructure(V2I). VANET is being actively researched from industry field and university because of the rapid developments of the industry and vehicular automation. Information, collected from VANET, of velocity, acceleration, condition of road and environments provides various services related with safe drive to the drivers, so security over network is the inevitable factor. For the secure message authentication, a number of authentication proposals have been proposed. Among of them, a scheme, proposed by Jung, applying database search algorithm, Bloom filter, to RAISE scheme, is efficient authentication algorithm in a dense space. However, k-anonymity used for obtaining the accurate vehicular identification in the paper has a weak point. Whenever requesting the righteous identification, all hash value of messages are calculated. For this reason, as the number of car increases, a amount of hash operation increases exponentially. Moreover the paper does not provide a complete key exchange algorithm while the hand-over operation. In this paper, we use a Received Signal Strength Indicator(RSSI) based velocity and distance estimation algorithm to localize the identification and provide the secure and efficient algorithm in which the problem of hand-over algorithm is corrected.