|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Strongly connected components based efficient computation of page rank显示文摘In this paper,an efficient page rank (PR)exact algorithm is proposed,which can improve the computation efficiency without sacrificing results accuracy.The existing exact algorithms are generally based on the original power method (PM).In order to reduce the number of I/Os required to improve efficiency,they partition the big graph into multiple smaller ones that can be totally fitted in memory.The algorithm proposed in this paper can further reduce the required number of I/Os.Instead of partitioning the graph into the general subgraphs,our algorithm partitions graph into a special kind of subgraphs:SCCs (strongly connected components), the nodes in which are reachable to each other.By exploiting the property of SCC,some theories are proposed,based on which the computation iterations can be constrained on these SCC subgraphs.Our algorithm can reduce lots of I/Os and save a large amount of computations,as well as keeping the results accuracy.In a word,our algorithm is more efficient among the existing exact algorithms.The experiments demonstrate that the algorithms proposed in this paper can make an obvious efficiency improvement and can attain high accurate results. | Hongguo YANG Derong SHEN Yue KOU Tiezheng NIE Ge YU | 2018 | Frontiers of Computer Science2018，12，6： | 2 |
| 2 | An Efficient Multi-Keyword Query Processing Strategy on P2P Based Web Search显示文摘The paper presents a novel benefit based query proc- essing strategy for efficient query routing. Based on DHT as the overlay network, it first applies Nash equilibrium to construct the optimal peer group based on the correlations of keywords and coverage and overlap of the peers to decrease the time cost, and then presents a two-layered architecture for query processing that utilizes Bloom filter as compact representation to reduce the bandwidth consumption. Extensive experiments conducted on a real world dataset have demonstrated that our approach obviously decreases the processing time, while improves the precision and recall as well. | SHEN Derong LI Meifang ZHU Hongkai YU Ge | 2007 | Wuhan University Journal of Natural Sciences2007，12，5： | 2 |
| 3 | Data Integration Strategy for Database Grids Based on P2P Framework显示文摘The differences between the data integration of a dynamic database grid (DBG) and that of a distributed database system are analyzed, and three kinds of data integration strategies are given on the background of DBG based on Peer to Peer (P2P) framework, including the centralized data integration (CDI) strategy, the distributed data integration (DDI) strategy and the filter-based data integration (FDDI) strategy. CDI calls all the database grid services (DGSs) at a single node, DDI disperses the DGSs to multiple nodes, while FDDI schedules the data integration nodes based on filtering | WANG Guangqi SHEN Derong YU Ge ZHOU Wensheng LI Meifang | 2006 | Wuhan University Journal of Natural Sciences2006，11，5： | 1 |
| 4 | Discovering context-aware conditional functional dependencies显示文摘有条件的功能的相关性(CFD ) 是为数据一致性的重要技术。然而, CFD 被限制到 1 ) 为一致性修理提供合理价值并且 2 ) 检测潜在的错误。这篇论文论述贡献的上下文知道的有条件的功能的相关性(CCFD ) 提供合理价值并且检测潜在的错误。特别,我们集中于自动地发现最小的 CCFD。在这篇论文,我们测量 CFD 的关系的现在的上下文相关性。相关 CFD 的重叠能提供导致修理的更多的精确性一致性的合理价值,并且一些相关 CFD 被合为 CCFDs.Moreover,我们证明发现最小的 CCFD 是 NP 完全的,我们设计精确方法和启发式的方法。我们也介绍统治价值在精确方法和启发式的方法便于这个过程。另外, CFD 的上下文相关性影响清洗结果。我们将为建议根据数据分发给上下文相关性的近似阀值。修理结果是 approvedmore 精确性,甚至由我们的实验评估证实了。 | Yuefeng DU Derong SHEN Tiezheng NIE Yue KOU Ge YU | 2017 | Frontiers of Computer Science2017，11，4： | 1 |
| 5 | An effective Web services discovery strategy for Web services composition显示文摘 | Shen Derong Yu Ge | 2005 | Computer and information technology2005，，： | 1 |
| 6 | A genetic algorithm based entity resolution approach with active learning显示文摘 | Chenchen SUN Derong SHEN Yue KOU Tiezheng NIE Ge YU | 2017 | Frontiers of Computer Science2017，11，1： | 1 |
| 7 | Diketopyrrolopyrrole based D-π-A-π-D type small organic molecules as hole transporting materials for perovskite solar cells显示文摘Three novel diketopyrrolopyrrole(DPP) based small organic molecules were synthesized as hole transporting materials for perovskite solar cells. The effects of different donors and π bridges on the performance of perovskite solar cells(PSCs) were discussed. The efficiency of TPADPP-1, TPADPP-2, PTZDPP-2 was 5.10%, 9.85% and 8.16% respectively. Compared to TPADPP-2, the voltage of PTZDPP-2 was higher. Because the electron-donating ability of phenothiazine based donor was larger than that of triphenylamine based donor, the HOMO level of PTZDPP-2 was lower than that of TPADPP-2. The results indicated that the diketopyrrolopyrrole based D-π-A-π-D type small organic molecule might be a promising hole transporting material in the perovskite solar cells. | Haoliang Cheng Xiaojuan Zhao Yan Shen Mingkui Wang Lingyun Wang Herbert Meier Derong Cao | 2018 | Journal of Energy Chemistry2018，27，4： | 1 |
| 8 | Extracting Result Schema Based on Query Instances in the Deep Web显示文摘Deep Web sources contain a large of high-quality and query-related structured date. One of the challenges in the Deep Web is extracting result schemas of Deep Web sources. To ad-dress this challenge,this paper describes a novel approach that extracts both result data and the result schema of a Web database. The approach first models the query interface of a Deep Web source and fills in it with a specifically query instance. Then the result pages of the Deep Web sources are formatted in the tree structure to retrieve subtrees that contain elements of the query instance. Next,result schema of the Deep Web source is extracted by matching the subtree' nodes with the query instance,in which,a two-phase schema extraction method is adopted for obtaining more accurate result schema. Finally,experiments on real Deep Web sources show the utility of our approach,which provides a high precision and recall. | NIE Tiezheng YU Ge SHEN Derong KOU Yue LIU Wei | 2007 | Wuhan University Journal of Natural Sciences2007，12，5： | 1 |
| 9 | Efficient private multi-party numerical records matching显示文摘1 Introduction and main contributions Private entity matching(PEM)[1]is to find records from two or more data sources that refer to the same or similar individuals,without revealing other information besides the matched records.There have been numerous work done for PEM. | Shumin Han Derong Shen Tiezheng Nie Yue Kou Ge Yu | 2020 | Frontiers of Computer Science2020，14，5： | 0 |
| 10 | Information networks fusion based on multi-task coordination显示文摘Information networks provide a powerful representation of entities and the relationships between them.Information networks fusion is a technique for information fusion that jointly reasons about entities,links and relations in the presence of various sources.However,existing methods for information networks fusion tend to rely on a single task which might not get enough evidence for reasoning.In order to solve this issue,in this paper,we present a novel model called MC-INFM(information networks fusion model based on multi-task coordination).Different from traditional models,MC-INFM casts the fusion problem as a probabilistic inference problem,and collectively performs multiple tasks(including entity resolution,link prediction and relation matching)to infer the final result of fusion.First,we define the intra-features and the inter-features respectively and model them as factor graphs,which can provide abundant evidence to infer.Then,we use conditional random field(CRF)to learn the weight of each feature and infer the results of these tasks simultaneously by performing the maximum probabilistic inference.Experiments demonstrate the effectiveness of our proposed model. | Dong LI Derong SHEN Yue KOU Tiezheng NIE | 2021 | Frontiers of Computer Science2021，15，4： | 0 |
| 11 | An integrated pipeline model for biomedical entity alignment显示文摘Biomedical entity alignment,composed of two subtasks: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 construc-tion.Previous works made many efforts on feature engineering to employ feature-based models for entity identification and alignment.However,the models depended on subjective feature selection may suffer error propagation and are not able to uti-lize the hidden information.With rapid development in health-related research,researchers need an effective method to explore the large amount of available biomedical literatures.Therefore,we propose a two-stage entity alignment process,biomedical entity exploring model,to identify biomedical entities and align them to the knowledge base interactively.The model aims to automatically obtain semantic information for extracting biomedical entities and mining semantic relations through the standard biomedical knowledge base.The experiments show that the proposed method achieves better performance on entity alignment.The proposed model dramatically improves the FI scores of the task by about 4.5%in entity identification and 2.5%in entity-concept mapping. | Yu HU Tiezheng NIE Derong SHEN Yue KOU Ge YU | 2021 | Frontiers of Computer Science2021，15，3： | 0 |
| 12 | Biomedical entity linking based on less labeled data显示文摘1 Introduction Biomedical entity linking aims to align the natural language entity to the knowledge base concept referring to the same real-world object.Recent solutions in the biomedical field focus on the embedding-based method to jointly model the texts and the knowledge graph into a multi-dimensional entity space.However,the task of a biomedical entity linking is still facing tough challenges:1)The ambiguity of natural language descriptions,including polysemy and abbreviation. | Yu HU Derong SHEN Tiezheng NIE Yue KOU Ge YU | 2022 | Frontiers of Computer Science2022，16，3： | 0 |
| 13 | High-yielding Fertilization Technology for Citrus grandis显示文摘As of April 2017,the planting area of Citrus grandis in Ruili City was 594. 3 ha. Among it,the area of fruiting trees was 267. 2 ha,and they were mainly owned by small growers. In view of the serious fragmentation of pomelos,the large investment in fertilizers,and the unsatisfactory production efficiency of C. grandis in Ruili,the fertilization technology for C. grandis was discussed. The problems in the fertilization process,as well as the principles and modes of fertilization were analyzed briefly. The fertilization methods for saplings and fruiting trees were introduced,in order to promote the improvement of the fertilization and management level of local pomelo growers. | Derong YANG Ming SHEN Zhiwei ZENG Long ZHOU | 2019 | Asian Agricultural Research2019，11，4： | 0 |
| 14 | iHDFS: A Distributed File System Supporting Incremental Computing显示文摘Big data are always processed repeatedly with small changes, which is a major form of big data processing. The feature of incremental change of big data shows that incremental computing mode can improve the performance greatly. HDFS is a distributed file system on Hadoop which is the most popular platform for big data analytics. And HDFS adopts fixed-size chunking policy, which is inefficient facing incremental computing. Therefore, in this paper, we proposed iHDFS (incremental HDFS), a distributed file system, which can provide basic guarantee for big data parallel processing. The iHDFS is implemented as an extension to HDFS. In iHDFS, Rabin fingerprint algorithm is applied to achieve content defined chunking. This policy make data chunking has much higher stability, and the intermediate processing results can be reused efficiently, so the performance of incremental data processing can be improved significantly. The effectiveness and efficiency of iHDFS have been demonstrated by the experimental results. | Zhenhua Wang Qingsong Ding Fuxiang Gao Derong Shen Ge Yu | 2015 | 国际计算机前沿大会会议论文集2015，，1： | 0 |
| 15 | HPPQ: A Parallel Package Queries Processing Approach for Large-Scale Data显示文摘A lot of scholars have focused on developing effective techniques for package queries, and a lot of excellent approaches have been proposed. Unfortunately, most of the existing methods focus on a small volume of data. The rapid increase in data volume means that traditional methods of package queries find it difficult to meet the increasing requirements. To solve this problem, a novel optimization method of package queries(HPPQ) is proposed in this paper. First, the data is preprocessed into regions. Data preprocessing segments the dataset into multiple subsets and the centroid of the subsets is used for package queries, this effectively reduces the volume of candidate results. Furthermore, an efficient heuristic algorithm is proposed(namely IPOL-HS) based on the preprocessing results. This improves the quality of the candidate results in the iterative stage and improves the convergence rate of the heuristic algorithm. Finally, a strategy called HPR is proposed, which relies on a greedy algorithm and parallel processing to accelerate the rate of query. The experimental results show that our method can significantly reduce time consumption compared with existing methods. | Meihui Shi Derong Shen Tiezheng Nie Yue Kou Ge Yu | 2018 | Big Data Mining and Analytics2018，1，2： | 0 |
| 16 | KDS-CM:A Cache Mechanism Based on Top-K Data Source for Deep Web Query显示文摘Caching is an important technique to enhance the effi-ciency of query processing. Unfortunately,traditional caching mechanisms are not efficient for deep Web because of storage space and dynamic maintenance limitations. In this paper,we present on providing a cache mechanism based on Top-K data source(KDS-CM) instead of result records for deep Web query. By integrating techniques from IR and Top-K,a data reorganiza-tion strategy is presented to model KDS-CM. Also some measures about cache management and optimization are proposed to im-prove the performances of cache effectively. Experimental results show the benefits of KDS-CM in execution cost and dynamic maintenance when compared with various alternate strategies. | KOU Yue SHEN Derong YU Ge LI Dong NIE Tiezheng | 2007 | Wuhan University Journal of Natural Sciences2007，12，5： | 0 |
| 17 | Key Points of Ridge Cultivation of Lane Late Navel Orange显示文摘Ridge cultivation can effectively enhance soil permeability,promote root development and improve fruit quality. Based on the characteristics of Lane Late navel orange,this paper summarizes the technical points related to ridge cultivation and compares the effects of ridge cultivation and conventional cultivation on the growth,so as to provide guidance for better production practices. | Zhiwei ZENG Ronghai YANG Long ZHOU Ming SHEN Jianhai YANG Qingxiong YANG Jixu FAN Derong YANG | 2019 | Asian Agricultural Research2019，11，5： | 0 |
| 18 | Disk based pay-as-you-go record linkage显示文摘1Introduction Record linkage(RL)groups_records corresponding to the same entities in datasets,and is a long-standing topic in data management and mining communities[1-2].In big data era,real-time data applications become popular,and callfor payas-you-go RL(PRL),which produces as many match pairs as possible in very limited time(much shorter than the overall RLruntime). | Chenchen Sun Derong Shen | 2022 | Frontiers of Computer Science2022，16，4： | 0 |
| 19 | Research Progress of Gene Polymorphism of Guizhou Black Goat显示文摘Guizhou black goat is the second-largest breed of goat in Guizhou,an important part of ecosystem of karst region. Constructing cladogram of black goat and Guizhou local goat with molecular biological technique,we found some functional genes related to reproduction and growth of black goat,such as FSHR,LHβ,GDF9,MSTN,POU1F1,GFI1 B,etc. In view of the genetic relations between Guizhou black goat and other local goats,we reviewed the research status and progress of gene polymorphism of FSHR,LHβ,GDF9,MSTN,POU1F1,GFI1 B,and prospected the research field of molecular properties of the breed resource. | Song Derong Wang Qiwen Shen Xiaoyun Zhou Darong Peng Hua Yang Siwei | 2015 | Animal Husbandry and Feed Science2015，7，2： | 0 |
| 20 | SAMES: deadline-constraint scheduling in MapReduce显示文摘 | Xite WANG Derong SHEN Mei BAI Tiezheng NIE Yue KOU Ge YU | 2015 | Frontiers of Computer Science2015，9，1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员