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

3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks

作者： Zhang, Junping Shen, Chao Feng, Jufu Shanghai Key Laboratory of Intelligent Information Processing Department of Computer Science and Engineering Fudan University Shanghai 200433 China Key Laboratory of Complex Systems and Intelligence Science Institute of Automation Chinese Academy of Sciences Beijing 100080 China National Key Laboratory for Machine Perception School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

ISBN: (纸本)354034439X

While manifold learning algorithms can discover intrinsic low-dimensional manifold embedded in the high-dimensional Euclidean space, the discriminant ability of the low-dimensional subspaces obtained by the algorithms is often lower than those obtained by the conventional dimensionality reduction approaches. Furthermore, the original feature vectors may include redundancy such as high-order correlation which cannot be removed by manifold learning algorithms. To address the two problems, we first employ Gabor wavelet to remove intrinsic redundancies of images and obtain a set of over-completed feature vectors. Then a supervised manifold learning algorithm (ULLELDA) is applied to project Gabor-based data and out-of-the-samples into a common low-dimensional subspace. Experiments in two FERET face databases indicate that Gabors indeed help supervised manifold learning to remarkably improve the discriminant ability of low-dimensional subspaces. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Link Prediction in a Modified Heterogeneous Bibliographic Network

Link Prediction in a Modified Heterogeneous Bibliographic Ne...

引用

International Conference on Advances in Social Network Analysis and Mining, ASONAM

作者： John Boaz Lee Henry Adorna Department of Information Systems and Computer Science Ateneo de Manila University Philippines Algorithms and Complexity Laboratory Department of Computer Science University of the Philippines Diliman Philippines

Researchers have discovered, in recent years, the advantages of modeling complex systems using heterogeneous information networks. These networks are comprised of heterogeneous sets of nodes and edges that better represent the different entities and relationships often found in the real world. Although heterogeneous networks provide a richer semantic view of the data, the added complexity makes it difficult to directly apply existing techniques that work well on homogeneous networks. In this paper, we propose a graph modification process that alters an existing heterogeneous bibliographic network into another network, with the purpose of highlighting the important relations in the bibliographic network. Several importance scores, some adopted from existing work and others defined in this work, are then used to measure the importance of links in the modified network. The link prediction problem is studied on the modified network by implementing a random walk-based algorithm on the network. The importance scores and the structure of the modified graph are used to guide a random walker towards relevant parts of the graph, i.e. towards nodes to which new links will be created in the future. The different properties of the proposed algorithm are evaluated experimentally on a real world bibliographic network, the DBLP. Results show that the proposed method outperforms the state-of-the-art supervised technique as well as various approaches based on topology and node attributes.

关键词： Prediction algorithms Frequency measurement Weight measurement Joining processes computer science Buildings Social network services

来源：评论

学校读者我要写书评

暂无评论

Recent trends in chip-level design automation for digital microfluidic biochips

Recent trends in chip-level design automation for digital mi...

引用

International Symposium on Integrated Circuits (ISIC)

作者： Sudip Roy Chi-Ruo Wu Tsung-Yi Ho Department of Computer Science & Information Engineering National Cheng Kung University Electronic Design Automation Laboratory Taiwan

In recent years, digital microfluidic (DMF) biochips have become the most popular and emerging technology for implementing a wide range of biochemical laboratory protocols on a small hand-held device. Due to its high-throughput, high-sensitivity, automatic control, and low cost, DMF biochips are now being considered for several real-life applications like on-chip diagnosis of various cardiovascular diseases, cancer, diabetes, HIV/AIDS and others. As the complexity of biochemical assay increases, powerful computer-aided-design tools are needed for developing DMF biochips. This paper presents an overview of recent research trends in the chip-level design of DMF biochips.

关键词： Electrodes Routing Wires design automation Pins Optimization Reliability

来源：评论

学校读者我要写书评

暂无评论

Distributed Flow Shop Scheduling with Sequence-Dependent Setup Times Using an Improved Iterated Greedy Algorithm

引用

Complex System Modeling and Simulation 2021年第3期1卷 198-217页

作者： Xue Han Yuyan Han Qingda Chen Junqing Li Hongyan Sang Yiping Liu Quanke Pan Yusuke Nojima the School of Computer Science Liaocheng UniversityLiaocheng 252000China the State Key Laboratory of Synthetical Automation for Process Industries Northeastern UniversityShenyang 110819China the School of Information Science and Engineering Shandong Normal UniversityJinan 252000China the College of Computer Science and Electronic Engineering Hunan UniversityChangsha 410082China the School of Mechatronic Engineering and Automation Shanghai UniversityShanghai 200072China the Department of Computer Science and Intelligent Systems Osaka Prefecture UniversityOsaka 599-8531Japan

To meet the multi-cooperation production demand of enterprises,the distributed permutation flow shop scheduling problem(DPFSP)has become the frontier research in the field of manufacturing *** this paper,we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup *** solve DPFSPs,significant developments of some metaheuristic algorithms are *** this context,a simple and effective improved iterated greedy(NIG)algorithm is proposed to minimize makespan in *** to the features of DPFSPs,a two-stage local search based on single job swapping and job block swapping within the key factory is designed in the proposed *** compare the proposed algorithm with state-of-the-art algorithms,including the iterative greedy algorithm(2019),iterative greedy proposed by Ruiz and Pan(2019),discrete differential evolution algorithm(2018),discrete artificial bee colony(2018),and artificial chemical reaction optimization(2017).Simulation results show that NIG outperforms the compared algorithms.

关键词： distributed permutation flow shop iterated greedy local search swapping strategy

来源：评论

学校读者我要写书评

暂无评论

Joining Edge-Enabled Metaverse Services with Network Externality: A Stackelberg Game Approach

Joining Edge-Enabled Metaverse Services with Network Externa...

引用

2023 IEEE International Conference on Metaverse Computing, Networking and Applications, MetaCom 2023

作者： Jiang, Yuna Kang, Jiawen Niyato, Dusit Ge, Xiaohu Xiong, Zehui Xu, Minrui Deng, Ruilong Huazhong University of Science and Technology School of Electronic Information and Communications Wuhan China Guangdong University of Technology School of Automation Guangzhou China Nanyang Technological University School of Computer Science and Engineering Singapore Singapore University of Technology and Design Pillar of Information Systems Technology and Design Singapore Zhejiang University State Key Laboratory of Industrial Control Technology Hangzhou China Shenzhen Huazhong University of Science and Technology Research Institute China

ISBN: (纸本)9798350333336

The metaverse is defined as a three-dimensional virtual-real fusion network focused on social connection. Edge computing can empower the metaverse by providing computing resources to realize real-time motion tracking, visual or auditory rendering and virtual scene dynamic change at the edge of networks. Users enjoy the immersive experience provided by the Metaverse Service Provider (MSP), and interact through digital avatars in the virtual world by requesting metaverse services. In this paper, we formulate the edge computing resources pricing, metaverse service rendering bitrate pricing and request problem in the metaverse. Especially, we model the interactions among edge servers, the MSP and Metaverse Service Users (MSUs) as a hierarchical three-stage Stackelberg game. The problem of joining edge-enabled metaverse services is also studied with the consideration of network externality, including the network effect and congestion effect. Based on the backward induction method, we derive the optimal computing resources pricing of edge servers, rendering bitrate pricing of the MSP, and rendering bitrate requests of MSUs. We also prove the existence and uniqueness of the Stackelberg game equilibrium. Simulation results show that the network effect can bring more positive utilities to entities when the social tie coefficient among MSUs is higher. Besides, all entities in the edge-enabled metaverse are affected negatively by the congestion effect. © 2023 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization for Vehicular Cooperative Sensing: A Graph Attention Based Reinforcement Learning Approach

Performance Optimization for Vehicular Cooperative Sensing: ...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Li, Xuefei Chen, Mingzhe Liu, Danpu Zhang, Zhilong Quek, Tony Q. S. Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL33146 United States Information Systems Technology and Design Pillar Singapore University of Technology and Design 487372 Singapore

ISBN: (纸本)9798350351255

In this paper, the problem of collaborative vehicle sensing is investigated. In the considered model, a set of cooperative vehicles provide sensing information to sensing request vehicles with limited sensing and communication resources. A base station (BS) determines the subset of sensing request vehicles that each cooperative vehicle will serve and the sub-regions that each cooperative vehicle will detect. We formulate an optimization problem aiming to maximize the number of successfully detected sub-regions of sensing request vehicles while satisfying the cooperative sensing energy requirement by jointly determining the cooperative vehicle association and the sensing sub-region selection. To solve this problem, we propose a graph attention based reinforcement learning (RL) algorithm that can generate the graph information vectors based on the correlation between each cooperative vehicle and each sensing request vehicle. Using the learned graph information, the joint cooperative vehicle association and sensing sub-region selection strategy will be determined. Simulation results show that the proposed scheme can improve the number of successfully detected sub-regions of sensing request vehicles by up to 12.5% compared to the conventional RL algorithm without using graph attention networks (GANs). © 2024 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

How to design a R-D Model for UAV Video Transmission? 15

How to Design a R-D Model for UAV Video Transmission?

引用

15th IEEE International Conference on Wireless Communications and Signal Processing, WCSP 2023

作者： Yu, Zongyang Yang, Peng Cao, Xianbin Zheng, Dezhi Quek, Tony Q. S. Oliver Wu, Dapeng Beihang University School of Electronic Information Engineering Beijing China Peng Cheng Laboratory Department of Mathematics and Theories Shenzhen China Beijing Institute of Technology Advanced Research Institute of Multidisciplinary Sciences Beijing China Singapore University of Technology and Design Information Systems Technology and Design Singapore City University of Hong Kong Department of Computer Science Kowloon Hong Kong

ISBN: (纸本)9798350324662

Unmanned aerial vehicle (UAV) video transmission has been extensively applied in many crucial fields. However, the problem of designing a rate-distortion (R-D) model for UAV video transmission, which is essential for theoretical analysis of video coding and optimization of video transmission quality, is under-studied. The designed R-D model is desired to be simple, accurate, and generic owing to the limited capability of the UAV. Observing the key role of transformed residuals in the R-D model, this paper elaborately discusses the modeling of the transformed residual distribution and proposes an estimation algorithm to estimate the statistical parameter of the distribution. Specifically, considering the stringent requirements for low complexity and high generalization capability, we first design a linear parameter estimator by mining and analyzing UAV video statistical characteristics. Further, we develop a bias update scheme to improve the accuracy of the estimator. Test results on multiple real video sequences taken by UAVs show that the proposed estimation algorithm is more accurate than benchmarks. © 2023 IEEE.

关键词： expectation maximization algorithm R-D model rate control video coding Video transmission

来源：评论

学校读者我要写书评

暂无评论

3D R Transform on Spatio-Temporal Interest Points for Action Recognition

3D R Transform on Spatio-Temporal Interest Points for Action...

引用

IEEE Conference on computer Vision and Pattern Recognition

作者： Chunfeng Yuan Xi Li Weiming Hu Haibin Ling Stephen Maybank National Laboratory of Pattern Recognition Institute of Automation School of Computer Science University of Adelaide Department of Computer and Information Sciences Temple University School of Computer Science and Information Systems Birkbeck College

ISBN: (纸本)9781467364102

Spatio-temporal interest points serve as an elementary building block in many modern action recognition algorithms, and most of them exploit the local spatio-temporal volume features using a Bag of Visual Words (BOVW) representation. Such representation, however, ignores potentially valuable information about the global spatio-temporal distribution of interest points. In this paper, we propose a new global feature to capture the detailed geometrical distribution of interest points. It is calculated by using the R transform which is defined as an extended 3D discrete Radon transform, followed by applying a two-directional two-dimensional principal component analysis. Such R feature captures the geometrical information of the interest points and keeps invariant to geometry transformation and robust to noise. In addition, we propose a new fusion strategy to combine the R feature with the BOVW representation for further improving recognition accuracy. We utilize a context-aware fusion method to capture both the pairwise similarities and higher-order contextual interactions of the videos. Experimental results on several publicly available datasets demonstrate the effectiveness of the proposed approach for action recognition.

关键词： BOVW points keeps ROENTGEN Recognition (Psychology) fusion method Transform Bag device

来源：评论

学校读者我要写书评

暂无评论

Learning with only multiple instance positive bags

Learning with only multiple instance positive bags

引用

2016 International Joint Conference on Neural Networks, IJCNN 2016

作者： Wang, Zhigang Zhao, Zengshun Zhang, Changshui Computer and Communication Engineering School Tianjin University of Technology Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology China Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education China College of Electronics Communication and Physics Shandong University of Science and Technology China Automation Department Tsinghua University State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology China

ISBN: (纸本)9781509006199

In traditional multiple instance learning (MIL), both positive and negative bags are required to learn a prediction function. However, a high human cost is needed to know the label of each bag - positive or negative. Only positive bags contain our focus (positive instances) while negative bags consist of noise or background (negative instances). So we do not expect to spend too much to label the negative bags. Contrary to our expectation, nearly all existing MIL methods require enough negative bags besides positive ones. In this paper we propose an algorithm called 'Positive Multiple Instance' (PMI), which learns a classifier given only a set of positive bags. So the annotation of negative bags becomes unnecessary in our method. PMI is constructed based on the assumption that the unknown positive instances in positive bags be similar each other and constitute one compact cluster in feature space and the negative instances locate outside this cluster. The experimental results demonstrate that PMI achieves the performances close to or a little worse than those of the traditional MIL algorithms on benchmark and real data sets. However, the number of training bags in PMI is reduced significantly compared with traditional MIL algorithms. © 2016 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reducing stick-slip motion in one-dimensional nano manipulation by real-time feedback control

Reducing stick-slip motion in one-dimensional nano manipulat...

引用

2010 10th IEEE Conference on Nanotechnology, NANO 2010

作者： Zhang, Jing Miao, Lei Wu, Re-Bing Xi, Ning Li, Chun-Wen Wang, Yue-Chao Tarn, Tzyh-Jong Department of Automation Tsinghua University Beijing 100084 China Center for Quantum Information Science and Technology Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Beijing 110016 China Department of Electrical and Computer Engineering Michigan State University East Lansing MI 48824 United States Department of Electrical and Systems Engineering Washington University St. Louis MO 63130 United States

ISBN: (纸本)9781424470334

When a micro cantilever with a nanoscale tip is manipulated on a substrate with atomic roughness, e.g., pushing an atomic-scale sample or etching the surface of the substrate to draw desired patterns, the periodical lateral frictional forces with stochastic fluctuations will induce stick-slip motion of the cantilever tip, which may greatly influence the precision of the nano manipulation. To reduce such a stick-slip motion, we propose a feedback control strategy based on the position estimation of the cantilever tip to compensate the periodical frictional force. Numerical simulations show that the motion of the cantilever tip under feedback control can track the desired trajectory asymptotically. Our proposal can aL be extended to the case when the cantilever tip moves over a Gaussian-shape defection on the substrate and when the stochastic fluctuations in the lateral force are with non-zero correlation time. ©2010 IEEE.

关键词： Feedback control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：