• Title/Summary/Keyword: Grid search

Search Result 276, Processing Time 0.025 seconds

Design of ceramics powder compaction process parameters (Part Ⅱ : Optimization) (세라믹스 분말 가압 성형 공정 변수설계(2부: 최적화))

  • Kim J. L.;Keum Y. T.
    • Journal of the Korean Crystal Growth and Crystal Technology
    • /
    • v.15 no.1
    • /
    • pp.27-33
    • /
    • 2005
  • In this study, the process parameters in ceramics powder compaction are optimized for getting high relative densities of ceramic products. To find optimized parameters, the analytic models of powder compaction are firstly prepared by 2-dimensional rod arrays with random green densities using a quasi-random multiparticle array. Then, using finite element method, the changes in relative densities are analyzed by varying the size of Al₂O₃ particle, the amplitude of cyclic compaction, and the coefficient of friction, which influence the relative density in cyclic compactions. After the analytic function of relative density associated process parameters are formulated by aid of the response surface method, the optimal conditions in powder compaction process are found by the grid search method. When the particle size of Al₂O₃ is 22.5 ㎛, the optimal parameters for the amplitude of cyclic compaction and the coefficient of friction are 75 MPa and 0.1103, respectively. The maximum relative density is 0.9390.

Pattern Recognition of Ship Navigational Data Using Support Vector Machine

  • Kim, Joo-Sung;Jeong, Jung Sik
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.15 no.4
    • /
    • pp.268-276
    • /
    • 2015
  • A ship's sailing route or plan is determined by the master as the decision maker of the vessel, and depends on the characteristics of the navigational environment and the conditions of the ship. The trajectory, which appears as a result of the ship's navigation, is monitored and stored by a Vessel Traffic Service center, and is used for an analysis of the ship's navigational pattern and risk assessment within a particular area. However, such an analysis is performed in the same manner, despite the different navigational environments between coastal areas and the harbor limits. The navigational environment within the harbor limits changes rapidly owing to construction of the port facilities, dredging operations, and so on. In this study, a support vector machine was used for processing and modeling the trajectory data. A K-fold cross-validation and a grid search were used for selecting the optimal parameters. A complicated traffic route similar to the circumstances of the harbor limits was constructed for a validation of the model. A group of vessels was composed, each vessel of which was given various speed and course changes along a specified route. As a result of the machine learning, the optimal route and voyage data model were obtained. Finally, the model was presented to Vessel Traffic Service operators to detect any anomalous vessel behaviors. Using the proposed data modeling method, we intend to support the decision-making of Vessel Traffic Service operators in terms of navigational patterns and their characteristics.

An Algorithm for generating Cloaking Region Using Grids for Privacy Protection in Location-Based Services (위치기반 서비스에서 개인 정보 보호를 위한 그리드를 이용한 Cloaking 영역 생성 알고리즘)

  • Um, Jung-Ho;Kim, Ji-Hee;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.151-161
    • /
    • 2009
  • In Location-Based Services (LBSs), users requesting a location-based query send their exact location to a database server and thus the location information of the users can be misused by adversaries. Therefore, a privacy protection method is required for using LBS in a safe way. In this paper, we propose a new cloaking region generation algorithm using grids for privacy protection in LBSs. The proposed algorithm creates a m inimum cloaking region by finding L buildings and then performs K-anonymity to search K users. For this, we make use of not only a grid-based index structure, but also an efficient pruning techniques. Finally, we show from a performance analysis that our cloaking region generation algorithm outperforms the existing algorithm in term of the size of cloaking region.

  • PDF

A Novel Road Segmentation Technique from Orthophotos Using Deep Convolutional Autoencoders

  • Sameen, Maher Ibrahim;Pradhan, Biswajeet
    • Korean Journal of Remote Sensing
    • /
    • v.33 no.4
    • /
    • pp.423-436
    • /
    • 2017
  • This paper presents a deep learning-based road segmentation framework from very high-resolution orthophotos. The proposed method uses Deep Convolutional Autoencoders for end-to-end mapping of orthophotos to road segmentations. In addition, a set of post-processing steps were applied to make the model outputs GIS-ready data that could be useful for various applications. The optimization of the model's parameters is explained which was conducted via grid search method. The model was trained and implemented in Keras, a high-level deep learning framework run on top of Tensorflow. The results show that the proposed model with the best-obtained hyperparameters could segment road objects from orthophotos at an average accuracy of 88.5%. The results of optimization revealed that the best optimization algorithm and activation function for the studied task are Stochastic Gradient Descent (SGD) and Exponential Linear Unit (ELU), respectively. In addition, the best numbers of convolutional filters were found to be 8 for the first and second layers and 128 for the third and fourth layers of the proposed network architecture. Moreover, the analysis on the time complexity of the model showed that the model could be trained in 4 hours and 50 minutes on 1024 high-resolution images of size $106{\times}106pixels$, and segment road objects from similar size and resolution images in around 14 minutes. The results show that the deep learning models such as Convolutional Autoencoders could be a best alternative to traditional machine learning models for road segmentation from aerial photographs.

Selective Feature Extraction Method Between Markov Transition Probability and Co-occurrence Probability for Image Splicing Detection (접합 영상 검출을 위한 마르코프 천이 확률 및 동시발생 확률에 대한 선택적 특징 추출 방법)

  • Han, Jong-Goo;Eom, Il-Kyu;Moon, Yong-Ho;Ha, Seok-Wun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.4
    • /
    • pp.833-839
    • /
    • 2016
  • In this paper, we propose a selective feature extraction algorithm between Markov transition probability and co-occurrence probability for an effective image splicing detection. The Features used in our method are composed of the difference values between DCT coefficients in the adjacent blocks and the value of Kullback-Leibler divergence(KLD) is calculated to evaluate the differences between the distribution of original image features and spliced image features. KLD value is an efficient measure for selecting Markov feature or Co-occurrence feature because KLD shows non-similarity of the two distributions. After training the extracted feature vectors using the SVM classifier, we determine whether the presence of the image splicing forgery. To verify our algorithm we used grid search and 6-folds cross-validation. Based on the experimental results it shows that the proposed method has good detection performance with a limited number of features compared to conventional methods.

A Smart Set-Pruning Trie for Packet Classification (패킷 분류를 위한 스마트 셋-프루닝 트라이)

  • Min, Seh-Won;Lee, Na-Ra;Lim, Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11B
    • /
    • pp.1285-1296
    • /
    • 2011
  • Packet classification is one of the basic and important functions of the Internet routers, and it became more important along with new emerging application programs requiring real-time transmission. Since packet classification should be accomplished in line-speed on each incoming input packet for multiple header fields, it becomes one of the challenges in designing Internet routers. Various packet classification algorithms have been proposed to provide the high-speed packet classification. Hierarchical approach achieves effective packet classification performance by significantly narrowing down the search space whenever a field lookup is completed. However, hierarchical approach involves back-tracking problem. In order to solve the problem, set-pruning trie and grid-of-trie algorithms are proposed. However, the algorithm either causes excessive node duplication or heavy pre-computation. In this paper, we propose a smart set-pruning trie which reduces the number of node duplication in the set-pruning trie by the simple merging of the lower-level tries. Simulation result shows that the proposed trie has the reduced number of copied nodes by 2-8% compared with the set-pruning trie.

Application of 3D magnetotelluric investigation for geothermal exploration - Examples in Japan and Korea

  • Uchida Toshihiro;Song Yoonho;Mitsuhata Yuji;Lee Seong Kon
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 2003.11a
    • /
    • pp.390-397
    • /
    • 2003
  • A three-dimensional (3D) inversion technique has been developed for interpretation of magnetotelluric (MT) data. The inversion method is based on the linearized least-squares (Gauss-Newton) method with smoothness regularization. In addition to the underground 3D resistivity distribution, static shifts are also treated as unknown parameters in the inversion. The forward modeling is by the staggered-grid finite difference method. A Bayesian criterion ABle is applied to search the optimum trade-off among the minimization of the data misfit, model roughness and static shifts. The method has been applied to several MT datasets obtained at geothermal fields in Japan and other Asian countries. In this paper, two examples will be discussed: one is the data at the Ogiri geothermal area, southwestern Japan, and the other is at the Pohang low-enthalpy geothermal field, southeastern Korea. The inversion of the Ogiri data has been performed stably, resulting in a good fitting between the observed and computed apparent resistivities and phases. The recovered 3D resistivity structure is generally similar to the two-dimensional (2D) inversion models, although the deeper portion of the 3D model seems to be more realistic than that of the 2D model. The 3D model is also in a good agreement with the geological model of the geothermal reservoirs. 3D interpretation of the Pohang MT data is still preliminary. Although the fitting to the observed data is very good, the preliminary 3D model is not reliable enough because the station coverage is not sufficient for a 3D inversion.

  • PDF

A Study on the Optimization for a V-groove GMA Welding Process Using a Dual Response Method (듀얼 반응표면법을 이용한 V-그루브 GMA 용접공정 최적화에 관한 연구)

  • Park, Hyoung-Jin;Ahn, Seung-Ho;Kang, Mun-Jin;Rhee, Se-Hun
    • Journal of Welding and Joining
    • /
    • v.26 no.2
    • /
    • pp.85-91
    • /
    • 2008
  • In general, the quality of a welding process tends to vary with depending on the work environment or external disturbances. Hence, in order to achieve the desirable quality of welding, we should have the optimal welding condition that is not significantly affected by these changes in the environment or external disturbances. In this study, we used a dual response surface method in consideration of both the mean output variables and the standard deviation in order to optimize the V-groove arc welding process. The input variables for GMA welding process with the dual response surface are welding voltage, welding current and welding speed. The output variables are the welding quality function using the shape factor of bead geometry. First, we performed welding experiment on the interested area according to the central composite design. From the results obtained, we derived the regression model on the mean and standard deviation between the input and output variables of the welding process and then obtained the dual response surface. Finally, using the grid search method, we obtained the input variables that minimize the object function which led to the optimal V-groove arc welding process.

A Job Allocation Manager for Dynamic Remote Execution of Distributed Jobs in P2P Network (분산처리 작업의 동적 원격실행을 위한 P2P 기반 작업 할당 관리자)

  • Lee, Seung-Ha;Kim, Yang-Woo
    • Journal of Internet Computing and Services
    • /
    • v.7 no.6
    • /
    • pp.87-103
    • /
    • 2006
  • Advances in computer and network technology provide new computing environment that were only possible with supercomputers before. In order to provide the environment, a distributed runtime system has to be provided, but most of the conventional distributed runtime systems lack in providing dynamic and flexible system reconfiguration depending on workload variance, due to a static architecture of fixed master node and slave working nodes. This paper proposes and implements a new model for distributed job allocation and management which is a distributed runtime system is P2P environment for flexible and dynamic system reconfiguration. The implemented systems enables job program transfer and management, remote compile and execution among cooperative developers based on P2P standard protocol Jxta platform. Since it makes dynamic and flexible system reconfiguration possible, the proposed method has some advantages in that it can collect and utilize idle computing resources immediately at a needed time for distributed job processing. Moreover, the implemented system's effectiveness and performance increase are shown by applying and processing the crawler jobs, in a distributed way, for collecting a large amount of data needed for internet search.

  • PDF

Trend on the Recycling Technologies for Spent Electric Wire by the Patent and Paper Analysis (특허(特許)와 논문(論文)으로 본 폐전선 재활용(再活用) 기술(技術) 동향(動向))

  • Ku, Jae-Kwan;Kim, Sang-Su;Lee, Yong-Ho;Kim, Byung-Geol;Cho, Young-Ju;Cho, Bong-Gyoo
    • Resources Recycling
    • /
    • v.22 no.5
    • /
    • pp.63-70
    • /
    • 2013
  • There are generated the hundreds of tons of waste electric wire per year due to replace for increase transmission capacity and/or replacement of old electric wire by Korea's national power grid and/or private industrial factories. Recently, the wire recycling technologies studied extensively in terms of effieiency by of economic aspects and environment aspects. In this paper, the patents and papers for the recycling technologies of spent electric wire were collected and analyzed. The range of search was limited in the open patents of USA (US), European Union (EP), Japan (JP), Korea (KR) and SCI journals from 1975 to 2011. Patents and journals were collected using key-words searching and filtered by filtering criteria. The trends of the patents and journals were analyzed by the years, countries, companies, and technologies.