937 resultados para Regular Closed
Resumo:
In the present study the development of bioreactors for nitrifying water in closed system hatcheries of penaeid and non-penaeid prawns. This work is an attempt in this direction to cater to the needs of aquaculture industry for treatment and remediation of ammonia and nitrate in penaeid and non-penaeid hatcheries, by developing nitrifying bacteria allochthonous to the particular environment under consideration, and immobilizing them on an appropriately designed support materials configured as reactors. Ammonia toxicity is the major limiting factors in penaeid and non-penaeid hatchery systems causing lethal and sublethal effects on larvae depending on the pH values. Pressing need of the aquaculture industry to have a user friendly and economically viable technology for the removal of ammonia, which can be easily integrated to the existing hatchery designs without any major changes or modifications. Only option available now is to have biological filters through which water can be circulated for the oxidation of ammonia to nitrate through nitrite by a group of chemolithotrophs known as nitrifying bacteria. Two types of bioreactors have been designed and developed. The first category named as in situ stringed bed suspended bioreactor(SBSBR) was designed for use in the larval rearing tanks to remove ammonia and nitrite during larval rearing on a continuous basis, and the other to be used for nitrifying freshly collected seawater and spent water named as ex situ packed bed bioreactior(PBBR). On employing the two reactors together , both penaeid and non-penaeid larval rearing systems can be made a closed recirculating system at least for a season. A survey of literature revealed that the in situ stringed bed suspended reactor developed here is unique in its design, fabrication and mode of application.
Resumo:
The energy of a graph G is the sum of the absolute values of its eigenvalues. In this paper, we study the energies of some classes of non-regular graphs. Also the spectrum of some non-regular graphs and their complements are discussed.
Resumo:
This thesis comprises five chapters including the introductory chapter. This includes a brief introduction and basic definitions of fuzzy set theory and its applications, semigroup action on sets, finite semigroup theory, its application in automata theory along with references which are used in this thesis. In the second chapter we defined an S-fuzzy subset of X with the extension of the notion of semigroup action of S on X to semigroup action of S on to a fuzzy subset of X using Zadeh's maximal extension principal and proved some results based on this. We also defined an S-fuzzy morphism between two S-fuzzy subsets of X and they together form a category S FSETX. Some general properties and special objects in this category are studied and finally proved that S SET and S FSET are categorically equivalent. Further we tried to generalize this concept to the action of a fuzzy semigroup on fuzzy subsets. As an application, using the above idea, we convert a _nite state automaton to a finite fuzzy state automaton. A classical automata determine whether a word is accepted by the automaton where as a _nite fuzzy state automaton determine the degree of acceptance of the word by the automaton. 1.5. Summary of the Thesis 17 In the third chapter we de_ne regular and inverse fuzzy automata, its construction, and prove that the corresponding transition monoids are regular and inverse monoids respectively. The languages accepted by an inverse fuzzy automata is an inverse fuzzy language and we give a characterization of an inverse fuzzy language. We study some of its algebraic properties and prove that the collection IFL on an alphabet does not form a variety since it is not closed under inverse homomorphic images. We also prove some results based on the fact that a semigroup is inverse if and only if idempotents commute and every L-class or R-class contains a unique idempotent. Fourth chapter includes a study of the structure of the automorphism group of a deterministic faithful inverse fuzzy automaton and prove that it is equal to a subgroup of the inverse monoid of all one-one partial fuzzy transformations on the state set. In the fifth chapter we define min-weighted and max-weighted power automata study some of its algebraic properties and prove that a fuzzy automaton and the fuzzy power automata associated with it have the same transition monoids. The thesis ends with a conclusion of the work done and the scope of further study.
Resumo:
The problem of the relevance and the usefulness of extracted association rules is of primary importance because, in the majority of cases, real-life databases lead to several thousands association rules with high confidence and among which are many redundancies. Using the closure of the Galois connection, we define two new bases for association rules which union is a generating set for all valid association rules with support and confidence. These bases are characterized using frequent closed itemsets and their generators; they consist of the non-redundant exact and approximate association rules having minimal antecedents and maximal consequences, i.e. the most relevant association rules. Algorithms for extracting these bases are presented and results of experiments carried out on real-life databases show that the proposed bases are useful, and that their generation is not time consuming.
Resumo:
In der vorliegenden Dissertation werden Systeme von parallel arbeitenden und miteinander kommunizierenden Restart-Automaten (engl.: systems of parallel communicating restarting automata; abgekürzt PCRA-Systeme) vorgestellt und untersucht. Dabei werden zwei bekannte Konzepte aus den Bereichen Formale Sprachen und Automatentheorie miteinander vescrknüpft: das Modell der Restart-Automaten und die sogenannten PC-Systeme (systems of parallel communicating components). Ein PCRA-System besteht aus endlich vielen Restart-Automaten, welche einerseits parallel und unabhängig voneinander lokale Berechnungen durchführen und andererseits miteinander kommunizieren dürfen. Die Kommunikation erfolgt dabei durch ein festgelegtes Kommunikationsprotokoll, das mithilfe von speziellen Kommunikationszuständen realisiert wird. Ein wesentliches Merkmal hinsichtlich der Kommunikationsstruktur in Systemen von miteinander kooperierenden Komponenten ist, ob die Kommunikation zentralisiert oder nichtzentralisiert erfolgt. Während in einer nichtzentralisierten Kommunikationsstruktur jede Komponente mit jeder anderen Komponente kommunizieren darf, findet jegliche Kommunikation innerhalb einer zentralisierten Kommunikationsstruktur ausschließlich mit einer ausgewählten Master-Komponente statt. Eines der wichtigsten Resultate dieser Arbeit zeigt, dass zentralisierte Systeme und nichtzentralisierte Systeme die gleiche Berechnungsstärke besitzen (das ist im Allgemeinen bei PC-Systemen nicht so). Darüber hinaus bewirkt auch die Verwendung von Multicast- oder Broadcast-Kommunikationsansätzen neben Punkt-zu-Punkt-Kommunikationen keine Erhöhung der Berechnungsstärke. Desweiteren wird die Ausdrucksstärke von PCRA-Systemen untersucht und mit der von PC-Systemen von endlichen Automaten und mit der von Mehrkopfautomaten verglichen. PC-Systeme von endlichen Automaten besitzen bekanntermaßen die gleiche Ausdrucksstärke wie Einwegmehrkopfautomaten und bilden eine untere Schranke für die Ausdrucksstärke von PCRA-Systemen mit Einwegkomponenten. Tatsächlich sind PCRA-Systeme auch dann stärker als PC-Systeme von endlichen Automaten, wenn die Komponenten für sich genommen die gleiche Ausdrucksstärke besitzen, also die regulären Sprachen charakterisieren. Für PCRA-Systeme mit Zweiwegekomponenten werden als untere Schranke die Sprachklassen der Zweiwegemehrkopfautomaten im deterministischen und im nichtdeterministischen Fall gezeigt, welche wiederum den bekannten Komplexitätsklassen L (deterministisch logarithmischer Platz) und NL (nichtdeterministisch logarithmischer Platz) entsprechen. Als obere Schranke wird die Klasse der kontextsensitiven Sprachen gezeigt. Außerdem werden Erweiterungen von Restart-Automaten betrachtet (nonforgetting-Eigenschaft, shrinking-Eigenschaft), welche bei einzelnen Komponenten eine Erhöhung der Berechnungsstärke bewirken, in Systemen jedoch deren Stärke nicht erhöhen. Die von PCRA-Systemen charakterisierten Sprachklassen sind unter diversen Sprachoperationen abgeschlossen und einige Sprachklassen sind sogar abstrakte Sprachfamilien (sogenannte AFL's). Abschließend werden für PCRA-Systeme spezifische Probleme auf ihre Entscheidbarkeit hin untersucht. Es wird gezeigt, dass Leerheit, Universalität, Inklusion, Gleichheit und Endlichkeit bereits für Systeme mit zwei Restart-Automaten des schwächsten Typs nicht semientscheidbar sind. Für das Wortproblem wird gezeigt, dass es im deterministischen Fall in quadratischer Zeit und im nichtdeterministischen Fall in exponentieller Zeit entscheidbar ist.
Resumo:
Comparing the experiences of selected Latin America and the Caribbean countries and their trajectories over the past 15 years offers rich insights into the dynamics and causes for not meeting the 2015 MDGs. They also offer clues for post-MDG strategies. Central to achieving sustainable growth are government policies able to support small and medium-sized farms and peasants, as they are crucial for the achievement of several goals, centrally: to achieve food security; to provide a sound and stable rural environment able to resist external (financial) shocks; to secure healthy food; to secure local food; and to protect vibrant and culturally rich local communities. This paper analyses and compares the most successful government policies to the least successful policies carried out over the last 15 years in selected Latin American and Caribbean countries and based on this analysis, offers strategies for more promising post-MDG politics, able to reduce poverty, reduce inequality, fight back informality, and achieve more decent work in poor countries.
Resumo:
Mesh generation is an important step inmany numerical methods.We present the “HierarchicalGraphMeshing” (HGM)method as a novel approach to mesh generation, based on algebraic graph theory.The HGM method can be used to systematically construct configurations exhibiting multiple hierarchies and complex symmetry characteristics. The hierarchical description of structures provided by the HGM method can be exploited to increase the efficiency of multiscale and multigrid methods. In this paper, the HGMmethod is employed for the systematic construction of super carbon nanotubes of arbitrary order, which present a pertinent example of structurally and geometrically complex, yet highly regular, structures. The HGMalgorithm is computationally efficient and exhibits good scaling characteristics. In particular, it scales linearly for super carbon nanotube structures and is working much faster than geometry-based methods employing neighborhood search algorithms. Its modular character makes it conducive to automatization. For the generation of a mesh, the information about the geometry of the structure in a given configuration is added in a way that relates geometric symmetries to structural symmetries. The intrinsically hierarchic description of the resulting mesh greatly reduces the effort of determining mesh hierarchies for multigrid and multiscale applications and helps to exploit symmetry-related methods in the mechanical analysis of complex structures.
Resumo:
This report explores the design and control issues associated with a brushless actuator capable of achieving extremely high torque accuracy. Models of several different motor - sensor configurations were studied to determine dynamic characteristics. A reaction torque sensor fixed to the motor stator was implemented to decouple the transmission dynamics from the sensor. This resulted in a compact actuator with higher bandwidth and precision than could be obtained with an inline or joint sensor. Testing demonstrated that closed-loop torque accuracy was within 0.1%, and the mechanical bandwidth approached 300 Hz.
Resumo:
Evolution of compositions in time, space, temperature or other covariates is frequent in practice. For instance, the radioactive decomposition of a sample changes its composition with time. Some of the involved isotopes decompose into other isotopes of the sample, thus producing a transfer of mass from some components to other ones, but preserving the total mass present in the system. This evolution is traditionally modelled as a system of ordinary di erential equations of the mass of each component. However, this kind of evolution can be decomposed into a compositional change, expressed in terms of simplicial derivatives, and a mass evolution (constant in this example). A rst result is that the simplicial system of di erential equations is non-linear, despite of some subcompositions behaving linearly. The goal is to study the characteristics of such simplicial systems of di erential equa- tions such as linearity and stability. This is performed extracting the compositional dif ferential equations from the mass equations. Then, simplicial derivatives are expressed in coordinates of the simplex, thus reducing the problem to the standard theory of systems of di erential equations, including stability. The characterisation of stability of these non-linear systems relays on the linearisation of the system of di erential equations at the stationary point, if any. The eigenvelues of the linearised matrix and the associated behaviour of the orbits are the main tools. For a three component system, these orbits can be plotted both in coordinates of the simplex or in a ternary diagram. A characterisation of processes with transfer of mass in closed systems in terms of stability is thus concluded. Two examples are presented for illustration, one of them is a radioactive decay
Resumo:
Resumen tomado de la publicación
Resumo:
Se recoge uno de los concepto más destacados de Carl Friedrich Gauss como es el polígono regular de 17 lados. Se estudian los diferentes pasos que llevan a la construcción de este polígono con los diferentes cálculos aritméticos.
Resumo:
Conocer la realidad comunicativa que se produce en el aula regular entre profesor y alumno sordo; identificar los patrones que gobiernan los diferentes estilos comunicativos del profesor y sus efectos sobre el habala del alumno; y, plantear una propuesta del modelo para el análisis y la optimización del estilo comunicativo del profesor en el aula integradora.. Primera fase: 20 profesores y 20 alumnos (16-18 años) de 20 aulas de escuelas de integración. Segunda fase: 6 profesors y 6 alumnos (3 grupo control, 3 grupo experimental) de diversos cursos de EGB, de 6 aulas de escuelas de integración. Elabora un marco teórico, expone los conceptos fundamentales de la integración del alumno sordo en nuestro pais, describe de forma global las particularidades comunicativas que suelen caracterizar a los sujetos con pérdidas auditivas, revisa las aportaciones teóricas, expone las investigaciones llevadas a cabo con anterioridad. El trabajo de investigación se divide en 2 fases: en la primera obtiene un perfil que muestra los principales parámetros de la interacción entre el profesor y el alumno sordo en el aula de integración, en la segunda fase aplica el programa de ciclo de aprendizaje al grupo experimental para modificar los parámetros observados en la anterior fase y observa las diferencias encontradas con respecto al grupo control. . Entrevistas. Cuestionario. Transcripción. Cámara de video. Prueba de la historia empleada por Rams-Pott. Cuaderno de registro. . Porcentajes. Análisis descriptivo. Análisis comparativo. Distribución de frecuencias. Sistema de codificación Clan. . Existe una relación entre las estrategias de trabajo utilizadas por el profesor con el alumno sordo y la actitud ideológica del profesor hacia la integración. El comportamiento docente observado en realción a las situaciones de reparación didáctica está vinculado a la experiencia del docente con el alumno. Ante errores de ejecución o producción las estrategias más empleadas son de tipo restrictivo y ante errores de comprensión las estrategias son más expansivas. Cualitativamente mejora el perfil interactivo de los profesores y alumnos del grupo experimental. . Es necesario poner en marcha nuevas investigaciones que respondan a las siguientes preguntas: +Cuáles son los mecanismos de adaptación del alumno a los diversos patrones interactivos mostrados por el profesor?, +Cómo influye el modelo comunicativo del profesor en el intercambio entre los compañeros oyentes y el propio sordo?.
Resumo:
Resumen basado en el de la publicación
Resumo:
Resumen basado en el de la publicación. Resumen en inglés
Resumo:
En el estudio se desarrollan tres aspectos en torno a la integraci??n del alumnado con necesidades educativas especiales (n.e.e.) con S??ndrome de Asperger. Analiza la actitud docente hacia la integraci??n del estudiantado con n.e.e. en general y con s??ndrome de Asperger, en particular, en el aula ordinaria. El trabajo se realiza en municipios de Uribe Kosta (Vizcaya). Participan en la investigaci??n, realizada mediante cuestionarios y entrevistas semiestructuradas, s??lo profesores que ten??an integrados en sus respectivas aulas alumnos con s??ndrome de Asperger o autismo de Alto Funcionamiento. Se abordan, por una parte, los cinco factores del dato cuantitativo; y, por otra, los doce ??ndices Tem??ticos del Programa Nudist vinculados al antecedente cualitativo. Todo ello desemboca en la convergencia de las dos variables consideradas. De la reordenaci??n de ambas jerarqu??as, se extraen las respectivas conclusiones.