• 제목/요약/키워드: Search weight

검색결과 503건 처리시간 0.04초

고정지지된 Sandwich Panel의 최적설계에 관한 연구 (An Optimum Design of Sandwich Panel at Fixed Edges)

  • 김기성;김익태;김윤영
    • 대한조선학회논문집
    • /
    • 제29권2호
    • /
    • pp.115-122
    • /
    • 1992
  • Sandwich구조는 복합구조의 특별한 hybrid구조의 형태로써 두 층의 얇은 표면재와 가운데 두꺼운 층인 경량의 심재로 구성되어 있으며, 이는 표면재와 심재가 접착된 일체로써 서로의 단점을 보완하면서 구조 효율을 높인 형상이다. 또한 심재는 표면재에 비해서 상당히 두꺼운 두께를 갖기 때문에 전단 변형이 중요하므로 굽힘 강성도(bending stiffness) 계산에 전단효과가 고려되어야 한다. 구조 설계에서 중요한 목적은 중량 감소에 있기 때문에 본 논문에서는 sandwich panel의 설계시 표면재와 심재의 두께 및 재질을 변화시켜 제한조건에 맞는 최소 중량을 얻는 데 중점을 두었다. 본 해석에서 sandwich panel의 최소중량을 얻기 위하여 표면재와 전단력을 고려한 심재의 변형에 따른 변형에너지를 각각 계산한 후, 최소 potential 에너지 원리를 적용하여 목적함수의 최적치를 구하였다. 설계 제한조건으로는 허용 처짐, 허용 굽힘응력, 허용 전단응력과 국부적인 불안정 상태의 wrinkling 응력이 고려되었으며, 설계 모델은 수직 분포 하중에 의한 여러가지 경계조건에 따른 sandwich panel을 대상으로 하였다. 비선형 최적화 기법은 Nelder and Mead Simplex Search Method와 Hooke and Jeeves Pattern Search method에 External Penalty Function이 적용된 SUMT방법을 결합시킨 SUMTNM와 SUMTHJ를 사용하였으며, 해석 결과는 sandwich panel의 구조 설계에 활용할 수 있도록 표를 작성하였다.

  • PDF

본초 비율의 순위를 이용한 문헌의 특징 분석 방법 - 태평혜민화제국방(太平惠民和劑局方), 난실비장(蘭室秘藏), 소문선명론방(素問宣明論方)을 중심으로 - (Analysis of Prescriptions from Taepyeonghyeminhwajegukbang, Somunsunmyungronbang and Nansilbijang based on Herb weight ratio grade)

  • 김기욱;김태열;이병욱
    • 대한한의학원전학회지
    • /
    • 제27권4호
    • /
    • pp.73-84
    • /
    • 2014
  • Objectives : I'd like to mimic JunChenZuoShe Theory as Herb weight ratio grade. And than analyze the characteristics of the prescription based on the Herb weight ratio grade from Taepyeonghyeminhwajegukbang, Somunsunmyungronbang and Nansilbijang. Methods : At first, we have changed herb informations to Herb weight ratio. The second we have decided the ranking of herb weight ratio. The third we have entered herb weight ratio grade. Finally we have counted frequency of first grade herb from the Taepyeonghyeminhwajegukbang, Somunsunmyungronbang and Nansilbijang. Results : We could use a new search function to find prescription by herb weight ratio grade. And than we could find out prescription efficacy rate of the ancient documents. Conclusions : We have entered herb weight ratio grade values by herb weight ratio ranking of top 10%, 30%, 60%. So we could find out that buqi(補氣) efficacy is used most often in the Taepyeonghyeminhwajegukbang, Somunsunmyungronbang and Nansilbijang. In the rate of qingrezaoshi(淸熱燥濕) efficacy, fasanfengre(發散風熱) efficacy, fasanfenghan(發散風寒) efficacy, Nansilbijang is higher than Taepyeonghyeminhwajegukbang. In the rate of qingrezaoshi(淸熱燥濕) efficacy, gongxia(攻下) efficacy, Somunsunmyungronbang is higher than Taepyeonghyeminhwajegukbang.

Adaptive User Profile for Information Retrieval from the Web

  • Srinil, Phaitoon;Pinngern, Ouen
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.1986-1989
    • /
    • 2003
  • This paper proposes the information retrieval improvement for the Web using the structure and hyperlinks of HTML documents along with user profile. The method bases on the rationale that terms appearing in different structure of documents may have different significance in identifying the documents. The method partitions the occurrence of terms in a document collection into six classes according to the tags in which particular terms occurred (such as Title, H1-H6 and Anchor). We use genetic algorithm to determine class importance values and expand user query. We also use this value in similarity computation and update user profile. Then a genetic algorithm is used again to select some terms from user profile to expand the original query. Lastly, the search engine uses the expanded query for searching and the results of the search engine are scored by similarity values between each result and the user profile. Vector space model is used and the weighting schemes of traditional information retrieval were extended to include class importance values. The tested results show that precision is up to 81.5%.

  • PDF

이동 P2P 환경에서 효율적인 데이터 전송을 이용한 피어 색인 기법 (Peer Indexing Scheme using Efficient Data Dissemination in Mobile P2P Environment)

  • 곽동원;복경수;박용훈;정근수;최길성;유재수
    • 한국콘텐츠학회논문지
    • /
    • 제10권9호
    • /
    • pp.26-35
    • /
    • 2010
  • 본 논문에서는 이동 P2P 환경에서 피어의 콘텐츠와 이동성을 고려한 데이터 전송을 이용한 피어 색인 기법을 제안한다. 제안하는 기법은 콘텐츠 검색을 위한 데이터 전송 비용 및 검색 정확성과 탐색 비용을 보장하기 위해 인덱스 테이블, 버디 테이블, 라우팅 테이블로 구성한다. 제안하는 기법에서 이동 피어는 수신 신호 변화 함수를 통해 이웃 피어를 인식하고 타임스탬프 메시지를 통해 데이터 전송 비용을 감소시킨다. 전송된 데이터는 시간과 관심항목 가중치를 고려한 피어 색인 구조에 저장되어 검색 정확도를 향상 시키고 탐색 비용을 감소시킨다.

스타이너트리 기반의 효과적인 모바일 웹 오브젝트 네비게이션 (An Effective Mobile Web Object Navigation Based on the Steiner Tree Approach)

  • 이우기;송종수;이정훈
    • 경영과학
    • /
    • 제28권1호
    • /
    • pp.1-10
    • /
    • 2011
  • One of the fundamental roles of web object navigation is to support what the user wants precisely and efficiently from the enormous web database to the web browser. As long as the web search results are a set of individual lists, it is all right to display each and every web result for the web browser to display a web object one by one. However, in case the search results are a collection of multiple interrelated web objects, then there is a need to represent for a new mechanism for linked web objects at a time. We define a unit of web objects derived from a Steiner tree where the web objects include a set of specific keywords calculated by the weight from which the solutions are extracted. Even if a web object does not include all the keywords, then the related hypertext linked web objects are derived and displayed onto the mobile web browser with meta data in one shot. In this paper, it is applied for the mobile browser that the web contents can dynamically be displayed with Steiner trees until each renewal of the navigation request may be issued. In this paper, a new synchronized mobile browsing method is developed so that the navigating time can drastically be reduced and the web navigating efficiency can be dramatically enhanced without sacrificing memory consumption.

Optimal stacking sequence design of laminate composite structures using tabu embedded simulated annealing

  • Rama Mohan Rao, A.;Arvind, N.
    • Structural Engineering and Mechanics
    • /
    • 제25권2호
    • /
    • pp.239-268
    • /
    • 2007
  • This paper deals with optimal stacking sequence design of laminate composite structures. The stacking sequence optimisation of laminate composites is formulated as a combinatorial problem and is solved using Simulated Annealing (SA), an algorithm devised based on inspiration of physical process of annealing of solids. The combinatorial constraints are handled using a correction strategy. The SA algorithm is strengthened by embedding Tabu search in order to prevent recycling of recently visited solutions and the resulting algorithm is referred to as tabu embedded simulated Annealing (TSA) algorithm. Computational performance of the proposed TSA algorithm is enhanced through cache-fetch implementation. Numerical experiments have been conducted by considering rectangular composite panels and composite cylindrical shell with different ply numbers and orientations. Numerical studies indicate that the TSA algorithm is quite effective in providing practical designs for lay-up sequence optimisation of laminate composites. The effect of various neighbourhood search algorithms on the convergence characteristics of TSA algorithm is investigated. The sensitiveness of the proposed optimisation algorithm for various parameter settings in simulated annealing is explored through parametric studies. Later, the TSA algorithm is employed for multi-criteria optimisation of hybrid composite cylinders for simultaneously optimising cost as well as weight with constraint on buckling load. The two objectives are initially considered individually and later collectively to solve as a multi-criteria optimisation problem. Finally, the computational efficiency of the TSA based stacking sequence optimisation algorithm has been compared with the genetic algorithm and found to be superior in performance.

MISO 빔포밍 시스템에서 효율적인 QEGT 코드북 탐색 기법 (Efficient QEGT Codebook Searching Technique for a MISO Beamforming System)

  • 박노윤;김영주
    • 한국전자파학회논문지
    • /
    • 제20권11호
    • /
    • pp.1209-1216
    • /
    • 2009
  • 본 논문은 Rayleigh 플랫 페이딩 채널에서 MISO 빔포밍 시스템의 효율적인 양자화된 동 이득 전송 코드북 인덱스 탐색 기법을 제안한다. 코드북의 사이즈가 선형적으로 증가함에 따라 비트 오율 성능은 증가하지만, 최적의 가중치 벡터를 찾는 시간은 지수적으로 증가한다. 따라서 본 논문에서 새로운 간단한 메트릭을 이용하여 2개에서 5개의 후보 벡터들만 찾아내는 빠른 탐색 기법을 제안한다. 후보 벡터들에는 기존의 정확한 탐색 기법을 적용하여 최적의 벡터를 찾아낸다. 제안하는 기법은 전반적인 탐색 시간을 줄이면서도 비트 오율에는 거의 영향을 주지 않는다. 더욱이 코드북의 사이즈가 증가함에 따라 탐색 시간도 기존의 기법에 비해 매우 감소된다.

Improved DV-Hop Localization Algorithm Based on Bat Algorithm in Wireless Sensor Networks

  • Liu, Yuan;Chen, Junjie;Xu, Zhenfeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권1호
    • /
    • pp.215-236
    • /
    • 2017
  • Obtaining accurate location information is important in practical applications of wireless sensor networks (WSNs). The distance vector hop (DV-Hop) is a frequently-used range-free localization algorithm in WSNs, but it has low localization accuracy. Moreover, despite various improvements to DV-Hop-based localization algorithms, maintaining a balance between high localization accuracy and good stability and convergence is still a challenge. To overcome these shortcomings, we proposed an improved DV-Hop localization algorithm based on the bat algorithm (IBDV-Hop) for WSNs. The IBDV-Hop algorithm incorporates optimization methods that enhance the accuracy of the average hop distance and fitness function. We also introduce a nonlinear dynamic inertial weight strategy to extend the global search scope and increase the local search accuracy. Moreover, we develop an updated solutions strategy that avoids premature convergence by the IBDV-Hop algorithm. Both theoretical analysis and simulation results show that the IBDV-Hop algorithm achieves higher localization accuracy than the original DV-Hop algorithm and other improved algorithms. The IBDV-Hop algorithm also exhibits good stability, search capability and convergence, and it requires little additional time complexity and energy consumption.

Pareto 최적점 기반 다목적함수 기법에 의한 이중선각유조선의 최적 구조설계 (Optimum Structural Design of D/H Tankers by using Pareto Optimal based Multi-objective function Method)

  • 나승수;염재선;한상민
    • 대한조선학회논문집
    • /
    • 제42권3호
    • /
    • pp.284-289
    • /
    • 2005
  • A structural design system is developed for the optimum design of double hull tankers based on the multi-objective function method. As a multi-objective function method, Pareto optimal based random search method is adopted to find the minimum structural weight and fabrication cost. The fabrication cost model is developed by considering the welding technique, welding poses and assembly stages to manage the fabrication man-hour and process. In this study, a new structural design is investigated due to the rapidly increased material cost. Several optimum structural designs on the basis of high material cost are carried out based on the Pareto optimal set obtained by the random search method. The design results are compared with existing ship, which is designed under low material cost.

Optimum design of prestressed concrete beams by a modified grid search method

  • Cagatay, Ismail H.;Dundar, Cengiz;Aksogan, Orhan
    • Structural Engineering and Mechanics
    • /
    • 제15권1호
    • /
    • pp.39-52
    • /
    • 2003
  • A computer program has been developed for the optimum design of prestressed concrete beams under flexure. Optimum values of prestressing force, tendon configuration, and cross-sectional dimensions are determined subject to constraints on the design variables and stresses. 28 constraints have been used including flexural stresses, cover requirement, the aspect ratios for top and bottom flanges and web part of a beam and ultimate moment. The objective function contains cost of concrete, prestressing force and formwork. Using this function, it is possible to obtain minimum cost design, minimum weight or cross-sectional area of concrete design and minimum prestressing force design. Besides the idealized I-shaped cross-section, which is widely used in literature, a general I-shaped cross-section with eight geometrical design variables are used here. Four examples, one of which is available in the literature and the others are modified form of it, have been solved for minimum cost and minimum cross-sectional area designs and the results are compared. The computer program, which employs modified grid search optimization method, can assist a designer in producing efficient designs rapidly and easily. Considerable savings in computational work are thus made possible.