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

12th Chinese Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2017

作者： Lin, Dazhen Li, Lingxiao Cao, Donglin Li, Shaozi Cognitive Science Department Xiamen University Xiamen China Fujian Key Laboratory of Brain-inspired Computing Technique and Applications Xiamen University Xiamen China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou China

ISBN: (纸本)9781450353526

We address the challenge of multi-modal sentiment analysis. To solve the problem of the sentiment correlations among different modalities, we propose a Multi-modal Correlation Model (MCM). In contrast to other methods, MCM considers the hierarchical sentiment correlations among modalities. Specifically, a probabilistic graphical model (PGM) is subsequently built upon the proposed MCM model, which considers the correlations and simultaneously preserves the classification ability of each modality. In order to compute the posterior probabilities of sentiments in PGM, we optimize the model by Maximum Likelihood Estimation. Experimental results show that MCM achieves accuracy of 84.2% and beats existing multi-modal methods with 1.2-4% improvement. Results demonstrate: 1) the sentiment correlations among modalities are hierarchical;2) the importance of the correlations for multi-modal sentiment analysis. © 2017 Association for computing Machinery.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

A throughput aware with collision-free MAC for wireless LANs

引用

Science China(information Sciences) 2016年第2期59卷 240-242页

作者： Tingrui PEI Yafeng DENG Zhetao LI Gengming ZHU Gaofeng PAN Youngjune CHOI Hiroo SEKIYA College of Information Engineering Xiangtan University Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan University School of Computer Science & Engineering Hunan University of Science and Technology School of Electronic and Information Engineering Southwest University Department of Information and Computer Engineering Ajou University Graduate School of Advanced Integration Science Chiba University

Dear editor,The Carrier Sense Multiple Access with Collision Avoidance(CSMA/CA)hybrid with the resource reservation approach from Time Division Multiple Address(TDMA)has been emerged as a promising method to solve collision problems in wireless LANs[1–6].In the hybrid method,a TDMA circle contains multiple slots for nodes to contend for the ***,it allows a

关键词： MAC CSCF free TDMA A throughput aware with collision-free MAC for wireless LANs

来源：评论

学校读者我要写书评

暂无评论

A Fine Segmentation Method for the Outer Boundary of Tire Image Steel Belt Based on Adaptive Thresholding Under Local Histogram Statistical Features

A Fine Segmentation Method for the Outer Boundary of Tire Im...

引用

International Conference on Image, Vision and intelligent Systems, ICIVIS 2023

作者： Liu, Hua Li, Nan Hao, Jinyi Xia, Yingjie Li, Jinping School of Information Science and Engineering University of Jinan Jinan250022 China Shandong Provincial Key Laboratory of Network-Based Intelligent Computing University of Jinan Jinan250022 China Shandong College and University Key Laboratory of Information Processing and Cognitive Computing in 13th Five-Year Jinan250022 China

ISBN: (纸本)9789819708543

The accuracy of defect detection in various locations is directly affected by the influence of precise segmentation of radial tire images. As the need for high-quality tires has grown, so has interest in the steel belt region. This region contains a diversity of textures and is impacted by shadows, and only a rough segmentation of this region has been achieved in the available literature, but this is interfered with by other areas, resulting in unsatisfactory defect detection in this region. As a result, we present a fine segmentation method for boundary mutation that takes advantage of the projection property of the local narrow window. First, the histogram adhesion change detection algorithm is designed;next, the narrow sliding window’s histogram peak width change algorithm is designed;finally, a wide sliding window is used for vertical projection, and the absolute value of the histogram change rate at the boundary is designed to maximize the algorithm. To calculate the outside boundary of the steel belt, the difference between the three sets of coordinates is kept within a specific error range. The detection was performed on 1,000 self-constructed data sets, with an accuracy rate of 94% and a detection speed of 0.1 s The experiments show that the algorithm can segment the steel belt’s outer boundary more finely and robustly, and it has a strong segmentation effect for images with a near texture angle and tire sidewall cord angle. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning based intelligent Routing for Multi-service Traffic SDN 5

Deep Reinforcement Learning based Intelligent Routing for Mu...

引用

5th International Academic Exchange Conference on Science and Technology Innovation, IAECST 2023

作者： Wang, Lingjiao Li, Jiachen Xiang Tan University Key Laboratory of Intelligent Computing and Information Processing Ministry of Education China Xiang Tan University School of Automation and Electronic Information China

ISBN: (纸本)9798350357738

The development of network has imposed higher requirements on QoS (Quality of Service) for routing, and the emergence of traffic classification techniques, software defined networking (SDN), and programmable network devices has made it possible to quickly identify user needs and route for service traffic requirements. Deep reinforcement learning routing algorithms for existing QoS compliant routing algorithms perform poorly in terms of generalizability. A deep graph reinforcement learning intelligent routing algorithm DDGL applied to SDN scenarios is proposed, which uses GNN to extract the link feature information of SDN data plane for deep reinforcement learning routing decision making, and comprehensively takes into account the performance metrics such as latency, packet loss, throughput, and bandwidth, to improve the algorithm generalization ability and enhance the SDN routing performance. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Super-Resolution of Defocus Thread Image Based on Cycle Generative Adversarial Networks 12th

Super-Resolution of Defocus Thread Image Based on Cycle Gene...

引用

12th IFIP TC 12 International Conference on intelligent information processing, IIP 2022

作者： Jiang, Pengfei Xu, Wangqing Li, Jinping School of Information Science and Engineering University of Jinan Jinan250022 China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan250022 China Shandong College and University Key Laboratory of Information Processing and Cognitive Computing in 13th Five-Year Jinan250022 China

ISBN: (纸本)9783031039478

The dual camera calibration measurement method can realize low-cost and high-precision bolt dimension measurement by using two microscope cameras. But the height difference between the thread crest and root exceeds the depth of field, and the thread image becomes defocus, which seriously affects the measurement accuracy. For this reason, a super-resolution method for defocus thread image based on cyclic generative adversarial networks is proposed. We collected focus thread images and defocus thread images as training data. Two encoders are used in the generation network to extract image defocus features and content features. And a sub-pixel convolution layer is added to the decoder to achieve image super-resolution. A loss function based on adversarial loss and cycle-consistent loss is constructed to realize unsupervised training of the network, thereby achieve super-resolution of defocus thread images. The experimental results show that, in the simulated defocus images, the method has superiority in image detail preservation, sharpness improvement and peak signal to noise ratio. In the bolt dimension measurement task, it can effectively reconstruct the clear thread image and thus provide the measurement accuracy to 0.01 mm. © 2022, IFIP International Federation for information processing.

关键词： Optical resolving power

来源：评论

学校读者我要写书评

暂无评论

Runtime model based approach to IoT application development

引用

Frontiers of Computer Science 2015年第4期9卷 540-553页

作者： Xing CHEN College of Mathematics and Computer Science Fuzhou University Fuzhou 350116 China Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Fuzhou 350116 China Key Laboratory of High Confidence Software Technologies (Ministry of Education) Beijing 100871 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

The internet of things （loT） attracts great interest in many application domains concerned with monitoring and ：ontrol of physical phenomena. However, application devel- opment is still one of the main hurdles to a wide adoption of IoT technology. Application development is done at a low level, very close to the operating system and requires pro- grammers to focus on low-level system issues. The under- lying APIs can be very complicated and the amount of data collected can be huge. This can be very hard to deal with as a developer. In this paper, we present a runtime model based approach to IoT application development. First, the manage- ability of sensor devices is abstracted as runtime models that are automatically connected with the corresponding systems. Second, a customized model is constructed according to a personalized application scenario and the synchronization be- tween the customized model and sensor device runtime mod- els is ensured through model transformation. Thus, all the application logic can be carried out by executing programs on the customized model. An experiment on a real-world ap- plication scenario demonstrates the feasibility, effectiveness, and benefits of the new approach to IoT application develop- ment.

关键词： IoT application development software architec-ture models at runtime

来源：评论

学校读者我要写书评

暂无评论

A direct product decomposition of QMV algebras

引用

Science China Mathematics 2012年第4期55卷 841-850页

作者： LU Xian 1 ,SHANG Yun 1,& LU RuQian 1,2 1 Institute of Mathematics,Academy of Mathematics and Systems Science,Beijing 100190,China 2 key laboratory of intelligent information processing,Institute of computing Technology,Chinese Academy of Sciences,Beijing 100190,China 1. Institute of Mathematics Academy of Mathematics and Systems Science Beijing 100190 China2. Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

We study the direct product decomposition of quantum many-valued algebras (QMV algebras) which generalizes the decomposition theorem of ortholattices (orthomodular lattices).In detail,for an idempo- tent element of a given QMV algebra,if it commutes with every element of the QMV algebra,it can induce a direct product decomposition of the QMV *** the same time,we introduce the commutant C(S) of a set S in a QMV algebra,and prove that when S consists of idempotent elements,C(S) is a subalgebra of the QMV *** also generalizes the cases of orthomodular lattices.

关键词： QMV algebra commutativity idempotent decomposition theorem

来源：评论

学校读者我要写书评

暂无评论

Extending generalized unsupervised manifold alignment

引用

Science China(information Sciences) 2022年第7期65卷 139-156页

作者： Xiaoyi YIN Zhen CUI Hong CHANG Bingpeng MA Shiguang SHAN Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences School of Computer Science and Engineering Nanjing University of Science and Technology CAS Center for Excellence in Brain Science and Intelligence Technology

Building connections between different data sets is a fundamental task in machine learning and related application community. With proper manifold alignment, the correspondences between data sets will assist us with comprehensive study of data processes and analyses. Despite the several progresses in semi-supervised and unsupervised scenarios, potent manifold alignment methods in generalized and realistic circumstances remain in absence. Besides, theretofore unsupervised algorithms seldom prove themselves mathematically. In this paper, we devise an efficient method to properly solve the unsupervised manifold alignment problem and denominate it as extending generalized unsupervised manifold alignment(EGUMA)method. More specifically, an explicit relaxed integer programming method is adopted to solve the unsupervised manifold alignment problem, which reconciles three factors covering the updated local structure matching, the the feature comparability and geometric preservation. An additional effort is retained on extending the Frank Wolfe algorithm to tacking our optimization problem. Besides our previous endeavors we adopt a new strategy for neighborhood discovery in the manifolds. The main advantages over previous methods accommodate(1) simultaneous alignment and discovery of manifolds;(2) complete unsupervised learning structure without any prerequisite correspondence;(3) more concise local geometry for the embedding space;(4) efficient alternative optimization;(5) strict mathematical analysis on the convergence and efficiency issues. Experiments on real-world applications verify the high accuracy and efficiency of our proposed method.

关键词： unsupervised manifold alignment relaxed integer programming Frank Wolfe algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Petri Net System Parallel Subnet Partitioning Completeness Theory and Algorithm

引用

Wuhan University Journal of Natural Sciences 2019年第3期24卷 205-217页

作者： LI Wenjing LI Songzhao LU Jianbo School of Logistics Management and Engineering Nanning Normal University Guangxi Higher-Education Key Laboratory of Scientific Computing and Intelligent Information Processing Nanning Normal University College of Computer and Information Engineering Nanning Normal University

In order to solve the parallel algorithm of Petri net system with concurrent function, so as to achieve the parallel control and simulation operation of this system, this paper proposes the function partition completeness theory and algorithms of Petri net parallelization, thereby providing the theoretical support for the realization of Petri parallel algorithms. Firstly, according to the concurrent characteristics of Petri net model, we analyze the parallelism of Petri net system; then, by giving the solving process of place invariants and the function partitioning of Petri net, we propose the function partitioning conditions and determination theorem of Petri net parallelization, and conduct its theoretical proof and practical verification. On this basis, we conduct the theoretical study and analysis on the situation that Petri net system has several kinds of parallel function partitioning, propose the completeness theorem of parallelism function partitioning in Petri net system, and verify it. Finally, we give the algorithms, application examples and simulation experiment results of parallel function partitioning of Petri net systems based on place invariant. The theoretical proof and experimental results show that the function partitioning conditions and completeness theory of Petri net parallelization based on place invariant are correct, and the parallel algorithms under such theoretical basis are also correct and effective.

关键词： Petri net parallelization partitioning conditions completeness partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

Blend: A novel combined MT metric based on direct assessment - CASICT-DCU submission to WMT17 metrics task 2

Blend: A novel combined MT metric based on direct assessment...

引用

2nd Conference on Machine Translation, WMT 2017

作者： Ma, Qingsong Graham, Yvette Wang, Shugen Liu, Qun Key Laboratory of Intelligent Information Processing Institute of Computing Technology University of Chinese Academy of Sciences China ADAPT Centre School of Computing Dublin City University Ireland

ISBN: (纸本)9781945626968

Existing metrics to evaluate the quality of Machine Translation hypotheses take different perspectives into account. DPMFcomb, a metric combining the merits of a range of metrics, achieved the best performance for evaluation of to-English language pairs in the previous two years of WMT Metrics Shared Tasks. This year, we submit a novel combined metric, Blend, to WMT17 Metrics task. Compared to DPMFcomb, Blend includes the following adaptations: i) We use DA human evaluation to guide the training process with a vast reduction in required training data, while still achieving improved performance when evaluated on WMT16 to-English language pairs;ii) We carry out experiments to explore the contribution of metrics incorporated in Blend, in order to find a trade-off between performance and efficiency. © 2017 Association for Computational Linguistics

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：