Towards the crossing and coupling permissions in tasks existed widely in many fields and considering the design of role view must rely on the activities of the tasks process,based on Role Based Accessing Control (RBAC...Towards the crossing and coupling permissions in tasks existed widely in many fields and considering the design of role view must rely on the activities of the tasks process,based on Role Based Accessing Control (RBAC) model,this paper put forward a Role Tree-Based Access Control (RTBAC) model. In addition,the model definition and its constraint formal description is also discussed in this paper. RTBAC model is able to realize the dynamic organizing,self-determination and convenience of the design of role view,and guarantee the least role permission when task separating in the mean time.展开更多
为了解决机器至机器(machine-to-machine,M2M)业务接入对传统长期演进(long term evolution,LTE)网络造成的冲击,针对大量时延敏感M2M设备同时发起随机接入的场景,基于一种时延特性较优的Tree-splitting算法,通过估计信道负载量,引入动...为了解决机器至机器(machine-to-machine,M2M)业务接入对传统长期演进(long term evolution,LTE)网络造成的冲击,针对大量时延敏感M2M设备同时发起随机接入的场景,基于一种时延特性较优的Tree-splitting算法,通过估计信道负载量,引入动态前导码分配算法,提出了一种基于Tree-splitting的随机接入冲突解决动态算法。仿真时通过与静态算法对比,结果验证了所提出算法优良的时延、吞吐量特性和资源利用率。展开更多
We propose an efficient hybrid algorithm WDHP in this paper for mining frequent access patterns. WDHP adopts the techniques of DHP to optimize its performance, which is using hash table to filter candidate set and tri...We propose an efficient hybrid algorithm WDHP in this paper for mining frequent access patterns. WDHP adopts the techniques of DHP to optimize its performance, which is using hash table to filter candidate set and trimming database. Whenever the database is trimmed to a size less than a specified threshold, the algorithm puts the database into main memory by constructing a tree, and finds frequent patterns on the tree. The experiment shows that WDHP outperform algorithm DHP and main memory based algorithm WAP in execution efficiency.展开更多
Many efforts have been made to develop time division multiple access (TDMA) slots allocation in amulti-hop converge-cast wireless sensor network (WSN),however,most of them either use complex algorithmor concern frames...Many efforts have been made to develop time division multiple access (TDMA) slots allocation in amulti-hop converge-cast wireless sensor network (WSN),however,most of them either use complex algorithmor concern frames only without simultaneous transmission in a single slot.In this paper,we presenta timeslot assignment scheme for cluster-tree-based TDMA WSN,covering three frequently used workingmodes in practical applications.The shortest frame formed can guarantee real-time communication and isalso facilitated for message and slot integration,since timeslots allocated to a single node are continuous.During allocation processes,the algorithms are distributed and light-weighted.The experiment resultedfrom a WSN prototype system shows that our scheme can achieve a good reliability.展开更多
R Tree is a good structure for spatial searching. But in this indexing structure, either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibil...R Tree is a good structure for spatial searching. But in this indexing structure, either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R tree (PBAR tree).展开更多
基金Knowledge Innovation Project and Intelligent Infor mation Service and Support Project of the Shanghai Education Commission, China
文摘Towards the crossing and coupling permissions in tasks existed widely in many fields and considering the design of role view must rely on the activities of the tasks process,based on Role Based Accessing Control (RBAC) model,this paper put forward a Role Tree-Based Access Control (RTBAC) model. In addition,the model definition and its constraint formal description is also discussed in this paper. RTBAC model is able to realize the dynamic organizing,self-determination and convenience of the design of role view,and guarantee the least role permission when task separating in the mean time.
文摘为了解决机器至机器(machine-to-machine,M2M)业务接入对传统长期演进(long term evolution,LTE)网络造成的冲击,针对大量时延敏感M2M设备同时发起随机接入的场景,基于一种时延特性较优的Tree-splitting算法,通过估计信道负载量,引入动态前导码分配算法,提出了一种基于Tree-splitting的随机接入冲突解决动态算法。仿真时通过与静态算法对比,结果验证了所提出算法优良的时延、吞吐量特性和资源利用率。
文摘We propose an efficient hybrid algorithm WDHP in this paper for mining frequent access patterns. WDHP adopts the techniques of DHP to optimize its performance, which is using hash table to filter candidate set and trimming database. Whenever the database is trimmed to a size less than a specified threshold, the algorithm puts the database into main memory by constructing a tree, and finds frequent patterns on the tree. The experiment shows that WDHP outperform algorithm DHP and main memory based algorithm WAP in execution efficiency.
基金Supported by the National High Technology Research and Development Programme of China ( No. 2006AA040302 2007AA041201 +1 种基金 2007AA041301 )the National Creative Research Groups Science Foundation of China (No. 60721062)
文摘Many efforts have been made to develop time division multiple access (TDMA) slots allocation in amulti-hop converge-cast wireless sensor network (WSN),however,most of them either use complex algorithmor concern frames only without simultaneous transmission in a single slot.In this paper,we presenta timeslot assignment scheme for cluster-tree-based TDMA WSN,covering three frequently used workingmodes in practical applications.The shortest frame formed can guarantee real-time communication and isalso facilitated for message and slot integration,since timeslots allocated to a single node are continuous.During allocation processes,the algorithms are distributed and light-weighted.The experiment resultedfrom a WSN prototype system shows that our scheme can achieve a good reliability.
基金This work is supported by University IT Research Center ProjectKorea.
文摘R Tree is a good structure for spatial searching. But in this indexing structure, either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R tree (PBAR tree).
