• Title/Summary/Keyword: Minimum Support

Search Result 553, Processing Time 0.031 seconds

Mixed finite element model for laminated composite beams

  • Desai, Y.M.;Ramtekkar, G.S.
    • Structural Engineering and Mechanics
    • /
    • v.13 no.3
    • /
    • pp.261-276
    • /
    • 2002
  • A novel, 6-node, two-dimensional mixed finite element (FE) model has been developed to analyze laminated composite beams by using the minimum potential energy principle. The model has been formulated by considering four degrees of freedom (two displacement components u, w and two transverse stress components ${\sigma}_z$, $\tau_{xz}$) per node. The transverse stress components have been invoked as nodal degrees of freedom by using the fundamental elasticity equations. Thus, the present mixed finite element model not only ensures the continuity of transverse stress and displacement fields through the thickness of the laminated beams but also maintains the fundamental elasticity relationship between the components of stress, strain and displacement fields throughout the elastic continuum. This is an important feature of the present formulation, which has not been observed in various mixed formulations available in the literature. Results obtained from the model have been shown to be in excellent agreement with the elasticity solutions for thin as well as thick laminated composite beams. A few results for a cross-ply beam under fixed support conditions are also presented.

Ultra Low Power Data Aggregation for Request Oriented Sensor Networks

  • Hwang, Kwang-Il;Jang, In
    • Journal of Information Processing Systems
    • /
    • v.10 no.3
    • /
    • pp.412-428
    • /
    • 2014
  • Request oriented sensor networks have stricter requirements than conventional event-driven or periodic report models. Therefore, in this paper we propose a minimum energy data aggregation (MEDA), which meets the requirements for request oriented sensor networks by exploiting a low power real-time scheduler, on-demand time synchronization, variable response frame structure, and adaptive retransmission. In addition we introduce a test bed consisting of a number of MEDA prototypes, which support near real-time bidirectional sensor networks. The experimental results also demonstrate that the MEDA guarantees deterministic aggregation time, enables minimum energy operation, and provides a reliable data aggregation service.

Statistical Analysis of End-to-End Delay for VoIP Service in Mobile WiMAX Networks

  • Islam, Mohd. Noor;Jang, Yeong-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.2A
    • /
    • pp.196-201
    • /
    • 2010
  • Measurement of Quality of Service (QoS) parameters and its statistical analysis becomes a key issue for Mobile WiMAX service providers to manage the converged network efficiently and to support end-to-end QoS. In this paper, we investigate the population distribution of end-to-end one-way delay which is the most important QoS parameter in Mobile WiMAX networks. The samples are analyzed with Chi-Square Goodness-of-Fit test, Kolmogorov-Smirnov (K-S), and Anderson-Darling (A-D) test to verify the distribution of parent population. The relation with confidence level and the minimum number of sample size is also performed for logistic distribution. The statistical analysis is a promising approach for measuring the performance Mobile WiMAX networks.

The Optimum Design of Ship Structures(1st Report) -Minimum Weight Design of Brackets- (선체구조(船體構造)의 최적설계(最適設計)(제1보)(第1報) -Bracket의 최소중량설계(最小重量設計)-)

  • Chang-Doo,Jang;Seung-Soo,Na
    • Bulletin of the Society of Naval Architects of Korea
    • /
    • v.21 no.4
    • /
    • pp.29-39
    • /
    • 1984
  • In this paper, the membrane and buckling analysis of beams with various shaped brackets is performed by using the finite element method. From the viewpoint of minimum structural weight, a optimum design method to determine the optimal shapes and scantling of brackets under design load is proposed by investigating the effects of beam depth, bracket length and aspect ratio on the structural weight. Also optimal design data and charts for the brackets to support transverse girders or web frames of actual ships are provided. By the present design method, it is possible to perform optimum design of brackets used in actual ships, which could result in considerable reduction of structural weight or cost, increase of dead weight and service speed of ships.

  • PDF

Relay node selection algorithm consuming minimum power of MIMO integrated MANET

  • Chowdhuri, Swati;Banerjee, Pranab;Chaudhuri, Sheli Sinha
    • Advances in Computational Design
    • /
    • v.3 no.2
    • /
    • pp.191-200
    • /
    • 2018
  • Establishment of an efficient routing technique in multiple-input-multiple-output (MIMO) based mobile ad hoc network (MANET) is a new challenge in wireless communication system to communicate in a complex terrain where permanent infrastructure network implementation is not possible. Due to limited power of mobile nodes, a minimum power consumed routing (MPCR) algorithm is developed which is an integration of cooperative transmission process. This algorithm select relay node and support short distance communication. The performance analysis of proposed routing algorithm increased signal to noise interference ratio (SNIR) resulting effect of cooperative transmission. Finally performance analysis of the proposed algorithm is verified with simulated result.

An efficient dynamic routing scheme for delay-bounded multicasting

  • Kang, Moon-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2626-2634
    • /
    • 1997
  • The purpose of multicasting is to reduce the network costs for transmitting the same traffic to multiple destinations. In this paper, an efficient delay-bounded multicasting routing algorithm is proposed, which satistifies the network conditions of cost minimization and can adjust the dynamic events, such as 'leave and/or join ones' from the multicast group. Also, our algorithm is designed for various network requirements such as the efficiet dynamic group support, high-quality data distribution, and adaptability to variable situation. After the delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost, the dynamic delay-bounded multicast tree is constructed using partial multicast routing. We evaluate the performance of the proposed algorithm by running simulations on randomly generated test networks using a Sun Sparc 20 workstation. We were able to obtain good simulation resutls, which means solutions that lies between the minimum cost solution and the minimum delay one.

  • PDF

Efficient Implementations of a Delay-Constrained Least-Cost Multicast Algorithm

  • Feng, Gang;Makki, Kia;Pissinou, Niki
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.246-255
    • /
    • 2002
  • Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimumdelay tree, and then iteratively uses a -shortest-path (KSP) algorithm to search for a better path to replace a “superedge” in the existing tree, and consequently reduces the cost of the tree. The major drawback of BSMA is its high time complexity because of the use of the KSP algorithm. For this reason, we investigate in this paper the possibility of more efficient implementations of BSMA by using different methods to locate the target path for replacing a superedge. Our experimental results indicate that our methods can significantly reduce the time complexity of BSMA without deteriorating the cost performance.

Approximate Design Optimization of Active Type Desk Support Frame for Float-over Installation Using Meta-model (메타모델을 이용한 플로트오버 설치 작업용 능동형 갑판지지프레임의 근사설계최적화)

  • Lee, Dong Jun;Song, Chang Yong;Lee, Kangsu
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.24 no.1
    • /
    • pp.31-43
    • /
    • 2021
  • In this study, approximate design optimization using various meta-models was performed for the structural design of active type deck support frame. The active type deck support frame was newly developed to facilitate both transportation and installation of 20,000 ton class offshore plant topside. Structural analysis was carried out using the finite element method to evaluate the strength performance of the active type deck support frame in its initial design stage. In the structural analysis, the strength performances were evaluated for various design load conditions that were regulated in ship classification organization. The approximate optimum design problem based on meta-model was formulated such that thickness sizing variables of main structure members were determined by achieving the minimum weight of the active type deck support frame subject to the strength performance constraints. The meta-models used in the approximate design optimization were response surface method, Kriging model, and Chebyshev orthogonal polynomials. The results from approximate design optimization were compared to actual non-approximate design optimization. The Chebyshev orthogonal polynomials among the meta-models used in the approximate design optimization represented the most pertinent optimum design results for the structure design of the active type deck support frame.

A Multi Router Support Mechanism in 6LowPAN (6LowPAN 에서 멀티 라우터 지원 방법)

  • Jung, Seuk;Lim, Chae-Seong;Jung, Won-Do;Yoo, Seung-Wha;Roh, Byeong-Hee;Kim, Ki-Hyung
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2007.08a
    • /
    • pp.279-282
    • /
    • 2007
  • Typically a wireless sensor network consists of a number of nodes that sense surrounding environment and collaboratively work to process and route the sensing data to a sink or gateway node. We propose an architecture with support of multiple routers in IPv6-based Low-power Wireless Personal Area Network (6LoWPAN). Our architecture provides traffic load balancing and increases network lifetime as well as self-healing mechanism so that in case of a router failure the network still can remain operational. Each router sends its own Router Advertisement message to nodes and all the nodes receiving the messages can select which router is the best router with the minimum hop-count and link information. We have implemented the architecture and assert our architecture helps in traffic load balancing and reducing data transmission delay for 6LoWPAN.

  • PDF

Scalable Extension of HEVC for Flexible High-Quality Digital Video Content Services

  • Lee, Hahyun;Kang, Jung Won;Lee, Jinho;Choi, Jin Soo;Kim, Jinwoong;Sim, Donggyu
    • ETRI Journal
    • /
    • v.35 no.6
    • /
    • pp.990-1000
    • /
    • 2013
  • This paper describes the scalable extension of High Efficiency Video Coding (HEVC) to provide flexible high-quality digital video content services. The proposed scalable codec is designed on multi-loop decoding architecture to support inter-layer sample prediction and inter-layer motion parameter prediction. Inter-layer sample prediction is enabled by inserting the reconstructed picture of the reference layer (RL) into the decoded picture buffer of the enhancement layer (EL). To reduce the motion parameter redundancies between layers, the motion parameter of the RL is used as one of the candidates in merge mode and motion vector prediction in the EL. The proposed scalable extension can support scalabilities with minimum changes to the HEVC and provide average Bj${\o}$ntegaard delta bitrate gains of about 24% for spatial scalability and of about 21% for SNR scalability compared to simulcast coding with HEVC.