Search results for "Roof"

showing 10 items of 303 documents

Integrated Simulation and Formal Verification of a Simple Autonomous Vehicle

2018

This paper presents a proof-of-concept application of an approach to system development based on the integration of formal verification and co-simulation. A simple autonomous vehicle has the task of reaching an assigned straight path and then follow it, and it can be controlled by varying its turning speed. The correctness of the proposed control law has been formalized and verified by interactive theorem proving with the Prototype Verification System. Concurrently, the system has been co-simulated using the Prototype Verification System and the MathWorks Simulink tool: The vehicle kinematics have been simulated in Simulink, whereas the controller has been modeled in the logic language of t…

CorrectnessSIMPLE (military communications protocol)Computer scienceProof assistant020207 software engineeringControl engineering02 engineering and technologyFormal methods Software engineering Theorem proving Vehicles Autonomous Vehicles Control laws Integrated simulations Interactive theorem proving Logic languages Proof of concept Prototype verification systems System development020202 computer hardware & architectureAutomated theorem provingSettore ING-INF/04 - AutomaticaControl theory0202 electrical engineering electronic engineering information engineeringPrototype Verification SystemFormal verificationLogic programming
researchProduct

One-Counter Verifiers for Decidable Languages

2013

Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a proper subset of decidable languages, where the verifier is a probabilistic Turing machine. In this paper, we show that if we use architecturally restricted verifiers instead of restricting the working memory, i.e. replacing the working tape(s) with a single counter, we can define some IPS’s for each decidable language. Such verifiers are called two-way probabilistic one-counter automata (2pca’s). Then, we show that by adding a fixed-size quantum memory to a 2pca, called a two-way one-counter automaton with quantum and classical states (2qcca), the protocol can be spac…

Counter machineTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceQuantum registerComputer scienceProbabilistic Turing machineProbabilistic logicInteractive proof systemComputer Science::Computational ComplexityDecidabilityAutomatonsymbols.namesakesymbolsProtocol (object-oriented programming)
researchProduct

A Roof Tile from 1678 Found in Calasparra (Murcia) as an Abiding Medium of Writing

2017

Analysis of a red clay roof tile which bears an heretofore unknown inscription of the late 'procesal' script style and humanistic characters along with the date 1678, marking its exact year of manufacture. This tile was found on the roof of an old barn structure in ruins, located on 'Horno de Calasparra' Street (Murcia), before its demolition. We will also point out some of the more significant aspects of the historic profession of tile making, which has all but disappeared. Se expone a continuación una teja de barro cocido en cuyo lomo se observa incisa una inédita frase, presentando una escritura de tipo procesal tardío, con caracteres ya humanísticos, y una fecha, 1678, la cual marca el …

Cultural StudiesRoof tileHistoryEthnography and Social HistoryWritingmedia_common.quotation_subjectCalasparralcsh:D1-2009PalaeographyArts and Humanities (miscellaneous)MudpaleografíaescrituraHistoria etnográfica y socialmedia_commonlcsh:History (General) and history of EuropebarroArtlcsh:History (General)Roof tilePalaeographyStyle (visual arts)lcsh:Dvisual_artvisual_art.visual_art_mediumcalasparratejaTileBarnHumanitieshistoria etnográfica y socialEl Futuro del Pasado
researchProduct

La demostración matemática: problemática actual

2002

RESUMENAnalizamos la problemática actual en torno a la demostración matemática, con particular énfasis en las ideas introducidas por las demostraciones asistidas por ordenador y por la llamada matemática experimental. Examinamos además la influencia que pueden tener estas ideas sobre el concepto de demostración y proponemos una caracterización atendiendo a las diferentes funciones que puede desempeñar la demostración en su vertientes explicativa, comunicativa, sistematizadora, como incrementadora de la comprensión de resultados y como transmisora de conocimiento y convicción. Finalmente, se ofrecen algunas conclusiones sobre problemas relacionados con la intuición, la lógica, la certeza, el…

Demostración asistida por ordenadorPhilosophycuasi-empirismoConocimiento matemáticoDemostraciónMathematical proof:LÓGICA [UNESCO]HumanitiesUNESCO::LÓGICAMathematicsEpistemologyContrastes. Revista Internacional de Filosofía
researchProduct

Influence of design mistakes and material degradation on the collapse of a long-span RC roof in South Italy

2020

Abstract In 2004, during ordinary maintenance work, consisting in the waterproofing of a building located in the South of Italy, the long-span (14.50 m) in situ cast reinforced concrete (RC) roof partially collapsed. The building, constructed in 1950, was in service as a cinema up to 1967 and utilized as a school up to 1985. Finally, it was a hotel up to 2000. In 2004, when the building was not in service and underwent maintenance work, it partially collapsed under the dead load. After the collapse, which involved a large portion of the roof, several beams and two columns, the Court nominated a first Official Technical Consultant in order to investigate on the causes of failure and related …

Design mistakesEngineeringWaterproofingStructural systemCollapse (topology)020101 civil engineering02 engineering and technologyMaterial degradationSteel bar0201 civil engineering0203 mechanical engineeringNew roofForensic engineeringRetrofittingBuildingGeneral Materials ScienceRoofBond failurebusiness.industryGeneral EngineeringSettore ICAR/09 - Tecnica Delle Costruzioni020303 mechanical engineering & transportsWork (electrical)Structural loadbusinessSettore ICAR/08 - Scienza Delle CostruzioniRC
researchProduct

Fractal-structured multifocal intraocular lens

2017

[EN] In this work, we present a new concept of IOL design inspired by the demonstrated properties of reduced chromatic aberration and extended depth of focus of Fractal zone plates. A detailed description of a proof of concept IOL is provided. The result was numerically characterized, and fabricated by lathe turning. The prototype was tested in vitro using dedicated optical system and software. The theoretical Point Spread Function along the optical axis, computed for several wavelengths, showed that for each wavelength, the IOL produces two main foci surrounded by numerous secondary foci that partially overlap each other for different wavelengths. The result is that both, the near focus an…

DiffractionOptical PhenomenaFocus (geometry)VisionSocial Scienceslcsh:MedicinePhysics::Optics01 natural sciences0302 clinical medicineMedicine and Health SciencesPsychologylcsh:ScienceLens (Anatomy)PhysicsMultidisciplinaryPhysicsOphthalmic ProceduresCataract SurgeryOptical LensesWavelengthFractalsOptical EquipmentPhysical SciencesEngineering and TechnologySensory PerceptionAnatomyDiffractionResearch ArticlePoint spread functionOcular AnatomyGeometryEquipmentSurgical and Invasive Medical ProceduresIn Vitro TechniquesProsthesis DesignProof of Concept Study010309 optics03 medical and health sciencesFractalOpticsOcular SystemOptical transfer function0103 physical sciencesChromatic aberrationPrototypesComputer Simulationbusiness.industrylcsh:RBiology and Life SciencesModels TheoreticalMultifocal Intraocular LensesOptical axisTechnology DevelopmentFISICA APLICADAWaves030221 ophthalmology & optometryEyeslcsh:QbusinessHeadMathematicsNeuroscience
researchProduct

An elementary proof of Hilbertʼs theorem on ternary quartics

2012

Abstract In 1888, Hilbert proved that every nonnegative quartic form f = f ( x , y , z ) with real coefficients is a sum of three squares of quadratic forms. His proof was ahead of its time and used advanced methods from topology and algebraic geometry. Up to now, no elementary proof is known. Here we present a completely new approach. Although our proof is not easy, it uses only elementary techniques. As a by-product, it gives information on the number of representations f = p 1 2 + p 2 2 + p 3 2 of f up to orthogonal equivalence. We show that this number is 8 for generically chosen f, and that it is 4 when f is chosen generically with a real zero. Although these facts were known, there wa…

Discrete mathematicsAlgebra and Number TheorySums of squaresQuartic functionElementary proofZero (complex analysis)Algebraic geometryTernary operationEquivalence (measure theory)PolynomialsTopology (chemistry)MathematicsJournal of Algebra
researchProduct

On the Existence of 1-Bounded Bi-ideals with the WELLDOC Property

2015

A combinatorial condition called well distributedoccurrences, or WELLDOC for short, has been introducedrecently. The proofs that WELLDOC property holds for thefamily of Sturmian words, and more generally, for Arnoux-Rauzy words are given in two papers by Balkova et al. The WELLDOC property for bounded bi-ideals is analysed inthis paper. The existence of a 1-bounded bi-ideal over thefinite alphabet that satisfies the WELLDOC property has beenproved by the authors.

Discrete mathematicsAlgebraProperty (philosophy)Computer scienceBounded functionAlphabetComputer-aided software engineeringMathematical proofElectronic mail2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
researchProduct

Lehmer code transforms and Mahonian statistics on permutations

2012

Abstract In 2000 Babson and Steingrimsson introduced the notion of vincular patterns in permutations. They show that essentially all well-known Mahonian permutation statistics can be written as combinations of such patterns. Also, they proved and conjectured that other combinations of vincular patterns are still Mahonian. These conjectures were proved later: by Foata and Zeilberger in 2001, and by Foata and Randrianarivony in 2006. In this paper we give an alternative proof of some of these results. Our approach is based on permutation codes which, like the Lehmer code, map bijectively permutations onto subexcedant sequences. More precisely, we give several code transforms (i.e., bijections…

Discrete mathematicsCode (set theory)Mathematics::CombinatoricsValue (computer science)020206 networking & telecommunications0102 computer and information sciences02 engineering and technologyMathematical proof01 natural sciencesPermutation codeTheoretical Computer ScienceCombinatoricsPermutation010201 computation theory & mathematicsLehmer codeStatistics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: Mathematics0202 electrical engineering electronic engineering information engineeringMathematics - CombinatoricsDiscrete Mathematics and CombinatoricsCombinatorics (math.CO)Bijection injection and surjectionComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Incremental termination proofs and the length of derivations

1991

Incremental termination proofs, a concept similar to termination proofs by quasi-commuting orderings, are investigated. In particular, we show how an incremental termination proof for a term rewriting system T can be used to derive upper bounds on the length of derivations in T. A number of examples show that our results can be applied to yield (sharp) low-degree polynomial complexity bounds.

Discrete mathematicsCombinatoricsTermination proofPolynomial complexityRewriting systemWord problem (mathematics)Mathematical proofComputer Science::DatabasesMathematics
researchProduct