• Title/Summary/Keyword: bounded real

Search Result 191, Processing Time 0.023 seconds

On Paranormed Type Fuzzy Real Valued Class of Sequences 2F(p)

  • Sen, Mausumi;Roy, Santanu
    • Kyungpook Mathematical Journal
    • /
    • v.51 no.3
    • /
    • pp.345-352
    • /
    • 2011
  • In this article we introduce the fuzzy real valued double sequence spaces $_2{\ell}^F$ (p) where p = ($p_{nk}$) is a double sequence of bounded strictly positive numbers. We study their different properties like completeness, solidness, symmetricity, convergence free etc. We prove some inclusion results also.

Techniques to Guarantee Real-Time Fault Recovery in Spark Streaming Based Cloud System (Spark Streaming 기반 클라우드 시스템에서 실시간 고장 복구를 지원하기 위한 기법들)

  • Kim, Jungho;Park, Daedong;Kim, Sangwook;Moon, Yongshik;Hong, Seongsoo
    • Journal of KIISE
    • /
    • v.44 no.5
    • /
    • pp.460-468
    • /
    • 2017
  • In a real-time cloud environment, the data analysis framework plays a pivotal role. Spark Streaming meets most real-time requirements among existing frameworks. However, the framework does not meet the second scale real-time fault recovery requirement. Spark Streaming fault recovery time increases in proportion to the transformation history length called lineage. This is because it recovers the last state data based on the cumulative lineage recorded during normal operation. Therefore, fault recovery time is not bounded within a limited time. In addition, it is impossible to achieve a second-scale fault recovery time because it costs tens of seconds to read initial state data from fault-tolerant storage. In this paper, we propose two techniques to solve the problems mentioned above. We apply the proposed techniques to Spark Streaming 1.6.2. Experimental results show that the fault recovery time is bounded and the average fault recovery time is reduced by up to 41.57%.

ON THE RECURSIVE SEQUENCE X_{n+1} = $\alpha$ - (X_n/X_n-1)

  • YAN XING XUE;LI WAN TONG;ZHAO ZHU
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.269-282
    • /
    • 2005
  • We study the global asymptotic stability, global attractivity, boundedness character, and periodic nature of all positive solutions and all negative solutions of the difference equation $$x_{n+1}\;=\;{\alpha}-{\frac{x_{n-1}}{x_{n}},\;n=0,1,\;{\cdots}$$, where ${\alpha}\;\in\; R$ is a real number, and the initial conditions $x_{-1},\;x_0$ are arbitrary real numbers.

Disturbance Attenuation for Linear Systems with Real Parametric Uncertainties (실 매개변수 불확실성을 가진 선형시스템의 외란 감소)

  • Yoo, Seog-Hwan
    • Proceedings of the KIEE Conference
    • /
    • 1994.11a
    • /
    • pp.362-365
    • /
    • 1994
  • This paper deals with the disturbance attenuation problem for linear systems with real parametric uncertainties. When there are time invariant parameter uncertainties whose sizes are bounded, a less conservative output feedback controller is constructed such that the closed loop system is asymptotically stable and achieves the prescribed disturbance attenuation level for all allowable parameter uncertainties. In order to demonstrate efficacy of the design method a numerical example is presented.

  • PDF

ON BEST CONSTANTS IN SOME MARTINGALE INEQUALITIES

  • Mok, Jin-Sik
    • Journal of applied mathematics & informatics
    • /
    • v.1 no.1
    • /
    • pp.13-20
    • /
    • 1994
  • The goal of this paper is to obtain some information on the best con-stants in some weak-type inequalities an X-valued martingale and its transform by a real predictable sequence uniformly bounded in absolute value by one.

High Level Object Oriented Real-Time Simulation Programming and Time-triggered Message-triggered Object(TMO) Scheme

  • Jeong, Chan-Joo;Na, Sang-Donh
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.6
    • /
    • pp.856-862
    • /
    • 2002
  • The object-oriented(00) distributed real-time(RT) programming movement started in1990's and is growing rapidly at this turn of the century. Distributed real-time simulation is a field in its infancy but it is bounded to receive steadily growing recognition for its importance and wide applicability. The scheme is called the distributed time-triggered simulation scheme which is conceptually simple and easy to use but widely applicable. A new generation object oriented(00) RT programming scheme is called the time-triggered message triggered object(TMO)programming scheme and it is used to make specific illustrations of the issues. The TMO structuring scheme is a general-style components structuring scheme and supports design of all types of component including hard real time objects and non real time objects within one general structure.

Multiple Rotating Priority Queue Scheduler to Meet Variable Delay Requriment in Real-Time Communication (실시간 통신에서 가변 지연을 만족하기 위한 Multiple Rotating Priority Queue Scheduler)

  • Hur, Kwon;Kim, Myung-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2543-2554
    • /
    • 2000
  • Packet schedulers for real-time communication must provide bounded delay and efficient use of network resources such as bandwidth, buffers and so on. In order to satisfy them, a large number of packet scheduling methods have been proposed. Among packet scheduling methods, an EDF (Earliest Deadline First) scheduling is the optimal one for a bounded delay service. A disadvantage of EDF scheduling is that queued packets must be sorted according to their deadlines, requiring a search operation whenever a new packet arrives at the scheduler. Although an RPQ (Rotating Priority Queue) scheduler, requiring large size of buffers, does not use such operation, it can closely approximate the schedulability of an EDF scheduler. To overcome the buffer size problem of an RPQ scheduler, this paper proposes a new scheduler named MRPQ (Multiple Rotating Priority Queue). In a MRPQ scheduler, there are several layers with a set of Queues. In a layer, Queues are configured by using a new strategy named block Queue. A MRPQ scheduler needs nearly half of buffer size required in an RPQ scheduler and produces schedulability as good as an RPQ scheduler.

  • PDF

WEAKTYPE $L^1(R^n)$-ESTIMATE FOR CRETAIN MAXIMAL OPERATORS

  • Kim, Yong-Cheol
    • Journal of the Korean Mathematical Society
    • /
    • v.34 no.4
    • /
    • pp.1029-1036
    • /
    • 1997
  • Let ${A_t)}_{t>0}$ be a dilation group given by $A_t = exp(-P log t)$, where P is a real $n \times n$ matrix whose eigenvalues has strictly positive real part. Let $\nu$ be the trace of P and $P^*$ denote the adjoint of pp. Suppose that $K$ is a function defined on $R^n$ such that $$\mid$K(x)$\mid$ \leq k($\mid$x$\mid$_Q)$ for a bounded and decreasing function $k(t) on R_+$ satisfying $k \diamond $\mid$\cdot$\mid$_Q \in \cup_{\varepsilon >0}L^1((1 + $\mid$x$\mid$)^\varepsilon dx)$ where $Q = \int_{0}^{\infty} exp(-tP^*) exp(-tP)$ dt and the norm $$\mid$\cdot$\mid$_Q$ stands for $$\mid$x$\mid$_Q = \sqrt{}, x \in R^n$. For $f \in L^1(R^n)$, define $mf(x) = sup_{t>0}$\mid$K_t * f(x)$\mid$$ where $K_t(X) = t^{-\nu}K(A_{1/t}^* x)$. Then we show that $m$ is a bounded operator of $L^1(R^n) into L^{1, \infty}(R^n)$.

  • PDF