By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated by this work, taking the obvious next step, namely to investigate constraints based on grammars higher up in the Chomsky hierarchy. We devise an arc-consistency algorithm for context-free grammars, investigate when logic combi...

The stability of learning rate in neural network identifiers and controllers is one of the challenging issues which attracts great interest from researchers of neural networks. This paper suggests adaptive gradient descent algorithm with stable learning laws for modified dynamic neural network (MDNN) and studies the stability of this algorithm. Also, stable learning algorithm for parameters of ...

We have analysed 53 square degrees of RC -band imaging data from the Red-Sequence Cluster Survey (RCS), and measured the excess correlations in the shapes of galaxies on scales out to ∼ 1.5 degrees. We separate the signal into an “E”(lensing) and “B”-mode (systematics), which allows us to study residual systematics. On scales larger than 10 arcminutes, we find no “B”-mode, suggesting that the s...

this paper studies the role of the conceptual models of the policy makers in the quality of prioritizing problems in the agenda setting stage of public policy cycle.  several factors contribute to perceiving problems, presenting clear definitions of them, prioritizing them and then problem setting in the format of agenda for policy makers. however, expecting to examine the theories of enactment...

The distribution of the allophones of /?/in certain contexts involves free variation and gradient preferences. An organized survey was conducted to elicit the judgments of 37 native Persian speakers concerning the well-formedness of /?/allophonic behavior in five different phonological positions. The results showed that the differences in judgment between the various categories are not just t...

This paper is concerned with some feasibility issues in mathematical programs with equilibrium constraints (MPECs) where additional joint constraints are present that must be satis ed by the state and design variables of the problems. We introduce su cient conditions that guarantee the feasibility of these MPECs. It turns out that these conditions also guarantee the feasibility of the quadratic...

We identify an important class of symmetries in constraint programming, arising from matrices of decision variables where rows and columns can be swapped. Whilst lexicographically ordering the rows (columns) breaks all the row (column) symmetries, lexicographically ordering both the rows and the columns fails to break all the compositions of the row and column symmetries. Nevertheless, our expe...