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

A Coffee-Ring Effect-Based Paper Sensor Chip for the Determination of Β-Lactoglobulin in Foods Via a Smartphone

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Lu, Yang Yang, Jingyi Zhang, Yong Wu, Lin State Key Laboratory for Food Nutrition and Safety College of Food Science and Engineering Tianjin University of Science and Technology Tianjin300457 China State Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China

To determine allergen β-lactoglobulin (β-LG) in foods, a method by a coffee-ring effect (CRE)-based paper sensor chip combined with a smartphone has been developed. The strategy was based on the principle of fluorescence quenching by the quantum dot-aptamer-graphene oxide (QD-Apt-GO) and where the degree of quenching was inversely proportional to the concentration of β-LG. First, the prepared β-LG solution was added to the QD-aptamer fluorescent probe solution followed by an appropriate amount of GO. After the reaction, a certain amount of the mixture was dispensed onto the detection zone of the sensor chip, resulting in the spread of the analyte solution by evaporation-driven flow. The QD-aptamer and the QD-Apt-β-LG in the mixed solution formed a visible fluorescent coffee-ring. For signal quantitation, an image of the coffee-ring was taken by a smartphone and imported into self-programmed software for analysis. The quantitative results for β-LG were acquired rapidly based on the magnitude of the generated fluorescent coffee-ring. The limit of detection (LOD) for β-LG was 0.048 mg L -1 and the linear range for the optimized assay was 0.39–1000 mg L -1 . The method was validated for analysis of real food samples and the results were consistent with those of a commercial ELISA assay kit. The smartphone-based assay provides a simple, economic, compact, and visual detection platform for the determination of β-LG in foods. © 2022, The Authors. All rights reserved.

关键词： Graphene

Triadic exploration and exploration with multiple experts

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Felde, Maximilian Stumme, Gerd Knowledge & Data Engineering Group University of Kassel Germany Interdisciplinary Research Center for Information System Design University of Kassel Germany

Formal Concept Analysis (FCA) provides a method called attribute exploration which helps a domain expert discover structural dependencies in knowledge domains that can be represented by a formal context (a cross table of objects and attributes). Triadic Concept Analysis is an extension of FCA that incorporates the notion of conditions. Many extensions and variants of attribute exploration have been studied but only few attempts at incorporating multiple experts have been made. In this paper we present triadic exploration based on Triadic Concept Analysis to explore conditional attribute implications in a triadic domain. We then adapt this approach to formulate attribute exploration with multiple experts that have different views on a domain. Copyright © 2021, The Authors. All rights reserved.

关键词： Formal concept analysis

Force-directed layout of order diagrams using dimensional reduction

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Dürrschnabel, Dominik Stumme, Gerd Knowledge & Data Engineering Group University of Kassel Germany Interdisciplinary Research Center for Information System Design University of Kassel Germany

Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an experienced expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one optimizes on distances of nodes and the other on distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of *** Codes 68R10, 06A07. Copyright © 2021, The Authors. All rights reserved.

关键词： Drawing (graphics)

Deceptive level generation for angry birds

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Gamage, Chathura Pinto, Vimukthini Renz, Jochen Stephenson, Matthew School of Computing The Australian National University Canberra Australia Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands

The Angry Birds AI competition has been held over many years to encourage the development of AI agents that can play Angry Birds game levels better than human players. Many different agents with various approaches have been employed over the competition's lifetime to solve this task. Even though the performance of these agents has increased significantly over the past few years, they still show major drawbacks in playing deceptive levels. This is because most of the current agents try to identify the best next shot rather than planning an effective sequence of shots. In order to encourage advancements in such agents, we present an automated methodology to generate deceptive game levels for Angry Birds. Even though there are many existing content generators for Angry Birds, they do not focus on generating deceptive levels. In this paper, we propose a procedure to generate deceptive levels for six deception categories that can fool the state-of-the-art Angry Birds playing AI agents. Our results show that generated deceptive levels exhibit similar characteristics of human-created deceptive levels. Additionally, we define metrics to measure the stability, solvability, and degree of deception of the generated levels. Copyright © 2021, The Authors. All rights reserved.

关键词： Birds

Aerial Reliable Collaborative Communications for Terrestrial Mobile Users via Evolutionary Multi-Objective Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Sun, Geng Xiao, Jian Li, Jiahui Wang, Jiacheng Kang, Jiawen Niyato, Dusit Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China affiliated with the College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore School of Automation Guangdong University of Technology Guangzhou510641 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

Unmanned aerial vehicles (UAVs) have emerged as the potential aerial base stations (BSs) to improve terrestrial communications. However, the limited onboard energy and antenna power of a UAV restrict its communication range and transmission capability. To address these limitations, this work employs collaborative beamforming through a UAV-enabled virtual antenna array to improve transmission performance from the UAV to terrestrial mobile users, under interference from non-associated BSs and dynamic channel conditions. Specifically, we introduce a memory-based random walk model to more accurately depict the mobility patterns of terrestrial mobile users. Following this, we formulate a multi-objective optimization problem (MOP) focused on maximizing the transmission rate while minimizing the flight energy consumption of the UAV swarm. Given the NP-hard nature of the formulated MOP and the highly dynamic environment, we transform this problem into a multi-objective Markov decision process and propose an improved evolutionary multi-objective reinforcement learning algorithm. Specifically, this algorithm introduces an evolutionary learning approach to obtain the approximate Pareto set for the formulated MOP. Moreover, the algorithm incorporates a long short-term memory network and hyper-sphere-based task selection method to discern the movement patterns of terrestrial mobile users and improve the diversity of the obtained Pareto set. Simulation results demonstrate that the proposed method effectively generates a diverse range of non-dominated policies and outperforms existing methods. Additional simulations demonstrate the scalability and robustness of the proposed CB-based method under different system parameters and various unexpected circumstances. © 2025, CC0.

关键词： Unmanned aerial vehicles (UAV)

HUSS: A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

学校读者我要写书评

暂无评论

HUSS: A Heuristic Method for Understanding the Semantic Stru...

IEEE International Conference on Big knowledge (ICBK)

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S. Sheng Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science Texas Tech University Lubbock TX USA

Spreadsheets contain a lot of valuable data and have many practical applications. The key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets, e.g., identifying cell function types and discovering relationships between cell pairs. Most existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells. A few studies do, but they ignore the layout structure information of spreadsheets, which affects the performance of cell function classification and the discovery of different relationship types of cell pairs. In this paper, we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets (HUSS). Specifically, based on the existing cell function classification model [11], we propose five types of heuristic rules to extract four different types of cell pairs, based on the cell style and spatial location information. Our experimental results on two real-world datasets demonstrate that the proposed method HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Analytical models Heuristic algorithms Semantics Layout Feature extraction Classification algorithms data mining

Aerial Secure Collaborative Communications under Eavesdropper Collusion in Low-altitude Economy: A Generative Swarm Intelligent Approach

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Jiahui Sun, Geng Wu, Qingqing Liang, Shuang Wang, Jiacheng Niyato, Dusit Kim, Dong In College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China School of Information Science and Technology Northeast Normal University Changchun130117 China Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

The rapid development of the low-altitude economy (LAE) has significantly increased the utilization of autonomous aerial vehicles (AAVs) in various applications, necessitating efficient and secure communication methods among AAV swarms. In this work, we aim to introduce distributed collaborative beamforming (DCB) into AAV swarms and handle the eavesdropper collusion by controlling the corresponding signal distributions. Specifically, we consider a two-way DCB-enabled aerial communication between two AAV swarms and construct these swarms as two AAV virtual antenna arrays. Then, we minimize the two-way known secrecy capacity and maximum sidelobe level to avoid information leakage from the known and unknown eavesdroppers, respectively. Simultaneously, we also minimize the energy consumption of AAVs when constructing virtual antenna arrays. Due to the conflicting relationships between secure performance and energy efficiency, we consider these objectives by formulating a multi-objective optimization problem, which is NP-hard and with a large number of decision variables. Accordingly, we design a novel generative swarm intelligence (GenSI) framework to solve the problem with less overhead, which contains a conditional variational autoencoder (CVAE)-based generative method and a proposed powerful swarm intelligence algorithm. In this framework, CVAE can collect expert solutions obtained by the swarm intelligence algorithm in other environment states to explore characteristics and patterns, thereby directly generating high-quality initial solutions in new environment factors for the swarm intelligence algorithm to search solution space efficiently. Simulation results show that the proposed swarm intelligence algorithm outperforms other state-of-the-art baseline algorithms, and the GenSI can achieve similar optimization results by using far fewer iterations than the ordinary swarm intelligence algorithm. Experimental tests demonstrate that introducing the CVAE mechanism ach

关键词： Multiobjective optimization

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection 41

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for I...

41st International Conference on Machine Learning, ICML 2024

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright 2024 by the author(s)

关键词： Object detection

Edge-Minimum Saturated k-Planar Drawings 29th

学校读者我要写书评

暂无评论

Edge-Minimum Saturated k-Planar Drawings

29th International Symposium on Graph Drawing and Network Visualization, GD 2021

作者： Chaplick, Steven Klute, Fabian Parada, Irene Rollin, Jonathan Ueckerdt, Torsten Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Utrecht University Utrecht Netherlands TU Eindhoven Eindhoven Netherlands Department of Mathematics and Computer Science FernUniversität in Hagen Hagen Germany Institute of Theoretical Informatics Karlsruhe Institute of Technology Karlsruhe Germany

ISBN: (纸本)9783030929305

For a class D of drawings of loopless (multi-)graphs in the plane, a drawing D∈ D is saturated when the addition of any edge to D results in D′∉ D —this is analogous to saturated graphs in a graph class as introduced by Turán (1941) and Erdős, Hajnal, and Moon (1964). We focus on k-planar drawings, that is, graphs drawn in the plane where each edge is crossed at most k times, and the classes D of all k-planar drawings obeying a number of restrictions, such as having no crossing incident edges, no pair of edges crossing more than once, or no edge crossing itself. While saturated k-planar drawings are the focus of several prior works, tight bounds on how sparse these can be are not well understood. We establish a generic framework to determine the minimum number of edges among all n-vertex saturated k-planar drawings in many natural classes. For example, when incident crossings, multicrossings and selfcrossings are all allowed, the sparsest n-vertex saturated k-planar drawings have 2k-(kmod2)(n-1) edges for any k≥ 4, while if all that is forbidden, the sparsest such drawings have 2(k+1)k(k-1)(n-1) edges for any k≥ 6. © 2021, Springer Nature Switzerland AG.

关键词： Drawing (graphics)