The Art of Project Management covers it all--from practical methods for making sure work gets done right and on time, to the mindset that can make you a great leader motivating your team to do their best. Reading this...
详细信息
ISBN:
(纸本)9780596007867
The Art of Project Management covers it all--from practical methods for making sure work gets done right and on time, to the mindset that can make you a great leader motivating your team to do their best. Reading this was like reading the blueprint for how the best projects are managed at Microsoft... I wish we always put these lessons into action!" --Joe Belfiore, General Manager, E-home Division, Microsoft Corporation"Berkun has written a fast paced, jargon-free and witty guide to what he wisely refers to as the 'art' of project management. It's a great introduction to the discipline. Seasoned and new managers will benefit from Berkun's perspectives." --Joe Mirza, Director, CNET Networks (***)"Most books with the words 'project management' in the title are dry tomes. If that's what you are expecting to hear from Berkun's book, you will be pleasantly surprised. Sure, it's about project management. But it's also about creativity, situational problem-solving, and leadership. If you're a team member, project manager, or even a non-technical stakeholder, Scott offers dozens of practical tools and techniques you can use, and questions you can ask, to ensure your projects succeed." --Bill Bliss, Senior VP of product and customer experience, *** The Art of Project Management, you'll learn from a veteran manager of software and web development how to plan, manage, and lead projects. This personal account of hard lessons learned over a decade of work in the industry distills complex concepts and challenges into practical nuggets of useful advice. Inspiring, funny, honest, and compelling, this is the book you and your team need to have within arms reach. It will serve you well with your current work, and on future projects to *** include:How to make things happenMaking good decisionsSpecifications and requirementsIdeas and what to do with themHow not to annoy peopleLeadership and trustThe truth about making datesWhat to do when things go wrong
A resilient function is a randomness extractor which outputs truly random bits from bit fixing sources. In this paper, we discuss on some topics related to resilient functions: almost resilient functions, covering rad...
详细信息
A resilient function is a randomness extractor which outputs truly random bits from bit fixing sources. In this paper, we discuss on some topics related to resilient functions: almost resilient functions, covering radius of Reed-Muller codes for resilient functions, and PC(l) of order k Boolean functions. T. Johansson, D. Stinson and the author introduced the notion of almost resilient functions, and showed its construction and a bound. In modern terminology, it is the first construction of a deterministic extractor, where a deterministic extractor outputs almost truly random bits from bit fixing sources. By using recently developed deterministic extractors, we can show a more efficient reduction of m-bit (1, 2)-OT to 1-bit (1, 2)-OT than the previously known ones. We then raise it as an open problem to construct almost zig-zag functions which can improve the OT reduction further more. The covering radius of Reed-Muller codes for resilient functions was introduced by the author as a security criterion of stream ciphers against both correlation attack and low degree approximation attack (for example, the linear attack). Its lower bounds and upper bounds were also derived. We now discuss on its extension to deterministic extractors, i.e., covering radius of Reed-Muller codes for deterministic extractors, A Boolean function satisfies PC(l) of order k if its autocorrelation function is a resilient function, and the first general construction method was given by the author. The author also introduced the notion of almost PC(l) of order k, and presented its construction. Now we finally discuss on its extension to multiple output bit Boolean functions F(X) such that the autocorrelation functions of F(X) are deterministic extractors
So-called non-local boxes, which have been introduced as an idealization n different respects - of the behavior of entangled quantum states, have been known to allow for unconditional bit commitment between the two ...
详细信息
So-called non-local boxes, which have been introduced as an idealization n different respects - of the behavior of entangled quantum states, have been known to allow for unconditional bit commitment between the two involved parties. We show that, actually, any possible non-local correlation which produces random bits on both sides can be used to implement bit commitment, and that this holds even when the parties are allowed to delay their inputs to the box. Since a particular example is the behavior of an EPR pair, this resource allows for implementing unconditionally secure bit commitment as long as the parties cannot entangle their Qbits with any other system
Copyright and Reprint Permissions: Abstracting is permitted with credit to the source. Libraries may photocopy beyond the limits of US copyright law, for private use of patrons, those articles in this volume that carr...
Copyright and Reprint Permissions: Abstracting is permitted with credit to the source. Libraries may photocopy beyond the limits of US copyright law, for private use of patrons, those articles in this volume that carry a code at the bottom of the first page, provided that the per-copy fee indicated in the code is paid through the Copyright Clearance Center. The papers in this book comprise the proceedings of the meeting mentioned on the cover and title page. They reflect the authors' opinions and, in the interests of timely dissemination, are published as presented and without change. Their inclusion in this publication does not necessarily constitute endorsement by the editors or the Institute of Electrical and Electronics Engineers, Inc.
Unconditionally secure authentication codes provide information theoretic security against an adversary who observes authenticated messages and then wants to construct a fraudulent message that is acceptable by the re...
详细信息
Unconditionally secure authentication codes provide information theoretic security against an adversary who observes authenticated messages and then wants to construct a fraudulent message that is acceptable by the receiver. The attack model for these codes has recently been strengthened and adaptive adversaries with oracle access have been introduced. In this paper we give an analysis of this new model and derive information theoretic bounds on the success probability and key size of the codes. Our analysis treats two games that an adversary can play: an offline attack in which the adversary is allowed to query a verification oracle and then to construct the spoofing query; and an on-line attack in which the adversary interacts with the verification oracle and wins as soon as he constructs an acceptable message. We describe the best strategy of the adversary in each case
The problems of broadcast and multi-party computation are usually treated with respect to a small number of standard models. In this overview, with respect to two important such standard models, we address the followi...
详细信息
The problems of broadcast and multi-party computation are usually treated with respect to a small number of standard models. In this overview, with respect to two important such standard models, we address the following questions. Can the same problems still be solved when assuming less? What happens if we try to tolerate more corrupted players than provably tolerable? We conclude with a protocol for multi-party computation based on almost no setup assumptions at all
The present paper has two aims. One is on a practical aspect to survey briefly about an unconditionally secure signature which is known to be a useful cryptographic tool for application that requires long-term integri...
详细信息
The present paper has two aims. One is on a practical aspect to survey briefly about an unconditionally secure signature which is known to be a useful cryptographic tool for application that requires long-term integrity. The other aim is to present theoretical aspect of the relationship between authentication scheme and encryption scheme from observing the mechanism of chaffing-and-winnowing
It is known that a message can be transmitted safely against any wiretap per via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity Cs, which is usually smaller than th...
详细信息
It is known that a message can be transmitted safely against any wiretap per via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity Cs, which is usually smaller than the channel capacity C. In order to remove the loss C - Cs, we propose a multiplex coding scheme with plural independent messages. In this paper, it is shown that the proposed multiplex coding scheme can attain the channel capacity as the total rate of the plural messages and the perfect secrecy for each message. The coding theorem is proved by extending Hayashi's proof, in which the coding of the channel resolvability is applied to the wiretap channel
暂无评论