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

2010 2nd International Conference on Computational Intelligence and Natural Computing, CINC 2010

作者： Zhang, De-Gan Li, Chao Li, Wei-Wei Chen, Xu-Yan School of Computer Science and Technology Tianjin University of Technology 300191 China Tianjin Key Lab. of Intelligent Computing and Novel Software Technology Tianjin 300191 China

ISBN: (纸本)9781424477036

Multi-source heterogeneous information fusion is an extremely challenging problem because of the complex and highly irregular nature of environment. We consider decision fusion problem in the presence of m-dependent evidences in this paper. A new evidence fusion approach for decision of proactive service has introduced, which is extending of Class D-S Evidence method. We applied this approach in our active space project for seamless nomadic service of pervasive computing paradigm, good results have been attained. The validity of approach of this paper has been tested. ©2010 IEEE.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Over- and under-approximating reachable sets for perturbed delay differential equations

arXiv

引用

arXiv 2018年

作者： Xue, Bai Wang, Qiuye Feng, Shenghua Zhan, Naijun State Key Lab. of Computer Science Institute of Software CAS China

This note explores reach set computations for perturbed delay differential equations (DDEs). The perturbed DDEs of interest in this note is a class of DDEs whose dynamics are subject to perturbations and their solutions feature the local homeomorphism property with respect to initial states. Membership in this class of perturbed DDEs is determined by conducting sensitivity analysis of solution mappings with respect to initial states to impose a bound constraint on the time-lag term. The homeomorphism property of solutions to such class of perturbed DDEs enables us to construct over- and under-approximations of reach sets by performing reachability analysis on just the boundaries of their permitted initial sets, thereby permitting an extension of reach set computation methods for perturbed ordinary differential equations to perturbed DDEs. Three examples demonstrate the performance of our approach. Copyright © 2018, The Authors. All rights reserved.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

Heuristic genetic algorithm for minimal reduct in decision system based on rough set theory

Heuristic genetic algorithm for minimal reduct in decision s...

引用

Proceedings of 2002 International Conference on Machine Learning and Cybernetics

作者： Dai, Jian-Hua Li, Yuan-Xiang State Key Lab. of Software Eng. Wuhan University Wuhan China Sch. of Computer Sci. and Technology Wuhan University Wuhan China

ISBN: (纸本)0780375084

Knowledge reduction is an important issue when dealing with huge amounts of data. And it has been proved that computing the minimal reduction of decision system is NP-complete By introducing heuristic strategy, a heuristic genetic algorithm is proposed. A new operator implement is added to heuristic information, and can maintain the ability of classification. The operator is the embodiment of one local research method using heuristic information. So the algorithm can converge quickly and has the ability of optimizing globally. The correctness and effectiveness are shown in the experiments.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

RGH: An efficient RSU-aided group-based hierarchical privacy enhancement protocol for VANETs

RGH: An efficient RSU-aided group-based hierarchical privacy...

引用

13th International Conference on Web-Age Information Management, WAIM 2012

作者： Yang, Tao Kong, Lingbo Yu, Liangwen Hu, Jianbin Chen, Zhong MoE Key Lab. of High Confidence Software Technologies Peking University 100871 Beijing China MoE Key Lab. of Computer Networks and Information Security Peking University 100871 Beijing China School of Electronics Engineering and Computer Science Peking University 100871 Beijing China School of Software Engineering Beijing Jiaotong University 100044 Beijing China

ISBN: (纸本)9783642322808

VANETs are gaining significant prominence from both academia and industry in recent years. In this paper, we introduce an Efficient RSU-aided Group-based Hierarchical Privacy Enhancement Protocol for VANETs. The protocol exploits the Road-Side-Unit (RSU) to form a temporary group based on the vehicles around it. As the group leader, the RSU takes charge of the verification of the member car through the Revocation List from the DoT (Department of Transportation). The RSU also generates the session key and determines the configuration for the group. The RSU handles the message from the group member, and then sends it to other group members. RSUs have hierarchical security because of the real environment secure threats. RSUs are divided into High-level RSU (HRSU) and Low-level RSU (LRSU). HRSU inserts a message-related trace entry into the trace log while LRSU attaches trace Tag on the message. HRSU has to submit the trace log to the Department of Audit (DoA) by secure way periodically. If required, DoA can trace out the disputed message's real signer with the cooperation of the DoT. Comparison with other existing classic schemes in the literature has been performed to show the efficiency and applicability of our scheme. © 2012 Springer-Verlag.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

From collective knowledge to intelligence: Pre-requirements analysis of large and complex systems

From collective knowledge to intelligence: Pre-requirements ...

引用

1st Workshop on Web 2.0 for software Engineering at ICSE 2010, Web2SE 2010, in Conjunction with the 32nd ACM/IEEE International Conference on software Engineering, ICSE 2010

作者： Liang, Peng Avgeriou, Paris He, Keqing Xu, Lai State Key Lab. of Software Engineering Wuhan University China Department of Computing Science University of Groningen Netherlands Software Systems Research Centre Bournemouth University United Kingdom

ISBN: (纸本)9781605589756

Requirements engineering is essentially a social collab.rative activity in which involved stakeholders have to closely work together to communicate, elicit, negotiate, define, confirm, and finally come up with the requirements for the system to be implemented or upgraded. In the development of large and complex systems, with a huge number of uncertain stakeholders, the requirements engineering process becomes a challenging task due to overwhelming and dynamic social interactions, tradeoffs, and collective decisions made by above stakeholders. Traditional approaches and techniques are deficient in supporting this kind of social interactions in requirements-related activities, and managing the evolving requirements and their traceability caused by the social interactions. This paper proposes to address the challenges in the pre-requirements analysis of large and complex systems by employing the techniques from collective intelligence based on Web 2.0 tools and technologies, which is composed of three steps: first, obtain collective requirements knowledge through collab.rative tagging by stakeholders;second, transform collab.rative requirement tags into requirement ontologies;third, support collective requirement decision-making (i.e., collective intelligence) based on the requirement ontologies through requirements reasoning. © 2010 ACM.

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient task Clustering Scheduling on homogeneous clusters

Energy-efficient task Clustering Scheduling on homogeneous c...

引用

11th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2010

作者： Liu, Wei Li, Hongfeng Shi, Feiyan Department of Computer Science Wuhan University of Technology Wuhan 430063 China State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Wuhan University of Technology Department of Computer Science Wuhan China

ISBN: (纸本)9780769542874

Clusters provide powerful computing performance is at cost of huge energy consumption. Scheduling a parallel application with a set of precedence-constrained tasks on cluster is challenging because of high communication cost. Although task duplication based scheduling algorithm is applied to minimize communication overhead, most of them only consider scheduling lengths, however completely ignoring energy consumption of cluster. Based on this consideration, we propose a novel Energy-Performance Balanced Task Duplication based Clustering Scheduling algorithm (EPBTDCS for short) in homogenous clusters which can significantly saving energy by judiciously shrinking communication energy consumption when assigning parallel tasks to computing nodes. This algorithm not only reduces energy dissipation in cluster without significantly degrading system performance, but also gets an optimal scheduling with a simple and loose condition. We conducted extensive experiments based on real-world SPEC fpppp and Sparse Matrix Solver parallel tasks applications running on a simulated cluster. By comparing with task duplication-based scheduling (TDS for short) and non-duplication-based scheduling (MCP for short) algorithms to prove our algorithm can save energy consumption greatly. © 2010 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Business rule engine-based framework for SaaS application development

Business rule engine-based framework for SaaS application de...

引用

2nd International Conference on Cloud Computing and Services science, CLOSER 2012

作者： Zhang, Xiuwei He, Keqing Wang, Jian Wang, Chong Li, Zheng State Key Lab. of Software Engineering Wuhan University Wuhan China Computer School Wuhan University Wuhan China 94005 Troops of PLA Jiuquan China

ISBN: (纸本)9789898565051

software as a Service (SaaS) is becoming a new direction of software industry in the new cloud computing era. In order to satisfy business policy changes and personalized requirements from different tenants in SaaS applications, business rule management must support multi-tenancy and online customization. This paper proposed a framework based on business rule engine, decoupling of business logic rule from SaaS application, which makes SaaS application more robust and maintainable. It takes business rule as an independent and online maintainable part of SaaS application, which could allow tenants to safely upgrade, delete or create rules during runtime. Finally, a practical case study of absence approval-process in attendance management system evaluates the effectiveness of the framework.

关键词： software as a service (SaaS)

来源：评论

学校读者我要写书评

暂无评论

Second-order consensus seeking in multi-agent systems with nonlinear dynamics over random switching directed networks

引用

IEEE Transactions on Circuits and systems I: Regular Papers 2013年第6期60卷 1595-1607页

作者： Li, Huaqing Liao, Xiaofeng Lei, Xinyu Huang, Tingwen Zhu, Wei State Key Lab. of Power Transmission Equipment and System Security and New Technology College of Computer Science Chongqing University Chongqing 400044 China TexasAandM University at Qatar Doha P.O. Box 23874 Qatar Research Center of System Theory and Application Chongqing University of Posts and Telecommunications Chongqing 400065 China

This paper discusses the second-order local consensus problem for multi-agent systems with nonlinear dynamics over dynamically switching random directed networks. By applying the orthogonal decomposition method, the state vector of resulted error dynamical system can be decomposed as two transversal components, one of which evolves along the consensus manifold and the other evolves transversally with the consensus manifold. Several sufficient conditions for reaching almost surely second-order local consensus are derived for the cases of time-delay-free coupling and time-delay coupling, respectively. For the case of time-delay-free coupling, we find that if there exists one directed spanning tree in the network which corresponds to the fixed time-averaged topology and the switching rate of the dynamic network is not more than a critical value which is also estimated analytically, then second-order dynamical consensus can be guaranteed for the choice of suitable parameters. For the case of time-delay coupling, we not only prove that under some assumptions, the second-order consensus can be reached exponentially, but also give an analytical estimation of the upper bounds of convergence rate and the switching rate. Finally, numerical simulations are provided to illustrate the feasibility and effectiveness of the obtained theoretical results. © 2004-2012 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Towards Dynamic Evolutionary Analysis of ProgrammableWeb for API-Mashup Ecosystem 26

Towards Dynamic Evolutionary Analysis of ProgrammableWeb for...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Wang, Yang Xiang, Jiayan Cheng, Hangyu Chen, Wanjun Xiao, Yong Kang, Guosheng Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Hnust Xiangtan China

ISBN: (纸本)9798350331684

With the wide adoption of Web APIs released on Internet, users tend to reuse them for business requirements or software development. Mashup is a useful technology for composing Web APIs into a new and value-added application. With the increasing number of Web APIs and Mashups, the API-Mashup ecosystem has emerged based on the invocation relationship between Mashups and Web APIs. In this paper, we take ProgrammableWeb, a typical API-Mashup ecosystem, as an example to investigate its dynamic evolutionary analysis. Although there have been some works on the API-Mashup ecosystem, they mainly focus on static analysis, i.e., the static characteristics of the API- Mashup ecosystem on a fixed time point. This paper conducts a comprehensive study on the dynamic evolutionary analysis of the API-Mashup ecosystem with a long time range from 2005 to 2021. First, we conduct a dynamic statistical analysis based on the API-Mashup ecosystem dataset. Next, we construct two cooperation networks, one between Web APIs, and the other between their categories. And the general characteristics of the two cooperation networks are presented. Finally, we investigate the derived cooperation networks from four perspectives: dynamic characteristics, degree distribution, betweenness centrality, and assortative mixing. Meanwhile, the corresponding insights are uncovered. Our work provides a foundation for visualization and understanding of the API-Mashup ecosystem from the timeline. © 2023 IEEE.

关键词： Ecosystems

来源：评论

学校读者我要写书评

暂无评论

Research on secure destruction of digital information

Research on secure destruction of digital information

引用

2009 International Conference on Apperceiving Computing and Intelligence Analysis, ICACIA 2009

作者： Hao, Dong She, Kun Cheng, Yu School of Computer Science University of Electronic Science and Technology of China Chengdu 610054 China Software Key Lab. of Sichuan Province Sichuan Normal University Chengdu 610066 China

ISBN: (纸本)9781424452040

This paper is about an interdisciplinary knowledge relating to computer science and Solid state Electronics. The normal FORMAT or DELET operation in computer can not verily eras the data on the hard disk. By using precision instruments, the data could be recognized and recovered. Based on the intensive study in characteristic of magnetic medium and the data encoding rules, this paper represents an effective theory to destruct data from hard disk without specialized equipment. And finally, it proposes a feasible solution for the data destruction software on Linux and Windows operating system. ©2009 IEEE.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：