Based on the adjacent matrix, a new topological index mT was set up: mT =∑ δ i· δ j·δ k …) 0 5 ,in which 0 T and 1 T among mT is defined as : 0 T =∑( δ i ) 0 5 , 1 T =∑( δ i · δ j ) 0 5 . The 0 T ( 1 T ) values of 142 molecules for 10 series of compounds were calculated.
Based on the adjacent matrix, a new topological index mT was set up: mT =Σ( δ i·δ j·δ k …) 0.5 , 0 T and 1 T among mT is defined as: 0 T =Σ( δ i ) 0.5 , 1 T =Σ( δ i·δ j ) 0.5 . The 0 T ( 1 T ) values of the molecules of 61 compounds are calculated.
By building the adjoining matrix, confirming the start-point of searching,vectorizing the searching sides,calculating the direction factor of adjoining sides,we can search out the next side of the least loop or the most loop rapidly.
Aquality of service (QoS) routing based on unidirectional Ad-hoc (QRUA) protocol which can support QoS controlled routing is given to satisfy the demands of Ad-hoc networks with unidirectional links. Through using upper table (UT) between adjoining hosts to choose the route with the limitation of bandwidth and delays,the QRUA can perform well in the scenarios of Ad-hoc networks with unidirectional links.
In order to test this hypothesis, based on previous works by Uziel(1993), Martohardjono(1991) , Flynn(1987), and White(1988), I conducted a study which examined the acquisition of Subjacency by mainland Chinese speakers learning English as a second language.
If UG principles are fully accessible to the foreign language learners , and the process of foreign language learning is a process of parameter-reassignment in which the L2 learner resets the parameter-values of the L1 to their values in the L2, then in learning English , Chinese learners are able to acquire English wh-questions under the constraints of Subjacency Principle .
The experimental results show that Subjacency can successfully be acquired even if the first language lacks it or applies it in different domains, and Chinese learners are found to be capable of resetting the parameter value of Subjacency principle to the English setting, thus successfully acquiring a property of language almost never taught in language classroom .
The formation of English special questions is constrained by the Subjacency Principle in Universal Grammar (UG), the English learners of natives or foreigners do not make 'impossible' mistakes in acquiring English special questions.
Let G be a graph and denote by Q(G)=D(G)+A(G), L(G)=D(G)-A(G) the sum and the difference between the diagonal matrix of vertex degrees and the adjacency matrix of G, respectively.
A stepwise optimization algorithm for a network with given adjacency matrix based on a algorithm for constructing minimal-cost routes is designed.
By the local optimal Steiner tree is meant a tree with optimally distributed Steiner points for a given adjacency matrix.
The adjacency matrix defines the point of local minimum, and all arrangements (coordinates) of the Steiner points that are admissible for it define the minimum neighborhood.
To a graph (or a digraph) Γ we assign two matricesN(A) andN(-1)(A) of inner products of the vector rows and of the vector columns, respectively, of the adjacency matrix of Γ; these matrices are said to be adjoint.
A local-global principle is proved by the second named author in the adjacent paper of this volume.
This wavelet basis is obtained from three wavelet generators by scaling, translation and rotation, and the wavelets are supported either by one corner triangle or a pair of adjacent triangles in the triangulation of level k - 1.
A subset D of V is called a dominating set of G if for every vertex κ,εV-D,κ is adjacent to at least one vertex of D.
The interchange graph G(R,S) is the graph where the vertices are the matrices in U(R,S) and two vertices representing two such matrices are adjacent provided they differ by an interchange.
The paper gives two estimates of the distance between adjacent zeros of solutions of the first-order delay differential equations x'(t)+p(t)x(t-τ)=0 in the case when p(t)≥0 and oscillates or p(t) itself oscillates.