Otimização global topográfica aplicada a problemas de otimização com restrições de igualdade e desigualdade

Os métodos de otimização que adotam condições de otimalidade de primeira e/ou segunda ordem são eficientes e normalmente esses métodos iterativos são desenvolvidos e analisados através da análise matemática do espaço euclidiano n-dimensional, o qual tem caráter local. Esses métodos levam a algoritmos iterativos que são usados para o cálculo de minimizadores globais de uma função não linear, principalmente não-convexas e multimodais, dependendo da posição dos pontos de partida. Método de Otimização Global Topográfico é um algoritmo de agrupamento, o qual é fundamentado nos conceitos elementares da teoria dos grafos, com a finalidade de gerar bons pontos de partida para os métodos de busca local, com base nos pontos distribuídos de modo uniforme no interior da região viável. Este trabalho tem como objetivo a aplicação do método de Otimização Global Topográfica junto com um método robusto e eficaz de direções viáveis por pontos-interiores a problemas de otimização que tem restrições de igualdade e/ou desigualdade lineares e/ou não lineares, que constituem conjuntos viáveis com interiores não vazios. Para cada um destes problemas, é representado também um hiper-retângulo compreendendo cada conjunto viável, onde os pontos amostrais são gerados.

Risk-sensitivity and the mean-variance trade-off: decision making in sensorimotor control.

Numerous psychophysical studies suggest that the sensorimotor system chooses actions that optimize the average cost associated with a movement. Recently, however, violations of this hypothesis have been reported in line with economic theories of decision-making that not only consider the mean payoff, but are also sensitive to risk, that is the variability of the payoff. Here, we examine the hypothesis that risk-sensitivity in sensorimotor control arises as a mean-variance trade-off in movement costs. We designed a motor task in which participants could choose between a sure motor action that resulted in a fixed amount of effort and a risky motor action that resulted in a variable amount of effort that could be either lower or higher than the fixed effort. By changing the mean effort of the risky action while experimentally fixing its variance, we determined indifference points at which participants chose equiprobably between the sure, fixed amount of effort option and the risky, variable effort option. Depending on whether participants accepted a variable effort with a mean that was higher, lower or equal to the fixed effort, they could be classified as risk-seeking, risk-averse or risk-neutral. Most subjects were risk-sensitive in our task consistent with a mean-variance trade-off in effort, thereby, underlining the importance of risk-sensitivity in computational models of sensorimotor control.

Morphometric study and length-weight relationship of Therapon jarbua, Forsskal

The different morphometric characters of Therapon jarbua showed a linear relationship and uniformity in the various biometric measurements whereas the length-weight relationship showed a curvilinear graph. The studies also indicate that there is no significant difference, in the morphometric characters and length-weight relationship between the males and females. Ponderal index values for males and females was found to fluctuate between 1.3 to 1.5 for most of their life times with the peaks and crests appearing at different lengths for males and females.

Engineering design and mechatronics: The schemebuilder project

The paper describes the development of a software design aid for use at the conceptual stage of engineering design. It is intended for use in the design of mechatronic products but has wider potential uses. Early approaches were based on function structures and tables of options and the system that evolved allows the assembly of schemes linked by matching their input and output ports. A database of components is provided which can be accessed via different indexes and the designer can easily create and compare alternative schemes at the concept stage. A bond graph approach is used to define the interconnections between components. This allows correct port matching but also provides for future development such as constraint propagation through the design and links to simulation tools. © 1993 Springer-Verlag New York Inc.

Studies on length-weight relationship of Gerres filamentosus Cuvier from the estuaries of the southern Karnataka coast

Random samples of Gerres filamentosus Cuvier from the Netravathi-Gurpur, Mulky, Kallayanapura, Mabukala and Kundapura estuaries of the southern Karnataka Coast were collected in the years 2000, 2001 and 2002, and length-weight relationships for each estuary were derived using multiple linear regression technique with one dummy variable. Hence, combined or sex-wise length-weight relationships were obtained after testing for homogeneity and isometric growth condition of fishes for each estuary by t-test. The extent of closeness of length-weight relationships between sexes and among estuaries for different years is explained by a trend line graph. The whole process of multiple linear regression analysis with one dummy variable is a better substitute for the analysis of covariance technique.

Modular Organization in a Cell: Concepts and Applications

Network biology is conceptualized as an interdisciplinary field, lying at the intersection among graph theory, statistical mechanics and biology. Great efforts have been made to promote the concept of network biology and its various applications in life s

Scalable robustness for consensus protocols with heterogeneous dynamics

It is shown in the paper how robustness can be guaranteed for consensus protocols with heterogeneous dynamics in a scalable and decentralized way i.e. by each agent satisfying a test that does not require knowledge of the entire network. Random graph examples illustrate that the proposed certificates are not conservative for classes of large scale networks, despite the heterogeneity of the dynamics, which is a distinctive feature of this work. The conditions hold for symmetric protocols and more conservative stability conditions are given for general nonsymmetric interconnections. Nonlinear extensions in an IQC framework are finally discussed. Copyright © 2005 IFAC.

Investigation on the species diversity of Pleuronectiformes order in the Iranian coastline water of Persian Gulf

In Iranian Coastline water of Persian Gulf we researched about flat fishes and revision their Scientitic names, Investigated diversity species (Pleuronectiformes) around three provinces such as khouzestan, Bushehr and Hormozgen. The aim focuse on introducting major family and Species Identification for this Purpose 1311 Specimens collected. Then 36 investigation Parameters includes 18 Morphometric, 11 meristic, 7 distribution has been measured in Excel. The descriptive statistic in spss software would be able us to graph dendrograms by Clustering methods, then Design a standerd table and comparised all the datas with it six major family has been found in Iranian Coasline which named: Soleidae, Bothidae Paralichtidae, Cynoglossidae, Psettodidae, Citharidae. Some of the scientific species names such as Pseudorombus arsius, P. annulatus, P. elevatus, P.malayanus, P. triocellatus from Bothidae family Join it to Paralichtidae family and Eurylossa orientalis change It's name from Soleidae family to Brachirus onentalis. Cynoglossus, bilineatus, C.Puncticepts, C.durbaensis, Clachneri, one of the most Important Point that viewed in our samples, founding a new species (C.Sp) Which we couldn't identify it with all the known keys, then sent it to international Scientific references for this porpose. (Family Cynoglossidae); Pseudorombus annulatus, P. elevatus P.arsius, P.malayanus, paralichtodes algoensis, Poecilopstei Javanicus (Family paralichthidae) Arnoglossus aspilos,A.arabicits, Engyprosopon grandisquama, L.pectoralis, Pseudorombus navalensis, Psettina brevirictis (family Bothidae); Psettodes erumei (Family Psettodidae); Citharoides macrolepis (Family Citharidae) in khouzestan Brachirus orientalis, Parachirus marmoratus, solea elongata, Zebrias synapturides (Family Soleidae) Cynoglossus bilineatus, C.puncticeps, C.arel, C.kopsii, C. Capenis (Family cynoglossida); Pseudorombus arsius, P. elevatus, P. malayanus, Poecilopstei javanicus (Family Paralichthidae); Laeops guentheri, Arnoglossus aspilos, Engyprosopon grandisquama (Family Bothidae); Psettodes erumei (Family psettodidae) in Bushehr. Brachirus orientalis, Parachirus marmoratus (Family Soleidae); Cynoglossus arel, C.bilineatus, C.Puncticeps, C. lachheri (Family cynoglossidae); Pseudorombus arisus, P. elevatus, P. malayanus, Poecilopestie j avanicus (Family parlichthidae); Arnoylossus aspilos, A. arabicus, Laeopes guentheri (Family Bothidae); Psettodes erumei (Family Psettodidae); Citharoides macrolepis (Family Citharidae) In Hormozgan. Khozestan has the maximus diversity speices (26 species) and the minimum is Hormozgan (15 Speices). 13 species of five family has never reported inpersian Gulf but we identify them in our studies for the first time. We abserved 29 Species of six family in our studies, comparision between are resualts with other researches shows that this use is the most compelet study in Iranian coastline water of Persian Gulf.

Automatic object segmentation from calibrated images

This paper addresses the problem of automatically obtaining the object/background segmentation of a rigid 3D object observed in a set of images that have been calibrated for camera pose and intrinsics. Such segmentations can be used to obtain a shape representation of a potentially texture-less object by computing a visual hull. We propose an automatic approach where the object to be segmented is identified by the pose of the cameras instead of user input such as 2D bounding rectangles or brush-strokes. The key behind our method is a pairwise MRF framework that combines (a) foreground/background appearance models, (b) epipolar constraints and (c) weak stereo correspondence into a single segmentation cost function that can be efficiently solved by Graph-cuts. The segmentation thus obtained is further improved using silhouette coherency and then used to update the foreground/background appearance models which are fed into the next Graph-cut computation. These two steps are iterated until segmentation convergences. Our method can automatically provide a 3D surface representation even in texture-less scenes where MVS methods might fail. Furthermore, it confers improved performance in images where the object is not readily separable from the background in colour space, an area that previous segmentation approaches have found challenging. © 2011 IEEE.

Spatio-temporal clustering of probabilistic region trajectories

We propose a novel model for the spatio-temporal clustering of trajectories based on motion, which applies to challenging street-view video sequences of pedestrians captured by a mobile camera. A key contribution of our work is the introduction of novel probabilistic region trajectories, motivated by the non-repeatability of segmentation of frames in a video sequence. Hierarchical image segments are obtained by using a state-of-the-art hierarchical segmentation algorithm, and connected from adjacent frames in a directed acyclic graph. The region trajectories and measures of confidence are extracted from this graph using a dynamic programming-based optimisation. Our second main contribution is a Bayesian framework with a twofold goal: to learn the optimal, in a maximum likelihood sense, Random Forests classifier of motion patterns based on video features, and construct a unique graph from region trajectories of different frames, lengths and hierarchical levels. Finally, we demonstrate the use of Isomap for effective spatio-temporal clustering of the region trajectories of pedestrians. We support our claims with experimental results on new and existing challenging video sequences. © 2011 IEEE.

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

An ngram-based statistical machine translation decoder

In this paper we describe MARIE, an Ngram-based statistical machine translation decoder. It is implemented using a beam search strategy, with distortion (or reordering) capabilities. The underlying translation model is based on an Ngram approach, extended to introduce reordering at the phrase level. The search graph structure is designed to perform very accurate comparisons, what allows for a high level of pruning, improving the decoder efficiency. We report several techniques for efficiently prune out the search space. The combinatory explosion of the search space derived from the search graph structure is reduced by limiting the number of reorderings a given translation is allowed to perform, and also the maximum distance a word (or a phrase) is allowed to be reordered. We finally report translation accuracy results on three different translation tasks.

SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases

The Internet has enabled the creation of a growing number of large-scale knowledge bases in a variety of domains containing complementary information. Tools for automatically aligning these knowledge bases would make it possible to unify many sources of structured knowledge and answer complex queries. However, the efficient alignment of large-scale knowledge bases still poses a considerable challenge. Here, we present Simple Greedy Matching (SiGMa), a simple algorithm for aligning knowledge bases with millions of entities and facts. SiGMa is an iterative propagation algorithm which leverages both the structural information from the relationship graph as well as flexible similarity measures between entity properties in a greedy local search, thus making it scalable. Despite its greedy nature, our experiments indicate that SiGMa can efficiently match some of the world's largest knowledge bases with high precision. We provide additional experiments on benchmark datasets which demonstrate that SiGMa can outperform state-of-the-art approaches both in accuracy and efficiency.

Wrapping the cube and other polyhedra

An infinite series of twofold, two-way weavings of the cube, corresponding to 'wrappings', or double covers of the cube, is described with the aid of the two-parameter Goldberg- Coxeter construction. The strands of all such wrappings correspond to the central circuits (CCs) of octahedrites (four-regular polyhedral graphs with square and triangular faces), which for the cube necessarily have octahedral symmetry. Removing the symmetry constraint leads to wrappings of other eight-vertex convex polyhedra. Moreover, wrappings of convex polyhedra with fewer vertices can be generated by generalizing from octahedrites to i-hedrites, which additionally include digonal faces. When the strands of a wrapping correspond to the CCs of a four-regular graph that includes faces of size greater than 4, non-convex 'crinkled' wrappings are generated. The various generalizations have implications for activities as diverse as the construction of woven-closed baskets and the manufacture of advanced composite components of complex geometry. © 2012 The Royal Society.

Sensor graphs for guaranteed cooperative localization performance

A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of the graph of relative measurements is known to affect the steady-state value of the position error covariance matrix. Classes of sensor graphs are identified, for which tight bounds for the trace of the covariance matrix can be obtained based on the algebraic properties of the underlying relative measurement graph. The string and the star graph topologies are considered, and the explicit form of the eigenvalues of error covariance matrix is given. More general sensor graph topologies are considered as combinations of the string and star topologies, when additional edges are added. It is demonstrated how the addition of edges increases the trace of the steady-state value of the position error covariance matrix, and the theoretical predictions are verified through simulation analysis.