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

International Conference on Advancements in Nuclear Instrumentation Measurement Methods and their Applications (ANIMMA)

作者： Y. Moline M. Thevenin G. Corre M. Paindavoine DePaul University University of Utah's School of Computing Department of Computer Science & Engineering Information School University of Washington Carnegie Mellon University's Software Engineering Institute

ISBN: (纸本)9781479999194

This paper introduces a specific Multiple Program Multiple Data (MPMD) architecture designed to address the issues of nuclear instrumentation: pulse processing, real-time, multi-channel flexibility, dead-time management and programmability. The proposed architecture comprises a set of independent and programmable functional units. Their execution is driven by the pulses arrival. It is able to deal with non-deterministic events and program durations. The virtual prototype of the architecture is developed in cycle-accurate SystemC and shows promising results in terms of scalability while maintaining zero dead-time. This architecture paves the way for novel programmable embedded real-time pulse processing restricted until now to offline processing.

关键词： Computer architecture Instruments software algorithms Digital signal processing Scalability Field programmable gate arrays Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Composite differential evolution with queueing selection for multimodal optimization

Composite differential evolution with queueing selection for...

引用

Congress on Evolutionary Computation

作者： Yu-Hui Zhang Yue-Jiao Gong Wei-Neng Chen Jun Zhang Engineering Research Center of Supercomputing Engineering Software Ministry of Education Department of Computer Science Sun Yat-sen University School of Advanced Computing Sun Yat-sen University Guangzhou China

ISBN: (纸本)9781479974931

The aim of multimodal optimization is to locate multiple optima of a given problem. Evolutionary algorithms (EAs) are one of the most promising candidates for multimodal optimization. However, due to the use of greedy selection operators, the population of an EA will generally converge to one region of attraction. By incorporating a well-designed selection operator that can facilitate the formation of different species, EAs will be able to allow multiple convergence. Following this research avenue, we propose a novel selection operator, namely, queueing selection (QS) and integrate it with one of the most promising DE variants, called composite differential evolution (CoDE). The integrated algorithm (denoted by CoDE-QS) inherits the strong global search ability of CoDE and is capable of finding and maintaining multiple optima. It has been tested on the CEC2013 benchmark functions. Experimental results show that CoDE-QS is very competitive.

关键词： Sociology Statistics Optimization Algorithm design and analysis Complexity theory Maintenance engineering Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Wireshark Window Authentication Based Packet Captureing Scheme to Pervent DDoS Related Security Issues in Cloud Network Nodes

Wireshark Window Authentication Based Packet Captureing Sche...

引用

2015 6th IEEE International Conference on software engineering and Service science(ICSESS 2015)

作者： Waqar Ali Jun Sang Hamad Naeem Rashid Naeem Ali Raza Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education School of Software Engineering Chongqing University Department of computer science International Islamic University

DoS(Denial of Service) attack forces a cloud network node to handle few unauthorized access that employ unwanted computing cycle. As a result, the cloud node response is slow as usual and resource on cloud network becomes unavailable. Some Dos attacks are Ping of Death, Teardrop,Snork, Locking authentication, SYN flooding, Operating System Attacks etc. The most vulnerable incident happen when the adversary is committed DDoS(Distributed Denial of Service)attack with comprised cloud network. In this paper, the prevention techniques for DDoS(Distributed Denial of Service) attack in cloud nodes were discussed. a dynamic window scheme in cloud nodes to determine a message verification to resolve unnecessary packet processing was proposed

关键词： DoS attack DDoS attack cloud network Cloud Nodes dynamic winodws

来源：评论

学校读者我要写书评

暂无评论

A review on Internet of Things (IoT), Internet of Everything (IoE) and Internet of Nano Things (IoNT)

A review on Internet of Things (IoT), Internet of Everything...

引用

Internet Technologies and Applications (ITA)

作者： Mahdi H. Miraz Maaruf Ali Peter S. Excell Rich Picking Department of Computer Science and Software Engineering Glyndŵr University Wrexham UK Docklands Campus London Computing and Engineering University of East London UK Glyndŵr University Wrexham UK

The current prominence and future promises of the Internet of Things (IoT), Internet of Everything (IoE) and Internet of Nano Things (IoNT) are extensively reviewed and a summary survey report is presented. The analysis clearly distinguishes between IoT and IoE which are wrongly considered to be the same by many people. Upon examining the current advancement in the fields of IoT, IoE and IoNT, the paper presents scenarios for the possible future expansion of their applications.

关键词： Blogs Business Context Biosensors Roads Instruments

来源：评论

学校读者我要写书评

暂无评论

File system-independent block device support for storage class memory

File system-independent block device support for storage cla...

引用

IEEE Conference on Computer Communications Workshops, INFOCOM Wksps

作者： Yi Wang Tianzheng Wang Zili Shao Duo Liu Jingling Xue College of Computer Science and Software Engineering Shenzhen University Department of Computing The Hong Kong Polytechnic University Department of Computer Science University of Toronto Canada College of Computer Science Chongqing University China School of Computer Science and Engineering University of New South Wales Sydney Australia

Storage class memory (SCM) modules can be placed side-by-side with DRAM on the memory bus, available to memory instructions issued by the CPU. This shift engenders a new “DRAM-SCM” storage architecture and potentially allows near-DRAM secondary storage access speed, which is several orders of magnitude faster than magnetic disk or flash memory. Utilizing SCM as a secondary storage device will have a profound impact on memory hierarchy design, requiring new architectural and operating system support.

关键词： Random access memory Phase change materials Hard disks Computer architecture Kernel Linux

来源：评论

学校读者我要写书评

暂无评论

Fast RFID grouping protocols

Fast RFID grouping protocols

引用

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

作者： Jia Liu Bin Xiao Shigang Chen Feng Zhu Lijun Chen State Key Laboratory for Novel Software Technology Nanjing University China Department of Computing Hong Kong Polytechnic University China Department of Computer & Information Science & Engineering University of Florida USA

In RFID systems, the grouping problem is to efficiently group all tags according to a given partition such that tags in the same group will have the same group ID. Unlike previous research on the unicast transmission from a reader to a tag, grouping provides a fundamental mechanism for efficient multicast transmissions and aggregate queries in large RFID-enabled applications. A message can be transmitted to a group of m tags simultaneously in multicast, which improves the efficiency by m times when comparing with unicast. We study fast grouping protocols in large RFID systems. To the best of our knowledge, it is the first attempt to tackle this practically important yet uninvestigated problem. We start with a straightforward solution called the Enhanced Polling Grouping (EPG) protocol. We then propose a time-efficient FIltering Grouping (FIG) protocol that uses Bloom filters to remove the costly ID transmissions. We point out the limitation of the Bloom-filter based solution due to its intrinsic false positive problem, which leads to our final ConCurrent Grouping (CCG) protocol. With a drastically different design, CCG is able to outperform FIG by exploiting collisions to inform multiple tags of their group ID simultaneously and by removing any wasteful slots in its frame-based execution. Simulation results demonstrate that our best protocol CCG can reduce the execution time by a factor of 11 when comparing with a baseline polling protocol.

关键词： Protocols Radiofrequency identification Labeling Computers Conferences Filtering Unicast

来源：评论

学校读者我要写书评

暂无评论

Is noise always harmful? Visual learning from weakly-related data

Is noise always harmful? Visual learning from weakly-related...

引用

IEEE International Conference on Orange Technologies (ICOT)

作者： Sheng-hua Zhong Yan Liu Kien A. Hua Songtao Wu College of Computer Science and Software Engineering Shenzhen University Shenzhen China Department of Computing The Hong Kong Polytechnic University Hong Kong P.R. China Department of Computer Science University of Central Florida Florida USA

ISBN: (纸本)9781467382380

Noise exists universally in multimedia data, especially in Internet era. For example, tags from web users are often incomplete, arbitrary, and low relevant with the visual information. Intuitively, noise in the dataset is harmful to learning tasks, which implies that huge volumes of image tags from social media can't be utilized directly. To collect the reliable training dataset, labor-intensive manual labeling and various learning based outlier detection techniques are widely used. This paper intends to discuss whether such kind of preprocessing is always needed. We focus on a very normal case in image classification that the available dataset includes a large amount of images weakly related to any target classes. We use deep models as the platform and design a series of experiments to compare the semi-supervised learning performance with/without weakly related unlabeled data. Fortunately, we validate that weakly related data is not always harmful, which is an encouraging finding for research on web image learning.

关键词： Training Standards Machine learning Erbium Data models Multimedia communication Training data

来源：评论

学校读者我要写书评

暂无评论

Active appearance model search using partial least squares regression

Active appearance model search using partial least squares r...

引用

IEEE Visual Communications and Image Processing (VCIP)

作者： Yongxin Ge Chen Min Martin Jagersand Dan Yang School of Software Engineering Chongqing University Chongqing P. R. China Ministry of Education Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing China Department of Computing Science University of Alberta Edmonton Canada

A novel active appearance model (AAM) search algorithm based on partial least squares (PLS) regression is proposed. PLS models the relationship between independent (texture residuals) and dependent (error in the model parameters) variables in the training phase by extracting from independent and dependent variables a set of orthogonal factors called latent variables respectively which have the maximum covariance. During search, the parameter updates with the best predictive power are extracted from the texture residuals. On the other hand, PLS is well suited for the low observation-to-variable ratio context, where the sample covariance matrix is likely to be singular, which is very common in AAM. Experiments show that the proposed method has better performance than the original AAM and comparable performance to AAM search based on Canonical correlation analysis (CCA-AAM) in terms of convergence speed, whilst affording superior computational efficiency.

关键词： Active appearance model Shape Databases Training Face Computational modeling Convergence

来源：评论

学校读者我要写书评

暂无评论

Tomography is Necessary for Universal Entanglement Detection with Single-Copy Observables

引用

Physical Review Letters 2016年第23期116卷 230501-230501页

作者： Dawei Lu Tao Xin Nengkun Yu Zhengfeng Ji Jianxin Chen Guilu Long Jonathan Baugh Xinhua Peng Bei Zeng Raymond Laflamme Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Ontario Canada State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics Tsinghua University Beijing 100084 China Centre for Quantum Computation and Intelligent Systems Faculty of Engineering and Information Technology University of Technology Sydney NSW 2007 Australia Department of Mathematics and Statistics University of Guelph Guelph Ontario N1G 2W1 Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China Joint Center for Quantum Information and Computer Science University of Maryland College Park Maryland 20742 USA Hefei National Laboratory for Physical Sciences at Microscale and Department of Modern Physics University of Science and Technology of China Hefei Anhui 230036 China Canadian Institute for Advanced Research Toronto Ontario M5G 1Z8 Canada Perimeter Institute for Theoretical Physics Waterloo Ontario N2L 2Y5 Canada

Entanglement, one of the central mysteries of quantum mechanics, plays an essential role in numerous tasks of quantum information science. A natural question of both theoretical and experimental importance is whether universal entanglement detection can be accomplished without full state tomography. In this Letter, we prove a no-go theorem that rules out this possibility for nonadaptive schemes that employ single-copy measurements only. We also examine a previously implemented experiment [H. Park et al., Phys. Rev. Lett. 105, 230404 (2010)], which claimed to detect entanglement of two-qubit states via adaptive single-copy measurements without full state tomography. In contrast, our simulation and experiment both support the opposite conclusion that the protocol, indeed, leads to full state tomography, which supplements our no-go theorem. These results reveal a fundamental limit of single-copy measurements in entanglement detection and provide a general framework of the detection of other interesting properties of quantum states, such as the positivity of partial transpose and the k-symmetric extendibility.

关键词： Entanglement detection Entanglement measures Quantum tomography Nuclear magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

Reciprocal Social Strategy in Social Repeated Games

Reciprocal Social Strategy in Social Repeated Games

引用

International Conference on Tools with Artificial Intelligence

作者： Chi-Kong Chan Jianye Hao Ho-fung Leung Department of Computing Hang Seng Management College Shatin Hong Kong School of Software Tianjin University Tianjin China Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin Hong Kong

ISBN: (纸本)9781509001644

In an artificial society where agents repeatedly interact with one another, achieving high level of social utility is generally a challenge. This is especially true when the participating agents are self-interested, and that there is no central authority to coordinate, and direct communication or negotiation are not possible. Recently, Hao and Leung studied a new game theoretic approach, where a new type of repeated game as well as a new reinforcement learning based agent learning method were proposed. In particular, their game mechanism differs from traditional repeated games in that the agents are anonymous, and the agents interact with randomly chosen opponents. Their learning mechanism allows agents to coordinate without negotiations. Despite the promising initial results, however, extended simulation reveals that the outcomes are not stable in the long run, as the high level of cooperation is eventually not sustainable. In this work, we revisit the problem and propose a new learning mechanism as follows. First, we propose an enhanced Q-learning-based framework that allows the agents to better capture both the individual and social utilities that they have learned through observations. Second, we propose a new concept of "social attitude" for determining the action of the agents throughout the game. Simulation results reveal that this approach can achieve higher social utility, including close-to-optimal results in some scenarios, and more importantly, the results seem to be sustainable.

关键词： social repeated games reinforcement learning multi-agents

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：