Hasil Pencarian  ::  Simpan CSV :: Kembali

"Thorough and comprehensive coverage from one of the foremost experts in browser security.' --Tavis Ormandy, Google Inc. Modern web applications are built on a tangle of technologies that have been developed over time and then haphazardly pieced together. Every piece of the web application stack, from HTTP requests to browser-side scripts, comes with important yet subtle security consequences. To keep users safe, it is essential for developers to confidently navigate this landscape.In The Tangled Web, Michal Zalewski, one of the world's top browser security experts, offers a compelling narrative that explains exactly how browsers work and why they're fundamentally insecure. Rather than dispense simplistic advice on vulnerabilities, Zalewski examines the entire browser security model, revealing weak points and providing crucial information for shoring up web application security. You'll learn how to: Perform common but surprisingly complex tasks such as URL parsing and HTML sanitization Use modern security features like Strict Transport Security, CSP, and CORS Leverage many variants of the same-origin policy to safely compartmentalize complex web applications and protect user credentials in case of XSS bugs Build mashups and embed gadgets without getting stung by the tricky frame navigation policy Embed or host user-supplied content without running into the trap of content sniffing For quick reference, "Security Engineering Cheat Sheets' at the end of each chapter offer ready solutions to problems you're most likely to encounter. With coverage extending as far as planned HTML5 features, The Tangled Web will help you create secure web applications to stand the test of time."

"Numerical software is used to test scientific theories, design airplanes and bridges, operate manufacturing lines, control power plants and refineries, analyze financial derivatives, identify genomes, and provide the understanding necessary to derive and analyze cancer treatments. Because of the high stakes involved, it is essential that results computed using software be accurate, reliable, and robust. Unfortunately, developing accurate and reliable scientific software is notoriously difficult. This book investigates some of the difficulties related to scientific computing and provides insight into how to overcome them and obtain dependable results. The tools to assess existing scientific applications are described, and a variety of techniques that can improve the accuracy and reliability of newly developed applications is discussed.Accuracy and Reliability in Scientific Computing can be considered a handbook for improving the quality of scientific computing. It will help computer scientists address the problems that affect software in general as well as the particular challenges of numerical computation: approximations occurring at all levels, continuous functions replaced by discretized versions, infinite processes replaced by finite ones, and real numbers replaced by finite precision numbers. Divided into three parts, it starts by illustrating some of the difficulties in producing robust and reliable scientific software. Well-known cases of failure are reviewed and the what and why of numerical computations are considered. The second section describes diagnostic tools that can be used to assess the accuracy and reliability of existing scientific applications. In the last section, the authors describe a variety of techniques that can be employed to improve the accuracy and reliability of newly developed scientific applications. The authors of the individual chapters are international experts, many of them members of the IFIP Working Group on Numerical Software."

"The book deals with the optimization phase of compilers. In this phase, programs are transformed in order to increase their efficiency. To preserve the semantics of the programs in these transformations, the compiler has to meet the associated applicability conditions. These are checked using static analysis of the programs. In this book the authors systematically describe the analysis and transformation of imperative and functional programs. In addition to a detailed description of important efficiency-improving transformations, the book offers a concise introduction to the necessary concepts and methods, namely to operational semantics, lattices, and fixed-point algorithms."

"ScaLAPACK is an acronym for Scalable Linear Algebra Package or Scalable LAPACK. It is a library of high-performance linear algebra routines for distributed memory message-passing MIMD computers and networks of workstations supporting parallel virtual machine (PVM) and/or message passing interface (MPI). It is a continuation of the LAPACK project, which designed and produced analogous software for workstations, vector supercomputers, and shared memory parallel computers. Both libraries contain routines for solving systems of linear equations, least squares problems, and eigenvalue problems. The goals of both projects are efficiency, scalability, reliability, portability, flexibility, and ease of use. ScaLAPACK includes routines for the solution of dense, band, and tridiagonal linear systems of equations, condition estimation and iterative refinement, for LU and Cholesky factorization, matrix inversion, full-rank linear least squares problems, orthogonal and generalized orthogonal factorizations, orthogonal transformation routines, reductions to upper Hessenberg, bidiagonal and tridiagonal form, reduction of a symmetric-definite/ Hermitian-definite generalized eigenproblem to standard form, the symmetric/Hermitian, generalized symmetric/Hermitian, and nonsymmetric eigenproblem, and the singular value decomposition. Prototype codes are provided for out-of-core linear solvers for LU, Cholesky, and QR, the matrix sign function for eigenproblems, an HPF interface to a subset of ScaLAPACK routines, and SuperLU. Software is available in single-precision real, double-precision real, single-precision complex, and double-precision complex. The software has been written to be portable across a wide range of distributed-memory environments such as the Cray T3, IBM SP, Intel series, TM CM-5, networks of workstations, and any system for which PVM or MPI is available."

"ABSTRAKUntuk menyederhanakan solusi dari suatu masalah komputasi selalu digunakan apa yang disebut dengan teknik analisa transformasi. Salah satu contoh dari teknik analisa ini adalah transformasi Fourier. Transformasi Fourier dari sebuah gelombang diperlukan untuk memisah gelombang tersebut menjadi sejumlah gelombang sinusoidal dengan frekwensi yang berbeda. Dengan dikembangkannya suatu transformasi Fourier cepat ( Fast Fourier Transform- FFT ) yaitu sebuah algoritma yang efisien untuk menghitung DFT ( Discrete Fourier Transform), maka telah terjadi perubahan yang besar dalam menganalisa berbagai cabang Ilmu Pengetahuan (science). Prosesor FFT yang terkecil mempunyai dua titik transformasi ( N = 2 ). Pada tulisan ini dibahas tentang aspek-aspek komputasi dan aspek-aspek perancangan pada sistem VLSI yang berkaitan dengan perancangan prosesor FFT-DIT untuk titik transformasi sebanyak delapan buah ( N = 8 ). Perancangan simulasi Prosesor FFT ini dilakukan dengan menggunakan teknologi CMOS. Perancangan ini dilakukan dengan menggunakan perangkat lunak CIRCAD II pada workstation HP9000 dan SUN SPARCstation 1+. Perancangan ini menggunakan modul FFT-DIT dengan N= 2 yang dirancang oleh sdr. Ir.Totok Mujiono di laboratorium CAD UI pada tahun 1990 yang lalu. Perancangan FT-DIT untuk N = 8 ini dilakukan dengan menggabungkan modul FFT--DIT dengan N = 2 sebanyak 12 buah. Penggabungan dilakukan sesuai dengan grafik aliran sinyal dari FFT-DIT untuk N = 8 . Pada perancangan ini faktor wp ( twiddle factor ) dianggap sudah tersedia, jadi merupakan masukan dari chip prosesor FFT-DIT dengan N = 8 ini. "

"The authors describe ETL Committee, an ensemble method that uses ETL as the base learner. Experimental results show that ETL Committee improves the effectiveness of ETL classifiers. The application of ETL is presented to four Natural Language Processing (NLP) tasks : part-of-speech tagging, phrase chunking, named entity recognition and semantic role labeling. Extensive experimental results demonstrate that ETL is an effective way to learn accurate transformation rules, and shows better results than TBL with handcrafted templates for the four tasks. By avoiding the use of handcrafted templates, ETL enables the use of transformation rules to a greater range of tasks."