Weili Wu – författare
Visar alla böcker från författaren Weili Wu. Handla med fri frakt och snabb leverans.
24 produkter
24 produkter
Häftad, Engelska, 2020
690 kr
Skickas inom 10-15 vardagar
This book presents recent developments on the theoretical, algorithmic, and application aspects of Big Data in Complex and Social Networks. The book consists of four parts, covering a wide range of topics. The first part of the book focuses on data storage and data processing. It explores how the efficient storage of data can fundamentally support intensive data access and queries, which enables sophisticated analysis. It also looks at how data processing and visualization help to communicate information clearly and efficiently. The second part of the book is devoted to the extraction of essential information and the prediction of web content. The book shows how Big Data analysis can be used to understand the interests, location, and search history of users and provide more accurate predictions of User Behavior. The latter two parts of the book cover the protection of privacy and security, and emergent applications of big data and social networks. It analyzes how to model rumor diffusion, identify misinformation from massive data, and design intervention strategies. Applications of big data and social networks in multilayer networks and multiparty systems are also covered in-depth.
Del 56 - Nonconvex Optimization and Its Applications
Mathematical Theory of Optimization
Inbunden, Engelska, 2001
1 611 kr
Skickas inom 10-15 vardagar
Optimization is of central importance in all sciences. Nature inherently seeks optimal solutions. For example, light travels through the "shortest" path and the folded state of a protein corresponds to the structure with the "minimum" potential energy. In combinatorial optimization, there are numerous computationally hard problems arising in real world applications, such as floorplanning in VLSI designs and Steiner trees in communication networks. For these problems, the exact optimal solution is not currently real-time computable. One usually computes an approximate solution with various kinds of heuristics. Recently, many approaches have been developed that link the discrete space of combinatorial optimization to the continuous space of nonlinear optimization through geometric, analytic, and algebraic techniques. Many researchers have found that such approaches lead to very fast and efficient heuristics for solving large problems. Although almost all such heuristics work well in practice there is no solid theoretical analysis, except Karmakar's algorithm for linear programming. With this situation in mind, we decided to teach a seminar on nonlinear optimization with emphasis on its mathematical foundations. This book is the result of that seminar. During the last decades many textbooks and monographs in nonlinear optimization have been published. Why should we write this new one? What is the difference of this book from the others? The motivation for writing this book originated from our efforts to select a textbook for a graduate seminar with focus on the mathematical foundations of optimization.
Inbunden, Engelska, 2003
1 659 kr
Skickas inom 10-15 vardagar
Clustering is an important technique for discovering relatively dense sub-regions or sub-spaces of a multi-dimension data distribution. Clus tering has been used in information retrieval for many different purposes, such as query expansion, document grouping, document indexing, and visualization of search results. In this book, we address issues of cluster ing algorithms, evaluation methodologies, applications, and architectures for information retrieval. The first two chapters discuss clustering algorithms. The chapter from Baeza-Yates et al. describes a clustering method for a general metric space which is a common model of data relevant to information retrieval. The chapter by Guha, Rastogi, and Shim presents a survey as well as detailed discussion of two clustering algorithms: CURE and ROCK for numeric data and categorical data respectively. Evaluation methodologies are addressed in the next two chapters. Ertoz et al. demonstrate the use of text retrieval benchmarks, such as TRECS, to evaluate clustering algorithms. He et al. provide objective measures of clustering quality in their chapter. Applications of clustering methods to information retrieval is ad dressed in the next four chapters. Chu et al. and Noel et al. explore feature selection using word stems, phrases, and link associations for document clustering and indexing. Wen et al. and Sung et al. discuss applications of clustering to user queries and data cleansing. Finally, we consider the problem of designing architectures for infor mation retrieval. Crichton, Hughes, and Kelly elaborate on the devel opment of a scientific data system architecture for information retrieval.
Del 56 - Nonconvex Optimization and Its Applications
Mathematical Theory of Optimization
Häftad, Engelska, 2010
1 611 kr
Skickas inom 10-15 vardagar
Optimization is of central importance in all sciences. Nature inherently seeks optimal solutions. For example, light travels through the "shortest" path and the folded state of a protein corresponds to the structure with the "minimum" potential energy. In combinatorial optimization, there are numerous computationally hard problems arising in real world applications, such as floorplanning in VLSI designs and Steiner trees in communication networks. For these problems, the exact optimal solution is not currently real-time computable. One usually computes an approximate solution with various kinds of heuristics. Recently, many approaches have been developed that link the discrete space of combinatorial optimization to the continuous space of nonlinear optimization through geometric, analytic, and algebraic techniques. Many researchers have found that such approaches lead to very fast and efficient heuristics for solving large problems. Although almost all such heuristics work well in practice there is no solid theoretical analysis, except Karmakar's algorithm for linear programming. With this situation in mind, we decided to teach a seminar on nonlinear optimization with emphasis on its mathematical foundations. This book is the result of that seminar. During the last decades many textbooks and monographs in nonlinear optimization have been published. Why should we write this new one? What is the difference of this book from the others? The motivation for writing this book originated from our efforts to select a textbook for a graduate seminar with focus on the mathematical foundations of optimization.
Häftad, Engelska, 2011
1 669 kr
Skickas inom 10-15 vardagar
Clustering is an important technique for discovering relatively dense sub-regions or sub-spaces of a multi-dimension data distribution. Clus tering has been used in information retrieval for many different purposes, such as query expansion, document grouping, document indexing, and visualization of search results. In this book, we address issues of cluster ing algorithms, evaluation methodologies, applications, and architectures for information retrieval. The first two chapters discuss clustering algorithms. The chapter from Baeza-Yates et al. describes a clustering method for a general metric space which is a common model of data relevant to information retrieval. The chapter by Guha, Rastogi, and Shim presents a survey as well as detailed discussion of two clustering algorithms: CURE and ROCK for numeric data and categorical data respectively. Evaluation methodologies are addressed in the next two chapters. Ertoz et al. demonstrate the use of text retrieval benchmarks, such as TRECS, to evaluate clustering algorithms. He et al. provide objective measures of clustering quality in their chapter. Applications of clustering methods to information retrieval is ad dressed in the next four chapters. Chu et al. and Noel et al. explore feature selection using word stems, phrases, and link associations for document clustering and indexing. Wen et al. and Sung et al. discuss applications of clustering to user queries and data cleansing. Finally, we consider the problem of designing architectures for infor mation retrieval. Crichton, Hughes, and Kelly elaborate on the devel opment of a scientific data system architecture for information retrieval.
Inbunden, Engelska, 2016
1 295 kr
Skickas inom 10-15 vardagar
This book presents recent developments on the theoretical, algorithmic, and application aspects of Big Data in Complex and Social Networks. The book consists of four parts, covering a wide range of topics.The first part of the book focuses on data storage and data processing. It explores how the efficient storage of data can fundamentally support intensive data access and queries, which enables sophisticated analysis. It also looks at how data processing and visualization help to communicate information clearly and efficiently. The second part of the book is devoted to the extraction of essential information and the prediction of web content. The book shows how Big Data analysis can be used to understand the interests, location, and search history of users and provide more accurate predictions of User Behavior. The latter two parts of the book cover the protection of privacy and security, and emergent applications of big data and social networks. It analyzes how to model rumor diffusion, identify misinformation from massive data, and design intervention strategies. Applications of big data and social networks in multilayer networks and multiparty systems are also covered in-depth.
Häftad, Engelska, 2020
542 kr
Skickas inom 10-15 vardagar
The main topics covered in this book are: chrematistics of social networks, modeling of social influence propagation, popular research problems in social influence analysis such as influence maximization, rumor blocking, rumor source detection, and multiple social influence competing.
Del 162 - Springer Optimization and Its Applications
Optimal Coverage in Wireless Sensor Networks
Inbunden, Engelska, 2020
1 397 kr
Skickas inom 10-15 vardagar
The book is well versed with the hottest research topics such as Lifetime of Coverage, Weighted Sensor Cover, k-Coverage, Heterogeneous Sensors, Barrier, Sweep and Partial Coverage, Mobile Sensors, Camera Sensors and Energy-Harvesting Sensors, and more.
Del 12577 - Lecture Notes in Computer Science
Combinatorial Optimization and Applications
14th International Conference, COCOA 2020, Dallas, TX, USA, December 11–13, 2020, Proceedings
Häftad, Engelska, 2020
1 108 kr
Skickas inom 10-15 vardagar
This volume constitutes the proceedings of the 14th International Conference on Combinatorial Optimization and Applications, COCOA 2020, held in Dallas, TX, USA, in December 2020. The 55 full papers presented in this volume were carefully reviewed and selected from 104 submissions. Search, Facility and Graphs; and Graph Problems.
Del 13153 - Lecture Notes in Computer Science
Algorithmic Aspects in Information and Management
15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings
Häftad, Engelska, 2021
862 kr
Skickas inom 10-15 vardagar
This book constitutes the proceedings of the 15th International Conference on Algorithmic Aspects in Information and Management, AAIM 2021, which was held online during December 20-22, 2021. The conference was originally planned to take place in Dallas, Texas, USA, but changed to a virtual event due to the COVID-19 pandemic.
Del 196 - Springer Optimization and Its Applications
Introduction to Combinatorial Optimization
Inbunden, Engelska, 2022
595 kr
Skickas inom 10-15 vardagar
Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields.
Del 196 - Springer Optimization and Its Applications
Introduction to Combinatorial Optimization
Häftad, Engelska, 2023
595 kr
Skickas inom 10-15 vardagar
Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields.
Del 13513 - Lecture Notes in Computer Science
Algorithmic Aspects in Information and Management
16th International Conference, AAIM 2022, Guangzhou, China, August 13–14, 2022, Proceedings
Häftad, Engelska, 2022
542 kr
Skickas inom 10-15 vardagar
This book constitutes the proceedings of the 16th International Conference on Algorithmic Aspects in Information and Management, AAIM 2022, which was held online during August 13-14, 2022.
Häftad, Engelska, 2023
833 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed post-conference proceedings of the 15th International Conference on Wireless Internet, WiCON 2022, held in November 2022.
Del 14422 - Lecture Notes in Computer Science
Computing and Combinatorics
29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I
Häftad, Engelska, 2023
862 kr
Skickas inom 10-15 vardagar
This two volume set LNCS 14422-14423 constitutes the refereed proceedings of the 29th International Conference, COCOON 2023, held in Hawaii, HI, USA, during December 2023. They are organized in the following topical sections:Part I : Combinatorics and Algorithms; and Algorithm in Networks. Part II: Complexity and Approximation;
Del 14423 - Lecture Notes in Computer Science
Computing and Combinatorics
29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II
Häftad, Engelska, 2023
862 kr
Skickas inom 10-15 vardagar
This two volume set volume LNCS 14422-14423 constitutes the refereed proceedings of the 29th International Conference, COCOON 2023, held in Hawaii, HI, USA, during December 2023. They are organized in the following topical sections:Part I : Combinatorics and Algorithms;
Del 14461 - Lecture Notes in Computer Science
Combinatorial Optimization and Applications
16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I
Häftad, Engelska, 2023
969 kr
Skickas inom 10-15 vardagar
The two-volume set LNCS 14461 and LNCS 14462 constitutes the refereed proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2023, held in Hawaii, HI, USA, during December 15–17, 2023. They were organized in topical sections as follows: Part I: Optimization in graphs;
Del 14462 - Lecture Notes in Computer Science
Combinatorial Optimization and Applications
16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II
Häftad, Engelska, 2023
858 kr
Skickas inom 5-8 vardagar
The two-volume set LNCS 14461 and LNCS 14462 constitutes the refereed proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2023, held in Hawaii, HI, USA, during December 15–17, 2023. The 73 full papers included in the proceedings were carefully reviewed and selected from 117 submissions. They were organized in topical sections as follows: Part I: Optimization in graphs; scheduling; set-related optimization; applied optimization and algorithm; Graph planer and others;Part II: Modeling and algorithms; complexity and approximation; combinatorics and computing; optimization and algorithms; extreme graph and others; machine learning, blockchain and others.
Del 234 - Springer Optimization and Its Applications
Computational Aspects of Social Networks
Inbunden, Engelska, 2026
702 kr
Skickas inom 10-15 vardagar
This book offers a comprehensive exploration of computational social networks, focusing on the algorithmic and optimization aspects crucial for applications across diverse domains. As social data proliferates through platforms like Facebook, LinkedIn, and Skype, the need for efficient techniques to extract meaningful insights becomes paramount. This volume provides readers with a robust foundation in computational methods tailored for social networks. Key concepts include combinatorial optimization, machine learning applications, and advanced computational techniques. The chapters are meticulously organized to guide readers through fundamental knowledge, optimization strategies, and cutting-edge topics in the field. By integrating lecture notes and selected materials from leading IEEE/ACM publications, this book serves as an essential resource for understanding the complexities of social data analysis. Designed for graduate and senior undergraduate students in computer science and applied mathematics, this book assumes a foundational knowledge of programming and algorithm design. It is an invaluable tool for those seeking to harness the power of computational social networks in fields such as public safety, viral marketing, and misinformation clarification.
Del 9486 - Lecture Notes in Computer Science
Combinatorial Optimization and Applications
9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings
Häftad, Engelska, 2015
542 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 9th International Conference on Combinatorial Optimization and Applications, COCOA 2015, held in Houston, TX, USA, in December 2015. Topics covered include classic combinatorial optimization; geometric optimization; applied optimization; and optimization in graphs.
Del 9642 - Lecture Notes in Computer Science
Database Systems for Advanced Applications
21st International Conference, DASFAA 2016, Dallas, TX, USA, April 16-19, 2016, Proceedings, Part I
Häftad, Engelska, 2016
558 kr
Skickas inom 10-15 vardagar
This two volume set LNCS 9642 and LNCS 9643 constitutesthe refereed proceedings of the 21st International Conference on DatabaseSystems for Advanced Applications, DASFAA 2016, held in Dallas, TX, USA, inApril 2016. The 61 full papers presented were carefully reviewed andselected from a total of 183 submissions.
Del 9643 - Lecture Notes in Computer Science
Database Systems for Advanced Applications
21st International Conference, DASFAA 2016, Dallas, TX, USA, April 16-19, 2016, Proceedings, Part II
Häftad, Engelska, 2016
558 kr
Skickas inom 10-15 vardagar
This two volume set LNCS 9642 and LNCS 9643 constitutes the refereed proceedings of the 21st International Conference on Database Systems for Advanced Applications, DASFAA 2016, held in Dallas, TX, USA, in April 2016. The 61 full papers presented were carefully reviewed and selected from a total of 183 submissions.
Häftad, Engelska, 2010
542 kr
Skickas inom 10-15 vardagar
The 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) took place in Big Island, Hawaii, USA, December 18–20, 2010. Past COCOA conferences were held in Xi’an, China (2007), Newfoundland, Canada (2008)and Huangshan, China (2009). COCOA2010providedaforumforresearchersworkingintheareasofcom- natorial optimization and its applications. In addition to theoretical results, the conference also included recent works on experimental and applied research of general algorithmic interest. The Program Committee received 108 submissions from more than 23 countries and regions, including Australia, Austria, Canada, China, Denmark, France, Germany, Hong Kong, India, Italy, Japan, Korea, Mexico, New Zealand, Poland, Slovak Republic, Spain, Sweden, Switzerland, Taiwan, UK, USA, Vietnam, etc. Among the 108 submissions, 49 regular papers were selected for presentation at the conference and are included in this volume. Some of these papers will be selected for publication in a special issue of the Journal of Combinatorial Optimization, a special issue of Theoretical Computer Science, a special issue of Optimization Letters, and a special issue of Discrete Mathematics, Algorithms and Applications under the standard refereeing procedure.
Häftad, Engelska, 2010
542 kr
Skickas inom 10-15 vardagar
The 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) took place in Big Island, Hawaii, USA, December 18–20, 2010. Past COCOA conferences were held in Xi’an, China (2007), Newfoundland, Canada (2008)and Huangshan, China (2009). COCOA2010providedaforumforresearchersworkingintheareasofcom- natorial optimization and its applications. In addition to theoretical results, the conference also included recent works on experimental and applied research of general algorithmic interest. The Program Committee received 108 submissions from more than 23 countries and regions, including Australia, Austria, Canada, China, Denmark, France, Germany, Hong Kong, India, Italy, Japan, Korea, Mexico, New Zealand, Poland, Slovak Republic, Spain, Sweden, Switzerland, Taiwan, UK, USA, Vietnam, etc. Among the 108 submissions, 49 regular papers were selected for presentation at the conference and are included in this volume. Some of these papers will be selected for publication in a special issue of the Journal of Combinatorial Optimization, a special issue of Theoretical Computer Science, a special issue of Optimization Letters, and a special issue of Discrete Mathematics, Algorithms and Applications under the standard refereeing procedure.