نتایج جستجو برای: backward fapinv process
تعداد نتایج: 1333437 فیلتر نتایج به سال:
Compensation is a widely used concept for maintaining atomicity in both the advanced transaction models and transactional workflow systems. Some Web service protocols also adopt the compensation mechanism for failure recovery when providing transaction management. However, the compensation mechanisms used in these models or protocols are too fixed and cannot satisfy the various requirements of ...
In this paper a nonlinear backward parabolic problem in one dimensional space is considered. Using a suitable iterative algorithm, the problem is converted to a linear backward parabolic problem. For the corresponding problem, the backward finite differences method with suitable grid size is applied. It is shown that if the coefficients satisfy some special conditions, th...
Self-assembly research and practice (regardless of the scale at which it operates) often encounters three key problems (a) the forward problem, (b) the backward problem (also known as the designability problem) and (c) the yield problem [1]. The forward problem is concerned with trying to predict what the final product of the self-assembly process would be, given a set of objects, environmental...
We discuss backward error recovery for large software systems, where different subsystems may belong to essentially different application areas, like databases and process control. Examples of such systems are found in modern telecommunication, transportation, manufacturing and military applications. Such heterogeneous subsystems are naturally built according to different design "models", viz. ...
Reflection decisions on alphanumeric characters display systemic effects of disorientation, suggesting that subjects mentally rotate the stimulus to the upright (the uprighting process). However, response time also increases with increasing angular disparity between the current and preceding orientations. This occurs only when the current stimulus is brought into congruence with the preceding o...
We consider optimal stopping problems for ambiguity averse decision makers with multiple priors. In general, backward induction fails. If, however, the class of priors is time–consistent, we establish a generalization of the classical theory of optimal stopping. To this end, we develop first steps of a martingale theory for multiple priors. We define minimax (super)martingales, provide a Doob–M...
This paper presents computational studies for the traveling salesman problem with time windows by applying a bi-directional resource-bounded label correcting algorithm. Label extensions and dominance start simultaneously in both forward and backward directions: the forward direction from the starting depot and the backward direction from the terminating depot. The resultant label extension proc...
In this paper, we revisit the forward, backward and bidirectional Bahl-Cocke-Jelinek-Raviv (BCJR) soft-input soft-output (SISO) maximum a posteriori probability (MAP) decoding process of rate-1 convolutional codes. From this we establish some interesting duality properties between encoding and decoding of rate-1 convolutional codes. We observe that the forward and backward BCJR SISO MAP decoder...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید