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

21st International Symposium on Graph Drawing, GD 2013

作者： Eppstein, David Holten, Danny Löffler, Maarten Nöllenburg, Martin Speckmann, Bettina Verbeek, Kevin Computer Science Department University of California Irvine CA United States Synerscope BV Eindhoven Netherlands Department of Computing and Information Sciences Utrecht University Netherlands Institute of Theoretical Informatics Karlsruhe Institute of Technology Germany Department of Mathematics and Computer Science Technical University Eindhoven Netherlands Department of Computer Science University of California Santa Barbara CA United States

ISBN: (纸本)9783319038407

We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be unique. We prove that it is NP-complete to determine whether a given graph has a strict confluent drawing but polynomial to determine whether it has an outerplanar strict confluent drawing with a fixed vertex ordering (a drawing within a disk, with the vertices placed in a given order on the boundary). © 2013 Springer International Publishing Switzerland.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Personalized Action Rules for Side Effects Object Grouping

引用

International Journal of Intelligence Science 2013年第1期3卷 24-33页

作者： Hakim Touati Jieyan Kuang Ayman Hajja Zbigniew W. Ras College of Computing and Informatics University of North Carolina Charlotte USA Institute of Computer Science Warsaw University of Technology Warsaw Poland

There have been multiple techniques to discover action-rules, but the problem of triggering those rules was left exclusively to domain knowledge and domain experts. When meta-actions are applied on objects to trigger a specific rule, they might as well trigger transitions outside of the target action rule scope. Those additional transitions are called side effects, which could be positive or negative. Negative side effects could be devastating in some domains such as healthcare. In this paper, we strive to reduce those negative side effects by extracting personalized action rules. We proposed three object-grouping schemes with regards to same negative side effects to extract personalized action rules for each object group. We also studied the tinnitus handicap inventory data to apply and compare the three grouping schemes.

关键词： Meta-Actions Action-Rules Personalization Optimization Grouping

来源：评论

学校读者我要写书评

暂无评论

A lightweight framework for secure life-logging in smart environments

引用

Information Security Technical Report 2013年第3期17卷 58-70页

作者： Nikolaos E. Petroulakis Elias Z. Tragos Alexandros G. Fragkiadakis George Spanoudakis Institute of Computer Science Foundation for Research and Technology – Hellas Heraklion Greece School of Informatics City University London London UK

As the world becomes an interconnected network where objects and humans interact with each other, new challenges and threats appear in the ecosystem. In this interconnected world, smart objects have an important role in giving users the chance for life-logging in smart environments. However, smart devices have several limitations with regards to memory, resources and computation power, hindering the opportunity to apply well-established security algorithms and techniques for secure life-logging on the Internet of Things (IoT) domain. The need for secure and trustworthy life-logging in smart environments is vital, thus, a lightweight approach has to be considered to overcome the constraints of Smart Objects. The purpose of this paper is to present in details the current topics of life-logging in smart environments, while describing interconnection issues, security threats and suggesting a lightweight framework for ensuring security, privacy and trustworthy life-logging. In order to investigate the efficiency of the lightweight framework and the impact of the security attacks on energy consumption, an experimental test-bed was developed including two interconnected users and one smart attacker, who attempts to intercept transmitted messages or interfere with the communication link. Several mitigation factors, such as power control, channel assignment and AES-128 encryption were applied for secure life-logging. Finally, research into the degradation of the consumed energy regarding the described intrusions is presented.

关键词： Smart objects Internet of Things Life-logging Security Smart environment GNUradio

来源：评论

学校读者我要写书评

暂无评论

Modeling the Mobile Telecommunications Sector in Greece

引用

Procedia Economics and Finance 2013年 5卷 377-385页

作者： Zacharoula Kalogiratou Theodoros Monovasilis Soultana Moustakli Nicholas Tsounis Department of Informatics and Computer Technology Technological Institute of Western Macedonia 52100 Kastoria Greece Department of International Trade Technological Institute of Western Macedonia 52100 Kastoria Greece Research Assistant Archimedes Project Department of Informatics and Computer Technology Technological Institute of Western Macedonia 52100 Kastoria Greece Adjunct Faculty Hellenic Open Univeristy

Models of mathematical biology referred in the literature as Volterra-Lotka models of competing species defined by ordinary differential equations are considered in this paper for the construction of a model for analysing the mobile telecommunications sector in Greece. Market size data from the three mobile telecommunication companies that operate under licence of the Greek state for the period 1999-2011 are used. Parameter estimation is performed using non-linear least squares. The findings suggest that in the long-run only one company will remain in the market.

关键词： mathematical models differential equations mobile telecommunications sector Greece.

来源：评论

学校读者我要写书评

暂无评论

Optimal 4-bit reversible mixed-polarity toffoli circuits

Optimal 4-bit reversible mixed-polarity toffoli circuits

引用

4th International Workshop on Reversible Computation, RC 2012

作者： Szyprowski, Marek Kerntopf, Pawel Institute of Computer Science Department of Electronics and Information Technology Warsaw University of Technology Nowowiejska 15/19 00-665 Warsaw Poland Department of Theoretical Physics and Informatics University of Lódå Pomorska 149/153 90-236 Lódå Poland

ISBN: (纸本)9783642363146

Optimal synthesis of reversible circuits is a very hard task. For example, up to year 2009 this problem had not been solved even for 4-bit reversible functions, in spite of intensive research during previous decade. In 2010, a method and a tool of practical usage for finding optimal circuits for any 4-bit reversible specification were finally developed. Namely, with sophisticated optimizations it was possible to find gate count optimal circuits for any 4-bit reversible function built from multi-control Toffoli gates. Last year, we published an extension to the algorithm, which allows to reduce the quantum cost of the resulting circuits. In this paper we present another extension to this approach. Namely, we have extended the reversible gate library to mixed-polarity multi-control Toffoli gates (i.e. with both positive and negative controls). Our experimental results for the known reversible benchmarks show that using mixed-polarity Toffoli gates gives significant savings in gate count. The paper presents results of different computational experiments including optimal 4-bit circuits for the known reversible benchmarks with respect to both gate count and quantum cost criteria. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Deterministic polynomial-time algorithms for designing short DNA words

Deterministic polynomial-time algorithms for designing short...

引用

作者： Kao, Ming-Yang Leung, Henry C.M. Sun, He Zhang, Yong Department of Electrical Engineering and Computer Science Northwestern University United States Department of Computer Science University of Hong Kong Hong Kong Hong Kong Max Planck Institute for Informatics Germany Institute of Modern Mathematics and Physics Fudan University China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China

Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of additional constraints. This problem has applications in, e.g., DNA self-assembly and DNA arrays. Previous works include those that extended results from coding theory to obtain bounds on code and word sizes for biologically motivated constraints and those that applied heuristic local searches, genetic algorithms, and randomized algorithms. In particular, Kao, Sanghi, and Schweller [16] developed polynomial-time randomized algorithms to construct n DNA words of length within a multiplicative constant of the smallest possible word length (e.g., 9×max{logn,k}) that satisfy various sets of constraints with high probability. In this paper, we give deterministic polynomial-time algorithms to construct DNA words based on derandomization techniques. Our algorithms can construct n DNA words of shorter length (e.g., 2.1logn+6.28k) and can satisfy the same sets of constraints as the words constructed by the algorithms of Kao et al. Furthermore, we extend these new algorithms to construct words that satisfy a larger set of constraints for which the algorithms of Kao et al. do not work. © 2013 Published by Elsevier B.V.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Leveraging visual features and hierarchical dependencies for conference information extraction

Leveraging visual features and hierarchical dependencies for...

引用

15th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2013

作者： You, Yue Xu, Guandong Cao, Jian Zhang, Yanchun Huang, Guangyan Department of Computer Science and Engineering Shanghai Jiao Tong University China Centre for Applied Informatics Victoria University Australia Advanced Analytics Institute University of Technology Sydney Australia University of Chinese Academy of Sciences China

ISBN: (纸本)9783642374005

Traditional information extraction methods mainly rely on visual feature assisted techniques;but without considering the hierarchical dependencies within the paragraph structure, some important information is missing. This paper proposes an integrated approach for extracting academic information from conference Web pages. Firstly, Web pages are segmented into text blocks by applying a new hybrid page segmentation algorithm which combines visual feature and DOM structure together. Then, these text blocks are labeled by a Tree-structured Random Fields model, and the block functions are differentiated using various features such as visual features, semantic features and hierarchical dependencies. Finally, an additional post-processing is introduced to tune the initial annotation results. Our experimental results on real-world data sets demonstrated that the proposed method is able to effectively and accurately extract the needed academic information from conference Web pages. © 2013 Springer-Verlag.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Impact of broadband public infrastructures and services on SEE countries' economy

Impact of broadband public infrastructures and services on S...

引用

International Global Information Infrastructure Symposium (GIIS)

作者： Christos Bouras Georgios Diles Vasileios Kokkinos Computer Technology Institute and Press “Diophantus” Patras Greece Computer Engineering and Informatics Dept. University of Patras Greece

Broadband is an important tool for increasing productivity and competitiveness. This paper attempts to measure the accumulative impact and effectiveness of broadband public infrastructures and services on the economy of South East Europe (SEE) areas. To this direction, we focus on evaluating the correlation between broadband and each country's growth and employment. Moreover, we estimate the cost savings achieved by the extended usage of e-services, and we evaluate the potential cost savings that will follow the increase of e-services utilization the next years. The results of our analysis show that broadband may have positive impact on growth and employment and that the possible savings are substantial.

关键词： Broadband communication Employment Economic indicators Electronic government Europe Correlation

来源：评论

学校读者我要写书评

暂无评论

Reconstruction of Object Surface from Multi-View Images Improved by Image Forces

引用

SICE Journal of Control, Measurement, and System Integration 2013年第4期6卷 231-237页

作者： Karolina Nurzynska Mamoru Kubo Ken-ichiro Muramoto Institute of Informatics Silesian University of Technology Division of Electrical Engineering and Computer Science Graduate School of Natural Science and Technology Kanazawa University National College of Science

Currently available techniques for surface reconstruction from multi-view images require a large number of images in order to assure high surface resolution and precise detail reconstruction. Obtaining such big number of images in some cases is impossible; moreover, it may impose high preparation cost. Therefore, to address this drawback, a novel method is presented. This method is based on the visual hull approach. It assumes to be able to reconstruct three dimensional manifolds without edge from images, the number of necessary images should be as small as possible, and the quality of reconstructed mesh should be good. Applying this method for four images from a dino dataset proved the proposed method works well.

关键词： surface reconstruction multi-view images surface carving

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for a simple network design problem

Efficient algorithms for a simple network design problem

引用

作者： Nakano, Shin-Ichi Uehara, Ryuhei Uno, Takeaki Department of Computer Science Faculty of Engineering Gumma University Gumma 376-8515 Japan School of Information Science Japan Advanced Institute of Science and Technology Ishikawa 923-1292 Japan National Institute of Informatics Chiyoda-ku Tokyo 101-8430 Japan

We consider the following simple network design problem. The input consists of n weighted nodes, and the output is an edge-weighted connected network such that the total weight of the edges incident to a node is at least the given weight of the node. We aim to design the cheapest connected network;that is, the reachability of the network should be guaranteed, and the network is better if its total weight is less. In this article, we first show an efficient algorithm that produces an optimal network with minimum weight. The algorithm runs in linear time, and the resulting network contains at most n edges, where n is the number of nodes. To construct a connected network, at least n - 1 edges are required. However, the algorithm sometimes outputs n edges. Next, we aim to minimize not only the weight but also the number of edges. That is, for given n weighted nodes, we aim to design a cheapest tree. Then, the problem becomesNP-complete. We also propose efficient approximation algorithms for constructing a cheapest tree. Copyright © 2013 Wiley Periodicals, Inc.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：