检索结果-南通市图书馆

BEAP： An End-User Agile Programming Paradigm for Business Applications

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2006年第4期21卷 609-619页

作者：舒承椿余海燕刘昊植 research center for Grid and Service computing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 P.R. China Graduate University of the Chinese Academy of Sciences Beijing 100039 P.R. China

Business applications are subject to changes with technology trends or market demands. However, quick response to these changes is still a challenging issue. Most of the existing architectures （e.g., CORBA, Web Services） still expose the developers to excessive low-level details and force a tight coupling between program modules. For end users, developing, customizing, and reengineering applications remain difficult and time-consuming tasks. A high-level programming model is presented, together with a descriptive programming paradigm called BEAP, to facilitate end-user programming. In this approach, applications could be visually composed from well-defined software components called ＂funnels＂ in an event-driven fashion. Application examples have shown that, by raising the level of abstraction as well as simplifying the programming model, BEAP could empower end users to build business applications on demand with improved productivity.

关键词： visual programming event-based virtualization component agile pi-calculus

Creating customized data services from web pages

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 2013年第2期19卷 203-207页

作者：季光 Wang Guiling Han Yanbo Institute of computing Technology Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences research center for Cloud computing North China University of Technology

To extract structured data from a web page with customized requirements,a user labels some DOM elements on the page with attribute *** common features of the labeled elements are utilized to guide the user through the labeling process to minimize user efforts,and are also utilized to retrieve attribute *** turn the attribute values into a structured result,the attribute pattern needs to be *** this purpose,a space-optimized suffix tree called attribute tree is built to transform the document object model(DOM) tree into a simpler form while preserving its useful properties such as attribute sequence *** pattern is induced bottom-up on the attribute tree,and is further used to build the structured *** are conducted and show high performance of our approach in terms of precision,recall and structural correctness.

关键词： web data extraction structured data user labeling customization data service

Resource abstraction and data placement for distributed hybrid memory pool

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2021年第3期15卷 47-57页

作者： Tingting CHEN Haikun LIU Xiaofei LIAO Hai JIN National Engineering research center for Big Data Technology and System Services Computing Technology and System Lab/Gluster and Grid Computing LabSchool of Gomputing Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

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.

关键词： load balance distributed hybrid memory clouds

Precise control of page cache for containers

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2024年第2期18卷 17-30页

作者： Kun WANG Song WU Shengbang LI Zhuo HUANG Hao FAN Chen YU Hai JIN National Engineering research center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

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.

关键词： page cache memory cgroup container isolation cloud computing

ReCSA:a dedicated sort accelerator using ReRAM-based content addressable memory

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2023年第2期17卷 1-13页

作者： Huize LI Hai JIN Long ZHENG Yu HUANG Xiaofei LIAO National Engineering research center for Big Data Technology and System Services Computing Technology and System LabClusters and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

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.

关键词： ReCAM parallel sorting architecture design processing-in-memory

On the complexity of computing Markov perfect equilibrium in general-sum stochastic games

在线全文

学校读者我要写书评

暂无评论

National Science Review 2023年第1期10卷 288-301页

作者： Xiaotie Deng Ningyuan Li David Mguni Jun Wang Yaodong Yang center on Frontiers of computing Studies School of Computer Science Peking University center for Multi-Agent research Institute for AI Peking University Huawei UK Computer Science University College London

Similar to the role of Markov decision processes in reinforcement learning,Markov games(also called stochastic games) lay down the foundation for the study of multi-agent reinforcement learning and se quential agent *** introduce approximate Markov perfect equilibrium as a solution to the computational problem of finite-state sto chastic games repeated in the infinite horizon and prove its *** solution concept preserves the Markov perfect property and opens up the possibility for the success of multi-agent reinforcement learning algorithms on static two-player games to be extended to multi-agent dynamic games,expanding the reign of the PPAD-complete class.

关键词： Markov game multi-agent reinforcement learning Markov perfect equilibrium PPAD-completeness stochastic game

A novel unsupervised method for new word extraction

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2016年第9期59卷 11-21页

作者： Lili MEI Heyan HUANG Xiaochi WEI Xianling MAO Beijing Engineering research center of High Volume Language Information Processing and Cloud computing Applications Department of Computer Science and TechnologyBeijing Institute of Technology

New words could benefit many NLP tasks such as sentence chunking and sentiment analysis. However, automatic new word extraction is a challenging task because new words usually have no fixed language pattern, and even appear with the new meanings of existing words. To tackle these problems, this paper proposes a novel method to extract new words. It not only considers domain specificity, but also combines with multiple statistical language knowledge. First, we perform a filtering algorithm to obtain a candidate list of new words. Then, we employ the statistical language knowledge to extract the top ranked new words. Experimental results show that our proposed method is able to extract a large number of new words both in Chinese and English corpus, and notably outperforms the state-of-the-art methods. Moreover, we also demonstrate our method increases the accuracy of Chinese word segmentation by 10% on corpus containing new words.

关键词： new word extraction word segmentation domain specificity statistical language knowledge domain word extraction

Novel quantum secret image-sharing scheme

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics B 2019年第4期28卷 61-69页

作者： Gao-Feng Luo Ri-Gui Zhou Wen-Wen Hu College of Information Engineering Shanghai Maritime University College of Information Engineering Shaoyang University research center of Intelligent Information Processing and Quantum Intelligent computing

In this paper, we propose a novel quantum secret image-sharing scheme which constructs m quantum secret images into m+1 quantum share images. A chaotic image generated by the logistic map is utilized to assist in the construction of quantum share images first. The chaotic image and secret images are expressed as quantum image representation by using the novel enhanced quantum representation. To enhance the confidentiality, quantum secret images are scrambled into disordered images through the Arnold transform. Then the quantum share images are constructed by performing a series of quantum swap operations and quantum controlled-NOT operations. Because all quantum operations are invertible, the original quantum secret images can be reconstructed by performing a series of inverse operations. Theoretical analysis and numerical simulation proved both the security and low computational complexity of the scheme, which has outperformed its classical counterparts. It also provides quantum circuits for sharing and recovery processes.

关键词： quantum image processing secret image sharing quantum computation quantum circuit

Performance Optimization and Comparison of the Alternating Direction Implicit CFD Solver on Multi-core and Many-Core Architectures

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2018年第3期27卷 540-548页

作者： DENG Liang ZHAO Dan BAI Hanli WANG Fang Computational Aerodynamics Institue China Aerodynamics Research and Development Center Collaborative Innovation center of High Performance computing National University of Denfense Technology School of Computer National University of Denfense Technology

We accelerate a double precision Alternating direction implicit(ADI) solver for three-dimensional compressible Navier-Stokes equations from our in-house Computational fluid dynamics(CFD) software on the latest multi-core and many-core architectures(Intel Sandy Bridge CPUs, Intel Many integrated core(MIC) coprocessors and NVIDIA Kepler K20c GPUs). Some performance optimization techniques are detailed discussed. We provide an in-depth analysis on the performance difference between Sandy Bridge and MIC. Experimental results show that the proposed GPU-enabled ADI solver can achieve a speedup of 5.5 on a Kepler GPU in contrast to two Sandy Bridge CPUs and our optimization techniques can improve the performance of the ADI solver by 2.5-fold on two Sandy Bridge CPUs and 1.7-fold on an Intel MIC coprocessor. We perform a cross-platform performance analysis(between GPU and MIC), which serves as case studies for developers to select the right accelerators for their target applications.

关键词： Multi-block Structured grid Alternating direction implicit(ADI) CFD solver Sandy bridge MIC GPU Optimization techniques Performance comparison