Security business

• Record Nr.: UNISA996336279603316
• Pubbl/distr/stampa: Fort Atkinson, WI : , : Endeavor Business Media, LLC, , 2019-
• ISSN: 2688-058X
• Descrizione fisica: 1 online resource
• Disciplina: 621.38928
• Soggetti: Security systems industry
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Periodico
• Note generali: "The Path to Greater Profits for Security Integrators."

The empowered manager : positive political skills at work / / Peter Block

• Record Nr.: UNINA9910798887103321
• Autore: Block Peter
• Pubbl/distr/stampa: Hoboken : , : Wiley, , [2017]; ©2017
• ISBN: 1-119-28241-1
• Edizione: [Second edition.]
• Descrizione fisica: 1 online resource (239 pages) : illustrations
• Classificazione: BUS085000
• Disciplina: 658.4/095
• Soggetti: Organizational behavior; Organizational effectiveness; Office politics; Executive ability
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Revised edition of the author's The empowered manager, 1987.
• Nota di bibliografia: Includes bibliographical references and index.
• Sommario/riassunto: "Empowerment produces the conditions for high performance. Especially for middle managers and below. Empowered cultures attract and retain talent. They produce high achievement, high accountability and high commitment. The Empowered Manager uncovers a roadmap to creating a more accountable culture in today's fragmented and virtual world. Bestselling author Peter Block is a true visionary: author of the classic Flawless Consulting, his work is about empowerment, stewardship, chosen accountability, and reconciliation of community. In this book, he returns his eye toward management to renew our efforts to create a shift in the traditional hierarchy. Twenty years after the original book, Block talks of why it is so difficult to both open the door to empowerment and more importantly, have people walk through it. It is more important than ever to create a culture in which all members of an organization are treated as entrepreneurs, giving them ownership over their role and responsibilities. This is in the face of the reality that most employees want safety, not the adventure of empowerment. Peter enhances the first edition of the book by acknowledging employees wish for dependency. Their longing for the days when a job carried a promise of a future, and companies cared more about the product and the people, than about the money. This is written primarily for people in the middle. Good managers and employees who care more about doing good work and treating people right, than ambition and making it into the ruling class. The upper middle and below is where there is the greatest need for great management. Which builds on valuing strengths, and allowing talent the space to stretch and achieve. Almost independent of the power points of people at the top. This book shows you how a new approach to management empowers all employees at all levels, and culminates in better business outcomes for the entire organization. Help shape a culture of commitment Develop the political skills to negotiate successfully Take responsibility for your actions Learn to fail up, and face setbacks with courage If you feel controlled by bureaucracy, unrewarded for creativity, and from a distance, powerless to control your own destiny, this book is the breath of fresh air your career has been craving. Timeless tips from a master of business strategy alongside a framework for more effective management makes The Empowered Manager a must-read guide for anyone doing business today"--

Probabilistic combinatorial optimization on graphs [[electronic resource] /] / Cécile Murat and Vangelis Th. Paschos

• Record Nr.: UNISA996216942703316
• Autore: Murat Cecile
• Pubbl/distr/stampa: London ; ; Newport Beach, CA, : ISTE, 2006
• ISBN: 1-280-51061-7; 9786610510610; 1-84704-483-2; 0-470-39464-1; 0-470-61250-9; 1-84704-583-9
• Descrizione fisica: 1 online resource (269 p.)
• Collana: ISTE ; ; v.105
• Altri autori (Persone): PaschosVangelis Th
• Disciplina: 511.6; 519.2
• Soggetti: Combinatorial probabilities; Combinatorial optimization; Random graphs
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Description based upon print version of record.
• Nota di bibliografia: Includes bibliographical references (p. [255]-259) and index.
• Nota di contenuto: Probabilistic Combinatorial Optimization on Graphs; Contents; Preface; Chapter 1. A Short Insight into Probabilistic Combinatorial Optimization; 1.1. Motivations and applications; 1.2. A formalism for probabilistic combinatorial optimization; 1.3. The main methodological issues dealing with probabilistic combinatorial optimization; 1.3.1. Complexity issues; 1.3.1.1. Membership in NPO is not always obvious; 1.3.1.2. Complexity of deterministic vs. complexity of probabilistic optimization problems; 1.3.2. Solution issues; 1.3.2.1. Characterization of optimal a priori solutions; 1.3.2.2. Polynomial subcases1.3.2.3. Exact solutions and polynomial approximation issues; 1.4. Miscellaneous and bibliographic notes; First Part. Probabilistic Graph-Problems; Chapter 2. The Probabilistic Maximum Independent Set; 2.1. The modification strategies and a preliminary result; 2.1.1. Strategy M1; 2.1.2. Strategies M2 and M3; 2.1.3. Strategy M4; 2.1.4. Strategy M5; 2.1.5. A general mathematical ; formulation for the five functionals; 2.2. PROBABILISTIC MAX INDEPENDENT SET1; 2.2.1. Computing optimal a priori solutions; 2.2.2. Approximating optimal solutions; 2.2.3. Dealing with bipartite graphs2.3. PROBABILISTIC MAX INDEPENDENT SET2 and 3; 2.3.1. Expressions for E(G, S, M2) and E(G, S, M3); 2.3.2. An upper bound for the complexity of E(G, S, M2); 2.3.3. Bounds for E(G, S, M2); 2.3.4. Approximating optimal solutions; 2.3.4.1. Using argmax {ΣviESpi} as an a priori solution; 2.3.4.2. Using approximations of MAX INDEPENDENT SET; 2.3.5. Dealing with bipartite graphs; 2.4. PROBABILISTIC MAX INDEPENDENT SET4; 2.4.1. An expression for E(G, S, M4); 2.4.2. Using S* or argmax{ΣviESpi} as an a priori solution; 2.4.3. Dealing with bipartite graphs; 2.5. PROBABILISTIC MAX INDEPENDENT SET52.5.1. In general graphs; 2.5.2. In bipartite graphs; 2.6. Summary of the results; 2.7. Methodological questions; 2.7.1. Maximizing a criterion associated with gain; 2.7.1.1. The minimum gain criterion; 2.7.1.2. The maximum gain criterion; 2.7.2. Minimizing a criterion associated with regret; 2.7.2.1. The maximum regret criterion; 2.7.3. Optimizing expectation; 2.8. Proofs of the results; 2.8.1. Proof of Proposition 2.1; 2.8.2. Proof of Theorem 2.6; 2.8.3. Proof of Proposition 2.3; 2.8.4. Proof of Theorem 2.13; Chapter 3. The Probabilistic Minimum Vertex Cover3.1. The strategies M1, M2 and M3 and a general preliminary result; 3.1.1. Specification of M1, M2 and M3; 3.1.1.1. Strategy M1; 3.1.1.2. Strategy M2; 3.1.1.3. Strategy M3; 3.1.2. A first expression for the functionals; 3.2. PROBABILISTIC MIN VERTEX COVER1; 3.3. PROBABILISTIC MIN VERTEX COVER2; 3.4. PROBABILISTIC MIN VERTEX COVER3; 3.4.1. Building E(G, C, M3); 3.4.2. Bounds for E(G, C, M3); 3.5. Some methodological questions; 3.6. Proofs of the results; 3.6.1. Proof of Theorem 3.3; 3.6.2. On the the bounds obtained in Theorem 3.3; Chapter 4. The Probabilistic Longest Path
• Sommario/riassunto: This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring. Those who possess a sound knowledge of the subject mater will find the title of great interest, but those who have only some mathematical familiarity and knowledge about complexity and approximation theory will also find it an accessible and informative read.