检索结果-内蒙古大学图书馆

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Linchen Yu Xiaofei Liao School of Computer China University of Geosciences Wuhan China Cluster and Grid Computing Lab Hauzhong University of Science and Technology Wuhan China

ISBN: (纸本)9781479934300

Mobile devices have already been widely used to access the Web. However, because most available web pages are designed for desktop PC, it is inconvenient to browse these large web pages on a mobile device with a small screen. In this paper, we propose a new web page transforming scheme to facilitate navigation on a small-form-factor device based on cloud computing. Different with other existing schemes, our approach is based on page segmentation and template-rendering. The semantic structure of a web page is extracted by DOM (Document Object Model) analyzing. Such semantic structure is hierarchical. Each node is corresponded to a block area of one web page and is in charge of reconstructing the whole web page. According to different content styles, the template-rendering scheme generates different display modes. Experimental results show good experience.

关键词： Mobile communication Sorting Web pages Mobile handsets Layout Browsers Internet

来源：评论

学校读者我要写书评

暂无评论

Aeolus: Reconcilable Key Management Mechanism for Secure Group Communication in grid

Aeolus: Reconcilable Key Management Mechanism for Secure Gro...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Yunfa Li Xiangha Xu Jian Wan Hai Jin Zongfen Han Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Hangzhou Dianzi University Hangzhou Zhejiang CN

In traditional grid, grid user can not validate whether grid service registered in grid platform can execute correctly or not because the system does not provide the measurement mechanism for grid service. In order to solve this problem, we propose a series of strategies and methods for trusted grid. These strategies and methods include: an access control policy for reference database, an integrity attestation for reference datasheet, a construction method of reference datasheet, a trusted storage algorithm of reference datasheet and a report algorithm of reference datasheet. All these constitute the measurement mechanism of service for trusted grid. Some experiments are done in order to validate the feasibility and the availability of this mechanism. The results show that it is feasible and efficient to validate whether grid service registered in trusted grid platform can execute correctly or not.

关键词： Distribution strategy grid computing Information security Centralized control technology management computer science Character generation Large-scale systems Distributed computing Conference management

来源：评论

学校读者我要写书评

暂无评论

Duo: Improving Data Sharing of Stateful Serverless Applications by Efficiently Caching Multi-Read Data

Duo: Improving Data Sharing of Stateful Serverless Applicati...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Zhuo Huang Hao Fan Chaoyi Cheng Song Wu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

A growing number of applications are moving to serverless architectures for high elasticity and fine-grained billing. For stateful applications, however, the use of serverless architectures is likely to lead to significant performance degradation, as frequent data sharing between different execution stages involves time-consuming remote storage access. Current platforms leverage memory cache to speed up remote access. However, conventional caching strategies show limited performance improvement. We experimentally find that the reason is that current strategies overlook the stage-dependent access patterns of stateful serverless applications, i.e., data that are read multiple times across stages (denoted as multi-read data) are wrongly evicted by data that are read only once (denoted as read-once data), causing a high cache miss ***, we propose a new caching strategy, Duo, whose design principle is to cache multi-read data as long as possible. Specifically, Duo contains a large cache list and a small cache list, which act as Leader list and Wingman list, respectively. Leader list ignores the data that is read for the first time to prevent itself from being polluted by massive read-once data at each stage. Wingman list inspects the data that are ignored or evicted by Leader list, and pre-fetches the data that will probably be read again based on the observation that multi-read data usually appear periodically in groups. Compared to the state-of-the-art works, Duo improves hit ratio by 1.1×-2.1× and reduces the data sharing overhead by 25%-62%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TSS: Applying two-stage sampling in micro-architecture simulations

TSS: Applying two-stage sampling in micro-architecture simul...

引用

International Symposium on Modeling, Analysis and Simulation of computer and Telecommunication Systems (MASCOTS)

作者： Zhibin Yu Hai Jin Jian Chen Lizy K. John Service Computing Technology and System Laboratory Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

ISBN: (纸本)9781424449279

Accelerating micro-architecture simulation is becoming increasingly urgent as the complexity of workload and simulated processor increases. This paper presents a novel two-stage sampling (TSS) scheme to accelerate the sampling-based simulation. It firstly selects some large samples from a dynamic instruction stream as candidates of detail simulation and then samples some small groups from each selected first stage sample to do detail simulation. Since the distribution of standard deviation of cycle per instruction (CPI) is insensitive to microarchitecture, TSS could be used to speedup design space exploration by splitting the sampling process into two stages, which is able to remove redundant instruction samples from detail simulation when the program is in stable program phase (standard deviation of CPI is near zero). It also adopts systematic sampling to accelerate the functional warm-up in sampling simulation. Experimental results show that, by combining these two techniques, TSS achieves an average and maximum speedup of 1.3 and 2.29 over SMARTS, with the average CPI relative error is less than 3%. TSS could significantly accelerate the time consuming iterative early design evaluation process.

关键词： Sampling methods Computational modeling Acceleration Microarchitecture computer simulation Redundancy grid computing Space exploration computer errors Process design

来源：评论

学校读者我要写书评

暂无评论

Query-Centered Temporal Community Search via Time-Constrained Personalized PageRank

arXiv

引用

arXiv 2023年

作者： Lin, Longlong Yuan, Pingpeng Li, Rong-Hua Zhu, Chunxue Qin, Hongchao Jin, Hai Jia, Tao College of Computer and Information Science Southwest University Chongqing400715 China National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Computer Science and Technololgy Beijing Institute of Technology Beijing100081 China

Existing temporal community search suffers from two defects: (i) they ignore the temporal proximity between the query vertex q and other vertices but simply require the result to include q. Thus, they find many temporal irrelevant vertices (these vertices are called query-drifted vertices) to q for satisfying their cohesiveness, resulting in q being marginalized;(ii) their methods are NP-hard, incurring high costs for exact solutions or compromised qualities for approximate/heuristic algorithms. Inspired by these, we propose a novel problem named query-centered temporal community search to circumvent query-drifted vertices. Specifically, we first present a novel concept of Time-Constrained Personalized PageRank to characterize the temporal proximity between q and other vertices. Then, we introduce a model called β-temporal proximity core, which can combine temporal proximity and structural cohesiveness. Subsequently, our problem is formulated as an optimization task that finds a β-temporal proximity core with the largest β. To solve our problem, we first devise an exact and near-linear time greedy removing algorithm that iteratively removes unpromising vertices. To improve efficiency, we then design an approximate two-stage local search algorithm with bound-based pruning techniques. Finally, extensive experiments on eight real-life datasets and nine competitors show the superiority of the proposed solutions. © 2023, CC BY.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

QoS-Aware Service Selection for Customisable Multi-tenant Service-Based Systems: Maturity and Approaches

QoS-Aware Service Selection for Customisable Multi-tenant Se...

引用

IEEE International Conference on Cloud computing, CLOUD

作者： Qiang He Jun Han Feifei Chen Yanchun Wang Rajesh Vasa Yun Yang Hai Jin School of Software and Electrical Engineering Swinburne University of Technology Melbourne Australia Services Computing Technology and Systems Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Multi-tenant service-based systems (SBSs) have become a major paradigm in software engineering in the cloud environment. Instead of serving a single end-user, a multitenant SBS provides multiple tenants with similar and yet customised functionalities with potentially different quality-of service (QoS) values. Thus, existing approaches to service selection for single-tenant SBSs are no longer suitable. Furthermore, the target multi-tenancy maturity level also needs to be considered in the service selection approach for an SBS. In this paper, we propose three novel QoS-aware service selection approaches for composing multi-tenant SBSs that achieve three different multi-tenancy maturity levels. Extensive and comprehensive experiments are conducted and the experimental results show that our approaches outperform the existing approach in both effectiveness and efficiency.

关键词： Optimization Engines Throughput Rails Insurance Linear programming

来源：评论

学校读者我要写书评

暂无评论

Scalable Optimal Margin Distribution Machine

arXiv

引用

arXiv 2023年

作者： Wang, Yilin Cao, Nan Zhang, Teng Shi, Xuanhua Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

Optimal margin Distribution Machine (ODM) is a newly proposed statistical learning framework rooting in the latest margin theory, which demonstrates better generalization performance than the traditional large margin based counterparts. However, it suffers from the ubiquitous scalability problem regarding both computation time and memory storage as other kernel methods. This paper proposes a scalable ODM, which can achieve nearly ten times speedup compared to the original ODM training method. For nonlinear kernels, we put forward a novel distribution-aware partition method to make the local ODM trained on each partition be close and converge fast to the global one. When linear kernel is applied, we extend a communication efficient SVRG method to accelerate the training further. Extensive empirical studies validate that our proposed method is highly computational efficient and almost never worsen the generalization. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Integrating Attribute and Status Constraint into the RBAC Model for Access Control in Ubiquitous Systems

Integrating Attribute and Status Constraint into the RBAC Mo...

引用

International Conference on Future Generation Communication and Networking (FGCN)

作者： Deqing Zou Jong Hyuk Park Tai-hoon Kim Xueguang Chen Cluster and Grid Computing Laboratory & Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computer Engineering Kyungnam University Masan Gyeongsangnam South Korea Hannam University South Korea Department of Control Science and Engineering Huazhong University of Science and Technology China

It now becomes a trend to implement the interconnections between resources as well as services in ubiquitous systems. Attribute-based authorization mechanisms, protocols and systems are gaining in popularity, such as SAML, XACML, Shibboleth, etc. However, their management efficiency could be further improved. The Role-based Access Control (RBAC) mechanism is widely accepted as a general mechanism for authorization management. However, RBAC is still not flexible enough to address various application scenarios in ubiquitous systems. We propose a new architecture for access control in ubiquitous systems that impose attribute and status constraints on the RBAC model, which can significantly enhance the generality and flexibility of authorization by integrating the advantages of RBAC and attributed- based access control models. Moreover, the state mechanism proposed in this architecture captures the states of the authorization elements so as to reflect the outcomes of the authorization control. Finally, we analyze the flexibility and generality of this architecture in ubiquitous systems.

关键词： Access control Authorization Permission grid computing Pervasive computing Access protocols Application software Markup languages computer science Control system analysis

来源：评论

学校读者我要写书评

暂无评论

Enabling Complete Atomicity for Cross-Chain Applications Through Layered State Commitments

Enabling Complete Atomicity for Cross-Chain Applications Thr...

引用

Reliable Distributed Systems

作者： Yuandi Cai Ru Cheng Yifan Zhou Shijie Zhang Jiang Xiao Hai Jin Services Computing Technology and System Lab Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (数字)9798331530037

ISBN: (纸本)9798331530044

Cross-chain Decentralized Applications (dApps) are increasingly popular for their ability to handle complex tasks across various blockchains, extending beyond simple asset transfers or swaps. However, ensuring all dependent transactions execute correctly together, known as complete atomicity, remains a challenge. Existing works provide financial atomicity, protecting against monetary loss, but lack the ability to ensure correctness for complex tasks. In this paper, we introduce Avalon, a transaction execution framework for cross-chain dApps that guarantees complete atomicity for the first time. Avalon achieves this by introducing multiple state layers above the native one to cache state transitions, allowing for efficient management of these state transitions. Most notably, for concurrent cross-chain transactions, Avalon resolves not only intra-chain conflicts but also addresses potential inconsistencies between blockchains via a novel state synchronization protocol, enabling serializable cross-chain execution. We implement Avalon using smart contracts in Cosmos ecosystem and evaluate its commitment performance, demonstrating acceptable latency and gas consumption even under conflict cases.

关键词： Atomic layer deposition Smart contracts Ecosystems Decentralized applications Consensus protocol Synchronization Reliability Interoperability

来源：评论

学校读者我要写书评

暂无评论

Virtual Machine Management Based on Agent Service

Virtual Machine Management Based on Agent Service

引用

IEEE International Conference on Parallel and Distributed computing, Applications and Technologies (PDCAT)

作者： Song Wu Li Deng Hai Jin Xuanhua Shi Yankun Zhao Wei Gao Jianyin Zhang Jin Peng Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China China Mobile Research Institute Beijing China

With the popularity of virtualization, the problem that how to manage hundreds even thousands of virtual machines running on multiple physical computing nodes becomes important. Current virtual machine management systems only can obtain basic information of virtual machines and execute simple operations on them, such as start, reboot and shutdown. In this paper, we design a virtual machine management approach based on agent service. Agent service can provide detail running status information inside virtual machines. It also has been a bridge for host machines and virtual machines to interact with each other. Agent service is designed to automatically start when virtual machine boots up. By agent service we can get real-time information about virtual machines. We evaluate monitoring overhead and the performance of batch operations when using agent. The experimental results show that agent mechanism outperforms methods using Libvirt or VMware tools.

关键词： Virtual machining Servers Monitoring Maintenance engineering Operating systems Hardware

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：