A necessary and sufficient condition for the generalized shift operator T = S-k - (a(1)((1)), a(2)((1)),...) x e(1) - ... -(a(1)((j)), a(2)((j)),...) x e(j) (j greater than or equal to k) on l(1) to be power bounded i...A necessary and sufficient condition for the generalized shift operator T = S-k - (a(1)((1)), a(2)((1)),...) x e(1) - ... -(a(1)((j)), a(2)((j)),...) x e(j) (j greater than or equal to k) on l(1) to be power bounded is obtained. Moreover,this note points out that the power bounded operator T = S - (1, 1,...) x c(1) can shift a basis of [e(j+1) - e(j)](j = 1)(infinity), and this basis is not equivalent to {T(n)e(1)} (infinity)(n=0).展开更多
In this research work, we consider the below inequalities: (1.1). The researchers attempt to find an answer as to what are the best possible parameters <i><i>α</i></i>, <i><i&...In this research work, we consider the below inequalities: (1.1). The researchers attempt to find an answer as to what are the best possible parameters <i><i>α</i></i>, <i><i>β</i></i> that (1.1) can be held? The main tool is the optimization of some suitable functions that we seek to find out. Without loss of generality, we have assumed that <i>a</i> > <i>b</i> and let <img src="Edit_26c0f99b-93dd-48ff-acdb-f1c8047744f1.bmp" alt="" /> for 1) and <i>a</i> < <i>b</i>, <img src="Edit_15c32a7a-e9ae-41d3-8f49-c6b9c01c7ece.bmp" alt="" />(<i>t</i> small) for 2) to determine the condition for <i><i>α</i></i> and <i><i>β</i></i> to become <i>f</i>(<i>t</i>) ≤ 0 and <i>g</i>(<i>t</i>) ≥ 0.展开更多
This review reports several key advances on the theoretical investigations of efficiency at maximum power of heat engines in the past five years. The analytical results of efficiency at maximum power for the Curzon-Ah...This review reports several key advances on the theoretical investigations of efficiency at maximum power of heat engines in the past five years. The analytical results of efficiency at maximum power for the Curzon-Ahlborn heat engine, the stochastic heat engine constructed from a Brownian particle, and Feynman＇s ratchet as a heat engine are presented. It is found that： the efficiency at maximum power exhibits universal behavior at small relative temperature differences; the lower and the upper bounds might exist under quite general conditions; and the problem of efficiency at maximum power comes down to seeking for the minimum irreversible entropy production in each finite-time isothermal process for a given time.展开更多
The theoretical results of axial force distribution models differ greatly from tests because of the complication of the rock type material. A three-parameter combined-power model is proposed by curves fitting the test...The theoretical results of axial force distribution models differ greatly from tests because of the complication of the rock type material. A three-parameter combined-power model is proposed by curves fitting the test data recorded from the pull tests on anchoring bars used in different engineering projects. Based on the comparison of the mechanical characteristics of shaft anchors and prestressed tendons, a two-parameter combined-power function model for prestressed tendons is proposed. The bounded length derived from the model and the suggested values of the parameters are also proposed. Compared with the Gaussian model, the three-parameter combined-power model is more precise and simple in expression. Results also suggest that the bounded length calculated from the average stress method is not safe enough.展开更多
Binary Decision Diagrams (BDDs) can be graphically manipulated to reduce the number of nodes and hence the area. In this context, ordering of BDDs play a major role. Most of the algorithms for input variable ordering ...Binary Decision Diagrams (BDDs) can be graphically manipulated to reduce the number of nodes and hence the area. In this context, ordering of BDDs play a major role. Most of the algorithms for input variable ordering of OBDD focus primarily on area minimization. However, suitable input variable ordering helps in minimizing the power consumption also. In this particular work, we have proposed two algorithms namely, a genetic algorithm based technique and a branch and bound algorithm to find an optimal input variable order. Of course, the node reordering is taken care of by the standard BDD package buddy-2.4. Moreover, we have evaluated the performances of the proposed algorithms by running an exhaustive search program. Experi-mental results show a substantial saving in area and power. We have also compared our techniques with other state-of-art techniques of variable ordering for OBDDs and found to give superior results.展开更多
The authors consider the uniformly most powerful invariant test of the testing problems (Ⅰ) H 0: μ′Σ -1 μ≥CH 1: μ′Σ -1 μ<C and (Ⅱ) H 00 : β′X′Xβσ 2≥CH 11 : β′X′Xβσ 2<C u...The authors consider the uniformly most powerful invariant test of the testing problems (Ⅰ) H 0: μ′Σ -1 μ≥CH 1: μ′Σ -1 μ<C and (Ⅱ) H 00 : β′X′Xβσ 2≥CH 11 : β′X′Xβσ 2<C under m dimensional normal population N m(μ, Σ) and normal linear model (Y, Xβ, σ 2) respectively. Furthermore, an application of the uniformly most powerful invariant test is given.展开更多
Modern computer systems are increasingly bounded by the available or permissible power at multiple layers from individual components to data centers.To cope with this reality,it is necessary to understand how power bo...Modern computer systems are increasingly bounded by the available or permissible power at multiple layers from individual components to data centers.To cope with this reality,it is necessary to understand how power bounds im-pact performance,especially for systems built from high-end nodes,each consisting of multiple power hungry components.Because placing an inappropriate power bound on a node or a component can lead to severe performance loss,coordinat-ing power allocation among nodes and components is mandatory to achieve desired performance given a total power bud-get.In this article,we describe the paradigm of power bounded high-performance computing,which considers coordinated power bound assignment to be a key factor in computer system performance analysis and optimization.We apply this paradigm to the problem of power coordination across multiple layers for both CPU and GPU computing.Using several case studies,we demonstrate how the principles of balanced power coordination can be applied and adapted to the inter-play of workloads,hardware technology,and the available total power for performance improvement.展开更多
在无线传感网络中,节点定位是基于位置的应用基本要求。然而,现多数文献仅关注定位精度,而忽略了能量消耗对定位精度的影响。为此,针对基于接收信号强度RSSI(Received Signal Strength Indicator)定位方案,提出基于平方位置误差下限SPEB...在无线传感网络中,节点定位是基于位置的应用基本要求。然而,现多数文献仅关注定位精度,而忽略了能量消耗对定位精度的影响。为此,针对基于接收信号强度RSSI(Received Signal Strength Indicator)定位方案,提出基于平方位置误差下限SPEB(Squared Position Error Bound)的优化功率分配SPEB-OPA(SPEB-Based Optimal Power Allocation)方案,目的在于最小化能量消耗。在SPEB-OPA算法中,将SPEB作为评定定位精度的参数,并推导出SPEB表达式,然后建立优化功率分配的目标函数,并考虑到锚节点位置存在误差。仿真结果表明,提出的SPEB-OPA方案极大地减少了功率消耗。当误差门限T=8时,SPEB-OPA方案的功率消耗比统一功率分配UPA(Uniform Power allocation)方案减少至50%。展开更多
基金the Education DepartmentFoundation of Henan province.
文摘A necessary and sufficient condition for the generalized shift operator T = S-k - (a(1)((1)), a(2)((1)),...) x e(1) - ... -(a(1)((j)), a(2)((j)),...) x e(j) (j greater than or equal to k) on l(1) to be power bounded is obtained. Moreover,this note points out that the power bounded operator T = S - (1, 1,...) x c(1) can shift a basis of [e(j+1) - e(j)](j = 1)(infinity), and this basis is not equivalent to {T(n)e(1)} (infinity)(n=0).
文摘In this research work, we consider the below inequalities: (1.1). The researchers attempt to find an answer as to what are the best possible parameters <i><i>α</i></i>, <i><i>β</i></i> that (1.1) can be held? The main tool is the optimization of some suitable functions that we seek to find out. Without loss of generality, we have assumed that <i>a</i> > <i>b</i> and let <img src="Edit_26c0f99b-93dd-48ff-acdb-f1c8047744f1.bmp" alt="" /> for 1) and <i>a</i> < <i>b</i>, <img src="Edit_15c32a7a-e9ae-41d3-8f49-c6b9c01c7ece.bmp" alt="" />(<i>t</i> small) for 2) to determine the condition for <i><i>α</i></i> and <i><i>β</i></i> to become <i>f</i>(<i>t</i>) ≤ 0 and <i>g</i>(<i>t</i>) ≥ 0.
基金supported by the National Natural Science Foundation of China (Grant No.11075015)the Fundamental Research Funds for the Central Universities
文摘This review reports several key advances on the theoretical investigations of efficiency at maximum power of heat engines in the past five years. The analytical results of efficiency at maximum power for the Curzon-Ahlborn heat engine, the stochastic heat engine constructed from a Brownian particle, and Feynman＇s ratchet as a heat engine are presented. It is found that： the efficiency at maximum power exhibits universal behavior at small relative temperature differences; the lower and the upper bounds might exist under quite general conditions; and the problem of efficiency at maximum power comes down to seeking for the minimum irreversible entropy production in each finite-time isothermal process for a given time.
基金This paper is supported by the Foundation for Research Project of ChinaCommunications Second Highway Survey Design and ResearchInstitute .
文摘The theoretical results of axial force distribution models differ greatly from tests because of the complication of the rock type material. A three-parameter combined-power model is proposed by curves fitting the test data recorded from the pull tests on anchoring bars used in different engineering projects. Based on the comparison of the mechanical characteristics of shaft anchors and prestressed tendons, a two-parameter combined-power function model for prestressed tendons is proposed. The bounded length derived from the model and the suggested values of the parameters are also proposed. Compared with the Gaussian model, the three-parameter combined-power model is more precise and simple in expression. Results also suggest that the bounded length calculated from the average stress method is not safe enough.
文摘Binary Decision Diagrams (BDDs) can be graphically manipulated to reduce the number of nodes and hence the area. In this context, ordering of BDDs play a major role. Most of the algorithms for input variable ordering of OBDD focus primarily on area minimization. However, suitable input variable ordering helps in minimizing the power consumption also. In this particular work, we have proposed two algorithms namely, a genetic algorithm based technique and a branch and bound algorithm to find an optimal input variable order. Of course, the node reordering is taken care of by the standard BDD package buddy-2.4. Moreover, we have evaluated the performances of the proposed algorithms by running an exhaustive search program. Experi-mental results show a substantial saving in area and power. We have also compared our techniques with other state-of-art techniques of variable ordering for OBDDs and found to give superior results.
文摘The authors consider the uniformly most powerful invariant test of the testing problems (Ⅰ) H 0: μ′Σ -1 μ≥CH 1: μ′Σ -1 μ<C and (Ⅱ) H 00 : β′X′Xβσ 2≥CH 11 : β′X′Xβσ 2<C under m dimensional normal population N m(μ, Σ) and normal linear model (Y, Xβ, σ 2) respectively. Furthermore, an application of the uniformly most powerful invariant test is given.
基金supported in part by the U.S.National Science Foundation under Grant Nos.CCF-1551511 and CNS-1551262.
文摘Modern computer systems are increasingly bounded by the available or permissible power at multiple layers from individual components to data centers.To cope with this reality,it is necessary to understand how power bounds im-pact performance,especially for systems built from high-end nodes,each consisting of multiple power hungry components.Because placing an inappropriate power bound on a node or a component can lead to severe performance loss,coordinat-ing power allocation among nodes and components is mandatory to achieve desired performance given a total power bud-get.In this article,we describe the paradigm of power bounded high-performance computing,which considers coordinated power bound assignment to be a key factor in computer system performance analysis and optimization.We apply this paradigm to the problem of power coordination across multiple layers for both CPU and GPU computing.Using several case studies,we demonstrate how the principles of balanced power coordination can be applied and adapted to the inter-play of workloads,hardware technology,and the available total power for performance improvement.
文摘在无线传感网络中,节点定位是基于位置的应用基本要求。然而,现多数文献仅关注定位精度,而忽略了能量消耗对定位精度的影响。为此,针对基于接收信号强度RSSI(Received Signal Strength Indicator)定位方案,提出基于平方位置误差下限SPEB(Squared Position Error Bound)的优化功率分配SPEB-OPA(SPEB-Based Optimal Power Allocation)方案,目的在于最小化能量消耗。在SPEB-OPA算法中,将SPEB作为评定定位精度的参数,并推导出SPEB表达式,然后建立优化功率分配的目标函数,并考虑到锚节点位置存在误差。仿真结果表明,提出的SPEB-OPA方案极大地减少了功率消耗。当误差门限T=8时,SPEB-OPA方案的功率消耗比统一功率分配UPA(Uniform Power allocation)方案减少至50%。
