859 resultados para graphical attractiveness


Relevância:

10.00% 10.00%

Publicador:

Resumo:

El autor plantea la cuestión de lo significativo del lenguaje teológico a partir del concepto de experiencia en el pensamiento del cardenal Newman. Su itinerario de fe y conversión, enraizado en un diálogo personal con Dios, le ha dado tanto a su teología como a su predicación, un atractivo que trasciende su época y que puede servir de estímulo actualmente en la comunicación teológica.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The dynamic stress intensity factor history for a semi-infinite crack in an otherwise unbounded elastic body is analyzed. The crack is subjected to a pair of suddenly-applied point loadings on its faces at a distance L away from the crack tip. The exact expression for the mode I stress intensity factor as a function of time is obtained. The method of solution is based on the direct application of integral transforms, the Wiener-Hopf technique and the Cagniard-de Hoop method. Due to the existence of the characteristic length in loading this problem was long believed a knotty problem. Some features of the solutions are discussed and graphical result for numerical computation is presented.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The three-dimensional transient wave response problem is presented for an infinite elastic medium weakened by a plane crack of infinite length and finite width. Tractions are applied suddenly to the crack, which simulates the case of impact loading. The integral transforms are utilized to reduce the problem to a standard Fredholm integral equation in the Laplace transform variable and sequentially invert the Laplace transforms of the stress components by numerical inversion method. The dynamic mode I stress intensity factors at the crack tip are obtained and some numerical results are presented in graphical form.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The attractiveness of the trophic concept is that it was the first attempt at a holistic perspective on an ecosystem which met with any degree of success. Just as temperature, pressure, and volume allow one to characterize the incomprehensible multitude of particulate motions in a simple gas, the hope is that a small set of figures, such as trophic storages or trophic efficiencies, permit one to compare two ecosystems with overwhelmingly disparate complexities. Thus, if it were possible to demonstrate that an arbitrary network of ecosystem flows could be reduced to a trophic configuration, the aggregation process thus defined would become a key component of the evolving discipline of "macroscopic ecology" (see also Odum 1977 and Ulanowicz 1979).

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This assessment applies to cobia (Rachycentron canadum) located in the territorial waters of the U.S. Gulf of Mexico. Separation of the Gulf of Mexico and Atlantic Ocean is defined by the seaward extension of the Dade/Monroe county line in south Florida. Mixing of fish between the Atlantic and Gulf of Mexico occurs in the Florida Keys during winter months. Cobia annually migrate north in early spring in the Gulf to spawning grounds in the northern Gulf of Mexico, returning to the Florida Keys by winter. Catches of cobia in the Gulf of Mexico are dominated by recreational landings, accounting for nearly 90% of the total. Since 1980, the landings of cobia in the recreational fishery have remained fairly stable at around 400-600 mt with a slight peak of 1,014 mt in 1997. The recreational fishery was estimated to have landed 471 mt in 2000. The landings from the commercial fishery have shown a steady increase from 45 mt in 1980 to a peak of 120 mt in 1994, followed by a decline to 62 mt in 2000. The previous assessment of cobia occurred in 1996 using a virtual population analysis (VPA) model. For this analysis a surplus-production model (ASPIC) and a forward-projecting, age-structured population model programmed in the AD Model Builder (ADMB) software were applied to cobia data from the Gulf of Mexico. The primary data consisted of four catch-per-unit-effort (CPUE) indices derived from the Marine Recreational Fisheries Statistics Survey (MRFSS) (1981-1999), Southeast region headboat survey (1986-1999), Texas creel survey (1983-1999), and shrimp bycatch estimates (1980-1999). Length samples were available from the commercial (1983-2000) and recreational (1981-2000) fisheries. The ASPIC model applied to the cobia data provided unsatisfactory results. The ADMB model fit described the observed length composition data and fishery landings fairly well based on graphical examination of model residuals. The CPUE indices indicated some disagreement for various years, but the model fit an overall increasing trend from 1992-1997 for the MRFSS, headboat, and Texas creel indices. The shrimp bycatch CPUE was treated as a recruitment index in the model. The fit to these data followed an upward trend in recruitment from 1988-1997, but did not fit the 1994-1997 data points very well. This was likely the result of conflicting information from other data sources. Natural mortality (M) for cobia is unknown. As a result, a range of values for M from 0.2-0.4, based on longevity and growth parameters, were selected for use in the age-structured model. The choice of natural mortality appears to greatly influence the perceived status of the population. Population status as measured by spawning stock biomass in the last year relative to the value at maximum sustainable yield (SSB2000/SSBMSY), spawning stock biomass in the last year relative to virgin spawning stock biomass (SSB2000/S0), and static spawning stock biomass per recruit (SSBR) all indicate the population is either depleted, near MSY, or well above MSY depending on the choice of M. The variance estimates for these benchmarks are very large and in most cases ranges from depleted to very healthy status. The only statement that can be made with any degree of certainty about cobia in the Gulf of Mexico is that the population has increased since the 1980s. (PDF contains 61 pages)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

There is increasing awareness of aquaculture in Nigeria today for a number of reasons namely: water pollution, declining catch and the awareness of the attractiveness of aquaculture as an investment area and a pivotal point for national development. The development of aquaculture in Nigeria, requires the building up of institutions at the grassroot level and the formulation of policies and programmes for the small fishfarmer. This of course would be backed up by a sound technology generation, verification and packaging, dissemination and use programme

Relevância:

10.00% 10.00%

Publicador:

Resumo:

2nd International Conference on Education and New Learning Technologies

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This paper describes Mateda-2.0, a MATLAB package for estimation of distribution algorithms (EDAs). This package can be used to solve single and multi-objective discrete and continuous optimization problems using EDAs based on undirected and directed probabilistic graphical models. The implementation contains several methods commonly employed by EDAs. It is also conceived as an open package to allow users to incorporate different combinations of selection, learning, sampling, and local search procedures. Additionally, it includes methods to extract, process and visualize the structures learned by the probabilistic models. This way, it can unveil previously unknown information about the optimization problem domain. Mateda-2.0 also incorporates a module for creating and validating function models based on the probabilistic models learned by EDAs.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

ENGLISH: This report presents fine-scale spatial summaries of annual catch and effort information compiled by the IATTC staff. These data summaries are presented in a graphical format, and display only information collected from purse-seine vessels fishing in the eastern Pacific Ocean (EPO) during 1965-1998. Data collected from baitboat and longline vessels fishing in the EPO are not considered in this report. Equivalent data from Japanese longline vessels fishing in the EPO are presented by Uosaki and Bayliff(1999) for 1988-1992 and by' references cited in that publication for 1956-1987. SPANISH: Este informe presenta resúmenes espaciales a escala fina de información sobre captura y esfuerzo anuales compilada por el personal de la CIAT. Se presentan los resúmenes en formato gráfico, e incluyen solamente información tomada de barcos cerqueros pescando en el Océano Pacifico oriental (OPO) durante 1965-1998. No se consideran en el informe datos provenientes de barcos de camada y palangreros que pescan en el OPO. Se presentan datos equivalentes de barcos palangreros japoneses pescando en el OPO en Uosaki y Bayliff (1999) para 1988-1992 yen las referencias citadas en dicha publicación para 1956-1987. (PDF contains 104 pages.)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this time of scarce resources, coastal resource managers must find ways to prioritize conservation, land use, and restoration efforts. The Habitat Priority Planner (HPP) is a free geospatial tool created by the National Oceanic and Atmospheric Administration’s Coastal Services Center that has received wide praise for its ease of use and broad applicability to conservation strategic planning, restoration, climate change scenarios, and other natural resource management actions. Not a geographic information system (GIS) user? Don’t worry―this tool was designed to be used in a team setting. One intermediate-level GIS user can push the buttons to show quick results while a roomful of resource managers and stakeholders provide input criteria that determine the results. The Habitat Priority Planner is a toolbar for ESRI’s ArcGIS platform that is composed of three modules: Habitat Classification, Habitat Analysis, and Data Explorer. The tool calculates basic ecological statistics that are used to examine how habitats function within a landscape. The tool pre‐packages several common landscape metrics into a user‐friendly interface for intermediate GIS users. In addition, HPP allows the user to build queries interactively using a graphical interface for demonstrating criteria selections quickly in a visual manner that is useful in stakeholder interactions. Tool advocates and users include land trusts, conservation alliances, nonprofit organizations, and select National Estuarine Research Reserves and refuges of the U.S. Fish and Wildlife Service. Participants in this session will learn the basic requirements for HPP use and the multiple ways the HPP has been applied to geographies nationwide. (PDF contains 5 pages)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The dissertation is concerned with the mathematical study of various network problems. First, three real-world networks are considered: (i) the human brain network (ii) communication networks, (iii) electric power networks. Although these networks perform very different tasks, they share similar mathematical foundations. The high-level goal is to analyze and/or synthesis each of these systems from a “control and optimization” point of view. After studying these three real-world networks, two abstract network problems are also explored, which are motivated by power systems. The first one is “flow optimization over a flow network” and the second one is “nonlinear optimization over a generalized weighted graph”. The results derived in this dissertation are summarized below.

Brain Networks: Neuroimaging data reveals the coordinated activity of spatially distinct brain regions, which may be represented mathematically as a network of nodes (brain regions) and links (interdependencies). To obtain the brain connectivity network, the graphs associated with the correlation matrix and the inverse covariance matrix—describing marginal and conditional dependencies between brain regions—have been proposed in the literature. A question arises as to whether any of these graphs provides useful information about the brain connectivity. Due to the electrical properties of the brain, this problem will be investigated in the context of electrical circuits. First, we consider an electric circuit model and show that the inverse covariance matrix of the node voltages reveals the topology of the circuit. Second, we study the problem of finding the topology of the circuit based on only measurement. In this case, by assuming that the circuit is hidden inside a black box and only the nodal signals are available for measurement, the aim is to find the topology of the circuit when a limited number of samples are available. For this purpose, we deploy the graphical lasso technique to estimate a sparse inverse covariance matrix. It is shown that the graphical lasso may find most of the circuit topology if the exact covariance matrix is well-conditioned. However, it may fail to work well when this matrix is ill-conditioned. To deal with ill-conditioned matrices, we propose a small modification to the graphical lasso algorithm and demonstrate its performance. Finally, the technique developed in this work will be applied to the resting-state fMRI data of a number of healthy subjects.

Communication Networks: Congestion control techniques aim to adjust the transmission rates of competing users in the Internet in such a way that the network resources are shared efficiently. Despite the progress in the analysis and synthesis of the Internet congestion control, almost all existing fluid models of congestion control assume that every link in the path of a flow observes the original source rate. To address this issue, a more accurate model is derived in this work for the behavior of the network under an arbitrary congestion controller, which takes into account of the effect of buffering (queueing) on data flows. Using this model, it is proved that the well-known Internet congestion control algorithms may no longer be stable for the common pricing schemes, unless a sufficient condition is satisfied. It is also shown that these algorithms are guaranteed to be stable if a new pricing mechanism is used.

Electrical Power Networks: Optimal power flow (OPF) has been one of the most studied problems for power systems since its introduction by Carpentier in 1962. This problem is concerned with finding an optimal operating point of a power network minimizing the total power generation cost subject to network and physical constraints. It is well known that OPF is computationally hard to solve due to the nonlinear interrelation among the optimization variables. The objective is to identify a large class of networks over which every OPF problem can be solved in polynomial time. To this end, a convex relaxation is proposed, which solves the OPF problem exactly for every radial network and every meshed network with a sufficient number of phase shifters, provided power over-delivery is allowed. The concept of “power over-delivery” is equivalent to relaxing the power balance equations to inequality constraints.

Flow Networks: In this part of the dissertation, the minimum-cost flow problem over an arbitrary flow network is considered. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non-convex due to its nonlinear equality constraints. Under the assumption of monotonicity and convexity of the flow and cost functions, a convex relaxation is proposed, which always finds the optimal injections. A primary application of this work is in the OPF problem. The results of this work on GNF prove that the relaxation on power balance equations (i.e., load over-delivery) is not needed in practice under a very mild angle assumption.

Generalized Weighted Graphs: Motivated by power optimizations, this part aims to find a global optimization technique for a nonlinear optimization defined over a generalized weighted graph. Every edge of this type of graph is associated with a weight set corresponding to the known parameters of the optimization (e.g., the coefficients). The motivation behind this problem is to investigate how the (hidden) structure of a given real/complex valued optimization makes the problem easy to solve, and indeed the generalized weighted graph is introduced to capture the structure of an optimization. Various sufficient conditions are derived, which relate the polynomial-time solvability of different classes of optimization problems to weak properties of the generalized weighted graph such as its topology and the sign definiteness of its weight sets. As an application, it is proved that a broad class of real and complex optimizations over power networks are polynomial-time solvable due to the passivity of transmission lines and transformers.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We develop new algorithms which combine the rigorous theory of mathematical elasticity with the geometric underpinnings and computational attractiveness of modern tools in geometry processing. We develop a simple elastic energy based on the Biot strain measure, which improves on state-of-the-art methods in geometry processing. We use this energy within a constrained optimization problem to, for the first time, provide surface parameterization tools which guarantee injectivity and bounded distortion, are user-directable, and which scale to large meshes. With the help of some new generalizations in the computation of matrix functions and their derivative, we extend our methods to a large class of hyperelastic stored energy functions quadratic in piecewise analytic strain measures, including the Hencky (logarithmic) strain, opening up a wide range of possibilities for robust and efficient nonlinear elastic simulation and geometry processing by elastic analogy.

Relevância:

10.00% 10.00%

Publicador: