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

Stark Shift Control of Single Optical centers in Diamond

Physical Review Letters 2006年第8期97卷 083002-083002页

作者： Ph. Tamarat T. Gaebel J. R. Rabeau M. Khan A. D. Greentree H. Wilson L. C. L. Hollenberg S. Prawer P. Hemmer F. Jelezko J. Wrachtrup 3. Physical Institute University of Stuttgart 70550 Stuttgart Germany School of Physics University of Melbourne Victoria Australia Department of Electrical and Computer Engineering Texas A&M University USA Center of Excellence for Quantum Computer Technology School of Physics University of Melbourne Australia

Lifetime-limited optical excitation lines of single nitrogen-vacancy (NV) defect centers in diamond have been observed at liquid helium temperature. They display unprecedented spectral stability over many seconds and excitation cycles. Spectral tuning of the spin-selective optical resonances was performed via the application of an external electric field (i.e., the Stark shift). A rich variety of Stark shifts were observed including linear as well as quadratic components. The ability to tune the excitation lines of single NV centers has potential applications in quantum information processing.

关键词： Diamonds

来源：评论

学校读者我要写书评

暂无评论

BlueGene/L Failure Analysis and Prediction Models

BlueGene/L Failure Analysis and Prediction Models

引用

International Conference on Dependable Systems and Networks (DSN)

作者： Yinglung Liang Yanyong Zhang A. Sivasubramaniam M. Jette R. Sahoo Electrical & Computer Engineering Department Rutgers University USA Computational Resource Management Group Lawrence Livemore National Laboratory USA Computer Science & Engineering Department Pennslyvania State University USA Exploratory Systems Software Department IBM Thomas J. Watson Research Center USA

The growing computational and storage needs of several scientific applications mandate the deployment of extreme-scale parallel machines, such as IBM's BlueGene/L which can accommodate as many as 128 K processors. One of the challenges when designing and deploying these systems in a production setting is the need to take failure occurrences, whether it be in the hardware or in the software, into account. Earlier work has shown that conventional runtime fault-tolerant techniques such as periodic checkpointing are not effective to the emerging systems. Instead, the ability to predict failure occurrences can help develop more effective checkpointing strategies. Failure prediction has long been regarded as a challenging research problem, mainly due to the lack of realistic failure data from actual production systems. In this study, we have collected RAS event logs from BlueGene/L over a period of more than 100 days. We have investigated the characteristics of fatal failure events, as well as the correlation between fatal events and non-fatal events. Based on the observations, we have developed three simple yet effective failure prediction methods, which can predict around 80% of the memory and network failures, and 47% of the application I/O failures

关键词： Failure analysis Predictive models Production systems Checkpointing Concurrent computing Parallel machines Hardware Runtime Fault tolerant systems Prediction methods

来源：评论

学校读者我要写书评

暂无评论

GSAF: A Grid-based Services Transfer Framework

GSAF: A Grid-based Services Transfer Framework

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： Jun Tang Chunyan Miao Qifeng Lin Mi Zhang Wei Wang Baile Shi Department of Computing Information and Technology Fudan University China Divisions of Software Systems School of Computer Engineering Nanyang Technological University Singapore E-Business Research Center Software School Fudan University China

In recent years, traditional computing systems face the problems of scalability as the need for information processing services is ever increasing. Grid, as a pool of computing resources, solves the problem in some degree by providing an integrated computing and resources environment. Thus, there emerge many strategies related to grid resource allocation management (GRAM). However, almost all of these strategies focus on how to allocate the existing computing resources but overlook the possibility of controlling these resources. Therefore, services and computing nodes are always tightly coupled. In this paper, we describe a new framework called GSAF (a grid-based services transfer framework) to solve the problem. GSAF binds services and computing nodes dynamically through services migration and service cache to break the tight coupling. The migration of service components to more efficient computing nodes helps balance the processing burden and extends the computing abilities. In our experiment, we provide a prototype application of GSAF in the data mining system to demonstrate it.

关键词： Grid computing Resource management Containers Prototypes Data mining Runtime software systems Face Scalability Information processing

来源：评论

学校读者我要写书评

暂无评论

DaTA -- Data-Transparent Authentication Without Communication Overhead

DaTA -- Data-Transparent Authentication Without Communicatio...

引用

International Conference on Security and Privacy for Emerging Areas in Communications Networks (SecureComm)

作者： Songqing Chen Shiping Chen Xinyuan Wang Sushil Jajodia Department of Computer Science George Mason University USA Center for Secure Information Systems George Mason University USA Department of Information and Software Engineering George Mason University USA

With the development of Internet computing techniques, continuous data streams from remote sites are commonly used in scientific and commercial applications. Correspondingly, there is increasing demand of assuring the integrity and authenticity of received data streams. Existing strategies of assuring data integrity and authenticity mainly use message authentication codes (MAC) generated on data blocks and transfer the MAC to the receiver for authentication through either out of band communication or in band communication. Transferring the MAC via out of band communication inevitably introduces communication overhead and additional complexity to synchronize the out of band communication with the data communication. Transferring the MAC via in band channel can be achieved by either appending the MAC to the original data or embedding the MAC into the original data, which would either incur communication overhead or change the original data. It would be desirable to be able to authenticate the stream data without any communication overhead and changing the original data at the same time. To deal with data packet or block loss, many of existing stream data authentication schemes rely on hash chaining, the current usage of which results in uncertainty in authenticating the subsequent data blocks once the first data packet or block loss is detected. In this paper, we propose a novel application layer authentication strategy called DaTA. This authentication scheme requires no change to the original data and causes no additional communication overhead. In addition, it can continue authenticating the rest of data stream even if some data loss has been detected. Our analysis shows that our authentication scheme is robust against packet loss and network jitter. We have implemented a prototype system to evaluate its performance. Our empirical results show that our proposed scheme is efficient and practical under various network conditions

关键词： Message authentication Internet Streaming media Hurricanes Demand forecasting computer science Information systems software engineering Data communication Propagation losses

来源：评论

学校读者我要写书评

暂无评论

Optimal Dynamic Asset Allocation: A Stochastic Invariance Approach

Optimal Dynamic Asset Allocation: A Stochastic Invariance Ap...

引用

IEEE Conference on Decision and Control

作者： Gianni Pola Giordano Pola CAAM SGR SpA Quantitative Research Milan Italy Department of Electrical Engineering and Computer Science Center of Excellence DEWS University of L'Aquila L'Aquila Italy

ISBN: (纸本)1424401704

Optimal asset allocation deals with how to divide the investor's wealth across some asset-classes in order to maximize the investor's gain. We consider the optimal asset allocation in a multi-period investment settings: optimal dynamic asset allocation provides the (optimal) re-balancing policy to accomplish some investment's criteria. Given a sequence of target sets, which represent the portfolio specifications at each re-balancing time, an optimal portfolio allocation is synthesized for maximizing the joint probability for the portfolio to fulfil the target sets requirements. The approach pursued is based on dynamic programming. The optimal solution is shown to conditionally depend on the portfolio realization, thus providing a practical scheme for the dynamic portfolio re-balancing. Finally some case studies are given to show the proposed methodology

关键词： Asset management Stochastic processes Portfolios Investments Optimal control Dynamic programming USA Councils Finance Gaussian distribution Contracts

来源：评论

学校读者我要写书评

暂无评论

Nonlinear modeling of a flight vehicle using fuzzy clustering

Nonlinear modeling of a flight vehicle using fuzzy clusterin...

引用

IEEE International Conference on Granular Computing (GRC)

作者： A.R. Mehrabian S.V. Hashemi J. Roshanian S. Mohagheghi The Control and Intelligence Processing Center of Excellence University of Tehran Iran Department of AeroSpace Engineering K.N. Toosi University of Technology Tehran Iran School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA

来源：评论

学校读者我要写书评

暂无评论

Path Planning in an Environment with Static and Dynamic Obstacles Using Genetic Algorithm: A Simplified Search Space Approach

Path Planning in an Environment with Static and Dynamic Obst...

引用

Congress on Evolutionary Computation

作者： H. Mahjoubi F. Bahrami C. Lucas Control and Intelligence Processing Center of Excellence Electrical and Computer Engineering Department University of Tehran Tehran Iran School of Cognitive Sciences Institute of Studies in Theoretical Physics and Mathematics Tehran Iran

This paper discusses a novel step by step path planning method which uses genetic algorithm (GA) to find the feasible and suitable paths in an environment with static and dynamic obstacles. To increase the speed of calculations, dimension of the search space is reduced by developing a new method to represent the environment. This representation method is based on detecting the corners of circumferential polygons of all obstacles as representatives of the environment. Each individual (or path) is a subsequence of these points including the start and destination points as the first and last genes in the sequence. Thus, each individual will be of a variable length. If an individual represents a path which passes over some obstacles, it will be unfeasible; otherwise it represents a feasible path. To produce new generations, four evolutionary operators are defined. The goal is to find a short feasible path, which clearly is not unique. In addition, using a step by step path planning approach and updating the representation of the environment at each step will result in a robust performance of the algorithm in two dimensional (2D) static and dynamic environments.

关键词： Path planning Genetic algorithms Layout Humans Robustness Manufacturing Assembly systems Transportation Process control Intelligent control

来源：评论

学校读者我要写书评

暂无评论

Utilizing Network Features for Privacy Violation Detection

Utilizing Network Features for Privacy Violation Detection

引用

International Conference on Communication Systems software and Middleware (COMSWARE)

作者： J. Bhattacharya R. Dass V. Kapoor S.K. Gupta Department of Computer Science and Engineering Indian Institute of Technology New Delhi India Computer and Information Systems Group Indian Institute of Management Ahmedabad India Center of Excellence Oracle HP e-Governance Gurgaon India

Privacy, its violations and techniques to circumvent privacy violation have grabbed the centre-stage of both academia and industry in recent months. Corporations worldwide have become conscious of the implications of privacy violation and its impact on them and to other stakeholders. Moreover, nations across the world are coming out with privacy protecting legislations to prevent data privacy violations. Such legislations however expose organizations to the issues of intentional or unintentional violation of privacy data. A violation by either malicious external hackers or by internal employees can expose the organizations to costly litigations. In this paper, we propose PRIVDAM; a data mining based intelligent architecture of a privacy violation detection and monitoring system whose purpose is to detect possible privacy violations and to prevent them in the future. This paper elaborates on the use of network characteristics for differentiating between normal network traffic and potential malicious attacks. These attacks are usually hidden in common network services like http, ftp, udp etc. Experimental evaluations illustrate that our approach is scalable as well as robust and accurate in detecting privacy violations

关键词： Data privacy Protection Legislation Monitoring computer science computer hacking Data mining Data security Information security Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Topological Localization Based on Salient Regions in Unknown Environments

Topological Localization Based on Salient Regions in Unknown...

引用

International Conference on Pattern Recognition

作者： Lu Wang Yuling Li Zixing Cai Department of Computer Science Zhongyuan University of Technology Zhengzhou Zhengzhou Henan China Center of Intelligent System and Software School of Information Science and Engineering Central South University Changsha Hunan China

ISBN: (纸本)0769525210

This paper presents a new topological localization system for mobile robot navigation based on salient visual regions. These salient regions are obtained by computing the opponencies of color and texture among multi-scale image spaces. Then they are organized to construct the vertex of topological map using hidden Markov model. So localization problem can be transformed to the evaluation problem of HMM. In our system, the topological map of environment can be created online and the robot locates itself concurrently. Experiments show that higher ratio of vertex recognition, that is localization, is obtained. And our system can guarantee mobile robot navigation safely in unknown environments

关键词： Mobile robots Hidden Markov models Lighting Navigation Prototypes Histograms Space technology Robot kinematics Cameras computer vision

来源：评论

学校读者我要写书评

暂无评论

Impact of Load Sharing on Provisioning Services with Consistency Requirements

Impact of Load Sharing on Provisioning Services with Consist...

引用

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

作者： D. Villela V. Misra D. Rubenstein S. Sahu Department of Electrical Engineering Columbia University NY USA Department of Computer Science Columbia University NY USA Network Software and Servers IBM Thomas J. Watson Research Center Hawthorne NY USA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：