Privacy-Preserving Data Mining: Models and Algorithms (Advances in Database Systems)

Product Description

Advances in hardware technology have increased the capability to store and record personal data about consumers and individuals, causing concerns that personal data may be used for a variety of intrusive or malicious purposes.
Privacy-Preserving Data Mining: Models and Algorithms proposes a number of techniques to perform the data mining tasks in a privacy-preserving way. These techniques generally fall into the following categories: data modification techniques, cryptographic methods and protocols for data sharing, statistical techniques for disclosure and inference control, query auditing methods, randomization and perturbation-based techniques.

This edited volume contains surveys by distinguished researchers in the privacy field. Each survey includes the key research content as well as future research directions.
Privacy-Preserving Data Mining: Models and Algorithms is designed for researchers, professors, and advanced-level students in computer science, and is also suitable for industry practitioners.

Product Details
Hardcover: 514 pages
Publisher: Springer; 1 edition (July 7, 2008)
Language: English
ISBN-10: 0387709916
ISBN-13: 978-0387709918
Product Dimensions: 9.3 x 6 x 1 inches

http://rapidshare.com/files/156022270/Privacy-Preserving_Data_Mining_Models_and_Algorithms__Advances_in_Database_Systems_techebookshare.bl.html

password: www.medishared.com

Network Optimization: Continuous and Discrete Models

Product Description

An insightful, comprehensive, and up-to-date treatment of linear, nonlinear, and discrete/combinatorial network optimization problems, their applications, and their analytical and algorithmic methodology. It covers extensively theory, algorithms, and applications, and it aims to bridge the gap between linear and nonlinear network optimization on one hand, and integer/combinatorial network optimization on the other. Among its special features, the book:
1) provides a comprehensive account of the principal algorithms for linear network flow problems, including simplex, dual ascent, and auction algorithms
2) describes the application of network algorithms in many practical contexts, with special emphasis on data communication networks
3) develops in detail the computational complexity analysis of the main linear network optimization algorithms
4) covers extensively the main algorithms for specialized network problems, such as shortest path, max-flow, assignment, and traveling salesman
5) describes the main models for discrete network optimization problems, such as constrained shortest path, traveling salesman, vehicle routing, multidimensional assignment, facility location, spanning tree construction, etc
6) describes the main algorithmic approaches for integer-constrained network problems, such as branch-and-bound, Lagrangian relaxation and subgradient optimization, genetic algorithms, tabu search, simulated annealing, and rollout algorithms
7) develops the main methods for nonlinear network problems, such as convex separable and multicommodity flow problems arising in communication, transportation, and manufacturing contexts
8) discusses extensively auction algorithms, based on the author's original research on the subject
9) contains many examples, practical applications, illustrations, and exercises
10) contains much new material not found in any other textbook

Product Details
Hardcover: 593 pages
Publisher: Athena Scientific (May 1, 1998)
Language: English
ISBN-10: 1886529027
ISBN-13: 978-1886529021
Product Dimensions: 9.3 x 6.6 x 1.3 inches

http://rapidshare.com/files/155446965/Network_Optimization_techebookshare.blogspot.com.rar.html
password: http://techebookshare.blogspot.com