• Title/Summary/Keyword: compute-and-forward

Search Result 54, Processing Time 0.023 seconds

A Study on the development of Tuna Purse Seiner (참치 선망 어선의 선형개발에 관한 연구)

  • 김인철
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.35 no.3
    • /
    • pp.335-342
    • /
    • 1999
  • The purpose of present research is to develop and efficient numerical method for the calculation of potential flow and predict the wave-making resistance for the application to ship design of tuna purse seiner. Havelock was considered the wave resistance of a post extending vertically downwards through the water from the surface, its section by a horizontal plane being the same at all depths and having its breadth small compared with its length. This enables us to elucidate certain points of interest in ship resistance. However, the ship has not infinite draft. So, the problem which is investigated ind detail in this paper is the wave resistance of a mathematical quadratic model in a uniform stream. The paper deals with the numerical calculation of potential flow around the series 60 with forward velocity by the new slender ship theory. This new slender ship theory is based on the asymptotic expression of the Kelvin-source, distributed over the small matrix at each transverse section so as to satisfy the approximate hull boundary condition due to the assumption of slender body. The numerical results using the panel shift method and finite difference method are compared with the experimental results for wigley mono hull. There are no differences in the wave resistance. However, it costs much time to compute not only wave resistance but also wave pattern over some range of Froude numbers. More improvements are strongly desired in the numerical procedure.

  • PDF

Quickest Path Based Integrated Routing Algorithms for Different Network Router Mechanisms (이종 라우팅 메커니즘을 위한 quickest path 기반 통합 라우팅 알고리즘)

  • Bang Young-Cheol;Chung Sung-Taek
    • Journal of Internet Computing and Services
    • /
    • v.7 no.1
    • /
    • pp.143-150
    • /
    • 2006
  • The quickest path problem deals with the transmission of a message of size ${\sigma}$ from a source to a destination with the minimum end to end delay over a network with bandwidth and delay constraints on the links. We consider two basic modes and four variations for the message delivery at the nodes reflecting the mechanisms such as circuit switching. Internet protocol, and their combinations, For each of first five modes, we present O($m^2+mnlogn$) algorithm to compute the quickest path for a given message size ${\sigma}$, For the last mode, the quickest path can be computed in O(m+nlogn) time.

  • PDF

Individual Channel Estimation Based on Blind Interference Cancellation for Two-Way MIMO Relay Networks

  • He, Xianwen;Dou, Gaoqi;Gao, Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3589-3605
    • /
    • 2018
  • In this paper, we investigate an individual channel estimation problem for multiple-input multiple-output (MIMO) two-way amplify-and-forward (AF) relay networks. To avoid self-interference during the estimation of the individual MIMO channels, a novel blind interference cancellation (BIC) approach is proposed based on an orthogonal preceding framework, where a pair of orthogonal precoding matrices is utilized at the source nodes. By designing an optimal decoding scheme, we propose to decompose the bidirectional transmission into a pair of unidirectional transmissions. Unlike most existing approaches, we make the practical assumption that the nonreciprocal MIMO channel and the mutual interference of multiple antennas are both taken into consideration. Under the precoding framework, we employ an orthogonal superimposed training strategy to obtain the individual MIMO channels. However, the AF strategy causes the noise at the terminal to be the sum of the local noise and the relay-propagated noise. To remove the relay-propagated noise during the estimation of the second-hop channel, a partial noise-nulling method is designed. We also derive a closed-form expression for the total mean square error (MSE) of the MIMO channel from which we compute the optimal power allocation. The simulation results demonstrate that the analytical and simulated curves match fully.

Frequency domain elastic full waveform inversion using the new pseudo-Hessian matrix: elastic Marmousi-2 synthetic test (향상된 슈도-헤시안 행렬을 이용한 탄성파 완전 파형역산)

  • Choi, Yun-Seok;Shin, Chang-Soo;Min, Dong-Joo
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.329-336
    • /
    • 2007
  • For scaling of the gradient of misfit function, we develop a new pseudo-Hessian matrix constructed by combining amplitude field and pseudo-Hessian matrix. Since pseudo- Hessian matrix neglects the calculation of the zero-lag auto-correlation of impulse responses in the approximate Hessian matrix, the pseudo-Hessian matrix has a limitation to scale the gradient of misfit function compared to the approximate Hessian matrix. To validate the new pseudo- Hessian matrix, we perform frequency-domain elastic full waveform inversion using this Hessian matrix. By synthetic experiments, we show that the new pseudo-Hessian matrix can give better convergence to the true model than the old one does. Furthermore, since the amplitude fields are intrinsically obtained in forward modeling procedure, we do not have to pay any extra cost to compute the new pseudo-Hessian. We think that the new pseudo-Hessian matrix can be used as an alternative of the approximate Hessian matrix of the Gauss-Newton method.

  • PDF

Achievable Rate of Beamforming Dual-hop Multi-antenna Relay Network in the Presence of a Jammer

  • Feng, Guiguo;Guo, Wangmei;Gao, Jingliang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.8
    • /
    • pp.3789-3808
    • /
    • 2017
  • This paper studies a multi-antenna wireless relay network in the presence of a jammer. In this network, the source node transmits signals to the destination node through a multi-antenna relay node which adopts the amplify-and-forward scheme, and the jammer attempts to inject additive signals on all antennas of the relay node. With the linear beamforming scheme at the relay node, this network can be modeled as an equivalent Gaussian arbitrarily varying channel (GAVC). Based on this observation, we deduce the mathematical closed-forms of the capacities for two special cases and the suboptimal achievable rate for the general case, respectively. To reduce complexity, we further propose an optimal structure of the beamforming matrix. In addition, we present a second order cone programming (SOCP)-based algorithm to efficiently compute the optimal beamforming matrix so as to maximize the transmission rate between the source and the destination when the perfect channel state information (CSI) is available. Our numerical simulations show significant improvements of our propose scheme over other baseline ones.

Adaptive Spatial Domain FB-Predictors for Bearing Estimation (입사각 추정을 위한 적응 공간영역 FB-예측기)

  • Lee, Won-Cheol;Park, Sang-Taick;Cha, Il-Whan;Youn, Dae-Hee
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.3
    • /
    • pp.160-166
    • /
    • 1989
  • We propose adaptive algorithms computing the coefficients of spatial domain predictors. The method uses the LMS approach to compute the coefficients of the predictors realized by using the TDL(tapped-delay-line) and the ESC (escalator) structures. The predictors to be presented differ from the conventional ones in the sense that the relevant weights are updated such that the sum of the mean squared values of the forward and the backward prediction errors is minimized. Using the coefficients of such spatial domain predictors yields improved linear predictive spatial spectrums. The algorithms are applied to the problems of estimating incident angles of multiple narrow-band signals received by a linear array of sensors. Simulation results demonstrating the performances of the proposed methods are presented.

  • PDF

Numerical Analysis of Turning Performance in Waves by Considering Wave Drift Forces (파랑 표류력을 고려한 선박의 파랑 중 선회성능 해석)

  • Seo, Min-Guk;Nam, Bo Woo;Kim, Yeongyu
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.55 no.2
    • /
    • pp.103-115
    • /
    • 2018
  • This paper performs a numerical computation of ship maneuvering performance in waves. For this purpose, modular-type model (MMG (Mathematical Modeling Group) model) is adopted for maneuvering simulation and wave drift force is included in the equation of maneuvering motion. In order to compute wave drift force, two different seakeeping programs are used: AdFLOW based on Wave Green function method and SWAN based on Rankine panel method. When wave drift force is calculated using SWAN program, not only ship forward speed but also ship lateral speed are considered. By doing this, effects of lateral speed on wave drift force and maneuvering performance in waves are confirmed. The developed method is validated by comparing turning test results in regular waves with existing experimental data. Sensitivities of wave drift force on maneuvering performance are, also, checked.

Small Target Detection Method under Complex FLIR Imagery (복잡한 FLIR 영상에서의 소형 표적 탐지 기법)

  • Lee, Seung-Ik;Kim, Ju-Young;Kim, Ki-Hong;Koo, Bon-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.4
    • /
    • pp.432-440
    • /
    • 2007
  • In this paper, we propose a small target detection algorithm for FLIR image with complex background. First, we compute the motion information of target from the difference between the current frame and the created background image. However, the slow speed of target cause that it has the very low gray level value in the difference image. To improve the gray level value, we perform the local gamma correction for difference image. So, the detection index is computed by using statistical characteristics in the improved image and then we chose the lowest detection index a true target. Experimental results show that the proposed method has significantly the good detection performance.

  • PDF

Measuring the Impact of Competition on Pricing Behaviors in a Two-Sided Market

  • Kim, Minkyung;Song, Inseong
    • Asia Marketing Journal
    • /
    • v.16 no.1
    • /
    • pp.35-69
    • /
    • 2014
  • The impact of competition on pricing has been studied in the context of counterfactual merger analyses where expected optimal prices in a hypothetical monopoly are compared with observed prices in an oligopolistic market. Such analyses would typically assume static decision making by consumers and firms and thus have been applied mostly to data obtained from consumer packed goods such as cereal and soft drinks. However such static modeling approach is not suitable when decision makers are forward looking. When it comes to the markets for durable products with indirect network effects, consumer purchase decisions and firm pricing decisions are inherently dynamic as they take into account future states when making purchase and pricing decisions. Researchers need to take into account the dynamic aspects of decision making both in the consumer side and in the supplier side for such markets. Firms in a two-sided market typically subsidize one side of the market to exploit the indirect network effect. Such pricing behaviors would be more prevalent in competitive markets where firms would try to win over the battle for standard. While such qualitative expectation on the relationship between pricing behaviors and competitive structures could be easily formed, little empirical studies have measured the extent to which the distinct pricing structure in two-sided markets depends on the competitive structure of the market. This paper develops an empirical model to measure the impact of competition on optimal pricing of durable products under indirect network effects. In order to measure the impact of exogenously determined competition among firms on pricing, we compare the equilibrium prices in the observed oligopoly market to those in a hypothetical monopoly market. In computing the equilibrium prices, we account for the forward looking behaviors of consumers and supplier. We first estimate a demand function that accounts for consumers' forward-looking behaviors and indirect network effects. And then, for the supply side, the pricing equation is obtained as an outcome of the Markov Perfect Nash Equilibrium in pricing. In doing so, we utilize numerical dynamic programming techniques. We apply our model to a data set obtained from the U.S. video game console market. The video game console market is considered a prototypical case of two-sided markets in which the platform typically subsidizes one side of market to expand the installed base anticipating larger revenues in the other side of market resulting from the expanded installed base. The data consist of monthly observations of price, hardware unit sales and the number of compatible software titles for Sony PlayStation and Nintendo 64 from September 1996 to August 2002. Sony PlayStation was released to the market a year before Nintendo 64 was launched. We compute the expected equilibrium price path for Nintendo 64 and Playstation for both oligopoly and for monopoly. Our analysis reveals that the price level differs significantly between two competition structures. The merged monopoly is expected to set prices higher by 14.8% for Sony PlayStation and 21.8% for Nintendo 64 on average than the independent firms in an oligopoly would do. And such removal of competition would result in a reduction in consumer value by 43.1%. Higher prices are expected for the hypothetical monopoly because the merged firm does not need to engage in the battle for industry standard. This result is attributed to the distinct property of a two-sided market that competing firms tend to set low prices particularly at the initial period to attract consumers at the introductory stage and to reinforce their own networks and eventually finally to dominate the market.

  • PDF

Traveltime estimation of first arrivals and later phases using the modified graph method for a crustal structure analysis (지각구조 해석을 위한 수정 그래프법을 이용한 초동 및 후기 시간대 위상의 주시 추정)

  • Kubota, Ryuji;Nishiyama, Eiichiro;Murase, Kei;Kasahara, Junzo
    • Geophysics and Geophysical Exploration
    • /
    • v.12 no.1
    • /
    • pp.105-113
    • /
    • 2009
  • The interpretation of observed waveform characteristics identified in refraction and wide-angle reflection data increases confidence in the crustal structure model obtained. When calculating traveltimes and raypaths, wavefront methods on a regular grid based on graph theory are robust even with complicated structures, but basically compute only first arrivals. In this paper, we develop new algorithms to compute traveltimes and raypaths not only for first arrivals, but also for fast and later reflection arrivals, later refraction arrivals, and converted waves between P and S, using the modified wavefront method based on slowness network nodes mapped on a multi-layer model. Using the new algorithm, we can interpret reflected arrivals, Pg-later arrivals, strong arrivals appearing behind Pn, triplicated Moho reflected arrivals (PmP) to obtain the shape of the Moho, and phases involving conversion between P and S. Using two models of an ocean-continent transition zone and an oceanic ridge or seamount, we show the usefulness of this algorithm, which is confirmed by synthetic seismograms using the 2D Finite Difference Method (2D-FDM). Characteristics of arrivals and raypaths of the two models differ from each other in that using only first-arrival traveltime data for crustal structure analysis involves risk of erroneous interpretation in the ocean-continent transition zone, or the region around a ridge or seamount.