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

2021 6th International Seminar on Advances in Materials Science and engineering, ISAMSE 2021

作者： Zhang, Jin Sun, Qinyue Wang, Yumin Dong, Xiongwei Xiong, Yi Zeng, Wei Department of Pharmacy Zhongnan Hospital Wuhan University Wuhan430071 China Science and Technology Institute Key Laboratory of Textile Fiber and Products Ministry of Education Laboratory for Electron Microscopy Wuhan Textile University Hubei Wuhan430073 China National Engineering Research Center for Agro-Ecological Big Data Analysis and Application School of Electronics and Information Engineering Anhui University Anhui Hefei230601 China School of Physics and Technology MOE Key Laboratory of Artificial Micro- and Nano-Structures Wuhan University Wuhan430072 China

Elastic fabric is comfortable to wear, and has been a consumer textile due to its good shape retention and wrinkle resistance after washing. This paper briefly introduces the types and performance characteristics of several common elastic fibers, and analyzes the relationship between the structure and elasticity of different elastic fibers. Finally, the development trend of elastic fibers is proposed. © 2021 Institute of Physics Publishing. All rights reserved.

关键词： Elasticity

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Multi-Cloud data Storage System Disaster Recovery

Blockchain-Based Multi-Cloud Data Storage System Disaster Re...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Feiyu Wang Jian-tao Zhou College of Computer Science Inner Mongolia University Hohhot Inner Mongolia China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China

Cloud storage services have been used by most businesses and individual users. However, data loss, service interruptions and cyber attacks often lead to cloud storage services not being provided properly, and these incidents have caused financial losses to users. Second, traditional and single-cloud model disaster recovery services are no longer suitable for the current complex cloud storage systems. Therefore, a scheme to provide disaster recovery for cloud storage services in a multi-cloud storage environment is needed in real production. In this paper, we propose a disaster recovery scheme based on blockchain technology. The proposed scheme outlined in this study aims to address the issue of data availability within the cloud storage landscape. The proposed scheme achieves this goal by dividing data into hot and cold categories, verifying the integrity of copy data via blockchain technology, and utilizing blockchain networks to manage multi-cloud storage systems. Experimental findings demonstrate that the proposed scheme yields superior results in terms of computation and time overheads.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BMDP:Blockchain-Based Multi-Cloud Storage data Provenance

BMDP:Blockchain-Based Multi-Cloud Storage Data Provenance

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Feiyu Wang Jian-Tao Zhou Xu Guo College of Computer Science Inner Mongolia University Hohhot Inner Mongolia China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

In a multi-cloud storage system, provenance data records all operations and ownership during its lifecycle, which is critical for data security and audibility. However, recording provenance data also poses some challenging security and storage issues. In this paper, we present a secure and efficient multi-cloud storage data source scheme, BMDP. We use blockchain technology to ensure the secure storage of provenance data and design a smart contract to utilize the provenance data to ensure the proper operation of the multi-cloud storage system. Finally, we analyze the scheme’s safety and do simulation experiments to show that the scheme has practicality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

KVSAgg: Secure Aggregation of Distributed Key-Value Sets

KVSAgg: Secure Aggregation of Distributed Key-Value Sets

引用

International Conference on data engineering

作者： Yuhan Wu Siyuan Dong Yi Zhou Yikai Zhao Fangcheng Fu Tong Yang Chaoyue Niu Fan Wu Bin Cui School of Computer Science and National Engineering Laboratory for Big Data Analysis Technology and Application Peking University Beijing China Peng Cheng Laboratory Shenzhen China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China

In global data analysis, the central server needs the global statistic of the user data stored in local clients. In such cases, an Honest-but-Curious central server might put user privacy at risk in trying to collect individual statistics of each user. In response, the secure aggregation provides a solution for calculating global statistics without revealing users’ privacy data. However, existing secure aggregation protocols only focus on the data in the form of vectors or common sets, which limits their application scope. We formalize a general problem—key-value set secure aggregation—that not only includes secure vector aggregation and private set union but also supports more applications. To address the proposed problem, we devise our solution (called the KVSAgg framework) that promises satisfactory performance in security, efficiency, and accuracy. Our key technique is a homomorphic transform algorithm (called HyperIBLT) that is not only capable of bidirectionally transforming data between key-value sets and vectors, but also able to transform sum operation of sets to addition of vectors. We implement KVSAgg on both CPU and GPU platforms and perform the evaluation on three use cases including federated learning, distributed data counting, and finding global hot items. Compared with our baselines, KVSAgg simultaneously achieves the best security, efficiency higher by orders of magnitude, and zero-error in nearly all cases. All codes are open-source anonymously.

关键词：

来源：评论

学校读者我要写书评

暂无评论

REncoder: A Space-Time Efficient Range Filter with Local Encoder

REncoder: A Space-Time Efficient Range Filter with Local Enc...

引用

International Conference on data engineering

作者： Ziwei Wang Zheng Zhong Jiarui Guo Yuhan Wu Haoyu Li Tong Yang Yaofeng Tu Huanchen Zhang Bin Cui School of Computer Science and National Engineering Laboratory for Big Data Analysis Technology and Application Peking University Beijing China Peng Cheng Laboratory Shenzhen China ZTE Corporation Beijing China Tsinghua University Beijing China

A range filter is a data structure to answer range membership queries. Range queries are common in modern applications, and range filters have gained rising attention for improving the performance of range queries by ruling out empty range queries. However, state-of-the-art range filters, such as SuRF and Rosetta, suffer either high false positive rate or low throughput. In this paper, we propose a novel range filter, called REncoder. It organizes all prefixes of keys into a segment tree, and locally encodes the segment tree into a Bloom filter to accelerate queries. REncoder supports diverse workloads by adaptively choosing how many levels of the segment tree to store. We theoretically prove that the error of REncoder is bounded and derive the asymptotic space complexity under the bounded error. We conduct extensive experiments on both synthetic datasets and real datasets. The experimental results show that REncoder outperforms all state-of-the-art range filters.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Weighted Flat Lattice Transformer-based Knowledge Extraction Architecture for Chinese Named Entity Recognition

A Weighted Flat Lattice Transformer-based Knowledge Extracti...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Hengwei Zhang Yuejia Wu Jian-Tao Zhou Inner Mongolia University College of Computer Science Hohhot China Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Hohhot China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Hohhot China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Named Entity Recognition (NER) is one of the contents of Knowledge Extraction (KE) that transforms data into knowledge representation. However, Chinese NER faces the problem of lacking clear word boundaries that limit the effectiveness of the KE. Although the flat lattice Transformer (FLAT) framework, which converts lattice structure into a flat structure including a set of spans, can effectively improve this problem and obtain advanced results, there still exist the problems of insensitivity to entity importance weights and insufficient feature learning. This paper proposes a weighted flat lattice Transformer architecture for Chinese NER, namely WFLAT. The WFLAT first adds a weight matrix into self-attention calculation, which can obtain finer-grained partitioning of entities to improve experimental performance, and then adopts a multi-layer Transformer encoder with each layer using a multi-head self-attention mechanism. Extensive experimental results on benchmarks demonstrate that our proposed KE model can obtain state-of-the-art performance for the Chinese NER task.

关键词： Representation learning Computational modeling Memory management Lattices Named entity recognition Transforms Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Framework for Fuzzy Temporal Association Rule Mining Based on Density Clustering Optimization

Framework for Fuzzy Temporal Association Rule Mining Based o...

引用

6th International Conference on Intelligent Computing and Signal Processing (ICSP)

作者： Yang Cao Pengzhi Ma School of Computer Science and Engineering Shenyang Jianzhu University(SJZU) Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang China

ISBN: (数字)9798350376548

ISBN: (纸本)9798350376555

This paper proposes a framework for fuzzy temporal association rule mining based on density clustering optimization, aimed at improving the fuzzification of continuous attributes and enhancing the efficiency of mining temporal association rules. The first part of the framework effectively handles continuous attribute data and reduces data redundancy by adopting a density peak clustering algorithm and designing an optimized membership function. The second part introduces a fuzzy list ranking structure combined with item lifespan to mine fuzzy temporal association rules. Experimental results demonstrate that the framework exhibits superior performance in mining fuzzy temporal association rules and outperforms advanced algorithms in handling continuous attributes.

关键词： Fuzzy sets Systematics Redundancy Memory management Signal processing algorithms Clustering algorithms Signal processing Association rule learning Optimization Sorting

来源：评论

学校读者我要写书评

暂无评论

An Empirical Guide for Visualization Consistency in Multiple Coordinated Views

An Empirical Guide for Visualization Consistency in Multiple...

引用

Pacific (formerly Asia-Pacific APVIS) Visualization Symposium

作者： Shaocong Tan Chufan Lai Xiaolong Luke Zhang Xiaoru Yuan Key Laboratory of Machine Perception (Ministry of Education) and School of Intelligence Science and Technology Peking University China College of Information Sciences and Technology Pennsylvania State University USA National Engineering Laboratory for Big Data Analysis and Application Peking University China

Visual analytic systems usually provide multiple coordinated views (MCVs) to support data analysis and exploration. Coordination in visual graphics plays an important role in facilitating comprehensive analytical tasks, such as data comparison and cognitive inference. However, individual views in MCVs are probably designed for a specific purpose based on a particular type of data, and insufficient consideration of the intricate relationships among views may lead to inconsistency in visual representation and user interaction across different views. To better understand the inconsistency issues in MCVs and their impacts on user behaviors, this paper reports a study on the analysis and classification of visualization inconsistency based on the reviews of interactive visualization designs and visual analytic systems, and the interviews with stakeholders. We find that inconsistencies are prevalent in MCVs and frequently lead to misleading or even incorrect results. We classify the discovered inconsistencies based on a coordination model of MCVs, and develop an empirical guide for systematic and efficient visualization consistency checking in the design, implementation, and evaluation stage.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Edit-History Vis: An Interactive Visual Exploration and analysis on Wikipedia Edit History

Edit-History Vis: An Interactive Visual Exploration and Anal...

引用

Pacific (formerly Asia-Pacific APVIS) Visualization Symposium

作者： Yuhan Guo Qin Han Yuke Lou Yiming Wang Can Liu Xiaoru Yuan Key Laboratory of Machine Perception (Ministry of Education) and School of Intelligence Science and Technology Peking University China School of Electronic Engineering and Computer Science Peking University China National Engineering Laboratory for Big Data Analysis and Application Peking University China

We propose Edit-History Vis, a visual analytics system designed to facilitate interactive exploration on Wikipedia edit history at a fine-grained level. The examination of detailed changes in Wikipedia articles is crucial for understanding how authors’ perspectives vary and conflict during the collaborative editing process. However, it is challenging to reveal the details while preserving the heterogeneous attributes of revisions, namely the time, content, and editor. The Edit-History Vis system integrates editor and textual changes of revisions by utilizing a force-directed revision graph that groups revisions based on standpoints. Through this revision graph, users can identify and analyze editing events such as edit wars, vandalism, repair, and normal updates. The effectiveness of the system in analyzing the edit history is validated through a qualitative comparison with prior work and a quantitative rating from a user study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Simulation Method to Play with Porosity and Particle Size Distribution for Characterizing Porous Media

arXiv

引用

arXiv 2024年

作者： Wang, Yuhe National & Local Joint Engineering Laboratory for Big Data Analysis and Computing Technology Beijing100190 China Institute for Scientific Computation Texas A&M University College StationTX77843 United States

This note presents a simulation method for investigating the relationship between porosity and particle size distribution in porous media characterization. The method simulates particle packing based on particle size distributions, incorporating descent and collision rules to mimic the natural deposition process while minimizing boundary-induced porosity distortions. By systematically varying the mean particle size and standard deviation, multiple packed structures are generated, and their corresponding porosities are calculated. This approach offers a flexible and scalable tool for exploring the impact of particle size distribution on porosity, providing both qualitative and quantitative insights into porous media properties. © 2024, CC BY.

关键词： Porosity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：