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

Efficient Pairing in Unknown Environments: Minimal Observations and TSP-based Optimization

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Fujita, Naoki Chauvet, Nicolas Röhm, André Horisaki, Ryoichi Li, Aohan Hasegawa, Mikio Naruse, Makoto Department of Information Physics and Computing Graduate School of Information Science and Technology The University of Tokyo Hongo Bunkyo-ku Tokyo113-8656 Japan Department of Electrical Engineering Graduate School of Engineering Tokyo University of Science 6-3-1 Niijuku Katsushika-ku Tokyo125-8585 Japan

Generating paired sequences with maximal compatibility from a given set is one of the most important challenges in various applications, including information and communication technologies. However, the number of possible pairings explodes in a double factorial order as a function of the number of entities, manifesting the difficulties of finding the optimal pairing that maximizes the overall reward. In the meantime, in real-world systems, such as user pairing in non-orthogonal multiple access (NOMA), pairing often needs to be conducted at high speed in dynamically changing environments;hence, efficient recognition of the environment and finding high reward pairings are highly demanded. In this paper, we demonstrate an efficient pairing algorithm to recognize compatibilities among elements as well as to find a pairing that yields a high total compatibility. The proposed pairing strategy consists of two phases. The first is the observation phase, where compatibility information among elements is obtained by only observing the sum of rewards. We show an efficient strategy that allows obtaining all compatibility information with minimal observations. The minimum number of observations under these conditions is also discussed, along with its mathematical proof. The second is the combination phase, by which a pairing with a large total reward is determined heuristically. We transform the pairing problem into a traveling salesman problem (TSP) in a three-layer graph structure, which we call Pairing-TSP. We demonstrate heuristic algorithms in solving the Pairing-TSP efficiently. This research is expected to be utilized in real-world applications such as NOMA, social networks, among others. Copyright © 2022, The Authors. All rights reserved.

关键词： Combinatorial optimization

Cross-Reference Simulation by Code-To-Code Adapter (CoToCoA) Library for the Study of Multi-Scale Physics in Planetary Magnetospheres 9

学校读者我要写书评

暂无评论

Cross-Reference Simulation by Code-To-Code Adapter (CoToCoA)...

9th International Symposium on computing and Networking Workshops, CANDARW 2021

作者： Katoh, Yuto Fukazawa, Keiichiro Nanri, Takeshi Miyake, Yohei Tohoku University Graduate School of Science Sendai Japan Kyoto University Academic Center For Computing And Media Studies Kyoto Japan Kyushu University Research Insitute For Information Technology Fukuoka Japan Kobe University Education Center On Computational Science And Engineering Kobe Japan

ISBN: (纸本)9781665428354

We have developed a cross-reference simulation code by a newly developed Code-To-Code Adapter (CoToCoA) library for the study of wave-particle interactions in planetary magnetospheres. The cross-reference simulation is a simulation model combining multiple simulation codes, which enables us to carry out multi-scale and multi-physics simulations. The cross-reference simulation is a unique approach in the space physics community, because HPC application codes are individually developed using a different set of basic equations and therefore the data transfer between the codes usually requires considerable efforts in adjusting interface. While the difficulties in combining the codes resulted in rare trials in the space physics community, the CoToCoA library plays crucial role in the modernization of the cross-reference simulation. The design concept of the CoToCoA library is to realize the communication among the codes with keeping necessary modification of the original code small, which enables us to carry out 'strong' cross-reference simulations;the data exchange among simulation codes is conducted by direct memory access, instead of file output as has been used in conventional 'weak' cross-reference simulations. In this paper, we present examples of the cross-reference simulation and describe how we implemented the CoToCoA library into the codes. We carry out a benchmark using a cross-reference simulation code and demonstrate that we can realize the 'strong' cross-reference simulation without incurring appreciable overheads as we used in the conventional 'weak' cross-reference simulations. © 2021 IEEE.

关键词： Electronic data interchange

Frontiers in Intelligent Colonoscopy

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ji, Ge-Peng Liu, Jingyi Xu, Peng Barnes, Nick Khan, Fahad Shahbaz Khan, Salman Fan, Deng-Ping Guangdong China College of Computer Science & VCIP Nankai University Tianjin China School of Computing Australian National University Canberra Australia Graduate School of Science and Technology Keio University Yokohama Japan Department of Electronic Engineering Tsinghua University Beijing China Mohamed bin Zayed University of Artificial Intelligence Abu Dhabi United Arab Emirates

Colonoscopy is currently one of the most sensitive screening methods for colorectal cancer. This study investigates the frontiers of intelligent colonoscopy techniques and their prospective implications for multimodal medical applications. With this goal, we begin by assessing the current data-centric and model-centric landscapes through four tasks for colonoscopic scene perception, including classification, detection, segmentation, and vision-language understanding. Our assessment reveals domain-specific challenges and underscores the need for further multimodal research in colonoscopy. To address these gaps, we establish three foundational initiatives: a large-scale multimodal instruction tuning dataset ColonINST, a colonoscopy-designed multimodal language model ColonGPT, and a multimodal benchmark. To facilitate continuous advancements in this rapidly evolving field, we provide a public website for the latest updates: https://***/ai4colonoscopy/IntelliScope. © 2024, CC BY.

关键词： Visual languages

Tracing quantum correlations back to collective interferences

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ji, Ming Hance, Jonte R. Hofmann, Holger F. Graduate School of Advanced Science and Engineering Hiroshima University Kagamiyama 1-3-1 Higashi Hiroshima739-8530 Japan School of Computing Newcastle University 1 Science Square Newcastle upon TyneNE4 5TG United Kingdom Quantum Engineering Technology Laboratories Department of Electrical and Electronic Engineering University of Bristol Woodland Road BristolBS8 1US United Kingdom

In this paper, we investigate the possibility of explaining nonclassical correlations between two quantum systems in terms of quantum interferences between collective states of the two systems. We achieve this by mapping the relations between different measurement contexts in the product Hilbert space of a pair of two-level systems onto an analogous sequence of interferences between paths in a single-particle interferometer. The relations between different measurement outcomes are then traced to the distribution of probability currents in the interferometer, where paradoxical relations between the outcomes are identified with currents connecting two states that are orthogonal and should therefore exclude each other. We show that the relation between probability currents and correlations can be represented by continuous conditional (quasi)probability currents through the interferometer, given by weak values;the violation of the noncontextual assumption is expressed by negative conditional currents in some of the paths. Since negative conditional currents correspond to the assignment of negative conditional probabilities to measurements results in different measurement contexts, the necessity of such negative probability currents represents a failure of noncontextual local realism. Our results help to explain the meaning of nonlocal correlations in quantum mechanics, and support Feynman’s claim that interference is the origin of all quantum phenomena. Copyright © 2024, The Authors. All rights reserved.

关键词： Interferometers

Counterfactuality, back-action, and information gain in multi-path interferometers

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hance, Jonte R. Matsushita, Tomonori Hofmann, Holger F. School of Computing Newcastle University 1 Science Square Newcastle upon TyneNE4 5TG United Kingdom Quantum Engineering Technology Laboratories Department of Electrical and Electronic Engineering University of Bristol Woodland Road BristolBS8 1US United Kingdom Graduate School of Advanced Science and Engineering Hiroshima University Kagamiyama 1-3-1 Higashi Hiroshima739-8530 Japan

The presence of an absorber in one of the paths of an interferometer changes the output statistics of that interferometer in a fundamental manner. Since the individual quantum particles detected at any of the outputs of the interferometer have not been absorbed, any non-trivial effect of the absorber on the distribution of these particles over these paths is a counterfactual effect. Here, we quantify counterfactual effects by evaluating the information about the presence or absence of the absorber obtained from the output statistics, distinguishing between classical and quantum counterfactual effects. We identify the counterfactual gain which quantifies the advantage of quantum counterfactual protocols over classical counterfactual protocols, and show that this counterfactual gain can be separated into two terms: a semi-classical term related to the amplitude blocked by the absorber, and a Kirkwood-Dirac quasiprobability assigning a joint probability to the blocked path and the output port. A negative Kirkwood-Dirac term between a path and an output port indicates that inserting the absorber into that path will have a focussing effect, increasing the probability of particles arriving at that output port, resulting in a significant enhancement of the counterfactual gain. We show that the magnitude of quantum counterfactual effects cannot be explained by a simple removal of the absorbed particles, but originates instead from a well-defined back-action effect caused by the presence of the absorber in one path, on particles in other paths. © 2024, CC BY.

关键词： Interferometers

Data Freshness Optimization Under CAA in the UAV-Aided MECN: A Potential Game Perspective

学校读者我要写书评

暂无评论

Data Freshness Optimization Under CAA in the UAV-Aided MECN:...

作者： Wang, Weizheng Srivastava, Gautam Lin, Jerry Chun-Wei Yang, Yaoqi Alazab, Mamoun Gadekallu, Thippa Reddy City University of Hong Kong Department of Computer Science Hong Kong Brandon University Department of Mathematics and Computer Science BrandonMBR7A 6A9 Canada China Medical University Research Centre for Interneural Computing Taichung406040 Taiwan Western Norway University of Applied Sciences Department of Computer Science Bergen5063 Norway Army Engineering University of Pla Graduate School Nanjing210000 China Melbourne Polytechnic Prahran Campus Department of Information Technology MelbourneVIC3181 Australia Vellore Institute of Technology School of Information Technology Vellore632014 India

As a promising enabler for edge intelligence, Unmanned Aerial Vehicles (UAV) have become more and more important in Mobile Edge computing Networks (MECN), such as communication, computation, collection and control service supply. Although Age of Information (AoI) minimization is indispensable for fresh information collection and computation in the UAV-aided MECN, some attackers can launch attacks to deteriorate the availability of precious channel resources, such as revealed channel access attacks (CAAs). Moreover, recent research has not considered the system's active probability and security issues concurrently, e.g., CAA, in the average AoI minimization process. In this paper, to deal with this problem, we consider an AoI-oriented channel access problem under CAA with a game theory viewpoint. Firstly, to obtain a MECN-based AoI indicator under CAA, the system model with active probability consideration is established. Next, the channel access-based AoI minimization problem is formulated from the viewpoint of the Ordinary Potential Game (OPG). Furthermore, two algorithms called AACSD and DCASD are proposed to determine channel access strategies, by which the Nash Equilibrium (NE) solution of the OPG could be reached. Finally, experiments are conducted under homogeneous and heterogeneous parameter settings, and the simulation results evaluate the correctness and effectiveness of our proposals. © 2000-2011 IEEE.

关键词： Game theory

Twenty Years of Personality computing: Threats, Challenges and Future Directions

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Celli, Fabio Kartelj, Aleksandar Ðorðević, Miljan Suhartono, Derwin Filipović, Vladimir Milutinović, Veljko Spathoulas, Georgios Vinciarelli, Alessandro Kosinski, Michal Lepri, Bruno Maggioli SpA Italy Faculty of Mathematics University of Belgrade Serbia School of Electrical Engineering University of Belgrade Serbia School of Computer Science Bina Nusantara University Indonesia Dept. of Information Security Norwegian University of Science and Technology Norway School of Computing Science University of Glasgow United Kingdom Graduate School of Business Stanford University United States Center for Augmented Intelligence Fondazione Bruno Kessler Italy

Personality computing is a field at the intersection of Personality Psychology and Computer science. Started in 2005, research in the field utilizes computational methods to understand and predict human personality traits. The expansion of the field has been very rapid and, by analyzing digital footprints (text, images, social media, etc.), it helped to develop systems that recognize and even replicate human personality. While offering promising applications in talent recruiting, marketing and healthcare, the ethical implications of Personality computing are significant. Concerns include data privacy, algorithmic bias, and the potential for manipulation by personality-aware Artificial Intelligence. This paper provides an overview of the field, explores key methodologies, discusses the challenges and threats, and outlines potential future directions for responsible development and deployment of Personality computing technologies. © 2025, CC BY-NC-ND.

关键词：

Statistical 3D Device Simulation of Full Fluctuations of Gate-All-Around Silicon Nanosheet MOSFETs at Sub-3-nm Technology Nodes

学校读者我要写书评

暂无评论

Statistical 3D Device Simulation of Full Fluctuations of Gat...

2022 International Symposium on VLSI Technology, Systems and Applications, VLSI-TSA 2022

作者： Kola, Sekhar Reddy Li, Yiming Chen, Chieh-Yang Chuang, Min-Hui National Yang-Ming Chiao Tung University Electrical Engineering and Computer Science International Graduate Program Hsinchu300 Taiwan National Yang-Ming Chiao Tung University Institute of Communications Engineering Hsinchu300 Taiwan National Yang-Ming Chiao Tung University Department of Electrical Engineering and Computer Engineering Hsinchu300 Taiwan National Yang-Ming Chiao Tung University Institute of Biomedical Engineering Hsinchu300 Taiwan National Yang-Ming Chiao Tung University Parallel and Scientific Computing Laboratory Hsinchu300 Taiwan

ISBN: (纸本)9781665409230

We for the first time study characteristic fluctuation of gate-all-around silicon nanosheet MOSFETs induced by random dopants fluctuation (RDF), interface trap fluctuation (ITF), and work function fluctuation (WKF), and their combinations. The explored devices affected by the WKF and its combination result in sizeable variability. Because of enigmatical interactions among the aforementioned random factors, overestimated variabilities occur if we only consider one random source each time, compared with the statistical 3D device simulation for full RDF, ITF and WKF at the same time. Notably, 10.78% and 103% overestimations are found for the threshold voltage and off-state current fluctuations. © 2022 IEEE.

关键词： Nanosheets

A Robust Key Exchange and Tamper-Resistant Protocol for HAN and NAN Networks in Smart Grids

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Ayub, Muhammad Faizan Li, Xiong Mahmood, Khalid Shamshad, Salman Das, Ashok Kumar Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China

Smart Grids (SG) rely on Home Area Networks (HAN) and Neighborhood Area Networks (NAN) to ensure efficient power distribution, real-time monitoring, and seamless communication between smart devices. Despite these advantages, the use of public communication channels in HAN and NAN networks introduces critical challenges, such as vulnerability to impersonation, physical tampering, and scalability issues in resource-constrained environments. These issues compromise the stability, reliability, and security of SG environments. Existing protocols often fail to adequately address these challenges, particularly in ensuring resistance to physical tampering of supply lines and impersonation attacks. Additionally, they struggle to minimize the computation, communication, and energy costs associated with securing a resource-constrained SG environment. Therefore, we propose a robust key exchange and tamper-resistant protocol for HAN and NAN networks to address these limitations. The proposed protocol leverages the Physical Unclonable Function (PUF) mechanism to offer physical tampering resistance to smart meters. We validate our protocol formally using the Random or Real (RoR) model, which confirms its security robustness. Additionally, our informal security analysis highlights the protocol's resilience against impersonation, physical tampering attacks, etc. We analyze and compare the performance of the proposed protocol, which further demonstrates our protocol's effectiveness and security compared to competing protocols. Moreover, the proposed protocol achieves resource efficiency with 45.99% and 58.85% substantial reductions in computation overhead and energy overhead, respectively, compared to competing protocols. These results showcase the protocol's enhanced security and practicality for resource-constrained SG environments. © 2014 IEEE.

关键词： Authentication Protocol