Algorithms, Architectures and Information Systems Security.

By: Sur-Kolay, SusmitaContributor(s): Nandy, Subhas C | Bhattacharya, Bhargab BMaterial type: TextTextSeries: Statistical Science and Interdisciplinary Research SerPublisher: Singapore : World Scientific Publishing Co Pte Ltd, 2008Copyright date: ©2009Description: 1 online resource (384 pages)Content type: text Media type: computer Carrier type: online resourceISBN: 9789812836243Subject(s): Computer security -- Congresses | Information technologyGenre/Form: Electronic books.Additional physical formats: Print version:: Algorithms, Architectures and Information Systems SecurityDDC classification: 516.352 LOC classification: QA76.9.A25A453 2009Online resources: Click to View
Contents:
Contents -- Foreword -- Preface -- 1. Euclidean Shortest Paths in a Simple Polygon F. Li and R. Klette -- Contents -- 1.1 Introduction -- 1.2 Basics of Rubberband Algorithms -- 1.3 Decompositions and Approximate ESPs -- 1.3.1 Triangulation -- 1.3.2 Trapezoidal Decomposition -- 1.3.3 Two Approximate Algorithms -- 1.4 Improved and Exact Algorithms -- 1.4.1 Proofs of Correctness -- 1.4.2 A Proof Without Using Convex Analysis -- 1.4.3 A Shorter Proof by Using Convex Analysis -- 1.4.4 Computational Complexity -- 1.5 Conclusions -- References -- 2. Theory of a Practical Delaunay Meshing Algorithm for a Large Class of Domains S.-W. Cheng, T. K. Dey and J. Levine -- Contents -- 2.1 Introduction -- 2.2 Preliminaries -- 2.2.1 Domain -- 2.2.2 Complexes -- 2.2.3 Refinement -- 2.3 Protection -- 2.4 Algorithm -- 2.4.1 Guarantees -- 2.5 Termination -- 2.6 Topology Guarantees -- 2.7 Conclusions -- Acknowledgment -- References -- 3. Families of Convex Sets not Representable by Points J. Pach and G. Tó th -- Contents -- 3.1 Introduction -- 3.2 A Nonrepresentable Order Type of Segments -- 3.3 The Iteration Step -- 3.4 Concluding Remarks -- References -- 4. Some Generalizations of Least-Squares Algorithms T. Asano, N. Katoh, K. Mehlhorn and T. Tokuyama -- Contents -- 4.1 Introduction -- 4.2 Polyline Approximation of a Point Sequence -- 4.3 Known Results -- 4.3.1 Least Square Error -- 4.3.2 Minimum Absolute Error -- 4.3.3 Sum of Max Vertical Errors -- 4.4 Approximation by a 1-joint Polyline -- 4.4.1 Least Square Error -- 4.4.2 Minimum Absolute Error -- 4.4.3 Sum of Maximum Vertical Errors -- 4.5 Inserting a Point with Designated Distances to Existing Points -- 4.6 Conclusion -- Acknowledgments -- References -- Appendix -- 5. On Depth Recovery from Gradient Vector Fields T. Wei and R. Klette -- Contents -- 5.1 Introduction.
5.2 Depth Recovery from Gradient Vector Fields -- 5.2.1 Integrability of Vector Fields -- 5.2.2 Local and Global Integration Methods -- 5.3 Two-Scan Method -- 5.4 Fourier-Transform Based Methods -- 5.5 Wavelet-Transform Based Method -- 5.5.1 Daubechies Wavelet Basis -- 5.5.2 Iteration Formula for Wavelet-Transform Based Method -- 5.6 Experimental Results -- 5.6.1 Test on Noiseless Gradients -- 5.6.2 Test on Noisy Gradients -- 5.7 Conclusion -- References -- 6. Convolutional Compactors for Guaranteed 6-Bit Error Detection F. Bö rner, A. Leininger and M. Gö ssel -- Contents -- 6.1 Introduction -- 6.2 A Convolutional Compactor with a Single Output -- 6.2.1 The Observer Canonical Form of a Convolutional Compactor -- 6.2.2 The Input-Output-Behavior of a Convolutional Compactor -- 6.2.3 Linear Superposition and Errors -- 6.3 Classification of Errors -- 6.4 Construction of ParityMatrices for Error Detection -- 6.4.1 First Observations -- 6.4.2 Detection of Even One-Column Errors -- 6.4.3 Optimal (m[62k]×n)-Matrices for Small n -- 6.4.4 Recursive Determination of Larger [62k]-eed Matrices -- 6.5 Detection of 2- and 4-Bit Errors -- 6.6 Detection of 6-Bit Errors -- 6.7 Conclusions -- References -- 7. Low-Energy Pattern Generator for Random Testing B. B. Bhattacharya, S. C. Seth and S. Zhang -- Contents -- 7.1 Introduction -- 7.2 RelatedWorks -- 7.3 Proposed Scheme -- 7.4 Modeling and Computation of Switching Activity -- 7.5 Experimental Results -- 7.6 Prediction of Energy Savings in the LFSR and the CUT -- 7.7 Conclusion and Future Problems -- Acknowledgment -- References -- 8. New Methodologies for Congestion Estimation and Reduction T. Taghavi and M. Sarrafzadeh -- Contents -- 8.1 Introduction -- 8.2 Congestion Estimation -- 8.2.1 Overview of Published Work in Congestion Estimation -- 8.2.1.1 Topology-Free Modeling -- 8.2.1.2 Topology-Based Modeling.
8.3 Congestion Reduction -- 8.3.1 Overview of Published Work in Congestion Reduction -- 8.4 Congestion Reduction in Floorplanning -- 8.4.1 Motivating Examples -- 8.4.1.1 Previous Work on Floorplanning Congestion Reduction -- 8.4.2 Our Floorplanning Framework -- 8.4.2.1 Min-Cut Based Floorplanning -- 8.4.3 Problem Definition -- 8.4.4 Non-Interfering Congested Regions Detection -- 8.4.5 Minimum Perturbation Zero Slack Assignment for Interfering Congested Regions -- 8.4.6 Knapsack Problem Formulation -- 8.5 Experimental Results -- 8.6 Conclusion and Future Work -- References -- 9. Multimedia Channel Assignment in Cellular Networks B. P. Sinha and G. K. Audhya -- Contents -- 9.1 Introduction -- 9.2 System Model -- 9.3 Notations and Terminologies -- 9.4 Lower Bound on Bandwidth -- 9.4.1 Assignment of Peripheral Nodes -- 9.4.2 Assignment of the Central Node and the Peripheral Nodes -- 9.4.3 Approximations in Practical Situations -- 9.5 Genetic Algorithm for Multimedia Channel Assignment Problem -- 9.5.1 Multimedia Channel Assignment Problem (MMCAP) Graph -- 9.5.2 Problem Formulation -- 9.5.3 Algorithm GA -- 9.6 Assignment Technique with Reuse of Channels -- 9.7 Conclusion -- References -- 10. Range Assignment Problem in Wireless Network G. K. Das, S. Das and S. C. Nandy -- Contents -- 10.1 Introduction -- 10.2 Range Assignment Problem -- 10.2.1 Broadcast Range Assignment Problem -- 10.2.2 All-to-All Range Assignment Problem -- 10.2.3 Accumulation Range Assignment Problem -- 10.3 Base Station Placement Problem -- 10.3.1 Unconstrained Base Station Placement Problem -- 10.3.2 Constrained Base Station Placement Problem -- 10.4 Conclusion -- References -- 11. Privacy in the Electronic Society: Emerging Problems and Solutions C. A. Ardagna, M. Cremonini, E. Damiani, S. De Capitani di Vimercati and P. Samarati -- Contents -- 11.1 Introduction.
11.2 Policy Composition -- 11.2.1 Overview of Ongoing Work -- 11.2.2 Open Issues -- 11.3 Access Control in Open Systems -- 11.3.1 Overview of Ongoing Work -- 11.3.2 Open Issues -- 11.4 Privacy Issues in Data Collection and Disclosure -- 11.4.1 Overview of Ongoing Work -- 11.4.2 Open Issues -- 11.5 Location Privacy Issues -- 11.5.1 Overview of Ongoing Work -- 11.5.2 Open Issues -- 11.6 Conclusions -- 11.7 Acknowledgements -- References -- 12. Risk-Based Access Control for Personal Data Services S. A. Chun and V. Atluri -- Contents -- 12.1 Introduction -- 12.2 RelatedWork -- 12.3 Risk-Based Access Control Model -- 12.3.1 Situational Role Model -- 12.3.2 Objects -- 12.4 Situation Role-Based Access Control -- 12.5 Risk-Based Access Control Reasoning and Auditing -- 12.5.1 Risks Based on Role Structure -- 12.5.2 Risks Based on Information Sensitivity -- 12.5.3 Risks Based on Process Dependency -- 12.6 Architecture of Prototype and Implementation Issues -- 12.7 Conclusion and FutureWork -- References -- 13. Topological Vulnerability Analysis S. Jajodia and S. Noel -- Contents -- 13.1 Introduction -- 13.2 Topological Analysis of Network Vulnerability -- 13.3 A Motivating Example -- 13.4 Minimal-Cost Network Hardening -- 13.5 Attack Graph Visualization -- 13.6 Real-Time Event Correlation -- 13.7 Conclusions and Outlook -- Acknowledgments -- References -- 14. New Malicious Code Detection Using Variable Length n-Grams S. K. Dash, D. K. S. Reddy and A. K. Pujari -- Contents -- 14.1 Introduction -- 14.2 Episode Discovery Algorithm -- 14.3 Relevant Episodes -- 14.4 Experimental Setup -- 14.4.1 Classifier -- 14.4.2 ROC Curves -- 14.5 Experimental Results and Discussions -- 14.6 Conclusion -- Acknowledgment -- References -- 15. Overview of State-of-the-Art in Digital Image Forensics H. T. Sencar and N. Memon -- 15.1 Introduction -- 15.2 Image Source Identification.
15.2.1 Image Formation in Digital Cameras and Scanners -- 15.2.2 Source Model Identification -- 15.2.2.1 Image Features -- 15.2.2.2 CFA and Demosaicing Artifacts -- 15.2.2.3 Lens Distortions -- 15.2.3 Individual Source Identification -- 15.2.3.1 Imaging Sensor Imperfections -- 15.2.3.2 Sensor Dust Characteristics -- 15.3 Identification of Synthetic Images -- 15.4 Image Forgery Detection -- 15.4.1 Variations in Image Features -- 15.4.2 Image Feature Inconsistencies -- 15.4.3 Inconsistencies Concerning Acquisition Process -- 15.5 Conclusions and Outlook -- References -- 16. Privacy PreservingWeb-Based Email K. Butler, W. Enck, P. Traynor, J. Plasterr and P. D. McDaniel -- Contents -- 16.1 Introduction -- 16.2 Design -- 16.2.1 Goals -- 16.2.2 Threat Analysis -- 16.2.3 Email Protection -- 16.2.4 Design Detail -- 16.2.5 Adversarial ISPs -- 16.2.6 Key Negotiation and Management -- 16.3 Implementation -- 16.4 Discussion -- 16.4.1 Preserving Privacy -- 16.4.2 Resiliency -- 16.5 RelatedWork -- 16.6 Conclusion -- Acknowledgements -- References -- Appendix -- Interface of Aquinas.
Summary: This volume contains articles written by leading researchers in the fields of algorithms, architectures, and information systems security. The first five chapters address several challenging geometric problems and related algorithms. These topics have major applications in pattern recognition, image analysis, digital geometry, surface reconstruction, computer vision and in robotics. The next five chapters focus on various optimization issues in VLSI design and test architectures, and in wireless networks. The last six chapters comprise scholarly articles on information systems security covering privacy issues, access control, enterprise and network security, and digital image forensics.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

Contents -- Foreword -- Preface -- 1. Euclidean Shortest Paths in a Simple Polygon F. Li and R. Klette -- Contents -- 1.1 Introduction -- 1.2 Basics of Rubberband Algorithms -- 1.3 Decompositions and Approximate ESPs -- 1.3.1 Triangulation -- 1.3.2 Trapezoidal Decomposition -- 1.3.3 Two Approximate Algorithms -- 1.4 Improved and Exact Algorithms -- 1.4.1 Proofs of Correctness -- 1.4.2 A Proof Without Using Convex Analysis -- 1.4.3 A Shorter Proof by Using Convex Analysis -- 1.4.4 Computational Complexity -- 1.5 Conclusions -- References -- 2. Theory of a Practical Delaunay Meshing Algorithm for a Large Class of Domains S.-W. Cheng, T. K. Dey and J. Levine -- Contents -- 2.1 Introduction -- 2.2 Preliminaries -- 2.2.1 Domain -- 2.2.2 Complexes -- 2.2.3 Refinement -- 2.3 Protection -- 2.4 Algorithm -- 2.4.1 Guarantees -- 2.5 Termination -- 2.6 Topology Guarantees -- 2.7 Conclusions -- Acknowledgment -- References -- 3. Families of Convex Sets not Representable by Points J. Pach and G. Tó th -- Contents -- 3.1 Introduction -- 3.2 A Nonrepresentable Order Type of Segments -- 3.3 The Iteration Step -- 3.4 Concluding Remarks -- References -- 4. Some Generalizations of Least-Squares Algorithms T. Asano, N. Katoh, K. Mehlhorn and T. Tokuyama -- Contents -- 4.1 Introduction -- 4.2 Polyline Approximation of a Point Sequence -- 4.3 Known Results -- 4.3.1 Least Square Error -- 4.3.2 Minimum Absolute Error -- 4.3.3 Sum of Max Vertical Errors -- 4.4 Approximation by a 1-joint Polyline -- 4.4.1 Least Square Error -- 4.4.2 Minimum Absolute Error -- 4.4.3 Sum of Maximum Vertical Errors -- 4.5 Inserting a Point with Designated Distances to Existing Points -- 4.6 Conclusion -- Acknowledgments -- References -- Appendix -- 5. On Depth Recovery from Gradient Vector Fields T. Wei and R. Klette -- Contents -- 5.1 Introduction.

5.2 Depth Recovery from Gradient Vector Fields -- 5.2.1 Integrability of Vector Fields -- 5.2.2 Local and Global Integration Methods -- 5.3 Two-Scan Method -- 5.4 Fourier-Transform Based Methods -- 5.5 Wavelet-Transform Based Method -- 5.5.1 Daubechies Wavelet Basis -- 5.5.2 Iteration Formula for Wavelet-Transform Based Method -- 5.6 Experimental Results -- 5.6.1 Test on Noiseless Gradients -- 5.6.2 Test on Noisy Gradients -- 5.7 Conclusion -- References -- 6. Convolutional Compactors for Guaranteed 6-Bit Error Detection F. Bö rner, A. Leininger and M. Gö ssel -- Contents -- 6.1 Introduction -- 6.2 A Convolutional Compactor with a Single Output -- 6.2.1 The Observer Canonical Form of a Convolutional Compactor -- 6.2.2 The Input-Output-Behavior of a Convolutional Compactor -- 6.2.3 Linear Superposition and Errors -- 6.3 Classification of Errors -- 6.4 Construction of ParityMatrices for Error Detection -- 6.4.1 First Observations -- 6.4.2 Detection of Even One-Column Errors -- 6.4.3 Optimal (m[62k]×n)-Matrices for Small n -- 6.4.4 Recursive Determination of Larger [62k]-eed Matrices -- 6.5 Detection of 2- and 4-Bit Errors -- 6.6 Detection of 6-Bit Errors -- 6.7 Conclusions -- References -- 7. Low-Energy Pattern Generator for Random Testing B. B. Bhattacharya, S. C. Seth and S. Zhang -- Contents -- 7.1 Introduction -- 7.2 RelatedWorks -- 7.3 Proposed Scheme -- 7.4 Modeling and Computation of Switching Activity -- 7.5 Experimental Results -- 7.6 Prediction of Energy Savings in the LFSR and the CUT -- 7.7 Conclusion and Future Problems -- Acknowledgment -- References -- 8. New Methodologies for Congestion Estimation and Reduction T. Taghavi and M. Sarrafzadeh -- Contents -- 8.1 Introduction -- 8.2 Congestion Estimation -- 8.2.1 Overview of Published Work in Congestion Estimation -- 8.2.1.1 Topology-Free Modeling -- 8.2.1.2 Topology-Based Modeling.

8.3 Congestion Reduction -- 8.3.1 Overview of Published Work in Congestion Reduction -- 8.4 Congestion Reduction in Floorplanning -- 8.4.1 Motivating Examples -- 8.4.1.1 Previous Work on Floorplanning Congestion Reduction -- 8.4.2 Our Floorplanning Framework -- 8.4.2.1 Min-Cut Based Floorplanning -- 8.4.3 Problem Definition -- 8.4.4 Non-Interfering Congested Regions Detection -- 8.4.5 Minimum Perturbation Zero Slack Assignment for Interfering Congested Regions -- 8.4.6 Knapsack Problem Formulation -- 8.5 Experimental Results -- 8.6 Conclusion and Future Work -- References -- 9. Multimedia Channel Assignment in Cellular Networks B. P. Sinha and G. K. Audhya -- Contents -- 9.1 Introduction -- 9.2 System Model -- 9.3 Notations and Terminologies -- 9.4 Lower Bound on Bandwidth -- 9.4.1 Assignment of Peripheral Nodes -- 9.4.2 Assignment of the Central Node and the Peripheral Nodes -- 9.4.3 Approximations in Practical Situations -- 9.5 Genetic Algorithm for Multimedia Channel Assignment Problem -- 9.5.1 Multimedia Channel Assignment Problem (MMCAP) Graph -- 9.5.2 Problem Formulation -- 9.5.3 Algorithm GA -- 9.6 Assignment Technique with Reuse of Channels -- 9.7 Conclusion -- References -- 10. Range Assignment Problem in Wireless Network G. K. Das, S. Das and S. C. Nandy -- Contents -- 10.1 Introduction -- 10.2 Range Assignment Problem -- 10.2.1 Broadcast Range Assignment Problem -- 10.2.2 All-to-All Range Assignment Problem -- 10.2.3 Accumulation Range Assignment Problem -- 10.3 Base Station Placement Problem -- 10.3.1 Unconstrained Base Station Placement Problem -- 10.3.2 Constrained Base Station Placement Problem -- 10.4 Conclusion -- References -- 11. Privacy in the Electronic Society: Emerging Problems and Solutions C. A. Ardagna, M. Cremonini, E. Damiani, S. De Capitani di Vimercati and P. Samarati -- Contents -- 11.1 Introduction.

11.2 Policy Composition -- 11.2.1 Overview of Ongoing Work -- 11.2.2 Open Issues -- 11.3 Access Control in Open Systems -- 11.3.1 Overview of Ongoing Work -- 11.3.2 Open Issues -- 11.4 Privacy Issues in Data Collection and Disclosure -- 11.4.1 Overview of Ongoing Work -- 11.4.2 Open Issues -- 11.5 Location Privacy Issues -- 11.5.1 Overview of Ongoing Work -- 11.5.2 Open Issues -- 11.6 Conclusions -- 11.7 Acknowledgements -- References -- 12. Risk-Based Access Control for Personal Data Services S. A. Chun and V. Atluri -- Contents -- 12.1 Introduction -- 12.2 RelatedWork -- 12.3 Risk-Based Access Control Model -- 12.3.1 Situational Role Model -- 12.3.2 Objects -- 12.4 Situation Role-Based Access Control -- 12.5 Risk-Based Access Control Reasoning and Auditing -- 12.5.1 Risks Based on Role Structure -- 12.5.2 Risks Based on Information Sensitivity -- 12.5.3 Risks Based on Process Dependency -- 12.6 Architecture of Prototype and Implementation Issues -- 12.7 Conclusion and FutureWork -- References -- 13. Topological Vulnerability Analysis S. Jajodia and S. Noel -- Contents -- 13.1 Introduction -- 13.2 Topological Analysis of Network Vulnerability -- 13.3 A Motivating Example -- 13.4 Minimal-Cost Network Hardening -- 13.5 Attack Graph Visualization -- 13.6 Real-Time Event Correlation -- 13.7 Conclusions and Outlook -- Acknowledgments -- References -- 14. New Malicious Code Detection Using Variable Length n-Grams S. K. Dash, D. K. S. Reddy and A. K. Pujari -- Contents -- 14.1 Introduction -- 14.2 Episode Discovery Algorithm -- 14.3 Relevant Episodes -- 14.4 Experimental Setup -- 14.4.1 Classifier -- 14.4.2 ROC Curves -- 14.5 Experimental Results and Discussions -- 14.6 Conclusion -- Acknowledgment -- References -- 15. Overview of State-of-the-Art in Digital Image Forensics H. T. Sencar and N. Memon -- 15.1 Introduction -- 15.2 Image Source Identification.

15.2.1 Image Formation in Digital Cameras and Scanners -- 15.2.2 Source Model Identification -- 15.2.2.1 Image Features -- 15.2.2.2 CFA and Demosaicing Artifacts -- 15.2.2.3 Lens Distortions -- 15.2.3 Individual Source Identification -- 15.2.3.1 Imaging Sensor Imperfections -- 15.2.3.2 Sensor Dust Characteristics -- 15.3 Identification of Synthetic Images -- 15.4 Image Forgery Detection -- 15.4.1 Variations in Image Features -- 15.4.2 Image Feature Inconsistencies -- 15.4.3 Inconsistencies Concerning Acquisition Process -- 15.5 Conclusions and Outlook -- References -- 16. Privacy PreservingWeb-Based Email K. Butler, W. Enck, P. Traynor, J. Plasterr and P. D. McDaniel -- Contents -- 16.1 Introduction -- 16.2 Design -- 16.2.1 Goals -- 16.2.2 Threat Analysis -- 16.2.3 Email Protection -- 16.2.4 Design Detail -- 16.2.5 Adversarial ISPs -- 16.2.6 Key Negotiation and Management -- 16.3 Implementation -- 16.4 Discussion -- 16.4.1 Preserving Privacy -- 16.4.2 Resiliency -- 16.5 RelatedWork -- 16.6 Conclusion -- Acknowledgements -- References -- Appendix -- Interface of Aquinas.

This volume contains articles written by leading researchers in the fields of algorithms, architectures, and information systems security. The first five chapters address several challenging geometric problems and related algorithms. These topics have major applications in pattern recognition, image analysis, digital geometry, surface reconstruction, computer vision and in robotics. The next five chapters focus on various optimization issues in VLSI design and test architectures, and in wireless networks. The last six chapters comprise scholarly articles on information systems security covering privacy issues, access control, enterprise and network security, and digital image forensics.

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2018. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.

There are no comments on this title.

to post a comment.

Powered by Koha