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

A homogeneous binary matrix assisted laser desorption/ionization time-of-flight mass spectrometry assay for determination of artificial sweeteners in beverages

引用

FOOD CHEMISTRY 2024年第Part2期460卷 140597页

作者： Wang, Mengzhen Ling, Ling Wang, Shuyi Ding, Chuan-Fan Ningbo Univ Inst Mass Spectrometry Sch Mat Sci & Chem Engn Key Lab Adv Mass Spectrometry & Mol Anal Zhejiang Ningbo 315211 Zhejiang Peoples R China

Artificial sweeteners have been widely used as additives in various beverages. Due to the safety risks associated with artificial sweeteners, it is essential to develop a simple, rapid, and high-throughput method for the analysis of artificial sweeteners. Here, we report a homogeneous binary matrix assisted laser desorption/ionization time- of-flight mass spectrometry (MALDI-TOF MS) assay for the simultaneous analysis of sweeteners including aspartame (ASP), neotame (NEO), and advantame (ADV) with a simple dilution step. The combination of nanodiamonds with 2,5-dihydroxybenzoic acid effectively improved the signal response of sweeteners, decreased the background noise, and improved the "spot-to-spot" repeatability. After the optimization, the method exhibits low limits of detection (ASP: 20 n & Mcy;& Mcy;NEO: 10 n & Mcy;& Mcy;ADV: 5 n & Mcy;), & Mcy;), good linearity (r r > 0.995), satisfactory accuracy (96.2-103.0%), and lower RSDs (1.5-5.8%). Finally, the target sweeteners in 17 soft beverages were successfully determined with this method, showing the potential for the routine analysis of artificial sweeteners.

关键词： Artificial sweeteners Aspartame Nanodiamonds binary matrix MALDI-TOF MS Beverage

来源：评论

学校读者我要写书评

暂无评论

Image binary matrix Processing to Encrypt-Decrypt Digital Images

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2024年第3期15卷 1229-1238页

作者： Al-Laham, Mohamad Omar, Firas Alqadi, Ziad A. Al Balqa Appl Univ MIS Dept Amman Jordan Univ Petra Fac Informat Technol Amman Jordan Al Balqa Appl Univ Fac Engn Technol Amman Jordan

This research study presents a simple cryptographic solution for protecting grayscale and colored digital images, which are commonly used in computer applications. Due to their widespread use, protecting these photos is crucial to preventing unauthorized access. This article's methodology manipulates an image's binary matrix using basic operations. These specified actions include increasing the 8-column matrix to 64 columns, reorganizing it into 64 columns, separating it into four blocks, and shuffle the columns using secret index keys. These keys are produced using four sets of common chaotic logistic parameters. Each set executes a chaotic logistic map model to generate a chaotic key, which is then translated into an index key. This index key shuffles columns during encryption and reverses during decryption. The cryptographic approach promises a large key space that can withstand hacking. The encrypted image is secure since the decryption procedure is sensitive to the precise private key values. Private keys are frequently chaotic logistic parameters, making encryption resilient. This method is convenient since it supports images of any size and kind without modifying the encryption or decryption techniques. Shuffling replaces difficult logical procedures in typical data encryption methods, simplifying the cryptographic process. Experiments with several photos will evaluate the proposed strategy. The encrypted and decrypted photos will be examined to ensure the method meets cryptographic standards. Speed tests will also compare the proposed method to existing cryptographic methods to show its potential to speed up picture cryptography by lowering encryption and decryption times.

关键词： Image processing binary matrix encrypt-decrypt digital image

来源：评论

学校读者我要写书评

暂无评论

Construction of binary matrix for Efficient Room Temperature Phosphorescence Emission

引用

ADVANCED OPTICAL MATERIALS 2024年第29期12卷

作者： Jia, Qinglong Bo, Changchang Lu, Ziyi Xu, Wensheng Liu, Jiayi Gao, Li Chen, Ligong Wang, Bowei Tianjin Univ Sch Chem Engn & Technol Tianjin 300350 Peoples R China Tianjin Engn Res Ctr Funct Fine Chem Tianjin 300350 Peoples R China Collaborat Innovat Ctr Chem Sci & Engn Tianjin Tianjin 300072 Peoples R China

Despite the extensive research on room temperature phosphorescent (RTP) materials, it remains a great challenge to further improve the photophysical properties of RTP materials. In this study, the RTP emission of guest molecule is significantly enhanced by constructing binary matrices containing cyanuric acid (CA) and amino-containing compounds. Systematic studies show that the strong interaction between the two components of binary matrix induced variations in the guest molecular configuration and excited state electron distribution, thus facilitating the production of more triplet excitons. Furthermore, the binary matrix also exhibits stronger domain-limiting effect compared to the CA mono-matrix, effectively inhibits the energy loss of triplet excitons due to quenching and non-radiative transitions. The prepared binary matrix RTP materials present ultralong phosphorescence lifetime and high phosphorescence quantum yield (up to 3.21 s and 7.31%, respectively), and even achieve bright RTP emission in a variety of organic solvents and aqueous media. Moreover, the RTP emission intensity of the best binary matrix composite can reach more than 28 times that of the CA mono-matrix composite, and the RTP lifetime can be extended by 1.51 s. The binary matrix is constructed by cyanuric acid (CA) and amino-containing compounds to enhance the RTP emission, in which the electronic properties of guest molecules are regulated while the rigid environment is enhanced. The RTP properties of the resulting material are substantially improved, with the RTP emission intensity being even over 28 times higher than that of the CA matrix composites, and the RTP lifetime being extended by 1.51 s. image

关键词： binary matrix cyanuric acid domain-limiting effect electrostatic interactions room-temperature phosphorescence

来源：评论

学校读者我要写书评

暂无评论

Carbon Dots and 9AA as a binary matrix for the Detection of Small Molecules by matrix-Assisted Laser Desorption/Ionization Mass Spectrometry

引用

JOURNAL OF THE AMERICAN SOCIETY FOR MASS SPECTROMETRY 2016年第7期27卷 1227-1235页

作者： Chen, Yongli Gao, Dan Bai, Hangrui Liu, Hongxia Lin, Shuo Jiang, Yuyang Peking Univ Grad Sch Shenzhen Sch Chem Biol & Biotechnol Key Lab Chem Genom Shenzhen 518055 Peoples R China Tsinghua Univ Grad Sch Shenzhen Natl & Local United Engn Lab Personalized Antitum Shenzhen 518055 Peoples R China Tsinghua Univ Grad Sch Shenzhen Shenzhen Key Lab Chem Biol State Key Lab Breeding Base Shenzhen 518055 Peoples R China Tsinghua Univ Grad Sch Shenzhen Key Lab Metabol Shenzhen Shenzhen 518055 Peoples R China

Application of matrix-assisted laser-desorption/ionization mass spectrometry (MALDI MS) to analyze small molecules have some limitations, due to the inhomogeneous analyte/matrix co-crystallization and interference of matrix-related peaks in low m/z region. In this work, carbon dots (CDs) were for the first time applied as a binary matrix with 9-Aminoacridine (9AA) in MALDI MS for small molecules analysis. By 9AA/CDs assisted desorption/ionization (D/I) process, a wide range of small molecules, including nucleosides, amino acids, oligosaccharides, peptides, and anticancer drugs with a higher sensitivity were demonstrated in the positive ion mode. A detection limit down to 5 fmol was achieved for cytidine. 9AA/CDs matrix also exhibited excellent reproducibility compared with 9AA matrix. Moreover, by exploring the ionization mechanism of the matrix, the influence factors might be attributed to the four parts: (1) the strong UV absorption of 9AA/CDs due to their pi-conjugated network;(2) the carboxyl groups modified on the CDs surface act as protonation sites for proton transfer in positive ion mode;(3) the thin layer crystal of 9AA/CDs could reach a high surface temperature more easily and lower transfer energy for LDI MS;(4) CDs could serve as a matrix additive to suppress 9AA ionization. Furthermore, this matrix was allowed for the analysis of glucose as well as nucleosides in human urine, and the level of cytidine was quantified with a linear range of 0.05-5 mM (R-2 > 0.99). Therefore, the 9AA/CDs matrix was proven to be an effective MALDI matrix for the analysis of small molecules with improved sensitivity and reproducibility. This work provides an alternative solution for small molecules detection that can be further used in complex samples analysis.

关键词： 9-Aminoacridine Carbon dots binary matrix MALDI MS Small molecules

来源：评论

学校读者我要写书评

暂无评论

A New binary Biclustering Algorithm Based on Weight Adjacency Difference matrix for Analyzing Gene Expression Data

引用

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2023年第5期20卷 2802-2809页

作者： Chu, He-Ming Kong, Xiang-Zhen Liu, Jin-Xing Zheng, Chun-Hou Zhang, Han Qufu Normal Univ Sch Comp Sci Rizhao 276826 Shandong Peoples R China Jishou Univ Sch Informat Sci & Engn Jishou 416000 Hunan Peoples R China

Biclustering algorithms are essential for processing gene expression data. However, to process the dataset, most biclustering algorithms require preprocessing the data matrix into a binary matrix. Regrettably, this type of preprocessing may introduce noise or cause information loss in the binary matrix, which would reduce the biclustering algorithm's ability to effectively obtain the optimal biclusters. In this paper, we propose a new preprocessing method named Mean-Standard Deviation (MSD) to resolve the problem. Additionally, we introduce a new biclustering algorithm called Weight Adjacency Difference matrix binary Biclustering (W-AMBB) to effectively process datasets containing overlapping biclusters. The basic idea is to create a weighted adjacency difference matrix by applying weights to a binary matrix that is derived from the data matrix. This allows us to identify genes with significant associations in sample data by efficiently identifying similar genes that respond to specific conditions. Furthermore, the performance of the W-AMBB algorithm was tested on both synthetic and real datasets and compared with other classical biclustering methods. The experiment results demonstrate that the W-AMBB algorithm is significantly more robust than the compared biclustering methods on the synthetic dataset. Additionally, the results of the GO enrichment analysis show that the W-AMBB method possesses biological significance on real datasets.

关键词： Biclustering gene expression data weight matrix binary matrix

来源：评论

学校读者我要写书评

暂无评论

A new representation for 3D objects: binary matrix 3

A new representation for 3D objects: Binary matrix

引用

3rd IEEE World Conference on Complex Systems, WCCS 2015

作者： Aznag, Khalid Kane, Nouhoun Oirrak, Ahmed El Bachari, Essaid El Laboratory of Computer Systems Engineering Cadi Ayyad University Faculty of Sciences Marrakech Morocco

ISBN: (纸本)9781467396691

In this work, a new method is presented for the representation of 3D objects with binary matrix. This method is based on two stages: normalization and quantization. This representation allows us to compare 3D objects by computing the similarity between them. In fact our algorithm compute binary matrix, frequency matrix and cluster coordinates. So we can identify an object by comparing those representations. © 2015 IEEE.

关键词： 3D objects binary matrix cluster coordinates frequency matrix similarity index

来源：评论

学校读者我要写书评

暂无评论

An Improved Algorithm for Extracting Frequent Gradual Patterns

引用

INFORMATICA 2024年第3期35卷 577-600页

作者： Kenmogne, Edith Belise Tetakouchom, Idriss Djamegni, Clementin Tayou Nkambou, Roger Tabueu, Laurent Cabrel Univ Dschang Dept Comp Engn UIT FV Dschang Cameroon Univ Dschang Dept Math & Comp Sci FS Dschang Cameroon Univ Quebec Montreal Comp Sci Dept Montreal PQ Canada

Frequent gradual pattern extraction is an important problem in computer science widely studied by the data mining community. Such a pattern reflects a co-variation between attributes of a database. The applications of the extraction of the gradual patterns concern several fields, in particular, biology, finances, health and metrology. The algorithms for extracting these patterns are greedy in terms of memory and computational resources. This clearly poses the problem of improving their performance. This paper proposes a new approach for the extraction of gradual and frequent patterns based on the reduction of candidate generation and processing costs by exploiting frequent itemsets whose size is a power of two to generate all candidates. The analysis of the complexity, in terms of CPU time and memory usage, and the experiments show that the obtained algorithm outperforms the previous ones and confirms the interest of the proposed approach. It is sometimes at least 5 times faster than previous algorithms and requires at most half the memory.

关键词： gradual pattern frequent pattern candidate binary matrix mining

来源：评论

学校读者我要写书评

暂无评论

binary factorizations of the matrix of all ones

引用

LINEAR ALGEBRA AND ITS APPLICATIONS 2015年 468卷 63-79页

作者： Trefois, Maguy Van Dooren, Paul Delvenne, Jean-Charles Catholic Univ Louvain ICTEAM Inst Dept Appl Math B-1348 Louvain Belgium Fac Univ Notre Dame Namur Complex Syst Ctr NAXYS Namur Belgium Catholic Univ Louvain CORE B-1348 Louvain Belgium

In this paper, we consider the problem of factorizing the n x n matrix J(n) of all ones into the n x n binary matrices. We show that under some conditions on the factors, these are isomorphic to a row permutation of a De Bruijn matrix. Moreover, we consider in particular the binary roots of J(n), i.e. the binary solutions to A(m) = J(n). On the one hand, we prove that any binary root with minimum rank is isomorphic to a row permutation of a De Bruijn matrix whose row permutation is represented by a block diagonal matrix. On the other hand, we partially solve Hoffman's open problem of characterizing the binary solutions to A(2) = J(n) by providing a characterization of the binary solutions to A(2) = J(n) with minimum rank. Finally, we provide a class of roots which are isomorphic to a De Bruijn matrix. (C) 2014 Elsevier Inc. All rights reserved.

关键词： matrix equation Standard factorization binary matrix De Bruijn matrix Isomorphism

来源：评论

学校读者我要写书评

暂无评论

An L0-Norm Constrained Unsupervised Non-Negative matrix Factorization Algorithm for Privacy Preserving Energy Usage Decomposition

An L0-Norm Constrained Unsupervised Non-Negative Matrix Fact...

引用

IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Zarabie, Ahmad Khaled Das, Sanjoy Kansas State Univ Manhattan KS 66506 USA

ISBN: (纸本)9781665487689

By energy usage decomposition, this paper refers to the decomposition of energy use time series data into its major load classes. Specifically, a novel unsupervised learning algorithm is proposed to classify energy usage in a residential unit into fixed loads and one or more classes of shiftable loads. Unlike traditional disaggregation, the algorithm does not require any prior information about the load consumption patterns of individual appliances in the home, thereby fully preserving the home's privacy. Shiftable loads are characterized by ON/OFF duty cycles. The proposed algorithm is based on non-negative matrix factorization (NMF), where fixed loads are represented in terms of real-valued basis vectors, whereas shiftable loads are divided into binary signals. This binary decomposition approach directly applies L0-norm constraints on individual shiftable loads. The new approach obviates the need for more computationally intensive methods (e.g. spectral decomposition or mean-field annealing) that have been used in earlier research for these constraints. A probabilistic framework for the proposed approach has been outlined.

关键词： binary matrix fixed load non-negative matrix factorization privacy preserving Frobenius norm shiftable load sparsity constraint unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Non-Cartesian Spiral binary Sensing Matrices

引用

CIRCUITS SYSTEMS AND SIGNAL PROCESSING 2022年第5期41卷 2934-2946页

作者： Gan, Hongping Gao, Yang Zhang, Tao Northwestern Polytech Univ Sch Software Xian 710072 Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Univ Queensland Sch Informat Technol & Elect Engn Brisbane Qld 4072 Australia Shanghai Mao Tong Univ Shanghai Key Lab Intelligent Sensing & Recognit Shanghai 200240 Peoples R China

binary sensing matrices can offer rapid multiplier-less data acquisition, owing to their binarization structure and competitive sampling efficiency, which promise to promote compressive sensing from theory to application. However, the size of existing binary constructions is often limited, and the generating strategies require extensive computational complexity. In this work, we propose a trivial strategy to deterministically construct non-Cartesian spiral binary sensing matrices (SbMs) with arbitrary size for compressive sensing. The mutual coherence of SbMs is proven to satisfy the Welch bound, i.e., optimal theoretical guarantee. Moreover, the simulation results show that the proposed SbMs can not only outperform their counterparts in sampling performance but also facilitate reconstruction speed.

关键词： Compressive sensing binary matrix Mutual coherence Welch bound

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：