876 resultados para Quantified Reflective Logic
Resumo:
The atomic force microscope is not only a very convenient tool for studying the topography of different samples, but it can also be used to measure specific binding forces between molecules. For this purpose, one type of molecule is attached to the tip and the other one to the substrate. Approaching the tip to the substrate allows the molecules to bind together. Retracting the tip breaks the newly formed bond. The rupture of a specific bond appears in the force-distance curves as a spike from which the binding force can be deduced. In this article we present an algorithm to automatically process force-distance curves in order to obtain bond strength histograms. The algorithm is based on a fuzzy logic approach that permits an evaluation of "quality" for every event and makes the detection procedure much faster compared to a manual selection. In this article, the software has been applied to measure the binding strength between tubuline and microtubuline associated proteins.
Resumo:
The crack and seat (C & S) method of rehabilitating concrete pavements has been proposed to reduce the incidence of reflective cracking in asphalt overlays. These cracked pieces help reduce the thermal effects on lateral joint movement while the seating of slab pieces reduces vertical movement. This 1986 project demonstrated that a 0.6 m x 0.9 m (2 ft x 3 ft) cracking pattern was optimal to retard reflective cracking in an asphalt overlay. The best performance among three C & S test sections was section 4 with a 0.6 m x 0.9 m (2 ft x 3 ft) cracking pattern and 7.6 cm (3 in) overlay. Structural ratings determined from the Road Rater™ indicated little difference between each C & S section with varying AC thicknesses and crack spacings. Although reflection cracking is reduced in the early years after construction, the effectiveness of the C & S method diminishes over time.
Resumo:
The Electro-Reflective Measuring Apparatus (ERMA) was developed by the Minnesota Department of Highways in 1974 to measure the retro-reflective characteristics of pavement marking materials. Minnesota researchers recommended that due to the increased cost of pavement marking materials and reduced availability of these materials, ERMA can and should be used as a maintenance management tool to determine when painting is necessary rather than according to a fixed time schedule. The Iowa DOT Office of Materials built an ERMA device patterned after Minnesota's design in 1976. Subsequent efforts to calibrate and correlate this ERMA device to District Paint Foremen ratings proved unsuccessful, and ERMA modification or abandonment was recommended in 1979. Lyman Moothart, Materials Lab. Tech. 4, modified the ERMA device in 1980 and correlation attempts to District Paint Foremen ratings conducted in November 1980 have been moderately successful. A Paint/No Paint ERMA value has been established which will identify about 90% of the painting needs but will also include about 40% of the marking lines not needing repainting. The Office of Maintenance should establish a trial ERMA program to study the accuracy and potential cost savings of using ERMA to identify pavement marking needs.
Resumo:
Reflective cracks form in pavements when hot-mix asphalt (HMA) overlays are placed over jointed and/or severely cracked rigid and flexible pavements. In the first part of the research, survival analysis was conducted to identify the most appropriate rehabilitation method for composite pavements and to evaluate the influence of different factors on reflective crack development. Four rehabilitation methods, including mill and fill, overlay, heater scarification (SCR), and rubblization, were analyzed using three performance indicators: reflective cracking, international roughness index (IRI), and pavement condition index (PCI). It was found that rubblization can significantly retard reflective cracking development compared to the other three methods. No significant difference for PCI was seen among the four rehabilitation methods. Heater scarification showed the lowest survival probability for both reflective cracking and IRI, while an overlay resulted in the poorest overall pavement condition based on PCI. In addition, traffic level was found not to be a significant factor for reflective cracking development. An increase in overlay thickness can significantly delay the propagation of reflective cracking for all four treatments. Soil types in rubblization pavement sites were assessed, and no close relationship was found between rubblized pavement performance and subgrade soil condition. In the second part of the research, the study objective was to evaluate the modulus and performance of four reflective cracking treatments: full rubblization, modified rubblization, crack and seat, and rock interlayer. A total of 16 pavement sites were tested by the surface wave method (SWM), and in the first four sites both falling weight deflectometer (FWD) and SWM were conducted for a preliminary analysis. The SWM gave close concrete layer moduli compared to the FWD moduli on a conventional composite pavement. However, the SWM provided higher moduli for the rubblized concrete layer. After the preliminary analysis, another 12 pavement sites were tested by the SWM. The results showed that the crack and seat method provided the highest moduli, followed by the modified rubblization method. The full rubblization and the rock interlayer methods gave similar, but lower, moduli. Pavement performance surveys were also conducted during the field study. In general, none of the pavement sites had rutting problems. The conventional composite pavement site had the largest amount of reflective cracking. A moderate amount of reflective cracking was observed for the two pavement sites with full rubblization. Pavements with the rock interlayer and modified rubblization treatments had much less reflective cracking. It is recommended that use of the modified rubblization and rock interlayer treatments for reflective cracking mitigation are best.
Resumo:
A table showing a comparison and classification of tools (intelligent tutoring systems) for e-learning of Logic at a college level.
Resumo:
Voltage fluctuations caused by parasitic impedances in the power supply rails of modern ICs are a major concern in nowadays ICs. The voltage fluctuations are spread out to the diverse nodes of the internal sections causing two effects: a degradation of performances mainly impacting gate delays anda noisy contamination of the quiescent levels of the logic that drives the node. Both effects are presented together, in thispaper, showing than both are a cause of errors in modern and future digital circuits. The paper groups both error mechanismsand shows how the global error rate is related with the voltage deviation and the period of the clock of the digital system.
Resumo:
Tutkimuksen tavoitteena oli selvittää ohjelmistotoimialan avaintekijöitä, jotka vaikuttavat yrityksen ansaintalogiikkaan sekä lisätä tietoisuutta ansaintalogiikan muodostumisesta pienissä ja keskisuurissa ohjelmistoyrityksissä. Tutkimuksen teoreettisessa osassa keskityttiin tarkastelemaan ansaintalogiikan, strategian ja liiketoimintamallin käsitteiden suhteita sekä arvioitiin toimialan osatekijöiden, hinnoitteluperiaatteiden ja ansaintamallien vaikutusta ansainnan muodostumiseen ohjelmistotoimialalla. Ohjelmistotuote ja - palveluliiketoimintaa koskien oli merkityksellistä tutkia tuotteistamisasteen ja arvoketjujen vaikutusta ansaintalogiikan muodostumisessa sekä esitellä erilaisia, tyypillisiä ohjelmistotoimialalla käytettäviä hinnoittelumenetelmiä. Työn empiirisessä osassa tarkasteltiin 23 suomalaisen ohjelmistoalan yrityksen ansaintalogiikkaa. Tiedot kerättiin haastatteluin ja analysoitiin laadullisen tutkimuksen keinoin. Tutkimustulokset korostivat ansaintalogiikan 'epämääräisyyttä' terminä mutta osoittivat, että ydinliiketoimintaan keskittyminen, tuote-, palvelu-, tai projektiliiketoiminnan osaaminen, tuotteistusaste ja kanavavalinnat ovat avaintekijöitä ansaintalogiikanmuodostumisessa. Ansaintalogiikan muodostamiseen liittyy paljon yrityksen sisäisiä ja ulkoisia haasteita sekä muutospaineita, eikä ohjelmistotoimialalla ole todennettavissa yhtä yleismaailmallista, menestyksen takaavaa ansaintalogiikkaa.
Resumo:
Fuzzy set theory and Fuzzy logic is studied from a mathematical point of view. The main goal is to investigatecommon mathematical structures in various fuzzy logical inference systems and to establish a general mathematical basis for fuzzy logic when considered as multi-valued logic. The study is composed of six distinct publications. The first paper deals with Mattila'sLPC+Ch Calculus. THis fuzzy inference system is an attempt to introduce linguistic objects to mathematical logic without defining these objects mathematically.LPC+Ch Calculus is analyzed from algebraic point of view and it is demonstratedthat suitable factorization of the set of well formed formulae (in fact, Lindenbaum algebra) leads to a structure called ET-algebra and introduced in the beginning of the paper. On its basis, all the theorems presented by Mattila and many others can be proved in a simple way which is demonstrated in the Lemmas 1 and 2and Propositions 1-3. The conclusion critically discusses some other issues of LPC+Ch Calculus, specially that no formal semantics for it is given.In the second paper the characterization of solvability of the relational equation RoX=T, where R, X, T are fuzzy relations, X the unknown one, and o the minimum-induced composition by Sanchez, is extended to compositions induced by more general products in the general value lattice. Moreover, the procedure also applies to systemsof equations. In the third publication common features in various fuzzy logicalsystems are investigated. It turns out that adjoint couples and residuated lattices are very often present, though not always explicitly expressed. Some minor new results are also proved.The fourth study concerns Novak's paper, in which Novak introduced first-order fuzzy logic and proved, among other things, the semantico-syntactical completeness of this logic. He also demonstrated that the algebra of his logic is a generalized residuated lattice. In proving that the examination of Novak's logic can be reduced to the examination of locally finite MV-algebras.In the fifth paper a multi-valued sentential logic with values of truth in an injective MV-algebra is introduced and the axiomatizability of this logic is proved. The paper developes some ideas of Goguen and generalizes the results of Pavelka on the unit interval. Our proof for the completeness is purely algebraic. A corollary of the Completeness Theorem is that fuzzy logic on the unit interval is semantically complete if, and only if the algebra of the valuesof truth is a complete MV-algebra. The Compactness Theorem holds in our well-defined fuzzy sentential logic, while the Deduction Theorem and the Finiteness Theorem do not. Because of its generality and good-behaviour, MV-valued logic can be regarded as a mathematical basis of fuzzy reasoning. The last paper is a continuation of the fifth study. The semantics and syntax of fuzzy predicate logic with values of truth in ana injective MV-algerba are introduced, and a list of universally valid sentences is established. The system is proved to be semanticallycomplete. This proof is based on an idea utilizing some elementary properties of injective MV-algebras and MV-homomorphisms, and is purely algebraic.
Resumo:
PLFC is a first-order possibilistic logic dealing with fuzzy constants and fuzzily restricted quantifiers. The refutation proof method in PLFC is mainly based on a generalized resolution rule which allows an implicit graded unification among fuzzy constants. However, unification for precise object constants is classical. In order to use PLFC for similarity-based reasoning, in this paper we extend a Horn-rule sublogic of PLFC with similarity-based unification of object constants. The Horn-rule sublogic of PLFC we consider deals only with disjunctive fuzzy constants and it is equipped with a simple and efficient version of PLFC proof method. At the semantic level, it is extended by equipping each sort with a fuzzy similarity relation, and at the syntactic level, by fuzzily “enlarging” each non-fuzzy object constant in the antecedent of a Horn-rule by means of a fuzzy similarity relation.
Resumo:
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-language level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot be expressed in the object language. One interesting alternative for solving this limitation is the use of PGL+, a possibilistic logic over Gödel logic extended with fuzzy constants. Fuzzy constants in PGL+ allow expressing disjunctive information about the unknown value of a variable, in the sense of a magnitude, modelled as a (unary) predicate. The aim of this article is twofold: firstly, we formalize DePGL+, a possibilistic defeasible logic programming language that extends P-DeLP through the use of PGL+ in order to incorporate fuzzy constants and a fuzzy unification mechanism for them. Secondly, we propose a way to handle conflicting arguments in the context of the extended framework.
Resumo:
In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable to deal with explicit uncertainty, nor with vague knowledge, as defeasibility is directly encoded in the object language. This paper presents Possibilistic Logic Programming (P-DeLP), a new logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty. Such features are formalized on the basis of PGL, a possibilistic logic based on G¨odel fuzzy logic. One of the applications of P-DeLP is providing an intelligent agent with non-monotonic, argumentative inference capabilities. In this paper we also provide a better understanding of such capabilities by defining two non-monotonic operators which model the expansion of a given program P by adding new weighed facts associated with argument conclusions and warranted literals, respectively. Different logical properties for the proposed operators are studied
Resumo:
AIMS: To investigate and quantify the clinical benefits of early versus delayed application of Thomas splints in patients with isolated femur shaft fractures. MATERIALS AND METHODS: Level IV retrospective clinical and radiological analysis of patients presenting from January to December 2012 at a Level 1 Trauma Unit. All skeletally mature patients with isolated femur shaft fractures independently of their mechanism of injury were included. Exclusion criteria were: ipsilateral fracture of the lower limb, neck and supracondylar femur fractures, periprosthetic and incomplete fractures. Their clinical records were analysed for blood transfusion requirements, pulmonary complications, surgery time, duration of hospital stay and analgesic requirements. RESULTS: A total of 106 patients met our inclusion criteria. There were 74 males and 32 females. Fifty seven (54%) patients were in the 'early splinted' group and 49 patients (46%) were in the 'delayed splinted' group (P>0.05). The need for blood transfusion was significantly reduced in the 'early splinted' group (P=0.04). There was a significantly higher rate of pulmonary complications in the 'delayed splinted' group (P=0.008). All other parameters were similar between the two groups. CONCLUSION: The early application of Thomas splints for isolated femur fractures in non-polytraumatised patients has a clinically and statistically significant benefit of reducing the need for blood transfusions and the incidence of pulmonary complications.