Time-series modeling of fishery landings using ARIMA models and Fuzzy Expected Intervals software

Forecasting, using historic time-series data, has become an important tool for fisheries management. ARIMA modeling, Modeling for Optimal Forecasting techniques and Decision Support Systems based on fuzzy mathematics may be used to predict the general trend of a given fish landings time-series with increased reliability and accuracy. The present paper applies these three modeling methods to forecast anchovy fish catches landed in a given port (Thessaloniki, Greece) during 1979–2000 and hake and bonito total fish catches during 1982–2000. The paper attempts to assess the model's accuracy by comparing model results to the actual monthly fish catches of the year 2000. According to the measures of forecasting accuracy established, the best forecasting performance for anchovy was shown by the DSS model (MAPE = 28.06%, RMSE = 76.56, U-statistic = 0.67 and R² = 0.69). The optimal forecasting technique of genetic modeling improved significantly the forecasting values obtained by the selected ARIMA model. Similarly, the DSS model showed a noteworthy forecasting efficiency for the prediction of hake landings, during the year 2000 (MAPE = 2.88%, RMSE = 13.75, U-statistic = 0.19 and R² = 0.98), as compared to the other two modeling techniques. Optimal forecasting produced by combined modeling scored better than application of the simple ARIMA model. Overall, DSS results showed that the Fuzzy Expected Intervals methodology could be used as a very reliable tool for short-term predictions of fishery landings.     

Constraints propagation techniques on intervals for a guaranteed localization using redundant data

In order to estimate continuously the dynamic location of a car, dead reckoning and absolute sensors are usually merged. The models used for this fusion are non-linear and, therefore, classical tools (such as Bayesian estimation) cannot provide a guaranteed estimation. In some applications, integrity is essential and the ability to guaranty the result is a crucial point. There are bounded-error approaches that are insensitive to non-linearity. In this context, the random errors are only modeled by their maximum bounds. This paper presents a new technique to merge the data of redundant sensors with a guaranteed result based on constraints propagation techniques on real intervals. We have thus developed an approach for the fusion of the two ABS wheel encoders of the rear wheels of a car, a fiber optic gyro and a differential GPS receiver in order to estimate the absolute location of a car. Experimental results show that the precision that one can obtain is acceptable, with a guaranteed result, in comparison with an extended Kalman filter. Moreover, constraints propagation techniques are well adapted to a real-time context.     

Variations of the maximum leaf spanning tree problem for bipartite graphs

The maximum leaf spanning tree problem is known to be NP-complete. In [M.S. Rahman, M. Kaykobad, Complexities of some interesting problems on spanning trees, Inform. Process. Lett. 94 (2005) 93-97], a variation on this problem was posed. This variation restricts the problem to bipartite graphs and asks, for a fixed integer K, whether or not the graph contains a spanning tree with at least K leaves in one of the partite sets. We show not only that this problem is NP-complete, but that it remains NP-complete for planar bipartite graphs of maximum degree 4. We also consider a generalization of a related decision problem, which is known to be polynomial-time solvable. We show the problem is still polynomial-time solvable when generalized to weighted graphs.     

On maximum induced matchings in bipartite graphs

The problem of finding a maximum induced matching is known to be NP-hard in general bipartite graphs. We strengthen this result by reducing the problem to some special classes of bipartite graphs such as bipartite graphs with maximum degree 3 or C₄-free bipartite graphs. On the other hand, we describe a new polynomially solvable case for the problem in bipartite graphs which deals with a generalization of bi-complement reducible graphs.     

Using interval arithmetic for robust state feedback design

A problem of a modal P-regulator synthesis for a linear multivariable dynamical system with uncertain (interval) parameters in state space is considered. The designed regulator has to place all coefficients of the system characteristic polynomial within assigned intervals. We have developed the approach proposed earlier in Dugarova and Smagina (Avtomat. i Telemech. 11 (1990) 176) and proved a direct correlation between interval system controllability and existence of robust modal P-regulator.     

无爪图成为可遍历的一个充分条件

本文给出下列定理:设G是阶为n≥3的连通无爪图,如果对每对不同的非邻顶点x,y有2|N(x)UN(y)|+d(x)+d(y)≥2n-5,则G是可遍历的.     

Hybrid verification integrating HOL theorem proving with MDG model checking

In this paper, we describe a hybrid tool for hardware formal verification that links the HOL (higher-order logic) theorem prover and the MDG (multiway decision graphs) model checker. Our tool supports abstract datatypes and uninterpreted function symbols available in MDG, allowing the verification of high-level specifications. The hybrid tool, HOL-MDG, is based on an embedding in HOL of the grammar of the hardware modeling language, MDG-HDL, as well as an embedding of the first-order temporal logic L_mdg used to express properties for the MDG model checker. Verification with the hybrid tool is faster and more tractable than using either tools separately. We hence obtain the advantages of both verification paradigms.     

String and graph grammar characterizations of bounded regular languages

Two grammatical characterizations of the bounded regular languages are presented: one in terms of graph grammars, the other using string grammars. First it is shown that a class of state graphs recognizing the bounded regular languages can be generated by a particular second-order contextfree graph grammar. Next we call uniquely recursive a right-linear (string) grammar having at most one right-recursive production for each of its nonterminals. It is then established that the class of languages generated by uniquely recursive, sequential right-linear grammars is exactly the bounded regular languages. Some comments on the relationship between string and graph grammars are made.     

Note on the connectivity of line graphs

Let G be a connected graph with vertex set V(G), edge set E(G), vertex-connectivity κ(G) and edge-connectivity λ(G).A subset S of E(G) is called a restricted edge-cut if G−S is disconnected and each component contains at least two vertices. The restricted edge-connectivity λ₂(G) is the minimum cardinality over all restricted edge-cuts. Clearly λ₂(G)?λ(G)?κ(G).In 1969, Chartrand and Stewart have shown that

     

Letter to the editor

The maximal-cut problem for directed graphs can be defined analogously to that for the undirected case. The undirected problem is known to be NP-complete. We consider two directed variants of the problem. Depending on the definition of the value of a cut, the resulting problem for general directed graphs is either efficiently solvable or NP-complete. We show that the latter version of the problem remains NP-complete when restricted to acyclic directed graphs. Further restriction to directed trees yields an efficiently solvable problem. We present an algorithm solving the problem in time proportional to the size of the input.