Sharing economy as an important product of the Internet Era,its essence is to rely on Internet technology,especially big data technology to reuse the idle resources of society and creating new market value.However,wit...Sharing economy as an important product of the Internet Era,its essence is to rely on Internet technology,especially big data technology to reuse the idle resources of society and creating new market value.However,with the increasing scope of the sharing economy,the problems of data security,circulation,sharing and privacy protection are gradually emerging,and big data technology has become the biggest bottleneck for further development of shared economy.The block chain technology is composed of a variety of technology and communication protocol to form a new Internet architecture,it through cryptographic sharing,distributed books and other feathers to provide new methods and ideas for data distribution and sharing and complementary with big data technology.Therefore,through the combination of block chain technology and big data technology,they can subvert the traditional shared economic business model and provide a new opportunity for sharing economic development.展开更多
In this paper, a block method with one hybrid point for solving Jerk equations is presented. The hybrid point is chosen to optimize the local truncation errors of the main formulas for the solution and the derivative ...In this paper, a block method with one hybrid point for solving Jerk equations is presented. The hybrid point is chosen to optimize the local truncation errors of the main formulas for the solution and the derivative at the end of the block. Analysis of the method is discussed, and some numerical examples show that the proposed method is efficient and accurate.展开更多
Many problems in science and engineering require solving large consistent linear systems. This paper presents a relaxed greedy block Kaczmarz method (RGBK) and an accelerated greedy block Kaczmarz method (AGBK) for so...Many problems in science and engineering require solving large consistent linear systems. This paper presents a relaxed greedy block Kaczmarz method (RGBK) and an accelerated greedy block Kaczmarz method (AGBK) for solving large-size consistent linear systems. The RGBK algorithm extends the greedy block Kaczmarz algorithm (GBK) presented by Niu and Zheng in <a href="#ref1">[1]</a> by introducing a relaxation parameter to the iteration formulation of GBK, and the AGBK algorithm uses different iterative update rules to minimize the running time. The convergence of the RGBK is proved and a method to determine an optimal parameter is provided. Several examples are presented to show the effectiveness of the proposed methods for overdetermined and underdetermined consistent linear systems with dense and sparse coefficient matrix.展开更多
Based on elementary group theory, the block pivot methods for solving two-dimensional elastic frictional contact problems are presented in this paper. It is proved that the algorithms converge within a finite number o...Based on elementary group theory, the block pivot methods for solving two-dimensional elastic frictional contact problems are presented in this paper. It is proved that the algorithms converge within a finite number of steps when the friction coefficient is ''relative small''. Unlike most mathematical programming methods for contact problems, the block pivot methods permit multiple exchanges of basic and nonbasic variables.展开更多
The rock fragmentation involves the inter-block and the intra-block fracture.A simulation method for rock fragmentation is developed by coupling Voronoi diagram(VD)and discretized virtual internal bond(DVIB).The DVIB ...The rock fragmentation involves the inter-block and the intra-block fracture.A simulation method for rock fragmentation is developed by coupling Voronoi diagram(VD)and discretized virtual internal bond(DVIB).The DVIB is a lattice model that consists of bonds.The VD is used to generate the potential block structure in the DVIB mesh.Each potential block may contain any number of bond cells.To characterize the inter-block fracture,a hyperelastic bond potential is employed for the bond cells that are cut by the VD edges.While to characterize the intra-block fracture,an elastobrittle bond potential is adopted for the bonds in a block.By this method,both the inter-block and intra-block fracture can be well simulated.The simulation results suggest that this method is a simple and efficient approach to rock fragmentation simulation with block smash.展开更多
On the basis of software testing tools we developed for programming languages, we firstly present a new control flowgraph model based on block. In view of the notion of block, we extend the traditional program\|based ...On the basis of software testing tools we developed for programming languages, we firstly present a new control flowgraph model based on block. In view of the notion of block, we extend the traditional program\|based software test data adequacy measurement criteria, and empirically analyze the subsume relation between these measurement criteria. Then, we define four test complexity metrics based on block. They are J\|complexity 0; J\|complexity 1; J\|complexity \{1+\}; J\|complexity 2. Finally, we show the Kiviat diagram that makes software quality visible.展开更多
In this paper, we developed a new continuous block method using the approach of collocation of the differential system and interpolation of the power series approximate solution. A constant step length within a half s...In this paper, we developed a new continuous block method using the approach of collocation of the differential system and interpolation of the power series approximate solution. A constant step length within a half step interval of integration was adopted. We evaluated at grid and off grid points to get a continuous linear multistep method. The continuous linear multistep method is solved for the independent solution to yield a continuous block method which is evaluated at selected points to yield a discrete block method. The basic properties of the block method were investigated and found to be consistent and zero stable hence convergent. The new method was tested on real life problems namely: SIR model, Growth model and Mixture Model. The results were found to compete favorably with the existing methods in terms of accuracy and error bound.展开更多
基金National Natural Science Foundation of China(71563031)Inner Mongolia Natural Science Fund Projects(2015MS0714)+1 种基金Philosophy and social science planning project inInner Mongolia(2017NDB067)Erdos Science and TechnologyPlan Projects(YY201610045).
文摘Sharing economy as an important product of the Internet Era,its essence is to rely on Internet technology,especially big data technology to reuse the idle resources of society and creating new market value.However,with the increasing scope of the sharing economy,the problems of data security,circulation,sharing and privacy protection are gradually emerging,and big data technology has become the biggest bottleneck for further development of shared economy.The block chain technology is composed of a variety of technology and communication protocol to form a new Internet architecture,it through cryptographic sharing,distributed books and other feathers to provide new methods and ideas for data distribution and sharing and complementary with big data technology.Therefore,through the combination of block chain technology and big data technology,they can subvert the traditional shared economic business model and provide a new opportunity for sharing economic development.
文摘In this paper, a block method with one hybrid point for solving Jerk equations is presented. The hybrid point is chosen to optimize the local truncation errors of the main formulas for the solution and the derivative at the end of the block. Analysis of the method is discussed, and some numerical examples show that the proposed method is efficient and accurate.
文摘Many problems in science and engineering require solving large consistent linear systems. This paper presents a relaxed greedy block Kaczmarz method (RGBK) and an accelerated greedy block Kaczmarz method (AGBK) for solving large-size consistent linear systems. The RGBK algorithm extends the greedy block Kaczmarz algorithm (GBK) presented by Niu and Zheng in <a href="#ref1">[1]</a> by introducing a relaxation parameter to the iteration formulation of GBK, and the AGBK algorithm uses different iterative update rules to minimize the running time. The convergence of the RGBK is proved and a method to determine an optimal parameter is provided. Several examples are presented to show the effectiveness of the proposed methods for overdetermined and underdetermined consistent linear systems with dense and sparse coefficient matrix.
基金The project supported by the National Natural Science Foundation of China
文摘Based on elementary group theory, the block pivot methods for solving two-dimensional elastic frictional contact problems are presented in this paper. It is proved that the algorithms converge within a finite number of steps when the friction coefficient is ''relative small''. Unlike most mathematical programming methods for contact problems, the block pivot methods permit multiple exchanges of basic and nonbasic variables.
基金the National Natural ScienceFoundation of China(Grant 11772190),which is gratefully acknowledged.
文摘The rock fragmentation involves the inter-block and the intra-block fracture.A simulation method for rock fragmentation is developed by coupling Voronoi diagram(VD)and discretized virtual internal bond(DVIB).The DVIB is a lattice model that consists of bonds.The VD is used to generate the potential block structure in the DVIB mesh.Each potential block may contain any number of bond cells.To characterize the inter-block fracture,a hyperelastic bond potential is employed for the bond cells that are cut by the VD edges.While to characterize the intra-block fracture,an elastobrittle bond potential is adopted for the bonds in a block.By this method,both the inter-block and intra-block fracture can be well simulated.The simulation results suggest that this method is a simple and efficient approach to rock fragmentation simulation with block smash.
文摘On the basis of software testing tools we developed for programming languages, we firstly present a new control flowgraph model based on block. In view of the notion of block, we extend the traditional program\|based software test data adequacy measurement criteria, and empirically analyze the subsume relation between these measurement criteria. Then, we define four test complexity metrics based on block. They are J\|complexity 0; J\|complexity 1; J\|complexity \{1+\}; J\|complexity 2. Finally, we show the Kiviat diagram that makes software quality visible.
文摘In this paper, we developed a new continuous block method using the approach of collocation of the differential system and interpolation of the power series approximate solution. A constant step length within a half step interval of integration was adopted. We evaluated at grid and off grid points to get a continuous linear multistep method. The continuous linear multistep method is solved for the independent solution to yield a continuous block method which is evaluated at selected points to yield a discrete block method. The basic properties of the block method were investigated and found to be consistent and zero stable hence convergent. The new method was tested on real life problems namely: SIR model, Growth model and Mixture Model. The results were found to compete favorably with the existing methods in terms of accuracy and error bound.
基金This work was supported in part by the National Basic Research Program of China （973 Program） （2012CB316504, 2009CB320602）, and by the National Natural Science Foundation of China （61174122, 61021063, 60721003 and 60625305）, and also by the Specialized Research Fund for the Doctoral Program of Higher Education, China （20110002110045）.
