• Title/Summary/Keyword: min-sum

Search Result 487, Processing Time 0.024 seconds

An XPS Study of Oxyfluorinated Multiwalled Carbon Nano Tubes

  • Yun, Seok-Min;Kim, Ju-Wan;Jung, Min-Jung;Nho, Young-Chang;Kang, Phil-Hyun;Lee, Young-Seak
    • Carbon letters
    • /
    • v.8 no.4
    • /
    • pp.292-298
    • /
    • 2007
  • In order to investigate functional groups on the surface of Multi-walled Carbon Nanotubes (MWCNTs) induced by oxyfluorination, XPS (X-ray photoelectron spectroscopy) analysis was carried out. All core level spectra of MWCNTs were deconvoluted to several Pseudo-Voigt functions (sum of Gaussian-Lorentzian functions). Both O1s and F1s binding energy of oxyfluorinated MWCNTs shifted high value as increment of fluorine mixing ratio. The carbon-fluorine covalent bonding concentration increased as increment of fluorine mixing ratio. The shape and intensity of OF10-MWCNTs are similar with those of as-received MWCNTs. However, the intensity and binding energies of main peak position of OF20-MWCNTs and OF30-MWCNTs were dramatically increased by oxyfluorination.

Joint Performance of Demodulation and Decoding with Regard to Log-Likelihood Ratio Approximation (대수우도비 근사화에 따른 복조와 복호의 결합 성능)

  • Park, Sung-Joon;Jo, Myung-Suk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.12
    • /
    • pp.1736-1738
    • /
    • 2016
  • In modern digital communication systems adapting high-order modulation and high performance channel code, log-likelihood ratios involving the repeated calculations of the logarithm of sum of exponential functions are necessary for demodulation and decoding. In this paper, the approximation methods called Min and MinC are applied to demodulation and decoding together and their complexity and joint performance are analyzed.

A Heuristic Polynomial Time Algorithm for Crew Scheduling Problem

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.11
    • /
    • pp.69-75
    • /
    • 2015
  • This paper suggests heuristic polynomial time algorithm for crew scheduling problem that is a kind of optimization problems. This problem has been solved by linear programming, set cover problem, set partition problem, column generation, etc. But the optimal solution has not been obtained by these methods. This paper sorts transit costs $c_{ij}$ to ascending order, and the task i and j crew paths are merged in case of the sum of operation time ${\Sigma}o$ is less than day working time T. As a result, we can be obtain the minimum number of crews $_{min}K$ and minimum transit cost $z=_{min}c_{ij}$. For the transit cost of specific number of crews $K(K>_{min}K)$, we delete the maximum $c_{ij}$ as much as the number of $K-_{min}K$, and to partition a crew path. For the 5 benchmark data, this algorithm can be gets less transit cost than state-of-the-art algorithms, and gets the minimum number of crews.

A Study on Multi-modal Near-IR Face and Iris Recognition on Mobile Phones (휴대폰 환경에서의 근적외선 얼굴 및 홍채 다중 인식 연구)

  • Park, Kang-Ryoung;Han, Song-Yi;Kang, Byung-Jun;Park, So-Young
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.2
    • /
    • pp.1-9
    • /
    • 2008
  • As the security requirements of mobile phones have been increasing, there have been extensive researches using one biometric feature (e.g., an iris, a fingerprint, or a face image) for authentication. Due to the limitation of uni-modal biometrics, we propose a method that combines face and iris images in order to improve accuracy in mobile environments. This paper presents four advantages and contributions over previous research. First, in order to capture both face and iris image at fast speed and simultaneously, we use a built-in conventional mega pixel camera in mobile phone, which is revised to capture the NIR (Near-InfraRed) face and iris image. Second, in order to increase the authentication accuracy of face and iris, we propose a score level fusion method based on SVM (Support Vector Machine). Third, to reduce the classification complexities of SVM and intra-variation of face and iris data, we normalize the input face and iris data, respectively. For face, a NIR illuminator and NIR passing filter on camera are used to reduce the illumination variance caused by environmental visible lighting and the consequent saturated region in face by the NIR illuminator is normalized by low processing logarithmic algorithm considering mobile phone. For iris, image transform into polar coordinate and iris code shifting are used for obtaining robust identification accuracy irrespective of image capturing condition. Fourth, to increase the processing speed on mobile phone, we use integer based face and iris authentication algorithms. Experimental results were tested with face and iris images by mega-pixel camera of mobile phone. It showed that the authentication accuracy using SVM was better than those of uni-modal (face or iris), SUM, MAX, NIN and weighted SUM rules.

Joint Base Station and Relay Precoder Design with Relay Local Channel State Information for Multi-relay Aided Multi-user All-MIMO System (다중 릴레이, 다중 사용자 All-MIMO 시스템에서 릴레이 지역 채널 정보를 사용한 기지국 및 릴레이 전처리기 공동 설계 기법)

  • Cho, Young-Min;Jang, Seung-Jun;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6A
    • /
    • pp.405-419
    • /
    • 2012
  • In this paper, we propose a joint base station(BS) and relay precoders design in multi-relay aided multi-user all-multiple-input multiple-output(MIMO) system. The design criterion is to minimize user sum mean square error(SMSE) with relay sum power constraint(RSPC) where only local channel state information(CSI)s are available at relays. Local CSI at a relay is defined as the CSI of the channel which the relay itself accesses, out of among all the 1st hop and the 2nd hop channel in the system. With BS precoder structure which is concatenated with block diagonalization(BD) precoder, each relay can determine its own precoder using only local CSI. Proposed scheme is based on sequential iteration of two stages; stage 1 determines BS precoder and relay precoders jointly with SMSE duality, and stage 2 determines user receivers. Proposed scheme can be demonstrated theoretically to be always converge. We verify that proposed scheme outperforms simple amplify-and-forward(SAF), MMSE relay, and proposed schemes in [1] in terms of both SMSE and sum-rate performances.

MAX-MIN Flow Control Supporting Dynamic Bandwidth Request of Sessions (세션의 동적 대역폭 요구를 지원하는 최대-최소 흐름제어)

  • Cho, Hyug-Rae;Chong, Song;Jang, Ju-Wook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.8
    • /
    • pp.638-651
    • /
    • 2000
  • When the bandwidth resources in a packet-switched network are shared among sessions by MAX-MIN flow control each session is required to transmit its data into the network subject to the MAX-MIN fair rate which is solely determined by network loadings. This passive behavior of sessions if fact can cause seri-ous QoS(Quality of Service) degradation particularly for real-time multimedia sessions such as video since the rate allocated by the network can mismatch with what is demanded by each session for its QoS. In order to alleviate this problem we extend the concept of MAX-MIN fair bandwidth allocations as follows: Individual bandwidth demands are guaranteed if the network can accommodate them and only the residual network band-width is shared in the MAX-MIN fair sense. On the other hand if sum of the individual bandwidth demands exceeds the network capacity the shortage of the bandwidth is shared by all the sessions by reducing each bandwidth guarantee by the MAX-MIN fair division of the shortage. we present a novel flow control algorithm to achieve this extended MAX-MIN fairness and show that this algorithm can be implemented by the existing ATM ABR service protocol with minor changes. We not only analyze the steady state asymptotic stability and convergence rate of the algorithm by appealing to control theories but also verify its practical performance through simulations in a variety of network scenarios.

  • PDF

Design of Dynamic Time Warp Element for Speech Recognition (음성인식을 위한 Dynamic Time Warp 소자의 설계)

  • 최규훈;김종민
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.3
    • /
    • pp.543-552
    • /
    • 1994
  • Dynamic Time Warp(DTW) needs for iterative calculations and the design of PE cell suitable for the operations is very important. Accordingly, this paper aims at real time recognition design enables large dictionary hardware realization using DTW algorithm. The DTW PE cell separated into three large blocks. "MIN" is the one block for counting accumulated minimum distance. "ADD" block calculates these minimum distances, and "ABS" seeks for the absolute values to the total sum of local distances. Circuit design and verification about the three block have been accomplished, and performed layout '||'&'||' DRC(design rule check) using 1.2 m CMOS N-Well rule base.CMOS N-Well rule base.

  • PDF

Design and Implementation of Efficient Mitigation against Return-oriented Programming (반환 지향 프로그래밍 공격에 대한 효율적인 방어 기법 설계 및 구현)

  • Kim, Jeehong;Kim, Inhyeok;Min, Changwoo;Eom, Young Ik
    • Journal of KIISE
    • /
    • v.41 no.12
    • /
    • pp.1018-1025
    • /
    • 2014
  • An ROP attack creates gadget sequences which consist of existing code snippets in a program, and hijacks the control flow of a program by chaining and executing gadget sequences consecutively. Existing defense schemes have limitations in that they cause high execution overhead, an increase in the binary size overhead, and a low applicability. In this paper, we solve these problems by introducing zero-sum defender, which is a fast and space-efficient mitigation scheme against ROP attacks. We find a fundamental property of gadget execution in which control flow starts in the middle of a function without a call instruction and ends with a return instruction. So, we exploit this property by monitoring whether the execution is abused by ROP attacks. We achieve a very low runtime overhead with a very small increase in the binary size. In our experimental results, we verified that our defense scheme prevents real world ROP attacks, and we showed that there is only a 2% performance overhead and a 1% binary size increase overhead in several benchmarks.

Quality of Life in Patients with Skin Disease (한국어판 Skindex-29를 통해 본 피부과 환자의 삶의 질)

  • Kim Min-Hi;Kim Ja-Hye;Yoon Hwa-Jung;Ko Woo-Shin
    • The Journal of Korean Medicine
    • /
    • v.26 no.3 s.63
    • /
    • pp.43-54
    • /
    • 2005
  • Backgrounds : Many people think that ski disease has littel influence on the quality of life in patient, but various studios show that skin disease may produce a range of impacts on QOL. Nevertheless, there is much to be learned about the association between the duality of life and skin disease in the area of Oriental dermatology. Objectives : This study was conducted fe investigate the impact of the various skin diseases on QOL and explore prognostic factors that influence outcomes. Methods : 103 patients were recruited who filled out more than $90\%$ of the skindex-29 questionnaire. The function of sum scores and three domain scores with each skin disease were investigated, as well as the correlation of each domain scores. Results : The disease with the lowest qualify of life was atopic dermatitis. followed by eczematous dermatitis, seborrheic dermatitis and acne vulgaris in order. The sum scales showed significant correlation with three domain scores in atopic dermatitis, urticaria, allergodermia, acne vulgaris, psoriasis and seborrheic dermatitis, The correlation of all three domain scores was significant in atopic dermatitis, urticaria, allergodermia, and psoriasis. Conclusions : Tn this study, skin disease affects the quality of life in physical, social, and psychological factors- Thus, we must consider the quality of life as well as clinical severity inpatients with skin disease.

  • PDF

Typical Consideration On The Basic Model of Decision Making (의사결정의 기본 MODEL에 관한 유형적 고찰)

  • 김면성
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.6 no.9
    • /
    • pp.111-124
    • /
    • 1983
  • The basic model of decision problem the enterprise is conforonted with includes the following 3 elements ; 1) Elements that can not be controlled by the decision maker : In the thesis elements are named environmental variables, and varied itself according to the change of environmental condition. 2) Elements that can be controlled by the decision maker ; These elements are called decision elements in the thesis and variable according to the event. 3) object of decision making : The degree of achievement to the object is identified by taking various criteria- The index indicating the degree of achievement to the object whatever criterion is applied is called object function in the thesis. It's the fanetion of environmental variable, decision variable and object function. The relation between them brings forth the relation formula that characterize the each problem. The basic types of decision making model use in the thesis are as following ; 1) The problem of decision making under conditions of certainty. 2) The problem of decision making under conditions of risk. 3) The problem of decision making under conditions of uncertainty. 4) The problem of decision making under competitive condition. in general case that the Profit of two decision makers varies, what we regard the decision that make the sum of profit of two men maximum as the best choice for two men has a reasonability in certain case. When the sum of profit two men is zero, by taking toe promise that ail of them art according to the min-max criteria and by extending the object of choice to the mixed strategy. We certify the existance of equilibrium solution and admit them as the best solution of competitive model in general.

  • PDF