FLIGHT CLASSIFICATION MODEL BASED ON TRANSITIVE CLOSURE ALGORITHM AND APPLICATION TO FLIGHT SEQUENCING PROBLEM

A new arrival and departure flight classification method based on the transitive closure algorithm （TCA） is proposed. Firstly, the fuzzy set theory and the transitive closure algorithm are introduced. Then four different factors are selected to establish the flight classification model and a method is given to calculate the delay cost for each class. Finally, the proposed method is implemented in the sequencing problems of flights in a terminal area, and results are compared with that of the traditional classification method（TCM）. Results show that the new classification model is effective in reducing the expenses of flight delays, thus optimizing the sequences of arrival and departure flights, and improving the efficiency of air traffic control.

On k-Transitive Closures of Directed Paths

In this paper we study the structure of k-transitive closures of directed paths and formulate several properties. Concept of k-transitive orientation generalizes the traditional concept of transitive orientation of a graph.

Graphs on which a group of order pq acts edge-transitively

Let F be a finite simple undirected graph with no isolated vertices. Let p, q be prime numbers with p≥q. We complete the classification of the graphs on which a group of order pq acts edge-transitively. The results are the following. If Aut（Г） contains a subgroup G of order pq that acts edge-transitively on F, then F is one of the following graphs： （1） pK1,1; （2） pqK1,1; （3） pgq,1; （4） qKp,1 （p 〉 q）; （5） pCq （q 〉 2）; （6） qCp （p 〉 q）; （7） Cp （p 〉 q = 2）; （8） Cpq; （9） （Zp, C） whereC={±r^μ ｜μ∈Zq} withq〉2, q｜（p-1） and r≠1≡r^q （modp）; （10） Kp,1 （p 〉 q）; （11） a double Cayley graph B（G,C） with C = {1-r^μ ｜ μ ∈ Zq} and r≠1≡r^q （modp）; （12） Kpq,1;or （13） Kp,q.

Practical Method for Determining All the Minimum Solutions of Fuzzy Matrix Equation and Transitive Closure of Fuzzy Relation

In this paper,the new theory frame and practical methhod for determining all the minimum solutions of Fuzzy matrix equation and transitive closure of Fuzzy relation is described,and it has been carried out on the miero-computer quickly and accurately.

The Properties of Transitive Bipartite Tournaments

Let Γm，n^* denote all m × n strongly connected bipartite tournaments and a(m, n) the maximal integer k such that every m × n bipartite tournament contains at least a k × k transitive bipartite subtournament. Let t ( m, n, k, l ) = max{t( Tm,n，k, l ) : Tm,n∈Γm，n^*}, where t ( Tm,n, k, l ) is the number of k × l(k≥2,l≥2) transitive bipartite subtournaments contained in Tm,n∈Γm，n^*. We obtain a method of graph theory for solving some integral programmings, investigate the upper bounds of a(m,n) and obtain t (m,n, k，l).

The components transitive regularity of three dosage forms of Liuwei Dihuang Fufang

Objective To explore the transitive regularity of holistic constituents from the crude slices of the medicinal raw materials(MCS)to the formula granules(FG),fufang decoction(FD),and finally,the concentrated pills(CP)of Liuwei Dihuang Fufang(六味地黄复方,LWDHF).Methods Samples for MCS,FG,FD,and CP of LWDHF were obtained,and a fingerprint data-base was established using high-performance liquid chromatography(HPLC),by separating the samples in an XB-C18 column and analyzing the transitive regularity of components us-ing the total quantum statistical moment(TQSM),including total quantum zero moment(AUCT),total quantum first moment(MRTT),total quantum second moment(VRTT),and its similarity approach.The AUCT,MRTT,and VRTT were calculated based on the representative HPLC chromatograms of FG,FD,and CP of LWDHF.Results AUCT of FG,FD,and CP of LWDHF was 71804,46553,and 144646μV·s,respectively;MRTT was 14.43,14.54,and 18.85 min,respectively;and VRTT was 106.98,112.84,and 269.12 min2,respectively.Comparing the similarity of FG/FD,FG/CP and FD/CP of LWDHF,the TQSM similarity values were 98.66%,76.62%,and 75.37%,respectively,whereas the tradi-tional similarity evaluation values were 98.68%,85.43%,and 85.60%,respectively.Conclusion The results perform little distinction in the total composition between FG and FD,whereas some distinction existed between FD and CP.Experimental evidence,therefore indicates that FG could be used as the alternative of MCS in clinical applications.

Transitive filtration of Lie superalgebras

Let L be a finite dimensional simple Lie superalgebra, and a sufficient condition is obtained for the length of transitive filtration of L to be greater than zero.

CLASSIFICATION OF PRIMITIVE (J_1,2)-ARC TRANSITIVE GRAPHS

In the author＇s Ph. D thesis, a non-quasiprimitive graph admitting a quasiprimitive automorphism group isomorphic to J1 was constructed ,where J1 is Janko simple group of order 175560. Is this the only one for J1？ In this paper all primitive （J1,2）-arc transitive graphs Г are given and that AutГ≌J1 is proved.

Super Cyclically Edge Connected Half Vertex Transitive Graphs

Tian and Meng in [Y. Tian and J. Meng, λc -Optimally half vertex transitive graphs with regularity k, Information Processing Letters 109 (2009) 683 - 686] shown that a connected half vertex transitive graph with regularity k and girth g(G) ≥ 6 is cyclically optimal. In this paper, we show that a connected half vertex transitive graph G is super cyclically edge-connected if minimum degree δ(G) ≥ 6 and girth g(G) ≥ 6.

Assessing Dual Approaches for Ranking Score Computation via Transitive Triads

The possibility of developing a complete graph invariant computable in polynomial time remains an open question. Consequently, creating efficient algorithms to verify non-isomorphism, including heuristic approaches, is essential. Effective implementation of these heuristics necessitates both the adaptation of existing graph invariants and the invention of novel ones, which continues to be a relevant challenge. Numerous current invariants are capable of distinguishing a significant number of graphs rapidly in real-time scenarios. In this study, we present an invariant tailored for tournaments, a specific class of directed graphs. Tournaments are particularly intriguing because the count of distinct tournaments for a given number of vertices aligns with that of undirected graphs of the same size. The introduced invariant evaluates all possible tournament subsets derived from the original digraph that share the identical arc set. For each subset tournament, standard rankings are computed and aggregated to produce the final vertex scores, which serve as the new invariant. Our analysis indicates that this newly proposed invariant diverges from the most straightforward tournament invariant, which typically assigns scores to each participant. Preliminary computational tests demonstrate that the minimal correlation between the sequences generated by these two invariants occurs at a vertex count of 15.

On m-ovoids of finite classical polar spaces with an irreducible transitive automorphism group

In this paper, we classify the m-ovoids of finite classical polar spaces that admit a transitive automorphism group acting irreducibly on the ambient vector space. In particular, we obtain several new infinite families of transitive m-ovoids.

Regular Factor in Vertex Transitive Graphs

Let G be a fc-regular connected vertex transitive graph. If G is not maximal restricted edge connected, then G has a (k- 1)-factor with components isomorphic to the same vertex transitive graph of order between k and 2k-3. This observation strenghen to some extent the corresponding result obtained by Watkins, which said that fc-regular vertex transitive graph G has a factor with components isomorphic to a vertex transitive graphs if G is not k connected.

Chaos in a topologically transitive system

The chaotic phenomena have been studied in a topologically transitive system and it has been shown that the erratic time dependence of orbits in such a topologically transitive system is more complicated than what described by the well-known technology "Li-Yorke chaos". The concept "sensitive dependency on initial conditions" has been generalized, and the chaotic phenomena has been discussed for transitive systems with the generalized sensitive dependency property.

On Smash Products of Transitive Module Algebras

Let H be a semisimple Hopf algebra over a field of characteristic 0, and A a finite-dimensional transitive H-module algebra with a l-dimensional ideal. It is proved that the smash product A#H is isomorphic to a full matrix algebra over some right coideal subalgebra N of H. The correspondence between A and such N, and the special case A = k（X） of function algebra on a finite set X are considered.

Systemic RNAi in western corn rootworm, Diabrotica virgifera virgifera, does not involve transitive pathways

Western corn rootworm （WCR, Diabrotica virgifera virgifera LeConte） is highly sensitive to orally delivered double-stranded RNA （dsRNA）. RNAi in WCR is systemic and spreads throughout the insect body. This raises the question whether transitive RNAi is a mechanism that functions in WCR to amplify the RNAi response via production of secondary siRNA. Secondary siRNA production is achieved through RNA-dependent RNA polymerase （RdRP） activity in other eukaryotic organisms, but RdRP has not been identified in WCR and any other insects. This study visualized the spread of the RNAi- mediated knockdown of Dr v-ATPase C mRNA throughout the WCR gut and other tissues using high-sensitivity branched DNA in situ hybridization. Furthermore, we did not detect either secondary siRNA production or transitive RNAi in WCR through siRNA sequence profile analysis. Nucleotide mismatched sequences introduced into either the sense or antisense strand of v-ATPase C dsRNAs were maintained in siRNAs derived from WCR fed with the mismatched dsRNAs in a strand specific manner. The distribution of all siRNAs was restricted to within the original target sequence regions, which may indicate the lack of new dsRNA synthesis leading to production of secondary siRNA. Thus, the systemic spread of RNAi in WCR may be derived from the original dsRNA molecules taken up from the gut lumen. These results indicate that the initial dsRNA dose is important for a lethal systemic RNAi response in WCR and have implications in developing effective dsRNA traits to control WCR and in resistance management to prolong the durability of RNAi trait technology.

Stateless Transitive Signature Schemes

A new practical method is introduced to transform the stateful transitive signature scheme to stateless one with-out the loss of security.According to the approach,two concrete stateless transitive signature schemes based on Factoringand RSA are presented respectively.Under the assumption of the hardness of factoring and one-more-RSA-inversion prob-lem,both two schemes are secure under the adaptive chosen-message attacks in random oracle model.

DISTORTION THEOREM FOR BIHOLOMORPHICMAPPINGS IN TRANSITIVE DOMAINS(IV)

The distortion theorem for biholomorphic staxlike mappings(with respect to origin) inbounded symmetric domains are given.The distortion theorem for locally biholomorphic convexmappings in bounded symmetric domains are given also.

Subretinal fibrosis secondary to neovascular age-related macular degeneration:mechanisms and potential therapeutic targets

Subretinal fibrosis is the end-stage sequelae of neovascular age-related macular degeneration.It causes local damage to photoreceptors,retinal pigment epithelium,and choroidal vessels,which leads to permanent central vision loss of patients with neovascular age-related macular degeneration.The pathogenesis of subretinal fibrosis is complex,and the underlying mechanisms are largely unknown.Therefore,there are no effective treatment options.A thorough understanding of the pathogenesis of subretinal fibrosis and its related mechanisms is important to elucidate its complications and explore potential treatments.The current article reviews several aspects of subretinal fibrosis,including the current understanding on the relationship between neovascular age-related macular degeneration and subretinal fibrosis;multimodal imaging techniques for subretinal fibrosis;animal models for studying subretinal fibrosis;cellular and non-cellular constituents of subretinal fibrosis;pathophysiological mechanisms involved in subretinal fibrosis,such as aging,infiltration of macrophages,different sources of mesenchymal transition to myofibroblast,and activation of complement system and immune cells;and several key molecules and signaling pathways participating in the pathogenesis of subretinal fibrosis,such as vascular endothelial growth factor,connective tissue growth factor,fibroblast growth factor 2,platelet-derived growth factor and platelet-derived growth factor receptor-β,transforming growth factor-βsignaling pathway,Wnt signaling pathway,and the axis of heat shock protein 70-Toll-like receptors 2/4-interleukin-10.This review will improve the understanding of the pathogenesis of subretinal fibrosis,allow the discovery of molecular targets,and explore potential treatments for the management of subretinal fibrosis.

Bearing Fault Diagnosis Based on the Markov Transition Field and SE-IShufflenetV2 Model

A bearing fault diagnosis method based on the Markov transitionfield(MTF)and SEnet(SE)-IShufflenetV2 model is proposed in this paper due to the problems of complex working conditions,low fault diagnosis accuracy,and poor generalization of rolling bearing.Firstly,MTF is used to encode one-dimensional time series vibration sig-nals and convert them into time-dependent and unique two-dimensional feature images.Then,the generated two-dimensional dataset is fed into the SE-IShufflenetV2 model for training to achieve fault feature extraction and classification.This paper selects the bearing fault datasets from Case Western Reserve University and Paderborn University to experimentally verify the effectiveness and superiority of the proposed method.The generalization performance of the proposed method is tested under the variable load condition and different signal-to-noise ratios(SNRs).The experimental results show that the average accuracy of the proposed method under different working conditions is 99.2%without adding noise.The accuracy under different working conditions from 0 to 1 HP is 100%.When the SNR is 0 dB,the average accuracy of the proposed method can still reach 98.7%under varying working conditions.Therefore,the bearing fault diagnosis method proposed in this paper is characterized by high accuracy,strong anti-noise ability,and generalization.Moreover,the proposed method can also overcome the influence of variable working conditions on diagnosis accuracy,providing method support for the accurate diagnosis of bearing faults under strong noise and variable working conditions.

DISTORTION THEOREM FOR BIHOLOMORPHIC MAPPINGS IN TRANSITIVE DOMAINS (Ⅰ)

1. There are fruitful results in geometrical function theory of one complex variable. But there exist a lot of counter examples to show that the corresponding results in several complex variables are not true. For the classical distortion theorem in one complex variable, H. Cartan conjectured that it is valid for the biholomorphic mappings on the unit ball B^n in C^n (n≥2). Unfortunately, this conjecture is not true(see [2]). In this report, we will consider the distortion theorem of biholomorphic mappings on transitive do-