Muutke küpsiste eelistusi

Security and Policy Driven Computing [Kõva köide]

(Oracle Corporation, Menlo Park, California, USA)
  • Formaat: Hardback, 290 pages, kõrgus x laius: 234x156 mm, kaal: 521 g, 1 Tables, black and white; 85 Illustrations, black and white
  • Ilmumisaeg: 13-Dec-2010
  • Kirjastus: CRC Press Inc
  • ISBN-10: 1439825793
  • ISBN-13: 9781439825792
Teised raamatud teemal:
Security and Policy Driven ComputingSuurem pilt
  • Formaat: Hardback, 290 pages, kõrgus x laius: 234x156 mm, kaal: 521 g, 1 Tables, black and white; 85 Illustrations, black and white
  • Ilmumisaeg: 13-Dec-2010
  • Kirjastus: CRC Press Inc
  • ISBN-10: 1439825793
  • ISBN-13: 9781439825792
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9781439825792.html
Märksõnad:
This advanced treatise on security and policy driven computing presents information for systems engineers on several specific aspects of next generation network and data security methods. Topics discussed include parallel search optimization, policy discovery for storage and data management, storage virtualization and adaptive buffer tuning as well as highly theoretical topics such as quantum availability mechanics, protection mechanics with a quantum operator for anomaly attacks and quantum resolution of future storage conflicts. Chapters include dense equations and code examples. An included preface suffers from unreliable translation. No author credentials are provided. Annotation ©2011 Book News, Inc., Portland, OR (booknews.com)

Security and Policy Driven Computing covers recent advances in security, storage, parallelization, and computing as well as applications. The author incorporates a wealth of analysis, including studies on intrusion detection and key management, computer storage policy, and transactional management.

The book first describes multiple variables and index structure derivation for high dimensional data distribution and applies numeric methods to proposed search methods. It also focuses on discovering relations, logic, and knowledge for policy management. To manage performance, the text discusses contention management for transactional structures, buffer tuning, and test environments. It then illustrates search optimization using truncated functions with paralleled techniques. The final chapters present structures, recovery, message conflicts, and test coverage of quantum policies and explain methods of quantum protection for intrusion prevention.

An overview of security and policy applications for systems and computing, this book explores the latest R&D, emerging technology, and state-of-the-art technical studies of security and policy issues. It also looks to future research and technologies that will propel the innovation of next-generation systems.

Preface xiii
1 A Parallel Search Optimization Using an Adaptive State-Action Index Structure 1(30)
1.1 Introduction
1(1)
1.2 Significance of Research
1(1)
1.3 Problem Formulation
2(3)
1.3.1 Task environment formulation
4(1)
1.3.2 Goal formulation
4(1)
1.3.3 Problem formulation
4(1)
1.4 Review of Literature
5(2)
1.5 Contribution
7(1)
1.6 Methodology
8(8)
1.7 Evaluation
16(2)
1.8 Experimental Study
18(8)
1.8.1 Test selection
19(1)
1.8.2 Test description
19(2)
1.8.3 Test sample analysis
21(5)
1.9 Discussion
26(2)
1.9.1 Conclusion
27(1)
References
28(3)
2 A Method of Policy Discovery for Storage and Data Management 31(22)
2.1 Introduction
31(3)
2.1.1 Background
31(1)
2.1.2 Review of literature
32(2)
2.2 Problem Analysis
34(8)
2.2.1 State representation
35(2)
2.2.2 Relation representation
37(1)
2.2.3 Policy representation
37(1)
2.2.4 Activity representation
37(1)
2.2.5 Activity space
38(1)
2.2.6 Upper ontology of policies
38(3)
2.2.7 Semantics of policies
41(1)
2.3 Method of Policy Discovery
42(7)
2.3.1 Continuous policies
42(1)
2.3.2 Discrete policies
43(1)
2.3.3 Simulator
44(1)
2.3.4 Assign values to relations
45(1)
2.3.5 Conflict relations
45(1)
2.3.6 Compute uncertainty
46(1)
2.3.7 Hierarchy of policy relational model
47(1)
2.3.8 Granularity of relations
47(1)
2.3.9 Relevance of information
47(1)
2.3.10 Parameter estimation
48(1)
2.3.11 Biological model
48(1)
2.3.12 Policy decomposition
49(1)
2.4 Performance Evaluation
49(1)
2.5 Conclusions
50(1)
2.5.1 Closure
50(1)
References
50(3)
3 Knowledge-Based Policy Discovery for Storage and Data Management 53(22)
3.1 Introduction
53(3)
3.1.1 Background
53(2)
3.1.2 Review of literature
55(1)
3.2 Problem Analysis
56(3)
3.2.1 Syntax
56(1)
3.2.2 Semantics
57(2)
3.3 Method of Discovery
59(5)
3.3.1 Upper ontology
59(1)
3.3.2 Perception specification
59(1)
3.3.3 Action specification
60(1)
3.3.4 Environment specification
61(2)
3.3.5 Knowledge base
63(1)
3.3.6 Policy aspect inference algorithm
63(1)
3.4 Performance Evaluation
64(6)
3.4.1 Soundness
64(1)
3.4.2 Completeness
65(1)
3.4.3 Time complexity
65(1)
3.4.4 Space complexity
66(1)
3.4.5 Experiment
66(4)
3.5 Conclusions
70(1)
3.6 Closure
71(1)
References
71(4)
4 Stabilizing Read–Write Throughput of Transactional Memory for Contention Management 75(28)
4.1 Introduction
75(2)
4.1.1 Background
75(1)
4.1.2 Why STM performance is important
75(1)
4.1.3 What has been done
76(1)
4.1.4 Open issues
76(1)
4.2 Problem Statement and Goal
77(6)
4.2.1 Problem formulation
77(5)
4.2.2 Statement of problem
82(1)
4.3 Brief Review of the Literature
83(4)
4.3.1 Fourier analysis
83(1)
4.3.2 Wave equation
84(1)
4.3.3 Vector calculus
84(1)
4.3.4 Ordinary statistics
85(1)
4.3.5 Random matrices
86(1)
4.3.6 Qualitative analysis
86(1)
4.3.7 Lattice models
87(1)
4.3.8 Controlling chaos
87(1)
4.3.9 KAM theorem
87(1)
4.4 Approach
87(12)
4.4.1 Physical assumption
87(1)
4.4.2 Information-theoretical description
88(3)
4.4.3 Evaluation
91(2)
4.4.4 Dynamics
93(1)
4.4.5 Discrete control
94(1)
4.4.6 Cost inner product
95(1)
4.4.7 Throughput convergence
95(1)
4.4.8 Experiments
95(4)
4.5 Barriers and Issues
99(1)
4.5.1 Errors of simultaneous measurement
99(1)
4.5.2 Conjecture of partition function
99(1)
4.5.3 Error detection of entangled states
100(1)
References
100(3)
5 Parallel Search Optimization for Storage Virtualization 103(32)
5.1 Introduction
103(1)
5.2 Significance of Research
104(1)
5.3 Problem Formulation
105(5)
5.3.1 Task environment formulation
108(1)
5.3.2 Goal formulation
108(2)
5.4 Review of Literature
110(4)
5.5 Methodology
114(5)
5.5.1 Data abstraction
115(1)
5.5.2 Data parallelism
116(3)
5.6 Evaluation
119(2)
5.7 Experimental Study
121(8)
5.7.1 Analysis
121(1)
5.7.2 Testbed setup
122(1)
5.7.3 Discussion on parallelism
123(3)
5.7.4 Initial states
126(2)
5.7.5 Goal states
128(1)
5.7.6 Data samples
128(1)
5.7.7 Performance metrics
128(1)
5.8 Discussion
129(3)
5.8.1 Conclusion
131(1)
References
132(3)
6 Finite Automata for Evaluating Testbed Resource Contention 135(14)
6.1 Introduction
135(1)
6.1.1 Background
135(1)
6.2 Problem Analysis
136(4)
6.2.1 Contribution
139(1)
6.3 Review of Literature
140(1)
6.4 Methodology
141(1)
6.5 Performance Evaluation
142(2)
6.6 Implementation
144(2)
6.7 Conclusion
146(1)
References
146(3)
7 Adaptive Buffer Tuning for Data Intensive Algebraic Operations 149(12)
7.1 Introduction
149(1)
7.1.1 Background
149(1)
7.2 Significance of Work
150(1)
7.3 Problem Analysis
151(2)
7.4 Contribution
153(1)
7.5 Methodology
154(5)
7.6 Conclusion
159(1)
References
159(2)
8 A Quantum Method of Representing Recurring Data Deduplication Policy States 161(14)
8.1 Introduction
161(1)
8.2 Problem Formulation
162(3)
8.2.1 State representation using momentum basis
162(1)
8.2.2 State representation using orthogonal basis
163(1)
8.2.3 Policy vector space
164(1)
8.2.4 Statement of problem
165(1)
8.3 Review of Literature
165(2)
8.3.1 Fourier analysis
165(1)
8.3.2 Vector expansion method
166(1)
8.3.3 Ordinary statistics
166(1)
8.3.4 Random matrices
167(1)
8.4 Methodology
167(2)
8.4.1 Measuring job states
167(1)
8.4.2 Compute schedule states
168(1)
8.4.3 Compute policy states
168(1)
8.4.4 Information theoretical description
169(1)
8.5 Implementation
169(3)
8.5.1 Structure of policy state
169(2)
8.5.2 Policy state persistence model
171(1)
8.6 Conclusion
172(1)
References
173(2)
9 QAM—Quantum Availability Mechanics without Recovery for Storage and Data Management 175(10)
9.1 Introduction
175(1)
9.1.1 Nonreversible operations
175(1)
9.1.2 Reversible operations
176(1)
9.2 Problem Formulation
176(1)
9.2.1 State representation using canonical basis
176(1)
9.2.2 Separable states
176(1)
9.2.3 Statement of problem
177(1)
9.2.4 Goal statement
177(1)
9.3 Review of Possible Solutions
177(3)
9.3.1 Clustering
178(1)
9.3.2 Move or backup
178(1)
9.3.3 Evolution with wave mechanics
178(1)
9.3.4 Transactional management
178(1)
9.3.5 Data persistence
178(1)
9.3.6 Cloning
179(1)
9.3.7 Multicast with synchronous computation
179(1)
9.3.8 Quantum teleportation
179(1)
9.4 Methodology
180(4)
9.4.1 Throughput trajectory
180(1)
9.4.2 State encoding
180(1)
9.4.3 Linear blocking
181(1)
9.4.4 Job decomposition and composition
182(1)
9.4.5 Uncertainty principle of availability
182(1)
9.4.6 Quantum availability operator
183(1)
9.4.7 State evolution
183(1)
9.4.8 Diagonalization by job observable
183(1)
Reference
184(1)
10 A Quantum Method with Unknown Future Tasks to Resolve Storage Message Conflicts 185(10)
10.1 Introduction
185(1)
10.2 Problem Formulation
185(2)
10.2.1 Message representation
185(1)
10.2.2 State representation using orthogonal basis
186(1)
10.2.3 Message conflict relation
186(1)
10.2.4 Statement of problem
186(1)
10.3 Review of Possible Solutions
187(2)
10.3.1 Message queue
187(1)
10.3.2 Transactional management
187(1)
10.3.3 Protocol management
187(1)
10.3.4 Message persistence
188(1)
10.3.5 Arbitrary delay of messages
188(1)
10.3.6 Encoding order of messages
188(1)
10.3.7 In memory nuffering and sorting
188(1)
10.3.8 Diagonalization
189(1)
10.3.9 Resequencing messages by eigenbasis
189(1)
10.4 Methodology
189(4)
10.4.1 Measuring message states
189(1)
10.4.2 Asserting message orders
189(1)
10.4.3 Diagonalization by message persistence
189(1)
10.4.4 Quantum messages and resequencing
190(1)
10.4.5 Concurrency of message sending
190(1)
10.4.6 Information of messages
191(2)
10.5 Conclusion
193(1)
References
193(2)
11 A Quantum Automatic Controlled Method for Storage pest Coverage 195(12)
11.1 Problem Statement
195(1)
11.2 Wave of Programs
196(2)
11.2.1 Alternative solutions
196(1)
11.2.1.1 Code mining
196(1)
11.2.2 Program configuration
197(1)
11.2.3 Unit tests
197(1)
11.2.4 Aspect based test
197(1)
11.3 Methodology
198(7)
11.3.1 Test coverage pattern
198(1)
11.3.2 Complete test pattern
198(1)
11.3.3 Sequential test pattern
199(1)
11.3.4 Phase elimination pattern
199(1)
11.3.5 Projective test pattern
200(1)
11.3.6 Joint state pattern
200(1)
11.3.7 Measurement apparatus pattern
201(1)
11.3.8 Tensored test pattern
201(1)
11.3.9 Entanglement construction pattern
201(1)
11.3.10 Entanglement measurement pattern
202(1)
11.3.11 A sample of entanglement measurement
202(1)
11.3.12 Diagonalization and superposition pattern
203(1)
11.3.13 Request response based measurement pattern
203(1)
11.3.14 Automatic controlled test pattern
204(1)
11.3.15 How many test cases
204(1)
11.4 Conclusion
205(2)
12 Protection Mechanics with a Quantum Operator for Anomaly Attacks 207
12.1 Introduction
207(1)
12.2 Problem Statement and Objectives
208(4)
12.2.1 Problem formulation
208(2)
12.2.1.1 State representation using orthonormal basis
208(1)
12.2.1.2 Ground state of Schrodinger Hamiltonian
209(1)
12.2.1.3 Evolution of Schrodinger Potential
209(1)
12.2.1.4 Attack composition
210(1)
12.2.2 Statement of problem
210(1)
12.2.3 Goal statement
211(1)
12.3 State-of-the-Art and Existing Methodologies
212(3)
12.3.1 Ab initio methods
212(1)
12.3.2 Quantum clustering
212(1)
12.3.3 Random matrices
213(1)
12.3.4 Statistical mechanics
213(1)
12.3.5 Lattice models
214(1)
12.3.6 Fuzzy-evolutionary clustering algorithm
214(1)
12.4 Barriers, Issues, and Open Problems
215(2)
12.4.1 Data coherence
215(1)
12.4.2 Errors of simultaneous measurement
216(1)
12.4.3 Analyzing attacks with large data sets
216(1)
12.4.4 Learning properties of known attacks
216(1)
12.4.5 Error detection of entangled attacks
217(1)
12.5 Methodology
217(13)
12.5.1 Attack trajectory
218(4)
12.5.2 Collapse points of attack structures
222(1)
12.5.3 An attack metric
222(1)
12.5.4 Theorems of quantum detection
223(4)
12.5.5 Quantum detection algorithm
227(2)
12.5.6 Attack entanglement
229(1)
12.5.7 Data preparation
229(1)
12.5.8 Data and attribute selection
230(1)
12.6 Examples in Details
230
12.6.1 Data preprocessing
230(1)
12.6.2 Determine cluster center
231
Lei has hands-on experience with analysis and problem proofs. He has four patents granted and two patents filed in the U.S. patent office. Lei has been writing a book on Next Generation Enterprise System.