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

2008 American Control Conference (ACC), vol.7

作者： Ricardo G. Sanfelice Andrew R. Teel Laboratory for Information and Decision Systems Massachusetts Institute of Technology MA USA Department of Electrical and Computer Engineering University of California Santa Barbara USA Department of Electrical and Computer Engineering University of California Santa Barbara CA USA

We show that for time-invariant hybrid systems given by a flow map, flow set, jump map, and jump set, uniform global stability of a compact set plus the existence of Lyapunov-like functions and continuous functions satisfying a nested condition imply uniform global asymptotic stability of the compact set ("uniform" in the sense that bounds on the solutions and on the convergence time depend only on the distance to the compact set of interest). The required nested condition is a combination of the conditions in nested Matrosov theorems for time-varying continuous-time and discrete-time systems available in the literature. Our result also shows that Matrosov's theorem is a reasonable alternative to LaSalle's invariance principle for time-invariant hybrid systems to conclude attractivity to a compact set. We illustrate the application of our main result by examples.

关键词： Asymptotic stability Time varying systems Control systems Differential equations Sufficient conditions Output feedback Adaptive control Stability analysis Vehicles Laboratories

来源：评论

学校读者我要写书评

暂无评论

MapReduce-based parallel GEP algorithm for efficient function mining in big data applications

MapReduce-based parallel GEP algorithm for efficient functio...

引用

作者： Liu, Yang Ma, Chenxiao Xu, Lixiong Shen, Xiaodong Li, Maozhen Li, Pengcheng School of Electrical Engineering and Information Sichuan University Chengdu610065 China Department of Electronic and Computer Engineering Brunel University London UxbridgeUB8 3PH United Kingdom Key Laboratory of Embedded Systems and Service Computing Ministry of Education Tongji University Shanghai200092 China State Grid Shanxi Electric Power Company Xi'an710048 China

Gene expression programming (GEP) algorithm is one of the most effective function mining algorithms in enabling the mathematical equation fitting for the input dataset. However, GEP algorithm encounters low efficiency issue in big data processing due to large overhead in its evolution when it handles the large-scale data. In order to solve the issue, this paper presents two parallelized GEP algorithms using MapReduce. Based on data separation, the first algorithm aims at speeding up the large-scale classification. However, it is lack of ability to output the mined equation explicitly. Therefore, based on the further improvements of the first algorithm, the second parallelized GEP algorithm aims at mining the equation efficiently and also outputs the equation explicitly and directly. The experimental results show that both algorithms are effective for processing large volume of data. © 2017 John Wiley & Sons, Ltd.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Reports on the AAAI 2009 fall symposia

Reports on the AAAI 2009 fall symposia

引用

作者： Azevedo, Roger Bench-Capon, Trevor Biswas, Gautam Carmichael, Ted Green, Nancy Hadzikadic, Mirsad Koyejo, Oluwasanmi Kurup, Unmesh Parsons, Simon Pirrone, Roberto Prakken, Henry Samsonovich, Alexei Scott, Donia Souvenir, Richard Department of Psychology Institute for Intelligent Systems University of Memphis United States Department of Computer Science University of Liverpool United Kingdom Center for Intelligent Systems Vanderbilt University United States Department of Computer Science University of North Carolina Charlotte United States Department of Computer Science University of North Carolina Greensboro United States Department of Software and Information Systems University of North Carolina Charlotte United States Complex Systems Institute United States Department of Electrical and Computer Engineering University of Texas Austin United States Department of Cognitive Science Rensselaer Polytechnic Institute Troy NY United States Department of Computer and Information Science Brooklyn College City University New York United States University of Palermo Italy Computer Science Department Utrecht University Netherlands Department of Law and IT Law Faculty University of Groningen Netherlands Krasnow Institute for Advanced Study George Mason University United States Computational Linguistics Department Informatics at the University of Sussex United Kingdom

The Association for the Advancement of Artificial Intelligence was pleased to present the 2009 Fall Symposium Series, held Thursday through Saturday, November 5-7, at the Westin Arlington Gateway in Arlington, Virginia. The Symposium Series was preceded on Wednesday, November 4, by a one-day AI funding seminar. The titles of the seven symposia were as follows: (1) Biologically Inspired Cognitive Architectures, (2) Cognitive andMetacognitive Educational systems, (3) Complex Adaptive systems and the Threshold Effect: Views from the Natural and Social Sciences, (4) Manifold Learning and Its Applications, (5) Multirepresentational Architectures for Human-Level Intelligence, (6) The Uses of Computational Argumentation, and (7) Virtual Healthcare Interaction. Copyright © 2010, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Cognitive systems

来源：评论

学校读者我要写书评

暂无评论

Video Object Segmentation with Comprehensive Scene Awareness

SSRN

引用

SSRN 2022年

作者： Ji, Chuanjun Chen, Yadang Yang, Zhi-Xin Wu, Enhua The State Key Laboratory of Internet of Things for Smart City Department of Electromechanical Engineering University of Macau 999078 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing210044 China The State Key Laboratory of Computer Science Institute of Software University of Chinese Academy of Sciences Beijing100190 China

This paper aims to investigate the video object segmentation task (VOS) in semi-supervised settings, which estimates the mask of the target object in subsequent frames based on its mask in the initial frame. Currently, the most advanced methods primarily depend on generative target appearance models, but as they are susceptible to background distractors resembling the target objects, only limited robustness can be achieved. To eliminate this influence, a semi-supervised VOS method with comprehensive scene awareness is proposed in this study, which consists of a target appearance network and a scenario knowledge network. The target appearance network adopts a memory-based architecture to obtain the appearance cues of target objects. The scenario knowledge network captures detailed environmental cues, such as the position of distractor objects, which greatly assists in locating the target. To ensure that the scenario knowledge is learned accurately and effectively combined with the output of the target appearance network, a union loss function is designed to supervise the network model for training. On several prevalent benchmarks, this method achieves a favorable performance compared to the most advanced methods currently available. The scenario knowledge network contains complementary information and provides a considerable performance increase, even when considering a strong appearance model. © 2022, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Mining Closed Multidimensional Sequential Patterns

Efficient Algorithms for Mining Closed Multidimensional Sequ...

引用

International Conference on Fuzzy systems and Knowledge Discovery (FSKD)

作者： Veera Boonjing Panida Songram Software Systems Engineering Laboratory Department of Mathematics and Computer Science Faculty of Science King Mongkut''s Institute of Technology Ladkrabang Bangkok Thailand Department of Computer Science Faculty of Informatics Mahasarakham University Mahasarakham Thailand

A combination of closed sequential pattern mining and closed itemset pattern mining was proposed to mine closed multidimensional sequential patterns. There are two ways for this combination; (1) mining closed itemset patterns from multidimensional information followed by mining closed sequential patterns from sequences associated with closed itemset patterns, and (2) mining closed sequential patterns from sequences followed by mining closed itemset patterns from multidimensional information associated with closed sequential patterns. In the first way the major cost is mining all sequences associated with closed itemset patterns. A similar problem occurs with the second way, the major cost is mining all multidimensional information associated with closed sequential patterns. Therefore, this paper proposes two new combinations that don't need to mine all sequences in the first combination, and all multidimensional information in the second combination. Both combinations can be effected by exploiting two concepts. In the first combination, any closed sequential patterns associated with a closed itemset patten I can be found from a set of closed sequential patterns associated with a closed itemset pattern I' if I sup I'. In the second combination, any closed itemset patterns associated with a closed sequential pattern s can be found from a set of closed sequential patterns associated with a closed itemset pattern s' if s sup s'.

关键词： Multidimensional systems Data mining Itemsets Costs computer science software algorithms software systems systems engineering and theory Laboratories Mathematics

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Cryptocurrency Trading Platforms Using the Analytic Hierarchy Process 3

Comparative Analysis of Cryptocurrency Trading Platforms Usi...

引用

3rd International Workshop on information Technologies: Theoretical and Applied Problems, ITTAP 2023

作者： Kuznetsov, Oleksandr Kryvinska, Natalia Ilchenko, Oleksii Smirnova, Tetiana Ulianovska, Yuliia Department of Political Sciences Communication and International Relations University of Macerata Via Crescimbeni 30/32 Macerata62100 Italy Department of Information and Communication Systems Security School of Computer Sciences V. N. Karazin Kharkiv National University 4 Svobody Sq. Kharkiv61022 Ukraine Department Department of Information Systems University of Comenius Bratislava Slovakia Oracle Slovensko spol. s r.o. Bratislava Slovakia Department of cyber security and software Central Ukrainian National Technical University 8 University Ave Kropyvnytskyi25006 Ukraine Department of Computer Science and Software Engineering University of Customs and Finance av. Volodymira Vernadskogo 2/4 Dnipro49000 Ukraine

In the rapidly evolving world of cryptocurrency trading, selecting an optimal trading platform is paramount for both novice and seasoned investors. This study aims to provide a comprehensive evaluation of leading cryptocurrency trading platforms using the Analytic Hierarchy Process (AHP). The AHP, a structured technique for organizing and analyzing complex decisions, was employed to rank platforms based on multiple criteria, including UI/UX, security protocols, asset diversity, and more. Initial findings, considering equal importance for all criteria, highlighted Binance as the most favorable platform. However, when varying the importance of criteria based on empirical data, the distinctions between platforms became less pronounced, yet Binance retained its top position. This research not only offers valuable insights for potential investors but also emphasizes the significance of considering multiple criteria in decision-making processes. Furthermore, the study underscores the versatility of the AHP in evaluating multifaceted scenarios, making it a valuable tool for future research in diverse domains. © 2023 CEUR-WS. All rights reserved.

关键词： Analytic hierarchy process

来源：评论

学校读者我要写书评

暂无评论

Data caching in data integration systems based on AXML technology

Data caching in data integration systems based on AXML techn...

引用

International Workshop on Database and Expert systems Applications

作者： Marcin Marczewski Tadeusz Pankowski IBM Software Laboratory Cracow Poland Faculty of Mathematics and Computer Science Adam슠Mickiewicz University Poznan Poland Institute of Control and Information Engineering Poznań University of Technology Poland

AXML (active XML) is a framework for peer-to-peer data integration from XML sources. In AXML documents data can be presented extensionally or intentionally by including calls to local or remote Web services. In complex AXML-based systems data retrieval can be inefficient. In the paper we propose a caching mechanism for systems based on active XML. We show how it can influence network communication and data integration processes.

关键词： Web services XML Peer to peer computing Simple object access protocol information retrieval Database languages Expert systems Application software Control systems Data engineering

来源：评论

学校读者我要写书评

暂无评论

An Empirical Study of Bug Fixing Rate

An Empirical Study of Bug Fixing Rate

引用

IEEE Annual International computer software and Applications Conference (COMPSAC)

作者： Weiqin Zou Xin Xia Weiqiang Zhang Zhenyu Chen David Lo Department of Information Engineering Jiangxi University of Science and Technology China College of Computer Science and Technology Zhejiang University Hangzhou China Software Institute Nanjing University Nanjing China School of Information Systems Singapore Management University Singapore

Bug fixing is one of the most important activities in software development and maintenance. A software project often employs an issue tracking system such as Bugzilla to store and manage their bugs. In the issue tracking system, many bugs are invalid but take unnecessary efforts to identify them. In this paper, we mainly focus on bug fixing rate, i.e., The proportion of the fixed bugs in the reported closed bugs. In particular, we study the characteristics of bug fixing rate and investigate the impact of a reporter's different contribution behaviors to the bug fixing rate. We perform an empirical study on all reported bugs of two large open source software communities Eclipse and Mozilla. We find (1) the bug fixing rates of both projects are not high, (2) there exhibits a negative correlation between a reporter's bug fixing rate and the average time cost to close the bugs he/she reports, (3) the amount of bugs a reporter ever fixed has a strong positive impact on his/her bug fixing rate, (4) reporters' bug fixing rates have no big difference, whether their contribution behaviors concentrate on a few products or across many products, (5) reporters' bug fixing rates tend to increase as time goes on, i.e., Developers become more experienced at reporting bugs.

关键词： computer bugs Correlation History computer aided software engineering Open source software Entropy

来源：评论

学校读者我要写书评

暂无评论

A heuristic scheduling algorithm based on PSO in the cloud computing environment

引用

International Journal of Future Generation Communication and Networking 2016年第1期9卷 349-362页

作者： Xue, Shengjun Shi, Wenling Xu, Xiaolong School of Computer and Software Nanjing University of Information Science and Technology Nanjing China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China

In the face of a large number of task requests submitted by users, the data center in the cloud need not only to finish these massive tasks but also to satisfy the user's service demand. How to dividethe resources of the system reasonably and schedule these tasks efficiently isa problem that need be solved in the cloud computing. The task scheduling of workflow is a kind of scheduling model for the most partresearched in cloud computing. The scheduling goal is alwaysdecided by user's QoS(Quality of Service)and the scheduling goal of existing scheduling algorithm is alwayssingle. Based on the price model a scheduling algorithm is proposed which can realize the multiple targets in this article, and the scheduling algorithm is Service Cost Optimizationbased on Particle Swarm Optimization(PSO-SC).PSO-SC algorithm can adapt to dynamic cloud environment, and it not only shortens the completion time of tasks but also minimizesuser's cost of task when schedule tasks. In this paper, experiment and analyze the task scheduling of workflow under the cloud computing environment, and the experimental results show that the algorithm proposed in this paper has very good scheduling performance and can reachthe goal of task scheduling of tasks. © 2016 SERSC.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Student information Management System

Design and Implementation of Student Information Management ...

引用

2015 International Conference on Advances in Management engineering and information Technology(AMEIT 2015)

作者： Y.S.Zhang J.Ma A.Q.Bao Y.Li School of Information Science and Engineering Shandong Normal University Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology School of History and Social Development Shandong Normal University

According to the students' independent selection of course and the management of courses and grades of administrators, it were designed two aspects. First of all, the analysis of the basic running principles of PHP program and use all events application programming of PHP and MyS QL specific methods to create the database and tables, to link the MyS QL database statement right into practice, implementation planning project development overall design and components, play the spirit of cooperation between modules. The function of students' online information, course selection, course information query of teachers, the final score function, the curriculum and the data management function of administrators were achieved. The problem of the three rights in access and the management of system has solved.

关键词： PHP My SQL database

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：