Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Frontiers in Algorithmics [[electronic resource] ] : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings / / edited by Yijia Chen, Xiaotie Deng, Mei Lu
| Frontiers in Algorithmics [[electronic resource] ] : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings / / edited by Yijia Chen, Xiaotie Deng, Mei Lu |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (X, 183 p. 83 illus., 19 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer networks Artificial intelligence Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Communication Networks Artificial Intelligence |
| ISBN | 3-030-18126-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange -- A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem -- Efficient Guarding of Polygons and Terrains -- Graph Orientation with Edge Modifications -- Local Coloring: New Observations and New Reductions -- Secure Computation of Any Boolean Function Based on Any Deck of Cards -- A Novel Business Model for Electric Car Sharing -- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- Read-Once Resolutions in Horn Formulas -- Vertex-Critical (P5 ,banner)-Free Graphs -- An FPTAS for Stochastic Unbounded Min-Knapsack Problem -- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits -- Mutual Visibility by Robots with Persistent Memory -- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases -- An Improved Approximation Algorithm for the k-Means Problem with Penalties. . |
| Record Nr. | UNISA-996466303103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers in Algorithmics : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings / / edited by Yijia Chen, Xiaotie Deng, Mei Lu
| Frontiers in Algorithmics : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings / / edited by Yijia Chen, Xiaotie Deng, Mei Lu |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (X, 183 p. 83 illus., 19 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer networks Artificial intelligence Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Communication Networks Artificial Intelligence |
| ISBN | 3-030-18126-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange -- A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem -- Efficient Guarding of Polygons and Terrains -- Graph Orientation with Edge Modifications -- Local Coloring: New Observations and New Reductions -- Secure Computation of Any Boolean Function Based on Any Deck of Cards -- A Novel Business Model for Electric Car Sharing -- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- Read-Once Resolutions in Horn Formulas -- Vertex-Critical (P5 ,banner)-Free Graphs -- An FPTAS for Stochastic Unbounded Min-Knapsack Problem -- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits -- Mutual Visibility by Robots with Persistent Memory -- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases -- An Improved Approximation Algorithm for the k-Means Problem with Penalties. . |
| Record Nr. | UNINA-9910337854103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theoretical computer science : 40th national conference, NCTCS 2022, Changchun, China, July 29-31, 2022, revised selected papers / / edited by Zhiping Cai, Yijia Chen, Jialin Zhang
| Theoretical computer science : 40th national conference, NCTCS 2022, Changchun, China, July 29-31, 2022, revised selected papers / / edited by Zhiping Cai, Yijia Chen, Jialin Zhang |
| Pubbl/distr/stampa | Singapore : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (280 pages) |
| Disciplina | 929.605 |
| Collana | Communications in Computer and Information Science |
| Soggetto topico | Computer science |
| ISBN | 981-19-8152-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Computational Theory and Model -- General-Nondeterministic Fuzzy Pushdown Automata and Their Languages -- 1 Introduction -- 2 Preliminaries -- 2.1 Fuzzy Languages and Fuzzy Pushdown Automata -- 2.2 Fuzzy Context-Free Grammars and Their Languages -- 3 General-Nondeterministic Fuzzy Pushdown Automata -- 4 General-Nondeterministic Fuzzy Context-Free Grammars -- 4.1 Closure Properties of General-Nondeterministic Fuzzy Context-Free Languages -- 5 Conclusions -- References -- Joint Degree Distribution of Growing Multiplex Network Model with Nonlinear Preferential Attachment Rule -- 1 Introduction -- 2 Definitions and Model -- 2.1 Definitions and Notations -- 2.2 Multiplex Growth Network Model -- 3 Joint Degree Distribution in Multiplex Network Model -- 3.1 General Weight Function f -- 3.2 The Weight Function f(k)=k -- 3.3 The Weight Function f(k)=c> -- 0 -- 4 Simulation Results -- 5 Conclusions -- References -- Coherence of Quantum States Based on Mutually Unbiased Bases in C4 -- 1 Introduction -- 2 Preliminaries -- 3 The Geometric Measure of Coherence of Quantum States Under Complete MUBs in C2 -- 4 The l1 Norm of Coherence of Bell-Diagonal States Under Self-tensor MUBs in C4 -- 5 The l1 Norm of Coherence and the Relative Entropy of Coherence Under Complete MUBs in C4 -- 6 Summary -- References -- Determining the Sampling Size with Maintaining the Probability Distribution -- 1 Introduction -- 2 Related Works -- 2.1 Distribution Decomposition -- 2.2 Hoeffding's Inequality -- 3 Method -- 3.1 Problem Formulation -- 3.2 Sampling Size Estimation -- 4 Experiment -- 5 Conclusion -- References -- Approximation Algorithms -- The Polynomial Randomized Algorithm to Compute Bounded Degree Graph for TSP Based on Frequency Quadrilaterals -- 1 Introduction -- 2 Literature Review.
3 The Probability of Frequency for Edges in OHC -- 4 Proof of the Probability for Edges in OHC -- 5 An Iterative Algorithm -- 6 Conclusion -- References -- An Approximation Algorithm for the Minimum Soft Capacitated Disk Multi-coverage Problem -- 1 Introdunction -- 2 Preliminary -- 3 Linear Programming for the MSCDM Problem -- 4 An LP Rounding Algorithm -- 5 Conclusion -- References -- A 1/2 Approximation Algorithm for Energy-Constrained Geometric Coverage Problem -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Work -- 2 Preliminaries -- 3 Greedy+ Algorithm -- 4 Discussion -- References -- Artificial Intelligence -- MixHop Graph WaveNet for Traffic Forecasting -- 1 Introduction -- 2 Related Works -- 3 Methodology -- 3.1 Traffic Forecasting Problem -- 3.2 MixHop Graph Convolution Layer -- 3.3 Temporal Convolution Layer -- 3.4 Framework of Mixhop Graph WaveNet -- 4 Experiments -- 4.1 Datasets -- 4.2 Baselines -- 4.3 Experimental Setups -- 4.4 Experimental Results -- 4.5 Visualized Analysis -- 5 Conclusion -- References -- A Brief Discussion on the Reform of Mathematics Teaching in Artificial Intelligence Majors - Taking Matrix Computation and Optimization as Examples -- 1 Introduction -- 2 Problem -- 3 The Optimization of the Curriculum System -- 4 The Reform of Teaching Mode and Method -- 4.1 Design a New Curriculum System -- 4.2 Example Teaching Method -- 4.3 Thematic Discussion Teaching Method -- 4.4 Lecture-Based Teaching Method -- 4.5 Interactive Teaching Method -- 5 Practice Teaching Reform -- 5.1 Start Practical Course -- 5.2 Strengthen the Construction of Online Resources -- 6 Conclusion -- References -- Improved Spotted Hyena Optimizer Fused with Multiple Strategies -- 1 Introduction -- 2 Spotted Hyena Optimizer -- 2.1 Encircling Prey -- 2.2 Hunting -- 2.3 Attacking Prey(Exploitation) -- 2.4 Search for Prey (Exploration). 2.5 Algorithm Pseudocode -- 3 Improved Spotted Hyena Optimizer -- 3.1 Opposition-Based Learning -- 3.2 Spiral Exploration -- 3.3 Adaptive Weight -- 3.4 Improved Pseudocode for the Spotted Hyena Optimizer -- 4 Experiments and Performance Analysis -- 4.1 Experimental Environment and Parameter Settings -- 4.2 Experimental Results and Analysis -- 5 Conclusion -- References -- Regularized Framework on Heterogeneous Hypergraph Model for Personal Recommendation -- 1 Introduction -- 2 Related Work -- 3 Proposed Algorithm -- 3.1 Construction of Heterogeneous Hypergraph Network -- 3.2 Regularization Framework Based on Hypergraph -- 3.3 Score Prediction and Recommendation -- 4 Experiments and Results -- 4.1 Parameter Influence on Our Proposed Method -- 4.2 Tags Influence on Our Proposed Method -- 4.3 Comparing Results of Different Algorithms -- 5 Conclusion -- References -- Hybrid Pre-training Based on Masked Autoencoders for Medical Image Segmentation -- 1 Introduction -- 2 Methodology -- 2.1 Pre-training with Masked Autoencoders -- 2.2 TransUnet Architecture for Image Segmentation Tasks -- 3 Experiments and Results -- 3.1 Implementation Details -- 3.2 Results -- 4 Discussion and Conclusion -- References -- Deep Transfer Learning Based Risk Prediction Model for Infectious Disease -- 1 Introduction -- 2 Related Work -- 2.1 Infectious Disease Prediction -- 2.2 Deep Transfer Learning -- 3 Problem Formulation -- 4 Method -- 4.1 Dataset Preprocessing -- 4.2 MLP Feature Learning -- 4.3 Transfer Learning -- 5 Experimental Evaluation -- 5.1 Experiment Setting -- 5.2 Experiment Results -- 5.3 Ablation Experiment -- 6 Conclusion -- References -- A Data-Driven Framework for Crack Paths Propagation -- 1 Introduction -- 2 Related Works -- 3 Methodology -- 3.1 Filter Data -- 3.2 New Data Sampling -- 3.3 Generative Adversarial Networks(GAN) Model -- 4 Experiment. 5 Conclusion -- References -- System and Resource Scheduling -- A Modified List Scheduling Algorithm for the Online Hierarchical Load Balancing Problem with Bounded Processing Times -- 1 Introduction -- 2 Preliminaries -- 3 A Modified List Scheduling Algorithm -- 4 Discussion -- References -- An Improved ACS Algorithm by CA for Task Scheduling in Heterogeneous Multiprocessing Environments -- 1 Introduction -- 2 Related Work -- 2.1 List Scheduling Algorithms -- 2.2 Replication-Based Scheduling Algorithms -- 2.3 Swarm Intelligence Optimization Algorithms -- 3 Model Selection -- 4 Proposed Algorithms -- 4.1 Designing Group Space -- 4.2 Designing Belief Space -- 4.3 Communication Protocol -- 5 Experimental Results and Analysis -- 5.1 Comparative Metrics -- 5.2 Randomly Generated Model -- 5.3 Algorithm Performance Evaluation -- 6 Conclusion -- References -- On the Parameterized Tractability of Single Machine Scheduling with Rejection to Minimize the Weighted Makespan -- 1 Introduction -- 1.1 Scheduling with Rejection -- 1.2 Parameterized Complexity -- 1.3 Scheduling to Minimize the Weighted Makespan -- 2 Preliminaries -- 3 W[1]-hardness with Respect to k -- 4 Weighted Makespan with Rejection -- 4.1 Parameter wp -- 4.2 Parameter we -- 4.3 Parameter pe -- 5 Conclusions and Future Research -- References -- Multi-resource Allocation in Mobile Edge Computing Systems: A Trade-Off on Fairness and Efficiency -- 1 Introduction -- 2 System Model and Allocation Strategy -- 2.1 System Model -- 2.2 Resource Allocation -- 2.3 TSF -- 2.4 TSF-MME -- 3 The Pseudocode of TSF-MME -- 4 TSF-MME Properties -- 5 Conclusion -- References -- Maximin Share Based Mechanisms for Multi-resource Fair Allocation with Divisible and Indivisible Tasks -- 1 Introduction -- 2 Preliminaries -- 3 The Dividable Case -- 4 The Indivisible Case -- 5 Conclusion -- References -- Author Index. |
| Record Nr. | UNISA-996503566003316 |
| Singapore : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical computer science : 40th national conference, NCTCS 2022, Changchun, China, July 29-31, 2022, revised selected papers / / edited by Zhiping Cai, Yijia Chen, Jialin Zhang
| Theoretical computer science : 40th national conference, NCTCS 2022, Changchun, China, July 29-31, 2022, revised selected papers / / edited by Zhiping Cai, Yijia Chen, Jialin Zhang |
| Pubbl/distr/stampa | Singapore : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (280 pages) |
| Disciplina | 929.605 |
| Collana | Communications in Computer and Information Science |
| Soggetto topico | Computer science |
| ISBN | 981-19-8152-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Computational Theory and Model -- General-Nondeterministic Fuzzy Pushdown Automata and Their Languages -- 1 Introduction -- 2 Preliminaries -- 2.1 Fuzzy Languages and Fuzzy Pushdown Automata -- 2.2 Fuzzy Context-Free Grammars and Their Languages -- 3 General-Nondeterministic Fuzzy Pushdown Automata -- 4 General-Nondeterministic Fuzzy Context-Free Grammars -- 4.1 Closure Properties of General-Nondeterministic Fuzzy Context-Free Languages -- 5 Conclusions -- References -- Joint Degree Distribution of Growing Multiplex Network Model with Nonlinear Preferential Attachment Rule -- 1 Introduction -- 2 Definitions and Model -- 2.1 Definitions and Notations -- 2.2 Multiplex Growth Network Model -- 3 Joint Degree Distribution in Multiplex Network Model -- 3.1 General Weight Function f -- 3.2 The Weight Function f(k)=k -- 3.3 The Weight Function f(k)=c> -- 0 -- 4 Simulation Results -- 5 Conclusions -- References -- Coherence of Quantum States Based on Mutually Unbiased Bases in C4 -- 1 Introduction -- 2 Preliminaries -- 3 The Geometric Measure of Coherence of Quantum States Under Complete MUBs in C2 -- 4 The l1 Norm of Coherence of Bell-Diagonal States Under Self-tensor MUBs in C4 -- 5 The l1 Norm of Coherence and the Relative Entropy of Coherence Under Complete MUBs in C4 -- 6 Summary -- References -- Determining the Sampling Size with Maintaining the Probability Distribution -- 1 Introduction -- 2 Related Works -- 2.1 Distribution Decomposition -- 2.2 Hoeffding's Inequality -- 3 Method -- 3.1 Problem Formulation -- 3.2 Sampling Size Estimation -- 4 Experiment -- 5 Conclusion -- References -- Approximation Algorithms -- The Polynomial Randomized Algorithm to Compute Bounded Degree Graph for TSP Based on Frequency Quadrilaterals -- 1 Introduction -- 2 Literature Review.
3 The Probability of Frequency for Edges in OHC -- 4 Proof of the Probability for Edges in OHC -- 5 An Iterative Algorithm -- 6 Conclusion -- References -- An Approximation Algorithm for the Minimum Soft Capacitated Disk Multi-coverage Problem -- 1 Introdunction -- 2 Preliminary -- 3 Linear Programming for the MSCDM Problem -- 4 An LP Rounding Algorithm -- 5 Conclusion -- References -- A 1/2 Approximation Algorithm for Energy-Constrained Geometric Coverage Problem -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Work -- 2 Preliminaries -- 3 Greedy+ Algorithm -- 4 Discussion -- References -- Artificial Intelligence -- MixHop Graph WaveNet for Traffic Forecasting -- 1 Introduction -- 2 Related Works -- 3 Methodology -- 3.1 Traffic Forecasting Problem -- 3.2 MixHop Graph Convolution Layer -- 3.3 Temporal Convolution Layer -- 3.4 Framework of Mixhop Graph WaveNet -- 4 Experiments -- 4.1 Datasets -- 4.2 Baselines -- 4.3 Experimental Setups -- 4.4 Experimental Results -- 4.5 Visualized Analysis -- 5 Conclusion -- References -- A Brief Discussion on the Reform of Mathematics Teaching in Artificial Intelligence Majors - Taking Matrix Computation and Optimization as Examples -- 1 Introduction -- 2 Problem -- 3 The Optimization of the Curriculum System -- 4 The Reform of Teaching Mode and Method -- 4.1 Design a New Curriculum System -- 4.2 Example Teaching Method -- 4.3 Thematic Discussion Teaching Method -- 4.4 Lecture-Based Teaching Method -- 4.5 Interactive Teaching Method -- 5 Practice Teaching Reform -- 5.1 Start Practical Course -- 5.2 Strengthen the Construction of Online Resources -- 6 Conclusion -- References -- Improved Spotted Hyena Optimizer Fused with Multiple Strategies -- 1 Introduction -- 2 Spotted Hyena Optimizer -- 2.1 Encircling Prey -- 2.2 Hunting -- 2.3 Attacking Prey(Exploitation) -- 2.4 Search for Prey (Exploration). 2.5 Algorithm Pseudocode -- 3 Improved Spotted Hyena Optimizer -- 3.1 Opposition-Based Learning -- 3.2 Spiral Exploration -- 3.3 Adaptive Weight -- 3.4 Improved Pseudocode for the Spotted Hyena Optimizer -- 4 Experiments and Performance Analysis -- 4.1 Experimental Environment and Parameter Settings -- 4.2 Experimental Results and Analysis -- 5 Conclusion -- References -- Regularized Framework on Heterogeneous Hypergraph Model for Personal Recommendation -- 1 Introduction -- 2 Related Work -- 3 Proposed Algorithm -- 3.1 Construction of Heterogeneous Hypergraph Network -- 3.2 Regularization Framework Based on Hypergraph -- 3.3 Score Prediction and Recommendation -- 4 Experiments and Results -- 4.1 Parameter Influence on Our Proposed Method -- 4.2 Tags Influence on Our Proposed Method -- 4.3 Comparing Results of Different Algorithms -- 5 Conclusion -- References -- Hybrid Pre-training Based on Masked Autoencoders for Medical Image Segmentation -- 1 Introduction -- 2 Methodology -- 2.1 Pre-training with Masked Autoencoders -- 2.2 TransUnet Architecture for Image Segmentation Tasks -- 3 Experiments and Results -- 3.1 Implementation Details -- 3.2 Results -- 4 Discussion and Conclusion -- References -- Deep Transfer Learning Based Risk Prediction Model for Infectious Disease -- 1 Introduction -- 2 Related Work -- 2.1 Infectious Disease Prediction -- 2.2 Deep Transfer Learning -- 3 Problem Formulation -- 4 Method -- 4.1 Dataset Preprocessing -- 4.2 MLP Feature Learning -- 4.3 Transfer Learning -- 5 Experimental Evaluation -- 5.1 Experiment Setting -- 5.2 Experiment Results -- 5.3 Ablation Experiment -- 6 Conclusion -- References -- A Data-Driven Framework for Crack Paths Propagation -- 1 Introduction -- 2 Related Works -- 3 Methodology -- 3.1 Filter Data -- 3.2 New Data Sampling -- 3.3 Generative Adversarial Networks(GAN) Model -- 4 Experiment. 5 Conclusion -- References -- System and Resource Scheduling -- A Modified List Scheduling Algorithm for the Online Hierarchical Load Balancing Problem with Bounded Processing Times -- 1 Introduction -- 2 Preliminaries -- 3 A Modified List Scheduling Algorithm -- 4 Discussion -- References -- An Improved ACS Algorithm by CA for Task Scheduling in Heterogeneous Multiprocessing Environments -- 1 Introduction -- 2 Related Work -- 2.1 List Scheduling Algorithms -- 2.2 Replication-Based Scheduling Algorithms -- 2.3 Swarm Intelligence Optimization Algorithms -- 3 Model Selection -- 4 Proposed Algorithms -- 4.1 Designing Group Space -- 4.2 Designing Belief Space -- 4.3 Communication Protocol -- 5 Experimental Results and Analysis -- 5.1 Comparative Metrics -- 5.2 Randomly Generated Model -- 5.3 Algorithm Performance Evaluation -- 6 Conclusion -- References -- On the Parameterized Tractability of Single Machine Scheduling with Rejection to Minimize the Weighted Makespan -- 1 Introduction -- 1.1 Scheduling with Rejection -- 1.2 Parameterized Complexity -- 1.3 Scheduling to Minimize the Weighted Makespan -- 2 Preliminaries -- 3 W[1]-hardness with Respect to k -- 4 Weighted Makespan with Rejection -- 4.1 Parameter wp -- 4.2 Parameter we -- 4.3 Parameter pe -- 5 Conclusions and Future Research -- References -- Multi-resource Allocation in Mobile Edge Computing Systems: A Trade-Off on Fairness and Efficiency -- 1 Introduction -- 2 System Model and Allocation Strategy -- 2.1 System Model -- 2.2 Resource Allocation -- 2.3 TSF -- 2.4 TSF-MME -- 3 The Pseudocode of TSF-MME -- 4 TSF-MME Properties -- 5 Conclusion -- References -- Maximin Share Based Mechanisms for Multi-resource Fair Allocation with Divisible and Indivisible Tasks -- 1 Introduction -- 2 Preliminaries -- 3 The Dividable Case -- 4 The Indivisible Case -- 5 Conclusion -- References -- Author Index. |
| Record Nr. | UNINA-9910634046803321 |
| Singapore : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||