• Title/Summary/Keyword: Pre-computation

Search Result 175, Processing Time 0.033 seconds

Parametric Macro for Two-Dimensional Layout on the Auto-CAD System

  • Kim, Yunyoung;Park, Jewoong
    • Journal of Ship and Ocean Technology
    • /
    • v.4 no.3
    • /
    • pp.13-20
    • /
    • 2000
  • In recent years, a number of successful nesting approaches have been developed by using the various heuristic algorithms, and due to their application potential several commercial CAD/CAM packages include a nesting module for solving the layout problems. Since a large portion of the complexity of the part nesting problem results from the overlapping computation, the geometric representation is one of the most important factors to reduce the complexity of the problem. The proposed part representation method can easily handle parts and raw materials with widely varying geometrical shape by using the redesigning modules. This considerably reduces the amount of processed data and consequently the run time of the computer. The aim of this research is to develop parametric macro for two-dimensional layout on the Auto-CAD system. Therefore, this research can be called "pre-nesting".ing".uot;.

  • PDF

Parametric Designs of a Pre-swirl Duct for the 180,000DWT Bulk Carrier Using CFD (CFD를 이용한 180,000 DWT Bulk Carrier용 Pre-Swirl Duct의 파라메트릭 설계)

  • Cho, Han-Na;Choi, Jung-Eun;Chun, Ho-Hwan
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.53 no.5
    • /
    • pp.343-352
    • /
    • 2016
  • In this study, a pre-swirl duct for the 180,000 DWT bulk carrier has been designed from a propulsion standpoint using CFD. The stern duct - designed by NMRI - was selected as the initial duct. The objective function is to minimize the value of delivered power in model scale. Design variables of the duct include duct angle, diameter, chord length, and vertical and horizontal displacements from the center. Design variables of the stators are blade number, arrangement angle, chord length, and pitch angle. A parametric design was carried out with the objective function obtained using CFD. Reynolds averaged Navier-Stokes equations have been solved; and the Reynolds stress model applied for the turbulent closure. A double body model is used for the treatment of free-surface. MRF and sliding mesh models have been applied to simulate the actuating propeller. A self-propulsion point has been obtained from the results of towing and self-propelled computations, i.e., form factor obtained from towing computation and towing forces obtained from self-propelled computations of two propeller rotating speeds. The reduction rate of the delivered power of the improved stern duct is 2.9%, whereas that of the initial stern duct is 1.3%. The pre-swirl duct with one inner stator in upper starboard and three outer stators in portside has been designed. The delivered power due to the designed pre-swirl duct is reduced by 5.8%.

Automated Image Co-registration Using Pre-qualified Area Based Matching Technique (사전검수 영역기반 정합법을 활용한 영상좌표 상호등록)

  • Kim Jong-Hong;Heo Joon;Sohn Hong-Gyoo
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2006.04a
    • /
    • pp.181-185
    • /
    • 2006
  • Image co-registration is the process of overlaying two images of the same scene, one of which represents a reference image, while the other is geometrically transformed to the one. In order to improve efficiency and effectiveness of the co-registration approach, the author proposed a pre-qualified area matching algorithm which is composed of feature extraction with canny operator and area matching algorithm with cross correlation coefficient. For refining matching points, outlier detection using studentized residual was used and iteratively removes outliers at the level of three standard deviation. Throughout the pre-qualification and the refining processes, the computation time was significantly improved and the registration accuracy is enhanced. A prototype of the proposed algorithm was implemented and the performance test of 3 Landsat images of Korea showed: (1) average RMSE error of the approach was 0.436 Pixel (2) the average number of matching points was over 38,475 (3) the average processing time was 489 seconds per image with a regular workstation equipped with a 3 GHz Intel Pentium 4 CPU and 1 Gbytes Ram. The proposed approach achieved robustness, full automation, and time efficiency.

  • PDF

Design of Low Complexity Human Anxiety Classification Model based on Machine Learning (기계학습 기반 저 복잡도 긴장 상태 분류 모델)

  • Hong, Eunjae;Park, Hyunggon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.9
    • /
    • pp.1402-1408
    • /
    • 2017
  • Recently, services for personal biometric data analysis based on real-time monitoring systems has been increasing and many of them have focused on recognition of emotions. In this paper, we propose a classification model to classify anxiety emotion using biometric data actually collected from people. We propose to deploy the support vector machine to build a classification model. In order to improve the classification accuracy, we propose two data pre-processing procedures, which are normalization and data deletion. The proposed algorithms are actually implemented based on Real-time Traffic Flow Measurement structure, which consists of data collection module, data preprocessing module, and creating classification model module. Our experiment results show that the proposed classification model can infers anxiety emotions of people with the accuracy of 65.18%. Moreover, the proposed model with the proposed pre-processing techniques shows the improved accuracy, which is 78.77%. Therefore, we can conclude that the proposed classification model based on the pre-processing process can improve the classification accuracy with lower computation complexity.

A Weighted based Pre-Perform A* Algorithm for Efficient Heuristics Computation Processing (효율적인 휴리스틱 계산 처리를 위한 가중치 기반의 선수행 A* 알고리즘)

  • Oh, Min-Seok;Park, Sung-Jun
    • Journal of Korea Game Society
    • /
    • v.13 no.6
    • /
    • pp.43-52
    • /
    • 2013
  • Path finder is one of the very important algorithm of artificial intelligence and is a process generally used in many game fields. Path finder requires many calculation, so it exerts enormous influences on performances. To solve this, many researches on the ways to reduce the amount of calculate operations have been made, and the typical example is A* algorithm but it has unnecessary computing process, reducing efficiency. In this paper, to reduce the amount of calculate operations such as node search with costly arithmetic operations, we proposes the weight based pre-processing A* algorithm. The simulation was materialized to measure the efficiency of the weight based pre-process A* algorithm, and the results of the experiments showed that the weight based method was approximately 1~2 times more efficient than the general methods.

Apply Locally Weight Parameter Elimination for CNN Model Compression (지역적 가중치 파라미터 제거를 적용한 CNN 모델 압축)

  • Lim, Su-chang;Kim, Do-yeon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.9
    • /
    • pp.1165-1171
    • /
    • 2018
  • CNN requires a large amount of computation and memory in the process of extracting the feature of the object. Also, It is trained from the network that the user has configured, and because the structure of the network is fixed, it can not be modified during training and it is also difficult to use it in a mobile device with low computing power. To solve these problems, we apply a pruning method to the pre-trained weight file to reduce computation and memory requirements. This method consists of three steps. First, all the weights of the pre-trained network file are retrieved for each layer. Second, take an absolute value for the weight of each layer and obtain the average. After setting the average to a threshold, remove the weight below the threshold. Finally, the network file applied the pruning method is re-trained. We experimented with LeNet-5 and AlexNet, achieved 31x on LeNet-5 and 12x on AlexNet.

Voronoi-Based Search Scheme for Road Network Databases (도로 망 데이터베이스를 위한 보로노이 기반의 탐색 방안)

  • Kim, Dae-Hoon;Hwang, Een-Jun
    • Journal of IKEEE
    • /
    • v.11 no.4
    • /
    • pp.348-357
    • /
    • 2007
  • Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.

  • PDF

Certificate-based Electronic Cash System (인증서를 기반으로 하는 전자 현금 시스템)

  • Hwang, Seong-Oun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.11
    • /
    • pp.2921-2929
    • /
    • 1998
  • We propose an efficient off-line electronic cash system based on the certificate issued by Certificate Authority. It satisfies all the basic requirements for electronic payment system such as cash unforgeability, cash anonymity, double spending detection, no framing, etc. Our proposed system is very computationally efficient in the sense that: (1) the number of exponentiation operation imposed on the user during withdrawal phase is much smaller than any existing off-line electronic cash schemes, (2) all the computation of user's during withdrawal phase can be performed by off-line pre-processing. So the proposed system is suitable to be implemented by smart cards in both memory and computation.

  • PDF

Optimal Tool Length Computation of NC Data for 5-axis Ball-ended Milling (5축 볼엔드밀 가공 NC 데이터의 최적 공구 길이 계산)

  • Cho, Hyeon-Uk;Park, Jung-Whan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.15 no.5
    • /
    • pp.354-361
    • /
    • 2010
  • The paper presents an efficient computation of optimal tool length for 5-axis mold & die machining. The implemented procedure processes an NC file as an initial input, where the NC data is generated by another commercial CAM system. A commercial CAM system generates 5-axis machining NC data which, in its own way, is optimal based on pre-defined machining condition such as tool-path pattern, tool-axis control via inclination angles, etc. The proper tool-length should also be provided. The tool-length should be as small as possible in order to enhance machinability as well as surface finish. A feasible tool-length at each NC block can be obtained by checking interference between workpiece and tool components, usually when the tool-axis is not modified at this stage for most CAM systems. Then the minimum feasible tool-length for an NC file consisting of N blocks is the maximum of N tool-length values. However, it can be noted that slight modification of tool-axis at each block may reduce the minimum feasible tool-length in mold & die machining. This approach can effectively be applied in machining feature regions such as steep wall or deep cavity. It has been implemented and is used at a molding die manufacturing company in Korea.

Estimation of Design Rainfall Based on Climate Change Scenario in Jeju Island (기후변화 시나리오를 고려한 제주도 확률강우량 산정)

  • Lee, Jun-Ho;Yang, Sung-Kee;Jung, Woo-Yul;Yang, Won-Seok
    • Journal of Environmental Science International
    • /
    • v.24 no.4
    • /
    • pp.383-391
    • /
    • 2015
  • As occurrence of gradually increasing extreme temperature events in Jeju Island, a hybrid downscaling technique that simultaneously applies by dynamical method and statistical method has implemented on design rainfall in order to reduce flood damages from severe storms and typhoons.As a result of computation, Case 1 shows a strong tendency to excessively compute rainfall, which is continuously increasing. While Case 2 showed similar trend as Case 1, low design rainfall has computed by rainfall in A1B scenario. Based on the design rainfall computation method mainly used in Preventive Disaster System through Pre-disaster Effect Examination System and Basic Plan for River of Jeju Island which are considering climatic change for selecting 50-year and 100-year frequencies. Case 3 selecting for Jeju rain gage station and Case 1 for Seogwipo rain gage station. The results were different for each rain gage station because of difference in rainfall characteristics according to recent climatic change, and the risk of currently known design rainfall can be increased in near future.