-
901
Simulation of broadcasting method based on busy tone
Published 2012-11-01“…In ad hoc network with high dynamic topology,broadcasting method based on handshake mechanism was not efficient.Therefore,a broadcasting method based on busy tone was proposed.This method was modeled and implemented with the network simulation platform OPNET,and the performance of the broadcasting method was analyzed based on experimental results.Experimental results show that,the broadcasting method based on busy tone is applicable to the network with high dynamic topology.…”
Get full text
Article -
902
An imbalanced deep learning framework for pre-fault flexible multi-zone dynamic security assessment via transfer learning based graph convolutional network
Published 2025-03-01“…However, DL-based DSA faces challenges related to model robustness against topology changes and database imbalances. Although an accurate model can be trained for a particular topology, it often does not work for other topologies and requires updating. …”
Get full text
Article -
903
HYBRID OPTIMIZATION METHOD OF CONTINUUM STRUCTURE AND ITS SUPPORTING LOCATIONS
Published 2021-01-01“…Thus,simultaneously optimizing the topology of the structure and its supporting locations under a certain limit of material and supports is an effective approach to improve the mechanical properties of the structure. …”
Get full text
Article -
904
Vehicular cache nodes selection algorithm under load constraint in C-V2X
Published 2021-03-01“…In order to solve the problem that the C-V2X vehicle topology in urban environment was highly dynamic and the load capacity of vehicle nodes was limited, and improve the utilization of vehicular cache resources and reduce the load of base station, a vehicle cache nodes selection algorithm under load constraints was proposed.Firstly, by defining the link stability metric, the predicted weight adjacency matrix was constructed to describe the vehicular micro-topology in essence.Next, the objective function was further constructed under the load constraints and non-overlapping coverage constraint, which maximized the average link weight of the clusters by using the least cache nodes.Finally, the greedy concept was then introduced and the node states were reasonably defined.As a result, the minimum dominating set of the vehicle topology was figured out under the load constraints.Besides, the serviced neighbor nodes were then determined preferentially.The simulation results show that the proposed algorithm is close to the global optimal results in terms of the number of cache nodes and the average weight of cluster links.Moreover, the repeated response ratio of the proposed algorithm is always zero while the request response ratio can achieve the theoretical upper bound.Furthermore, the response times of cache resources can be also effectively improved.…”
Get full text
Article -
905
The closed neighborhood and filter conditions in solid sequence spaces
Published 1989-01-01“…Let E be a topological vector space of scalar sequences, with topology τ; (E,τ) satisfies the closed neighborhood condition iff there is a basis of neighborhoods at the origin, for τ, consisting of sets whlch are closed with respect to the topology π of coordinate-wise convergence on E; (E,τ) satisfies the filter condition iff every filter, Cauchy with respect to τ, convergent with respect to π, converges with respect to τ.…”
Get full text
Article -
906
Paratopies romantiques
Published 2013-12-01“…Through the example of French romanticism, this article aims at studying the importance of topology in the diverse writers’ scenographies that were then in force. …”
Get full text
Article -
907
Novel ASON routing implementation
Published 2006-01-01“…An OSPF-based ASON routing implementation was proposed.In the implementation a wavelength LSA and network node LSA were extended to distribute wavelength and topology information.The topology was discovered automatically and routing messages were delivered reliably.In addition,the RWA interface was designed to introduce RWA algorithms easily.The simulation results show that the routing protocol implementation could converge rapidly and could be extended easily at low protocol overhead.The routing information flooding trigger strategies and the feasibility of flooding wavelength information throughout the network are also analyzed.…”
Get full text
Article -
908
Study of density control algorithm based on optimization of vacant energy consumption in heterogeneous sensor networks
Published 2010-01-01“…The scheme of gradually topology expansion was adopted,and a density control algorithm DCA aiming to reduce the vacant energy consumption was presented for heterogeneous WSN. …”
Get full text
Article -
909
Smallest enclosing circle based localization approach for wireless sensor networks
Published 2008-01-01“…Consequently, SECL is more robust when the topology of anchors is not uniform. Simulation results show that SECL outperforms centroid by an average of 10%, and even better when the topology is not uniform.…”
Get full text
Article -
910
Inter-satellite link connection strategy for large-scale low earth orbit satellite networks
Published 2024-08-01“…Simulation results show that, from the perspective of geometric topology, the proposed strategies can effectively reduce the average number of routing hops and path switches. …”
Get full text
Article -
911
λ-Augmented Tree for Robust Data Collection in Advanced Metering Infrastructure
Published 2016-03-01“…In this work, we design a highly connected tree with a set of backup links to minimize the weakness of tree topology of SMs. A topology repair scheme is proposed to address the impact of a SM node failure on the connectivity of the augmented tree network. …”
Get full text
Article -
912
Boundedness of Multidimensional Dunkl-Hausdorff Operators
Published 2020-01-01Get full text
Article -
913
Note on limits of simply continuous and cliquish functions
Published 1994-01-01“…This result is obtained by a change of a topology on X and showing that a function f:(X,T)→Y is cliquish (has the Baire property) iff it is of the Baire class 1 (class 2) with respect to the new topology.…”
Get full text
Article -
914
H1∩Lp versus C1 Local Minimizers
Published 2014-01-01“…We show that a local minimizer of Φ in the C1 topology must be a local minimizer in the H1∩Lp topology, under suitable assumptions for the functional Φ=(1/2)∫Ω|∇u|2+(1/p)∫Ω|u|p−∫ΩF(x,u) with supercritical exponent p>2∗=2n/(n−2). …”
Get full text
Article -
915
-
916
Indoor Pedestrian Positioning Tracking Algorithm with Sparse Anchor Nodes
Published 2013-08-01“…In the proposed algorithm, the indoor topology is adopted to constrain and correct the results. …”
Get full text
Article -
917
Performance evaluation of AQM schemes: a comparative study
Published 2005-01-01“…A taxonomy of AQM schemes was presented, and typical AQM algorithms were compared in terms of a number of performance metrics under different traffic and network topology conditions based on the NS2 simulation platform. …”
Get full text
Article -
918
The Embedding Theorem of an L0-Prebarreled Module into Its Random Biconjugate Space
Published 2017-01-01“…We first prove Mazur’s lemma in a random locally convex module endowed with the locally L0-convex topology. Then, we establish the embedding theorem of an L0-prebarreled random locally convex module, which says that if (S,P) is an L0-prebarreled random locally convex module such that S has the countable concatenation property, then the canonical embedding mapping J of S onto J(S)⊂(Ss⁎)s⁎ is an L0-linear homeomorphism, where (Ss⁎)s⁎ is the strong random biconjugate space of S under the locally L0-convex topology.…”
Get full text
Article -
919
A single-phase seven-level switched capacitor with common ground inverter and improved phase-shift modulation technique
Published 2025-02-01“…This article proposes a single-phase seven-level transformer-less with common ground topology. The proposed topology utilizes 10 switches, 4 capacitors and 1 diode. …”
Get full text
Article -
920
Amplitude Death in Extended Time-Delay Coupled Oscillator Networks
Published 2025-01-01“…These ranges depend on the number of oscillators and the network topology. Thus, for situations where the number of oscillators and/or network topology are unknown, one cannot determine the delay time that induces amplitude death. …”
Get full text
Article