Due to various geological processes such as tectonic activities fractures might be created in rock mass body which causes creation of blocks with different shapes and sizes in the rock body. Exact understand- ing of t...Due to various geological processes such as tectonic activities fractures might be created in rock mass body which causes creation of blocks with different shapes and sizes in the rock body. Exact understand- ing of these blocks geometry is an essential issue concerned in different domains of rock engineering such as support system of underground spaces built in jointed rock masses, design of blasting pattern, optimi- zation of fragmentation, determination of cube blocks in quarry mines, blocks stability, etc. The aim of this paper is to develop a computer program to determine geometry of rock mass blocks in two dimen- sional spaces. In this article, the eometrv of iointed rock mass is programmed in MATLABTM.展开更多
Blockage is a kind of phenomenon occurring frequently in modern transportation network. This paper deals with the research work on the blocking now in a network with the help of network flow theory. The blockage pheno...Blockage is a kind of phenomenon occurring frequently in modern transportation network. This paper deals with the research work on the blocking now in a network with the help of network flow theory. The blockage phenomena can be divided intO local blockage and network blockage. In this paper, which deals mainly with the latter, the fundamental concepts and definitions of network blocking flow, blocking outset are presented and the related theorems are proved. It is proved that the sufficient and necessary condition for the emergence of a blocking now in a network is the existence of the blocking outset. The necessary conditions for the existence of the blocking outset in a network are analysed and the characteristic cutset of blockage which reflects the all possible situation of blocking nows in the network is defined.In the last part of the paper the mathematical model of the minimum blocking now is developed and the solution to a small network is given.展开更多
In the current era of information technology,students need to learn modern programming languages efficiently.The art of teaching/learning program-ming requires many logical and conceptual skills.So it’s a challenging ...In the current era of information technology,students need to learn modern programming languages efficiently.The art of teaching/learning program-ming requires many logical and conceptual skills.So it’s a challenging task for the instructors/learners to teach/learn these programming languages effectively and efficiently.Mind mapping is a useful visual tool for establishing ideas and connecting them to solve problems.This research proposed an effective way to teach programming languages through visual tools.This experimental study uses a mind mapping tool to teach two programming environments:Text-based Programming and Blocks-based Programming.We performed the experiments with one hundred and sixty undergraduate students of two public sector universities in the Asia Pacific region.Four different instructional approaches,including block-based language(BBL),text-based languages(TBL),mind map with text-based language(MMTBL)and mind mapping with block-based(MMBBL)are used for this purpose.The results show that instructional approaches using a mind mapping tool to help students solve given tasks in their critical thinking are more effective than other instructional techniques.展开更多
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.展开更多
In the Cellular Long-Term Evolution (LTE) downlink, the smallest radio resource unit a Scheduler can assign to a user is a Resource Block (RB). Each RB consists of twelve (12) adjacent Orthogonal Frequency Division Mu...In the Cellular Long-Term Evolution (LTE) downlink, the smallest radio resource unit a Scheduler can assign to a user is a Resource Block (RB). Each RB consists of twelve (12) adjacent Orthogonal Frequency Division Multiplexing (OFDM) sub-carriers with inter-subcarrier spacing of 15 kHz. Over the years, researchers have investigated the problem of radio resource allocation in cellular LTE downlink and have made useful contributions. In an earlier paper for example, we proposed a deterministic dynamic programming based technique for optimal allocation of RBs in the downlink of multiuser Cellular LTE System. We found that this proposed methodology optimally allocates RBs to users at every transmission instant, but the computational time associated with the allocation policy was high. In the current work, we propose a truncated dynamic programming based technique for efficient and optimal allocation of radio resource. This paper also addresses uncertainty emanating from users’ mobility within a Cell coverage area. The objective is to significantly reduce the computational time and dynamically select applicable modulation scheme (i.e., QPSK, 16QAM, or 64QAM) in response to users’ mobility. We compare the proposed scheme with the Fair allocation and the earlier proposed dynamic programming based techniques. It is shown that the proposed methodology is more efficient in allocating radio resource and has better performance than both the Fair Allocation and the deterministic dynamic programming based techniques.展开更多
This paper deals with the research work on the phenomena of local blockage in a transportation network. Onthe basis of introducing the research results in [1], theminimum now capacity problem of a network in the mosts...This paper deals with the research work on the phenomena of local blockage in a transportation network. Onthe basis of introducing the research results in [1], theminimum now capacity problem of a network in the mostseriously blocked situation is studied. With the conceptof complete outset presented in [1], the relationship between the minimum now capacity of a network and its minimum complete cut capacity is discussed, and the reasons for the difference betweent the minimum now capacity of a network and its minimum complete cut capa-city are analysed. In order to get the solution to the problem, the concepts of normalization of a network and its blocking path graph are presented. In the paper it is proved that the necessary and sufficient conditions for the equality between the minumum now capacity and its minumum complete cut capacity are the existence of a feasible flow in the blocking path graph. For the reason that there are some dependent production points in the blocking path graph of a network, the proof about the tenability of the Gale's Theorm for the planat normalized network without circuit is made.展开更多
Recoverability of block-sparse signals by convex relaxation methods is considered for the underdetermined linear model. In previous works, some explicit but pessimistic recoverability results which were associated wit...Recoverability of block-sparse signals by convex relaxation methods is considered for the underdetermined linear model. In previous works, some explicit but pessimistic recoverability results which were associated with the dictionary were presented. This paper shows the recoverability of block-sparse signals are associated with the block structure when a random dictionary is given. Several probability inequalities are obtained to show how the recoverability changes along with the block structure parameters, such as the number of nonzero blocks, the block length, the dimension of the measurements and the dimension of the block-sparse representation signal. Also, this paper concludes that if the block-sparse structure can be considered, the recoverability of the signals wil be improved. Numerical examples are given to il ustrate the availability of the presented theoretical results.展开更多
In this paper we study the problem of locating multiple facilities in convex sets with fuzzy parameters. This problem asks to find the location of new facilities in the given convex sets such that the sum of weighted ...In this paper we study the problem of locating multiple facilities in convex sets with fuzzy parameters. This problem asks to find the location of new facilities in the given convex sets such that the sum of weighted distances between new facilities and existing facilities is minimized. We present a linear programming model for this problem with block norms, then we use it for problems with fuzzy data. We also do this for rectilinear and infinity norms as special cases of block norms.展开更多
提出同时将透射和反射可重构智能表面(Simultaneously transmitting and reflecting reconfigurable intelligent surfaces,STAR-RIS)与通信感知一体化(Integrated sensing and communication,ISAC)系统结合,以实现全空间的通信与感知...提出同时将透射和反射可重构智能表面(Simultaneously transmitting and reflecting reconfigurable intelligent surfaces,STAR-RIS)与通信感知一体化(Integrated sensing and communication,ISAC)系统结合,以实现全空间的通信与感知。同时在STAR-RIS上应用一种低成本的传感器实现了在STAR-RIS上进行目标感知,解决了雷达感知的严重路径损耗问题。基于此,本文研究了STAR-RIS辅助位于STAR-RIS两侧的多用户多输入单输出(Multi-usermulti-input single-output,MU-MISO)以及一个位于STAR-RIS透射侧的目标的ISAC系统,旨在联合优化STAR-RIS的被动波束成形矩阵和ISAC基站处的主动波束成形矩阵,以最大化用户的通信和速率,同时满足目标感知的最低信噪比要求。为了解决优化过程中的非凸问题,提出了一种基于分式规划的块坐标上升算法,将优化变量分为几个块变量交替优化。在迭代优化后续波束成形问题上,应用了连续凸逼近和半正定松弛算法。与传统的可重构智能表面相比,仿真结果验证了在ISAC系统中部署STAR-RIS的优点。同时将所提的基于分式规划的算法与基于加权最小均方误差的算法进行了对比并验证了所提算法在提高通信和速率上的优势和有效性。展开更多
文摘Due to various geological processes such as tectonic activities fractures might be created in rock mass body which causes creation of blocks with different shapes and sizes in the rock body. Exact understand- ing of these blocks geometry is an essential issue concerned in different domains of rock engineering such as support system of underground spaces built in jointed rock masses, design of blasting pattern, optimi- zation of fragmentation, determination of cube blocks in quarry mines, blocks stability, etc. The aim of this paper is to develop a computer program to determine geometry of rock mass blocks in two dimen- sional spaces. In this article, the eometrv of iointed rock mass is programmed in MATLABTM.
文摘Blockage is a kind of phenomenon occurring frequently in modern transportation network. This paper deals with the research work on the blocking now in a network with the help of network flow theory. The blockage phenomena can be divided intO local blockage and network blockage. In this paper, which deals mainly with the latter, the fundamental concepts and definitions of network blocking flow, blocking outset are presented and the related theorems are proved. It is proved that the sufficient and necessary condition for the emergence of a blocking now in a network is the existence of the blocking outset. The necessary conditions for the existence of the blocking outset in a network are analysed and the characteristic cutset of blockage which reflects the all possible situation of blocking nows in the network is defined.In the last part of the paper the mathematical model of the minimum blocking now is developed and the solution to a small network is given.
文摘In the current era of information technology,students need to learn modern programming languages efficiently.The art of teaching/learning program-ming requires many logical and conceptual skills.So it’s a challenging task for the instructors/learners to teach/learn these programming languages effectively and efficiently.Mind mapping is a useful visual tool for establishing ideas and connecting them to solve problems.This research proposed an effective way to teach programming languages through visual tools.This experimental study uses a mind mapping tool to teach two programming environments:Text-based Programming and Blocks-based Programming.We performed the experiments with one hundred and sixty undergraduate students of two public sector universities in the Asia Pacific region.Four different instructional approaches,including block-based language(BBL),text-based languages(TBL),mind map with text-based language(MMTBL)and mind mapping with block-based(MMBBL)are used for this purpose.The results show that instructional approaches using a mind mapping tool to help students solve given tasks in their critical thinking are more effective than other instructional techniques.
基金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.
文摘In the Cellular Long-Term Evolution (LTE) downlink, the smallest radio resource unit a Scheduler can assign to a user is a Resource Block (RB). Each RB consists of twelve (12) adjacent Orthogonal Frequency Division Multiplexing (OFDM) sub-carriers with inter-subcarrier spacing of 15 kHz. Over the years, researchers have investigated the problem of radio resource allocation in cellular LTE downlink and have made useful contributions. In an earlier paper for example, we proposed a deterministic dynamic programming based technique for optimal allocation of RBs in the downlink of multiuser Cellular LTE System. We found that this proposed methodology optimally allocates RBs to users at every transmission instant, but the computational time associated with the allocation policy was high. In the current work, we propose a truncated dynamic programming based technique for efficient and optimal allocation of radio resource. This paper also addresses uncertainty emanating from users’ mobility within a Cell coverage area. The objective is to significantly reduce the computational time and dynamically select applicable modulation scheme (i.e., QPSK, 16QAM, or 64QAM) in response to users’ mobility. We compare the proposed scheme with the Fair allocation and the earlier proposed dynamic programming based techniques. It is shown that the proposed methodology is more efficient in allocating radio resource and has better performance than both the Fair Allocation and the deterministic dynamic programming based techniques.
文摘This paper deals with the research work on the phenomena of local blockage in a transportation network. Onthe basis of introducing the research results in [1], theminimum now capacity problem of a network in the mostseriously blocked situation is studied. With the conceptof complete outset presented in [1], the relationship between the minimum now capacity of a network and its minimum complete cut capacity is discussed, and the reasons for the difference betweent the minimum now capacity of a network and its minimum complete cut capa-city are analysed. In order to get the solution to the problem, the concepts of normalization of a network and its blocking path graph are presented. In the paper it is proved that the necessary and sufficient conditions for the equality between the minumum now capacity and its minumum complete cut capacity are the existence of a feasible flow in the blocking path graph. For the reason that there are some dependent production points in the blocking path graph of a network, the proof about the tenability of the Gale's Theorm for the planat normalized network without circuit is made.
基金supported by the International Cooperation Project of Guangdong Natural Science Fund(2009B050700020)the Natural Science Foundation of China-Guangdong Natural Science Foundation Union Project(U0835003)
文摘Recoverability of block-sparse signals by convex relaxation methods is considered for the underdetermined linear model. In previous works, some explicit but pessimistic recoverability results which were associated with the dictionary were presented. This paper shows the recoverability of block-sparse signals are associated with the block structure when a random dictionary is given. Several probability inequalities are obtained to show how the recoverability changes along with the block structure parameters, such as the number of nonzero blocks, the block length, the dimension of the measurements and the dimension of the block-sparse representation signal. Also, this paper concludes that if the block-sparse structure can be considered, the recoverability of the signals wil be improved. Numerical examples are given to il ustrate the availability of the presented theoretical results.
文摘In this paper we study the problem of locating multiple facilities in convex sets with fuzzy parameters. This problem asks to find the location of new facilities in the given convex sets such that the sum of weighted distances between new facilities and existing facilities is minimized. We present a linear programming model for this problem with block norms, then we use it for problems with fuzzy data. We also do this for rectilinear and infinity norms as special cases of block norms.
