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

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Su, Hang Dong, Yinpeng Zhu, Jun Haibin, Ling Bo, Zhang Tsinghua National Lab for Information Science and Technology State Key Lab of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing China Department of Computer and Information Sciences Temple University United States

Exploring crowd dynamics is essential in understanding crowd scenes, which still remains as a challenging task due to the nonlinear characteristics and coherent spatio-temporal motion patterns in crowd behaviors. To address these issues, we present a Coherent Long Short Term Memory (cLSTM) network to capture the nonlinear crowd dynamics by learning an informative representation of crowd motions, which facilitates the critical tasks in crowd scene analysis. By describing the crowd motion patterns with a cloud of keypoint tracklets, we explore the nonlinear crowd dynamics embedded in the tracklets with a stacked LSTM model, which is further improved to capture the collective properties by introducing a coherent regularization term;and finally, we adopt an unsupervised encoder-decoder framework to learn a hidden feature for each input tracklet that embeds its inherent dynamics. With the learnt features properly harnessed, crowd scene understanding is conducted effectively in predicting the future paths of agents, estimating group states, and classifying crowd events. Extensive experiments on hundreds of public crowd videos demonstrate that our method is state-of-theart performance by exploring the coherent spatiotemporal structures in crowd behaviors.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Optimizing Multi-Hop Quantum Communication using Bidirectional Quantum Teleportation Protocol

arXiv

引用

arXiv 2025年

作者： Ikken, N. Kumar, P. Slaoui, A. Kar, B. Laamara, R. Ahl Almousa, M. El-Latif, A.A. Abd LPHE-Modeling and Simulation Faculty of Sciences Mohammed V University Rabat Morocco Department of Computer Science and Information Engineering National Taiwan University of Science and Technology Taipei Taiwan Centre of Physics and Mathematics CPM Faculty of Sciences Mohammed V University in Rabat Rabat Morocco EIAS Data Science Lab College of Computer and Information Sciences Center of Excellence in Quantum and Intelligent Computing Prince Sultan University Riyadh11586 Saudi Arabia Department of Information Technology College of Computer and Information Sciences Princess Nourah bint Abdulrahman University Riyadh11671 Saudi Arabia Department of Mathematics and Computer Science Faculty of Science Menoufia University Shebin El-Koom32511 Egypt

In this paper, we introduce a new method for Bidirectional Quantum Teleportation called Bidirectional Quantum Teleportation using the Modified Dijkstra Algorithm and Quantum Walk (BQT-MDQW). This method uses different types of entangled states, such as the GHZ-Bell state, W-Bell state, and Cluster-Bell state, to improve quantum communication in multi-hop quantum wireless networks. We focus on the W-Bell state and compare the quantum Dijkstra algorithm with the classical Dijkstra method to see which one works better. We apply both versions to quantum and classical simulators, measuring their performance through fidelity, memory utilization, and throughput calculations. Our results show that the shortest path problem may be solved with significantly reduced computer complexity using the quantum Dijkstra algorithm based on quantum walks. The introduction of a quantum walk, which permits dynamic transitions between quantum channels and the effective exploration of quantum network states, is an important part of the protocol. Using the capacity of the quantum walk to adjust to changing quantum states, we also introduce a method for successfully identifying unitary matrices under varying quantum channels. The bidirectional teleportation structure of the protocol is designed to solve the multi-hop teleportation problem in quantum wireless networks. In addition, we present quantum Dijkstra’s algorithm, which uses quantum gates to significantly decrease computational complexity and solve the networking problem by building on the quantum walk framework. This method shows how quantum computing may be used to solve arbitrary optimization issues such as the shortest path problem. Finally, we present a novel multi-hop quantum teleportation system encompassing both unidirectional and bidirectional communication, as introduced in the quantum Dijkstra algorithm system. This system significantly enhances communication in quantum networks by enabling efficient and reliable information

关键词： Quantum channel

来源：评论

学校读者我要写书评

暂无评论

Lifespan music training experience changes duration and transition rates of EEG microstates related to working memory

引用

Brain-Apparatus Communication: A Journal of Bacomics 2025年第1期4卷

作者： Yan Li Sijia Guo Jiaxian Chen Liangfeng Feng Haoyu Bian Yuxin Chen Hua Yang Jing Lu a The Clinical Hospital of Chengdu Brain Science Institute MOE Key Lab for Neuroinformation University of Electronic Science and Technology of China Chengdu Chinab School of Life Science and Technology Center for Information in Medicine University of Electronic Science and Technology of China Chengdu China a The Clinical Hospital of Chengdu Brain Science Institute MOE Key Lab for Neuroinformation University of Electronic Science and Technology of China Chengdu Chinac School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China d Department of Composition Sichuan Conservatory of Music Chengdu Chinae Key Laboratory for Music Digital Intelligence of Sichuan Sichuan Conservatory of Music Chengdu China

ObjectiveAging-related compensatory scaffolding has been suggested to appear in the prefrontal regions in response to challenges posed by declines in working memory and inhibitory control associated with age. Although the potential mechanism of music intervention in cognitive aging is unclear, its effectiveness in interfering with executive function has been widely proven. A reasonable hypothesis is that music intervention alleviates cognitive aging by affecting compensatory scaffolding related to the prefrontal *** recruited three groups of participants: young control, old control, and old musicians, and calculated EEG microstate parameters. We used the classic N-back paradigm to examine subjects’ working memory performance. We also correlated the results of EEG microstates with behavioral *** found a decrease in the duration of microstate D (which has a frontal-central maximum) in all old subjects, which was related to poorer working memory performance. Meanwhile, old musicians benefit from lifespan music training experience and exhibit an opposite alleviating trend to the age effect in this outcome. We also found changes in the transition rate between *** results reflect the compensatory scaffolding of the prefrontal regions for other system functions in the process of music intervention in cognitive aging.

关键词： Music training cognitive aging working memory EEG microstate

来源：评论

学校读者我要写书评

暂无评论

Probing quantum causality with geometric asymmetry in spatial-temporal correlations

引用

science China(Information sciences) 2024年第9期67卷 294-305页

作者： Yu MENG Zheng-Hao LIU Zhikuan ZHAO Peng YIN Yi-Tao WANG Wei LIU Zhi-Peng LI Yuan-Ze YANG Zhao-An WANG Jin-Shi XU Shang YU Jian-Shun TANG Chuan-Feng LI Guang-Can GUO CAS Key Laboratory of Quantum Information University of Science and Technology of China CAS Center for Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Department of Computer Science Eidgen?ssische Technische Hochschule Zürich Hefei National Laboratory Department of Physics Imperial College London Research Center for Quantum Sensing Zhejiang Lab

Causation promotes the understanding of correlation to an advanced stage by elucidating its underlying mechanism. Although statisticians have specified the possible causal relations among correlations,inferring causal structures is impossible from only the observed correlations in the classical world. Quantum correlations encapsulating the most defining aspects of quantum physics have taken a new turn for the causal inference problem — the two-point spatial and temporal quantum correlations with observationally discernible characteristics correspond exactly to the two most basic causal structures. However, a direct causal interpretation for quantum correlations has only been established in very limited cases. Here, we explore to what extent quantum correlations promote causal inference. Theoretically, we have found that the distinguishable causal regime of two-point Pauli correlations can be expanded from a single value to an asymmetric interval, and the causal structures determining the quantum correlations can be interpreted by a simple distance criterion. Experimentally, we have devised and implemented a versatile non-unital quantum channel in an optical architecture to directly observe such an asymmetric interval. The setup enabled quantum causal inference without any requirement of active intervention, which is impossible in the classical realm. Our work facilitates the identification of causal links among quantum variables and provides insight into characterizing causation and spatial-temporal correlation in quantum mechanics.

关键词： causality quantum information quantum channel channel-state duality non-unital channel

来源：评论

学校读者我要写书评

暂无评论

Online crowdsourced truck delivery using historical information

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2022年第2期301卷 486-501页

作者： Zhang, Huili Luo, Kelin Xu, Yao Xu, Yinfeng Tong, Weitian [a]School of Management Xi’an Jiaotong University and State Key Lab for Manufacturing Systems Engineering Xi’an 710049 China [b]Department of Mathematics and Computer Science Eindhoven University of Technology Eindhoven the Netherlands [c]Department of Computer Science Georgia Southern University Statesboro GA 30458 USA

Various crowdsourced logistics platforms are forming rapidly along with the booming mobile Internet. Motivated by modern crowdsourced truck logistics platforms, we introduce the online crowdsourced truck delivery (OCTD) problem and reformulate it as the online bipartite hyper-matching problem. We then explore the possibility of accommodating historical information to design efficient online algorithms to serve online orders. To the best of our knowledge, it is the first work on incorporating historical information to solve the online bipartite hyper-matching problem. Depending on whether orders can be partially served, we investigate two practical situations, i.e. separable and inseparable cases. For the inseparable case, we propose a randomized online algorithm, named HYPER-MATCHING , whose competitive ratio is a non-decreasing function of the amount of historical information. For the separable case, we modify HYPER-MATCHING to present another randomized online algorithm, named SEPARABLE-HYPER-MATCHING . It is worth noting that the competitive ratios of HYPER-MATCHING and SEPARABLE-HYPER-MATCHING either beat or match the current best online algorithms when no historical information is considered. We then present four computationally efficient heuristic algorithms, including a greedy variant and a batch processing variant for each of the inseparable and separable cases. We perform a sequence of experiments using synthetic and real-world datasets, with an emphasis on the influence that historical information has on algorithm performance. The experiment results demonstrate the effectiveness of our algorithms and particularly the positive influence of historical information on our algorithms.(c) 2021 Elsevier B.V. All rights reserved.

关键词： Transportation Online crowdsourced truck delivery Online bipartite hyper-matching Random order model Historical information

来源：评论

学校读者我要写书评

暂无评论

Termination of programs over the union of intervals

Termination of programs over the union of intervals

引用

2010 3rd International Conference on Advanced computer Theory and Engineering, ICACTE 2010

作者： Mu, Lin Jin, Taige Li, Yi Luo, Jiawei Laboratory for Automated Reasoning and Programming Chengdu Inst. of Computer Application CAS Chengdu China Lab. of CRTC University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9781424465408

For a generic loop: while (constraints) {updates} it is well known that the termination problem is undecidable in general, even for a simple class of polynomial programs. If the constraints or the updating function in the above loop is not linear, the loop is called nonlinear. In this paper, we investigate how to solve the termination of the above loop by deciding whether a fixed point exists, when the constraints are the union of intervals and the updating functions are polynomials. Furthermore, when all fixed points are on the boundaries of the union of intervals, we also establish a corresponding necessary and sufficient condition of nonterm in at ion. © 2010 IEEE.

关键词： Nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

MeatSpec: Enabling Ubiquitous Meat Fraud Inspection through Consumer-Level Spectral Imaging 24

MeatSpec: Enabling Ubiquitous Meat Fraud Inspection through ...

引用

30th International Conference on Mobile Computing and Networking, ACM MobiCom 2024

作者： Hu, Haiyan Zhu, Yinan Yang, Baichen Kang, Hua Chen, Shanwen Zhang, Qian Department of Computer Science and Engineering The Hong Kong University of Science and Technology Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong Noah s Ark Lab HUAWEI China

ISBN: (纸本)9798400704895

Meat adulteration is a significant problem that can pose health risks economic losses to consumers. Current detection methods are hindered by high costs, limited capabilities, or time-consuming sample preparation, making them only accessible in laboratory tests and can not protect the safety of end-users. This paper introduces MeatSpec, a low-cost and user-friendly system for detecting meat adulteration using spectral imaging, to move the adulteration inspection out of laboratories. MeatSpec employs a multispectral camera to reduce costs while quickly capturing spectral images, but this leads to a decrease in spectral resolution and coverage. To solve this challenge, the system uses spectral reconstruction technology and innovative designs tailored for meat adulteration detection. This includes involving adulteration-related prior information during the reconstruction training phase and incorporating contrastive learning to enlarge the distances among reconstructed samples belonging to various adulteration types. Additionally, we devise distinct feature extractors for different bands based on characteristics of the reconstructed spectra and employ knowledge distillation to mitigate error in full-band reconstructed spectra while capturing features related to adulteration. Experimental evaluations on 347 paired spectral images demonstrate that our system achieves a 91.06% accuracy in detecting multiple adulteration types, merely 7.78% inferior to the expensive professional solution, yet 21.58% superior to the baseline at the same price point. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Health risks

来源：评论

学校读者我要写书评

暂无评论

A proof-theoretic approach to logic programming. I. Clauses as rules

引用

Journal of Logic and Computation 1990年第2期1卷 261-283页

作者： Hallnäs, Lars Schroeder-Heister, Peter Programming Methodology Group Department of Computer Science Chalmers University of Technology Sweden Universität Tubingen 7400 Tubingen FRG Germany University of Göteborg 412 96 Goteborg Sweden

In this paper definite Horn clause programs are investigated within a proof-theoretic framework;program clauses being considered rules of a formal system. Based on this approach, the soundness and completeness of SLD-resolution is established by purely proof-theoretic methods. Extended Horn clauses are defined as rules of higher levels and related to an approach based on implication formulae in the bodies of clauses. In a further extension, which is treated in Part II of this series, program clauses are viewed as clauses in inductive definitions of atoms, justifying an additional inference schema: a reflection principle that roughly corresponds to interpreting the program clauses as introduction rules in the sense of natural deduction. The evaluation procedures for queries with respect to the defined extensions of definite Horn clause programs are shown to be sound and complete. The sequent calculus with the general elimination schema even permits the introduction of a genuine notion of falsity which is not defined via a meta-rule. © 1990 Oxford University Press.

关键词： Inductive definition Logic programming Proof theory Rule

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Computation Overhead of Paillier Encryption in Vertical Federated Learning 5

Evaluation of Computation Overhead of Paillier Encryption in...

引用

5th IEEE India Council International Subsections Conference, INDISCON 2024

作者： Abhinand, P. Paul, Tomsy Santhosh Kumar, G. Cochin University of Science and Technology Cyber Physical Systems Lab Department of Computer Science Kochi India

ISBN: (纸本)9798350376753

Paillier Encryption is one of the most commonly used Partially Homomorphic Encryption (PHE) techniques. Since it is additive and also faster compared with fully homomorphic techniques, it is used extensively in Vertical Federated Learning (VFL) where encryption is required to secure the exchange of gradients and partial results between parties. However, the computation associated with Paillier encryption is very huge. We present its computation overhead in the context of VFL for various machine learning models. Specifically, we find the number of encryption/decryption and homomorphic operations such as addition and scalar multiplication required in various machine learning models and the time of execution associated with each. We see that as the number of iterations increases, these operations have a severe impact on the total time for learning. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A Stacked Ensemble Approach for Enhancing Anti Cancer Drug Synergy Prediction 2

A Stacked Ensemble Approach for Enhancing Anti Cancer Drug S...

引用

2nd International Conference on Machine Learning and Data Engineering, ICMLDE 2023

作者： Hafsath, C.A. Jereesh, A.S. Bio-informatics Lab Department of Computer Science Cochin University of Science and Technology Kerala 682022 India

Combinations of drugs have demonstrated potential therapeutic results in controlling the progression of cancer, with a possible decrease in toxicity and unfavorable side efects. Experimental screening is no longer feasible due to the vast number of possible medication combinations. As a result, the scientific community is becoming more and more interested in creating computational models that can quickly and precisely identify prospective drug combinations. Our methodology employs therapeutically significant drugs and cell line properties in machine learning techniques. Our suggested stacked machine learning model outperforms all other machine learning models taken into consideration. It employs Random Forest and XGBoost as base learners and Logistic Regression as a meta learner. The results of our research underscore the remarkable efficacy of our approach. Not only does it address the complexities of the task at hand, but it also showcases its potential to enhance predictive accuracy within this domain. The comparative analysis reveals that our model exhibits a noteworthy performance improvement across multiple evaluation metrics. Our findings represent a significant step forward in the quest for improved cancer treatment strategies. © 2024 Elsevier B.V.. All rights reserved.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：