• Title/Summary/Keyword: Hidden cut

Search Result 11, Processing Time 0.028 seconds

Detection Method of Vehicle Fuel-cut Driving with Deep-learning Technique (딥러닝 기법을 이용한 차량 연료차단 주행의 감지법)

  • Ko, Kwang-Ho
    • Journal of the Korea Convergence Society
    • /
    • v.10 no.11
    • /
    • pp.327-333
    • /
    • 2019
  • The Fuel-cut driving is started when the acceleration pedal released with transmission gear engaged. Fuel economy of the vehicle improves by active fuel-cut driving. A deep-learning technique is proposed to predict fuel-cut driving with vehicle speed, acceleration and road gradient data in the study. It's 3~10 of hidden layers and 10~20 of variables and is applied to the 9600 data obtained in the test driving of a vehicle in the road of 12km. Its accuracy is about 84.5% with 10 variables, 7 hidden layers and Relu as activation function. Its error is regarded from the fact that the change rate of input data is higher than the rate of fuel consumption data. Therefore the accuracy can be better by the normalizing process of input data. It's unnecessary to get the signal of vehicle injector or OBD, and a deep-learning technique applied to the data to be got easily, like GPS. It can contribute to eco-drive for the computing time small.

Learning Ability of Deterministic Boltzmann Machine with Non-Monotonic Neurons in Hidden Layer (은닉층에 비단조 뉴런을 갖는 결정론적 볼츠만 머신의 학습능력에 관한 연구)

  • 박철영
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.6
    • /
    • pp.505-509
    • /
    • 2001
  • In this paper, we evaluate the learning ability of non-monotonic DMM(Deterministic Boltzmann Machine) network through numerical simulations. The simulation results show that the proposed system has higher performance than monotonic DBM network model. Non-monotonic DBM network also show an interesting result that network itself adjusts the number of hidden layer neurons. DBM network can be realized with fewer components than other neural network models. These results enhance the utilization of non-monotonic neurons in the large scale integration of neuro-chips.

  • PDF

The Results of Drilling in Weondong Mine Area, the Taebaegsan Mineralized District, Republic of Korea (강원도 태백산지역 원동광산 시추탐사연구)

  • Lee, Jae-Ho
    • Economic and Environmental Geology
    • /
    • v.44 no.4
    • /
    • pp.313-320
    • /
    • 2011
  • The Taebaegsan Mineralized District is the most prospective region for the useful mineral commodities such as a coal, non-metallic, metallic mineral in South Korea. From a general point of view, Cambro- Ordovician limestone formations, Myobong slate and Pungchon (Daegi) limestone, are the most fertilizable formations in the Taebaegsan Mineralized District. The geology around Weondong mine area consists mainly of Carboniferous-Triassic formations and Cambro-Ordovician formations intruded by rhyolite/quartz porphyry. The great overthrusted fault of N40~$50^{\circ}E$ direction, so called Weondong overthrust fault, is observed in the central part of the mine area and the NS fault system cuts the overthrusted fault. By postulating from the favorable geological and structural condition around Weondong area, the possibility of deep seated hidden ore bodies is expected. In 2010, on the basis of the results of LOTEM and CSAMT survey, the cross-hole survey was performed for the investigation of the hidden polymetallic ore body in the deep parts of the Weondong mine area and the grade of the newly-discovered orebody is as follows; (1) The cut-off grade for lead-zinc 3%; an weighted average grade 5.50% (2.7 m), (2) The cutoff grade for copper 0.1%; an weighted average grade 0.91% (14.65 m), (3) The cut-off grade for iron 30%; an weighted average grade 38.18% (3.3 m), (4) $WO_3$ for each cut-off grade(0.01%, 0.05%, 0.1%); an weighted average grade 0.29 wt. % (8.8 m), 1.15 wt. % (2.1 m), 1.97 wt. % (1.2 m), (5) $MoS_2$ for each cut-off grade(0.01%, 0.1%); an weighted average grade 0.15 wt. % (6.3S m), 0.28 wt. % (3.15 m), (6) $Ta_2O_5$ for each cut-off grade (0.01%, 0.1%); an weighted average grade 0.13% (19.S m), 1.11% (1.8 m), (7) $Nb_2O_5$ for each cut-offgrade (0.01%, 0.1%); an weighted average grade 0.06% 11.5 m), 0.15% (3.0 m).

A Study on the Application of ANN for Surface Roughness Prediction in Side Milling AL6061-T4 by Endmill (AL6061-T4의 측면 엔드밀 가공에서 표면거칠기 예측을 위한 인공신경망 적용에 관한 연구)

  • Chun, Se-Ho
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.20 no.5
    • /
    • pp.55-60
    • /
    • 2021
  • We applied an artificial neural network (ANN) and evaluated surface roughness prediction in lateral milling using an endmill. The selected workpiece was AL6061-T4 to obtain data of surface roughness measurement based on the spindle speed, feed, and depth of cut. The Bayesian optimization algorithm was applied to the number of nodes and the learning rate of each hidden layer to optimize the neural network. Experimental results show that the neural network applied to optimize using the Expected Improvement(EI) algorithm showed the best performance. Additionally, the predicted values do not exactly match during the neural network evaluation; however, the predicted tendency does march. Moreover, it is found that the neural network can be used to predict the surface roughness in the milling of aluminum alloy.

Shot Boundary Detection of Video Sequence Using Hierarchical Hidden Markov Models (계층적 은닉 마코프 모델을 이용한 비디오 시퀀스의 셧 경계 검출)

  • Park, Jong-Hyun;Cho, Wan-Hyun;Park, Soon-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8A
    • /
    • pp.786-795
    • /
    • 2002
  • In this paper, we present a histogram and moment-based vidoe scencd change detection technique using hierarchical Hidden Markov Models(HMMs). The proposed method extracts histograms from a low-frequency subband and moments of edge components from high-frequency subbands of wavelet transformed images. Then each HMM is trained by using histogram difference and directional moment difference, respectively, extracted from manually labeled video. The video segmentation process consists of two steps. A histogram-based HMM is first used to segment the input video sequence into three categories: shot, cut, gradual scene changes. In the second stage, a moment-based HMM is used to further segment the gradual changes into a fade and a dissolve. The experimental results show that the proposed technique is more effective in partitioning video frames than the previous threshold-based methods.

Detection of Gradual Transitions in MPEG Compressed Video using Hidden Markov Model (은닉 마르코프 모델을 이용한 MPEG 압축 비디오에서의 점진적 변환의 검출)

  • Choi, Sung-Min;Kim, Dai-Jin;Bang, Sung-Yang
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.3
    • /
    • pp.379-386
    • /
    • 2004
  • Video segmentation is a fundamental task in video indexing and it includes two kinds of shot change detections such as the abrupt transition and the gradual transition. The abrupt shot boundaries are detected by computing the image-based distance between adjacent frames and comparing this distance with a pre-determined threshold value. However, the gradual shot boundaries are difficult to detect with this approach. To overcome this difficulty, we propose the method that detects gradual transition in the MPEG compressed video using the HMM (Hidden Markov Model). We take two different HMMs such as a discrete HMM and a continuous HMM with a Gaussian mixture model. As image features for HMM's observations, we use two distinct features such as the difference of histogram of DC images between two adjacent frames and the difference of each individual macroblock's deviations at the corresponding macroblock's between two adjacent frames, where deviation means an arithmetic difference of each macroblock's DC value from the mean of DC values in the given frame. Furthermore, we obtain the DC sequences of P and B frame by the first order approximation for a fast and effective computation. Experiment results show that we obtain the best detection and classification performance of gradual transitions when a continuous HMM with one Gaussian model is taken and two image features are used together.

Partial Eyebrow Reconstruction with Bilateral Advancement Flap and Tattooing (양측 전진피판과 문신을 이용한 부분 눈썹 결손의 치험례)

  • Yoon, Jung Ho;Hong, Jong Won;Kim, Young Seok;Roh, Tai Suk;Rah, Dong Kyun
    • Archives of Craniofacial Surgery
    • /
    • v.11 no.1
    • /
    • pp.37-40
    • /
    • 2010
  • Purpose: Reconstruction of eyebrow defects after wide excision of the benign and malignant tumors present a cosmetic challenge to the plastic surgeon. There were several methods for reconstruction of partial eyebrow defect with local flaps except hair bearing composite graft. We introduce simple eyebrow reconstruction with bilateral advancement flap and tattooing on the idea that eyebrow tattooing is popular permanent eyebrow makeup among elderly Korean women. Methods: The flaps were designed on both ends of the eyebrow defect along the upper and lower margin of the eyebrow. Both flaps were cut, undermined and were moved centrally to cover the defect. Both flaps were attached along the vertical suturing line. The rest of each flap was sown with dog-ears revised minimally. Scar lines would be hidden along the natural borders of the eyebrow if possible. The resulting vertical scar finally was covered with hair. After 8 months, eyebrow tattooing would be done to camouflage eyebrow shortening and scar. Results: Partial eyebrow defect was reconstructed successfully with bilateral advancement flap and tattooing. The postoperative scar was inconspicuous and eyebrow looked symmetric. Conclusion: We recommend partial eyebrow reconstruction with bilateral advancement flap and tattooing for the elderly Korean female patients after excision of small tumor in and around eyebrow region.

An Algorithm for reducing the search time of Frequent Items (빈발 항목의 탐색 시간을 단축하기 위한 알고리즘)

  • Yun, So-Young;Youn, Sung-Dae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.1
    • /
    • pp.147-156
    • /
    • 2011
  • With the increasing utility of the recent information system, the methods to pick up necessary products rapidly by using a lot of data has been studied. Association rule search methods to find hidden patterns has been drawing much attention, and the Apriori algorithm is a major method. However, the Apriori algorithm increases search time due to its repeated scans. This paper proposes an algorithm to reduce searching time of frequent items. The proposed algorithm creates matrix using transaction database and search for frequent items using the mean number of items of transactions at matrix and a defined minimum support. The mean number of items of transactions is used to reduce the number of transactions, and the minimum support to cut down on items. The performance of the proposed algorithm is assessed by the comparison of search time and precision with existing algorithms. The findings from this study indicated that the proposed algorithm has been searched more quickly and efficiently when extracting final frequent items, compared to existing Apriori and Matrix algorithm.

Analysis of Artistic Symbol Expression of Movie Contents Focused on the film "Roma(2018)" (영화콘텐츠의 예술적 상징표현 분석연구 영화 "로마(2018)"을 중심으로)

  • Lee, Tae-Hoon
    • Journal of Digital Convergence
    • /
    • v.17 no.11
    • /
    • pp.475-482
    • /
    • 2019
  • Analyzing the inner meaning and expression of philosophy by analyzing the composition, symbolic expression, and style of the film with high artistic perfection, which contains the spirit of the times, considers human beings through society and history, and raises awareness of life and the present generation. It will be a very meaningful and valuable study in film as art. The movie 'Rome' was cut into the rest of the public's mind by being tempered, hidden and omitted, and the color was black and white. Many aesthetic attempts can be found through symbolic images expressing the ironic message of maid's daily life as a race, capital, socially oppressed history. It can be seen that he expresses his own authorism visual language by drawing symbolic expressions through many contrasts and symbolic expressions through objects. The analysis of commercial films containing these artistic values is expected to help in the future production as a measure of the progress of art films and precedents of authorism expression techniques.

Genome-wide survey and expression analysis of F-box genes in wheat

  • Kim, Dae Yeon;Hong, Min Jeong;Seo, Yong Weon
    • Proceedings of the Korean Society of Crop Science Conference
    • /
    • 2017.06a
    • /
    • pp.141-141
    • /
    • 2017
  • The ubiquitin-proteasome pathway is the major regulatory mechanism in a number of cellular processes for selective degradation of proteins and involves three steps: (1) ATP dependent activation of ubiquitin by E1 enzyme, (2) transfer of activated ubiquitin to E2 and (3) transfer of ubiquitin to the protein to be degraded by E3 complex. F-box proteins are subunit of SCF complex and involved in specificity for a target substrate to be degraded. F-box proteins regulate many important biological processes such as embryogenesis, floral development, plant growth and development, biotic and abiotic stress, hormonal responses and senescence. However, little is known about the F-box genes in wheat. The draft genome sequence of wheat (IWGSC Reference Sequence v1.0 assembly) used to analysis a genome-wide survey of the F-box gene family in wheat. The Hidden Markov Model (HMM) profiles of F-box (PF00646), F-box-like (PF12937), F-box-like 2 (PF13013), FBA (PF04300), FBA_1 (PF07734), FBA_2 (PF07735), FBA_3 (PF08268) and FBD (PF08387) domains were downloaded from Pfam database were searched against IWGSC Reference Sequence v1.0 assembly. RNA-seq paired-end libraries from different stages of wheat, such as stages of seedling, tillering, booting, day after flowering (DAF) 1, DAF 10, DAF 20, and DAF 30 were conducted and sequenced by Illumina HiSeq2000 for expression analysis of F-box protein genes. Basic analysis including Hisat, HTseq, DEseq, gene ontology analysis and KEGG mapping were conducted for differentially expressed gene analysis and their annotation mappings of DEGs from various stages. About 950 F-box domain proteins identified by Pfam were mapped to wheat reference genome sequence by blastX (e-value < 0.05). Among them, more than 140 putative F-box protein genes were selected by fold changes cut-offs of > 2, significance p-value < 0.01, and FDR<0.01. Expression profiling of selected F-box protein genes were shown by heatmap analysis, and average linkage and squared Euclidean distance of putative 144 F-box protein genes by expression patterns were calculated for clustering analysis. This work may provide valuable and basic information for further investigation of protein degradation mechanism by ubiquitin proteasome system using F-box proteins during wheat development stages.

  • PDF