Search results for "Interior"

showing 10 items of 140 documents

A fuzzification of the category of M-valued L-topological spaces

2004

[EN] A fuzzy category is a certain superstructure over an ordinary category in which ”potential” objects and ”potential” morphisms could be such to a certain degree. The aim of this paper is to introduce a fuzzy category FTOP(L,M) extending the category TOP(L,M) of M-valued L- topological spaces which in its turn is an extension of the category TOP(L) of L-fuzzy topological spaces in Kubiak-Sostak’s sense. Basic properties of the fuzzy category FTOP(L,M) and its objects are studied.

Pure mathematicsFunctorHomotopy categoryDiagram (category theory)Mathematics::General Mathematicslcsh:Mathematicslcsh:QA299.6-433lcsh:Analysislcsh:QA1-939GL-monoid(LM)-fuzzy topologyPower-set operators(LM)-interior operatorMathematics::Category TheoryCategory of topological spacesBiproductUniversal propertyGeometry and TopologyM-valued L-topologyCategory of setsL-fuzzy category(LM)-neighborhood systemMathematicsInitial and terminal objectsApplied General Topology
researchProduct

On the interior regularity of weak solutions to the 2-D incompressible Euler equations

2016

We study whether some of the non-physical properties observed for weak solutions of the incompressible Euler equations can be ruled out by studying the vorticity formulation. Our main contribution is in developing an interior regularity method in the spirit of De Giorgi–Nash–Moser, showing that local weak solutions are exponentially integrable, uniformly in time, under minimal integrability conditions. This is a Serrin-type interior regularity result $$\begin{aligned} u \in L_\mathrm{loc}^{2+\varepsilon }(\Omega _T) \implies \mathrm{local\ regularity} \end{aligned}$$ for weak solutions in the energy space $$L_t^\infty L_x^2$$ , satisfying appropriate vorticity estimates. We also obtain impr…

Pure mathematicsIntegrable systemDimension (graph theory)Mathematics::Analysis of PDEsContext (language use)yhtälötSpace (mathematics)01 natural sciencessymbols.namesakeMathematics - Analysis of PDEs35Q31 (Primary) 76B03 35B65 35Q30 (Secondary)weak solutions0103 physical sciencesinterior regularityBoundary value problem0101 mathematicsMathematicsmatematiikkaApplied Mathematics010102 general mathematicsVorticityEuler equationsEuler equationssymbols010307 mathematical physicsAnalysisEnergy (signal processing)Calculus of Variations and Partial Differential Equations
researchProduct

C*-seminorms on partial *-algebras: an overview

2005

Pure mathematicsInterior algebraNon-associative algebraNest algebraAlgorithmCCR and CAR algebrasMathematicsTopological Algebras, their Applications, and Related Topics
researchProduct

Extended-order algebras as a generalization of posets

2011

Motivated by the recent study of several researchers on extended-order algebras, introduced by C. Guido and P. Toto as a possible common framework for the majority of algebraic structures used in many-valued mathematics, the paper focuses on the properties of homomorphisms of the new structures, considering extended-order algebras as a generalization of partially ordered sets. The manuscript also introduces the notion of extended-relation algebra providing a new framework for developing the theory of rough sets.

Quadratic algebraAlgebraInterior algebraJordan algebraGeneral MathematicsSubalgebraClifford algebraAlgebra representationDivision algebraAbstract algebraMathematicsDemonstratio Mathematica
researchProduct

ECAR: an Energy/Channel Aware Routing Protocol For Cooperative Wireless Sensor Networks

2011

International audience; The proliferation of low power networks like Wireless Sensor Networks (WSN) rose up new challenges. Power conservation and channel quality become the most important parameters. Obviously, hop count based routing protocols are no more adapted to such networks having power limitations and channel problems. Several alternatives were suggested to cope with these constraints. In MAC layer for example, cooperative protocols were designed to enhance the channel use: the neighbor nodes help the source to retransmit its packets. However, if the path proposed by the routing protocol contains poor channels, the cooperative communications will not save all the packets. Therefore…

Routing protocolDynamic Source RoutingComputer scienceDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Enhanced Interior Gateway Routing ProtocolWireless Routing Protocol02 engineering and technology01 natural sciencesHop (networking)Routing Information Protocol[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]Ad hoc On-Demand Distance Vector Routing0202 electrical engineering electronic engineering information engineeringDestination-Sequenced Distance Vector routingwireless sensor networksComputingMilieux_MISCELLANEOUSenergy efficiency0105 earth and related environmental sciencesZone Routing ProtocolStatic routing010505 oceanographyNetwork packetbusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPath vector protocol020206 networking & telecommunicationsDistance-vector routing protocolLink-state routing protocolOptimized Link State Routing ProtocolInterior gateway protocolbusinesscooperative relayingWireless sensor networkbiobjective routing protocolEfficient energy useComputer network
researchProduct

NICE-MRP: a Near-Optimal Radio-Interference Aware Multi-path Routing Protocol for MANETs

2013

International audience; Nowadays, with the miniaturization of communication devices, dense and highly mobile ad-hoc networks are very common. Besides, more and more devices have several radio interfaces. In such an environment, multi-path routing should be considered. Yet, only few multi-path ad-hoc routing protocols take into account the radio-interferences which might arise between two geographically close routes. Moreover, they generally only forbid the addition of interfering paths rather than looking for a different, more optimized, solution. This paper presents NICE-MRP, a novel multi-path routing protocol for mobile ad-hoc networks giving efficient solutions with respect to physical …

Routing protocolDynamic Source RoutingComputer scienceDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Wireless Routing Protocol050801 communication & media studies02 engineering and technologyRouting Information Protocol[INFO.INFO-MC]Computer Science [cs]/Mobile Computing[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]0508 media and communications[INFO.INFO-MC] Computer Science [cs]/Mobile Computing0202 electrical engineering electronic engineering information engineeringZone Routing ProtocolStatic routing[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]business.industry05 social sciencesComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunications[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationLink-state routing protocolInterior gateway protocol[INFO.INFO-MO] Computer Science [cs]/Modeling and SimulationbusinessComputer network
researchProduct

Distributed routing and channel allocation in multi-channel multi-hop ad hoc networks

2013

In this paper, we propose a novel routing protocol which is integrated with channel assignment for multi-channel multi-hop wireless ad hoc networks. In such a network, each node is equipped with three transceivers. One is always tuned on a control channel which is responsible for control and broadcast messages, and the other two perform as transmitter and receiver respectively for traffic flows on different data channels. The routing protocol works in an on-demand manner, and the proposed routing discovery process selects a path that potentially traverses nodes with lighter traffic load and lower number of carried flows. With a given number of non-overlapping channels, the optimal solution …

Routing protocolDynamic Source RoutingComputer scienceWireless ad hoc networkDistributed computingEnhanced Interior Gateway Routing ProtocolWireless Routing ProtocolHop (networking)Routing Information ProtocolControl channelDestination-Sequenced Distance Vector routingZone Routing ProtocolStatic routingChannel allocation schemesAdaptive quality of service multi-hop routingbusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPath vector protocolAd hoc wireless distribution serviceDistance-vector routing protocolLink-state routing protocolOptimized Link State Routing ProtocolMultipath routingInterior gateway protocolHazy Sighted Link State Routing ProtocolbusinessComputer network2013 IEEE Wireless Communications and Networking Conference (WCNC)
researchProduct

A combined relay-selection and routing protocol for cooperative wireless sensor networks

2012

International audience; In wireless sensor networks several constraints decrease communications performances. In fact, channel randomness and energy restrictions make classical routing protocols inefficient. Therefore, the design of new routing protocols that cope with these constraints become mandatory. The main objective of this paper is to present a multi-objective routing algorithm RBCR that computes routing path based on the energy consumption and channel qualities. Additionally, the channel qualities are evaluated based on the presence of relay nodes. Compared to AODV and AODV associated to a cooperative MAC protocol, RBCR provides better performances in term of delivery ratio, power …

Routing protocolDynamic Source RoutingComputer science[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Distributed computingEnhanced Interior Gateway Routing ProtocolWireless Routing Protocol02 engineering and technologylaw.inventionRouting Information Protocol[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]Ad hoc On-Demand Distance Vector RoutingRelaylaw0202 electrical engineering electronic engineering information engineeringDestination-Sequenced Distance Vector routingHierarchical routingZone Routing ProtocolStatic routingbusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPolicy-based routingPath vector protocol020206 networking & telecommunicationsEnergy consumptionAd hoc wireless distribution serviceKey distribution in wireless sensor networksDistance-vector routing protocolOptimized Link State Routing ProtocolLink-state routing protocolMultipath routingInterior gateway protocol020201 artificial intelligence & image processingHazy Sighted Link State Routing ProtocolbusinessWireless sensor networkEfficient energy useComputer network2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC)
researchProduct

Distance Constrained Mapping to Support NoC Platforms Based on Source Routing

2010

Efficient NoC is crucial for communication among processing elements in a highly parallel processing systems on chip. Mapping cores to slots in a NoC platform and designing efficient routing algorithms are two key problems in NoC design. Source routing offers major advantages over distributed routing especially for regular topology NoC platforms. But it suffers from a serious drawback of overhead since it requires whole communication path to be stored in every packet header. In this paper, we present a core mapping technique which helps to achieve a mapping with the constraint over the path length. We have found that the path length constraint of just 50% is sufficient in most cases. We als…

Routing protocolDynamic Source RoutingEqual-cost multi-path routingComputer scienceRouting tableDistributed computingEnhanced Interior Gateway Routing ProtocolWireless Routing ProtocolGeographic routingSource routingRouting Information ProtocolHeaderDestination-Sequenced Distance Vector routingTriangular routingZone Routing ProtocolStatic routingbusiness.industryPolicy-based routingPath vector protocolDSRFLOWNetwork on a chipLink-state routing protocolRouting domainMultipath routingbusinessComputer network
researchProduct

A Network Protocol to Enhance Robustness in Tree-Based WSNs Using Data Aggregation

2007

This paper proposes a data gathering strategy for wireless sensor networks and an implementation based on the IEEE 802.15.4 standard. The algorithm combines the benefits of single-path and multi-path routing strategies in a hybrid solution which makes use of alternative paths when necessary. We adopt a caching and retransmission technique, which exploits some peculiar features of data aggregation, with the use of implicit acknowledgments of reception. The paper also discusses simulation results that show how the mentioned techniques, combined with exploitation of the features of the IEEE 802.15.4 standard have been used to obtain an efficient protocol that takes energy consumption into acco…

Routing protocolDynamic Source RoutingInter-Access Point ProtocolComputer scienceDistributed computingRetransmissionEnhanced Interior Gateway Routing ProtocolWireless Routing ProtocolMobile wireless sensor networkIEEE 802.11sZone Routing Protocolbusiness.industryWireless networkComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPath vector protocolEnergy consumptionAd hoc wireless distribution serviceWireless sensor networksKey distribution in wireless sensor networksOptimized Link State Routing ProtocolLink-state routing protocolMultipath routingHazy Sighted Link State Routing ProtocolCommunications protocolbusinessWireless sensor networkComputer networkNeuRFon2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems
researchProduct