000			05936cam a2200529Ii 4500
999			_c95572 _d95572 _x2
001			95572
003			ES-MaUEC
005			20230102112711.0
006			m o d
007			cr cnu|||unuuu
008			170314s2017 si a ob 101 0 eng d
020			_a9789811033919
020			_a9789811034091 _q(electronic bk.)
020			_a9811033919
020			_a9811034095 _q(electronic bk.)
020			_z9789811034084
020			_z9811033919
020			_z9811034087
040			_aN$T _bspa _cN$T _dN$T _dGW5XE _dEBLCP _dIDEBK _dYDX _dOCLCF _dAZU _dIOG _dUPM _dESU _dJBG _dIAD _dICW _dICN _dVT2 _dOTZ _dOCLCQ _dNAM _dU3W _dOCLCA _dES-MaUEC _bspa
050		4	_aQA76.9.A25 _b2017 EB
245	0	0	_aAdvanced computing and systems for security _nVolume Three _cRituparna Chaki, Khalid Saeed, Agostino Cortesi, Nabendu Chaki, editors
264		1	_aSingapore _bSpringer _c[2017]
300			_a1 recurso en línea (xiii, 197 páginas) _bilustraciones
336			_2rdacontent _aTexto _btxt
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	0		_aAdvances in intelligent systems and computing _v567
500			_aSpringerLink
504			_aIncluye referencias bibliográficas e índice
505	0		_aPreface; 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.
505	8		_a3 Making AFTM Abort Free: A Critical Analysis4 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.
505	8		_a3.6 Getting the Clique3.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.
505	8		_a4.3 Experimental Results5 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.
505	8		_a4.6 Algorithm DCC_Trees4.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.
520	3		_aThis book presents extended versions of papers originally presented and discussed at the 3rd International Doctoral Symposium on Applied Computation and Security Systems (ACSS 2016) held from August 12 to 14, 2016 in Kolkata, India. The symposium was jointly organized by the AGH University of Science & Technology, Cracow, Poland; Ca' Foscari University, Venice, Italy; and the University of Calcutta, India. The book is divided into two volumes, Volumes 3 and 4, and presents dissertation works in the areas of Image Processing, Biometrics-based Authentication, Soft Computing, Data Mining, Next-Generation Networking and Network Security, Remote Healthcare, Communications, Embedded Systems, Software Engineering and Service Engineering. The first two volumes of the book published the works presented at the ACSS 2015, which was held from May 23 to 25, 2015 in Kolkata, India.
988			_aEBOOK, EBSPRINGER_2017C
650		7	_aSeguridad informática _2embne _xCongresos y asambleas _9158200
700	1		_aChaki, Nabendu _eeditor literario _998334
700	1		_aChaki, Rituparna _eeditor literario _9100529
700	1		_aCortesi, Agostino _d1963- _eeditor literario _998333
700	1		_aSaeed, Khalid _c(Computer scientist), _eeditor literario _9100530
711	2		_aInternational Doctoral Symposium on Applied Computation and Security Systems _n(3rd : _d2016 : _cKolkata, India)
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=http://link.springer.com/10.1007/978-981-10-3409-1 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2018 _dz _e- _zSI