To solve the optimal solution of some issues in applied science, studying of connecting conditions, constraint conditions and constraint equations is made. This paper cites an example in point in vibration mechanics a...To solve the optimal solution of some issues in applied science, studying of connecting conditions, constraint conditions and constraint equations is made. This paper cites an example in point in vibration mechanics and seeks the connecting conditions and constraint equations of high speed compound rotating system. This paper points out that the selection of the boundary conditions or connection conditions can effect on the optimal solution of the issue as soon as the object function is determined.展开更多
The aim of this research is to analyze the emergence of the concepts of sustainable development （SD） and corporate social responsibility （CSR） in companies in time and space. A spatio-temporal reading will indicat...The aim of this research is to analyze the emergence of the concepts of sustainable development （SD） and corporate social responsibility （CSR） in companies in time and space. A spatio-temporal reading will indicate the most important socio-political and environmental events that have emerged with these two concepts. In order to complete the odyssey, a spatio-temporal analysis has retraced the epistemological evolution of these latter, whilst at the same time remarking the appropriation that has been made by the different institutional and organizational actors. The historical and epistemological reviews tell us that these two concepts, which came into existence almost 80 years, have indefinite outlines; one can be substituted for the other. However, thanks to this odyssey, we have reduced the boundaries even further between sustainable development and social responsibility and shown their theoretic and historical association. The perspective adopted shows that the concept of corporate social responsibility is closely connected to that of sustainable development. This connection means that researchers in management science are faced with more new problem issues reaching further than the simple lack of conceptual consensuses.展开更多
This paper presents an algorithm that tests whether a given degree-bounded digraph is k-edge-connected or E-far from k-edge-connectivity. This is the first testing algorithm for k-edge- connectivity of digraphs whose ...This paper presents an algorithm that tests whether a given degree-bounded digraph is k-edge-connected or E-far from k-edge-connectivity. This is the first testing algorithm for k-edge- connectivity of digraphs whose running time is independent of the number of vertices and edges. A digraph of n vertices with degree bound d is ε-far from k-edge-connectivity if at least εdn edges have to be added or deleted to make the digraph k-edge-connected, preserving the degree bound. Given a constant error parameter ε and a degree bound d, our algorithm always accepts all k-edge-connected digraphs and reiects all digraphs that is ε-far from k-edge-connectivity with orobabilitv at least 2/3.It runs in O（d（εd^-c）^k logεd^-1O）（c〉1 is a constant）time when input digraphs are restricted to be （k-1）-edge connected and runs in O（d（εd^-ck）^klogεd^-kO）（c〉1 is a constant）time for general digraphs.展开更多
We determine all connected normal edge-transitive Cayley graphs on non-abelian groups with order 4p, where p is a prime number. As a consequence we prove if IGI = 25p, δ = 0, 1, 2 and p prime, then F 1 Cay（G, S） i...We determine all connected normal edge-transitive Cayley graphs on non-abelian groups with order 4p, where p is a prime number. As a consequence we prove if IGI = 25p, δ = 0, 1, 2 and p prime, then F 1 Cay（G, S） is a connected normal 1/2 arc-transitive Cayley graph only if G = F4p, where S is an inverse closed generating subset of G which does not contain the identity element of G and F4p is a group with presentation F4p = （a, b ｜aP = b4 = 1, b-lab = a^λ）, where λ2 = -1 （mod p）.展开更多
This paper considers the edge-connectivity and the restricted edge-connectivity of replacement product graphs, gives some bounds on edge-connectivity and restricted edge-connectivity of replacement product graphs and ...This paper considers the edge-connectivity and the restricted edge-connectivity of replacement product graphs, gives some bounds on edge-connectivity and restricted edge-connectivity of replacement product graphs and determines the exact values for some special graphs. In particular, the authors further confirm that under certain conditions, the replacement product of two Cayley graphs is also a Cayley graph, and give a necessary and sufficient condition for such Cayley graphs to have maximum restricted edge-connectivity. Based on these results, we construct a Cayley graph with degree d whose restricted edge-connectivity is equal to d + s for given odd integer d and integer s with d 5 and 1 s d- 3, which answers a problem proposed ten years ago.展开更多
We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in nongrowth random networks. In this model, we use multiple-edges to represent the connections between vertices and define...We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in nongrowth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its totM number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scMe-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.展开更多
In this paper, the continuous-time independent edge-Markovian random graph process model is constructed. The authors also define the interval isolated nodes of the random graph process, study the distribution sequence...In this paper, the continuous-time independent edge-Markovian random graph process model is constructed. The authors also define the interval isolated nodes of the random graph process, study the distribution sequence of the number of isolated nodes and the probability of having no isolated nodes when the initial distribution of the random graph process is stationary distribution, derive the lower limit of the probability in which two arbitrary nodes are connected and the random graph is also connected, and prove that the random graph is almost everywhere connected when the number of nodes is sufficiently large.展开更多
Present study examines the mixed convective peristaltic transport of Cu-H2O nanofluid with velocity slip and convective boundary conditions. Analysis is performed using the two-phase model of the nanofluid. Viscous di...Present study examines the mixed convective peristaltic transport of Cu-H2O nanofluid with velocity slip and convective boundary conditions. Analysis is performed using the two-phase model of the nanofluid. Viscous dissipation and heat generation/absorption effects are also taken into account. Problem is formulated using the long wavelength and low Reynolds number approach. Numerical solutions for the pressure rise per wavelength, pressure gradient, axial velocity, temperature and heat transfer rate at the boundaxy are obtained and studied through graphs. Results show that the area of peristaltic pumping decreases with an increase in the nanoparticles volume fraction. Increase in the velocity slip parameter shows an increase of the pressure gradient in the occluded part of the channel. Further, addition of copper nanoparticles reduces both the axial velocity and temperature of the base fluid. Temperature of the nanofluid also decreases sufficiently for an increase in the value of Blot number.展开更多
文摘To solve the optimal solution of some issues in applied science, studying of connecting conditions, constraint conditions and constraint equations is made. This paper cites an example in point in vibration mechanics and seeks the connecting conditions and constraint equations of high speed compound rotating system. This paper points out that the selection of the boundary conditions or connection conditions can effect on the optimal solution of the issue as soon as the object function is determined.
文摘The aim of this research is to analyze the emergence of the concepts of sustainable development （SD） and corporate social responsibility （CSR） in companies in time and space. A spatio-temporal reading will indicate the most important socio-political and environmental events that have emerged with these two concepts. In order to complete the odyssey, a spatio-temporal analysis has retraced the epistemological evolution of these latter, whilst at the same time remarking the appropriation that has been made by the different institutional and organizational actors. The historical and epistemological reviews tell us that these two concepts, which came into existence almost 80 years, have indefinite outlines; one can be substituted for the other. However, thanks to this odyssey, we have reduced the boundaries even further between sustainable development and social responsibility and shown their theoretic and historical association. The perspective adopted shows that the concept of corporate social responsibility is closely connected to that of sustainable development. This connection means that researchers in management science are faced with more new problem issues reaching further than the simple lack of conceptual consensuses.
文摘This paper presents an algorithm that tests whether a given degree-bounded digraph is k-edge-connected or E-far from k-edge-connectivity. This is the first testing algorithm for k-edge- connectivity of digraphs whose running time is independent of the number of vertices and edges. A digraph of n vertices with degree bound d is ε-far from k-edge-connectivity if at least εdn edges have to be added or deleted to make the digraph k-edge-connected, preserving the degree bound. Given a constant error parameter ε and a degree bound d, our algorithm always accepts all k-edge-connected digraphs and reiects all digraphs that is ε-far from k-edge-connectivity with orobabilitv at least 2/3.It runs in O（d（εd^-c）^k logεd^-1O）（c〉1 is a constant）time when input digraphs are restricted to be （k-1）-edge connected and runs in O（d（εd^-ck）^klogεd^-kO）（c〉1 is a constant）time for general digraphs.
文摘We determine all connected normal edge-transitive Cayley graphs on non-abelian groups with order 4p, where p is a prime number. As a consequence we prove if IGI = 25p, δ = 0, 1, 2 and p prime, then F 1 Cay（G, S） is a connected normal 1/2 arc-transitive Cayley graph only if G = F4p, where S is an inverse closed generating subset of G which does not contain the identity element of G and F4p is a group with presentation F4p = （a, b ｜aP = b4 = 1, b-lab = a^λ）, where λ2 = -1 （mod p）.
基金supported by National Natural Science Foundation of China (Grant Nos. 61272008 and 11571044)University Natural Science Research Project of Anhui Province (Grant No. KJ2016A003)Scientific Research Fund of Anhui University of Finance & Economics (Grant No. ACKY1532)
文摘This paper considers the edge-connectivity and the restricted edge-connectivity of replacement product graphs, gives some bounds on edge-connectivity and restricted edge-connectivity of replacement product graphs and determines the exact values for some special graphs. In particular, the authors further confirm that under certain conditions, the replacement product of two Cayley graphs is also a Cayley graph, and give a necessary and sufficient condition for such Cayley graphs to have maximum restricted edge-connectivity. Based on these results, we construct a Cayley graph with degree d whose restricted edge-connectivity is equal to d + s for given odd integer d and integer s with d 5 and 1 s d- 3, which answers a problem proposed ten years ago.
基金Supported by the National Natural Science Foundation of China under Grant No.60874080the Commonweal Application Technique Research Project of Zhejiang Province under Grant No.2012C2316the Open Project of State Key Lab of Industrial Control Technology of Zhejiang University under Grant No.ICT1107
文摘We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in nongrowth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its totM number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scMe-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.
基金supported by the National Natural Science Foundation of China(Nos.60872060,11101265)the Shanghai Natural Science Foundation of China(No.12ZR1421000)the Shanghai Education Commission Innovation Project Fund(Nos.12ZZ193,14YZ152,15ZZ099)
文摘In this paper, the continuous-time independent edge-Markovian random graph process model is constructed. The authors also define the interval isolated nodes of the random graph process, study the distribution sequence of the number of isolated nodes and the probability of having no isolated nodes when the initial distribution of the random graph process is stationary distribution, derive the lower limit of the probability in which two arbitrary nodes are connected and the random graph is also connected, and prove that the random graph is almost everywhere connected when the number of nodes is sufficiently large.
文摘Present study examines the mixed convective peristaltic transport of Cu-H2O nanofluid with velocity slip and convective boundary conditions. Analysis is performed using the two-phase model of the nanofluid. Viscous dissipation and heat generation/absorption effects are also taken into account. Problem is formulated using the long wavelength and low Reynolds number approach. Numerical solutions for the pressure rise per wavelength, pressure gradient, axial velocity, temperature and heat transfer rate at the boundaxy are obtained and studied through graphs. Results show that the area of peristaltic pumping decreases with an increase in the nanoparticles volume fraction. Increase in the velocity slip parameter shows an increase of the pressure gradient in the occluded part of the channel. Further, addition of copper nanoparticles reduces both the axial velocity and temperature of the base fluid. Temperature of the nanofluid also decreases sufficiently for an increase in the value of Blot number.
