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

Hybrid uniform distribution of particle swarm optimizer

IEICE Transactions on Fundamentals of Electronics, Communications and computer Sciences 2010年第10期E93-A卷 1782-1791页

作者： Zhang, Junqi Tan, Ying Ni, Lina Xie, Chen Tang, Zheng Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Qingdao China Tongji University Shanghai 200092 China Key Laboratory of Machine Perception Ministry of Education Qingdao China Department of Machine Intelligence School of Electronics Engineering and Computer Science Peking University Beijing 100871 China College of Info Sci and Engi Shandong University of Science and Technology Qingdao China Department of Intellectual Information Systems Engineering University of Toyama Toyama-shi 930-8555 Japan

Particle swarm optimizer (PSO) is a stochastic global optimization technique based on a social interaction metaphor. Because of the complexity, dynamics and randomness involved in PSO, it is hard to theoretically analyze the mechanism on which PSO depends. Statistical results have shown that the probability distribution of PSO is a truncated triangle, with uniform probability across the middle that decreases on the sides. The "truncated triangle" is also called the "Maya pyramid" by Kennedy. However, very little is known regarding the sampling distribution of PSO in itself. In this paper, we theoretically analyze the "Maya pyramid" without any assumption and derive its computational formula, which is actually a hybrid uniform distribution that looks like a trapezoid and conforms with the statistical results. Based on the derived density function of the hybrid uniform distribution, the search strategy of PSO is defined and quantified to characterize the mechanism of the search strategy in PSO. In order to show the significance of these definitions based, on the derived hybrid uniform distribution, the comparison between the defined search strategies of the classical, linear decreasing weight based PSO and the canonical constricted PSO suggested by Clerc is illustrated and elaborated. Copyright © 2010 The Institute of Electronics, Information and Communication Engineers.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Finite time cluster consensus of fractional-order multi-agent systems with directed topology

Finite time cluster consensus of fractional-order multi-agen...

引用

第33届中国控制与决策会议

作者： Weijin Liu Xiwei Liu Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education

In this paper,the finite time cluster consensus(FnTCC) of fractional-order multi-agent systems(FOMAS)with directed topology is *** fractional-order system is converted into an integer-order system by defining a neighborhood-based error variable,and suitable control rules are designed for the obtained first-order multi-agent *** to the exponential finite-time stability theorem,suitable Lyapunov functions are ***,the settling time function is *** simulation results prove the feasibility and validity of our theory.

关键词： Fractional-order Cluster consensus Exponential finite time Multi-agent systems Directed topology

来源：评论

学校读者我要写书评

暂无评论

A new universal-environment adaptive multiprocessor scheduler for autonomous cyber-physical system

A new universal-environment adaptive multiprocessor schedule...

引用

2012 IEEE/ACIS 11th International Conference on computer and Information Science, ICIS 2012

作者： Zhang, Kailong Yao, Yuan Lu, Zhou Wu, Xiao Labanni, Ouassila School of Computer Northwestern Polytechnical University Xi'an China Laboratory of Electron Information and Image University of Burgundy Dijon France Shaanxi Key Laboratory of Embedded System Technology Northwestern Polytechnical University Xi'an China

ISBN: (纸本)9780769546940

Robot, spaceship and other applications that can be called autonomous Cyber-Physical systems (CPS) are all smart embedded systems, which usually run in open environment by themselves with inhered intelligent capabilities. Besides the application intelligence, the researches of adaptive platform for such systems have also become topics recently. Based on the analysis of current work, a new environment adaptive scheduler (α-S) for multiprocessor platform of a cyber-physical system is proposed in this article. And then, its related structures, models, and reasoning methods are studied deeply. Different from the existing ones, α-S can schedule all tasks according to the environment change by two layered functions. The upper one uses not only the properties of a task but also the state of environment and system resources as input variables, which is defined as Universal Environment (UE), and then calculates the Quality of Scheduling of all tasks with a customized fuzzy logic. The lower one allocates these tasks onto processors automatically under the dynamic performance evaluation of computing resources, such as load and success rate of each processor. Further, some allocation policies are studied and defined to make α-S be more flexible to adapt different requirements. Finally, studied methods are simulated and then experimented on an obstacle-avoiding robot system. © 2012 IEEE.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Process-aware service composition based on Petri net

引用

Journal of Harbin Institute of Technology (New Series) 2008年第SUPPL.期15卷 162-166页

作者： Sun, Ping Li, Xiangmei Department of Computer Science and Engineering Tongji University Shanghai 201804 China Embedded System and Service Computing Key Laboratory Shanghai 201804 China

One of the most promising advantages of Web service technology is the possibility of creating value-added services by combining existing ones. A major challenge is how to discover and select concrete service according to user requirements. This paper addresses the topic of service discovery composite Web services. The main feature is that we take the process model as well as service profile into account. Firstly, the process models of Web services are translated into Petri nets. Based on this, we propose a service matchmaking algorithm, via comparing the functionality compatibility and process consistency, thus leading to more accurate matchmaking.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Correct after Answer: Enhancing Multi-Span Question Answering with Post-Processing Method

Correct after Answer: Enhancing Multi-Span Question Answerin...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Lin, Jiayi Zhang, Chenyang Tong, Haibo Zhang, Dongyu Hong, Qingqing Hou, Bingxuan Wang, Junli Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai201804 China Collaborative Innovation Center for Financial Network Security Tongji University Shanghai201804 China

ISBN: (纸本)9798891761681

Multi-Span Question Answering (MSQA) requires models to extract one or multiple answer spans from a given context to answer a question. Prior work mainly focuses on designing specific methods or applying heuristic strategies to encourage models to predict more correct predictions. However, these models are trained on gold answers and fail to consider the incorrect predictions. Through a statistical analysis, we observe that models with stronger abilities do not predict less incorrect predictions compared with other models. In this work, we propose Answering-Classifying-Correcting (ACC) framework, which employs a post-processing strategy to handle incorrect predictions. Specifically, the ACC framework first introduces a classifier to classify the predictions into three types and exclude "wrong predictions", then introduces a corrector to modify "partially correct predictions". Experiments on several MSQA datasets show that ACC framework significantly improves the Exact Match (EM) scores, and further analysis demostrates that ACC framework efficiently reduces the number of incorrect predictions, improving the quality of predictions. © 2024 Association for Computational Linguistics.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Local-directed network coding in vehicular ad-hoc networks

Local-directed network coding in vehicular ad-hoc networks

引用

IEEE International Symposium on Intelligent Signal Processing and Communication systems (ISPACS)

作者： Haojie Luo Dongdong Zhang Chen Ye The Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

In this paper, we proposed a novel network coding method called local-directed network coding to improve the throughput of the vehicular ad-hoc network. Different from other vehicular network coding methods, we consider the direction of packet transmission. In detail, the intermediate node selects one main packet and some sub-packets from forwards and backwards sending queues, and then encodes these packets into one packet to broadcast. Simulation results show that our approach can efficiently improve the throughput of application layer in vehicular networks.

关键词： Encoding Buffer storage Accidents Vehicles Streaming media Artificial neural networks Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

ADHD Discrimination Based on Social Network

ADHD Discrimination Based on Social Network

引用

International Conference on Cloud Computing and Big Data (CCBD)

作者： Xiaojiao Guo Lianghua He The key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

ISBN: (纸本)9781479966226

Attention Deficit Hyperactivity Disorder (ADHD) is one of the common diseases of brain and has brought the growth of teenagers and even the adult indelible damage. It is very different to classify the ADHD symptoms and normal by the existing research. In this paper, the contributions are as two aspects: one is that the attributes of brain network of the resting state fMRI data have been calculated to discriminate three categories ADHD from the controls. And the average accuracies of various categories are 42.49% and 63.46% on the ADHD-200 datasets of NYU and KKI respectively, which is better than the average best imaging-based diagnostic performance of 35.19% and 61.90% achieved in the ADHD-200 global competition. The other one is that we put forward a new method named G-algorithm to construct the whole brain network, which based on certain rules. The same or even better classification results have been achieved by this method, which also verifies its feasibility and effectiveness.

关键词： Social network services Accuracy Support vector machines Correlation Synchronization Diseases Organizations

来源：评论

学校读者我要写书评

暂无评论

Counting Pedestrian in Crowded Subway Scene

Counting Pedestrian in Crowded Subway Scene

引用

Congress on Image and Signal Processing, CISP

作者： Keju Zu Fuqiang Liu Zhipeng Li Key Laboratory of Embedded System and Service Computing University of Tongji Shanghai China

When the high occlusion occurs in crowded scene, face detection is a better substitute for detecting pedestrian. In this paper, we present a novel crowd analysis method based on discriminative descriptor of faces and support vector machine (SVM) ensemble. Through manipulating the input features in the same sample set, the different input features of faces are extracted to train two SVM classifiers. The classification scores of two generated classifiers are combined adaptively to make a collective decision. The first SVM, as the principal classifier gives out most of face hypotheses, while the second SVM serves as secondary one to rejecting the false positive. We present experiment to test the proposed method in crowded subway video, and the result shows that the SVM ensemble outperforms the single SVM in counting the pedestrian.

关键词： Layout Support vector machines Support vector machine classification Face detection Histograms Surveillance Humans Lighting Cameras Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Entropy-based Traffic Congestion Propagation Pattern Mining with GPS Data

Entropy-based Traffic Congestion Propagation Pattern Mining ...

引用

IEEE International Conference on Big Data Analysis (ICBDA)

作者： Xinyuan Sui Yaying Zhang Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Traffic congestion in urban areas has become a critical issue in the world. As the limits of road topology and the influence of residents' commuting periodic patterns, the same part of the road network usually gets congested, and there are similar propagation paths when congestion occurs in an area. This paper aims to model the congestion propagation phenomenon and further discover the congestion propagation paths that frequently appeared. To this end, we propose an algorithm which analyzes the correlations between congestions on different road segments and constructs a congestion propagation graph to reflect the dynamic process of congestions. The traffic flow entropy is novelty considered to identify the potential essential road segment in traffic congestions. We adopt the Jaccard correlation to estimate the parameters employed. The experiments with the road network in Beijing, China and real-world GPS trajectory data indicate that our approach can reveal congestion propagation patterns and the dynamic process of congestion propagation.

关键词： Correlation Network topology Roads Heuristic algorithms Urban areas Trajectory Topology

来源：评论

学校读者我要写书评

暂无评论

An Efficient Webpage Classification Algorithm Based on LSH

An Efficient Webpage Classification Algorithm Based on LSH

引用

International Conference of Young computer Scientists, Engineers and Educators, ICYCSEE 2015

作者： Junjun Liu Haichun Sun Zhijun Ding The Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University

With the explosive growth of Internet information,it is more and more important to fetch real-time and related *** it puts forward higher requirement on the speed of webpage classification which is one of common methods to retrieve and manage *** get a more efficient classifier,this paper proposes a webpage classification method based on locality sensitive hash *** which,three innovative modules including building feature dictionary,mapping feature vectors to fingerprints using Localitysensitive hashing,and extending webpage features are *** compare results show that the proposed algorithm has better performance in lower time than the na?ve bayes one.

关键词： Explosive growth Webpage classification Locality-sensitive hashing Fingerprint Extending webpage features

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：