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

A Connection Degree-Based Rough Sets Model and its Application to Knowledge Reduction

A Connection Degree-Based Rough Sets Model and its Applicati...

ACIS International Conference on software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Liuling Dai Bing Huang Dongxiao Yang School of Software Beijing Institute of Technology Beijing China School of Computer Science and Technology School of Management and Engineering Nanjing Audit University Nanjing China Department of Information Science and Technology Jining Medical College Jining China

Knowledge reduction is one of the most important issues in rough sets theory. Many works are related to connection-degree-based rough sets model to treat incomplete information systems. However, the model is not used to knowledge reduction. In this paper, a connection-degree-based rough sets model is proposed and used to knowledge reduction. Two ways for knowledge reduction are proposed and the relationships between them are shown. A knowledge reduction algorithm is also shown for incomplete information systems. The algorithm is based on elementary discernibility matrix and the significance degree of an attribute. Examples are used to show that the validity of the algorithm.

关键词： Rough sets Information systems software engineering Artificial intelligence Distributed computing Application software computer science computer network management Conference management Knowledge management

来源：评论

学校读者我要写书评

暂无评论

PTC-VANET Interactions to Prevent Highway Rail Intersection Crossing Accidents

PTC-VANET Interactions to Prevent Highway Rail Intersection ...

引用

IEEE 65th Vehicular Technology Conference (VTC-Spring 2007), vol.5

作者： Mark Hartong Rajni Goel Csilla Farkas Duminda Wijesekera Department of Information and Software Engineering George Mason University Fairfax VA USA Department of Information Systems and Decision Sciences Howard University College of Medicine Washington D.C. DC USA Department of Computer Science and Engineering University of South Carolina Columbia SC USA

Vehicular Ad-hoc networks (VANETS) provide distributed real time communication of traffic hazards and road conditions among vehicles in a radio line of sight. We propose using VANETS to securely communicate with Positive Train Control (PTC) Systems in order to reduce Highway Rail Intersection (HRI) incidents. This paper illustrates the similarities and differences between the two systems, discusses previous research into the work already done to integrate the two systems, and outlines the additional work necessary to successfully integrate the two systems.

关键词： Architecture Vehicular Ad-hoc Networks VANETS Communications Based Train Control CBTM Positive Train Control PTCs

来源：评论

学校读者我要写书评

暂无评论

An Ant Colony Optimization Algorithm for Solving the Multidimensional Knapsack Problems 07

An Ant Colony Optimization Algorithm for Solving the Multidi...

引用

IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT)

作者： Junzhong Ji Zhen Huang Chunnian Liu Xuejing Liu Ning Zhong College of Computer Science and Technology Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology Beijing University of Technology Beijing China School of Information Engineering Shijiazhuang University of Economics Shijiazhuang China Department of Information Engineering Maebashi Institute of Technology Maebashi Japan

ISBN: (纸本)9780769530277

Ant colony optimization (ACO) algorithm is a metaheuristic and stochastic search technology, which has been one of the effective tools for solving discrete optimization problems. However, there are two bottlenecks for large-scaled optimization problems: the ACO algorithm needs too much time to convergent and the solutions may not be really optimal. This paper proposes a novel ACO algorithm for the multidimensional knapsack problems (MKP), which employs a new pheromone diffusion model and a mutation scheme. First, in light of the preference to better solutions, the association distances among objects are mined in each iteration with top-k strategy. Then, a pheromone diffusion model based on info fountain of an object is established, which strengthens the collaborations among ants. Finally, an unique mutation scheme is applied to optimizing the evolution results of each step. The experimental results for the benchmark testing set of MKPs show that the proposed algorithm can not only get much more optimal solutions but also greatly enhance convergence speed.

关键词： Ant colony optimization Multidimensional systems Genetic mutations Intelligent agent software algorithms Benchmark testing Educational institutions computer science Laboratories software tools

来源：评论

学校读者我要写书评

暂无评论

Incremental Voxel Colouring by Ray Traversal

Incremental Voxel Colouring by Ray Traversal

引用

International Conference on computer Graphics, Imaging and Visualization, CGIV

作者： O. Batchelor R. Mukundan R. Green Department Computer Science& Software Engineering University of Canterbury New Zealand

Image based reconstruction from multiple views is an interesting challenge. Recently methods of optimisation based voxel colouring have appeared which make use of incremental visibility updates. We present an alternative incremental voxel colouring algorithm in the mould of GVC-LDI, which directly associates each visible voxel with the set of rays in it's visible projection, using ray-voxel traversal as a mechanism for updates. We make some time comparisons using calibrated photographs and synthetic images, as well looking at optimisation based voxel colouring and level of detail. Results show that our method compares favourably to GVC-LDI

关键词： Layout Image reconstruction Pixel Image converters Surface reconstruction Error correction computer science software engineering Optimization methods Ray tracing

来源：评论

学校读者我要写书评

暂无评论

A performance model of highly available multicomputer systems

引用

International Journal of Modelling and Simulation 2006年第2期26卷 112-119页

作者： Misbahuddin, S. Al-Holou, N. Khan, S.T. Department of Computer Science and Software Engineering Hail Community College King Fahd University of Petroleum and Minerals PO Box 2440 Hail Saudi Arabia Department of Electrical and Computer Engineering University of Detroit Mercy 4001 West McNichols Detroit MI 48219 United States Hail Community College KFUPM Saudi Arabia Department of Computer Science and Software Engineering Saudi Arabia Electrical and Computer Engineering Department University of Detroit Mercy Detroit MI United States IEEE Computer Society United States IEEE IEEE Education Society USAB and PACE United States King Fahd University of Petroleum and Minerals Hail Campus Saudi Arabia

Multicomputers are distributed memory systems in which independent computers are connected with each other by a network. Multicomputers are widely used in business and scientific applications. Due to their flexibility, scalability, and cost performance, multicomputer systems are considered preferable to multiprocessor systems. They are also gaining attraction in the area of Internetbased computing, in which delays or interruptions in client-server interactions may be equally costly to service providers and customers. Multicomputer systems attributed with high available (HA) solutions may be used to withstand service unavailability due to the web servers' failures. In this paper we investigate a Markov model-based approach to estimate the availability of multicomputer systems with and without HA. The availability is computed as a function of server failure rate and the number of surviving servers. This model can estimate the number of nodes needed for a required availability measure.

关键词： computer systems

来源：评论

学校读者我要写书评

暂无评论

Is there a future for empirical software engineering?

Is there a future for empirical software engineering?

引用

ISCE'06 - 5th ACM-IEEE International Symposium on Empirical software engineering

作者： Basili, Victor R. Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park MD 20742 Fraunhofer Center for Experimental Software Engineering - Maryland College Park MD 20742

ISBN: (纸本)1595932186

This talk provides a personal perspective on the evolution of empirical software engineering. The evolution has included the focus of the studies, e.g., from attempting to demonstrate the effectiveness of various processes to the building of knowledge around a domain or a set of processes. The study designs have changed from strictly quantitative studies to all forms of controlled experiments, quasi-experiments, preexperimental designs, case studies, field studies, and focus group activities. There has been recognition of the importance and influence of context variables and the domain in interpreting the results of studies. The issue of meta-analysis has become more important and is still an elusive goal. A community of empiricists has evolved that allows for the replication of studies leading to the identification of context variables. But there still does not exist a community consensus on the right ways to build bodies of knowledge or a "blessed" set of approaches. We argue over what is appropriate evidence when we review papers. We struggle with the concept of experimental replication. We do not know how to break an empirical study into significant small enough chunks for publication in the various standard forums. We have not convinced the software engineering community that empirical study is a necessary or even valuable research paradigm for the field. What other problems that remain? How can they be solved? What will the future hold for empirical study? This talk will address these issues and propose a possible path towards a mature empirical software engineering discipline.

关键词： computer software

来源：评论

学校读者我要写书评

暂无评论

Recognizing behavioral patterns at runtime using finite automata

Recognizing behavioral patterns at runtime using finite auto...

引用

4th International Workshop on Dynamic Analysis, WODA'06, Co-located with the 28th International Conference on software engineering, ICSE 2006

作者： Wendehals, Lothar Orso, Alessandro Software Engineering Group Department of Computer Science University of Paderborn Germany SPARC Group College of Computing Georgia Institute of Technology United States

ISBN: (纸本)1595934006

During reverse engineering, developers often need to understand the undocumented design of a software. In particular, recognizing design patterns in the software can provide reverse engineers with considerable insight on the software structure and its internal characteristics. Researchers have therefore proposed techniques based on static analysis to automatically recover design patterns in a program. Unfortunately, most design patterns comprise not only structural, but also significant behavioral aspects. Although static analysis is well suited for the recognition of structural aspects, it is typically limited and imprecise in analyzing behavior. To address this limitation, we present a new technique that complements our existing static analysis with a dynamic analysis, so as to perform a more accurate design-pattern recognition. The dynamic analysis is based on (1) transforming behavioral aspects of design patterns into finite automata, (2) identifying and instrumenting relevant method calls, and (3) monitoring relevant calls at runtime and matching them against the automata. The results of the dynamic analysis are then used to compute the likelihood of a pattern to be in the code. This paper describes our technique and presents a preliminary empirical study performed to assess the technique. Copyright 2006 ACM.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Research and establishment of quality cost oriented software testing model

Research and establishment of quality cost oriented software...

引用

2006 Canadian Conference on Electrical and computer engineering, CCECE'06

作者： Yuyu, Yuan Shen, Gu Computer Science Department Computer Architecture Group Pkuing University Beijing 100871 China College of Software Engineering Graduate School Chinese Academy of Sciences Beijing 100049 China

ISBN: (纸本)1424400384

In a competitive market, quality is essential to the software. software test plays an important role during the software-developing period. Any saving on software test, will greatly reduce the total cost of software. The key point of this paper is to build a software test process with the cost control management and to make tradeoff between the quality and the cost. Typical software testing model are analyzed and compared. A novel QC 3-D test model is introduced. The model combined with software test process, software quality cost and testing type. The computational formula is defined to calculate software quality cost. A software quality balance law is introduced to balance control cost and failure cost. By adjusting software test method and strategy, organization can reach the objective of the best balance between software quality and cost. An enterprise case is studied and the result is analyzed to prove the basic law. The result shows an optimistic point that will prove the accurate of the model and the law.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

Auto-clustering Peer-to-Peer system based on classification search

引用

Wuhan Ligong Daxue Xuebao/Journal of Wuhan University of Technology 2006年第7期28卷 105-108+112页

作者： Fan, Gang-Long Department of Computer Science and Engineering Pingdingshan Institute of Technology Pingdingshan 467001 China College of Software Huazhong University of Science and Technology Wuhan 430074 China

Unstructured Peer-to-Peer network uses flooding algorithm to route searching messages which not only brings unnecessary expenditure of network bandwidth, but also limits the rate of resource searching and expandability of P2P system. In order to decrease the influence of this problem, this paper presented a new auto-clustering Peer-to-Peer system (ACP2P) based on classification search, and implemented the archetype of this system. The experiments using network simulator based on data packets show that the system can increase the rate of resource searching and expandability effectively.

关键词： Classification search Peer-to-Peer(P2P) Power law Small world SONs

来源：评论

学校读者我要写书评

暂无评论

Abstraction-based requirements management

Abstraction-based requirements management

引用

2006 International Workshop on Role of Abstraction in software engineering, ROA 2006

作者： Goldin, Leah Finkelstein, Anthony Afeka - Tel Aviv College of Engineering Department of Software Engineering 218 Bney Efraim Rd. Tel Aviv69107 Israel University College London Department of Computer Science Gower St. LondonWC1E 6BT United Kingdom

ISBN: (纸本)1595934014

One of the most difficult challenges in requirements engineering is understanding the information provided by the stakeholders so as to establish the requirements. Moreover, there is considerable frustration whenever a requirement change is initiated and we are unable to analyse the impact of this change despite (or perhaps because of) having piles of requirements documents. This paper outlines a method for Abstraction-based Requirements Management (AbstRM) that is useful for requirements impact analysis and other requirements management activities. Copyright © 2006 ACM.

关键词： Requirements engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：