Articulation Points Research Articles

Fast winning strategies for Staller in the Maker–Breaker domination game

The Maker–Breaker domination game is played on a graph G by two players, called Dominator and Staller, who alternately choose a vertex that has not been played so far. Dominator wins the game if his moves form a dominating set. Staller wins if she plays all vertices from a closed neighborhood of a vertex v∈V(G). Dominator’s fast winning strategies were studied earlier. In this work, we concentrate on the cases when Staller has a winning strategy in the game. We introduce the invariant γSMB′(G) (resp., γSMB(G)) which is the smallest integer k such that, under any strategy of Dominator, Staller can win the game by playing at most k vertices, if Staller (resp., Dominator) plays first on the graph G.We prove some basic properties of γSMB(G) and γSMB′(G) and study the parameters’ changes under some operators as taking the disjoint union of graphs or deleting a cut vertex. We show that the inequality δ(G)+1≤γSMB′(G)≤γSMB(G) always holds and that for every three integers r,s,t with 2≤r≤s≤t, there exists a graph G such that δ(G)+1=r, γSMB′(G)=s, and γSMB(G)=t. We prove exact formulas for γSMB′(G) where G is a path or it is a tadpole graph which is obtained from the disjoint union of a cycle and a path by adding one edge between them.

Rooting performance of cassava cuttings due to the number of nodes and rooting media

AbstractCassava is a major food security crop in the developing world, providing a basic diet for over half a billion people. Stem cutting is the major propagation technique in commercial cassava production, despite its limitations in bulkiness and high cost. Research is lacking in optimizing the number of nodes for the most economical use of the planting material. It can be hypothesized that one or two node cuttings can be used in proper rooting media. Hence, a study was conducted to determine the appropriate number of nodes on selected rooting media for better rooting and shoot growth of cassava. A factorial combination of four number nodes (one, two, three, and standard, or 4–6 nodes) and four types of rooting media (sawdust, cocopeat, topsoil, and sand) was used in a completely randomized design with three replications. Nursery and field establishment data were collected. The result revealed that the interaction between the number of nodes and the media significantly (p < 0.05) affected all fresh and dry weights of root and shoot. Sawdust and cocopeat performed best in terms of root number, root length, leaf number, branch number, shoot length, and rooting percentage. Root fresh weight, root dry weight, shoot fresh weight, and shoot dry weight were higher when stem cuttings were planted using two or more nodes on cocopeat or sawdust as compared to planting them on topsoil or sand. The use of two or more nodes on cuttings using cocopeat or sawdust found outstanding results for rooting. However, the standard cutting was better for survival percentage during field establishment. The result confirmed that two nodes of cassava stem cutting are enough for the successful rooting of cassava, and sawdust promotes the rooting of cuttings. Hence, we recommend sawdust as a rooting medium and two or more nodes of stem cuttings of cassava.

Algorithms and hardness results for edge total domination problem in graphs

For a graph G=(V,E) without an isolated edge, a set D⊆E is an edge total dominating set of G if every edge e∈E is adjacent to at least one edge of D. The Minimum Edge Total Dominating Set problem is to compute a minimum cardinality edge total dominating set of G. It is known that the decision version of the problem is NP-complete for bipartite graphs, chordal graphs, and planar graphs. On the positive side, the problem is efficiently solvable for trees. In this paper, we further study the complexity of this problem in other graph classes. We design a linear-time algorithm to compute a minimum cardinality edge total dominating set in chain graphs, a subclass of bipartite graphs. We also propose linear-time algorithms for two subclasses of chordal graphs, namely, split graphs and proper interval graphs with no cut vertices. In addition, we show that the problem is APX-complete for graphs with maximum degree 3 and propose an approximation algorithm for the problem in k-regular graphs, where k≥4. We discuss the complexity difference between the Minimum Edge Dominating Set problem and Minimum Edge Total Dominating Set problem which seem to be closely related.

Some results on the complement of the dot product graph of a commutative ring

Let [Formula: see text] be a nonzero commutative ring with identity. Let [Formula: see text] be a positive integer. Let [Formula: see text] ([Formula: see text] times). The total dot product graph of [Formula: see text] denoted by [Formula: see text] is an undirected graph with vertex set which equals [Formula: see text] and distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text], where [Formula: see text] is the normal dot product of [Formula: see text] and [Formula: see text]. Let [Formula: see text] denote the set of all zero-divisors of [Formula: see text] and let us denote [Formula: see text] by [Formula: see text]. The zero-divisor dot product graph of [Formula: see text], denoted by [Formula: see text] is the subgraph of [Formula: see text] induced by [Formula: see text]. The graph [Formula: see text] (respectively, [Formula: see text]) was introduced and investigated by Badawi [Commun. Algebra 43(1) (2015) 43–50]. In this paper, we characterize [Formula: see text] such that [Formula: see text] (respectively, [Formula: see text]) is connected and determine the diameter and the radius of [Formula: see text] (respectively, [Formula: see text]) whenever it is connected. Moreover, if [Formula: see text] (respectively, [Formula: see text]) is connected, then we characterize [Formula: see text] such that [Formula: see text] (respectively, [Formula: see text]) admits a cut vertex.

Strong pair domination number in intuitionistic fuzzy influence graphs with application for the selection of hospital having the optimal medical facilities

A fuzzy influence graph is a well-organized, practical, and applicable tool to manage the uncertainty involved in all real-life challenges where uncertain facts, figures, and findings are present. A fuzzy influence graph gives knowledge about the effect of a node on any edge of the graph. This article presents the notion of domination for intuitionistic fuzzy influence graph (IFIG). Some results regarding the domination in fuzzy graphs are also extended in IFIGs. Some basic concepts in IFIGs such as walk, path, strength of influence pair, strong influence pair, strongest influence pair, weak influence pair, influence cut node, influence bridge, influence cut pair, complete IFIG, order of IFIG, size of IFIG, strong fuzzy influence pair domination number and minimum strong fuzzy influence pair domination number are being defined. Finally, an application is explored in which minimum strong fuzzy influence pair domination number is obtained by using minimal strong fuzzy influence pair dominating set, which indicates the hospital has the optimal medical facilities. To improve the analysis of our suggested model, the TOPSIS and VIKOR methods are presented together with various entropies.

Individual Differences in Auditory Training Benefits for Hearing Aid Users.

The present study aimed to examine whether individual differences in baseline speech perception could serve as predictors for the effectiveness and generalization of auditory training (AT) to non-trained tasks. Twelve adults, aged 60-75 years with bilateral hearing loss, completed a two-month, home-based, computerized AT program, involving sessions four times per week. Training tasks included the identification of vowel frontal, height, manner of articulation, point of articulation, voicing, and open-set consonant-vowel-consonant (CVC) words. Non-trained speech perception tests were conducted one month before AT, prior to training, after one and two months of training, and during a two-month follow-up. The results showed that one month of AT improved performance in most trained tasks, with generalization observed in the CVC words test and HeBio sentences with speech-shaped noise (SSN). No evidence of spontaneous learning or added benefit from an extra month of training was found. Most importantly, baseline speech perception predicted improvements in both training and post-training generalization tasks. This emphasizes the significance of adopting an individualized approach when determining the potential effectiveness of AT, applicable in both clinical and research contexts.

Extending protein interaction networks using proteoforms and small molecules.

Biological network analysis for high-throughput biomedical data interpretation relies heavily on topological characteristics. Networks are commonly composed of nodes representing genes or proteins that are connected by edges when interacting. In this study, we use the rich information available in the Reactome pathway database to build biological networks accounting for small molecules and proteoforms modeled using protein isoforms and post-translational modifications to study the topological changes induced by this refinement of the network representation. We find that improving the interactome modeling increases the number of nodes and interactions, but that isoform and post-translational modification annotation is still limited compared to what can be expected biologically. We also note that small molecule information can distort the topology of the network due to the high connectedness of these molecules, which does not necessarily represent the reality of biology. However, by restricting the connections of small molecules to the context of biochemical reactions, we find that these improve the overall connectedness of the network and reduce the prevalence of isolated components and nodes. Overall, changing the representation of the network alters the prevalence of articulation points and bridges globally but also within and across pathways. Hence, some molecules can gain or lose in biological importance depending on the level of detail of the representation of the biological system, which might in turn impact network-based studies of diseases or druggability. Networks are constructed based on data publicly available in the Reactome Pathway knowledgebase: reactome.org.

VISUAL CULTURAL PRACTICES OF POSTCOLONIAL ELITE SCHOOLS IN GLOBALIZING CIRCUMSTANCES

In this article the author reports on the matter of the contemporary management and conservation of histories in the visual domains of three postcolonial elite school sites: Old Cloisters in Barbados, Rippon College in India, and Straits School in Singapore. These schools form part of a 5-year, 9-country study of postcolonial elite schools in globalizing circumstances—a flash point of articulation between these schools and profound change. The article turns on this fundamental fact: that these schools, which are the products of societies marked historically by British colonial and imperial encounters of the eighteenth and nineteenth centuries and the first half of the twentieth, are now driven forward by new energies associated with marketization, neoliberalism and globalization as these countries lurch forward unevenly towards a postdevelopmental era. This turn towards neoliberal globalization has precipitated radically new needs, interests, desires, capacities and competitive logics among the middle class and upwardly mobile young and their parents in each of these societies that then press powerfully onto these elite schools, and their cultivated pasts as they reside in school anthems, flags, emblems, banners and rituals of assembly, formal dress and decorum. All of this is taking place in the glow of digitalization as these schools increasingly move online locating themselves in photo and video-sharing websites such as YouTube, Facebook and Flicker as well as websites that each individual school is creating to consecrate school heritage. In what follows, then, the author calls attention to the theoretical significance and practical dimensions of the work that these select schools are doing on their rich heritages and historical archives in response to the new demands of globalization and transforming educational markets.

Acoustic Variability of /ptk/ and /bdɡ/ in Spanish: A Pilot Study

Propelled by existing research on stop consonant variability in Spanish, this pilot study provides a preliminary acoustic analysis of stop consonant lenition exhibited by speakers of six different varieties of Spanish in Latin America and Spain to explore the gradient acoustic variability in the production of /ptk/ and /bdɡ/ among speakers of different Spanish varieties. Using the acoustic correlate of relative intensity, this analysis considers the effect of various linguistic factors (phoneme, lexical stress, point of articulation, sonority) as well as the extralinguistic factor of Spanish variety on the production of stop consonants in initial, intervocalic position. Results display a higher degree of weakening among speakers of Peninsular and Insular varieties of Spanish compared with those of Latin-American varieties such as Colombian, Mexican, and Peruvian. These exploratory data support the gradient nature of consonant lenition and provide a baseline for future research on stop consonant variability across the Spanish-speaking world.

Code and Data Repository for Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search

This study considers a well-known critical node detection problem that aims to minimize a pairwise connectivity measure of an undirected graph via the removal of a subset of nodes (referred to as critical nodes) subject to a cardinality constraint. Potential applications include epidemic control, emergency response, vulnerability assessment, carbon emission monitoring, network security and drug design. To solve the problem, we present a "reduce-solve-combine" memetic search approach that integrates a problem reduction mechanism into the popular population-based memetic algorithm framework. At each generation, a common pattern mined from two parent solutions is first used to reduce the given problem instance, then the reduced instance is solved by a component-based hybrid neighborhood search that effectively combines an articulation point impact strategy and a node weighting strategy, and finally an offspring solution is produced by combining the mined common pattern and the solution of the reduced instance. Extensive evaluations on 42 real-world and synthetic benchmark instances show the efficacy of the proposed method, which discovers 9 new upper bounds and significantly outperforms the current state-of-the-art algorithms. Investigation of key algorithmic modules additionally discloses the importance of the proposed ideas and strategies. Finally, we demonstrate the generality of the proposed method via its adaptation to solve the node-weighted critical node problem.

Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search

This study considers a well-known critical node detection problem that aims to minimize a pairwise connectivity measure of an undirected graph via the removal of a subset of nodes (referred to as critical nodes) subject to a cardinality constraint. Potential applications include epidemic control, emergency response, vulnerability assessment, carbon emission monitoring, network security, and drug design. To solve the problem, we present a “reduce-solve-combine” memetic search approach that integrates a problem reduction mechanism into the popular population-based memetic algorithm framework. At each generation, a common pattern mined from two parent solutions is first used to reduce the given problem instance, then the reduced instance is solved by a component-based hybrid neighborhood search that effectively combines an articulation point impact strategy and a node weighting strategy, and finally an offspring solution is produced by combining the mined common pattern and the solution of the reduced instance. Extensive evaluations on 42 real-world and synthetic benchmark instances show the efficacy of the proposed method, which discovers nine new upper bounds and significantly outperforms the current state-of-the-art algorithms. Investigation of key algorithmic modules additionally discloses the importance of the proposed ideas and strategies. Finally, we demonstrate the generality of the proposed method via its adaptation to solve the node-weighted critical node problem. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72371157, 61903144, 72031007]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0130 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0130 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Are vertebrates constrained to two sets of paired appendages? The morphology, development, and evolution of pre-pelvic claspers in the Holocephali.

Holocephalans exhibit auxiliary appendages called pre-pelvic claspers (PPCs) that are located anterior to the pelvic fins, while pelvic claspers are pelvic fin modifications located posteriorly as modified metapterygia. Articulation points of the PPCs have not previously been imaged or evaluated in a comparative context, therefore, they may represent modified pelvic fin structures if they articulate with the propterygium. Alternatively, they could represent the only example of an independent third set of paired appendages in an extant taxon, if they articulate independently from any pelvic fin basal cartilages, challenging the current paradigm that extant jawed vertebrates are constrained to two sets of paired appendages. Two extinct groups, including Placoderms and Acanthodians, exhibit variation in the number of paired appendages, suggesting this may be a plesiomorphic trait. We evaluated PPC developmental growth rates, morphology, and articulation points in spotted ratfish (Hydrolagus Colliei, Holocephali). We also compared variation in PPC morphology among representatives of the three extant holocephalan families. Both, the pre-pelvic and pelvic claspers exhibit a dramatic surge in growth at sexual maturity, and then level off, suggesting synchronous development via shared hormonal regulation. While mature females are larger than males, pelvic fin growth and development is faster in males, suggesting a selective advantage to larger fins with faster development. Finally, microcomputed tomography scans revealed that PPCs are not modified propterygia, nor do they articulate with the propterygium. They articulate with the anterior pre-pelvic process on the anterior puboischiadic bar (or pelvic girdle), suggesting that while they are associated with the pelvic girdle, they may indeed represent a third, independent set of paired appendages in extant holocephalans.

A modification of the random cutting model

AbstractWe propose a modification to the random destruction of graphs: given a finite network with a distinguished set of sources and targets, remove (cut) vertices at random, discarding components that do not contain a source node. We investigate the number of cuts required until all targets are removed, and the size of the remaining graph. This model interpolates between the random cutting model going back to Meir and Moon (J. Austral. Math. Soc.11, 1970) and site percolation. We prove several general results, including that the size of the remaining graph is a tight family of random variables for compatible sequences of expander-type graphs, and determine limiting distributions for binary caterpillar trees and complete binary trees.

Epistatic Relationship between MGV1 and TRI6 in the Regulation of Biosynthetic Gene Clusters in Fusarium graminearum.

Genetic studies have shown that the MAP kinase MGV1 and the transcriptional regulator TRI6 regulate many of the same biosynthetic gene clusters (BGCs) in Fusarium graminearum. This study sought to investigate the relationship between MGV1 and TRI6 in the regulatory hierarchy. Transgenic F. graminearum strains constitutively expressing MGV1 and TRI6 were generated to address both independent and epistatic regulation of BGCs by MGV1 and TRI6. We performed a comparative transcriptome analysis between axenic cultures grown in nutrient-rich and secondary metabolite-inducing conditions. The results indicated that BGCs regulated independently by Mgv1 included genes of BGC52, whereas genes uniquely regulated by TRI6 included the gene cluster (BGC49) that produces gramillin. To understand the epistatic relationship between MGV1 and TRI6, CRISPR/Cas9 was used to insert a constitutive promoter to drive TRI6 expression in the Δmgv1 strain. The results indicate that BGCs that produce deoxynivalenol and fusaoctaxin are co-regulated, with TRI6 being partially regulated by MGV1. Overall, the findings from this study indicate that MGV1 provides an articulation point to differentially regulate various BGCs. Moreover, TRI6, embedded in one of the BGCs provides specificity to regulate the expression of the genes in the BGC.

Near-optimal distributed computation of small vertex cuts

Near-optimal distributed computation of small vertex cuts

Inverse Graphs in m-Polar Fuzzy Environments and Their Application in Robotics Manufacturing Allocation Problems with New Techniques of Resolvability

The inverse in crisp graph theory is a well-known topic. However, the inverse concept for fuzzy graphs has recently been created, and its numerous characteristics are being examined. Each node and edge in m-polar fuzzy graphs (mPFG) include m components, which are interlinked through a minimum relationship. However, if one wants to maximize the relationship between nodes and edges, then the m-polar fuzzy graph concept is inappropriate. Considering everything we wish to obtain here, we present an inverse graph under an m-polar fuzzy environment. An inverse mPFG is one in which each component’s membership value (MV) is greater than or equal to that of each component of the incidence nodes. This is in contrast to an mPFG, where each component’s MV is less than or equal to the MV of each component’s incidence nodes. An inverse mPFG’s characteristics and some of its isomorphic features are introduced. The α-cut concept is also studied here. Here, we also define the composition and decomposition of an inverse mPFG uniquely with a proper explanation. The connectivity concept, that is, the strength of connectedness, cut nodes, bridges, etc., is also developed on an inverse mPF environment, and some of the properties of this concept are also discussed in detail. Lastly, a real-life application based on the robotics manufacturing allocation problem is solved with the help of an inverse mPFG.

Kalman Filtresi ve Küresel En Yakın Komşu Yöntemi ile Çok Kişili Gerçek Zamanlı Poz Takibi

Poz tahmini, kamera ile çekilen görüntülerde insan iskeletindeki anahtar noktaların piksel konumlarının tespit edilmesi amacıyla ortaya çıkmıştır. Poz tahmini yöntemlerinin çıktıları görüntüde tespit edilen tüm eklem noktalarının piksel değerlerini ilişkilendirdiği kişiye göre vermektedir. Videolarda kişilerin hareketlerini anlamlandırmak için ardışık görüntü kareleri boyunca kimliklendirilmeleri gerekir. Böylece kişilerin video boyunca ne zaman hangi hareketleri yaptığı tespit edilebilir. Bu çalışmada sabit hızlı ve sabit ivmeli hareket modeline göre Kalman filtresi kullanarak küresel en yakın komşu (KEYK) algoritması ile tasarlanan çok kişili poz takibi yönteminin verdiği sonuçlar incelenmiştir. Geliştirilen ön işleme adımlarının poz tahmini yöntemlerinin kalitesini artırarak poz takibine etkisi de tespit edilmiştir. Bu amaçla PoseTrack veri kümesi üzerinde DCPose ve OpenPose poz tahmini yöntemlerinin başarımı değerlendirilmiştir. Ön işleme adımları ile sistemin başarımının her iki yöntem için de yükseldiği görülmüştür. Gerçek zamanlı çalışabilen, başarılı bir poz tahmini yöntemi olan ve düşük kaynak tüketimine sahip OpenPose yöntemi ile literatürde en iyi sonuçları veren DCPose yönteminin sonuçları incelendiğinde çok kişili poz takibi konusunda DCPose yönteminin daha başarılı sonuçlar verdiği görülmüştür. 550 farklı video ile elde edilen sonuçlar ön işleme adımları uygulandığında başarımı sabit hızlı ve sabit ivmeli hareket modellerinde aşağıdan yukarı yöntemi OpenPose için %22.6 ve %16.02, yukarıdan aşağı yöntemi DCPose için %21.2 ve %21.8 artırmıştır.

Inserting Multiple Edges into a Planar Graph

Let $G$ be a connected planar (but not yet embedded) graph and $F$ a set of edges with ends in $V(G)$ and not belonging to $E(G)$. The multiple edge insertion problem (MEI) asks for a drawing of $G+F$ with the minimum number of pairwise edge crossings, such that the subdrawing of $G$ is plane. A solution to this problem is known to approximate the crossing number of the graph $G+F$, but unfortunately, finding an exact solution to MEI is NP-hard for general $F$. The MEI problem is linear-time solvable for the special case of $|F|=1$ (SODA 01 and Algorithmica), and there is a polynomial-time solvable extension in which all edges of $F$ are incident to a common vertex which is newly introduced into $G$ (SODA 09). The complexity for general $F$ but with constant $k=|F|$ was open, but algorithms both with relative and absolute approximation guarantees have been presented (SODA 11, ICALP 11 and JoCO). We present a fixed-parameter algorithm for the MEI problem in the case that $G$ is biconnected, which is extended to also cover the case of connected $G$ with cut vertices of bounded degree. These are the first exact algorithms for the general MEI problem, and they run in time $O(|V(G)|)$ for any constant $k$.

Modeling of Inhibition of Tetrahymena pyriformis growth by Aliphatic Alcohols and Amines pollution of l’ environmental

To assess the relative toxicity of a mixed series of 21(linear and branched-chain) alcohols and 9 normal aliphatic amines in terms of the 50% inhibitory growth concentration (IGC50) of Tetrahymena Pyriformis, a Quantitative Modeling study know as a Structure-Activity/property/Toxicity Relationship (QSAR/QSPR/QSTR) was conducted (20 training,10 tests). The used least squares LS method has been using MINITAB 16 Software and nom-parametric estimation (least absolute deviation LAD) (robust regression method) has been using Calculation Programs by MATLAB Software. The applied simple linear regression approach is based on theoretical H4p (GETAWAY descriptor) molecular descriptor from DRAGON software The performance of regression is better if the distribution of errors has normal, in this case we use the least squares LS method for statistical analysis. When the data does not have a natural assumption, we move to another method of analysis that is more robust and more frequent for the presence of the points of articulation, which is the least absolut deviation method (LAD). The findings of statistical analysis for the chosen model (QSAR) using simple linear Regression using the least Squares Method were R^2=97.39% ,Q^2=96.69% ,Q_bOOT^2=96.24%,Q_EXT^2=93.91% ,R_adj^2=97.24%, S=0.248 Anderson Darling (AD) test =1.57 >0.752 , symmetry coefficient (ou skeweness) (sk= 2.14>0 ) , flatness coefficient (Kurtosis) (ku=5.75>3) and Jarque and Bera Test (JB= 42.84>5.9942. the results did not follow the normal law (unnormal). The coefficient of determination and the value of standard deviation are both highly sensitive to the presence of aberrant compounds(abnormales), as the R^2value moved from 87, 96 % to 94.18 %, which increased by a value of 6.22% and the value of standard deviation (S) moved from 0.399 to 0.303, it increased by a value of 25 % after removing aberrant compound (abnormalie) are interpreted as better adjustment and they are positively. After removing the aberrant compound, we did not see any change in the lines coefficients, indicatting that the function’s graph is stable, demonstrating the LAD method and increased power, which are unaffected by the presence of aberrant compounds Consequently, which means that the model of one descriptor selected is good and statistically strong, Three influential compounds detected ((one compound of training, two compounds of Test) and important the model and absence of studied sample aberrants compounds.

Dynamic amplification of multi-span simply-supported prestressed concrete girder viaducts subjected to multi-body heavy vehicles

High productivity freight vehicles (HPFVs) are used in many countries to address increasing freight demand. However, it is then necessary to assess the safety of existing bridge structures subjected to HPFVs because of their increasing mass and dimension. A critical part of this work is to assess the dynamic amplification of such vehicles, without undue conservatism, often based on vehicle–bridge interaction (VBI) modelling. In the VBI problem, the vehicle model is usually derived using the Principle of Virtual Work or Euler–Lagrange methods. However, HPFVs are characterized by multiple bodies and articulation points and these techniques quickly become intractable. Alongside the vehicle model, the bridge is often assumed to be a single simply-supported span, or a few continuous spans, whereas many urban bridge viaducts, in particular, have multiple prestressed concrete (PSC) girder simply-supported spans. Furthermore, these bridges typically have an upwards hog as a result of the prestress and it is hypothesized that certain combinations of vehicle, hog, span length, and number of spans, could produce a large dynamic amplification of static load effects. In this work, Kane’s Method is applied to heavy vehicle with multi-trailers combinations which provides a relatively easy, systematic, and numerical manipulation means of determining the vehicle dynamic equations. The 9-axle B-Double vehicle, common in Australia, is used as an example to illustrate the procedure of deriving the vehicle dynamic equations. We apply the resulting vehicle models in a comprehensive VBI model to consider the dynamic amplification of PSC girder viaducts. The results indicate that the studied PSC girder viaducts experience higher amplification than the equivalent single-span simply-supported bridges. Recommendations for future studies and practice, such as the number of spans in the viaduct to obtain the ‘convergence’ of dynamic amplification, are given.