Search results for "HMI"

showing 10 items of 931 documents

Airborne Measurements of Contrail Ice Properties—Dependence on Temperature and Humidity

2021

The largest share in the climate impact of aviation results from cirrus clouds. Here, the dependence of microphysical contrail ice properties and extinction on temperature and humidity is investigated. Contrail measurements were performed at various altitudes during the 2018 ECLIF II/NDMAX campaign with the NASA DC-8 chasing the DLR A320. Ice number concentrations and contrail extinction coefficients are largest at altitudes near 9.5 km, typical for short- and medium-range air traffic. At higher altitudes near 11.5 km, low ambient water vapor concentrations lead to smaller contrail particle sizes and lower extinction coefficients. In addition, contrails were detected below 8.2 km near the S…

ExtinktionLead (sea ice)HumidityAtmospheric sciencesGeophysicsAltitudeSchmidt-ApplemanExtinction (optical mineralogy)Threshold temperatureGeneral Earth and Planetary SciencesEnvironmental scienceParticleCirrusMessungenLaserspektrometrieSoot particlesKondensstreifenGeophysical Research Letters
researchProduct

Combinatorial proofs of two theorems of Lutz and Stull

2021

Recently, Lutz and Stull used methods from algorithmic information theory to prove two new Marstrand-type projection theorems, concerning subsets of Euclidean space which are not assumed to be Borel, or even analytic. One of the theorems states that if $K \subset \mathbb{R}^{n}$ is any set with equal Hausdorff and packing dimensions, then $$ \dim_{\mathrm{H}} π_{e}(K) = \min\{\dim_{\mathrm{H}} K,1\} $$ for almost every $e \in S^{n - 1}$. Here $π_{e}$ stands for orthogonal projection to $\mathrm{span}(e)$. The primary purpose of this paper is to present proofs for Lutz and Stull's projection theorems which do not refer to information theoretic concepts. Instead, they will rely on combinatori…

FOS: Computer and information sciences28A80 (primary) 28A78 (secondary)General MathematicskombinatoriikkaCombinatorial proofComputational Complexity (cs.CC)01 natural sciencesCombinatoricsMathematics - Metric GeometryHausdorff and packing measures0103 physical sciencesClassical Analysis and ODEs (math.CA)FOS: Mathematics0101 mathematicsMathematicsAlgorithmic information theoryLemma (mathematics)Euclidean spacePigeonhole principle010102 general mathematicsOrthographic projectionHausdorff spaceMetric Geometry (math.MG)Projection (relational algebra)Computer Science - Computational ComplexityMathematics - Classical Analysis and ODEsfraktaalit010307 mathematical physicsmittateoria
researchProduct

Probabilistic and team PFIN-type learning: General properties

2008

We consider the probability hierarchy for Popperian FINite learning and study the general properties of this hierarchy. We prove that the probability hierarchy is decidable, i.e. there exists an algorithm that receives p_1 and p_2 and answers whether PFIN-type learning with the probability of success p_1 is equivalent to PFIN-type learning with the probability of success p_2. To prove our result, we analyze the topological structure of the probability hierarchy. We prove that it is well-ordered in descending ordering and order-equivalent to ordinal epsilon_0. This shows that the structure of the hierarchy is very complicated. Using similar methods, we also prove that, for PFIN-type learning…

FOS: Computer and information sciencesComputer Science::Machine LearningTheoretical computer scienceComputer Networks and CommunicationsExistential quantificationStructure (category theory)DecidabilityType (model theory)Learning in the limitTheoretical Computer ScienceMachine Learning (cs.LG)Probability of successFinite limitsMathematicsOrdinalsDiscrete mathematicsHierarchybusiness.industryApplied MathematicsAlgorithmic learning theoryProbabilistic logicF.1.1 I.2.6Inductive inferenceInductive reasoningDecidabilityComputer Science - LearningTeam learningComputational Theory and MathematicsArtificial intelligencebusinessJournal of Computer and System Sciences
researchProduct

Computational Limitations of Affine Automata

2019

We present two new results on the computational limitations of affine automata. First, we show that the computation of bounded-error rational-values affine automata is simulated in logarithmic space. Second, we give an impossibility result for algebraic-valued affine automata. As a result, we identify some unary languages (in logarithmic space) that are not recognized by algebraic-valued affine automata with cutpoints.

FOS: Computer and information sciencesDiscrete mathematics050101 languages & linguisticsTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESUnary operationFormal Languages and Automata Theory (cs.FL)Computer scienceComputation05 social sciencesComputer Science - Formal Languages and Automata Theory02 engineering and technology[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Nonlinear Sciences::Cellular Automata and Lattice GasesLogarithmic spaceAutomatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0501 psychology and cognitive sciencesAffine transformationImpossibilityComputer Science::Formal Languages and Automata TheoryComputingMilieux_MISCELLANEOUS
researchProduct

Structural bias in population-based algorithms

2014

Abstract Challenging optimisation problems are abundant in all areas of science and industry. Since the 1950s, scientists have responded to this by developing ever-diversifying families of ‘black box’ optimisation algorithms. The latter are designed to be able to address any optimisation problem, requiring only that the quality of any candidate solution can be calculated via a ‘fitness function’ specific to the problem. For such algorithms to be successful, at least three properties are required: (i) an effective informed sampling strategy, that guides the generation of new candidates on the basis of the fitnesses and locations of previously visited candidates; (ii) mechanisms to ensure eff…

FOS: Computer and information sciencesQA75Mathematical optimizationInformation Systems and ManagementPopulation-based algorithmsFitness landscapemedia_common.quotation_subjectPopulationStructural biasEvolutionary computationPopulation-based algorithmEvolutionary computationTheoretical Computer ScienceArtificial IntelligenceBlack boxEconometricsQuality (business)OptimisationAlgorithmic designNeural and Evolutionary Computing (cs.NE)educationMathematicsmedia_commonta113education.field_of_studyFitness functionPopulation sizeComputer Science - Neural and Evolutionary ComputingComputer Science ApplicationsControl and Systems EngineeringAlgorithmSoftwarePopulation variance
researchProduct

Measuring Semantic Coherence of a Conversation

2018

Conversational systems have become increasingly popular as a way for humans to interact with computers. To be able to provide intelligent responses, conversational systems must correctly model the structure and semantics of a conversation. We introduce the task of measuring semantic (in)coherence in a conversation with respect to background knowledge, which relies on the identification of semantic relations between concepts introduced during a conversation. We propose and evaluate graph-based and machine learning-based approaches for measuring semantic coherence using knowledge graphs, their vector space embeddings and word embedding models, as sources of background knowledge. We demonstrat…

FOS: Computer and information sciencesWord embeddingComputer scienceComputer Science - Artificial Intelligencemedia_common.quotation_subjectihmisen ja tietokoneen vuorovaikutus02 engineering and technologycomputer.software_genrekeskustelu020204 information systems0202 electrical engineering electronic engineering information engineeringConversationconversational systemsmedia_commonComputer Science - Computation and Languagebusiness.industrykoneoppiminenArtificial Intelligence (cs.AI)Knowledge graphsemantiikkaGraph (abstract data type)020201 artificial intelligence & image processingArtificial intelligencebusinesssemantic coherencecomputerComputation and Language (cs.CL)Natural language processing
researchProduct

A rule‐based method to model myocardial fiber orientation in cardiac biventricular geometries with outflow tracts

2019

Rule-based methods are often used for assigning fiber orientation to cardiac anatomical models. However, existing methods have been developed using data mostly from the left ventricle. As a consequence, fiber information obtained from rule-based methods often does not match histological data in other areas of the heart such as the right ventricle, having a negative impact in cardiac simulations beyond the left ventricle. In this work, we present a rule-based method where fiber orientation is separately modeled in each ventricle following observations from histology. This allows to create detailed fiber orientation in specific regions such as the endocardium of the right ventricle, the inter…

FOS: Computer and information sciencesmedicine.medical_specialtyHeart VentriclesBiomedical EngineeringFOS: Physical sciencesVolume mesh030204 cardiovascular system & hematology[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]030218 nuclear medicine & medical imagingComputational Engineering Finance and Science (cs.CE)03 medical and health sciences0302 clinical medicineRule-based methodInternal medicine[INFO.INFO-IM]Computer Science [cs]/Medical ImagingmedicineHumansComputer SimulationElectrophysiological simulationsInterventricular septumOutflow tractComputer Science - Computational Engineering Finance and ScienceMolecular BiologyEndocardiumFiber (mathematics)Orientation (computer vision)MyocardiumApplied MathematicsFiber orientationOutflow tract ventricular arrhythmiaModels CardiovascularRule-based systemSeptumMagnetic Resonance Imaging[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationPhysics - Medical PhysicsElectrophysiological Phenomenamedicine.anatomical_structureComputational Theory and MathematicsVentricleModeling and Simulationcardiovascular systemCardiologyOutflowMedical Physics (physics.med-ph)SoftwareGeologyInternational Journal for Numerical Methods in Biomedical Engineering
researchProduct

Ohmic Contacts on p-Type Al-Implanted 4H-SiC Layers after Different Post-Implantation Annealings

2019

This paper reports on the electrical activation and Ohmic contact properties on p-type Al-implanted silicon carbide (4H-SiC). In particular, the contacts were formed on 4H-SiC-implanted layers, subjected to three different post-implantation annealing processes, at 1675 &deg

FabricationMaterials science4H-SiCAnnealing (metallurgy)02 engineering and technology01 natural scienceslcsh:TechnologyArticlechemistry.chemical_compound0103 physical sciencesSilicon carbideGeneral Materials ScienceComposite materiallcsh:MicroscopyOhmic contactlcsh:QC120-168.85010302 applied physicsion-implantationDopantlcsh:QH201-278.5lcsh:TContact resistanceohmic contacts021001 nanoscience & nanotechnologyAcceptor3. Good healthIon implantationchemistrylcsh:TA1-2040lcsh:Descriptive and experimental mechanicslcsh:Electrical engineering. Electronics. Nuclear engineering0210 nano-technologylcsh:Engineering (General). Civil engineering (General)lcsh:TK1-9971Materials
researchProduct

Efficient Vacuum Deposited P-I-N Perovskite Solar Cells by Front Contact Optimization.

2020

Hole transport layers HTLs are of fundamental importance in perovskite solar cells PSCs , as they must ensure an efficient and selective hole extraction, and ohmic charge transfer to the corresponding electrodes. In p i n solar cells, the ITO HTL is usually not ohmic, and an additional interlayer such as MoO3 is usually placed in between the two materials by vacuum sublimation. In this work, we evaluated the properties of the MoO3 TaTm TaTm is the HTL N4,N4,N4 amp; 8243;,N4 amp; 8243; tetra [1,1 amp; 8242; biphenyl] 4 yl [1,1 amp; 8242; 4 amp; 8242;,1 amp; 8243; terphenyl] 4,4 amp; 8243; diamine hole extraction interface by selectively annealing either MoO3 prior to the deposition of TaTm o…

FabricationMaterials scienceAnnealing (metallurgy)Perovskite solar cell02 engineering and technologyperovskite solar cell ; molybdenum oxide ; vacuum deposition ; processing ; hole transport layer010402 general chemistryhole transport layer01 natural sciencesmolybdenum oxidelcsh:ChemistryVacuum depositionWork functionOhmic contactMaterialsCèl·lules fotoelèctriquesOriginal Researchbusiness.industryGeneral Chemistryvacuum-deposition021001 nanoscience & nanotechnologyperovskite solar cell0104 chemical sciencesActive layerChemistrylcsh:QD1-999ElectrodeOptoelectronicsprocessing0210 nano-technologybusinessFrontiers in chemistry
researchProduct

Growth and characterization of horizontally suspended CNTs across TiN electrode gaps.

2010

A technique is proposed to grow horizontal carbon nanotubes (CNTs) bridging metal electrodes and to assess their electrical properties. A test structure was utilized that allows for selective electrochemical sidewall catalyst placement. The selectivity of the technique is based on the connection of the desired metal electrodes to the silicon substrate where the potential for electrochemical deposition was applied. Control over the Ni catalyst size (15-30 nm) and density (up to 3 x 10(11) particles cm(-2)) is demonstrated. Horizontal CNTs with controlled diameter and density were obtained by CVD growth perpendicular to the sidewalls of patterned TiN electrode structures. Electrode gaps with …

FabricationMaterials scienceSiliconScanning electron microscopeElectrodeHeterogeneous catalysis at surfacechemistry.chemical_elementBioengineeringNanotechnologyChemical vapor depositionCarbon nanotubeSettore ING-INF/01 - Elettronicalaw.inventionlawGeneral Materials ScienceElectrical and Electronic EngineeringOhmic contactbusiness.industryMechanical EngineeringSurface and interface chemistryGeneral ChemistryNanostructured materials in electrochemistryNanotubechemistryMechanics of MaterialsElectrodeOptoelectronicsTinbusinessScanning electron microscopyNanotechnology
researchProduct