Ciphertext-policy attribute-based encryption(CP-ABE)allows a user with some attributes to decrypt the ciphertexts associated with these *** several CP-ABE schemes with the constant size ciphertext were proposed to red...
详细信息
Ciphertext-policy attribute-based encryption(CP-ABE)allows a user with some attributes to decrypt the ciphertexts associated with these *** several CP-ABE schemes with the constant size ciphertext were proposed to reduce the communication cost,their master public and secret keys still have the size linear in the total number of *** schemes are unpractical for the attribute-scalable and many-attributes scenario.A new CP-ABE scheme is *** attribute is mapped to a mathematical value by a combination *** master public and secret keys of the proposed CP-ABE scheme have the size linear in the binary size of a hash function’s *** has the comparable performance with existing schemes in the aspects like the time costs of encryption and decryption,the expressiveness of access policy and the provable security.
Knowledge graph (KG) representation learning aims to map entities and relations into a low-dimensional representation space, showing significant potential in many tasks. Existing approaches follow two categories: (1) ...
详细信息
Knowledge graph (KG) representation learning aims to map entities and relations into a low-dimensional representation space, showing significant potential in many tasks. Existing approaches follow two categories: (1) Graph-based approaches encode KG elements into vectors using structural score functions. (2) Text-based approaches embed text descriptions of entities and relations via pre-trained language models (PLMs), further fine-tuned with triples. We argue that graph-based approaches struggle with sparse data, while text-based approaches face challenges with complex relations. To address these limitations, we propose a unified Text-Augmented Attention-based Recurrent Network, bridging the gap between graph and natural language. Specifically, we employ a graph attention network based on local influence weights to model local structural information and utilize a PLM based prompt learning to learn textual information, enhanced by a mask-reconstruction strategy based on global influence weights and textual contrastive learning for improved robustness and generalizability. Besides, to effectively model multi-hop relations, we propose a novel semantic-depth guided path extraction algorithm and integrate cross-attention layers into recurrent neural networks to facilitate learning the long-term relation dependency and offer an adaptive attention mechanism for varied-length information. Extensive experiments demonstrate that our model exhibits superiority over existing models across KG completion and question-answering tasks.
Free riding is a great challenge to the development and maintenance of Peer-to-Peer(P2P)networks.A file migration and workload balancing based approach (FMWBBA)to discourage free riding is proposed in this *** heart o...
详细信息
Free riding is a great challenge to the development and maintenance of Peer-to-Peer(P2P)networks.A file migration and workload balancing based approach (FMWBBA)to discourage free riding is proposed in this *** heart of our mechanism is to migrate some shared files from the overloaded peers to the neighboring free riders automatically and transparently,which enforces free riders to offer services when altruistic peers are heavily *** migration is a key issue in our approach,and some related strategies are discussed.A simulation is designed to verify this approach,and the results show that it can not only alleviate free riding,but also improve the Quality of Service(QoS)and robustness of P2P networks efficiently.
With the increasing amount of data,there is an urgent need for efficient sorting algorithms to process large data *** sorting algorithms have attracted much attention because they can take advantage of different hardw...
详细信息
With the increasing amount of data,there is an urgent need for efficient sorting algorithms to process large data *** sorting algorithms have attracted much attention because they can take advantage of different hardware's *** the traditional hardware sort accelerators suffer“memory wall”problems since their multiple rounds of data transmission between the memory and the *** this paper,we utilize the in-situ processing ability of the ReRAM crossbar to design a new ReCAM array that can process the matrix-vector multiplication operation and the vector-scalar comparison in the same array *** this designed ReCAM array,we present ReCSA,which is the first dedicated ReCAM-based sort *** hardware designs,we also develop algorithms to maximize memory utilization and minimize memory exchanges to improve sorting *** sorting algorithm in ReCSA can process various data types,such as integer,float,double,and *** also present experiments to evaluate the performance and energy efficiency against the state-of-the-art sort *** experimental results show that ReCSA has 90.92×,46.13×,27.38×,84.57×,and 3.36×speedups against CPU-,GPU-,FPGA-,NDP-,and PIM-based platforms when processing numeric data *** also has 24.82×,32.94×,and 18.22×performance improvement when processing string data sets compared with CPU-,GPU-,and FPGA-based platforms.
Container-based virtualization isbecoming increasingly popular in cloud computing due to its efficiency and *** isolation is a fundamental property of *** works have indicated weak resource isolation could cause signi...
详细信息
Container-based virtualization isbecoming increasingly popular in cloud computing due to its efficiency and *** isolation is a fundamental property of *** works have indicated weak resource isolation could cause significant performance degradation for containerized applications and enhanced resource ***,current studies have almost not discussed the isolation problems of page cache which is a key resource for *** leverage memory cgroup to control page cache ***,existing policy introduces two major problems in a container-based ***,containers can utilize more memory than limited by their cgroup,effectively breaking memory ***,the Os kernel has to evict page cache to make space for newly-arrived memory requests,slowing down containerized *** paper performs an empirical study of these problems and demonstrates the performance impacts on containerized *** we propose pCache(precise control of page cache)to address the problems by dividing page cache into private and shared and controlling both kinds of page cache separately and *** do so,pCache leverages two new technologies:fair account(f-account)and evict on demand(EoD).F-account splits the shared page cache charging based on per-container share to prevent containers from using memory for free,enhancing memory *** EoD reduces unnecessary page cache evictions to avoid the performance *** evaluation results demonstrate that our system can effectively enhance memory isolation for containers and achieve substantial performance improvement over the original page cache management policy.
Emerging byte-addressable non-volatile memory(NVM)technologies offer higher density and lower cost than DRAM,at the expense of lower performance and limited write *** have been many studies on hybrid NVM/DRAM memory m...
详细信息
Emerging byte-addressable non-volatile memory(NVM)technologies offer higher density and lower cost than DRAM,at the expense of lower performance and limited write *** have been many studies on hybrid NVM/DRAM memory management in a single physical ***,it is still an open problem on how to manage hybrid memories efficiently in a distributed *** paper proposes Alloy,a memory resource abstraction and data placement strategy for an RDMA-enabled distributed hybrid memory pool(DHMP).Alloy provides simple APIs for applications to utilize DRAM or NVM resource in the DHMP,without being aware of the hardware details of the *** propose a hotness-aware data placement scheme,which combines hot data migration,data replication and write merging together to improve application performance and reduce the cost of *** evaluate Alloy with several micro-benchmark workloads and public benchmark *** results show that Alloy can significantly reduce the DRAM usage in the DHMP by up to 95%,while reducing the total memory access time by up to 57%compared with the state-of-the-art approaches.
With the growing allel programming,nowadays popularity of task-based partask-parallel programming libraries and languages are still with limited support for coordinating parallel *** limitation forces programmers to u...
详细信息
With the growing allel programming,nowadays popularity of task-based partask-parallel programming libraries and languages are still with limited support for coordinating parallel *** limitation forces programmers to use additional independent components to coordinate the parallel tasks -the components can be third-party libraries or additional components in the same programming library or ***,mixing tasks and coordination components increase the difficulty of task-based programming,and blind schedulers for understanding tasks'dependencies. In this paper,we propose a task-based parallel programming library,Function Flow,which coordinates tasks in the purpose of avoiding additional independent coordination ***,we use dependency expression to represent ubiquitous tasks'*** key idea behind dependency expression is to use && for both task's termination and Ⅱ for any task termination,along with the combination of dependency ***,as runtime support,we use a lightweight representation for dependency expression. Also,we use suspended-task queue to schedule tasks that still have prerequisites to run. Finally,we demonstrate Function Flow's effectiveness in two aspects,case study about implementing popular parallel patterns with FunctionFIow,and performance comparision with state-of-the-art practice,*** demonstration shows that FunctionFIow can generally coordinate parallel tasks without involving additional components,along with comparable performance with TBB.
Docker,as a mainstream container solution,adopts the Copy-on-Write(CoW)mechanism in its storage *** mechanism satisfies the need of different containers to share the same ***,when a single container performs operation...
详细信息
Docker,as a mainstream container solution,adopts the Copy-on-Write(CoW)mechanism in its storage *** mechanism satisfies the need of different containers to share the same ***,when a single container performs operations such as modification of an image file,a duplicate is created in the upper readwrite layer,which contributes to the runtime *** the accessed image file is fairly large,this additional overhead becomes *** we present the concept of Dynamic Prefetching Strategy Optimization(DPSO),which optimizes the Co W mechanism for a Docker container on the basis of the dynamic prefetching *** the beginning of the container life cycle,DPSO pre-copies up the image files that are most likely to be copied up later to eliminate the overhead caused by performing this operation during application *** experimental results show that DPSO has an average prefetch accuracy of greater than 78%in complex scenarios and could effectively eliminate the overhead caused by the CoW mechanism.
Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are labeled graph,it highly demands labe...
详细信息
Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are labeled graph,it highly demands label-Constrained Reachability(LCR)query inwhich constraint includes a set of labels besides vertex *** researches proposed several methods for answering some LCR queries which require appearance of some labels specified in constraints in the *** that constraint may be a label set,query constraint may be ordered labels,namely OLCR(Ordered-label-Constrained Reachability)queries which retrieve paths matching a sequence of ***,no solutions are available for ***,we propose DHL,a novel bloom filter based indexing technique for answering OLCR *** can be used to check reachability between vertex *** the answers are not no,then constrained DFS is ***,we employ DHL followed by performing constrained DFS to answer OLCR *** show that DHL has a bounded false positive rate,and it's powerful in saving indexing time and *** experiments on 10 real-life graphs and 12 synthetic graphs demonstrate that DHL achieves about 4.8-22.5 times smaller index space and 4.6-114 times less index construction time than two state-of-art techniques for LCR queries,while achieving comparable query response *** results also show that our algorithm can answer OLCR queries effectively.
In grid computing environment,grid users often *** the original user may be under the risk of information leakage and identity abused for sending his credential to remote computing *** grid security practice has few m...
详细信息
In grid computing environment,grid users often *** the original user may be under the risk of information leakage and identity abused for sending his credential to remote computing *** grid security practice has few means to enforce the security of credential *** computing (TC) technology can be added to grid computing environment to enhance the grid *** TC using an essential in-platform (trusted)third party,Trusted Platform Module (TPM),we can use TC to protect the user *** this paper we present credential migration management (CMM) system,which is a part of Daonity project,to manifest migrating credential in security between different computers with TPM.
暂无评论