• Title/Summary/Keyword: sum

Search Result 6,201, Processing Time 0.037 seconds

Development of An Automatic Incident Detection Model Using Wilcoxon Rank Sum Test (Wilcoxon Rank Sum Test 기법을 이용한 자동돌발상황검지 모형 개발)

  • 이상민;이승환
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.6
    • /
    • pp.81-98
    • /
    • 2002
  • 본 연구는 Wilcoxon Rank Sum Test 기법을 이용한 자동 돌발상황 검지 모형을 개발하는 것이다. 본 연구의 수행을 위하여 고속도로에 설치된 루프 차량 검지기(Loop Vehicle Detection System)에서 수집된 점유율 데이터를 사용하였다. 기존의 검지모형은 산정하기가 까다로운 임계치에 의하여 돌발상황을 검지하는 방식이었다. 반면 본 연구 모델은 위치와 시간대 교통 패턴에 관계없이 모형을 일정하게 적용하며, 지속적으로 돌발상황 지점과 상·하류의 교통패턴을 비교 검정 기법인 Wilcoxon Rank Sum Test 기법을 사용하여 돌발상황 검지를 수행하도록 하였다. 연구모형의 검증을 위한 테스트 결과 시간과 위치에 관계없이 정확하고 빠른 검지시간(돌발 상황 발생 후 2∼3분)을 가짐을 알 수 있었다. 또한 기존의 모형인 APID, DES, DELOS모형과 비교검증을 위하여 검지율 및 오보율 테스트를 수행한 결과 향상된 검지 능력(검지율 : 89.01%, 오보율 : 0.97%)을 나타남을 알 수 있었다. 그러나 압축파와 같은 유사 돌발상황이 발생되면 제대로 검지를 하지 못하는 단점을 가지고 있으며 향후 이에 대한 연구가 추가된다면 더욱 신뢰성 있는 검지모형으로 발전할 것이다.

Two-Dimensional Correlation Analysis of Sum-Frequency Vibrational Spectra of Langmuir Monolayers

  • Lee, Jonggwan;Sung, Woongmo;Kim, Doseok
    • Journal of the Optical Society of Korea
    • /
    • v.18 no.5
    • /
    • pp.558-563
    • /
    • 2014
  • Sum-frequency generation spectra of a Langmuir monolayer on water surface at varying surface areas were studied with two-dimensional correlation analysis. Upon enlarging the area/molecule of the Langmuir monolayer, the sum-frequency spectra changed reflecting the conformation change of the alkyl chains of the molecules in the monolayer. These changes stood out more clearly by employing two-dimensional correlation analysis of the above sum-frequency spectra. Features not very pronounced in the original spectra such as closely-spaced spectral bands can also be easily distinguished in the two-dimensional correlation spectra.

A Fast Block Sum Pyramid Algorithm (빠른 블록 합 피라미드 알고리즘)

  • 정수목
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.4
    • /
    • pp.11-16
    • /
    • 2003
  • In this paper, a Fast Block Sum Pyramid Algorithm (FBSPA) is presented for motion estimation in video coding. PBSPA is based on Block Sum Pyramid Algorithm(BSPA), Efficient Multilevel Successive Elimination Algorithms for Block Matching Motion Estimation, and Fast Algorithms for the Estimation of Motion Vectors. FBSPA reduces the computations for motion estimation of BSPA 29% maximally using partial distortion elimination(PDE) scheme.

  • PDF

Interactive Control of Geometric Shape Morphing based on Minkowski Sum (민코프스키 덧셈 연산에 근거한 기하 도형의 모핑 제어 방법)

  • Lee, J.-H.;Lee, J. Y.;Kim, H.;Kim, H. S.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.7 no.4
    • /
    • pp.269-279
    • /
    • 2002
  • Geometric shape morphing is an interesting geometric operation that interpolates two geometric shapes to generate in-betweens. It is well known that Minkowski operations can be used to test and build collision-free motion paths and to modify shapes in digital image processing. In this paper, we present a new geometric modeling technique to control the morphing on geometric shapes based on Minkowski sum. The basic idea develops from the linear interpolation on two geometric shapes where the traditional algebraic sum is replaced by Minkowski sum. We extend this scheme into a Bezier-like control structure with multiple control shapes, which enables the interactive control over the intermediate shapes during the morphing sequence as in the traditional CAGD curve/surface editing. Moreover, we apply the theory of blossoming to our control structure, whereby our control structure becomes even more flexible and general. In this paper, we present mathematical models of control structure, their properties, and computational issues with examples.

The Convolution Sum $\sum_{al+bm=n}{\sigma}(l){\sigma}(m)$ for (a, b) = (1, 28),(4, 7),(1, 14),(2, 7),(1, 7)

  • Alaca, Ayse;Alaca, Saban;Ntienjem, Ebenezer
    • Kyungpook Mathematical Journal
    • /
    • v.59 no.3
    • /
    • pp.377-389
    • /
    • 2019
  • We evaluate the convolution sum $W_{a,b}(n):=\sum_{al+bm=n}{\sigma}(l){\sigma}(m)$ for (a, b) = (1, 28),(4, 7),(2, 7) for all positive integers n. We use a modular form approach. We also re-evaluate the known sums $W_{1,14}(n)$ and $W_{1,7}(n)$ with our method. We then use these evaluations to determine the number of representations of n by the octonary quadratic form $x^2_1+x^2_2+x^2_3+x^2_4+7(x^2_5+x^2_6+x^2_7+x^2_8)$. Finally we express the modular forms ${\Delta}_{4,7}(z)$, ${\Delta}_{4,14,1}(z)$ and ${\Delta}_{4,14,2}(z)$ (given in [10, 14]) as linear combinations of eta quotients.

THE SUM OF SOME STRING OF CONSECUTIVE WITH A DIFFERENCE OF 2k

  • LEE, SOUNGDOUK
    • Journal of applied mathematics & informatics
    • /
    • v.37 no.3_4
    • /
    • pp.177-182
    • /
    • 2019
  • This study is about the number expressed and the number not expressed in terms of the sum of consecutive natural numbers with a difference of 2k. Since it is difficult to generalize in cases of onsecutive positive integers with a difference of 2k, the table of cases of 4, 6, 8, 10, and 12 was examined to find the normality and to prove the hypothesis through the results. Generalized guesswork through tables was made to establish and prove the hypothesis of the number of possible and impossible numbers that are to all consecutive natural numbers with a difference of 2k. Finally, it was possible to verify the possibility and impossibility of the sum of consecutive cases of 124 and 2010. It is expected to be investigated the sum of consecutive natural numbers with a difference of 2k + 1, as a future research task.

Sum-Rate Performance of A NOMA-based Two-Way Relay Approach for A Two-User Cellular Network

  • Li, Guosheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.5
    • /
    • pp.1944-1956
    • /
    • 2021
  • This paper considers a cellular two-way relay network with one base station (BS), one relay station (RS), and two users. The two users are far from the BS and no direct links exist, and the two users exchange messages with the BS via the RS. A non-orthogonal multiple access (NOMA) and network coding (NC)-based decode-and-forward (DF) two-way relaying (TWR) scheme TWR-NOMA-NC is proposed, which is able to reduce the number of channel-uses to three from four in conventional time-division multiple access (TDMA) based TWR approaches. The achievable sum-rate performance of the proposed approach is analyzed, and a closed-form expression for the sum-rate upper bound is derived. Numerical results show that the analytical sum-rate upper bound is tight, and the proposed TWR-NOMA-NC scheme significantly outperforms the TDMA-based TWR and NOMA-based one-way relaying counterparts.

Analysis of Surplus and Dficit-using Runs for Monthly Streamflow (월유출량에 대한 Run-Length의 해석)

  • Gang, Gwan-Won;An, Gyeong-Su;Kim, Yang-Su
    • Water for future
    • /
    • v.18 no.4
    • /
    • pp.317-325
    • /
    • 1985
  • In the analysis, monthly streamflow records atthe gauging station in Nakdong, Han and Geum river were used. Also, the fitness of monthly streamflow to Gamma and Long-normal distribution was tested by Kolomogorv-Smirnov test. The results obtained in this study can be summarized as follws (1) The fitness of monthly streamflow to two-parameter Gamma distribution was tested by Kolomorov-Smirnov test, which fits well to this Gamma distribution (2) The Run-length and Run-sum were simulated by the Gamma model. In this result, run-length and Run-sum of monthly streamflow were fit for Gamma model (3) The mean decreases (increases) the expected surplus (deficit) Run-Sum of the monthly streamflow. The higher the truncation level of negative Run-length and Run-sum the larger is the effect of mean.

  • PDF

Performance of ZF Precoder in Downlink Massive MIMO with Non-Uniform User Distribution

  • Kong, Chuili;Zhong, Caijun;Zhang, Zhaoyang
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.688-698
    • /
    • 2016
  • In this paper, we investigate the achievable sum rate and energy efficiency of downlink massive multiple-input multiple-output antenna systems with zero-forcing precoding, by taking into account the randomness of user locations. Specifically, we propose two types of non-uniform user distributions, namely, center-intensive user distribution and edge-intensive user distribution. Based on these user distributions, we derive novel tight lower and upper bounds on the average sum rate. In addition, the impact of user distributions on the optimal number of users maximizing the sum rate is characterized. Moreover, by adopting a realistic power consumption model which accounts for the transmit power, circuit power and signal processing power, the energy efficiency of the system is studied. In particular, closed-form solutions for the key system parameters, such as the number of antennas and the optimal transmit signal-to-noise ratio maximizing the energy efficiency, are obtained. The findings of the paper suggest that user distribution has a significant impact on the system performance: for instance, the highest average sum rate is achieved with the center-intensive user distribution, while the lowest average sum rate is obtained with the edge-intensive user distribution. Also, more users can be served with the center-intensive user distribution.

MOMENT CONVERGENCE RATES OF LIL FOR NEGATIVELY ASSOCIATED SEQUENCES

  • Fu, Ke-Ang;Hu, Li-Hua
    • Journal of the Korean Mathematical Society
    • /
    • v.47 no.2
    • /
    • pp.263-275
    • /
    • 2010
  • Let {$X_n;n\;\geq\;1$} be a strictly stationary sequence of negatively associated random variables with mean zero and finite variance. Set $S_n\;=\;{\sum}^n_{k=1}X_k$, $M_n\;=\;max_{k{\leq}n}|S_k|$, $n\;{\geq}\;1$. Suppose $\sigma^2\;=\;EX^2_1+2{\sum}^\infty_{k=2}EX_1X_k$ (0 < $\sigma$ < $\infty$). We prove that for any b > -1/2, if $E|X|^{2+\delta}$(0<$\delta$$\leq$1), then $$lim\limits_{\varepsilon\searrow0}\varepsilon^{2b+1}\sum^{\infty}_{n=1}\frac{(loglogn)^{b-1/2}}{n^{3/2}logn}E\{M_n-\sigma\varepsilon\sqrt{2nloglogn}\}_+=\frac{2^{-1/2-b}{\sigma}E|N|^{2(b+1)}}{(b+1)(2b+1)}\sum^{\infty}_{k=0}\frac{(-1)^k}{(2k+1)^{2(b+1)}}$$ and for any b > -1/2, $$lim\limits_{\varepsilon\nearrow\infty}\varepsilon^{-2(b+1)}\sum^{\infty}_{n=1}\frac{(loglogn)^b}{n^{3/2}logn}E\{\sigma\varepsilon\sqrt{\frac{\pi^2n}{8loglogn}}-M_n\}_+=\frac{\Gamma(b+1/2)}{\sqrt{2}(b+1)}\sum^{\infty}_{k=0}\frac{(-1)^k}{(2k+1)^{2b+2'}}$$, where $\Gamma(\cdot)$ is the Gamma function and N stands for the standard normal random variable.