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

Comparative analysis of alkali-treated natural fibres for improved interfacial adhesion in composite materials

Interactions 2024年第1期245卷 1-13页

作者： Bhagat, Madhuri S. Jadhav, Varsha D. Kulkarni, Sumant Khanderao Satishkumar, P. Saminathan, Rajasekaran Department of Civil Engineering Yeshawantrao Chavan College of Engineering Maharashtra Wanadongari Nagpur India Department of Artificial Intelligence and Data Science Vishwakarma Institute of Information Technology Maharashtra Pune India School of Civil Engineering REVA University Rukmini Knowledge Park Karnataka Kattigenahalli Bengaluru India Department of Mechanical Engineering Rathinam Technical Campus Tamilnadu Coimbatore India Department of Mechanical Engineering College of Engineering and Computer Science Jazan University Jazan Saudi Arabia

Natural fibers such as bamboo, kenaf, flax, ramie and hemp were chemically treated to improve their adherence with hydrophobic matrices. One common chemical process for altering the surface of these natural fibers is alkali treatment (AT). The experiment involves soaking bamboo fibers (BF) in solutions of 1, 10, and 30 wt % sodium hydroxide (NaOH) for one day, half an hour, and twenty minutes at room temperature. These alkali-treated and untreated bamboo fibers was compared with their physical and mechanical qualities. Using scanning electron microscopy (SEM) and the circular fiber assumption, the CSA of bamboo fibers both before and after AT were compared. Improving the AT procedures for BF at room temperature using varying NaOH concentrations is the focus of this effort. Additionally, the tensile characteristics of both untreated and variously treated AT Bamboo fibres are examined using a two-parameter Weibull distribution. Instead of just showing the average tensile strength, probabilistic tensile strength has shown to be a more effective method. This study proves without a reasonable doubt that adding 1 wt % NaOH to bamboo fiber makes natural fiber reinforced composites mechanically better. According to the SEM, the CSA of bamboo fibers decreases by about 13.62–20.24% and about 18.42–22.63%, respectively, after alkali treatment. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2024.

关键词： Tensile strength

来源：评论

学校读者我要写书评

暂无评论

Improving the Cost of Updates in Virtual knowledge Graphs

Improving the Cost of Updates in Virtual Knowledge Graphs

引用

2024 Joint Ontology Workshops - Episode X: The Tukker Zomer of Ontology, and Satellite Events, JOWO 2024

作者： Wandji, Romuald Esdras Calvanese, Diego Department of Computing Science Umeå Universitet Umeå Sweden Research Centre for Knowledge and Data Faculty of Engineering Free University of Bozen-Bolzano Bolzano Italy

Virtual knowledge Graph (VKG) is known as a data integration paradigm used to efficiently manage the heterogeneity of richly structured data that is common inside several organizations, in inter-organizational settings, and more openly on the Web. Although such a paradigm continues to gain importance in both foundational and applied research, updates in VKG systems remain an open challenge that has received less attention. Yet, a solution to such a problem would be of great importance, as it would allow VKG systems to be full-fledged, thus allowing end-users to fully manage source data through the lens of the ontology they are exposed to. This research aims to propose a comprehensive framework for instance-level updates in VKGs, where updates posed over the ontology have to be translated into source-level updates and, more importantly, how the side effects related to the propagation of ontology-based updates to the underlying data source can be minimized. © 2024 Copyright for this paper by its authors.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Short Text Topic Modeling Techniques, Applications, and Performance: A Survey

引用

IEEE Transactions on knowledge and data engineering 2022年第3期34卷 1427-1445页

作者： Qiang, Jipeng Qian, Zhenyu Li, Yun Yuan, Yunhao Wu, Xindong Department of Computer Science Yangzhou University Jiangsu225009 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei Anhui230026 China Mininglamp Academy of Sciences Minininglamp Beijing China

Analyzing short texts infers discriminative and coherent latent topics that is a critical and fundamental task since many real-world applications require semantic understanding of short texts. Traditional long text topic modeling algorithms (e.g., PLSA and LDA) based on word co-occurrences cannot solve this problem very well since only very limited word co-occurrence information is available in short texts. Therefore, short text topic modeling has already attracted much attention from the machine learning research community in recent years, which aims at overcoming the problem of sparseness in short texts. In this survey, we conduct a comprehensive review of various short text topic modeling techniques proposed in the literature. We present three categories of methods based on Dirichlet multinomial mixture, global word co-occurrences, and self-aggregation, with example of representative approaches in each category and analysis of their performance on various tasks. We develop the first comprehensive open-source library, called STTM, for use in Java that integrates all surveyed algorithms within a unified interface, benchmark datasets, to facilitate the expansion of new methods in this research field. Finally, we evaluate these state-of-the-art methods on many real-world datasets and compare their performance against one another and versus long text topic modeling algorithm. © 2020 IEEE.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

A trust model for capability delegation in federated policy systems

A trust model for capability delegation in federated policy ...

引用

6th International Conference on Risks and Security of Internet and Systems, CRiSIS 2011

作者： Feeney, Kevin Foley, Simon N. Brennan, Rob Intelligent Systems Lab Knowledge and Data Engineering Group Trinity College Dublin Ireland FAME Department of Computer Science University College Cork Ireland

ISBN: (纸本)9781457718915

Federated policy systems are required to support the emergent complexity and organizational heterogeneity of modern Internet service delivery. This paper presents a distributed policy management approach which utilizes a flexible, tree-based capability authority model to partition and delegate federated capabilities or services. A trust management model and a delegation logic is defined which supports secure decentralized policy reasoning and addresses performance overheads due to distributed rule evaluation, threats from malformed or malicious federated principals and allows flexibility with respect to delegation chain reduction or capability authority re-partitioning. The system is evaluated through a security analysis and a prototype implementation of a federated policy engineering framework based on this logic is described. This framework is based on public key certificates and an extension to the Keynote Trust Management language. It provides practical management services such as key discovery and certificate revocation in addition to the core capability delegation function. © 2011 IEEE.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Towards Techniques for Updating Virtual knowledge Graphs 17

Towards Techniques for Updating Virtual Knowledge Graphs

引用

17th International Rule Challenge and 7th Doctoral Consortium @ RuleM+RR, RuleML+RR-Companion 2023

作者： Wandji, Romuald Esdras Šimkus, Mantas Calvanese, Diego Department of Computing Science Umeå Universitet Umeå Sweden Research Centre for Knowledge and Data Faculty of Engineering Free University of Bozen-Bolzano Bolzano Italy

The field of Virtual knowledge Graphs (VKGs) continues to grow in both academic and applied contexts. Yet, the issue of updates in VKG systems has not yet received adequate attention, although it is crucial to manage data modifications at the data source level through the lens of an ontology. In this paper, we focus on VKGs whose ontology is specified in the lightweight ontology language DL-LiteA, and we propose diverse settings and research directions we intend to explore to address the challenge of translating ontology-based updates into updates at the level of data sources. We also pay attention to the important problem of automated analysis of mappings, which plays a major role when it comes to reformulating ontology-based update requests into update requests over the data sources. © 2023 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Semantic Querying of Integrated Raster and Relational data: A Virtual knowledge Graph Approach 17

Semantic Querying of Integrated Raster and Relational Data: ...

引用

17th International Rule Challenge and 7th Doctoral Consortium @ RuleM+RR, RuleML+RR-Companion 2023

作者： Ghosh, Arka Šimkus, Mantas Calvanese, Diego Department of Computing Science Umeå Universitet Umeå Sweden Research Centre for Knowledge and Data Faculty of Engineering Free University of Bozen-Bolzano Bolzano Italy

Ontology-based data access (OBDA) facilitates access to heterogeneous data sources through the mediation of an ontology (e.g. OWL), which captures the domain of interest and is connected to data sources through a declarative mapping. In our study, large, heterogeneous earth observational (EO) data, known as raster data, and geometrical data, known as vector data, are considered as (heterogeneous) data sources. Raster data represent, e.g., Earth's natural phenomena, such as surface temperature, elevation, or air pollution, as multidimensional arrays. In contrast, vector data depict, e.g., locations, networks, or regions on Earth, using geometries. Domain experts, such as earth scientists and GIS practitioners, still struggle to undertake advanced studies by querying large raster and vector data in an integrated way because, unlike relational data, they come in diverse formats and different data structures. In our approach to integration, we use a geospatial extension of an RDBMS to represent vector data as relational data, and a domain-agnostic array DBMS to handle raster data. Our aim is to extend the OBDA paradigm to effectively deal with relational, vector, and raster data in a combined way, while leveraging the built-in capabilities of data management tools relevant to each type of data. We also plan to develop techniques to calculate on the fly for each user query posed over the ontology an optimal query plan that exploits, at best, the query processing capabilities of each tool, while limiting costly data transfer operations between tools. © 2023 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Acute MI Detection Derived from ECG Parameters Distribution

Acute MI Detection Derived from ECG Parameters Distribution

引用

2019 Computing in Cardiology, CinC 2019

作者： Aranda, Alfonso Karel, Joël Bonizzi, Pietro Peeters, Ralf Maastricht University Department of Data Science and Knowledge Engineering Netherlands Medtronic Bakken Research Center Endepolsdomein 5 Maastricht6229GW Netherlands

ISBN: (纸本)9781728169361

Several studies in the past have evaluated the use of different ECG-based features to diagnose acute myocardial infarction (AMI). This was generally done by looking at how well a feature reflects differences between baseline (no AMI) and AMI situations. This approach tends to overlook the progress of AMI and to underestimate false positives when implemented into a continuous monitoring setting and therefore appears inadequate for it. This has hindered the adoption of those methods in the clinical practice. In this research, we present a novel set of parameters for the dynamic assessment of AMI condition. Those parameters are obtained by analyzing the changes over time in the distribution properties of ECG-based features. © 2019 Creative Commons.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

Using link-based content analysis to measure document similarity effectively

Using link-based content analysis to measure document simila...

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

作者： Li, Pei Li, Zhixu Liu, Hongyan He, Jun Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China Department of Management Science and Engineering Tsinghua University Beijing China

ISBN: (纸本)9783642006715

Along with a massive amount of information being placed online, it is a challenge to exploit the internal and external information of documents when assessing similarity between them. A variety of approaches have been proposed to model the document similarity based on different foundations, but usually they are not applicable for combining internal and external information. In this paper, we introduce a link-based method into content analysis, which is based on random walk on graphs. By defining similarity as the meeting probability of two random surfers, we propose a computational model for content analysis, which can also be integrated with external information of documents. Empirical study shows that our method achieves good accuracy, acceptable performance and fast convergent rate in multi-relational document similarity measuring. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Exploiting the block structure of link graph for efficient similarity computation

Exploiting the block structure of link graph for efficient s...

引用

13th Pacific-Asia Conference on knowledge Discovery and data Mining, PAKDD 2009

作者： Pei, Li Yuanzhe, Cai Hongyan, Liu Jun, He Xiaoyong, Du Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China Department of Management Science and Engineering Tsinghua University Beijing China

ISBN: (纸本)3642013066

In many real-world domains, link graph is one of the most effective ways to model the relationships between objects. Measuring the similarity of objects in a link graph is studied by many researchers, but an effective and efficient method is still expected. Based on our observation of link graphs from real domains, we find the block structure naturally exists. We propose an algorithm called BlockSimRank, which partitions the link graph into blocks, and obtains similarity of each node-pair in the graph efficiently. Our method is based on random walk on two-layer model, with time complexity as low as O(n4/3) and less memory need. Experiments show that the accuracy of BlockSimRank is acceptable when the time cost is the lowest. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

AutoPCS: A phrase-based text categorization system for similar texts

AutoPCS: A phrase-based text categorization system for simil...

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

作者： Li, Zhixu Li, Pei Wei, Wei Liu, Hongyan He, Jun Liu, Tao Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China Department of Management Science and Engineering Tsinghua University Beijing China

ISBN: (纸本)9783642006715

Nearly all text classification methods classify texts into predefined categories according to the terms appeared in texts. State-of-the-art of text classification prefer to simplely take a word as a term since it performs good on some famous datasets;some experts even pointed out that phrases don't improve or improve only marginally the classifiction accuracy. However, we found out that this is not always true when we try to categorize texts about similar topics in the same domain. With words only we can not categorize those texts effectively since they nearly share the same word set. Then we suppose the results might be improved if we also use phrases as terms. To testify our supposition, we propose our own phrase extraction way as well as select proper feature selection method and classifier by conducting experimental study on a data set which comes from paper abstracts in the field of databases. Accordingly, we also develop a system called AutoPCS which can be used to help experts in choosing relevant topics for newly coming papers from a predefined topic list only by their abstracts. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：