• 제목/요약/키워드: Random set

검색결과 855건 처리시간 0.035초

Level-Set 방법이 적용된 Flame Hole Dynamics 모델을 통한 난류 혼합층 확산화염 모사 (Simulation of a Diffusion Flame in Turbulent Mixing Layer by the Flame Hole Dynamics Model with Level-Set Method)

  • 김준홍;정석호;안국영;김종수
    • 한국연소학회:학술대회논문집
    • /
    • 한국연소학회 2004년도 제28회 KOSCO SYMPOSIUM 논문집
    • /
    • pp.102-111
    • /
    • 2004
  • Partial quenching structure of turbulent diffusion flames in a turbulent mixing layer is investigated by the method of flame hole dynamics to develope a prediction model for the turbulent lift off. The present study is specifically aimed to remedy the problem of the stiff transition of the conditioned partial burning probability across the crossover condition by adopting level-set method which describes propagating or retreating flame front with specified propagation speed. In light of the level-set simulations with two model problems for the propagation speed, the stabilizing conditions for a turbulent lifted flame are suggested. The flame hole dynamics combined with level-set method yields a temporally evolving turbulent extinction process and its partial quenching characteristics is compared with the results of the previous model employing the flame-hole random walk mapping. The probability to encounter reacting' state, conditioned with scalar dissipation rate, demonstrated that the conditional probability has a rather gradual transition across the crossover scalar dissipation rate in contrast to the stiff transition of resulted from the flame-hole random walk mapping and could be attributed to the finite response of the flame edge propagation.

  • PDF

INVARIANT GRAPH AND RANDOM BONY ATTRACTORS

  • Fateme Helen Ghane;Maryam Rabiee;Marzie Zaj
    • 대한수학회지
    • /
    • 제60권2호
    • /
    • pp.255-271
    • /
    • 2023
  • In this paper, we deal with random attractors for dynamical systems forced by a deterministic noise. These kind of systems are modeled as skew products where the dynamics of the forcing process are described by the base transformation. Here, we consider skew products over the Bernoulli shift with the unit interval fiber. We study the geometric structure of maximal attractors, the orbit stability and stability of mixing of these skew products under random perturbations of the fiber maps. We show that there exists an open set U in the space of such skew products so that any skew product belonging to this set admits an attractor which is either a continuous invariant graph or a bony graph attractor. These skew products have negative fiber Lyapunov exponents and their fiber maps are non-uniformly contracting, hence the non-uniform contraction rates are measured by Lyapnnov exponents. Furthermore, each skew product of U admits an invariant ergodic measure whose support is contained in that attractor. Additionally, we show that the invariant measure for the perturbed system is continuous in the Hutchinson metric.

A Query Randomizing Technique for breaking 'Filter Bubble'

  • Joo, Sangdon;Seo, Sukyung;Yoon, Youngmi
    • 한국컴퓨터정보학회논문지
    • /
    • 제22권12호
    • /
    • pp.117-123
    • /
    • 2017
  • The personalized search algorithm is a search system that analyzes the user's IP, cookies, log data, and search history to recommend the desired information. As a result, users are isolated in the information frame recommended by the algorithm. This is called 'Filter bubble' phenomenon. Most of the personalized data can be deleted or changed by the user, but data stored in the service provider's server is difficult to access. This study suggests a way to neutralize personalization by keeping on sending random query words. This is to confuse the data accumulated in the server while performing search activities with words that are not related to the user. We have analyzed the rank change of the URL while conducting the search activity with 500 random query words once using the personalized account as the experimental group. To prove the effect, we set up a new account and set it as a control. We then searched the same set of queries with these two accounts, stored the URL data, and scored the rank variation. The URLs ranked on the upper page are weighted more than the lower-ranked URLs. At the beginning of the experiment, the difference between the scores of the two accounts was insignificant. As experiments continue, the number of random query words accumulated in the server increases and results show meaningful difference.

가중치 집합 최적화를 통한 효율적인 가중 무작위 패턴 생성 (Efficient Weighted Random Pattern Generation Using Weight Set Optimization)

  • 이항규;김홍식;강성호
    • 전자공학회논문지C
    • /
    • 제35C권9호
    • /
    • pp.29-37
    • /
    • 1998
  • 가중 무작위 패턴 테스트에서 적은 수의 가중 무작위 패턴을 사용하여 높은 고장 검출율을 달성하기 위해서는 최적화된 가중치 집합들을 찾아내야만 한다. 따라서 최적화된 가중치 집합을 찾아내려는 많은 연구가 행해져 왔다. 이 논문에서 결정론적인 테스트 패턴에 대한 샘플링 확률을 기반으로 하여 최적화된 가중치 집합을 효율적으로 찾는 새로운 가중치 집합 최적화 알고리듬을 제한한다. 아울러 시뮬레이션을 통해 적당한 최대해밍거리를 구하는 방법도 소개된다. ISCAS 85 벤치마크 회로에 대한 실험결과는 새로운 가중치 집합 최적화 알고리듬과 적절한 최대 해밍거리를 구하는 방법의 효율성을 뒷받침해 준다.

  • PDF

Time-Matching Poisson Multi-Bernoulli Mixture Filter For Multi-Target Tracking In Sensor Scanning Mode

  • Xingchen Lu;Dahai Jing;Defu Jiang;Ming Liu;Yiyue Gao;Chenyong Tian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권6호
    • /
    • pp.1635-1656
    • /
    • 2023
  • In Bayesian multi-target tracking, the Poisson multi-Bernoulli mixture (PMBM) filter is a state-of-the-art filter based on the methodology of random finite set which is a conjugate prior composed of Poisson point process (PPP) and multi-Bernoulli mixture (MBM). In order to improve the random finite set-based filter utilized in multi-target tracking of sensor scanning, this paper introduces the Poisson multi-Bernoulli mixture filter into time-matching Bayesian filtering framework and derive a tractable and principled method, namely: the time-matching Poisson multi-Bernoulli mixture (TM-PMBM) filter. We also provide the Gaussian mixture implementation of the TM-PMBM filter for linear-Gaussian dynamic and measurement models. Subsequently, we compare the performance of the TM-PMBM filter with other RFS filters based on time-matching method with different birth models under directional continuous scanning and out-of-order discontinuous scanning. The results of simulation demonstrate that the proposed filter not only can effectively reduce the influence of sampling time diversity, but also improve the estimated accuracy of target state along with cardinality.

INNOVATION OF SOME RANDOM FIELDS

  • Si, Si
    • 대한수학회지
    • /
    • 제35권3호
    • /
    • pp.793-802
    • /
    • 1998
  • We apply the generalization of Levy's infinitesimal equation $\delta$X(t) = $\psi$(X(s), s $\leq$ t, $Y_{t}$, t, dt), $t\in R^1$, for a random field X (C) indexed by a contour C or by a more general set. Assume that the X(C) is homogeneous in x, say of degree n, then we can appeal to the classical theory of variational calculus and to the modern theory of white noise analysis in order to discuss the innovation for the X (C.)

  • PDF

Large Deviations for random walks with time stationary random distribution function

  • Hong, Dug-Hun
    • 대한수학회지
    • /
    • 제32권2호
    • /
    • pp.279-287
    • /
    • 1995
  • Let $F$ be a set of distributions on R with the topology of weak convergence, and let $A$ be the $\sigma$-field generated by the open sets. We denote by $F_1^\infty$ the space consisting of all infinite sequence $(F_1, F_2, \cdots), F_n \in F and R_1^\infty$ the space consisting of all infinite sequences $(x_1, x_2, \cdots)$ of real numbers. Take the $\sigma$-field $F_1^\infty$ to be the smallest $\sigma$-field of subsets of $F_1^\infty$ containing all finite-dimensional rectangles and take $B_1^\infty$ to be the Borel $\sigma$-field $R_1^\infty$.

  • PDF

ACCOUNTING FOR IMPORTANCE OF VARIABLES IN MUL TI-SENSOR DATA FUSION USING RANDOM FORESTS

  • Park No-Wook;Chi Kwang-Hoon
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
    • /
    • pp.283-285
    • /
    • 2005
  • To account for the importance of variable in multi-sensor data fusion, random forests are applied to supervised land-cover classification. The random forests approach is a non-parametric ensemble classifier based on CART-like trees. Its distinguished feature is that the importance of variable can be estimated by randomly permuting the variable of interest in all the out-of-bag samples for each classifier. Supervised classification with a multi-sensor remote sensing data set including optical and polarimetric SAR data was carried out to illustrate the applicability of random forests. From the experimental result, the random forests approach could extract important variables or bands for land-cover discrimination and showed good performance, as compared with other non-parametric data fusion algorithms.

  • PDF

Eigenvalue analysis of structures with flexible random connections

  • Matheu, E.E.;Suarez, L.E.
    • Structural Engineering and Mechanics
    • /
    • 제4권3호
    • /
    • pp.277-301
    • /
    • 1996
  • A finite element model of a beam element with flexible connections is used to investigate the effect of the randomness in the stiffness values on the modal properties of the structural system. The linear behavior of the connections is described by a set of random fixity factors. The element mass and stiffness matrices are function of these random parameters. The associated eigenvalue problem leads to eigenvalues and eigenvectors which are also random variables. A second order perturbation technique is used for the solution of this random eigenproblem. Closed form expressions for the 1st and 2nd order derivatives of the element matrices with respect to the fixity factors are presented. The mean and the variance of the eigenvalues and vibration modes are obtained in terms of these derivatives. Two numerical examples are presented and the results are validated with those obtained by a Monte-Carlo simulation. It is found that an almost linear statistical relation exists between the eigenproperties and the stiffness of the connections.

A SOLUTION OF THE ORNSTEIN-UHLENBECK EQUATION

  • MOON BYUNG SOO;THOMPSON RUSSEL C.
    • Journal of applied mathematics & informatics
    • /
    • 제20권1_2호
    • /
    • pp.445-454
    • /
    • 2006
  • We describe a solution to the Ornstein-Uhlenbeck equation $\frac{dI}{dt}-\frac{1}{\tau}$I(t)=cV(t) where V(t) is a constant multiple of a Gaussian white noise. Our solution is based on a discrete set of Gaussian white noise obtained by taking sample points from a sum of single frequency harmonics that have random amplitudes, random frequencies, and random phases. Hence, it is different from the solution by the standard random walk using random numbers generated by the Box-Mueller algorithm. We prove that the power of the signal has the additive property, from which we derive that the Lyapunov characteristic exponent for our solution is positive. This compares with the solution by other methods where the noise is kept to be in an error range so that its Lyapunov exponent is negative.