Search results for "Computation"

showing 10 items of 7362 documents

Thermodynamic and electrochemical study of tailor-made crown ethers for redox-switchable (pseudo)rotaxanes

2020

Crown ethers are common building blocks in supramolecular chemistry and are frequently applied as cation sensors or as subunits in synthetic molecular machines. Developing switchable and specifically designed crown ethers enables the implementation of function into molecular assemblies. Seven tailor-made redox-active crown ethers incorporating tetrathiafulvalene (TTF) or naphthalene diimide (NDI) as redox-switchable building blocks are described with regard to their potential to form redox-switchable rotaxanes. A combination of isothermal titration calorimetry and voltammetric techniques reveals correlations between the binding energies and redox-switching properties of the corresponding ps…

RotaxaneSupramolecular chemistryElectrochemistryRedoxFull Research Papersupramolecular chemistrylcsh:QD241-441chemistry.chemical_compoundlcsh:Organic chemistryComputational chemistryredox chemistrysupramolekulaarinen kemialcsh:ScienceCrown etherchemistry.chemical_classificationOrganic ChemistryIsothermal titration calorimetry540Molecular machineisothermal titration calorimetryChemistryrotaxaneschemistrycrown etherlcsh:Q500 Naturwissenschaften und Mathematik::540 Chemie::540 Chemie und zugeordnete WissenschaftenTetrathiafulvaleneBeilstein Journal of Organic Chemistry
researchProduct

Algorithmic Complexity Vulnerability Analysis of a Stateful Firewall

2016

Algorithmic complexity vulnerabilities are an opportunity for an ad-versary to conduct a sophisticated kind of attack i.e. on network infrastructure services. Such attacks take advantage of worst case time or space complexity of algorithms implemented on devices in their software. In this paper we address potential risks introduced by such algorithmic behavior in computer networks in particular on a stateful firewall. First we introduce the idea and theoretical background for the attack. We then describe in full detail a successfully con-ducted attack which takes advantage of the worst case computational complexi-ty of O(n2) of a hash table data structure used to store active sessions. The …

RouterComputer sciencenetwork vulnerabilitiesDenial-of-service attack02 engineering and technologyNetwork topologyComputer securitycomputer.software_genreFirewall (construction)Stateful firewall0202 electrical engineering electronic engineering information engineeringDenial of Servicecomplexity attackcomputational complexitybusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsHash tablese-curitycomputer networksDoSbusinessSegmentation faultcomputerRebootComputer network
researchProduct

Assignment of Roles and Channels for a Multichannel MAC in Wireless Mesh Networks

2009

International audience; A multichannel MAC improves throughput in wireless mesh networks by multiplexing transmissions over orthogonal channels. In this paper, we propose an efficient way for constructing the wireless mesh structure associated with Molecular MAC, a multichannel MAC layer designed for efficient packet forwarding. Molecular MAC outperforms other classical approaches, but requires a specific structure for efficient operation. First, we propose a centralized protocol that provides an upper bound for constructing such a molecular structure through a MILP (Mixed Integer Linear Programming) formulation that maximizes network capacity. Then, we present two distributed self-stabiliz…

Routing protocolComputer scienceDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Mesh networkingThroughput0102 computer and information sciences02 engineering and technology01 natural sciencesMultiplexinglaw.invention[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]law0202 electrical engineering electronic engineering information engineeringComputer Science::Networking and Internet ArchitectureComputer Science::Information TheorySpanning treeWireless mesh network[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]business.industryRadio Link ProtocolComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPacket forwarding020206 networking & telecommunications010201 computation theory & mathematicsbusinessCommunication channelComputer network
researchProduct

Characterizing cavity-like spaces in active-site models of zeolites

2003

A method for the calculation of fractal surfaces of crystals is presented. The fractal dimension of fragments of zeolites is computed. Results compare well with reference calculations performed with program GEPOL. The active site of Bronsted acid zeolites is modelled by sets of Al–OH–Si units. These units form 2–12-membered rings. Topological indices for the different active-site models are computed. The comparison of calculations performed with programs GEPOL and SURMO2 allows computing the model indices. The cavity-like globularity and rugosity show sharp discontinuities for the ring with 6 units. Most cavity-like spaces show no fractal character. However, the 6–8-ring cavity-like spaces …

RugosityRing (mathematics)General Computer ScienceChemistryGeneral Physics and AstronomyGeometryGeneral ChemistryClassification of discontinuitiesSpace (mathematics)Fractal dimensionComputational MathematicsFractalCharacter (mathematics)Mechanics of MaterialsRange (statistics)General Materials ScienceComputational Materials Science
researchProduct

Bending effect on the risk for delamination at the reinforcement/matrix interface of 3D woven fabric composite using a shell-like RVE

2012

This paper presents a computational homogenisation-based technique for flexural effects in textile reinforced composite planar shells. An homogenisation procedure is used for the in-plane and the out-of-plane behaviour of three-dimensional woven composite shells, taking the in-plane periodicity of the material into account while relaxing any periodicity tying in the thickness direction. Several types of damage (matrix or reinforcement cracking, delamination, …) can appear in a composite material. In this paper, material non-linear computations are used to assess the importance of bending on the risk for delamination at the reinforcement/matrix interface. The normal and tangential stresses a…

Résistance et comportement des matériauxMaterials scienceComposite number[ SPI.MAT ] Engineering Sciences [physics]/MaterialsShell (structure)Non-linear flexural behaviour02 engineering and technologyBendingSciences de l'ingénieur01 natural sciencesWoven composite[SPI.MAT]Engineering Sciences [physics]/MaterialsStress (mechanics)Flexural strengthDebonding0101 mathematicsComposite materialComputational homogenisationThermoplastic yarnsCivil and Structural EngineeringFiber pull-outRésistance des matériauxbusiness.industryDelaminationStructural engineering021001 nanoscience & nanotechnology010101 applied mathematicsDelaminationCeramics and Composites0210 nano-technologybusinessFailure mode and effects analysis
researchProduct

Partitionability, coverability and colorability in graphs

2014

Our research are about graph coloring with distance constraints (packing coloring) or neighborhood constraints (Grundy coloring). Let S={si| i in N*} be a non decreasing sequence of integers. An S-packing coloring is a proper coloring such that every set of color i is an si-packing (a set of vertices at pairwise distance greater than si). A graph G is (s1,... ,sk)-colorable if there exists a packing coloring of G with colors 1,... ,k. A Grundy coloring is a proper vertex coloring such that for every vertex of color i, u is adjacent to a vertex of color j, for each ji. These results allow us to determine S-packing coloring of these lattices for several sequences of integers. We examine a cla…

S-coloration de packingDistanceColoration de GrundyPacking coloringLatticDominationGraphColoration de packingComputational complexityParameterized complexity[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]ColorationGrapheCombinatoricsRegular graphColoringGrundy coloringGraphe régulierS -packing coloringComplexité algorithmiqueComplexité paramétrée
researchProduct

Investigating Potential Alignments between Modelica Standard Library and SAREF Ontologies

2021

International audience; Simulation tools based on the Modelica language provide comprehensive modelling and simulation approaches for building energy systems. However, the simulation and optimisation of such systems are data-driven processes, lacking a common understanding of information structure within the process. This paper investigates the possible semantic alignments of the Smart Appliances REFerence (SAREF) ontology and its extension for building domain, SAREF4BLDG, with the Modelica Standard Library (MSL). Using the MSL, a residential heating system has been modelled in OpenModelica, an open-source modelling and simulation environment. Then, SAREF and its extension SAREF4BLDG semant…

SAREF[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO][INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL]Modelica Standard LibraryOntologies[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]Building Energy Systems[INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationSAREF4BLDG[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
researchProduct

Internal spring distribution for quasi brittle fracture via Symmetric Boundary Element Method

2009

Abstract In this paper the symmetric boundary element formulation is applied to the fracture mechanics problems for quasi brittle materials . The basic aim of the present work is the development and implementation of two discrete cohesive zone models using Symmetric Galerkin multi-zone Boundary Elements Method . The non-linearity at the process zone of the crack will be simulated through a discrete distribution of nodal springs whose generalized (or weighted) stiffnesses are obtainable by the cohesive forces and relative displacements modelling. This goal is reached coherently with the constitutive relation σ − Δ u that describes the interaction between mechanical and kinematical quantities…

SGBEM spring distribution multidomain closed form coefficientsMechanical EngineeringMathematical analysisGeneral Physics and AstronomyGeometryFracture mechanicsSingular boundary methodBoundary knot methodFinite element methodMechanics of MaterialsComputational mechanicsGeneral Materials ScienceBoundary value problemGalerkin methodSettore ICAR/08 - Scienza Delle CostruzioniBoundary element methodMathematics
researchProduct

"Table 37" of "Centrality dependence of Pi, K, p production in Pb-Pb collisions at sqrt(sNN) = 2.76 TeV"

2018

K/pi ratio in Pb-Pb collisions at sqrt(sNN) = 2.76 TeV.

SIG/SIG2760.0Astrophysics::High Energy Astrophysical PhenomenaComputer Science::Neural and Evolutionary ComputationHigh Energy Physics::PhenomenologyIntegrated Cross SectionPB PB --> PI+ XCross SectionPB PB --> PI- XInclusiveStrange ProductionPB PB --> K- XHigh Energy Physics::ExperimentPB PB --> K+ XNuclear Experiment
researchProduct

Expressive and efficient pattern languages for tree-structured data (extended abstract)

2000

It would be desirable to have a query language for tree-structured data that is (1) as easily usable as SQL, (2) as expressive as monadic second-order logic (MSO), and (3) efficiently evaluable. The paper develops some ideas in this direction. Towards (1) the specification of sets of vertices of a tree by combining conditions on their induced subtree with conditions on their path to the root is proposed. Existing query languages allow regular expressions (hence MSO logic) in path conditions but are limited in expressing subtree conditions. It is shown that such query languages fall short of capturing all MSO queries. On the other hand, allowing a certain guarded fragment of MSO-logic in the…

SQLRoot (linguistics)Theoretical computer scienceProgramming languageComputer scienceUSablecomputer.software_genreQuery languageTree (data structure)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESFragment (logic)Path (graph theory)Regular expressioncomputercomputer.programming_languageProceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00
researchProduct