A one-step algorithm for finding the optimum solution of the state justification problem in RTL designs using MILP

2005 ◽  
Author(s):  
Hector Navarro ◽  
Juan A. Montiel-Nelson ◽  
Javier Sosa ◽  
Jose C. Garcia
Keyword(s):  
The State ◽  
One Step ◽  
Step Algorithm ◽  
Optimum Solution

scholarly journals Price Forecasting of Mango in Varanasi Market of Uttar Pradesh

2018 ◽  
Vol 6 (2) ◽  
pp. 218-224 ◽  
Author(s):  
Ravishankar Pardhi ◽  
Rakesh Singh ◽  
Ranjit Kumar Paul
Keyword(s):  
Arima Model ◽  
Uttar Pradesh ◽  
The State ◽  
Percentage Error ◽  
Price Forecasting ◽  
Harvest Management ◽  
Alternate Bearing ◽  
Agricultural Produce ◽  
One Step ◽  
Forecasting Analysis

The study had been made to forecast the price of mango using ARIMA model in one of the major markets of Uttar Pradesh as the state ranks first position in production of mango in India. Varanasi market was selected purposively on the basis of second highest arrival market of mango in the state. Using ARIMA methodology on the monthly prices of mango collected from the Agricultural Produce Market Committee (APMC), Varanasi for the year 1993 to 2015. As the mango fruit having property of alternate bearing, only six month data from March to August was available in the market and accordingly had been used for forecasting analysis using E-views 7 software. The results revealed that the price in selected market was found to be highest during the start of the season using ARIMA (1,0,6) model, confirming the validity of model through Mean Absolute Percentage Error (MAPE). The MAPE was found to be less than 10 per cent for one step ahead forecast of year 2015. Forecasted price for the month of March was almost double than the price of other months. It indicates the necessity of adopting pre and post harvest management technologies for getting the benefit over increase in prices.

A four-node membrane element model with bending modification for one-step algorithm for bus rollover impact

2015 ◽  
Vol 32 (3) ◽  
pp. 607-620 ◽  
Author(s):  
Jingxin Na ◽  
Tong Wang ◽  
Changfeng Wu ◽  
Yakun Yan
Keyword(s):  
Engineering Application ◽  
Element Model ◽  
Bending Moments ◽  
Membrane Element ◽  
Computational Accuracy ◽  
Content Type ◽  
One Step ◽  
Internal Forces ◽  
Step Algorithm ◽  
The One

Purpose – The purpose of this paper is to propose a new four-node membrane element model with bending modification based on the equilibrium principle of element nodal internal forces and bending moments for the application of the one-step algorithm for bus rollover collision. And it can be concluded whether the proposed four-node membrane element model has practical value in engineering application or not. Design/methodology/approach – Based on the equilibrium principle of element nodal internal forces and bending moments, the paper puts forward a four-node membrane element model with bending modification. A case study on the rollover of a typical bus body section is carried out by using the one-step algorithm for bus rollover collision to verify the effectiveness of the proposed element model. Findings – For the simulation of bus rollover collision, the computational accuracy can be guaranteed, meanwhile, the calculated amount is much smaller than the shell element, and computational efficiency is improved significantly. Originality/value – The proposed four-node membrane element model is used for the simulation of bus rollover collision for the first time. It holds the advantage of high computational efficiency of membrane element, and the computational accuracy is improved as well. In conclusion, it has some practical value in engineering application.

ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS

2011 ◽  
Vol 21 (04) ◽  
pp. 461-477 ◽  
Author(s):  
NAZREEN BANU ◽  
TAISUKE IZUMI ◽  
KOICHI WADA
Keyword(s):  
Asynchronous Systems ◽  
Actual Number ◽  
Consensus Algorithms ◽  
One Step ◽  
Step Algorithm ◽  
The One

It is known that Byzantine consensus algorithms guarantee a one-step decision only in favorable situations, for instance when all processes propose the same value. Also, no one-step algorithm can support a two-step decision. In this paper, we present a novel generic one-step Byzantine algorithm, called DEX, that circumvents these impossibilities using the condition-based approach. Algorithm DEX has two distinguished features, adaptiveness and double-expedition property. Adaptiveness makes the algorithm sensitive only to the actual number of failures so that it provides fast termination for a large number of inputs when there are fewer failures (a common case in practice). The feature double-expedition property facilitates the two-step decision in addition to the one-step decision. To the best of our knowledge, the double-expedition property is a new concept introduced by this paper, and DEX is the first algorithm having such a feature. Besides, we show that our algorithm is optimal in terms of the number of processes for one-step consensus.

scholarly journals Technical note on probabilistic assessment of one-step-ahead rainfall variation by Split Markov Process

2011 ◽  
Vol 8 (1) ◽  
pp. 189-206
Author(s):  
R. Maity ◽  
D. Prasad
Keyword(s):  
Markov Process ◽  
Daily Rainfall ◽  
Rain Gauge ◽  
Technical Note ◽  
The State ◽  
Contour Plot ◽  
Probabilistic Assessment ◽  
Time Step ◽  
Rainfall Variation ◽  
One Step

Abstract. In this paper, Split Markov Process (SMP) is developed to assess one-step-ahead variation of daily rainfall at a rain gauge station. SMP is an advancement of general Markov Process (MP) and specially developed for probabilistic assessment of change in daily rainfall magnitude. The approach is based on a first-order Markov chain to simulate daily rainfall variation at a point through state/sub-state Transitional Probability Matrix (TPM). The state/sub-state TPM is based on the historical transitions from a particular state to a particular sub-state, which is the basic difference between SMP and general MP. In MP, the transition from a particular state to another state is investigated. However, in SMP, the daily rainfall magnitude is categorized into different states and change in magnitude from one temporal step to another is categorized into different sub-states for the probabilistic assessment of rainfall variation. The cumulative state/sub-state TPM is represented in a contour plot at different probability levels. The developed cumulative state/sub-state TPM is used to assess the possible range of rainfall in next time step, in a probabilistic sense. Application of SMP is investigated for daily rainfall at Khandwa station in the Nimar district of Madhya Pradesh, India. Eighty years of daily monsoon rainfall is used to develop the state/sub-state TPM and twenty years data is used to investigate its performance. It is observed that the predicted range of daily rainfall captures the actual observed rainfall with few exceptions. Overall, the assessed range, particularly the upper limit, provides a quantification possible extreme value in the next time step, which is very useful information to tackle the extreme events, such flooding, water logging etc.

scholarly journals Making pointer analysis more precise by unleashing the power of selective context sensitivity

2021 ◽  
Vol 5 (OOPSLA) ◽  
pp. 1-27
Author(s):  
Tian Tan ◽  
Yue Li ◽  
Xiaoxing Ma ◽  
Chang Xu ◽  
Yannis Smaragdakis
Keyword(s):  
State Of The Art ◽  
Context Sensitivity ◽  
The State ◽  
Pointer Analysis ◽  
Proof Of Concept ◽  
Context Sensitive ◽  
Java Programs ◽  
One Step ◽  
The Difference

Traditional context-sensitive pointer analysis is hard to scale for large and complex Java programs. To address this issue, a series of selective context-sensitivity approaches have been proposed and exhibit promising results. In this work, we move one step further towards producing highly-precise pointer analyses for hard-to-analyze Java programs by presenting the Unity-Relay framework, which takes selective context sensitivity to the next level. Briefly, Unity-Relay is a one-two punch: given a set of different selective context-sensitivity approaches, say S = S1, . . . , Sn, Unity-Relay first provides a mechanism (called Unity)to combine and maximize the precision of all components of S. When Unity fails to scale, Unity-Relay offers a scheme (called Relay) to pass and accumulate the precision from one approach Si in S to the next, Si+1, leading to an analysis that is more precise than all approaches in S. As a proof-of-concept, we instantiate Unity-Relay into a tool called Baton and extensively evaluate it on a set of hard-to-analyze Java programs, using general precision metrics and popular clients. Compared with the state of the art, Baton achieves the best precision for all metrics and clients for all evaluated programs. The difference in precision is often dramatic — up to 71% of alias pairs reported by previously-best algorithms are found to be spurious and eliminated.

Numerical Methods for Solving Dynamic Equilibrium Equations

2021 ◽  
pp. 194-214
Keyword(s):  
Numerical Methods ◽  
General Principle ◽  
Degrees Of Freedom ◽  
Dynamic Equilibrium ◽  
Continuous Media ◽  
Equilibrium Equations ◽  
Numerical Resolution ◽  
Large Size ◽  
One Step ◽  
Step Algorithm

Once the number of degrees of freedom exceeds a certain number, it would be impossible to solve the dynamic equilibrium equation manually, hence the need to switch to a numerical resolution, whose general principle is to convert a dynamic equation into a static one. We are interested, for the dynamic analysis of the structures and the continuous media, in “one-step” algorithms rather than “multi-step” one. It is mainly because the systems to be solved are of large size and that it is important to minimize the number of operations and value to be memorized to the detriment, if necessary, of precision. A “one-step” algorithm, like that of Newmark, makes it possible to calculate the solution at time tn+1, starting from the solution at time tn. In addition to the disadvantage of requiring the storage of several steps, the “multi-step” algorithms such as that of Houbolt requires a startup procedure. This chapter allows the reader to enumerate and understand different numerical method with different examples.

scholarly journals A Comparison of Standard One-Step DDA Circular Interpolators with a New Cheap Two-Step Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Leonid Moroz ◽  
Jan L. Cieśliński ◽  
Marta Stakhiv ◽  
Volodymyr Maksymovych
Keyword(s):  
One Step ◽  
Addition And Subtraction ◽  
Step Algorithm ◽  
Differential Analyzer

We present and study existing digital differential analyzer (DDA) algorithms for circle generation, including an improved two-step DDA algorithm which can be implemented solely in terms of elementary shifts, addition, and subtraction.

On a class of two-dimensional nearest-neighbour random walks

1994 ◽  
Vol 31 (A) ◽  
pp. 207-237 ◽  
Author(s):  
J. W. Cohen
Keyword(s):  
Random Walks ◽  
State Space ◽  
Generating Function ◽  
The State ◽  
Nearest Neighbour ◽  
North East ◽  
The North ◽  
One Step ◽  
Bivariate Generating Function ◽  
Positive Recurrent

For positive recurrent nearest-neighbour, semi-homogeneous random walks on the lattice {0, 1, 2, …} X {0, 1, 2, …} the bivariate generating function of the stationary distribution is analysed for the case where one-step transitions to the north, north-east and east at interior points of the state space all have zero probability. It is shown that this generating function can be represented by meromorphic functions. The construction of this representation is exposed for a variety of one-step transition vectors at the boundary points of the state space.

Sign in / Sign up

Export Citation Format

Share Document