NSTL国家科技图书文献中心

1. Direct loss-based seismic retrofit of reinforced concrete frames NSTL国家科技图书文献中心

Rubini, Giorgio | Calvi, Gian Michele ... - 《Bulletin of earthquake engineering》 - 2025,23(1) - 327～357 - 共31页

摘要： of seismic deformation demand of single degree* of* | -degree-of-freedom models showing satisfactory results | In earthquake-prone areas, structures* not* | paper introduces a procedure for the design of | buildings to achieve - rather than be bounded* by - a*

关键词： Retrofit | Design | Loss | Frame | Surrogate modelling

2. Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs NSTL国家科技图书文献中心

Meng He | J. Ian Munro ... - 《2024 Data Compression Conference: DCC 2024, Snowbird, Utah, USA, 19-22 March 2024》 - Data Compression Conference - 2024, - 502～511 - 共10页

摘要： subclasses of interval graphs: those with maximum degree* σ1* | that both bounded* degree and bounded chromatic number* | An interval graph is the intersection graph of | intervals on the real line. We consider the problem of | constructing space efficient data structures* for two*

关键词： Navigation | Data compression | Data structures | Time complexity

3. Topological,Spectroscopic and Energetic Properties of Cycloparaphenylene Series NSTL国家科技图书文献中心

Micheal Arockiaraj | S.Ruth Julie Kavitha ... - 《Polycyclic Aromatic Compounds: The Journal of International Society for Polycyclic Aromatic Compounds》 - 2024,44(2) - 1072～1094 - 共23页 - 被引量：1

摘要： of novel chemical structures* whose behavior and* | show that such structures* are not bounded by the* | expressions of degree,distance and closeness-related | stabilities of the three structures* using the graph spectra* | hydrocarbons that represent the segments of carbon nanotubes

关键词： Cycloparaphenylenes | topological indices | cut method | energetics | NMR and ESR spectra

4. Simulating Nonlinear Beating Phenomena Induced by Dry Friction in Dynamic Systems NSTL国家科技图书文献中心

Iyabo G. Lawal | Michael R. Haberman ... - 《Nonlinear Structures & Systems, Volume 1: Proceedings of the 41st IMAC, A Conference and Exposition on Structural Dynamics 2023.Orlando, Florida, USA.February 13-16, 2023》 - IMAC Conference and Exposition on Structural Dynamics - 2024, - 93～96 - 共4页

摘要： result of nonlinear constitutive behavior of vibrating | structures with nonlinear components. These behaviors | induced by the combination of near equilibrium damping | producing self-excitation in structures, is explored as a | mechanism for producing beat phenomena in structures. The

关键词： Beating phenomena | Empirical mode decomposition | Friction | Mode lock-in | Self-excitation

5. The structure of digraphs with excess one NSTL国家科技图书文献中心

Tuite, James - 《Journal of Graph Theory》 - 2024,106(3/4) - 411～434 - 共24页

摘要：$-geodetic digraph with minimum out-degree d $d$ is bounded | possible structures* of the outlier function and prove the* | nonexistence of certain digraphs with degree* three and excess* | $ with length not exceeding k $k$. The order of a k $k | = 1 $k=1$, so it is of interest to look for k $k

关键词： Cage | degree/geodecity problem | digraph | excess | MOORE DIGRAPHS | GRAPHS

6. Distributed Latency-Efficient Beaconing for Multi-channel Asynchronous Duty-Cycled IoT Networks NSTL国家科技图书文献中心

Peng Long | Yuhang Wu ... - 《Algorithms and Architectures for Parallel Processing: 23rd International Conference, ICA3PP 2023, Tianjin, China, October 20-22, 2023, Proceedings, Part V》 - International Conference on Algorithms and Architectures for Parallel Processing - 2024, - 39～55 - 共17页

摘要： of Minimum Latency Beaconing Schedule (MLBS), which | special structures* are designed, which works in O(Δ* | ) time, where Δ denotes the maximum node degree* in the* | schedule is proposed with a theoretical bounded, taking | the active time slots of each node into account

关键词： Beaconing schedule | Low latency | Distributed algorithm | Multi-channel | Duty-cycled wireless networks

7. Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number EI 工程索引 NSTL国家科技图书文献中心

Chakraborty, Sankard... | Jo, Seungbum - 《Theoretical computer science》 - 2023,941 - 156～166 - 共11页 - 被引量：2

摘要： when the maximum degree* of G is bounded by A, we show* | graphs with bounded* degree for the first time in* | with bounded* degree or bounded chromatic number* | In this paper we initiate the study of | designing parameterized compact data structures* for an*

关键词： Interval graphs | Circular -arc graphs | Compact data structures | Navigational queries

8. RANDOM WALKS AND FORBIDDEN MINORS I: AN n 1/2+o(1) -QUERY ONE-SIDED TESTER FOR MINOR CLOSED PROPERTIES ON BOUNDED DEGREE GRAPHS NSTL国家科技图书文献中心

Kumar, Akash | Seshadhri, C.... - 《SIAM Journal on Computing》 - 2023,52(6) - 216～249 - 共34页

摘要：Let G be an undirected, bounded* degree graph* | epsilon n edges from a bounded* degree graph G to make it* | bound of Czumaj et al. [Random Structures* Algorithms* | )) factors, this resolves a conjecture of Benjamini | -2218] on the existence of one-sided property testers

关键词： property testing | minor-free graphs | bounded degree graphs | EXPANSION | APPROXIMATION

9. Distributed algorithms, the Lovasz Local Lemma, and descriptive combinatorics NSTL国家科技图书文献中心

Bernshteyn, Anton - 《Inventiones Mathematicae》 - 2023,233(2) - 495～542 - 共48页 - 被引量：4

摘要： bounded degree; roughly speaking, deterministic | graphs and other combinatorial structures on standard | -behaved in the sense of topology or measure. To this end | graphs) yield well-behaved colorings of Borel graphs of | versions of the Symmetric Lovasz Local Lemma (under the

关键词： COLORING GRAPHS | NUMBER

10. Infinite WARM graphs III: strong reinforcement regime NSTL国家科技图书文献中心

Hirsch, Christian | Holmes, Mark ... - 《Nonlinearity》 - 2023,36(6) - 3013～3042 - 共30页

摘要： of bounded* degree. The model involves a parameter* | alpha> 0 governing the strength of reinforcement, and | Poisson clock rates lambda(v) at the vertices nu of the | of the edges incident to it is reinforced, with | describe the (random) subgraph E-infinity, consisting of

摘要： of seismic deformation demand of single degree* of* | -degree-of-freedom models showing satisfactory results | In earthquake-prone areas, structures* not* | paper introduces a procedure for the design of | buildings to achieve - rather than be bounded* by - a*

关键词： Retrofit | Design | Loss | Frame | Surrogate modelling

摘要： subclasses of interval graphs: those with maximum degree* σ1* | that both bounded* degree and bounded chromatic number* | An interval graph is the intersection graph of | intervals on the real line. We consider the problem of | constructing space efficient data structures* for two*

关键词： Navigation | Data compression | Data structures | Time complexity

摘要： of novel chemical structures* whose behavior and* | show that such structures* are not bounded by the* | expressions of degree,distance and closeness-related | stabilities of the three structures* using the graph spectra* | hydrocarbons that represent the segments of carbon nanotubes

关键词： Cycloparaphenylenes | topological indices | cut method | energetics | NMR and ESR spectra

摘要： result of nonlinear constitutive behavior of vibrating | structures with nonlinear components. These behaviors | induced by the combination of near equilibrium damping | producing self-excitation in structures, is explored as a | mechanism for producing beat phenomena in structures. The

关键词： Beating phenomena | Empirical mode decomposition | Friction | Mode lock-in | Self-excitation

关键词： Cage | degree/geodecity problem | digraph | excess | MOORE DIGRAPHS | GRAPHS

摘要： of Minimum Latency Beaconing Schedule (MLBS), which | special structures* are designed, which works in O(Δ* | ) time, where Δ denotes the maximum node degree* in the* | schedule is proposed with a theoretical bounded, taking | the active time slots of each node into account

关键词： Beaconing schedule | Low latency | Distributed algorithm | Multi-channel | Duty-cycled wireless networks

摘要： when the maximum degree* of G is bounded by A, we show* | graphs with bounded* degree for the first time in* | with bounded* degree or bounded chromatic number* | In this paper we initiate the study of | designing parameterized compact data structures* for an*

关键词： Interval graphs | Circular -arc graphs | Compact data structures | Navigational queries

摘要：Let G be an undirected, bounded* degree graph* | epsilon n edges from a bounded* degree graph G to make it* | bound of Czumaj et al. [Random Structures* Algorithms* | )) factors, this resolves a conjecture of Benjamini | -2218] on the existence of one-sided property testers

关键词： property testing | minor-free graphs | bounded degree graphs | EXPANSION | APPROXIMATION

摘要： bounded degree; roughly speaking, deterministic | graphs and other combinatorial structures on standard | -behaved in the sense of topology or measure. To this end | graphs) yield well-behaved colorings of Borel graphs of | versions of the Symmetric Lovasz Local Lemma (under the

关键词： COLORING GRAPHS | NUMBER

摘要： of bounded* degree. The model involves a parameter* | alpha> 0 governing the strength of reinforcement, and | Poisson clock rates lambda(v) at the vertices nu of the | of the edges incident to it is reinforced, with | describe the (random) subgraph E-infinity, consisting of

关键词： reinforcement | probability | dynamical systems

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： of seismic deformation demand of single degree of | -degree-of-freedom models showing satisfactory results | In earthquake-prone areas, structures not | paper introduces a procedure for the design of | buildings to achieve - rather than be bounded by - a

关键词： Retrofit | Design | Loss | Frame | Surrogate modelling

摘要： subclasses of interval graphs: those with maximum degree σ1 | that both bounded degree and bounded chromatic number | An interval graph is the intersection graph of | intervals on the real line. We consider the problem of | constructing space efficient data structures for two

关键词： Navigation | Data compression | Data structures | Time complexity

摘要： of novel chemical structures whose behavior and | show that such structures are not bounded by the | expressions of degree,distance and closeness-related | stabilities of the three structures using the graph spectra | hydrocarbons that represent the segments of carbon nanotubes

关键词： Cycloparaphenylenes | topological indices | cut method | energetics | NMR and ESR spectra

摘要： result of nonlinear constitutive behavior of vibrating | structures with nonlinear components. These behaviors | induced by the combination of near equilibrium damping | producing self-excitation in structures, is explored as a | mechanism for producing beat phenomena in structures. The

关键词： Beating phenomena | Empirical mode decomposition | Friction | Mode lock-in | Self-excitation

关键词： Cage | degree/geodecity problem | digraph | excess | MOORE DIGRAPHS | GRAPHS

摘要： of Minimum Latency Beaconing Schedule (MLBS), which | special structures are designed, which works in O(Δ | ) time, where Δ denotes the maximum node degree in the | schedule is proposed with a theoretical bounded, taking | the active time slots of each node into account

关键词： Beaconing schedule | Low latency | Distributed algorithm | Multi-channel | Duty-cycled wireless networks

摘要： when the maximum degree of G is bounded by A, we show | graphs with bounded degree for the first time in | with bounded degree or bounded chromatic number | In this paper we initiate the study of | designing parameterized compact data structures for an

关键词： Interval graphs | Circular -arc graphs | Compact data structures | Navigational queries

摘要：Let G be an undirected, bounded degree graph | epsilon n edges from a bounded degree graph G to make it | bound of Czumaj et al. [Random Structures Algorithms | )) factors, this resolves a conjecture of Benjamini | -2218] on the existence of one-sided property testers

关键词： property testing | minor-free graphs | bounded degree graphs | EXPANSION | APPROXIMATION

摘要： bounded degree; roughly speaking, deterministic | graphs and other combinatorial structures on standard | -behaved in the sense of topology or measure. To this end | graphs) yield well-behaved colorings of Borel graphs of | versions of the Symmetric Lovasz Local Lemma (under the

关键词： COLORING GRAPHS | NUMBER

摘要： of bounded degree. The model involves a parameter | alpha> 0 governing the strength of reinforcement, and | Poisson clock rates lambda(v) at the vertices nu of the | of the edges incident to it is reinforced, with | describe the (random) subgraph E-infinity, consisting of

关键词： reinforcement | probability | dynamical systems

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： of seismic deformation demand of single degree* of* | -degree-of-freedom models showing satisfactory results | In earthquake-prone areas, structures* not* | paper introduces a procedure for the design of | buildings to achieve - rather than be bounded* by - a*

摘要： subclasses of interval graphs: those with maximum degree* σ1* | that both bounded* degree and bounded chromatic number* | An interval graph is the intersection graph of | intervals on the real line. We consider the problem of | constructing space efficient data structures* for two*

摘要： of novel chemical structures* whose behavior and* | show that such structures* are not bounded by the* | expressions of degree,distance and closeness-related | stabilities of the three structures* using the graph spectra* | hydrocarbons that represent the segments of carbon nanotubes

摘要： of Minimum Latency Beaconing Schedule (MLBS), which | special structures* are designed, which works in O(Δ* | ) time, where Δ denotes the maximum node degree* in the* | schedule is proposed with a theoretical bounded, taking | the active time slots of each node into account

摘要： when the maximum degree* of G is bounded by A, we show* | graphs with bounded* degree for the first time in* | with bounded* degree or bounded chromatic number* | In this paper we initiate the study of | designing parameterized compact data structures* for an*

摘要：Let G be an undirected, bounded* degree graph* | epsilon n edges from a bounded* degree graph G to make it* | bound of Czumaj et al. [Random Structures* Algorithms* | )) factors, this resolves a conjecture of Benjamini | -2218] on the existence of one-sided property testers

摘要： of bounded* degree. The model involves a parameter* | alpha> 0 governing the strength of reinforcement, and | Poisson clock rates lambda(v) at the vertices nu of the | of the edges incident to it is reinforced, with | describe the (random) subgraph E-infinity, consisting of