933 resultados para non-trivial data structures


Relevância:

100.00% 100.00%

Publicador:

Resumo:

The present investigation on the Muvattupuzha river basin is an integrated approach based on hydrogeological, geophysical, hydrogeochemical parameters and the results are interpreted using satellite data. GIS also been used to combine the various spatial and non-spatial data. The salient finding of the present study are accounted below to provide a holistic picture on the groundwaters of the Muvattupuzha river basin. In the Muvattupuzha river basin the groundwaters are drawn from the weathered and fractured zones. The groundwater level fluctuations of the basin from 1992 to 2001 reveal that the water level varies between a minimum of 0.003 m and a maximum of 3.45 m. The groundwater fluctuation is affected by rainfall. Various aquifer parameters like transmissivity, storage coefficient, optimum yield, time for full recovery and specific capacity indices are analyzed. The depth to the bedrock of the basin varies widely from 1.5 to 17 mbgl. A ground water prospective map of phreatic aquifer has been prepared based on thickness of the weathered zone and low resistivity values (<500 ohm-m) and accordingly the basin is classified in three phreatic potential zones as good, moderate and poor. The groundwater of the Muvattupuzha river basin, the pH value ranges from 5.5 to 8.1, in acidic nature. Hydrochemical facies diagram reveals that most of the samples in both the seasons fall in mixing and dissolution facies and a few in static and dynamic natures. Further study is needed on impact of dykes on the occurrence and movement of groundwater, impact of seapages from irrigation canals on the groundwater quality and resources of this basin, and influence of inter-basin transfer of surface water on groundwater.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

A graphs G is clique irreducible if every clique in G of size at least two,has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irreducibility and clique irreducibility of graphs which are non-complete extended p-sums (NEPS) of two graphs are studied. We prove that if G(c) has at least two non-trivial components then G is clique vertex reducible and if it has at least three non-trivial components then G is clique reducible. The cographs and the distance hereditary graphs which are clique vertex irreducible and clique irreducible are also recursively characterized.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This thesis summarizes the results on the studies on a syntax based approach for translation between Malayalam, one of Dravidian languages and English and also on the development of the major modules in building a prototype machine translation system from Malayalam to English. The development of the system is a pioneering effort in Malayalam language unattempted by previous researchers. The computational models chosen for the system is first of its kind for Malayalam language. An in depth study has been carried out in the design of the computational models and data structures needed for different modules: morphological analyzer , a parser, a syntactic structure transfer module and target language sentence generator required for the prototype system. The generation of list of part of speech tags, chunk tags and the hierarchical dependencies among the chunks required for the translation process also has been done. In the development process, the major goals are: (a) accuracy of translation (b) speed and (c) space. Accuracy-wise, smart tools for handling transfer grammar and translation standards including equivalent words, expressions, phrases and styles in the target language are to be developed. The grammar should be optimized with a view to obtaining a single correct parse and hence a single translated output. Speed-wise, innovative use of corpus analysis, efficient parsing algorithm, design of efficient Data Structure and run-time frequency-based rearrangement of the grammar which substantially reduces the parsing and generation time are required. The space requirement also has to be minimised

Relevância:

100.00% 100.00%

Publicador:

Resumo:

An Overview of known spatial clustering algorithms The space of interest can be the two-dimensional abstraction of the surface of the earth or a man-made space like the layout of a VLSI design, a volume containing a model of the human brain, or another 3d-space representing the arrangement of chains of protein molecules. The data consists of geometric information and can be either discrete or continuous. The explicit location and extension of spatial objects define implicit relations of spatial neighborhood (such as topological, distance and direction relations) which are used by spatial data mining algorithms. Therefore, spatial data mining algorithms are required for spatial characterization and spatial trend analysis. Spatial data mining or knowledge discovery in spatial databases differs from regular data mining in analogous with the differences between non-spatial data and spatial data. The attributes of a spatial object stored in a database may be affected by the attributes of the spatial neighbors of that object. In addition, spatial location, and implicit information about the location of an object, may be exactly the information that can be extracted through spatial data mining

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Land use is a crucial link between human activities and the natural environment and one of the main driving forces of global environmental change. Large parts of the terrestrial land surface are used for agriculture, forestry, settlements and infrastructure. Given the importance of land use, it is essential to understand the multitude of influential factors and resulting land use patterns. An essential methodology to study and quantify such interactions is provided by the adoption of land-use models. By the application of land-use models, it is possible to analyze the complex structure of linkages and feedbacks and to also determine the relevance of driving forces. Modeling land use and land use changes has a long-term tradition. In particular on the regional scale, a variety of models for different regions and research questions has been created. Modeling capabilities grow with steady advances in computer technology, which on the one hand are driven by increasing computing power on the other hand by new methods in software development, e.g. object- and component-oriented architectures. In this thesis, SITE (Simulation of Terrestrial Environments), a novel framework for integrated regional sland-use modeling, will be introduced and discussed. Particular features of SITE are the notably extended capability to integrate models and the strict separation of application and implementation. These features enable efficient development, test and usage of integrated land-use models. On its system side, SITE provides generic data structures (grid, grid cells, attributes etc.) and takes over the responsibility for their administration. By means of a scripting language (Python) that has been extended by language features specific for land-use modeling, these data structures can be utilized and manipulated by modeling applications. The scripting language interpreter is embedded in SITE. The integration of sub models can be achieved via the scripting language or by usage of a generic interface provided by SITE. Furthermore, functionalities important for land-use modeling like model calibration, model tests and analysis support of simulation results have been integrated into the generic framework. During the implementation of SITE, specific emphasis was laid on expandability, maintainability and usability. Along with the modeling framework a land use model for the analysis of the stability of tropical rainforest margins was developed in the context of the collaborative research project STORMA (SFB 552). In a research area in Central Sulawesi, Indonesia, socio-environmental impacts of land-use changes were examined. SITE was used to simulate land-use dynamics in the historical period of 1981 to 2002. Analogous to that, a scenario that did not consider migration in the population dynamics, was analyzed. For the calculation of crop yields and trace gas emissions, the DAYCENT agro-ecosystem model was integrated. In this case study, it could be shown that land-use changes in the Indonesian research area could mainly be characterized by the expansion of agricultural areas at the expense of natural forest. For this reason, the situation had to be interpreted as unsustainable even though increased agricultural use implied economic improvements and higher farmers' incomes. Due to the importance of model calibration, it was explicitly addressed in the SITE architecture through the introduction of a specific component. The calibration functionality can be used by all SITE applications and enables largely automated model calibration. Calibration in SITE is understood as a process that finds an optimal or at least adequate solution for a set of arbitrarily selectable model parameters with respect to an objective function. In SITE, an objective function typically is a map comparison algorithm capable of comparing a simulation result to a reference map. Several map optimization and map comparison methodologies are available and can be combined. The STORMA land-use model was calibrated using a genetic algorithm for optimization and the figure of merit map comparison measure as objective function. The time period for the calibration ranged from 1981 to 2002. For this period, respective reference land-use maps were compiled. It could be shown, that an efficient automated model calibration with SITE is possible. Nevertheless, the selection of the calibration parameters required detailed knowledge about the underlying land-use model and cannot be automated. In another case study decreases in crop yields and resulting losses in income from coffee cultivation were analyzed and quantified under the assumption of four different deforestation scenarios. For this task, an empirical model, describing the dependence of bee pollination and resulting coffee fruit set from the distance to the closest natural forest, was integrated. Land-use simulations showed, that depending on the magnitude and location of ongoing forest conversion, pollination services are expected to decline continuously. This results in a reduction of coffee yields of up to 18% and a loss of net revenues per hectare of up to 14%. However, the study also showed that ecological and economic values can be preserved if patches of natural vegetation are conservated in the agricultural landscape. -----------------------------------------------------------------------

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This book argues for novel strategies to integrate engineering design procedures and structural analysis data into architectural design. Algorithmic procedures that recently migrated into the architectural practice are utilized to improve the interface of both disciplines. Architectural design is predominately conducted as a negotiation process of various factors but often lacks rigor and data structures to link it to quantitative procedures. Numerical structural design on the other hand could act as a role model for handling data and robust optimization but it often lacks the complexity of architectural design. The goal of this research is to bring together robust methods from structural design and complex dependency networks from architectural design processes. The book presents three case studies of tools and methods that are developed to exemplify, analyze and evaluate a collaborative work flow.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Formal Concept Analysis allows to derive conceptual hierarchies from data tables. Formal Concept Analysis is applied in various domains, e.g., data analysis, information retrieval, and knowledge discovery in databases. In order to deal with increasing sizes of the data tables (and to allow more complex data structures than just binary attributes), conceputal scales habe been developed. They are considered as metadata which structure the data conceptually. But in large applications, the number of conceptual scales increases as well. Techniques are needed which support the navigation of the user also on this meta-level of conceptual scales. In this paper, we attack this problem by extending the set of scales by hierarchically ordered higher level scales and by introducing a visualization technique called nested scaling. We extend the two-level architecture of Formal Concept Analysis (the data table plus one level of conceptual scales) to many-level architecture with a cascading system of conceptual scales. The approach also allows to use representation techniques of Formal Concept Analysis for the visualization of thesauri and ontologies.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The starting point of our reflections is a classroom situation in grade 12 in which it was to be proved intuitively that non-trivial solutions of the differential equation f' = f have no zeros. We give a working definition of the concept of preformal proving, as well as three examples of preformal proofs. Then we furnish several such proofs of the aforesaid fact, and we analyse these proofs in detail. Finally, we draw some conclusions for mathematics in school and in teacher training.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

India’s rural women are involved in various types of work and contribute considerably to the economy. However much of their work is not systematically accounted in the official statistics. India’s governmental and non-governmental data collection agencies admit that there is an under-estimation of tribal women’s contribution as rural workers. This study describes in detail a research project that focuses on the indicators for socioeconomic development in the least developed rural villages by examining the impact of floriculture on the lives of impoverished tribal women who inhabit the harsh drylands of western India.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The magnetic properties and interactions between transition metal (TM) impurities and clusters in low-dimensional metallic hosts are studied using a first principles theoretical method. In the first part of this work, the effect of magnetic order in 3d-5d systems is addressed from the perspective of its influence on the enhancement of the magnetic anisotropy energy (MAE). In the second part, the possibility of using external electric fields (EFs) to control the magnetic properties and interactions between nanoparticles deposited at noble metal surfaces is investigated. The influence of 3d composition and magnetic order on the spin polarization of the substrate and its consequences on the MAE are analyzed for the case of 3d impurities in one- and two-dimensional polarizable hosts. It is shown that the MAE and easy- axis of monoatomic free standing 3d-Pt wires is mainly determined by the atomic spin-orbit (SO) coupling contributions. The competition between ferromagnetic (FM) and antiferromagnetic (AF) order in FePtn wires is studied in detail for n=1-4 as a function of the relative position between Fe atoms. Our results show an oscillatory behavior of the magnetic polarization of Pt atoms as a function of their distance from the magnetic impurities, which can be correlated to a long-ranged magnetic coupling of the Fe atoms. Exceptionally large variations of the induced spin and orbital moments at the Pt atoms are found as a function of concentration and magnetic order. Along with a violation of the third Hund’s rule at the Fe sites, these variations result in a non trivial behavior of the MAE. In the case of TM impurities and dimers at the Cu(111), the effects of surface charging and applied EFs on the magnetic properties and substrate-mediated magnetic interactions have been investigated. The modifications of the surface electronic structure, impurity local moments and magnetic exchange coupling as a result of the EF-induced metallic screening and charge rearrangements are analysed. In a first study, the properties of surface substitutional Co and Fe impurities are investigated as a function of the external charge per surface atom q. At large inter-impurity distances the effective magnetic exchange coupling ∆E between impurities shows RKKY-like oscillations as a function of the distance which are not significantly affected by the considered values of q. For distances r < 10 Å, important modifications in the magnitude of ∆E, involving changes from FM to AF coupling, are found depending non-monotonously on the value and polarity of q. The interaction energies are analysed from a local perspective. In a second study, the interplay between external EF effects, internal magnetic order and substrate-mediated magnetic coupling has been investigated for Mn dimers on Cu(111). Our calculations show that EF (∼ 1eV/Å) can induce a switching from AF to FM ground-state magnetic order within single Mn dimers. The relative coupling between a pair of dimers also shows RKKY-like oscillations as a function of the inter-dimer distance. Their effective magnetic exchange interaction is found to depend significantly on the magnetic order within the Mn dimers and on their relative orientation on the surface. The dependence of the substrate-mediated interaction on the magnetic state of the dimers is qualitatively explained in terms of the differences in the scattering of surface electrons. At short inter-dimer distances, the ground-state configuration is determined by an interplay between exchange interactions and EF effects. These results demonstrate that external surface charging and applied EFs offer remarkable possibilities of manipulating the sign and strength of the magnetic coupling of surface supported nanoparticles.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Linear graph reduction is a simple computational model in which the cost of naming things is explicitly represented. The key idea is the notion of "linearity". A name is linear if it is only used once, so with linear naming you cannot create more than one outstanding reference to an entity. As a result, linear naming is cheap to support and easy to reason about. Programs can be translated into the linear graph reduction model such that linear names in the program are implemented directly as linear names in the model. Nonlinear names are supported by constructing them out of linear names. The translation thus exposes those places where the program uses names in expensive, nonlinear ways. Two applications demonstrate the utility of using linear graph reduction: First, in the area of distributed computing, linear naming makes it easy to support cheap cross-network references and highly portable data structures, Linear naming also facilitates demand driven migration of tasks and data around the network without requiring explicit guidance from the programmer. Second, linear graph reduction reveals a new characterization of the phenomenon of state. Systems in which state appears are those which depend on certain -global- system properties. State is not a localizable phenomenon, which suggests that our usual object oriented metaphor for state is flawed.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

When training Support Vector Machines (SVMs) over non-separable data sets, one sets the threshold $b$ using any dual cost coefficient that is strictly between the bounds of $0$ and $C$. We show that there exist SVM training problems with dual optimal solutions with all coefficients at bounds, but that all such problems are degenerate in the sense that the "optimal separating hyperplane" is given by ${f w} = {f 0}$, and the resulting (degenerate) SVM will classify all future points identically (to the class that supplies more training data). We also derive necessary and sufficient conditions on the input data for this to occur. Finally, we show that an SVM training problem can always be made degenerate by the addition of a single data point belonging to a certain unboundedspolyhedron, which we characterize in terms of its extreme points and rays.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Starting with logratio biplots for compositional data, which are based on the principle of subcompositional coherence, and then adding weights, as in correspondence analysis, we rediscover Lewi's spectral map and many connections to analyses of two-way tables of non-negative data. Thanks to the weighting, the method also achieves the property of distributional equivalence

Relevância:

100.00% 100.00%

Publicador:

Resumo:

What is Programming? A useful definition Object Orientation (and it’s counterparts) Thinking OO Programming Blocks Variables Logic Data Structures Methods