检索结果-内蒙古大学图书馆

2023 IEEE International Conference on Web services, ICWS 2023

作者： Wang, Puwei Sun, Zhouxing Li, Rui Chen, Jinchuan Gong, Ping Du, Xiaoyong Renmin University of China School of Information China Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China Renmin University of China School of Mathematics China Fujian Normal University College of Computer and Cyber Security China

ISBN: (纸本)9798350304855

Blockchain technologies pave a promising way for implementing the inter-organizational processes. Most of the current research works translate the execution logic in the process models into the smart contracts, which can run independently on the blockchain without the outside process engine. However, the works usually suffer from the execution and storage costs, since the translation needs to be done when the processes are deployed. In this paper, we customize a process engine for executing the inter-organizational business processes via a blockchain-style procedure, i.e., checking the validity of transactions, adding the valid transactions into the blockchain through the consensus mechanism, and then updating the process states according to the committed transactions. And then, we build a blockchain system by embedding the customized process engine into the blockchain nodes. Moreover, in order to realize the interactions between the inter-organizational processes running on blockchain and the services outside blockchain, we propose a blockchain-based approach for service registration, binding and invocation, and design a lease-based concurrency control protocol to logically isolate transactions from each other when invoking the services simultaneously. Finally, we implement a prototype system based on a permissioned blockchain platform Hyperledger Fabric and a process engine Activiti. The experimental results show the proposed blockchain system can execute the inter-organizational processes correctly and efficiently. © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Towards Video Management over Relational database

Towards Video Management over Relational Database

引用

International Asia-Pacific Web Conference (APWEB)

作者： Hui Li Xiao Zhang Shan Wang Xiaoyong Du School of Information Key Laboratory of Data Engineering and Knowledge Engineering Shanghai Key Laboratory of Intelligent Information Processing MOE Renmin University of China China

Video has become popular in our daily life for both professional and consumer applications. Both low level video processing and high level semantic video analysis are critically computational tasks in application domains. Most of current video computing tools are developed for specific analytic tasks, they are lack higher level interoperability with database and treat database merely as a relational data storage engine rather than an analytic platform, which causes inefficient data access and massive amount of data movement. In this paper, we study how to support video data management over relational database, and present our initial solutions of video data storage mechanism, video data access method and efficient video analytics. We also illustrate our ongoing prototype system HybVideo that developed in a novel architecture. It integrates above solutions to tackle the major challenges of providing a platform for both storage and analysis of video data.

关键词： Relational databases Memory Videoconference Laboratories Engines data analysis Performance analysis Video surveillance Conference management knowledge management

来源：评论

学校读者我要写书评

暂无评论

Review of graph construction and graph learning in stock price prediction 9th

Review of graph construction and graph learning in stock pri...

引用

9th International Conference on Information Technology and Quantitative Management, ITQM 2022

作者： Wang, Yunong Qu, Yi Chen, Zhensong Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Management and Engineering Capital University of Economics and Business Beijing100070 China

Precise prediction of stock prices leads to more profits and more effective risk prevention, which is of great significance to both investors and regulators. Recent years, various kinds of information not directly-relevant with stock prices have received more attention, such as texts, images or connections. These external information has the potential of reflecting or influencing fluctuations, and thus, given the utilization of advanced analyzing techniques, the forecasting performance of stock prices could be promoted substantially. For instance, graph neural network models have expanded into many other disciplines including stock price prediction, and exhibited impressive representation learning ability. However, in stock markets, well-defined graphs are rarely seen and how to formulate the graph structures needed remains a challenging problem. Towards this end, this article presents a comprehensive overview of graph construction and graph learning in stock price prediction, by reviewing the existing studies, summarizing its general paradigm, special cases and proposing possible prospects. Our research not only systematically reveals the feasible ways of constructing graphs in financial markets, but also provides insights for further implementations of graph learning models into stock prediction tasks. © 2022 The Authors. Published by Elsevier B.V.

关键词： Financial markets

来源：评论

学校读者我要写书评

暂无评论

Context-Aware Semantic Type Identification for Relational Attributes

引用

Journal of Computer Science & Technology 2023年第4期38卷 927-946页

作者：丁玥郭雨荷卢卫李海翔张美慧李晖潘安群杜小勇 Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of China Beijing 100872China School of Information Renmin University of ChinaBeijing 100872China Tencent(Beijing)Technology Company Limited Beijing 100080China School of Computer Science and Technology Beijing Institute of TechnologyBeijing 100081China College of Computer Science and Technology Guizhou UniversityGuiyang 550025China Tencent(Shenzhen)Technology Company Limited Shenzhen 518057China

Identifying semantic types for attributes in relations,known as attribute semantic type(AST)identification,plays an important role in many data analysis tasks,such as data cleaning,schema matching,and keyword search in ***,due to a lack of unified naming standards across prevalent information systems(*** islands),AST identification still remains as an open *** tackle this problem,we propose a context-aware method to figure out the ASTs for relations in this *** transform the AST identification into a multi-class classification problem and propose a schema context aware(SCA)model to learn the representation from a collection of relations associated with attribute values and schema *** on the learned representation,we predict the AST for a given attribute from an underlying relation,wherein the predicted AST is mapped to one of the labeled *** improve the performance for AST identification,especially for the case that the predicted semantic types of attributes are not included in the labeled ASTs,we then introduce knowledge base embeddings(***)to enhance the above representation and construct a schema context aware model with knowledge base enhanced(SCA-KB)to get a stable and robust *** experiments based on real datasets demonstrate that our context-aware method outperforms the state-of-the-art approaches by a large margin,up to 6.14%and 25.17%in terms of macro average F1 score,and up to 0.28%and 9.56%in terms of weighted F1 score over high-quality and low-quality datasets respectively.

关键词： attribute semantic type(AST)identification context-aware semantic embedding knowledge base embedding

来源：评论

学校读者我要写书评

暂无评论

Efficient approximation of the maximal preference scores by lightweight cubic views

Efficient approximation of the maximal preference scores by ...

引用

15th International Conference on Extending database Technology, EDBT 2012

作者： Chen, Yueguo Cui, Bin Du, Xiaoyong Tung, Anthony K. H. Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China Department of Computer Science Peking University Beijing China School of Information Renmin University of China Beijing China School of Computing National University of Singapore Singapore Singapore

ISBN: (纸本)9781450307901

Given a multi-features data set, a best preference query (BPQ) computes the maximal preference score (MPS) that the tuples in the data set can achieve with respect to a preference function. BPQs are very useful in applications where users want to efficiently check whether many individual data sets contain tuples that are of interest to them. Although a BPQ can be naïvely answered by issuing a top-1 query and computing the score from the returned tuple, doing so might require to load a larger number of tuples externally. In this paper, we address the problem of efficient processing BPQs by using lightweight cubic (3-dimensional) views. With these in-memory views, the MPSs of BPQs can be efficiently estimated with an error bound guaranteed, by paying only a small number of I/Os. Extensive experimental results over real-life data sets show that our approximate solution can achieve the efficiency of up to three orders of magnitude compared to exact solutions, with certain accuracy guaranteed. © 2012 ACM.

关键词： best preference score materialized views preference query top-k query

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of Computer Science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

Research Progress of CDT 19

Research Progress of CDT

引用

Proceedings of the 2019 8th International Conference on Bioinformatics and Biomedical Science

作者： Gao Yuting Shen Shutong Deng Sanhong School of Information Management Nanjing University China School of Information Management Nanjing University China Key Laboratory of Data Engineering and Knowledge Services in Jiangsu Province

ISBN: (纸本)9781450372510

With the high mortality rate for the cases of malignant tumors, the discovery and early treatment of cancer is critical to improving the 5-year survival rate of cancer. The biggest challenge in control and prevention is how to detect tumors as early as possible, so that the most effective means can be used for treatment. With the help of the WOS database, researchers found that liquid biopsy, genetic material/protein expression and computer imaging play an important role in cancer detection. Through analysis of the history and current status of cancer detection technology development, this paper also aims to provide guidance for the clinical practice of current cancer screening and provide inspiration for future technological development.

关键词： Biopharmaceutical engineering Tissue Biopsy Cancer Detection Imaging Technology Tumor Marker Gene Expression

来源：评论

学校读者我要写书评

暂无评论

data science:Trends, perspectives, and prospects

引用

data Science and Informetrics 2022年第3期2卷 1-21页

作者： Chaolemen Borjigin Chen Zhang Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of ChinaBeijingChina Information Resource Management School Renmin University of ChinaBeijingChina

data science is a rapidly growing academic field with significant implications for all conventional scientific studies. However, most relevant studies have been limited to one or several facets of data science from a specific application domain perspective and less to discuss its theoretical framework. data science is unique in that its research goals, perspectives, and body of knowledge are distinct from other sciences. The core theories of data science are the DIKW pyramid, data-intensive scientific discovery, data science life cycle, data wrangling or munging,big data analytics, data management, and governance, data products Dev Ops, and big data visualization. Six main trends characterize the recent theoretical studies on data science are:(1)the growing significance of data Ops,(2) the rise of citizen data scientists,(3) enabling augmented data science,(4) integrating data warehouse with data lake,(5) diversity of domain-specific data science, and(6) implementing data stories as data products. Further development of data science should prioritize four ways to turn challenges into opportunities:(1) accelerating theoretical studies of data science,(2) the trade-off between explainability and performance,(3) achieving data ethics, privacy and trust, and(4) aligning academic curricula with industrial needs.

关键词： CCS concepts General and reference Surveys and overviews data science Big data data products data-driven management The DIKW pyramid

来源：评论

学校读者我要写书评

暂无评论

BDLR:lncRNA identification using ensemble learning

引用

BIOCELL 2022年第4期46卷 951-960页

作者： LEJUN GONG SHEHAI ZHOU JINGMEI CHEN YONGMIN LI LI ZHANG ZHIHONG GAO Jiangsu Key Lab of Big Data Security&Intelligent Processing School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing210046China Smart Health Big Data Analysis and Location Services Engineering Laboratory of Jiangsu Province Nanjing210046China Zhejiang Engineering Research Center of Intelligent Medicine Wenzhou325035China College of Computer Science and Technology Nanjing Forestry UniversityNanjing210037China

Long non-coding RNAs(lncRNAs)play an important role in many life activities such as epigenetic material regulation,cell cycle regulation,dosage compensation and cell differentiation regulation,and are associated with many human *** are many limitations in identifying and annotating lncRNAs using traditional biological experimental *** the development of high-throughput sequencing technology,it is of great practical significance to identify the lncRNAs from massive RNA sequence data using machine learning *** on the Bagging method and Decision Tree algorithm in ensemble learning,this paper proposes a method of lncRNAs gene sequence identification called *** identification results of this classification method are compared with the identification results of several models including Byes,Support Vector Machine,Logical Regression,Decision Tree and Random *** experimental results show that the lncRNAs identification method named BDLR proposed in this paper has an accuracy of 86.61%in the human test set and 90.34%in the mouse for lncRNAs,which is more than the identification results of the other ***,the proposed method offers a reference for researchers to identify lncRNAs using the ensemble learning.

关键词： lncRNAs High-throughput sequencing Ensemble learning Bagging Decision Tree

来源：评论

学校读者我要写书评

暂无评论

An ontology automation construction scheme for Chinese e-government thesaurus optimizing

引用

Proceedings of the Association for Information Science and Technology 2020年第1期57卷

作者： Wang, Hao Zhang, Wei Deng, Sanhong Zhang, Baolong School of Information Management Nanjing University Nanjing China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing China

To optimize the term hierarchy in the manual e-government thesaurus, we combine the mainstream knowledge organization technology to form a complete set of ontology automation construction scheme. We build an e-government knowledge base by using subject words in the Comprehensive E-government Thesaurus as the term set and encyclopedia text as the corpus. The specific work includes the extraction of semantic features from the bag-of-words model, determination of the number of clusters by linear and nonlinear dimensionality reduction, division of terms by spectral clustering, social network analysis to determine the class label, and storing knowledge ontology via OWL. The recall rate of term hierarchy in the ontology is excellent, indicating the ontology has good knowledge extensibility, and also proving the efficiency of the scheme proposed in this work. Besides, the application model of a term hierarchy in information retrieval can show a richer semantic relation than the original thesaurus to guide the retrieval extension of government information resources. 83rd Annual Meeting of the Association for Information Science & Technology October 25-29, 2020. Author(s) retain copyright, but ASIS&T receives an exclusive publication license.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：