期刊文献+
共找到2,003篇文章
< 1 2 101 >
每页显示 20 50 100
Observatory science with eXTP
1
作者 Jean J. M. in 't Zand Enrico Bozzo +103 位作者 JinLu Qu Xiang-Dong Li Lorenzo Amati Yang Chen Immacolata Donnarumma Victor Doroshenko Stephen A. Drake Margarita Hernanz Peter A. Jenke Thomas J. Maccarone Simin Mahmoodifar Domitilla de Martino Alessandra De Rosa Elena M. Rossi Antonia Rowlinson Gloria Sala Giulia Stratta Thomas M. Tauris Joern Wilms XueFeng Wu Ping Zhou Iván Agudo Diego Altamirano Jean-Luc Atteia Nils A. Andersson M. Cristina Baglio David R. Ballantyne Altan Baykal Ehud Behar Tomaso Belloni Sudip Bhattacharyya Stefano Bianchi Anna Bilous Pere Blay Jo ao Braga S?ren Brandt Edward F. Brown Niccolò Bucciantini Luciano Burderi Edward M. Cackett Riccardo Campana Sergio Campana Piergiorgio Casella Yuri Cavecchi Frank Chambers Liang Chen Yu-Peng Chen Jérome Chenevez Maria Chernyakova ChiChuan Jin Riccardo Ciolfi Elisa Costantini Andrew Cumming Antonino D'Aì Zi-Gao Dai Filippo D'Ammando Massimiliano De Pasquale Nathalie Degenaar Melania Del Santo Valerio D'Elia Tiziana Di Salvo Gerry Doyle Maurizio Falanga XiLong Fan Robert D. Ferdman Marco Feroci Federico Fraschetti Duncan K. Galloway Angelo F. Gambino Poshak Gandhi MingYu Ge Bruce Gendre Ramandeep Gill Diego Gotz Christian Gouiffès Paola Grandi Jonathan Granot Manuel Güdel Alexander Heger Craig O. Heinke Jeroen Homan Rosario Iaria Kazushi Iwasawa Luca Izzo Long Ji Peter G. Jonker Jordi José Jelle S. Kaastra Emrah Kalemci Oleg Kargaltsev Nobuyuki Kawai Laurens Keek Stefanie Komossa Ingo Kreykenbohm Lucien Kuiper Devaky Kunneriath Gang Li En-Wei Liang Manuel Linares Francesco Longo FangJun Lu Alexander A. Lutovinov Denys Malyshev Julien Malza 《中国科学:物理学、力学、天文学英文版》 SCIE EI CAS CSCD 2019年第2期97-138,共42页
In this White Paper we present the potential of the enhanced X-ray Timing and Polarimetry (eXTP) mission for studies related toObservatory Science targets. These include flaring stars, supernova remnants, accreting wh... In this White Paper we present the potential of the enhanced X-ray Timing and Polarimetry (eXTP) mission for studies related toObservatory Science targets. These include flaring stars, supernova remnants, accreting white dwarfs, low and high mass X-raybinaries, radio quiet and radio loud active galactic nuclei, tidal disruption events, and gamma-ray bursts. eXTP will be excellentlysuited to study one common aspect of these objects: their often transient nature. Developed by an international Consortium ledby the Institute of High Energy Physics of the Chinese Academy of Science, the eXTP mission is expected to be launched in themid 2020s. 展开更多
关键词 space research instruments nuclear ASTROPHYSICS flare stars ACCRETION and ACCRETION disks mass loss and stellar winds cataclysmic BINARIES X-RAY BINARIES supernova REMNANTS active galactic nuclei X-RAY BURSTS gamma-ray BURSTS gravitational waves
A V2I communication-based pipeline model for adaptive urban traffic light scheduling
2
作者 Libing WU Lei NIE +2 位作者 Samee U. KHAN Osman KHALID Dan WU 《中国计算机科学前沿:英文版》 SCIE EI CSCD 2019年第5期929-942,共14页
Adaptive traffic light scheduling based on realtime traffic information processing has proven effective for urban traffic congestion management. However, fine-grained information regarding individual vehicles is diffi... Adaptive traffic light scheduling based on realtime traffic information processing has proven effective for urban traffic congestion management. However, fine-grained information regarding individual vehicles is difficult to acquire through traditional data collection techniques and its accuracy cannot be guaranteed because of congestion and harsh environments. In this study, we first build a pipeline model based on vehicle-to-infrastructure communication, which is a salient technique in vehicular adhoc networks. This model enables the acquisition of fine-grained and accurate traffic information in real time via message exchange between vehicles and roadside units. We then propose an intelligent traffic light scheduling method (ITLM) based on a “demand assignment” principle by considering the types and turning intentions of vehicles. In the context of this principle, a signal phase with more vehicles will be assigned a longer green time. Furthermore, a green-way traffic light scheduling method (GTLM) is investigated for special vehicles (e.g., ambulances and fire engines) in emergency scenarios. Signal states will be adjusted or maintained by the traffic light control system to keep special vehicles moving along smoothly. Comparative experiments demonstrate that the ITLM reduces average wait time by 34%-78% and average stop frequency by 12%-34% in the context of traffic management. The GTLM reduces travel time by 22%^44% and 30%-55% under two types of traffic conditions and achieves optimal performance in congested scenarios. 展开更多
关键词 traffic light SCHEDULING vehicular ad HOC networks PIPELINE MODEL vehicle-to-infrastructure COMMUNICATION INTERSECTION
A Survey on Graph Processing Accelerators:Challenges and Opportunities
3
作者 Chuang-Yi Gui Long Zheng +4 位作者 Bingsheng He Cheng Liu Xin-Yu Chen Xiao-Fei Liao Hai Jin 《计算机科学技术学报:英文版》 SCIE EI CSCD 2019年第2期339-371,共33页
Graph is a well known data structure to represent the associated relationships in a variety of applications,e.g.,data science and machine learning.Despite a wealth of existing efforts on developing graph processing sy... Graph is a well known data structure to represent the associated relationships in a variety of applications,e.g.,data science and machine learning.Despite a wealth of existing efforts on developing graph processing systems for improving the performance and/or energy efficiency on traditional architectures,dedicated hardware solutions,also referred to as graph processing accelerators,are essential and emerging to provide the benefits significantly beyond what those pure software solutions can offer.In this paper,we conduct a systematical survey regarding the design and implementation of graph processing accelerators.Specifically,we review the relevant techniques in three core components toward a graph processing accelerator:preprocessing,parallel graph computation,and runtime scheduling.We also examine the benchmarks and results in existing studies for evaluating a graph processing accelerator.Interestingly,we find that there is not an absolute winner for all three aspects in graph acceleration due to the diverse characteristics of graph processing and the complexity of hardware configurations.We finally present and discuss several challenges in details,and further explore the opportunities for the future research. 展开更多
关键词 GRAPH processing ACCELERATOR domain-specific ARCHITECTURE performance energy EFFICIENCY
LKLR: A Local Tangent Space-Alignment Kernel Least-Squares Regression Algorithm
4
作者 Chao Tan Genlin Ji 《清华大学学报自然科学版(英文版)》 EI CAS CSCD 2019年第4期389-399,共11页
In the fields of machine learning and data mining, label learning is a nascent area of research, and within this paradigm, there is much room for improving multi-label manifold learning algorithms for high-dimensional... In the fields of machine learning and data mining, label learning is a nascent area of research, and within this paradigm, there is much room for improving multi-label manifold learning algorithms for high-dimensional data. Thus far, researchers have experimented with mapping relationships from the feature space to the traditional logical label space(using neighbors in the label space, for example, to predict logical label vectors from the feature space’s manifold structure). Here we combine the feature manifold’s and label space’s local topological structures to reconstruct the label manifold. To achieve this, we use a nonlinear manifold learning algorithm to transform the local topological structure from the feature space to the label space. Our algorithm adopts a regularized leastsquares kernel method to realize the reconstruction process, employing an optimization function to find the best solution. Extensive experiments show that our algorithm significantly improves multi-label manifold learning in terms of learning accuracy and time complexity. 展开更多
关键词 MULTI-LABEL MANIFOLD learning local topological structure REGULARIZED least SQUARES KERNEL method
WiSH: WiFi-Based Real-Time Human Detection
5
作者 Tianmeng Hang Yue Zheng +5 位作者 Kun Qian Chenshu Wu Zheng Yang Xiancun Zhou Yunhao Liu Guilin Chen 《清华大学学报自然科学版(英文版)》 EI CAS CSCD 2019年第5期615-629,共15页
Sensorless sensing using wireless signals has been rapidly conceptualized and developed recently. Among numerous applications of WiFi-based sensing, human presence detection acts as a primary and fundamental function ... Sensorless sensing using wireless signals has been rapidly conceptualized and developed recently. Among numerous applications of WiFi-based sensing, human presence detection acts as a primary and fundamental function to boost applications in practice. Many complicated approaches have been proposed to achieve high detection accuracy, but they frequently omit various practical constraints such as real-time capability, computation efficiency, sampling rates, deployment efforts, etc. A practical detection system that works in realworld applicati ons is lacki ng. In this paper, we design and implement WiSH, a real-time system for con tactless human detection that is applicable for whole-day usage. WiSH employs lightweight yet effective methods and thus enables detection under practical conditions even on resource-limited devices with low signal sampling rates. We deploy WiSH on commodity desktops and customized tiny no des in different everyday scenarios. The experimental results dem on strate the superior performance of WiSH, which has a detection accuracy of >98% using a sampling rate of 20 Hz with an average detection delay of merely 1.5 s. Thus, we believe WiSH is a promising system for real-world deployment. 展开更多
关键词 channel state information human detection REAL-TIME system wireless SENSING off-the-shelf WIFI
How security bugs are fixed and what can be improved:an empirical study with Mozilla
6
作者 Xiaobing SUN Xin PENG +2 位作者 Kai ZHANG Yang LIU Yuanfang CAI 《中国科学:信息科学(英文版)》 SCIE EI CSCD 2019年第1期210-212,共3页
Dear editor,A bug is regarded as security related when it creates vulnerability in the software,which the malicious attackers could exploit to attack the system [1].Security bugs widely exist in released software,and ... Dear editor,A bug is regarded as security related when it creates vulnerability in the software,which the malicious attackers could exploit to attack the system [1].Security bugs widely exist in released software,and are serious threats to organizations,which can cause serious monetary loss and reputation damage.Therefore,addressing security bugs is a top priority in software maintenance [1]. 展开更多
关键词 SECURITY bugs empirical
EFFECT:an efficient flexible privacy-preserving data aggregation scheme with authentication in smart grid
7
作者 Zhitao GUAN Yue ZHANG +2 位作者 Liehuang ZHU Longfei WU Shui YU 《中国科学:信息科学(英文版)》 SCIE EI CSCD 2019年第3期27-40,共14页
Smart grid is considered as a promising approach to solve the problems of carbon emission and energy crisis.In smart grid,the power consumption data are collected to optimize the energy utilization.However,security is... Smart grid is considered as a promising approach to solve the problems of carbon emission and energy crisis.In smart grid,the power consumption data are collected to optimize the energy utilization.However,security issues in communications still present practical concerns.To cope with these challenges,we propose EFFECT,an efficient flexible privacy-preserving aggregation scheme with authentication in smart grid.Specifically,in the proposed scheme,we achieve both data source authentication and data aggregation in high efficiency.Besides,in order to adapt to the dynamic smart grid system,the threshold for aggregation is adjusted according to the energy consumption information of each particular residential area and the time period,which can support fault-tolerance while ensuring individual data privacy during aggregation.Detailed security analysis shows that our scheme can satisfy the desired security requirements of smart grid.In addition,we compare our scheme with existing schemes to demonstrate the effectiveness of our proposed scheme in terms of low computational complexity and communication overhead. 展开更多
关键词 PRIVACY-PRESERVING AUTHENTICATION BATCH VERIFICATION SMART GRID
Differentially Private Top-K Items Based on Least Mean Square——Take E-Commerce Platforms for Example
8
作者 CAO Mengyue WU Fusheng +3 位作者 NI Mingtao XIONG Xingxing LIU Shubo WANG Jun 《武汉大学学报:自然科学英文版》 CAS CSCD 2019年第2期98-106,共9页
User preference data broadly collected from e-commerce platforms have benefits to improve the user's experience of individual purchasing recommendation by data mining and analyzing, which may bring users the risk ... User preference data broadly collected from e-commerce platforms have benefits to improve the user's experience of individual purchasing recommendation by data mining and analyzing, which may bring users the risk of privacy disclosure .In this paper, we explore the problem of differential private top-k items based on least mean square. Specifically, we consider the balance between utility and privacy level of released data and improve the precision of top-k based on post-processing. We show that our algorithm can achieve differential privacy over streaming data collected and published periodically by server provider. We evaluate our algorithm with three real datasets, and the experimental results show that the precision of our method reaches 85% with strong privacy protection, which outperforms the Kalman filter-based existing methods. 展开更多
关键词 TOP-K differential PRIVACY least mean square STREAMING data
Non-negative locality-constrained vocabulary tree for finger vein image retrieval
9
作者 Kun SU Gongping YANG +2 位作者 Lu YANG Peng SU Yilong YIN 《中国计算机科学前沿:英文版》 SCIE EI CSCD 2019年第2期318-332,共15页
Finger vein image retrieval is a biometric identification technology that has recently attracted a lot of attention. It has the potential to reduce the search space and has attracted a considerable amount of research ... Finger vein image retrieval is a biometric identification technology that has recently attracted a lot of attention. It has the potential to reduce the search space and has attracted a considerable amount of research effort recently. It is a challenging problem owing to the large number of images in biometric databases and the lack of efficient retrieval schemes. We apply a hierarchical vocabulary tree modelbased image retrieval approach because of its good scalability and high efficiency. However, there is a large accumulative quantization error in the vocabulary tree (VT) model that may degrade the retrieval precision. To solve this problem, we improve the vector quantization coding in the VT model by introducing a non-negative locality-constrained constraint: the non-negative locality-constrained vocabulary tree-based image retrieval model. The proposed method can effectively improve coding performanee and the discriminative power of local features. Extensive experiments on a large fused finger vein database demonstrate the superiority of our encoding method. Experimental results also show that our retrieval strategy achieves better performanee than other state-of-theart methods, while maintaining low time complexity. 展开更多
关键词 non-negative locality-constrained vocabulary tree finger vein image retrieval large scale inverted INDEXING
Dense matter with eXTP
10
作者 Anna L. Watts WenFei Yu +73 位作者 Juri Poutanen Shu Zhang Sudip Bhattacharyya Slavko Bogdanov Long Ji Alessandro Patruno Thomas E. Riley Pavel Bakala Altan Baykal Federico Bernardini Ignazio Bombaci Edward Brown Yuri Cavecchi Deepto Chakrabarty Jérome Chenevez Nathalie Degenaar Melania Del Santo Tiziana Di Salvo Victor Doroshenko Maurizio Falanga Robert D. Ferdman Marco Feroci Angelo F. Gambino MingYu Ge Svenja K. Greif Sebastien Guillot Can Gungor Dieter H. Hartmann Kai Hebeler Alexander Heger Jeroen Homan Rosario Iaria Jean in 't Zand Oleg Kargaltsev Aleksi Kurkela XiaoYu Lai Ang Li XiangDong Li ZhaoSheng Li Manuel Linares FangJun Lu Simin Mahmoodifar Mariano Méndez M. Coleman Miller Sharon Morsink Joonas Nattila Andrea Possenti Chanda Prescod-Weinstein JinLu Qu Alessandro Riggio Tuomo Salmi Andrea Sanna Andrea Santangelo Hendrik Schatz Achim Schwenk LiMing Song Eva v Srámková Benjamin Stappers Holger Stiele Tod Strohmayer Ingo Tews Laura Tolos Gabriel Torok David Tsang Martin Urbanec Andrea Vacchi RenXin Xu YuPeng Xu Silvia Zane GuoBao Zhang ShuangNan Zhang WenDa Zhang ShiJie Zheng Xia Zhou 《中国科学:物理学、力学、天文学英文版》 SCIE EI CAS CSCD 2019年第2期28-44,共17页
In this White Paper we present the potential of the Enhanced X-ray Timing and Polarimetry (eXTP) mission for determining the nature of dense matter;neutron star cores host an extreme density regime which cannot be rep... In this White Paper we present the potential of the Enhanced X-ray Timing and Polarimetry (eXTP) mission for determining the nature of dense matter;neutron star cores host an extreme density regime which cannot be replicated in a terrestrial laboratory. The tightest statistical constraints on the dense matter equation of state will come from pulse profile modelling of accretion-powered pulsars, burst oscillation sources, and rotation-powered pulsars. Additional constraints will derive from spin measurements, burst spectra, and properties of the accretion flows in the vicinity of the neutron star. Under development by an international Consortium led by the Institute of High Energy Physics of theChinese Academy of Sciences, the eXTP mission is expected to be launched in the mid 2020s. 展开更多
关键词 NEUTRON X-rays DENSE MATTER EQUATION of STATE
Current progress in developing metal oxide nanoarrays-based photoanodes for photoelectrochemical water splitting
11
作者 Yongcai Qiu Zhenghui Pan +4 位作者 Haining Chen Daiqi Ye Lin Guo Zhiyong Fan Shihe Yang 《科学通报:英文版》 SCIE EI CSCD 2019年第18期1348-1380,共33页
Solar energy driven photoelectrochemical(PEC)water splitting is a clean and powerful approach for renewable hydrogen production.The design and construction of metal oxide based nanoarray photoanodes is one of the prom... Solar energy driven photoelectrochemical(PEC)water splitting is a clean and powerful approach for renewable hydrogen production.The design and construction of metal oxide based nanoarray photoanodes is one of the promising strategies to make the continuous breakthroughs in solar to hydrogen conversion efficiency of PEC cells owing to their owned several advantages including enhaneed reactive surface at the electrode/electrolyte interface,improved light absorption capability,increased charge separation efficiency and direct electron transport pathways.In this Review,we first introduce the structure,work principle and their relevant efficiency calculations of a PEC cell.We then give a summary of the state-of the-art research in the preparation strategies and growth mechanism for the metal oxide based nano arrays,and some details about the performances of metal oxide based nanoarray photoanodes for PEC water splitting.Finally,we discuss key aspects which should be addressed in conrinued work on realizing high-efficiency metal oxide based nanoarray photoa no des for PEC solar water splitti ng systems. 展开更多
关键词 Photoelectrochemical water splitting Metal oxide based nanoarray photoanodes Preparation strategies and growth mechanism
Energy-efficient Virtual Machine Allocation Technique Using Flower Pollination Algorithm in Cloud Datacenter:A Panacea to Green Computing
12
作者 Mohammed Joda Usman Abdul Samad Ismail +5 位作者 Hassan Chizari Gaddafi Abdul-Salaam Ali Muhammad Usman Abdulsalam Yau Gital Omprakash Kaiwartya Ahmed Aliyu 《仿生工程学报:英文版》 SCIE EI CSCD 2019年第2期354-366,共13页
Cloud computing has attracted significant interest due to the increasing service demands from organizations offloading computationally intensive tasks to datacenters.Meanwhile,datacenter infrastructure comprises hardw... Cloud computing has attracted significant interest due to the increasing service demands from organizations offloading computationally intensive tasks to datacenters.Meanwhile,datacenter infrastructure comprises hardware resources that consume high amount of energy and give out carbon emissions at hazardous levels.In cloud datacenter,Virtual Machines(VMs)need to be allocated on various Physical Machines(PMs)in order to minimize resource wastage and increase energy efficiency.Resource allocation problem is NP-hard.Hence finding an exact solution is complicated especially for large-scale datacenters.In this con text,this paper proposes an Energy-oriented Flower Pollination Algorithm(E-FPA)for VM allocation in cloud datacenter environments.A system framework for the scheme was developed to enable energy-oriented allocation of various VMs on a PM.The allocation uses a strategy called Dynamic Switching Probability(DSP).The framework finds a near optimal solution quickly and balances the exploration of the global search and exploitation of the local search.It considers a processor,storage,and memory constraints of a PM while prioritizing energy-oriented allocation for a set of VMs.Simulations performed on MultiRecCloudSim utilizing planet workload show that the E-FPA outperforms the Genetic Algorithm for Power-Aware(GAPA)by 21.8%,Order of Exchange Migration(OEM)ant colony system by 21.5%,and First Fit Decreasing(FFD)by 24.9%.Therefore,E-FPA significantly improves datacenter performance and thus,enhances environmental sustainability. 展开更多
关键词 VIRTUALIZATION green computing cloud DATACENTER energy optimization
Identity-based public auditing for cloud storage systems against malicious auditors via blockchain
13
作者 Jingting XUE Chunxiang XU +1 位作者 Jining ZHAO Jianfeng MA 《中国科学:信息科学(英文版)》 SCIE EI CSCD 2019年第3期41-56,共16页
Cloud storage systems provide users with convenient data storage services,which allow users to access and update outsourced data remotely.However,these cloud storage services do not guarantee the integrity of the data... Cloud storage systems provide users with convenient data storage services,which allow users to access and update outsourced data remotely.However,these cloud storage services do not guarantee the integrity of the data that users store in the cloud.Thus,public auditing is necessary,in which a third-party auditor(TPA)is delegated to audit the integrity of the outsourced data.This system allows users to enjoy on-demand cloud storage services without the burden of continually auditing their data integrity.However,certain TPAs might deviate from the public auditing protocol and/or collude with the cloud servers.In this article,we propose an identity-based public auditing(IBPA)scheme for cloud storage systems.In IBPA,the nonces in a blockchain are employed to construct unpredictable and easily verified challenge messages,thereby preventing the forging of auditing results by malicious TPAs to deceive users.Users need only to verify the TPAs'auditing results in batches to ensure the integrity of their data that are stored in the cloud.A detailed security analysis shows that IBPA can preserve data integrity against various attacks.In addition,a comprehensive performance evaluation demonstrates that IBPA is feasible and efficient. 展开更多
关键词 cloud storage PUBLIC integrity AUDITING IDENTITY-BASED CRYPTOGRAPHY blockchain security analysis
CBSC: A Crowdsensing System for Automatic Calibrating of Barometers
14
作者 Hai-Bo Ye Xuan-Song Li +1 位作者 Li Sheng Kai Dong 《计算机科学技术学报:英文版》 SCIE EI CSCD 2019年第5期1007-1019,共13页
The mobile crowdsensing software systems can complete large-scale and complex sensing tasks with the help of the collective intelligence from large numbers of ordinary users. In this paper, we build a typical crowdsen... The mobile crowdsensing software systems can complete large-scale and complex sensing tasks with the help of the collective intelligence from large numbers of ordinary users. In this paper, we build a typical crowdsensing system, which can efficiently calibrate large numbers of smartphone barometer sensors. The barometer sensor now becomes a very common sensor on smartphones. It is very useful in many applications, such as positioning, environment sensing and activity detection. Unfortunately, most smartphone barometers today are not accurate enough, and it is rather challenging to efficiently calibrate a large number of smartphone barometers. Here, we try to achieve this goal by designing a crowdsensingbased smartphone calibration system, which is called CBSC. It makes use of low-power barometers on smartphones and needs few reference points and little human assistant. We propose a hidden Markov model for peer-to-peer calibration, and calibrate all the barometers by solving a minimum dominating set problem. The field studies show that CBSC can get an accuracy of within 0.1 hPa in 84% cases. Compared with the traditional solutions, CBSC is more practical and the accuracy is satisfying. The experience gained when building this system can also help the development of other crowdsensing-based systems. 展开更多
关键词 crowdsensing SYSTEM SMARTPHONE SENSING BAROMETER CALIBRATION
Who Should Be Invited to My Party:A Size-Constrained k-Core Problem in Social Networks
15
作者 Yu-Liang Ma Ye Yuan +3 位作者 Fei-Da Zhu Guo-RenWang Jing Xiao Jian-Zong Wang 《计算机科学技术学报:英文版》 SCIE EI CSCD 2019年第1期170-184,共15页
In this paper,we investigate the problem of a size-constrained k-core group query (SCCGQ)in social networks, taking both user closeness and network topology into consideration.More specifically,SCCGQ intends to find a... In this paper,we investigate the problem of a size-constrained k-core group query (SCCGQ)in social networks, taking both user closeness and network topology into consideration.More specifically,SCCGQ intends to find a group of h users that has the highest social closeness while being a k-core.SCCGQ can be widely applied to event planning,task assignment,social analysis,and many other fields.In contrast to existing work on the k-core detection problem,which aims to find a k-core in a social network,SCCGQ not only focuses on k-core detection but also takes size constraints into consideration.Although the conventional k-core detection problem can be solved in linear time,SCCGQ has a higher complexity.To solve the problem of SCCGQ,we propose a Blast Scatter (BS)algorithm,which appoints the query node as the center to begin outward expansions via breadth search.In each outward expansion,BS finds a new center through a greedy strategy and then selects multiple neighbors of the center.To speed up the BS algorithm,we propose an advanced search algorithm,called Bounded Extension (BE).Specifically,BE combines an effective social distance pruning strategy and a tight upper bound of social closeness to prune the search space considerably.In addition,we propose an offiine social-aware index to accelerate the query processing.Finally,our experimental results demonstrate the efficiency and effectiveness of our proposed algorithms on large real-world social networks. 展开更多
关键词 group QUERY k-core SOCIAL analysis SOCIAL network
Generalized pigeon-inspired optimization algorithms
16
作者 Shi CHENG Xiujuan LEI +2 位作者 Hui LU Yong ZHANG Yuhui SHI 《中国科学:信息科学(英文版)》 SCIE EI CSCD 2019年第7期120-130,共11页
Dear editor,We propose a generalized pigeon-inspired optimization (GPIO) algorithm to enhance the exploitation ability of the original pigeon-inspired optimization (PIO) algorithm. Three variants of the PIO algorithms... Dear editor,We propose a generalized pigeon-inspired optimization (GPIO) algorithm to enhance the exploitation ability of the original pigeon-inspired optimization (PIO) algorithm. Three variants of the PIO algorithms, including the original PIO,GPIO with ring structure (PIOr), and GPIO with ring structure and simplified landmark operator(PIOrs), are analyzed from a component-wise perspective. 展开更多
关键词 pigeon-inspired ALGORITHMS RING structure
A novel index system describing program runtime characteristics for workload consolidation
17
作者 Lin WANG Depei QIAN +3 位作者 Rui WANG Zhongzhi LUAN Hailong YANG Huaxiang ZHANG 《中国计算机科学前沿:英文版》 SCIE EI CSCD 2019年第3期489-499,共11页
Workload consolidation is a common method to improve the resource utilization in clusters or data centers. In order to achieve efficient workload consolidation, the runtime characteristics of a program should be taken... Workload consolidation is a common method to improve the resource utilization in clusters or data centers. In order to achieve efficient workload consolidation, the runtime characteristics of a program should be taken into con-sideration in scheduling. In this paper, we propose a novel index system for efficiently describing the program runtime characteristics. With the help of this index system, programs can be classified by the following runtime characteristics: 1) dependence to multi-dimensional resources including CPU, disk I/O, memory and network I/O;and 2) impact and vulnerability to resource sharing embodied by resource usage and resource sensitivity. In order to verify the effectiveness of this novel index system in workload consolidation, a scheduling strategy, Sche-index, using the new index system for workload consolidation is proposed. Experiment results show that compared with traditional least-loaded scheduling strategy, Sche-index can improve both program performance and system resource utilization significantly. 展开更多
关键词 index system RUNTIME CHARACTERISTICS WORKLOAD CONSOLIDATION CLUSTER SCHEDULING
A secure data sharing scheme with cheating detection based on Chaum-Pedersen protocol for cloud storage
18
作者 Xin WANG Bo YANG +1 位作者 Zhe XIA Hong-xia HOU 《信息与电子工程前沿:英文版》 SCIE EI CSCD 2019年第6期787-800,共14页
With the development of cloud computing technology, data can be outsourced to the cloud and conveniently shared among users. However, in many circumstances, users may have concerns about the reliability and integrity ... With the development of cloud computing technology, data can be outsourced to the cloud and conveniently shared among users. However, in many circumstances, users may have concerns about the reliability and integrity of their data. It is crucial to provide data sharing services that satisfy these security requirements. We introduce a reliable and secure data sharing scheme, using the threshold secret sharing technique and the ChaumPedersen zero-knowledge proof. The proposed scheme is not only effective and flexible, but also able to achieve the semantic security property. Moreover, our scheme is capable of ensuring accountability of users’ decryption keys as well as cheater identification if some users behave dishonestly. The efficiency analysis shows that the proposed scheme has a better performance in terms of computational cost, compared with the related work. It is particularly suitable for application to protect users’ medical insurance data over the cloud. 展开更多
关键词 Data SHARING Chaum- Pedersen PROOF CHEATING det ection CLOUD storage
A Review on Swarm Intelligence and Evolutionary Algorithms for Solving Flexible Job Shop Scheduling Problems 预览
19
作者 Kaizhou Gao Zhiguang Cao +3 位作者 Le Zhang Zhenghua Chen Yuyan Han Quanke Pan 《自动化学报:英文版》 CSCD 2019年第4期904-916,共13页
Flexible job shop scheduling problems(FJSP)have received much attention from academia and industry for many years.Due to their exponential complexity,swarm intelligence(SI)and evolutionary algorithms(EA)are developed,... Flexible job shop scheduling problems(FJSP)have received much attention from academia and industry for many years.Due to their exponential complexity,swarm intelligence(SI)and evolutionary algorithms(EA)are developed,employed and improved for solving them.More than 60%of the publications are related to SI and EA.This paper intents to give a comprehensive literature review of SI and EA for solving FJSP.First,the mathematical model of FJSP is presented and the constraints in applications are summarized.Then,the encoding and decoding strategies for connecting the problem and algorithms are reviewed.The strategies for initializing algorithms?population and local search operators for improving convergence performance are summarized.Next,one classical hybrid genetic algorithm(GA)and one newest imperialist competitive algorithm(ICA)with variables neighborhood search(VNS)for solving FJSP are presented.Finally,we summarize,discus and analyze the status of SI and EA for solving FJSP and give insight into future research directions. 展开更多
关键词 EVOLUTIONARY algorithm flexible JOB SHOP scheduling REVIEW SWARM INTELLIGENCE
在线阅读 下载PDF
Learning distributed representations for community search using node embedding
20
作者 Jinglian LIU Daling WANG +2 位作者 Shi FENG Yifei ZHANG Weiji ZHAO 《中国计算机科学前沿:英文版》 SCIE EI CSCD 2019年第2期437-439,共3页
1 Introduction and main contributions Community search is a query-dependent variant of community detection problem in social network analysis. Algorithms of this type usually start with a query node preknown to be in ... 1 Introduction and main contributions Community search is a query-dependent variant of community detection problem in social network analysis. Algorithms of this type usually start with a query node preknown to be in the target community, and uncover the remaining nodes in the community. The key challenge in this problem is how to find a proper way to represent network structure as a representation that can be easily exploited by downstream data mining models. 展开更多
关键词 COMMUNITY SEARCH NODE EMBEDDING SOCIAL network analysis
上一页 1 2 101 下一页 到第
使用帮助 返回顶部 意见反馈