B-spline and neuro-fuzzy models design with function and derivative equalities

The design of neuro-fuzzy models is still a complex problem, as it involves not only the determination of the model parameters, but also its structure. Of special importance is the incorporation of a priori information in the design process. In this paper two known design algorithms for B-spline models will be updated to account for function and derivatives equality restrictions, which are important when the neural model is used for performing single or multi-objective optimization on-line.

Fairness and freedom : the final report of the equalities review and starting the dialogue about addressing inequality in Australia

Anti-discrimination law in Britain has been in a state of flux for the last decade. The structure of the law, its enforcement and coverage are under review and due to this activity, there has been much discussion about how best to address disadvantage and promote equality. Fairness and Freedom: The Final Report of the Equalities Review1 is one voice in that discussion.The Report is an examination of the causes of disadvantage and persistent inequality in Britain, including recommendations for addressing inequality which move beyond traditional legal approaches. The first section of this note outlines the context in which the Report was commissioned and the second section sets out the contents of the Report, including key findings and recommendations, particularly in regard to anti-discrimination law. The final section briefly discusses the relevance of this project for Australia. The limitations British anti-discrimination law has faced in attempting to eliminate systemic discrimination and inequality are similar to the problems we have experienced. It is timely to consider the proposals contained in the Report and to begin the dialogue about the future of anti-discrimination law in Australia, particularly how it could be amended to effectively address disadvantage and promote equality.

Strong fuzzy subsethood measures and strong equalities via implication functions

In this work we present the definition of strong fuzzy subsethood measure as a unifiying concept for the different notions of fuzzy subsethood that can be found in the literature. We analyze the relations of our new concept with the definitions by Kitainik ( [20]), Young ( [26]) and Sinha and Dougherty ( [23]) and we prove that the most relevant properties of the latter are preserved. We show also several construction methods. © 2014 Old City Publishing, Inc.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

A homotopy approach for stabilizing single-input systems with control structure constraints

A linear state feedback gain vector used in the control of a single input dynamical system may be constrained because of the way feedback is realized. Some examples of feedback realizations which impose constraints on the gain vector are: static output feedback, constant gain feedback for several operating points of a system, and two-controller feedback. We consider a general class of problems of stabilization of single input dynamical systems with such structural constraints and give a numerical method to solve them. Each of these problems is cast into a problem of solving a system of equalities and inequalities. In this formulation, the coefficients of the quadratic and linear factors of the closed-loop characteristic polynomial are the variables. To solve the system of equalities and inequalities, a continuous realization of the gradient projection method and a barrier method are used under the homotopy framework. Our method is illustrated with an example for each class of control structure constraint.

Conditions for the local manipulation of tripartite Gaussian states

We present the normal form of the covariance matrix for three-mode tripartite Gaussian states. By means of this result, the general form of a necessary and sufficient criterion for the possibility of a state transformation from one tripartite entangled Gaussian state to another with three modes is found. Moreover, we show that the conditions presented include not only inequalities but equalities as well.

The Use of Equality in Deduction and Knowledge Representation

This report describes a system which maintains canonical expressions for designators under a set of equalities. Substitution is used to maintain all knowledge in terms of these canonical expressions. A partial order on designators, termed the better-name relation, is used in the choice of canonical expressions. It is shown that with an appropriate better-name relation an important engineering reasoning technique, propagation of constraints, can be implemented as a special case of this substitution process. Special purpose algebraic simplification procedures are embedded such that they interact effectively with the equality system. An electrical circuit analysis system is developed which relies upon constraint propagation and algebraic simplification as primary reasoning techniques. The reasoning is guided by a better-name relation in which referentially transparent terms are preferred to referentially opaque ones. Multiple description of subcircuits are shown to interact strongly with the reasoning mechanism.

A Multiple-Context Equality-Based Reasoning System

Expert systems are too slow. This work attacks that problem by speeding up a useful system component that remembers facts and tracks down simple consequences. The redesigned component can assimilate new facts more quickly because it uses a compact, grammar-based internal representation to deal with whole classes of equivalent expressions at once. It can support faster hypothetical reasoning because it remembers the consequences of several assumption sets at once. The new design is targeted for situations in which many of the stored facts are equalities. The deductive machinery considered here supplements stored premises with simple new conclusions. The stored premises include permanently asserted facts and temporarily adopted assumptions. The new conclusions are derived by substituting equals for equals and using the properties of the logical connectives AND, Or, and NOT. The deductive system provides supporting premises for its derived conclusions. Reasoning that involves quantifiers is beyond the scope of its limited and automatic operation. The expert system of which the reasoning system is a component is expected to be responsible for overall control of reasoning.

El significado de la prosopopeya de las Leyes en el "Critón" de Platon

El objeto de este trabajo es realizar un estudio iusfilosófico sobre la aparición de las Leyes (nómoi) personificadas de Atenas en el Critón de Platón. La prosopopeya de las Leyes resulta ser un aspecto central para poder comprender la obra, ya que éstas entablan un diálogo imaginario con Sócrates en el cual instalan diversos argumentos filosóficos para fundamentar la autoridad de la pólis. A los fines de identificar el valor argumentativo de este recurso en la obra, analizaré el significado del nómos en la Atenas del siglo V a. C. y la naturaleza de las Leyes en el contexto general del diálogo. Se busca demostrar la importancia que tienen aquéllas para explicar la decisión de Sócrates de beber la cicuta.

The first group (co)homology of a group G with coefficients in some G-modules

Let G be a group. We give some formulas for the first group homology and cohomology of a group G with coefficients in an arbitrary G-module (Z) over tilde. More explicit calculations are done in the special cases of free groups, abelian groups and nilpotent groups. We also perform calculations for certain G-module M, by reducing it to the case where the coefficient is a G-module (Z) over tilde. As a result of the well known equalities H-1(X, M) = H-1(pi(1)(X), M) and H-1(X, M) = H-1(pi(1) (X), M), for any G-module M, we are able to calculate the first homology and cohomology groups of topological spaces with certain local system of coefficients.

Revealing Australia’s Underground Economy

This study, using currency demand model, finds Australia’s underground economy to be around 2 to 3 per cent of gross domestic product. We extend the related literature (see, inter alia, Bajada, 1999 and Breusch, 2005) in three novel ways. First, we use Austrian levels of taxes and welfare payments as the minimum levels of taxes and welfare payments. Secondly, we employ the currency demand measurement as in Cagan (1958), i.e., cash and currencies as a proportion of total money supply. Third, we use Cagan’s original assumption regarding equalities of velocities of currencies in both the legal and illegal economies in order to estimate the underground economy.

Contributions to the Theory of Optimal Tests

This paper considers tests which maximize the weighted average power (WAP). The focus is on determining WAP tests subject to an uncountable number of equalities and/or inequalities. The unifying theory allows us to obtain tests with correct size, similar tests, and unbiased tests, among others. A WAP test may be randomized and its characterization is not always possible. We show how to approximate the power of the optimal test by sequences of nonrandomized tests. Two alternative approximations are considered. The rst approach considers a sequence of similar tests for an increasing number of boundary conditions. This discretization allows us to implement the WAP tests in practice. The second method nds a sequence of tests which approximate the WAP test uniformly. This approximation allows us to show that WAP similar tests are admissible. The theoretical framework is readily applicable to several econometric models, including the important class of the curved-exponential family. In this paper, we consider the instrumental variable model with heteroskedastic and autocorrelated errors (HAC-IV) and the nearly integrated regressor model. In both models, we nd WAP similar and (locally) unbiased tests which dominate other available tests.

Fluxo de potência ótimo reativo via método da função lagrangiana barreira modificada

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)