当前期刊: Frontiers of Computer Science Go to current issue    加入关注    本刊投稿指南
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Identification of differential brain regions in MCI progression via clustering-evolutionary weighted SVM ensemble algorithm
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-22
    Xia-an Bi, Yiming Xie, Hao Wu, Luyun Xu

    Mild cognitive impairment (MCI) as the potential sign of serious cognitive decline could be divided into two stages, i.e., late MCI (LMCI) and early MCI (EMCI). Although the different cognitive states in the MCI progression have been clinically defined, effective and accurate identification of differences in neuroimaging data between these stages still needs to be further studied. In this paper, a

    更新日期:2021-01-22
  • The utilization of algorithms for cloud internet of things application domains: a review
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-22
    Edje E. Abel, Muhammad Shafie Abd Latiff

    Cloud internet of things (IoT) is an emerging technology that is already impelling the daily activities of our lives. However, the enormous resources (data and physical features of things) generated from Cloud-enabled IoT sensing devices are lacking suitable managerial approaches. Existing research surveys on Cloud IoT mainly focused on its fundamentals, definitions and layered architecture as well

    更新日期:2021-01-22
  • Monotonic and nonmonotonic gentzen deduction systems for L 3 -valued propositional logic
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-22
    Cungen Cao, Lanxi Hu, Yuefei Sui

    A sequent is a pair (Γ, Δ), which is true under an assignment if either some formula in Γ is false, or some formula in Δ is true. In L3-valued propositional logic, a multisequent is a triple Δ|Θ|Γ, which is true under an assignment if either some formula in Δ has truth-value t, or some formula in Θ has truth-value m, or some formula in Γ has truth-value f. Correspondingly there is a sound and complete

    更新日期:2021-01-22
  • Incremental join view maintenance on distributed log-structured storage
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-22
    Huichao Duan, Huiqi Hu, Weining Qian, Aoying Zhou

    Modern database systems desperate for the ability to support highly scalable transactions and efficient queries simultaneously for real-time applications. One solution is to utilize query optimization techniques on the on-line transaction processing (OLTP) systems. The materialized view is considered as a panacea to decrease query latency. However, it also involves the significant cost of maintenance

    更新日期:2021-01-22
  • Nested relation extraction with iterative neural network
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-16
    Yixuan Cao, Dian Chen, Zhengqi Xu, Hongwei Li, Ping Luo

    Most existing researches on relation extraction focus on binary flat relations like BornIn relation between a Person and a Location. But a large portion of objective facts described in natural language are complex, especially in professional documents in fields such as finance and biomedicine that require precise expressions. For example, “the GDP of the United States in 2018 grew 2.9% compared with

    更新日期:2021-01-18
  • Resource abstraction and data placement for distributed hybrid memory pool
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-16
    Tingting Chen, Haikun Liu, Xiaofei Liao, Hai Jin

    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 endurance. There have been many studies on hybrid NVM/DRAM memory management in a single physical server. However, it is still an open problem on how to manage hybrid memories efficiently in a distributed environment. This paper proposes

    更新日期:2021-01-18
  • An integrated pipeline model for biomedical entity alignment
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-16
    Yu Hu, Tiezheng Nie, Derong Shen, Yue Kou, Ge Yu

    Biomedical entity alignment, composed of two sub-tasks: entity identification and entity-concept mapping, is of great research value in biomedical text mining while these techniques are widely used for name entity standardization, information retrieval, knowledge acquisition and ontology construction. Previous works made many efforts on feature engineering to employ feature-based models for entity

    更新日期:2021-01-18
  • DOF: a generic approach of domain ontology fuzzification
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-16
    Houda Akremi, Sami Zghal

    Although recent studies on the Semantic Web have focused on crisp ontologies and knowledge representation, they have paid less attention to imprecise knowledge. However, the results of these studies constitute a Semantic Web that can answer requests almost perfectly with respect to precision. Nevertheless, they ensure low recall. As such, we propose in this research work a new generic approach of fuzzification

    更新日期:2021-01-18
  • Protein interaction networks: centrality, modularity, dynamics, and applications
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-15
    Xiangmao Meng, Wenkai Li, Xiaoqing Peng, Yaohang Li, Min Li

    In the post-genomic era, proteomics has achieved significant theoretical and practical advances with the development of high-throughput technologies. Especially the rapid accumulation of protein-protein interactions (PPIs) provides a foundation for constructing protein interaction networks (PINs), which can furnish a new perspective for understanding cellular organizations, processes, and functions

    更新日期:2021-01-15
  • Optimal location query based on k nearest neighbours
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-04
    Yubao Liu, Zitong Chen, Ada Wai-Chee Fu, Raymond Chi-Wing Wong, Genan Dai

    Optimal location query in road networks is a basic operation in the location intelligence applications. Given a set of clients and servers on a road network, the purpose of optimal location query is to obtain a location for a new server, so that a certain objective function calculated based on the locations of clients and servers is optimal. Existing works assume no labels for servers and that a client

    更新日期:2021-01-04
  • Accurate and efficient follower log repair for Raft-replicated database systems
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-04
    Jinwei Guo, Peng Cai, Weining Qian, Aoying Zhou

    State machine replication has been widely used in modern cluster-based database systems. Most commonly deployed configurations adopt the Raft-like consensus protocol, which has a single strong leader which replicates the log to other followers. Since the followers can handle read requests and many real workloads are usually read-intensive, the recovery speed of a crashed follower may significantly

    更新日期:2021-01-04
  • Attention based simplified deep residual network for citywide crowd flows prediction
    Front. Comput. Sci. (IF 1.275) Pub Date : 2021-01-04
    Genan Dai, Xiaoyang Hu, Youming Ge, Zhiqing Ning, Yubao Liu

    Crowd flows prediction is an important problem of urban computing whose goal is to predict the number of incoming and outgoing people of regions in the future. In practice, emergency applications often require less training time. However, there is a little work on how to obtain good prediction performance with less training time. In this paper, we propose a simplified deep residual network for our

    更新日期:2021-01-04
  • Detecting differential transcript usage across multiple conditions for RNA-seq data based on the smoothed LDA model
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-31
    Jing Li, Xuejun Liu, Daoqiang Zhang

    In this paper, we propose a statistical framework MLDA, based on the smoothed LDA to detect the differential usage of transcript isoforms for RNA-seq data. The experimental results show that our method performs competitively on the detection of DTU and obtain more accurate relative transcript abundance compared with other alternatives on both simulated and real data.

    更新日期:2020-12-31
  • A survey of Intel SGX and its applications
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-31
    Wei Zheng, Ying Wu, Xiaoxue Wu, Chen Feng, Yulei Sui, Xiapu Luo, Yajin Zhou

    This paper presents a comprehensive survey on the development of Intel SGX (software guard extensions) processors and its applications. With the advent of SGX in 2013 and its subsequent development, the corresponding research works are also increasing rapidly. In order to get a more comprehensive literature review related to SGX, we have made a systematic analysis of the related papers in this area

    更新日期:2020-12-31
  • Tile selection method based on error minimization for photomosaic image creation
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-31
    Hongbo Zhang, Xin Gao, Jixiang Du, Qing Lei, Lijie Yang

    Photomosaic images are composite images composed of many small images called tiles. In its overall visual effect, a photomosaic image is similar to the target image, and photomosaics are also called “montage art”. Noisy blocks and the loss of local information are the major obstacles in most methods or programs that create photomosaic images. To solve these problems and generate a photomosaic image

    更新日期:2020-12-31
  • A novel DNA-inspired encryption strategy for concealing cloud storage
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-31
    Abhishek Majumdar, Arpita Biswas, Atanu Majumder, Sandeep Kumar Sood, Krishna Lal Baishnab

    Over the last few years, the need of a cloud environment with the ability to detect illegal behaviours along with a secured data storage capability has increased largely. This study presents such a secured cloud storage framework comprising of a deoxyribonucleic acid (DNA) based encryption key which has been generated to make the framework unbreakable, thus ensuring a better and secured distributed

    更新日期:2020-12-31
  • Fine-grained management of I/O optimizations based on workload characteristics
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-31
    Bing Wei, Limin Xiao, Bingyu Zhou, Guangjun Qin, Baicheng Yan, Zhisheng Huo

    With the advent of new computing paradigms, parallel file systems serve not only traditional scientific computing applications but also non-scientific computing applications, such as financial computing, business, and public administration. Parallel file systems provide storage services for multiple applications. As a result, various requirements need to be met. However, parallel file systems usually

    更新日期:2020-12-31
  • Physical layer authentication for automotive cyber physical systems based on modified HB protocol
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-31
    Ahmer Khan Jadoon, Jing Li, Licheng Wang

    Automotive cyber physical systems (CPSs) are ever more utilizing wireless technology for V2X communication as a potential way out for challenges regarding collision detection, wire strap up troubles and collision avoidance. However, security is constrained as a result of the energy and performance limitations of modern wireless systems. Accordingly, the need for efficient secret key generation and

    更新日期:2020-12-31
  • Compositional metric learning for multi-label classification
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-31
    Yan-Ping Sun, Min-Ling Zhang

    Multi-label classification aims to assign a set of proper labels for each instance, where distance metric learning can help improve the generalization ability of instance-based multi-label classification models. Existing multi-label metric learning techniques work by utilizing pairwise constraints to enforce that examples with similar label assignments should have close distance in the embedded feature

    更新日期:2020-12-31
  • Practical age estimation using deep label distribution learning
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-31
    Huiying Zhang, Yu Zhang, Xin Geng

    Age estimation plays an important role in humancomputer interaction system. The lack of large number of facial images with definite age label makes age estimation algorithms inefficient. Deep label distribution learning (DLDL) which employs convolutional neural networks (CNN) and label distribution learning to learn ambiguity from ground-truth age and adjacent ages, has been proven to outperform current

    更新日期:2020-12-31
  • Evolutionary selection for regression test cases based on diversity
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-04
    Baoying Ma, Li Wan, Nianmin Yao, Shuping Fan, Yan Zhang

    Although there are various studies related to selecting test cases, few are available for both path coverage and coverage balance. Our method is to select test cases that both traverse target paths and achieve coverage balance to improve the fault detection rate. We formulate the problem as an evolution selection by applying GA. Experimental results show that our method can effectively improve the

    更新日期:2020-12-04
  • Hierarchical data replication strategy to improve performance in cloud computing
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-04
    Najme Mansouri, Mohammad Masoud Javidi, Behnam Mohammad Hasani Zade

    Cloud computing environment is getting more interesting as a new trend of data management. Data replication has been widely applied to improve data access in distributed systems such as Grid and Cloud. However, due to the finite storage capacity of each site, copies that are useful for future jobs can be wastefully deleted and replaced with less valuable ones. Therefore, it is considerable to have

    更新日期:2020-12-04
  • Task assignment for social-oriented crowdsourcing
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-04
    Gang Wu, Zhiyong Chen, Jia Liu, Donghong Han, Baiyou Qiao

    Crowdsourcing has become an efficient measure to solve machine-hard problems by embracing group wisdom, in which tasks are disseminated and assigned to a group of workers in the way of open competition. The social relationships formed during this process may in turn contribute to the completion of future tasks. In this sense, it is necessary to take social factors into consideration in the research

    更新日期:2020-12-04
  • An evaluation and query algorithm for the influence of spatial location based on R k NN
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-04
    Jingke Xu, Yidan Zhao, Ge Yu

    This paper is devoted to the investigation of the evaluation and query algorithm problem for the influence of spatial location based on RkNN (reverse k nearest neighbor). On the one hand, an object can make contribution to multiple locations. However, for the existing measures for evaluating the influence of spatial location, an object only makes contribution to one location, and its influence is usually

    更新日期:2020-12-04
  • Migration of existing software systems to mobile computing platforms: a systematic mapping study
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-12-04
    Ibrahim Alseadoon, Aakash Ahmad, Adel Alkhalil, Khalid Sultan

    Mobile computing has fast emerged as a pervasive technology to replace the old computing paradigms with portable computation and context-aware communication. Existing software systems can be migrated (while preserving their data and logic) to mobile computing platforms that support portability, context-sensitivity, and enhanced usability. In recent years, some research and development efforts have

    更新日期:2020-12-04
  • The mass, fake news, and cognition security
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-11-11
    Bin Guo, Yasan Ding, Yueheng Sun, Shuai Ma, Ke Li, Zhiwen Yu

    The widespread fake news in social networks is posing threats to social stability, economic development, and political democracy, etc. Numerous studies have explored the effective detection approaches of online fake news, while few works study the intrinsic propagation and cognition mechanisms of fake news. Since the development of cognitive science paves a promising way for the prevention of fake

    更新日期:2020-11-12
  • Find truth in the hands of the few: acquiring specific knowledge with crowdsourcing
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-10-02
    Tao Han, Hailong Sun, Yangqiu Song, Yili Fang, Xudong Liu

    Crowdsourcing has been a helpful mechanism to leverage human intelligence to acquire useful knowledge. However, when we aggregate the crowd knowledge based on the currently developed voting algorithms, it often results in common knowledge that may not be expected. In this paper, we consider the problem of collecting specific knowledge via crowdsourcing. With the help of using external knowledge base

    更新日期:2020-10-02
  • A proactive secret sharing scheme based on Chinese remainder theorem
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-10-02
    Keju Meng, Fuyou Miao, Yu Ning, Wenchao Huang, Yan Xiong, Chin-Chen Chang

    If an adversary tries to obtain a secret s in a (t, n) threshold secret sharing (SS) scheme, it has to capture no less than t shares instead of the secret s directly. However, if a shareholder keeps a fixed share for a long time, an adversary may have chances to filch some shareholders’ shares. In a proactive secret sharing (PSS) scheme, shareholders are supposed to refresh shares at fixed period without

    更新日期:2020-10-02
  • DFD-Net: lung cancer detection from denoised CT scan image using deep learning
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-10-02
    Worku J. Sori, Jiang Feng, Arero W. Godana, Shaohui Liu, Demissie J. Gelmecha

    The availability of pulmonary nodules in CT scan image of lung does not completely specify cancer. The noise in an image and morphology of nodules, like shape and size has an implicit and complex association with cancer, and thus, a careful analysis should be mandatory on every suspected nodules and the combination of information of every nodule. In this paper, we introduce a “denoising first” two-path

    更新日期:2020-10-02
  • Predicting protein subchloroplast locations: the 10th anniversary
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-10-02
    Jian Sun, Pu-Feng Du

    Chloroplast is a type of subcellular organelle in green plants and algae. It is the main subcellular organelle for conducting photosynthetic process. The proteins, which localize within the chloroplast, are responsible for the photosynthetic process at molecular level. The chloroplast can be further divided into several compartments. Proteins in different compartments are related to different steps

    更新日期:2020-10-02
  • On designing an unaided authentication service with threat detection and leakage control for defeating opportunistic adversaries
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-10-02
    Nilesh Chakraborty, Samrat Mondal

    Unaided authentication services provide the flexibility to login without being dependent on any additional device. The power of recording attack resilient unaided authentication services (RARUAS) is undeniable as, in some aspects, they are even capable of offering better security than the biometric based authentication systems. However, high login complexity of these RARUAS makes them far from usable

    更新日期:2020-10-02
  • Ethereum smart contract security research: survey and future research opportunities
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-10-02
    Zeli Wang, Hai Jin, Weiqi Dai, Kim-Kwang Raymond Choo, Deqing Zou

    Blockchain has recently emerged as a research trend, with potential applications in a broad range of industries and context. One particular successful Blockchain technology is smart contract, which is widely used in commercial settings (e.g., high value financial transactions). This, however, has security implications due to the potential to financially benefit from a security incident (e.g., identification

    更新日期:2020-10-02
  • Evaluating the usage of fault localization in automated program repair: an empirical study
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Deheng Yang, Yuhua Qi, Xiaoguang Mao, Yan Lei

    Fault localization techniques are originally proposed to assist in manual debugging by generally producing a rank list of suspicious locations. With the increasing popularity of automated program repair, the fault localization techniques have been introduced to effectively reduce the search space of automated program repair. Unlike developers who mainly focus on the rank information, current automated

    更新日期:2020-09-29
  • Mathematical model and simulated annealing algorithm for Chinese high school timetabling problems under the new curriculum innovation
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Xingxing Hao, Jing Liu, Yutong Zhang, Gustaph Sanga

    As the first attempt, this paper proposes a model for the Chinese high school timetabling problems (CHSTPs) under the new curriculum innovation which was launched in 2014 by the Chinese government. According to the new curriculum innovation, students in high school can choose subjects that they are interested in instead of being forced to select one of the two study directions, namely, Science and

    更新日期:2020-09-29
  • A survey of density based clustering algorithms
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Panthadeep Bhattacharjee, Pinaki Mitra

    Density based clustering algorithms (DBCLAs) rely on the notion of density to identify clusters of arbitrary shapes, sizes with varying densities. Existing surveys on DBCLAs cover only a selected set of algorithms. These surveys fail to provide an extensive information about a variety of DBCLAs proposed till date including a taxonomy of the algorithms. In this paper we present a comprehensive survey

    更新日期:2020-09-29
  • Determining node duty cycle using Q-learning and linear regression for WSN
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Han Yao Huang, Kyung Tae Kim, Hee Yong Youn

    Wireless sensor network (WSN) is effective for monitoring the target environment, which consists of a large number of sensor nodes of limited energy. An efficient medium access control (MAC) protocol is thus imperative to maximize the energy efficiency and performance of WSN. The most existing MAC protocols are based on the scheduling of sleep and active period of the nodes, and do not consider the

    更新日期:2020-09-29
  • Entity set expansion in knowledge graph: a heterogeneous information network perspective
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Chuan Shi, Jiayu Ding, Xiaohuan Cao, Linmei Hu, Bin Wu, Xiaoli Li

    Entity set expansion (ESE) aims to expand an entity seed set to obtain more entities which have common properties. ESE is important for many applications such as dictionary construction and query suggestion. Traditional ESE methods relied heavily on the text and Web information of entities. Recently, some ESE methods employed knowledge graphs (KGs) to extend entities. However, they failed to effectively

    更新日期:2020-09-29
  • A framework based on sparse representation model for time series prediction in smart city
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Zhiyong Yu, Xiangping Zheng, Fangwan Huang, Wenzhong Guo, Lin Sun, Zhiwen Yu

    Smart city driven by Big Data and Internet of Things (IoT) has become a most promising trend of the future. As one important function of smart city, event alert based on time series prediction is faced with the challenge of how to extract and represent discriminative features of sensing knowledge from the massive sequential data generated by IoT devices. In this paper, a framework based on sparse representation

    更新日期:2020-09-29
  • Fingerprint matching, spoof and liveness detection: classification and literature review
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Syed Farooq Ali, Muhammad Aamir Khan, Ahmed Sohail Aslam

    Fingerprint matching, spoof mitigation and liveness detection are the trendiest biometric techniques, mostly because of their stability through life, uniqueness and their least risk of invasion. In recent decade, several techniques are presented to address these challenges over well-known data-sets. This study provides a comprehensive review on the fingerprint algorithms and techniques which have been

    更新日期:2020-09-29
  • Biologically inspired visual computing: the state of the art
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Wangli Hao, Ian Max Andolina, Wei Wang, Zhaoxiang Zhang

    Visual information is highly advantageous for the evolutionary success of almost all animals. This information is likewise critical for many computing tasks, and visual computing has achieved tremendous successes in numerous applications over the last 60 years or so. In that time, the development of visual computing has moved forwards with inspiration from biological mechanisms many times. In particular

    更新日期:2020-09-29
  • Where to go? Predicting next location in IoT environment
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Hao Lin, Guannan Liu, Fengzhi Li, Yuan Zuo

    Next location prediction has aroused great interests in the era of internet of things (IoT). With the ubiquitous deployment of sensor devices, e.g., GPS and Wi-Fi, IoT environment offers new opportunities for proactively analyzing human mobility patterns and predicting user’s future visit in low cost, no matter outdoor and indoor. In this paper, we consider the problem of next location prediction in

    更新日期:2020-09-29
  • Proactive planning of bandwidth resource using simulation-based what-if predictions for Web services in the cloud
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Jianpeng Hu, Linpeng Huang, Tianqi Sun, Ying Fan, Wenqiang Hu, Hao Zhong

    Resource planning is becoming an increasingly important and timely problem for cloud users. As more Web services are moved to the cloud, minimizing network usage is often a key driver of cost control. Most existing approaches focus on resources such as CPU, memory, and disk I/O. In particular, CPU receives the most attention from researchers, but the bandwidth is somehow neglected. It is challenging

    更新日期:2020-09-29
  • Adversarial network embedding using structural similarity
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Zihan Zhou, Yu Gu, Ge Yu

    Network embedding which aims to embed a given network into a low-dimensional vector space has been proved effective in various network analysis and mining tasks such as node classification, link prediction and network visualization. The emerging network embedding methods have shifted of emphasis in utilizing mature deep learning models. The neural-network based network embedding has become a mainstream

    更新日期:2020-09-29
  • Information retrieval: a view from the Chinese IR community
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Zhumin Chen, Xueqi Cheng, Shoubin Dong, Zhicheng Dou, Jiafeng Guo, Xuanjing Huang, Yanyan Lan, Chenliang Li, Ru Li, Tie-Yan Liu, Yiqun Liu, Jun Ma, Bing Qin, Mingwen Wang, Jirong Wen, Jun Xu, Min Zhang, Peng Zhang, Qi Zhang

    During a two-day strategic workshop in February 2018, 22 information retrieval researchers met to discuss the future challenges and opportunities within the field. The outcome is a list of potential research directions, project ideas, and challenges. This report describes the major conclusions we have obtained during the workshop. A key result is that we need to open our mind to embrace a broader IR

    更新日期:2020-09-29
  • k -dominant Skyline query algorithm for dynamic datasets
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-09-29
    Zhiyun Zheng, Ke Ruan, Mengyao Yu, Xingjin Zhang, Ning Wang, Dun Li

    At present, most k-dominant Skyline query algorithms are oriented to static datasets, this paper proposes a k-dominant Skyline query algorithm for dynamic datasets. The algorithm is recursive circularly. First, we compute the dominant ability of each object and sort objects in descending order by dominant ability. Then, we maintain an inverted index of the dominant index by k-dominant Skyline point

    更新日期:2020-09-29
  • Pointwise manifold regularization for semi-supervised learning
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-08-13
    Yunyun Wang; Jiao Han; Yating Shen; Hui Xue

    Manifold regularization (MR) provides a powerful framework for semi-supervised classification using both the labeled and unlabeled data. It constrains that similar instances over the manifold graph should share similar classification outputs according to the manifold assumption. It is easily noted that MR is built on the pairwise smoothness over the manifold graph, i.e., the smoothness constraint is

    更新日期:2020-08-13
  • Improving neural sentence alignment with word translation
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-08-13
    Ying Ding; Junhui Li; Zhengxian Gong; Guodong Zhou

    Sentence alignment is a basic task in natural language processing which aims to extract high-quality parallel sentences automatically. Motivated by the observation that aligned sentence pairs contain a larger number of aligned words than unaligned ones, we treat word translation as one of the most useful external knowledge. In this paper, we show how to explicitly integrate word translation into neural

    更新日期:2020-08-13
  • SSDBA: the stretch shrink distance based algorithm for link prediction in social networks
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-08-13
    Ruidong Yan; Yi Li; Deying Li; Weili Wu; Yongcai Wang

    In the field of social network analysis, Link Prediction is one of the hottest topics which has been attracted attentions in academia and industry. So far, literatures for solving link prediction can be roughly divided into two categories: similarity-based and learning-based methods. The learning-based methods have higher accuracy, but their time complexities are too high for complex networks. However

    更新日期:2020-08-13
  • A post-processing method for true random number generators based on hyperchaos with applications in audio-based generators
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-07-11
    Je Sen Teh; Weijian Teng; Azman Samsudin; Jiageng Chen

    True random number generators (TRNG) are important counterparts to pseudorandom number generators (PRNG), especially for high security applications such as cryptography. They produce unpredictable, non-repeatable random sequences. However, most TRNGs require specialized hardware to extract entropy from physical phenomena and tend to be slower than PRNGs. These generators usually require post-processing

    更新日期:2020-07-11
  • Text-enhanced network representation learning
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-07-11
    Yu Zhu; Zhonglin Ye; Haixing Zhao; Ke Zhang

    Network representation learning called NRL for short aims at embedding various networks into low-dimensional continuous distributed vector spaces. Most existing representation learning methods focus on learning representations purely based on the network topology, i.e., the linkage relationships between network nodes, but the nodes in lots of networks may contain rich text features, which are beneficial

    更新日期:2020-07-11
  • PopFlow: a novel flow management scheme for SDN switch of multiple flow tables based on flow popularity
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-07-11
    Cheng Wang; Kyung Tae Kim; Hee Yong Youn

    Pipeline processing is applied to multiple flow tables (MFT) in the switch of software-defined network (SDN) to increase the throughput of the flows. However, the processing time of each flow increases as the size or number of flow tables gets larger. In this paper we propose a novel approach called PopFlow where a table keeping popular flow entries is located up front in the pipeline, and an express

    更新日期:2020-07-11
  • Properties of the satisfiability threshold of the strictly d -regular random (3,2 s )-SAT problem
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-07-11
    Yongping Wang; Daoyun Xu

    A k-CNF (conjunctive normal form) formula is a regular (k, s)-CNF one if every variable occurs s times in the formula, where k ⩾ 2 and s > 0 are integers. Regular (3, s)-CNF formulas have some good structural properties, so carrying out a probability analysis of the structure for random formulas of this type is easier than conducting such an analysis for random 3-CNF formulas. Some subclasses of the

    更新日期:2020-07-11
  • Estimating posterior inference quality of the relational infinite latent feature model for overlapping community detection
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-07-11
    Qianchen Yu; Zhiwen Yu; Zhu Wang; Xiaofeng Wang; Yongzhi Wang

    Overlapping community detection has become a very hot research topic in recent decades, and a plethora of methods have been proposed. But, a common challenge in many existing overlapping community detection approaches is that the number of communities K must be predefined manually. We propose a flexible nonparametric Bayesian generative model for count-value networks, which can allow K to increase

    更新日期:2020-07-11
  • A computer aided design method for car form and its application based on shape parameters
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-07-11
    Fan Liu; Xiaomin Ji; Gang Hu; Jing Gao

    In the early design stage, automotive modeling should both meet the requirements of aesthetics and engineering. Therefore, a vehicle CAD (computer aided design) model that can be easily adjusted by feedbacks is necessary. Based on CE-Bézier surface, this paper presents a set of algorithms for parametric segmentation and fairing surface generation in a car model. This model is defined by a simplified

    更新日期:2020-07-11
  • PSO-ACSC: a large-scale evolutionary algorithm for image matting
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-05-06
    Yihui Liang; Han Huang; Zhaoquan Cai

    Image matting is an essential image processing technology due to its wide range of applications. Sampling-based image matting is one of the main branches of image matting research that estimates alpha mattes by selecting the best pixel pairs. It is essentially a large-scale multi-peak optimization problem of pixel pairs. Previous study shows that particle swarm optimization (PSO) can effectively optimize

    更新日期:2020-05-06
  • Matching user identities across social networks with limited profile data
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-04-19
    Ildar Nurgaliev; Qiang Qu; Seyed Mojtaba Hosseini Bamakan; Muhammad Muzammal

    Privacy preservation is a primary concern in social networks which employ a variety of privacy preservations mechanisms to preserve and protect sensitive user information including age, location, education, interests, and others. The task of matching user identities across different social networks is considered a challenging task. In this work, we propose an algorithm to reveal user identities as

    更新日期:2020-04-19
  • A behavior-aware SLA-based framework for guaranteeing the security conformance of cloud service
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-04-19
    Xiaochen Liu; Chunhe Xia; Tianbo Wang; Li Zhong; Xiaojian Li

    As cloud computing technology turning to mature, cloud services have become a trust-based service. Users’ distrust of the security and performance of cloud services will hinder the rapid deployment and development of cloud services. So cloud service providers (CSPs) urgently need a way to prove that the infrastructure and the behavior of cloud services they provided can be trusted. The challenge here

    更新日期:2020-04-19
  • Guaranteeing the response deadline for general aggregation trees
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-04-19
    Jiangfan Li; Chendie Yao; Junxu Xia; Deke Guo

    It is essential to provide responses to queries within time deadlines, even if not exact and complete. To reduce the query latency, systems usually partition large-scale data computations as a series of tasks over many processes and aggregate them to reduce the response time by using aggregation trees. An obstacle is that the involved processes of a query usually differ in their speeds, thus not all

    更新日期:2020-04-19
  • Solving quantified constraint satisfaction problems with value selection rules
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-03-16
    Jian Gao; Jinyan Wang; Kuixian Wu; Rong Chen

    Solving a quantified constraint satisfaction problem (QCSP) is usually a hard task due to its computational complexity. Exact algorithms play an important role in solving this problem, among which backtrack algorithms are effective. In a backtrack algorithm, an important step is assigning a variable by a chosen value when exploiting a branch, and thus a good value selection rule may speed up greatly

    更新日期:2020-03-16
  • Event detection and evolution in multi-lingual social streams
    Front. Comput. Sci. (IF 1.275) Pub Date : 2020-03-16
    Yaopeng Liu; Hao Peng; Jianxin Li; Yangqiu Song; Xiong Li

    Real-life events are emerging and evolving in social and news streams. Recent methods have succeeded in capturing designed features of monolingual events, but lack of interpretability and multi-lingual considerations. To this end, we propose a multi-lingual event mining model, namely MLEM, to automatically detect events and generate evolution graph in multilingual hybrid-length text streams including

    更新日期:2020-03-16
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
微生物研究
虚拟特刊
亚洲大洋洲地球科学
NPJ欢迎投稿
自然科研论文编辑
ERIS期刊投稿
欢迎阅读创刊号
自然职场,为您触达千万科研人才
spring&清华大学出版社
城市可持续发展前沿研究专辑
Springer 纳米技术权威期刊征稿
全球视野覆盖
施普林格·自然新
chemistry
物理学研究前沿热点精选期刊推荐
自然职位线上招聘会
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
阿拉丁试剂right
上海中医药大学
浙江大学
西湖大学
化学所
北京大学
山东大学
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
南方科技大学
南开大学
浙江大学
天合科研
x-mol收录
试剂库存
down
wechat
bug