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

International Conference on computing, Management and Telecommunications (ComManTel)

作者： Zhiyong Liu Nidal Nasser Hossam S. Hassanein School of Computing Queens University Kingston ONT Canada Electrical and Software Engineering Department Alfaisal University Riyadh Saudi Arabia

Cognitive radio networks (CRNs) significantly improve spectrum utilization efficiency by allowing secondary users (SUs) to opportunistically share unused spectrum bands with primary users (PUs). In this paper, we present a spectrum assignment model and propose a genetic algorithm (GA) and a heuristic algorithm to determine the proper spectrum assignment, which optimizes the SUs' reward and the network operator's revenue while satisfying capacity constraints, interference constraints and rate requirement constraints. We show that both algorithms greatly outperform the random assignment approach.

关键词： Sociology Statistics Genetic algorithms Vectors Heuristic algorithms Throughput Interference

来源：评论

学校读者我要写书评

暂无评论

MVP Index: Towards efficient known-item search on large graphs

MVP Index: Towards efficient known-item search on large grap...

引用

18th International Conference on Database Systems for Advanced Applications, DASFAA 2013

作者： Zhong, Ming Liu, Mengchi Bao, Zhifeng Li, Xuhui Qian, Tieyun State Key Laboratory of Software Engineering Computer School Wuhan University Wuhan 430072 China School of Computer Science Carleton University Ottawa ON K1S5B6 Canada School of Computing National University of Singapore Singapore 117417 Singapore

ISBN: (纸本)9783642374869

This paper is motivated by the lack of study on the diversity of user information needs in the scenario of graph search, which offers the prospect of significant improvements on search. We report our investigation on this issue, and then exploit the knowledge to optimize a commonly-used type of graph search: known-item search which only wants the answer trees of a familiar and compact pattern. To address the problem, we propose a novel MVP (Matched Vertex Pruning) index, which captures the query-independent local connectivity information in the graph, to reduce the search space with heuristics by pruning matched vertices that will not participate in the answer trees with heights less than a threshold. Moreover, our optimization approach is independent of search algorithm, and requires the minimal index access times. Our experimental results show that our approach can generally reduce the number of matched vertices to 1%-10%, thereby effectively improving the efficiency of the known-item search. © Springer-Verlag 2013.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Enhancing design models with composition properties: A software maintenance study 13

Enhancing design models with composition properties: A softw...

引用

12th Annual International Conference on Aspect-Oriented software Development, AOSD 2013

作者： Dantas, Francisco Garcia, Alessandro Whittle, Jon Araújo, João Opus Research Group Informatics Department Software Engineering Lab Brazil Department of Computer Science State University of Rio Grande do Norte Brazil School of Computing and Communications Lancaster University Lancaster United Kingdom CITI/FCT Universidade Nova de Lisboa Portugal

ISBN: (纸本)9781450317665

A considerable part of software design is dedicated for the composition of two or more modules. The implication is that changes made later in the implementation often require some reasoning about module composition properties. However, these properties are often not explicitly specified in design artefacts. Moreover, they cannot be easily inferred from the source code either. As a result, implicit composition properties may represent a major source of software maintenance complexity. This fact is particularly true with the advent of post object-oriented techniques, which are increasingly providing advanced mechanisms to enable flexible module composition. However, there is little empirical knowledge on how design models with explicitly-specified composition properties can improve software maintenance tasks. This paper reports an experiment that analyses the impact of design models enriched with composition properties on system maintenance. Explicit composition modelling was achieved in the experiment through a conservative approach, i.e., a specific set of additional UML stereotypes dedicated to model composition properties. The experiment involved 28 participants, who were asked to realize four maintenance tasks using UML design models with different levels of module composition details. Our findings suggested that explicit composition modelling contributed to better results in the realization of program change tasks, regardless of the developers' expertise. Users of composition-enhanced models consistently yielded better results when compared to users of plain UML models. The use of explicit composition specification also led to an average increase of 44.7% in the quality of changes produced by the participants. Copyright © 2013 ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Mainstream media behavior analysis on twitter: A case study on UK general election 13

Mainstream media behavior analysis on twitter: A case study ...

引用

24th ACM Conference on Hypertext and Social Media, HT 2013

作者： Wei, Zhongyu He, Yulan Gao, Wei Li, Binyang Zhou, Lanjun Wong, Kam-Fai Chinese University of Hong Kong Shatin NT Hong Kong School of Engineering and Applied Science Aston University Birmingham United Kingdom Qatar Computing Research Institute Qatar Foundation Doha Qatar Key Laboratory of High Confidence Software Technologies Ministry of Education China

ISBN: (纸本)9781450319676

With the development of social media tools such as Facebook and Twitter, mainstream media organizations including newspapers and TV media have played an active role in engaging with their audience and strengthening their influence on the recently emerged platforms. In this paper, we analyze the behavior of mainstream media on Twitter and study how they exert their influence to shape public opinion during the UK's 2010 General Election. We first propose an empirical measure to quantify mainstream media bias based on sentiment analysis and show that it correlates better with the actual political bias in the UK media than the pure quantitative measures based on media coverage of various political parties. We then compare the information diffusion patterns from different categories of sources. We found that while mainstream media is good at seeding prominent information cascades, its role in shaping public opinion is being challenged by journalists since tweets from them are more likely to be retweeted and they spread faster and have longer lifespan compared to tweets from mainstream media. Moreover, the political bias of the journalists is a good indicator of the actual election results. Copyright 2013 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

An Algebraic Approach Towards Data Cleaning

引用

Procedia Computer Science 2013年 21卷 50-59页

作者： Ridha Khedri Fei Chiang Khair Eddin Sabri Department of Computing and Software Faculty of Engineering McMaster University Hamilton Ontario Canada Department of Computer Science King Abdullah II School for Information Technology The University of Jordan Jordan

There has been a proliferation in the amount of data being generated and collected in the past several years. One of the leading factors contributing to this increased data scale is cheaper commodity storage, making it easier for organisations to house large data stores containing massive amounts of historical data. To effectively analyse these data sets, a preprocessing step is often required as most real data sets are inherently dirty and inconsistent. Existing data cleaning tools have focused on cleaning the errors at hand. In this paper, we take a more formal approach and propose the use of information algebra as a general theory to describe structured data sets and data cleaning. We formally define the notion of association rule, association function, and we present results relating these concepts. We also propose an algorithm for generating association rules from a given structured data set.

关键词： Dirty data data consistency algebraic approach data cleansing formal methods information algebra

来源：评论

学校读者我要写书评

暂无评论

Scheduling in Green Vehicular Infrastructure with Multiple Roadside Units

Scheduling in Green Vehicular Infrastructure with Multiple R...

引用

IEEE International Conference on Communications

作者： Amir Khezrian Abdulla Hammad Terence D. Todd George Karakostas Department of Electrical and Computer Engineering McMaster University Hamilton Ontario CANADA Department of Computing and Software McMaster University Hamilton Ontario CANADA

Smart scheduling can be used to reduce infrastructure energy costs in vehicular roadside networks [1]. In this paper we consider the scheduling problem when there are multiple roadside units (RSUs) in tandem. In this case it is often desirable to load balance the energy consumption across the roadside units so that energy provisioning costs can be reduced as much as possible. We first derive an integer linear programming bound on the min-max energy usage of the roadside units for a given input sample function. This bound is used for comparisons with two proposed on-line scheduling algorithms. The first is a low complexity First-Come-First-Assigned (FCFA) scheduler that makes greedy RSU selections followed by a minimum energy time slot assignment. The second algorithm, the Greedy Flow Graph Algorithm (GFGA), makes the same RSU selection but reassigns time slots whenever a new vehicle is assigned to the same RSU. This is done using a locally optimum integer linear program that can be efficiently solved using a minimum cost flow graph. Results from a variety of experiments show that the proposed scheduling algorithms perform well when compared to the energy lower bounds. Our results also show that near-optimal results are possible but come with increased computation times compared to our heuristic algorithms.

关键词： Vehicles Schedules Downlink Scheduling algorithms Flow graphs Loading

来源：评论

学校读者我要写书评

暂无评论

On/Off Sleep Scheduling in Energy Efficient Vehicular Roadside Infrastructure

On/Off Sleep Scheduling in Energy Efficient Vehicular Roadsi...

引用

IEEE International Conference on Communications

作者： Shokouh Mostofi Abdulla Hammad Terence D. Todd George Karakostas Department of Electrical and Computer Engineering McMaster University Hamilton Ontario CANADA Department of Computing and Software McMaster University Hamilton Ontario CANADA

Smart downlink scheduling can be used to reduce infrastructure-to-vehicle energy costs in delay tolerant roadside networks. In this paper we incorporate this type of scheduling into ON/OFF roadside unit sleep activity, to further reduce infrastructure power consumption. To achieve significant power savings however, the OFF-to-ON sleep transitions may be very lengthy, and this overhead must be taken into account when performing the ON state scheduling. We first incorporate the OFF/ON sleep transitions into a lower bound on energy usage that can be computed for given input sample functions. An online scheduling algorithm referred to as the Flow Graph Sleep Scheduler (FGS) is then introduced, which makes locally optimum decisions about when to initiate new ON/OFF cycles. This is done by computing an estimate of the energy needed to fulfill known vehicle communication requirements with and without the OFF period. This calculation is efficiently done using a novel minimum flow graph formulation. Results from a variety of experiments show that the proposed scheduling algorithm performs well when compared to the energy lower bound. It is especially attractive in situations where vehicle demands and arrival rates are such that the energy costs permit frequent ON/OFF cycling.

关键词： Vehicles Downlink Schedules Scheduling algorithms Flow graphs Power demand

来源：评论

学校读者我要写书评

暂无评论

Modeling software engineering projects as a business: A business intelligence perspective

Modeling software engineering projects as a business: A busi...

引用

AFRICON Conference

作者： Robert T. Hans Ernest Mnkandla Department of Software Engineering Tshwane University of Technology Pretoria South Africa School of Computing University of South Africa Florida South Africa

ISBN: (纸本)9781467359429

Business managers are constantly under pressure to sustain their organizations' competitiveness and to make sound agile decisions in volatile business environments. Business managers make use of business intelligence (BI) tools to assist them make intelligent decisions. software project managers also need what can be called `project intelligence' tools in order to deal with the continuously changing and complex software project environment which can be likened to a business environment. Based on this requirement, this research paper proposes that software projects be modeled as a business in order to apply a business intelligence model so as to develop `project intelligence' tools for software projects. That is, the aim of this research paper is to propose `project intelligence' tools which are modeled on business intelligence tools. The extension of BI tools to software projects follows from the premise that projects are business constructs through which a business is operated to create a sustainable stakeholder-value. The use of `project intelligence' tools will enable a software project manager to gain a clear knowledge about factors that may affect project progress and such knowledge will enable quick and informed quality decision making processes which will ensure improved sustainable project performance.

关键词： Bismuth Project management software Organizations Decision making Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Feature Detection in Ajax-Enabled Web Applications

Feature Detection in Ajax-Enabled Web Applications

引用

(CSMR) European Conference on software Maintenance and Reengineering

作者： Natalia Negara Nikolaos Tsantalis Eleni Stroulia Department of Computing Science University of Alberta Edmonton Canada Department of Computer Science and Software Engineering Concordia University Montreal QUE Canada

ISBN: (纸本)9781467358330

In this paper we propose a method for reverse engineering the features of Ajax-enabled web applications. The method first collects instances of the DOM trees underlying the application web pages, using a state-of-the-art crawling framework. Then, it clusters these instances into groups, corresponding to distinct features of the application. The contribution of this paper lies in the novel DOM-tree similarity metric of the clustering step, which makes a distinction between simple and composite structural changes. We have evaluated our method on three real web applications. In all three cases, the proposed distance metric leads to a number of clusters that is closer to the actual number of features and classifies web page instances into these feature-specific clusters more accurately than other traditional distance metrics. We therefore conclude that it is a reliable distance metric for reverse engineering the features of Ajax-enabled web applications.

关键词： Clustering algorithms Measurement Web pages Partitioning algorithms HTML Feature extraction Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

LAVI: A Location Aware Virtual Infrastructure for VANETs

LAVI: A Location Aware Virtual Infrastructure for VANETs

引用

International Conference on Connected Vehicles and Expo (ICCVE)

作者： Rohan B. Golatkar Yu Chen Wei-Shinn Ku Dept. of Electrical and Computing Engineering SUNY-Binghamton Binghamton NY USA Dept. of Computer Science and Software Engineering Auburn University Auburn AL USA

Without requiring pre-fixed infrastructure, Vehicular Ad Hoc networks (VANETs) allow drivers to exchange information and access variant services in real-time manner. While achieving significant flexibility and convenience, dynamic network topology is also the source of challenges that invalidate most of well-designed protocols. To address this problem, in this paper, we propose a novel scheme called Location Aware Virtual Infrastructure (LAVI). The fundamental rationale of the LAVI scheme is based on an observation: although each individual vehicle will not stay at a location for an extended period of time, statistically there are some vehicles available as long as the density of vehicles is reasonably high. LAVI creates a virtually stable infrastructure layer on top of the dynamic physical topology. Through extensive experimental study, we have verified the effectiveness of our LAVI scheme.

关键词： Peer-to-peer computing Vehicles Delays Mobile nodes Network topology Topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：