• Title/Summary/Keyword: amount of computation

Search Result 604, Processing Time 0.032 seconds

Structural Analysis of the Aluminum Extrusion Plate with Truss-Core (트러스 코어 헝상을 갖는 알루미늄 압출재의 구조 해석)

  • 장창두;이병삼;하윤석;김호경;송하철;문형석
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.16 no.2
    • /
    • pp.133-140
    • /
    • 2003
  • The sandwich plate has been widely used as an efficient structural member because it has high strength-to-weight and high stiffness-to-weight ratios. To properly design the aluminum extrusion plate , it is necessary to analyze structural behaviors of the extrusions, however, the aluminum extrusions have been rarely studied until now. In the optimization process through numerous iterative calculations, finite element analysis of the sandwich plate with hollow core section requires a considerable amount of computation time and cost. In this paper, the aluminum extrusion plate with truss-core is transformed into an equivalent homogeneous orthotropic plate with appropriate elastic constants. The procedure to evaluate accurate equivalent elastic constants is also established. Using these elastic constants, simple theoretical formulas of the stresses and deflection are proposed in case of the simply-supported orthotropic thick plate under uniform pressure. Through the comparison with the results by commercial FEM code(ANSYS), it is verified that the proposed simpified formula has a good efficiency and accuracy.

An Adaptive Road ROI Determination Algorithm for Lane Detection (차선 인식을 위한 적응적 도로 관심영역 결정 알고리즘)

  • Lee, Chanho;Ding, Dajun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.1
    • /
    • pp.116-125
    • /
    • 2014
  • Road conditions can provide important information for driving safety in driving assistance systems. The input images usually include unnecessary information and they need to be analyzed only in a region of interest (ROI) to reduce the amount of computation. In this paper, a vision-based road ROI determination algorithm is proposed to detect the road region using the positional information of a vanishing point and line segments. The line segments are detected using Canny's edge detection and Hough transform. The vanishing point is traced by a Kalman filter to reduce the false detection due to noises. The road ROI can be determined automatically and adaptively in every frame after initialization. The proposed method is implemented using C++ and the OpenCV library, and the road ROIs are obtained from various video images of black boxes. The results show that the proposed algorithm is robust.

A Study on Compression of Connections in Deep Artificial Neural Networks (인공신경망의 연결압축에 대한 연구)

  • Ahn, Heejune
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.22 no.5
    • /
    • pp.17-24
    • /
    • 2017
  • Recently Deep-learning, Technologies using Large or Deep Artificial Neural Networks, have Shown Remarkable Performance, and the Increasing Size of the Network Contributes to its Performance Improvement. However, the Increase in the Size of the Neural Network Leads to an Increase in the Calculation Amount, which Causes Problems Such as Circuit Complexity, Price, Heat Generation, and Real-time Restriction. In This Paper, We Propose and Test a Method to Reduce the Number of Network Connections by Effectively Pruning the Redundancy in the Connection and Showing the Difference between the Performance and the Desired Range of the Original Neural Network. In Particular, we Proposed a Simple Method to Improve the Performance by Re-learning and to Guarantee the Desired Performance by Allocating the Error Rate per Layer in Order to Consider the Difference of each Layer. Experiments have been Performed on a Typical Neural Network Structure such as FCN (full connection network) and CNN (convolution neural network) Structure and Confirmed that the Performance Similar to that of the Original Neural Network can be Obtained by Only about 1/10 Connection.

VLSI Design for Motion Estimation Based on Bit-plane Matching (비트 플레인 정합에 의한 움직임 추정기의 VLSI 설계)

  • Go, Yeong-Gi;O, Hyeong-Cheol;Go, Seong-Je
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.5
    • /
    • pp.509-517
    • /
    • 2001
  • Full-search algorithm requires large amount of computation which causes time delay or very complex hardware architecture for real time implementation. In this paper, we propose a fast motion estimator based on bit-plane matching, which reduce the computational complexity and the hardware cost. In the proposed motion estimator, the conventional motion estimation algorithms are applied to the binary images directly extracted from the video sequence. Furthermore, in the proposed VLSI motion estimator, we employ a Pair of processing cores that calculate the motion vector continuously By controlling the data flow in a systolic fashion using the internal shift registers in the processing cores, we avoid using SRAM (local memory) so that we remove the time overhead for accessing the local memory and adopt lower-cost fabrication technology. We modeled and tested the proposed motion estimator in VHDL, and then synthesized the whole system which has been integrated in a 0.6-$\mu$m triple-metal CMOS chip of size 8.15 X 10.84$\textrm{mm}^2$.

  • PDF

Optimum Transplanting Time for Extremely Early Rice Greenhouse Cultivation in the Southern Area (남부지역 시설하우스 벼 극조기재배의 안전작기 설정)

  • 최장수;안덕종;원종건;이승필;윤재탁;김길웅
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.5 no.3
    • /
    • pp.191-199
    • /
    • 2003
  • Optimum transplanting time for extremely early rice cultivation as an after-crop of fruit and vegetables under greenhouse conditions in the southern area was determined. Rice was transplanted on March 10, March 20, March 30, April 10 and April 20 far three years from 1998 to 2000. Meteorological computations for rice production were high for heading between early May and early July, but they were too low for heading between late July and early August. Especially the expected yield predicted with 35,000 spikelets, the average spikelets per $m^2$ for extremely early transplanting. Computation for heading between late July and early August was low by 106 kg/10a compared with that yield at heading during the same period in the field. As the transplanting date in extremely early rice cultivation was earlier) rice growth at early stages was more retarded by low temperature. Rice growth at heading stage recovered with high temperature, showing less difference for the transplanting date. Abnormal tillers occurred by 15.5∼22.2%. The contribution of 1,000 grain weight${\times}$ripened grain ratio to yield of the extremely early rice cultivation in the greenhouse was 50.6%, indicating 16% hi일or than the degree of panicle per $m^2$ on yield. The estimated optimum transplanting time on the basis of yield for the extremely early greenhouse rice cultivation ranged from March 19 to April 28, and the estimated critical transplanting date on the basis of accumulated effective temperature was March 12. Rice reduced the amount of NO$_3$-N by 97.1% and EC by 90.5% in greenhouse soil with continuous fruit/vegetables fer more than a 10-year period, and completely removed the root-knot nematodes.

Security Authentication Technique using Hash Code in Wireless RFID Environments (무선 RFID 환경에서 해시코드를 이용한 EPC 코드 보안)

  • Lee, Cheol-Seung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.6
    • /
    • pp.1077-1082
    • /
    • 2019
  • The development of computing technology and networking has developed into a fundamental technology of the Fourth Industrial Revolution, which provides a ubiquitous environment. In the ubiquitous environment, the IoT environment has become an issue so that various devices and the things can be actively accessed and connected. Also, the RFID system using the wireless identification code attaches an RFID tag to the object, such as the production and distribution of products. It is applied to the management very efficiently. EPCglobal is conducting a research on RFID system standardization and various security studies. Since RFID systems use wireless environment technology, there are more security threats than wire problems. In particular, failure to provide confidentiality, indistinguishability, and forward safety could expose them to various threats in the Fourth Industrial Revolution. Therefore, this study analyzes the standard method of EPCgolbal and proposes RFID security method using hash code that can consider the amount of computation.

Development of Embedded Lane Detection Image Processing Algorithm for Car Black Box (차량용 블랙박스를 위한 임베디드 차선감지 영상처리 알고리즘 개발)

  • Yi, Soo-Yeong;Ryu, Ji-Hyoung;Lee, Chang-Goo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.8
    • /
    • pp.2942-2950
    • /
    • 2010
  • Car black box helps to investigate the cause of accident by recording time, position and videos as well as shock information. In addition, the car black box need a function to support safe driving for preventing accident. The representative driving support function is a lane departure warning. In order to implement the function, it is necessary to carry out the image processing to detect the lane first. The image processing algorithm requires computational burden to handle so much data and complicated structure of algorithm. This paper describes the efficient image processing algorithm with relatively low amount of computation for car black box embedded platform to detect lanes from the real-time lane image.

Construction of 2D Image Mosaics Using Quasi-feature Point (유사 특징점을 이용한 모자이킹 영상의 구성)

  • Kim, Dae-Hyeon;Choe, Jong-Su
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.4
    • /
    • pp.381-391
    • /
    • 2001
  • This paper presents an efficient approach to build an image mosaics from image sequences. Unlike general panoramic stitching methods, which usually require some geometrical feature points or solve the iterative nonlinear equations, our algorithm can directly recover the 8-parameter planar perspective transforms. We use four quasi-feature points in order to compute the projective transform between two images. This feature is based on the graylevel distribution and defined in the overlap area between two images. Therefore the proposed algorithm can reduce the total amount of the computation. We also present an algorithm lot efficiently matching the correspondence of the extracted feature. The proposed algorithm is applied to various images to estimate its performance and. the simulation results present that our algorithm can find the correct correspondence and build an image mosaics.

  • PDF

A Tabu Search Algorithm for Minimum Energy Cooperative Path Problem in Wireless Ad hoc Networks (무선 애드 혹 네트워크에서 최소 에너지 협력 경로 문제를 위한 타부 서치 알고리즘)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.8
    • /
    • pp.1444-1451
    • /
    • 2016
  • This paper proposes a Tabu search algorithm to minimize the required energy to send data between a source and a destination using the cooperative communication in wireless ad hoc networks. As the number of nodes in wireless ad hoc networks increases, the amount of calculation for establishing the path between nodes would be too much increased. To obtain the optimal cooperative path within a reasonable computation time, we propose a new Tabu search algorithm for a high-density wireless network. In order to make a search more efficient, we propose some efficient neighborhoods generating operations of the Tabu search algorithm. We evaluate those performances through some experiments in terms of the minimum energy required to send data between a source and a destination as well as the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

Water and Salt Budgets for the Yellow Sea

  • Lee, Jae-Hak;An, Byoung-Woong;Bang, Inkweon;Hong, Gi-Hoon
    • Journal of the korean society of oceanography
    • /
    • v.37 no.3
    • /
    • pp.125-133
    • /
    • 2002
  • Water and salt budgets in the Yellow Sea and Bohai are analyzed based on the historical data and CTD data collected recently using box models. The amounts of volume transport and of water exchange across the boundary between the Yellow and East China Seas are estimated to be 2,330-2,840 $\textrm{km}^3$/yr and 109-133 $\textrm{km}^3$/yr, respectively, from the one-layer box model. Corresponding water residence time is 5-6 years. In the Bohai, water residence time is twice as long as that in the Yellow Sea, suggesting that the Yellow Sea and Bohai cannot be considered as a single system in the view of water and salt budgets. The results indicate that water and salt budgets in the Yellow Sea depend almost only on the water exchange between the Yellow and East China Seas. The computation with the coupled two-layer model shows that water residence time is slightly decreased to 4-5 years for the Yellow Sea. In order to reduce uncertainties for the budgeting results the amount of the discharge from the Changjiang that enters into the Yellow Sea, the vertical advection and vertical mixing fluxes across the layer interface have to be quantified. The decreasing trend of the annual Yellow River outflow is likely to result that water residence time is much longer than the current state, especially for the Bohai. The completion of the Three Gorges dam on the Changjiang may be change the water and salt budgets in the Yellow Sea. It is expected that cutting back the discharge from the Changjiang by 10% through the dam would increase water residence time by about 10%.