國立虎尾科技大學 |

Algorithmic Aspects in Information and Management = 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithmic Aspects in Information and Management/ edited by Weili Wu, Hongwei Du.
其他題名:	15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings /
其他作者:	Du, Hongwei.
面頁冊數:	XII, 452 p. 80 illus., 52 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Numeric Computing. -
電子資源:	https://doi.org/10.1007/978-3-030-93176-6
ISBN:	9783030931766

Algorithmic Aspects in Information and Management = 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings /
Algorithmic Aspects in Information and Management15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings /[electronic resource] :edited by Weili Wu, Hongwei Du. - 1st ed. 2021. - XII, 452 p. 80 illus., 52 illus. in color.online resource. - Theoretical Computer Science and General Issues ;13153. - Theoretical Computer Science and General Issues ;9163.

Approximation Algorithms -- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations -- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties -- Approximation algorithms for the maximum bounded connected bipartition problem -- An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem -- On Stochastic k-Facility Location -- The Complexity of Finding a Broadcast Center -- An Online Algorithm for Data Caching Problem in Edge Computing -- Topical part: Scheduling -- Scheduling on Multiple Two-Stage Flowshops with A Deadline -- Single machine scheduling with rejection to minimize the weighted makespan -- Maximizing Energy Efficiency for Charger Scheduling of WRSNs -- A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem -- Optimizing mobile charger scheduling for task-based sensor networks -- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time -- Topical part: Nonlinear Combinatorial Optimization -- Streaming Algorithms for Maximizing DR-submodular Functions with d-Knapsack Constraints -- Stochastic Submodular Probing with State-Dependent Costs -- Bi-criteria Adaptive Algorithms for Supermodular Minimization -- Improved Algorithms for Non-submodular Function Maximization Problem -- Fixed Observation Time-step: Adaptive Influence Maximization -- Measured Continuous Greedy with Differential Privacy -- Topical part: Network Problems -- Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks -- Multi-attribute based Influence Maximization in Social Networks -- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks -- A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with Min-Sum Movement -- Time Sensitive Sweep Coverage with Multiple UAVs -- Recursive Merged Community Detection Algorithm based on Node Cluster -- Purchase Preferences - Based Air Passenger Choice Behavior Analysis from Sales Transaction Data -- Topical part: Blockchain, Logic, Complexity and Reliability -- Multi-Window Bitcoin Price Prediction Framework on Blockchain Transaction Graph -- Sensitivity-Based Optimization for Blockchain Selfish Mining -- Design and Implementation of List and Dictionary in XD-M Language -- Reliable Edge Intelligence using JPEG Progressive -- A game-theoretic analysis of deep neural networks -- Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case -- Topical part: Miscellaneous -- The independence numbers of weighted graphs with forbidden cycles -- Wegner's Conjecture on 2-Distance Coloring -- An Efficient Oracle for Counting Shortest Paths in Planar Graphs -- Restrained and total restrained domination in cographs -- An order Approach for the Core Maintenance Problem on Edge-weighted Graphs -- Fixed-parameter Tractability for Book Drawing with Bounded Number of Crossings Per Edge.

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. The 38 regular papers included in this book were carefully reviewed and selected from 62 submissions. They were organized in the following topical sections: approximation algorithms; scheduling; nonlinear combinatorial optimization; network problems; blockchain, logic, complexity and reliability; and miscellaneous. .

ISBN: 9783030931766

Standard No.: 10.1007/978-3-030-93176-6doiSubjects--Topical Terms:

669943
Numeric Computing.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Algorithmic Aspects in Information and Management = 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings /
LDR:05218nam a22004215i 4500 001 1057767
003 DE-He213
005 20211216215120.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030931766 $9 978-3-030-93176-6
024 7 $a 10.1007/978-3-030-93176-6 $2 doi
035 $a 978-3-030-93176-6
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Algorithmic Aspects in Information and Management $h [electronic resource] : $b 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings / $c edited by Weili Wu, Hongwei Du.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XII, 452 p. 80 illus., 52 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 13153
505 0 $a Approximation Algorithms -- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations -- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties -- Approximation algorithms for the maximum bounded connected bipartition problem -- An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem -- On Stochastic k-Facility Location -- The Complexity of Finding a Broadcast Center -- An Online Algorithm for Data Caching Problem in Edge Computing -- Topical part: Scheduling -- Scheduling on Multiple Two-Stage Flowshops with A Deadline -- Single machine scheduling with rejection to minimize the weighted makespan -- Maximizing Energy Efficiency for Charger Scheduling of WRSNs -- A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem -- Optimizing mobile charger scheduling for task-based sensor networks -- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time -- Topical part: Nonlinear Combinatorial Optimization -- Streaming Algorithms for Maximizing DR-submodular Functions with d-Knapsack Constraints -- Stochastic Submodular Probing with State-Dependent Costs -- Bi-criteria Adaptive Algorithms for Supermodular Minimization -- Improved Algorithms for Non-submodular Function Maximization Problem -- Fixed Observation Time-step: Adaptive Influence Maximization -- Measured Continuous Greedy with Differential Privacy -- Topical part: Network Problems -- Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks -- Multi-attribute based Influence Maximization in Social Networks -- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks -- A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with Min-Sum Movement -- Time Sensitive Sweep Coverage with Multiple UAVs -- Recursive Merged Community Detection Algorithm based on Node Cluster -- Purchase Preferences - Based Air Passenger Choice Behavior Analysis from Sales Transaction Data -- Topical part: Blockchain, Logic, Complexity and Reliability -- Multi-Window Bitcoin Price Prediction Framework on Blockchain Transaction Graph -- Sensitivity-Based Optimization for Blockchain Selfish Mining -- Design and Implementation of List and Dictionary in XD-M Language -- Reliable Edge Intelligence using JPEG Progressive -- A game-theoretic analysis of deep neural networks -- Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case -- Topical part: Miscellaneous -- The independence numbers of weighted graphs with forbidden cycles -- Wegner's Conjecture on 2-Distance Coloring -- An Efficient Oracle for Counting Shortest Paths in Planar Graphs -- Restrained and total restrained domination in cographs -- An order Approach for the Core Maintenance Problem on Edge-weighted Graphs -- Fixed-parameter Tractability for Book Drawing with Bounded Number of Crossings Per Edge.
520 $a 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. The 38 regular papers included in this book were carefully reviewed and selected from 62 submissions. They were organized in the following topical sections: approximation algorithms; scheduling; nonlinear combinatorial optimization; network problems; blockchain, logic, complexity and reliability; and miscellaneous. .
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Computer Imaging, Vision, Pattern Recognition and Graphics. $3 671334
650 2 4 $a Theory of Computation. $3 669322
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 0 $a Numerical analysis. $3 527939
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Optical data processing. $3 639187
650 0 $a Computers. $3 565115
650 0 $a Computer science—Mathematics. $3 1253519
700 1 $a Du, Hongwei. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1226481
700 1 $a Wu, Weili. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 678792
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030931759
776 0 8 $i Printed edition: $z 9783030931773
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-93176-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)