Criticality and Universality in the Unit-Propagation Search Rule

The probability Psuccess(alpha, N) that stochastic greedy algorithms successfully solve the random SATisfiability problem is studied as a function of the ratio alpha of constraints per variable and the number N of variables. These algorithms assign variables according to the unit-propagation (UP) rule in presence of constraints involving a unique variable (1-clauses), to some heuristic (H) prescription otherwise. In the infinite N limit, Psuccess vanishes at some critical ratio alpha\_H which depends on the heuristic H. We show that the critical behaviour is determined by the UP rule only. In the case where only constraints with 2 and 3 variables are present, we give the phase diagram and identify two universality classes: the power law class, where Psuccess[alpha\_H (1+epsilon N^{-1/3}), N] ~ A(epsilon)/N^gamma; the stretched exponential class, where Psuccess[alpha\_H (1+epsilon N^{-1/3}), N] ~ exp[-N^{1/6} Phi(epsilon)]. Which class is selected depends on the characteristic parameters of input data. The critical exponent gamma is universal and calculated; the scaling functions A and Phi weakly depend on the heuristic H and are obtained from the solutions of reaction-diffusion equations for 1-clauses. Computation of some non-universal corrections allows us to match numerical results with good precision. The critical behaviour for constraints with >3 variables is given. Our results are interpreted in terms of dynamical graph percolation and we argue that they should apply to more general situations where UP is used.Comment: 30 pages, 13 figure

Coal Price Index Forecast by a New Partial Least-Squares Regression

AbstractDeviation of coal price has great influence on growth of China's economic. Daily coal price indexes in Qinhuangdao were collected. Past twenty days were used to predict next day index. The principal components of twenty days were extracted. The function between output variable and components was fitted by linear, quadratic and exponential model. This improved traditional partial least-squares regression. Traditional method such as multivariate linear regression and polynomial regression were coming into comparing with our method. Improved quadratic partial least-squares obtained the smallest relative errors in mean and variance for ten reserved indexes. Those ten errors had minimum 0.3%, median 3.3% and maximum 9.7%. The ideal forecast precision certified that quadratic partial least-squares was suitable for coal price indexes

Analytical Determination of the Attack Transient in a Clarinet With Time-Varying Blowing Pressure

This article uses a basic model of a reed instrument , known as the lossless Raman model, to determine analytically the envelope of the sound produced by the clarinet when the mouth pressure is increased gradually to start a note from silence. Using results from dynamic bifur-cation theory, a prediction of the amplitude of the sound as a function of time is given based on a few parameters quantifying the time evolution of mouth pressure. As in previous uses of this model, the predictions are expected to be qualitatively consistent with simulations using the Raman model, and observations of real instruments. Model simulations for slowly variable parameters require very high precisions of computation. Similarly, any real system, even if close to the model would be affected by noise. In order to describe the influence of noise, a modified model is developed that includes a stochastic variation of the parameters. Both ideal and stochastic models are shown to attain a minimal amplitude at the static oscillation threshold. Beyond this point, the amplitude of the oscillations increases exponentially, although some time is required before the oscillations can be observed at the '' dynamic oscillation threshold ''. The effect of a sudden interruption of the growth of the mouth pressure is also studied, showing that it usually triggers a faster growth of the oscillations

Pushdown Control-Flow Analysis of Higher-Order Programs

Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites---a property that eliminates spurious interprocedural paths. Vardoulakis and Shivers's recent formulation of CFA2 showed that it is possible (if expensive) to apply context-free methods to higher-order languages and gain the same boost in precision achieved over first-order programs. To this young body of work on context-free analysis of higher-order programs, we contribute a pushdown control-flow analysis framework, which we derive as an abstract interpretation of a CESK machine with an unbounded stack. One instantiation of this framework marks the first polyvariant pushdown analysis of higher-order programs; another marks the first polynomial-time analysis. In the end, we arrive at a framework for control-flow analysis that can efficiently compute pushdown generalizations of classical control-flow analyses.Comment: The 2010 Workshop on Scheme and Functional Programmin

Generating Function For Network Delay

In this paper correspondence between experimental data for packet delay and two theoretical types of distribution is investigated. Statistical tests have shown that only exponential distribution can be used for the description of packet delays in global network. Precision experimental data to within microseconds are gathered by means of the RIPE Test Box. Statistical verification of hypothesis has shown that distribution parameters remain constants during 500 second intervals at least. In paper cumulative distribution function and generating function for packet delay in network are in an explicit form written down, the algorithm of search of parameters of distribution is resulted.Comment: 5 pages, 4 Tables, 5 Figure