Search results for "Crete"

showing 10 items of 2495 documents

Ultrametric Finite Automata and Turing Machines

2013

We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceComputer scienceSuper-recursive algorithmProbabilistic Turing machineDescription numberNonlinear Sciences::Cellular Automata and Lattice GasesTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTuring completenesssymbolsQuantum finite automataAutomata theoryTwo-way deterministic finite automatonComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Ultrametric Algorithms and Automata

2015

We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceFinite-state machineComputer scienceComputationStochastic matrixNonlinear Sciences::Cellular Automata and Lattice GasesAutomatonTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESProbabilistic automatonsymbolsAutomata theoryUltrametric spaceComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Upper bounds on multiparty communication complexity of shifts

1996

We consider some communication complexity problems which arise when proving lower bounds on the complexity of Boolean functions. In particular, we prove an \(O(\frac{n}{{2\sqrt {\log n} }}\log ^{1/4} n)\)upper bound on 3-party communication complexity of shifts, an O(n e ) upper bound on the multiparty communication complexity of shifts for a polylogarithmic number of parties. These bounds are all significant improvements over ones recently considered “unexpected” by Pudlak [5].

TheoryofComputation_MISCELLANEOUSDiscrete mathematicsCombinatoricsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYCommunication complexityBinary logarithmBoolean functionUpper and lower boundsMultiparty communicationMathematics
researchProduct

Some decisional problems on rational relations

1997

Abstract In this paper we prove that the problem of deciding whether a deterministic rational relation is star-free is recursively solvable, although the same problem for any rational relation is undecidable. We also prove that a rational relation is star-free if and only if it is aperiodic and deterministic.

TheoryofComputation_MISCELLANEOUSDiscrete mathematicsTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESGeneral Computer ScienceTheoretical Computer ScienceUndecidable problemTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESIf and only ifAperiodic graphComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONAstrophysics::Solar and Stellar AstrophysicsRational relationComputer Science::Formal Languages and Automata TheoryAstrophysics::Galaxy AstrophysicsComputer Science(all)MathematicsTheoretical Computer Science
researchProduct

Properties and constraints of cheating-immune secret sharing schemes

2006

AbstractA secret sharing scheme is a cryptographic protocol by means of which a dealer shares a secret among a set of participants in such a way that it can be subsequently reconstructed by certain qualified subsets. The setting we consider is the following: in a first phase, the dealer gives in a secure way a piece of information, called a share, to each participant. Then, participants belonging to a qualified subset send in a secure way their shares to a trusted party, referred to as a combiner, who computes the secret and sends it back to the participants.Cheating-immune secret sharing schemes are secret sharing schemes in the above setting where dishonest participants, during the recons…

TheoryofComputation_MISCELLANEOUSHomomorphic secret sharingCryptography0102 computer and information sciences02 engineering and technologyShared secretComputer securitycomputer.software_genre01 natural sciencesSecret sharingCheating0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsSecret sharingMathematicsbusiness.industryApplied MathematicsCryptographic protocol16. Peace & justiceShamir's Secret Sharing010201 computation theory & mathematicsResilient functionsCryptographySecure multi-party computation020201 artificial intelligence & image processingVerifiable secret sharingbusinesscomputerDiscrete Applied Mathematics
researchProduct

An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems

1984

We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding toGale, Farkas, Gordan andMotzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.

TheoryofComputation_MISCELLANEOUSStatistics and ProbabilityConvex analysisDiscrete mathematicsGeneralizationLinear matrix inequalityRegular polygonDuality (optimization)Optimality theorySemi-infinite programmingAlgebraLinear inequalityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESStatistics Probability and UncertaintyMathematicsTrabajos de Estadistica y de Investigacion Operativa
researchProduct

The role of nanoparticles in decreased washout of underwater concrete

2019

Abstract The paper presents research results of the influence of SiO2 nanoparticles on the washout of underwater concrete and hardened concrete. Based on infrared spectroscopy (FTIR) and thermogravimetric (TGA) analyses of the applied anti-washout admixture (AWA), its chemical structure was determined. A beneficial effect of SiO2 nanoparticles on the reduction of the mix washout was demonstrated and the most probable reason for that phenomenon was given, taking into account the AWA chemical structure and its behaviour in the concrete mix environment. It was found that a dosing method of AWA and nanoparticles to the concrete influenced the washout.

Thermogravimetric analysisMaterials sciencefresh concreteChemical structure0211 other engineering and technologiesInfrared spectroscopyWashoutNanoparticle020101 civil engineering02 engineering and technologyBuilding and Construction0201 civil engineeringChemical engineeringfinenessSio2 nanoparticles021105 building & constructionadmixturenanoparticlesGeneral Materials ScienceFourier transform infrared spectroscopyCivil and Structural EngineeringConstruction and Building Materials
researchProduct

Experimental Investigation of the Shear Response of Precast Steel-Concrete Trussed Beams

2017

The results of an experimental campaign of three-point bending tests on precast composite beams, named hybrid steel-trussed concrete beams (HSTCBs), are provided. HSTCBs are typically constituted by a precast steel truss embedded in a block of concrete cast in place. Two series of specimens were manufactured, designed such that shear failure would occur, and tested under positive and negative bending moment. The experimental results obtained showed that fragile shear failure occurred in almost all cases, evidencing the crisis of the compressed concrete strut involved in the collapse mechanism. Yielding of the steel members provided ductility to the system, especially in those cases in which…

Three-point bending testsEngineering0211 other engineering and technologiesTruss020101 civil engineering02 engineering and technologyBendingAnalytical model0201 civil engineeringHybrid steel-trussed concrete beamsPrecast concrete021105 building & constructionGeneral Materials ScienceMechanics of MaterialAnalytical modelsDuctilityCivil and Structural EngineeringHybrid steel-trussed concrete beambusiness.industryMetal and composite structuresMechanical EngineeringShear resistanceStructural engineeringBuilding and ConstructionStrength of materialsShear (sheet metal)Three-point bending testSettore ICAR/09 - Tecnica Delle CostruzioniShear resistanceAnalytical models; Hybrid steel-trussed concrete beams; Metal and composite structures; Shear resistance; Three-point bending tests; Civil and Structural Engineering; Building and Construction; Materials Science (all); Mechanics of Materials; Mechanical EngineeringMechanics of MaterialsBending momentMetal and composite structureMaterials Science (all)business
researchProduct

A material for memory

2022

Every piece of architecture always aspires to become a monument, if only for the intentionality of meaning, witness and duration that becomes suggestive and evident through the etymological interpretation of the Latin verbs memini, moneo, maneo: every construction, in fact, it recalls the sense of its necessity and essence; it admonishes by arousing respect with the force of the image and the meaning it conveys; it remains durable and, ideally, eternal. There are, then, the architectures specially built to remember in which the utilitas transcends the usual considerations of functional type and sublimates itself in the manifestation of the memory, while the fi rmitas conserves and maintains…

TiempoConcrete.MemoryArchitectureProyectoSettore ICAR/14 - Composizione Architettonica E UrbanaMemoriaProjectTimeArquitecturaHormigón.
researchProduct

Optimization and Inversion

2009

Tikhonov regularizationComputer scienceGeophysicsDensity contrastInversion (discrete mathematics)Bouguer anomaly
researchProduct