Coverart for item
The Resource Advanced Computing and Systems for Security : Volume Three

Advanced Computing and Systems for Security : Volume Three

Label
Advanced Computing and Systems for Security : Volume Three
Title
Advanced Computing and Systems for Security
Title remainder
Volume Three
Creator
Contributor
Subject
Language
eng
Member of
Cataloging source
MiAaPQ
Literary form
non fiction
Nature of contents
dictionaries
Series statement
Advances in Intelligent Systems and Computing Ser.
Series volume
v.567
Advanced Computing and Systems for Security : Volume Three
Label
Advanced Computing and Systems for Security : Volume Three
Link
http://libproxy.rpi.edu/login?url=https://ebookcentral.proquest.com/lib/rpi/detail.action?docID=4821160
Publication
Copyright
Related Contributor
Related Location
Related Agents
Related Authorities
Related Subjects
Related Items
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • Preface -- About the Book -- Contents -- About the Editors -- Algorithms -- 1 A Heuristic Framework for Priority Based Nurse Scheduling -- Abstract -- 1 Introduction -- 2 Bibliographic Survey -- 2.1 Integer Programming Model -- 2.2 Satisfiablity Model -- 2.3 Meta-Heuristic Search Techniques -- 3 Open Issues -- 3.1 Identification of the Parameters to be Used for Long-Term Scheduling of Nurses -- 3.2 Decision Support System (DSS) in Making Dynamic or Flexible Scheduling -- 4 Description of the Heuristic Method for Nurse Assignment in the Remote Centre -- 4.1 Methodology -- 4.2 Flow Diagram of the Proposed Framework -- 4.3 Experimental Results -- 5 Conclusion -- References -- 2 A Divide-and-Conquer Algorithm for All Spanning Tree Generation -- Abstract -- 1 Introduction -- 2 Literature Survey -- 3 Existing Techniques for All Spanning Tree Generation -- 3.1 Trees by Test and Select Method -- 3.2 Elementary Tree Transformation Method -- 3.3 Successive Reduction Method -- 4 The New Algorithm (DCC_Trees) -- 4.1 Selection of a Reference Vertex and Elimination of Its Pendant Edges -- 4.2 Divide: Decomposition of the Graph -- 4.3 Conquer: Searching for Connectors -- 4.4 Combine: Forming the Trees -- 4.5 Rejoining the Pendant Edges -- 4.6 Algorithm DCC_Trees -- 4.7 Data Structures and Complexity Issues -- 4.8 Salient Features of DCC_Trees -- 5 Experimental Results -- 6 Applications -- 7 Conclusion -- References -- Circuit Synthesis of Marked Clique Problem using Quantum Walk -- 1 Introduction -- 2 Background -- 2.1 Discrete Walk in Line -- 2.2 Continuous Quantum Walk -- 2.3 Discrete Quantum Walk in a Graph -- 3 Algorithm for Finding the Marked Clique -- 3.1 Steps for Finding Marked Clique Using Our Proposed Algorithm -- 3.2 Calculation of the Degree -- 3.3 Applying Hadamard Gate -- 3.4 Starting Quantum Walk -- 3.5 Checking Interconnection Between Vertices
  • 3.6 Getting the Clique -- 3.7 Coin Operator on Marked List -- 4 Analysis of the Circuit -- 4.1 Applying Hadamard Gate -- 4.2 Circuit for Different Coin States -- 4.3 Interconnection Between Adjacent Vertices -- 5 Simulation of Marked Clique Problem -- 6 Circuit for General Graph -- 7 Conclusion -- References -- 4 Abort-Free STM: A Non-blocking Concurrency Control Approach Using Software Transactional Memory -- Abstract -- 1 Introduction -- 2 Proposed Abort Free STM -- 2.1 Terminologies -- 2.2 Basic Concepts -- 2.3 Data Structure -- 2.4 Opening Data Object -- 2.5 Committing of Transactions -- 2.6 Algorithm -- 3 Making AFTM Abort Free: A Critical Analysis -- 4 Performance Evaluation by Experiments -- 4.1 Experimental Results with Increased Number of Write Transactions -- 4.2 Experimental Results with Increased Transactions' Execution Time -- 5 Concluding Remarks -- References -- Graph Problems Performance Comparison Using Intel Xeon and Intel Xeon-Phi -- 1 Introduction -- 2 Graph 500 Benchmark -- 3 Betweenness Centrality Benchmark -- 4 Experiments -- 4.1 Experimental Setup -- 5 Results -- 6 Conclusion and Future Work -- References -- 6 A Novel Image Steganographic Scheme Using 8 \times 8 Sudoku Puzzle -- Abstract -- 1 Introduction -- 2 Existing Literature -- 3 Proposed Technique -- 3.1 Algorithm for Encryption -- 3.2 Algorithm for Decryption -- 3.3 Advantages of This Proposed Technique -- 4 Experimental Results -- 4.1 Comparison of Experimental Results -- 4.2 Analysis of Experimental Results -- 4.3 Complexity Measurement -- 5 Conclusion -- References -- Data Analytics -- Comparison of K-means Clustering Initialization Approaches with Brute-Force Initialization -- 1 Introduction -- 1.1 Variants of the Clustering Problem -- 1.2 Initialization -- 2 Baseline -- 2.1 Global Optimum -- 2.2 Exact Methods -- 3 Brute Force Initialization -- 4 Experiments
  • 4.1 Euclidean K-Means -- 4.2 Spherical K-Means -- 4.3 Run Times -- 5 Conclusion and Future Work -- References -- 8 Association Based Multi-attribute Analysis to Construct Materialized View -- Abstract -- 1 Introduction -- 2 Related Work -- 3 Few Concepts Needed for Proposed Algorithm -- 3.1 Attribute Usage Matrix -- 3.2 Attribute Set -- 3.3 Minimum Support Count -- 3.4 Frequent Attribute Set -- 3.5 k-Attribute Set -- 3.6 Query Frequency Matrix -- 4 Motivating Factors to Identify the Research Gap -- 5 Use of Apriori Algorithm in the Proposed Methodology -- 5.1 Relevance of Apriori Algorithm in the Construction of Materialized View -- 5.2 Overview of Apriori Algorithm -- 5.3 Apriori Property -- 6 Materialized View Formation Using Proposed Algorithm -- 6.1 Proposed Methodology to Construct Materialized Views -- 6.2 Proposed Algorithm -- 7 Performance Evaluation of the Proposed Methodology Through Result Analysis and Comparison with Existing Methodologies -- 7.1 Result Analysis from Data Set-1 -- 7.2 Computation of the Hit-Miss Ratio -- 7.3 Result Analysis from Data Set-2 -- 8 Conclusion and Future Work -- References -- A New Method for Key Author Analysis in Research Professionals' Collaboration Network -- 1 Introduction -- 2 Related Work -- 3 Methodology -- 3.1 Social Network Analysis (SNA) -- 3.2 Correlation Coefficient -- 3.3 Eigenvector Centrality -- 4 Data Collection and Cleansing -- 5 Collaboration Network of Research Professionals' an Example -- 6 Our Proposed Method -- 7 Analysis and Result -- 8 Conclusion and Future Work -- References -- Security Systems -- Single-Shot Person Re-identification by Spectral Matching of Symmetry-Driven Local Features -- 1 Introduction -- 2 Proposed Approach -- 2.1 Symmetry-Asymmetry Based Partitioning of Image -- 2.2 Accumulation of Local Features -- 2.3 Feature Matching -- 3 Experimental Evaluation
  • 3.1 Single-Shot (SvsS) -- 3.2 Accumulation of Features -- 4 Conclusions -- References -- 11 Analysis of Eavesdropping in QKD with Qutrit Photon States -- Abstract -- 1 Introduction -- 2 Qutrit Protocol -- 3 POVM Receiver -- 4 Conclusion -- References -- Evaluating the Performance of a Chaos Based Partial Image Encryption Scheme -- 1 Introduction -- 2 Overview of the Encryption Scheme -- 2.1 Bitplane Decomposition -- 2.2 Assignment of Threshold to Determine Significant Bitplane -- 2.3 Encryption of Significant Bitplanes -- 3 Performance Evaluation -- 3.1 Tuneability -- 3.2 Visual Degradation -- 3.3 Cryptographic Security -- 3.4 Encryption Ratio -- 3.5 Compression Friendliness -- 3.6 Format Compliance -- 3.7 Error Tolerance -- 4 Conclusion -- References -- 13 Keystroke Dynamics and Face Image Fusion as a Method of Identification Accuracy Improvement -- Abstract -- 1 Introduction -- 2 Known Approaches -- 3 Sample Data Collecting -- 3.1 Keystroke Data Collection (Author's Initial Test Database) -- 3.2 AT&T Database Collection -- 3.3 Keystroke Dynamics-Benchmark Data Set -- 4 Classification -- 4.1 Authors' Initial Approach -- 4.2 Second Approach -- 5 Results -- 5.1 Initial Approach -- 5.2 Second Approach with Fusion of Keystroke Dynamics and Face Images -- 6 Conclusions -- Acknowledgements -- References -- Author Index
http://library.link/vocab/cover_art
https://contentcafe2.btol.com/ContentCafe/Jacket.aspx?Return=1&Type=S&Value=9789811034091&userID=ebsco-test&password=ebsco-test
Dimensions
unknown
http://library.link/vocab/discovery_link
{'f': 'http://opac.lib.rpi.edu/record=b4387645'}
Extent
1 online resource (199 pages)
Form of item
online
Isbn
9789811034091
Media category
computer
Media MARC source
rdamedia
Media type code
c
Sound
unknown sound
Specific material designation
remote

Library Locations

    • Folsom LibraryBorrow it
      110 8th St, Troy, NY, 12180, US
      42.729766 -73.682577
Processing Feedback ...