检索结果-南通市图书馆

Providing Virtual Cloud for Special Purposes on Demand in JointCloud computing Environment

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer science & Technology 2017年第2期32卷 211-218页

作者： Dong-Gang Cao Member, CCF, IEEE, Bo An Pei-Chang Shi Huai-Min Wang Key laboratory of High Confidence software Technologies (Peking University) Ministry of Education Beijing 100871 China National Key laboratory for parallel and Distributed Processing National University of Defense and Technology Changsha 410073 China

Cloud computing has been widely adopted by enterprises because of its on-demand and elastic resource usage paradigm. Currently most cloud applications are running on one single cloud. However, more and more applications demand to run across several clouds to satisfy the requirements like best cost efficiency, avoidance of vender lock-in, and geolocation sensitive service. JointCloud computing is a new research initiated by Chinese institutes to address the computing issues concerned with multiple clouds. In JointCloud, users＇ diverse and dynamic requirements on cloud resources axe satisfied by providing users virtual cloud （VC） for special purposes. A virtual cloud for special purposes is in essence a user＇s specific cloud working environment having the customized software stacks, configurations and computing resources readily available. This paper first introduces what is JointCloud computing and then describes the design rationales, motivation examples, mechanisms and enabling technologies of VC in JointCloud.

关键词： cloud computing JointCloud virtual cloud (VC) cloud working environment

Representation learning on textual network with personalized Page Rank

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2021年第11期64卷 95-104页

作者： Teng LI Yong DOU National laboratory for parallel and Distributed Processing National University of Defense Technology

Representation learning on textual network or textual network embedding, which leverages rich textual information associated with the network structure to learn low-dimensional embedding of vertices, has been useful in a variety of tasks. However, most approaches learn textual network embedding by using direct neighbors. In this paper, we employ a powerful and spatially localized operation: personalized Page Rank(PPR) to eliminate the restriction of using only the direct connection relationship. Also, we analyze the relationship between PPR and spectral-domain theory, which provides insight into the empirical performance boost. From the experiment, we discovered that the proposed method provides a great improvement in linkprediction tasks, when compared to existing methods, achieving a new state-of-the-art on several real-world benchmark datasets.

关键词： representation learning network embedding PageRank textual network personalized PageRank

Cryptanalysis of a Completely Anonymous Multi-recipient Signcryption Scheme with Public Verification

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Donghua University(English Edition) 2015年第2期32卷 240-243页

作者：张波孙涛于代荣 School of Information science and Engineering University of Jinan Shandong Provincial Key laboratory of Network Based Intelligent computing Shandong Provincial Key laboratory of software Engineering

Anonymity is a very important security objective in network ***,Pang et *** a novel multirecipient signcryption scheme with complete anonymity and claimed that the new concrete scheme was strong existential unforgeability under selective multi-ID,chosen message ***,by giving concrete attacks,named " inside attack" and " outside attack" respectively,we indicate that Pang et al.'s scheme is not secure in their security model.

关键词： recipient private claimed secure giving message signer outside secret chosen

维普期刊数据库

Quality assessment of crowdsourced test cases

在线全文

学校读者我要写书评

暂无评论

science China(Information sciences) 2020年第9期63卷 27-42页

作者： Yuan ZHAO Yang FENG Yi WANG Rui HAO Chunrong FANG Zhenyu CHEN State Key laboratory for Novel software Technology Nanjing University Golisano College of computing and Information sciences Rochester Institute of Technology

Various software-engineering problems have been solved by crowdsourcing. In many projects,the software outsourcing process is streamlined on cloud-based platforms. Among software engineering tasks,test-case development is particularly suitable for crowdsourcing, because a large number of test cases can be generated at little monetary cost. However, the numerous test cases harvested from crowdsourcing can be high-or low-quality. Owing to the large volume, distinguishing the high-quality tests by traditional techniques is computationally expensive. Therefore, crowdsourced testing would benefit from an efficient mechanism distinguishes the qualities of the test cases. This paper introduces an automated approach —TCQA — to evaluate the quality of test cases based on the onsite coding history. Quality assessment by TCQA proceeds through three steps:(1) modeling the code history as a time series,(2) extracting the multiple relevant features from the time series, and(3) building a model that classifies the test cases based on their qualities. Step(3) is accomplished by feature-based machine-learning techniques. By leveraging the onsite coding history, TCQA can assess the test-case quality without performing expensive source-code analysis or executing the test cases. Using the data of nine test-development tasks involving more than 400 participants, we evaluated TCQA from multiple perspectives. The TCQA approach assessed the quality of the test cases with higher precision, faster speed, and lower overhead than conventional test-case qualityassessment techniques. Moreover, TCQA provided yield real-time insights on test-case quality before the assessment was finished.

关键词： crowdsourcing onsite programming test quality programming behavior

High Performance Interconnect Network for Tianhe System

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer science & Technology 2015年第2期30卷 259-272页

作者：廖湘科庞征王克非卢宇彤谢旻夏军董德尊所光 College of Computer National University of Defense Technology Changsha 410073 science and Technology on parallel and Distributed Processing laboratory National Changsha 410073 China China University of Defense Technology State Key laboratory of High Performance computing National University of Defense Technology Changsha 410073 China

In this paper, we present the Tianhe-2 interconnect network and message passing services. We describe the architecture of the router and network interface chips, and highlight a set of hardware and software features effectively supporting high performance communications, ranging over remote direct memory access, collective optimization, hardwareenable reliable end-to-end communication, user-level message passing services, etc. Measured hardware performance results are also presented.

关键词： Tianhe-2 supercomputer interconnect network router architecture network interface architecture user-level message passing

TULAM:trajectory-user linking via attention mechanism

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2024年第1期67卷 51-68页

作者： Hao LI Shuyu CAO Yaqing CHEN Min ZHANG Dengguo FENG Trusted computing and Information Assurance laboratory Institute of SoftwareChinese Academy of Sciences University of Chinese Academy of sciences

Recently,the application of location-based services(LBS) has become a prevalent means to provide convenience in customers’ everyday ***,because massive volumes of location information are collected by LBS applications,users may suffer from serious privacy *** studies have shown that the identities of users can be inferred from historical anonymous trajectories,which is formulated as the trajectory-user linking(TUL) *** some recurrent neural network(RNN)-based models have been proposed to capture implicit movement patterns among trajectories to improve TUL performance,they cannot learn the sequential and contextual semantics within any individual trajectory completely,leaving the advantages of RNNs *** therefore propose an RNN model with an attention mechanism called TULAM to improve the accuracy of the TUL *** learns sequential relationships within individual trajectories via RNN and captures contextual semantics from trajectories via a multi-head attention ***,we propose a novel location encoding method called approximate one-hot to solve the corpus shortage problem of trajectory *** were conducted on real datasets from the Gowalla and Foursquare LBS *** experimental results indicate that TULAM is a practical solution that achieves significant improvements over existing methods with satisfactory model complexity and convergence.

关键词： information security data security and privacy trajectory-user linking deep learning recurrent neural network attention mechanism

同方期刊数据库

Secure Two-Party Point-Circle Inclusion Problem

在线全文

学校读者我要写书评

暂无评论

Journal of Computer science & Technology 2007年第1期22卷 88-91页

作者：罗永龙黄刘生仲红 Department of Computer science University of Science and Technology of China Hefei 230027 China Department of Computer science Anhui Normal University Wuhu 241000 China Anhui Province Key laboratory of software in computing and Communication Hefei 230027 China

Privacy-preserving computational geometry is a special secure multi-party computation and has many applications. Previous protocols for determining whether a point is inside a circle are not secure enough. We present a two-round protocol for computing the distance between two private points and develop a more efficient protocol for the point-circle inclusion problem based on the distance protocol. In comparison with previous solutions, our protocol not only is more secure but also reduces the number of communication rounds and the number of modular multiplications significantly.

关键词： secure multi-party computation computational geometry homomorphic encryption scheme private comparison

Improved lattice-based CCA2-secure PKE in the standard model

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2020年第8期63卷 147-168页

作者： Jiang ZHANG Yu YU Shuqin FAN Zhenfeng ZHANG State Key laboratory of Cryptology Guangdong Provincial Key laboratory of Data Security and Privacy Protection Jinan University Department of Computer science and Engineering Shanghai Jiao Tong University Trusted computing and Information Assurance laboratory Institute of SoftwareChinese Academy of Sciences

Based on the identity-based encryption(IBE) from lattices by Agrawal et al.(Eurocrypt’10),Micciancio and Peikert(Eurocrypt’12) presented a CCA1-secure public-key encryption(PKE), which has the best known efficiency in the standard model and can be used to obtain a CCA2-secure PKE from lattices by using the generic BCHK transform(SIAM J Comput, 2006) with a cost of introducing extra overheads to both computation and storage for the use of other primitives such as signatures and commitments. In this paper, we propose a more efficient standard model CCA2-secure PKE from lattices by carefully combining a different message encoding(which encodes the message into the most significant bits of the LWE’s "secret term") with several nice algebraic properties of the tag-based lattice trapdoor and the LWE problem(such as unique witness and additive homomorphism). Compared to the best known lattice-based CCA1-secure PKE in the standard model due to Micciancio and Peikert(Eurocrypt’12), we not only directly achieve the CCA2-security without using any generic transform(and thus do not use signatures or commitments), but also reduce the noise parameter roughly by a factor of 3. This improvement makes our CCA2-secure PKE more efficient in terms of both computation and storage. In particular, when encrypting a 256-bit(respectively,512-bit) message at 128-bit(respectively, 256-bit) security, the ciphertext size of our CCA2-secure PKE is even 33%–44%(respectively, 36%–46%) smaller than that of their CCA1-secure PKE.

关键词： lattice public-key encryption chosen ciphertext security standard model

Feature-Oriented Nonfunctional Requirement Analysis for software Product Line

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer science & Technology 2009年第2期24卷 319-338页

作者：彭鑫 Seok-Won Lee 赵文耘 School of Computer science Fudan University Knowledge-Intensive software Engineering Research Group Department of Software and Information Systems College of Computing and Informatics University of North Carolina at Charlotte

Domain analysis in software product line （SPL） development provides a basis for core assets design and imple- mentation by a systematic and comprehensive commonality/variability analysis. In feature-oriented SPL methods, products of the domain analysis are domain feature models and corresponding feature decision models to facilitate application-oriented customization. As in requirement analysis for a single system, the domain analysis in the SPL development should con- sider both flmctional and nonfunctional domain requirements. However, the nonfunctional requirements （NFRs） are often neglected in the existing domain analysis methods. In this paper, we propose a context-based method of the NFR analysis for the SPL development. In the method, NFRs are materialized by connecting nonfunctional goals with real-world context, thus NFR elicitation and variability analysis can be performed by context analysis for the whole domain with the assistance of NFR templates and NFR graphs. After the variability analysis, our method integrates both functional and nonfunc- tional perspectives by incorporating the nonfunctional goals and operationalizations into an initial functional feature model. NFR-related constraints are also elicited and integrated. Finally, a decision model with both functional and nonfunctional perspectives is constructed to facilitate application-oriented feature model customization. A computer-aided grading system （CAGS） product line is employed to demonstrate the method throughout the paper.

关键词： software product line nonfunctional requirement domain analysis feature-oriented method variability analysis

维普期刊数据库