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

2012 International Conference on Machine Learning and Cybernetics, ICMLC 2012

作者： Wang, Xiao-Lin Zhao, Hai Lu, Bao-Liang Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University 800 Dong Chuan Rd. Shanghai 200240 China

ISBN: (纸本)9781467314855

Given the vastness of Internet, search engines have to find not only relevant but also high-quality web pages to satisfy users' information need. At present, most quality assessing methods for web pages are based on link analysis and user feedbacks. Considering that users acquire information from web pages mainly through reading their text, this paper addresses automated quality assessment of web pages from textual content. This paper surveys related works on assessing text's quality, summarizes quality-related features, and examines them with a real-word data set. Experimental results show that features based on the length of text are the most effective, while combining length features with other features such as part-of-speech tags and readability can further improve the accuracy. © 2012 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Statistical Model Checking for Stochastic Hybrid systems 1

Statistical Model Checking for Stochastic Hybrid Systems

引用

1st International Workshop on Hybrid systems and Biology, HSB 2012

作者： David, Alexandre Larsen, Kim G. Mikučionis, Marius Poulsen, Danny Bøgsted Legay, Axel Sedwards, Sean Du, Dehui Department of Computer Science Aalborg University Denmark INRIA Rennes Bretagne Atlantique France Shanghai Key Laboratory Trustworthy Computing East China Normal University Shanghai20062 China

This paper presents novel extensions and applications of the UPPAAL-SMC model checker. The extensions allow for statistical model checking of stochastic hybrid systems. We show how our race-based stochastic semantics extends to networks of hybrid systems, and indicate the integration technique applied for implementing this semantics in the UPPAAL-SMC simulation engine. We report on two applications of the resulting tool-set coming from systems biology and energy aware buildings. © David, Du, Larsen, Legay, Mikučionis, Poulsen, Sedwards

关键词：

来源：评论

学校读者我要写书评

暂无评论

Partitioning the Conventional DBT System for Multiprocessors

引用

Journal of computer science & Technology 2011年第3期26卷 474-490页

作者：马汝辉管海兵朱二周杨洪波杨吟冬梁阿磊 Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University

Noticeable performance improvement via ever-increasing transistors is gradually trapped into a predicament since software cannot logically and efficiently utilize hardware resource, such as multi-core resource. This is an inevitable problem in dynamic binary translation （DBT） system as well. Though special purpose hardware as aide tool, through some interfaces, provided by DBT enables the system to achieve higher performance, the limitation of it is significant, that is, it is impossible to be used widely by another one. To overcome this drawback, we focus on building compatible software architecture to acquire higher performance without platform dependence. In this paper, we propose a novel multithreaded architecture for DBT system through partitioning distinct function module, which is to adequately utilize multiprocessors resource. This new architecture devides couples the common DBT system （DBTs） working routine into dynamic translation, optimization, and translated code execution phases, and then ramifies them into different threads to enable them concurrently executed. In this new architecture, several efficient novel methods are presented to cope with intractable work that puzzles most researchers, such as communication mechanism, cache layout, and mutual exclusion between threads. Experimental results using SPECint 2000 indicate that this new architecture for DBT system can achieve higher performance -- speed up the traditional DBT system by about average 10.75%, with better CPU utilization.

关键词： DBT optimization microprocessor multi-core SPECint 2000

来源：评论

学校读者我要写书评

暂无评论

On efficient neighbor sensing in vehicular networks

引用

computer Communications 2012年第13期35卷 1639-1648页

作者： Zuoxiang Deng Yanmin Zhu Minglu Li Department of Computer Science and Engineering Shanghai Jiao Tong University Dongchuan Road No. 800 Minhang District Shanghai 200240 PR China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Dongchuan Road No.800 Minhang District Shanghai 200240 PR China

Efficient neighbor sensing in vehicular wireless networks is crucial to a number of applications such as driving safety and data delivery. For neighbor sensing, a vehicle has to send probe messages. The characteristics of vehicular networks raise several great challenges for real-time neighbor sensing. First, simultaneous wireless transmissions lead to packet collision. The aggressiveness of probe message transmission has a great impact on sensing latency, and it is difficult to determine the optimal aggressive degree of probe message transmission. Second, the number of neighbors of a vehicle in an urban environment may change over time and a static control method for probe message transmission results in poor performance. We design a protocol ENS for efficient neighbor sensing, in which each vehicle performs a randomized broadcast of probe messages in fix-length frames. To approach optimal neighbor sensing, ENS adopts an adaptive probe message transmission strategy. Based on an analytical framework, we theoretically determine the optimal configurations for number of probe messages and frame length. We have conducted trace driven simulation experiments, and performance results demonstrate that ENS outperforms two other alternative algorithms. In addition, more than 90% of association latencies are less than 600 ms, and more than 90% of disassociation latencies are less than 200 ms under a typical urban setting.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The sharing at roadside: Vehicular content distribution using parked vehicles

The sharing at roadside: Vehicular content distribution usin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Nianbo Liu Ming Liu Guihai Chen Jiannong Cao School of Computer Science and Engineering University of Electronic Science and Technology Chengdu China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China Department of Computing Hong Kong Polytechnic University Hong Kong China

ISBN: (纸本)9781467307734;9781467307758

In Vehicular Ad Hoc Networks (VANETs), content distribution directly relies on the fleeting and dynamic contacts between moving vehicles, which often leads to prolonged downloading delay and terrible user experience. Deploying Wifi-based Access Points (APs) could relieve this problem, but it often requires a large amount of investment, especially at the city scale. In this paper, we propose the idea of ParkCast, which doesn't need investment, but leverages roadside parking to distribute contents in urban VANETs. With wireless device and rechargable battery, parked vehicles can communicate with any vehicles driving through them. Owing to the extensive parking in cities, available resources and contact opportunities for sharing are largely increased. To each road, parked vehicles at roadside are grouped into a line cluster as far as possible, which is locally coordinated for node selection and data transmission. Such a collaborative design paradigm exploits the sequential contacts between moving vehicles and parked ones, implements sequential file transfer, reduces unnecessary messages and collisions, and then expedites content distribution greatly. We investigate ParkCast through theoretic analysis and realistic survey and simulation. The results prove that our scheme achieve high performance in distribution of contents with different sizes, especially in sparse traffic conditions.

关键词： Vehicles Magnetic heads Roads Delay Network coding Collaboration Cities and towns

来源：评论

学校读者我要写书评

暂无评论

UPPAAL-SMC: Statistical model checking for priced timed automata 10

UPPAAL-SMC: Statistical model checking for priced timed auto...

引用

10th Workshop on Quantitative Aspects of Programming Languages and systems, QAPL 2012

作者： Bulychev, Peter David, Alexandre Larsen, Kim Guldstrand Mikučionis, Marius Poulsen, Danny Bøgsted Legay, Axel Wang, Zheng Department of Computer Science Aalborg University Denmark INRIA Rennes France Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University China

This paper offers a survey of UPPAAL-SMC, a major extension of the real-Time verification tool UPPAAL. UPPAAL-SMC allows for the efficient analysis of performance properties of networks of priced timed automata under a natural stochastic semantics. In particular, UPPAAL-SMC relies on a series of extensions of the statistical model checking approach generalized to handle real-Time systems and estimate undecidable problems. UPPAAL-SMC comes together with a friendly user interface that allows a user to specify complex problems in an efficient manner as well as to get feedback in the form of probability distributions and compare probabilities to analyze performance aspects of systems. The focus of the survey is on the evolution of the tool - including modeling and specification formalisms as well as techniques applied -Together with applications of the tool to case studies.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Optimal adaptive antijamming in wireless sensor networks

引用

International Journal of Distributed Sensor Networks 2012年第12期2012卷 1-9页

作者： Zhu, Yanmin Li, Xiangpeng Li, Bo Department of Computer Science and Engineering Shanghai Jiao Tong University Minhang Shanghai 200240 China Shanghai Key Lab of Scalable Computing and Systems Shanghai Jiao Tong University Minhang Shanghai 200240 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong

Wireless sensor networks have been widely applied to various application domains such as environmental monitoring and surveillance. Because of reliance on the open transmission media, a sensor network may suffer from radio jamming attacks, which are easy to launch but difficult to defend. Attacked by jamming signals, a sensor network may experience corrupted packets and low network throughput. A number of defense techniques have been proposed. However, each defense technique is suitable for only a limited range of network and jamming conditions. This paper proposes an adaptive approach to antijamming for sensor networks by combining the strength of state-of-the-art antijamming techniques, which enables each node to adaptively select the optimal antijamming technique for different jamming conditions. The great challenge is that the sensor network undergoes varying jamming conditions over time. We address this challenge by formulating the antijamming problem of the sensor network as a Markov decision process and propose an efficient algorithm for computing the best antijamming strategy. By comprehensive simulation experiments, we demonstrate that a sensor network using the derived antijamming strategy can well defend from radio jamming attacks and in the meanwhile retain high energy efficiency. © 2012 Yanmin Zhu et al.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Dynamics of coexistence of asexual and sexual reproduction in adaptive landscape

Dynamics of coexistence of asexual and sexual reproduction i...

引用

2012 IEEE 6th International Conference on systems Biology, ISB 2012

作者： Jiao, Shuyun Wang, Yanbo Ao, Ping Shanghai Center for Systems Biomedicine Key Laboratory of Systems Biomedicine of Ministry of Education Shanghai Jiao Tong University 200240 Shanghai China Department of Mathematics Xinyang Normal University 464000 Xinyang Henan China Department of Computer Science and Engineering Shanghai Jiao Tong University 200240 Shanghai China Department of Physics Shanghai Jiao Tong University 200240 Shanghai China

ISBN: (纸本)9781467343985

Background: The dynamics for species, especially rare species, with mixed type reproduction is instructive and meaningful for predicting the extinction of them. Though the extinction time is still a difficult problem for sexual or asexual populations. Adaptive landscape introduced by Wright, a powerful concept in systems biology can describe the evolution of organisms. To our knowledge, the dynamical of inhomogenous reproductive organisms have not investigated by a simple model globally. Methods: We describe how a Wright-Fisher process maps to the dynamics of a population with mixed type. We analytically construct adaptive landscape from the general diffusion equation. It shows that the construction is dynamical and the adaptive landscape is independent of the existence and normalization of the stationary distribution. Results: We first give a global model describing the evolution of an inhomogenous reproductive population by adaptive landscape. We visualize the dynamical behavior by adaptive landscape. Finite and infinite potential occur in the process. These results suggest a possible way to investigate the complex reproductive process in an inhomogeneous reproductive population. © 2012 IEEE.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Algorithms and analyses of logical difference of graded lower and upper approximation operators

Algorithms and analyses of logical difference of graded lowe...

引用

2012 International Conference on computer science and Information Processing, CSIP 2012

作者： Zhang, Xianyong Miao, Duoqian Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China College of Mathematics and Software Science Sichuan Normal University Chengdu Sichuan 610068 China

ISBN: (纸本)9781467314114

Grade serves as a fundamental quantitative index, and the graded rough set model is a basic model. Thus, this paper aims to investigate an original logical difference in the graded rough set model. According to the specific logical requirement on the grade index, the logical difference is put forward based on the graded lower and upper approximation operators;the new concept has the practical logical quantitative meaning. Then, both the macroscopic essence and microscopic fundamental structure are obtained for the new concept. For calculation, two algorithms, the conventional and microscopic algorithms are proposed and analyzed emphatically, and we conclude that the microscopic algorithm has more advantages in time and space complexity. Finally, the logical difference and its algorithms are both illustrated by an example. © 2012 IEEE.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

IncMR: Incremental Data Processing Based on MapReduce

IncMR: Incremental Data Processing Based on MapReduce

引用

IEEE International Conference on Cloud computing, CLOUD

作者： Cairong Yan Xin Yang Ze Yu Min Li Xiaolin Li Department of Computer Science and Technology Donghua University Shanghai China Scalable Software Systems Laboratory University of Florida FL USA

ISBN: (纸本)9781467328920

MapReduce programming model is widely used for large scale and one-time data-intensive distributed computing, but lacks flexibility and efficiency of processing small incremental data. IncMR framework is proposed in this paper for incrementally processing new data of a large data set, which takes state as implicit input and combines it with new data. Map tasks are created according to new splits instead of entire splits while reduce tasks fetch their inputs including the state and the intermediate results of new map tasks from designate nodes or local nodes. Data locality is considered as one of the main optimization means for job scheduling. It is implemented based on Hadoop, compatible with the original MapReduce interfaces and transparent to users. Experiments show that non-iterative algorithms running in MapReduce framework can be migrated to IncMR directly to get efficient incremental and continuous processing without any modification. IncMR is competitive and in all studied cases runs faster than that processing the entire data set.

关键词： Computational modeling Data processing Algorithm design and analysis Data models Programming Parallel processing Distributed databases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：