Business Information Systems Workshops [[electronic resource] ] : BIS 2021 International Workshops, Virtual Event, June 14–17, 2021, Revised Selected Papers / / edited by Witold Abramowicz, Sören Auer, Milena Stróżyna |
Edizione | [1st ed. 2022.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
Descrizione fisica | 1 online resource (389 pages) |
Disciplina | 658.4038 |
Collana | Lecture Notes in Business Information Processing |
Soggetto topico |
Business information services
Quantitative research Application software Education - Data processing Customer relations - Management Data protection Business Information Systems Data Analysis and Big Data Computer and Information Systems Applications Computers and Education Customer Relationship Management Data and Information Security |
Soggetto non controllato |
Technology
Technology & Engineering |
ISBN | 3-031-04216-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | AKTB Workshop -- Analysis of the structure of Germany's energy sector with self-organizing Kohonen maps -- Time-to-Event Modelling for survival and hazard analysis of Stroke clinical case -- Automatically Extracting Insurance Contract Knowledge Using NLP -- Analyzing Medical Data with Process Mining: a COVID-19 Case Study -- Problem Domain Example of Knowledge-Based Enterprise Model Usage for Different UML Behavioral Models Generation -- BIS Education Workshop -- Reconsidering the Challenges of BIS Education in Light of the COVID Pandemic -- COVID-19-related challenges in business information systems education: experiences from Slovenia -- Successful Project Completion During the COVID-19 Pandemic - A Lesson Learnt -- Comparative analysis of highly ranked BIS degree programs -- DigBD Workshop -- Multi-Agent System for Weather Forecasting in India -- Towards a Data Collection Quality Model for Big Data Applications -- Investigating the Incorporation of Big Data in Management Information Systems -- The Perception of Test Driven Development in Computer Science - Outline for a Structured Literature Review -- DigEx Workshop -- Influence of Augmented Reality on Consumer Behaviour in Online Retailing -- Personality Based Data-driven Personalizationas as an Integral Part of the Mobile Application -- iCRM Workshop -- Social CRM as a business strategy: developing the dynamic capabilities of Micro and Small Businesses -- Gaining Insights on Student Satisfaction by applying Social CRM techniques for Higher Education Institutions -- Understanding Customer-induced Orchestration of Services: A Review of Drivers and Concepts -- QOD Workshop -- A high-resolution urban land surface dataset for the Hong Kong-Shenzhen area -- Review of literature on Open Data for scalability and operation efficiency of electric bus fleets -- Challenges of Mining Twitter Data for Analyzing Service Performance: A Case study of Transportation Service in Malaysia -- Data quality assessment of comma separated values using linked data approach -- Spatio-temporal data sources integration with ontology for road accidents analysis -- BITA Workshop -- IT-Service Value Modeling: A Systematic Literature Analysis -- Consolidating Academic and Practical Guidelines for Digital Transformation -- Integrated Security Management of Public and Private Sector for Critical Infrastructures - Problem Investigation -- Market Launch and Regulative Assessment of ICT-based Medical Devices: Case Study and Problem Definition -- BSCT Workshop -- A Probabilistic Logic Model of Lightning Network -- Enabling Electronic Bills of Lading by Using a Private Blockchain -- Modeling the Resilience of the Cryptocurrency Market to COVID-19 -- Fast payment systems dynamics: lessons from diffusion of innovation models -- A Meta-Review of Blockchain Adoption Literature in Supply Chain. |
Record Nr. | UNINA-9910559385903321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Business Information Systems Workshops [[electronic resource] ] : BIS 2021 International Workshops, Virtual Event, June 14–17, 2021, Revised Selected Papers / / edited by Witold Abramowicz, Sören Auer, Milena Stróżyna |
Edizione | [1st ed. 2022.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
Descrizione fisica | 1 online resource (389 pages) |
Disciplina | 658.4038 |
Collana | Lecture Notes in Business Information Processing |
Soggetto topico |
Business information services
Quantitative research Application software Education - Data processing Customer relations - Management Data protection Business Information Systems Data Analysis and Big Data Computer and Information Systems Applications Computers and Education Customer Relationship Management Data and Information Security |
Soggetto non controllato |
Technology
Technology & Engineering |
ISBN | 3-031-04216-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | AKTB Workshop -- Analysis of the structure of Germany's energy sector with self-organizing Kohonen maps -- Time-to-Event Modelling for survival and hazard analysis of Stroke clinical case -- Automatically Extracting Insurance Contract Knowledge Using NLP -- Analyzing Medical Data with Process Mining: a COVID-19 Case Study -- Problem Domain Example of Knowledge-Based Enterprise Model Usage for Different UML Behavioral Models Generation -- BIS Education Workshop -- Reconsidering the Challenges of BIS Education in Light of the COVID Pandemic -- COVID-19-related challenges in business information systems education: experiences from Slovenia -- Successful Project Completion During the COVID-19 Pandemic - A Lesson Learnt -- Comparative analysis of highly ranked BIS degree programs -- DigBD Workshop -- Multi-Agent System for Weather Forecasting in India -- Towards a Data Collection Quality Model for Big Data Applications -- Investigating the Incorporation of Big Data in Management Information Systems -- The Perception of Test Driven Development in Computer Science - Outline for a Structured Literature Review -- DigEx Workshop -- Influence of Augmented Reality on Consumer Behaviour in Online Retailing -- Personality Based Data-driven Personalizationas as an Integral Part of the Mobile Application -- iCRM Workshop -- Social CRM as a business strategy: developing the dynamic capabilities of Micro and Small Businesses -- Gaining Insights on Student Satisfaction by applying Social CRM techniques for Higher Education Institutions -- Understanding Customer-induced Orchestration of Services: A Review of Drivers and Concepts -- QOD Workshop -- A high-resolution urban land surface dataset for the Hong Kong-Shenzhen area -- Review of literature on Open Data for scalability and operation efficiency of electric bus fleets -- Challenges of Mining Twitter Data for Analyzing Service Performance: A Case study of Transportation Service in Malaysia -- Data quality assessment of comma separated values using linked data approach -- Spatio-temporal data sources integration with ontology for road accidents analysis -- BITA Workshop -- IT-Service Value Modeling: A Systematic Literature Analysis -- Consolidating Academic and Practical Guidelines for Digital Transformation -- Integrated Security Management of Public and Private Sector for Critical Infrastructures - Problem Investigation -- Market Launch and Regulative Assessment of ICT-based Medical Devices: Case Study and Problem Definition -- BSCT Workshop -- A Probabilistic Logic Model of Lightning Network -- Enabling Electronic Bills of Lading by Using a Private Blockchain -- Modeling the Resilience of the Cryptocurrency Market to COVID-19 -- Fast payment systems dynamics: lessons from diffusion of innovation models -- A Meta-Review of Blockchain Adoption Literature in Supply Chain. |
Record Nr. | UNISA-996472067003316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 24th International Conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023, Proceedings / / edited by Alberto Del Pia, Volker Kaibel |
Autore | Del Pia Alberto |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (494 pages) |
Disciplina | 519.77 |
Altri autori (Persone) | KaibelVolker |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer science—Mathematics
Mathematics—Data processing Discrete mathematics Application software Mathematics of Computing Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science Computer and Information Systems Applications |
Soggetto non controllato |
Technology
Technology & Engineering |
ISBN |
9783031327261
9783031327254 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Information Complexity of Mixed-Integer Convex Optimization -- 1 First-order Information Complexity -- 1.1 Our Results -- 1.2 Formal Definitions and Statement of Results -- 1.3 Discussion and Future Avenues -- 2 Proof Sketches -- 2.1 Proof Sketch of Theorem 1 -- 2.2 Proof of Theorem 3 -- 2.3 Proof Sketch of Theorem 5 -- 2.4 Proof Sketch of Theorems 2 and 4 -- References -- Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products -- 1 Introduction -- 2 RLT for Bilinear Products -- 3 Detection of Implicit Products -- 4 Separation Algorithm -- 4.1 Row Marking -- 4.2 Projection Filtering -- 5 Computational Results -- 5.1 Setup -- 5.2 Impact of RLT Cuts -- 5.3 Separation -- 5.4 Experiments with Gurobi -- 5.5 Summary -- References -- A Nearly Optimal Randomized Algorithm for Explorable Heap Selection -- 1 Introduction -- 2 The Explorable Heap Selection Problem -- 3 A New Algorithm -- 3.1 The Algorithm -- 3.2 Proof of Correctness -- 3.3 Running Time Analysis -- 3.4 Space Complexity Analysis -- 4 Lower Bound -- References -- Sparse Approximation over the Cube -- 1 Introduction and Literature Review -- 2 Preliminaries -- 3 The l1-Relaxation for Random Targets b -- 4 Proximity Between Optimal Solutions of ([P0]P0) and ([P1]P1) -- 5 A Deterministic Algorithm -- 6 Extension -- References -- Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty -- 1 Introduction -- 2 Recycling Valid Inequalities -- 3 Facet-Defining Recycled Inequalities -- 4 Computational Study -- 4.1 Robust Independent Set -- 4.2 Robust Bipartite Matching -- 5 Conclusion -- References -- Inapproximability of Shortest Paths on Perfect Matching Polytopes -- 1 Introduction -- 1.1 Our Result -- 1.2 Pivot Rules for Circuit-Augmentation Algorithms -- 1.3 Related Works -- 2 Proof of Theorem 1.
2.1 Preliminaries -- 2.2 Reduction -- 2.3 Proof of Lemma 3 -- References -- Monoidal Strengthening and Unique Lifting in MIQCPs -- 1 Introduction -- 2 Monoidal Strengthening in the Homogeneous Case -- 3 Monoidal Strengthening in the Non-homogeneous Case -- 3.1 A Technical Consideration for Sg -- 3.2 Monoid Construction -- 4 Solving the Monoidal Strengthening Problem -- 5 Unique Lifting -- 6 Computational Results -- References -- From Approximate to Exact Integer Programming -- 1 Introduction -- 1.1 Contributions of This Paper -- 1.2 Related Work -- 2 Preliminaries -- 3 The Cut-Or-Average Algorithm -- 3.1 Bounding the Number of Iterations -- 3.2 Correctness and Efficiency of Subroutines -- 3.3 Conclusion on the Cut-Or-Average Algorithm -- 4 An Asymmetric Approximate Carathéodory Theorem -- 5 IPs with Polynomial Variable Range -- References -- Optimizing Low Dimensional Functions over the Integers -- 1 Introduction -- 1.1 Applications -- 1.2 Overview of Techniques -- 2 Non-negative Variables -- 3 Bounded Variables -- 4 Overview of Hunkenschröder Et Al. ch9hunkenschroder2022optimizing and Related Improvements -- 5 Conclusion and Open Questions -- References -- Configuration Balancing for Stochastic Requests -- 1 Introduction -- 1.1 Our Results -- 1.2 Technical Overview -- 1.3 Related Work -- 2 Configuration Balancing with Stochastic Requests -- 2.1 Structural Theorem -- 2.2 Offline Setting -- 2.3 Online Setting -- 3 Load Balancing on Related Machines -- References -- An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem -- 1 Introduction -- 2 Preliminaries -- 2.1 Optimal Solutions and Proximity -- 2.2 The Centroid Mapping -- 3 The Update-and-Stabilize Framework -- 4 Analysis -- 5 Computational Experiments -- References -- Stabilization of Capacitated Matching Games -- 1 Introduction -- 2 Preliminaries and Notation -- 3 M-vertex-stabilizer. 4 Vertex-Stabilizer -- 5 Capacitated Cooperative Matching Games -- References -- Designing Optimization Problems with Diverse Solutions -- 1 Introduction -- 2 Statement of Main Results -- 2.1 The Cyclic Polytope -- 2.2 Results and Techniques -- 3 Preliminaries -- 4 Upper Bound (Proof of Theorem 1) -- 5 General Lower Bound (Proof of Theorem 2) -- 5.1 Construction Based on Moment Curve -- 5.2 Dual Certificate for Loadouts -- 5.3 Counting the Number of k-Loadouts -- 6 Conclusion -- References -- ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation -- 1 Introduction -- 1.1 Our Main Results -- 1.2 Discussion of the Results -- 1.3 Further Related Work -- 2 Algorithms and Proof Overview -- References -- On the Correlation Gap of Matroids -- 1 Introduction -- 1.1 Our Techniques -- 2 Preliminaries -- 3 Locating the Correlation Gap -- 4 Lower Bounding the Correlation Gap -- 4.1 Lower Bounding G(x*) -- 4.2 Lower Bounding H(x*) -- 4.3 Putting Everything Together -- References -- A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP -- 1 Introduction -- 2 Preliminaries -- 3 Proof of Theorem 1 -- 4 Conclusion and Open Questions -- References -- The Polyhedral Geometry of Truthful Auctions -- 1 Introduction -- 2 Preliminaries -- 3 Characterization of One-Player Mechanisms -- 4 Sensitivity of Mechanisms -- 5 Conclusion -- References -- Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling -- 1 Introduction -- 2 Preliminaries -- 3 Lower Bound -- 4 The b-scaling Strategy -- 4.1 The Deterministic b-scaling Strategy -- 4.2 The Randomized b-scaling Strategy -- 5 Weighted Shortest Elapsed Time First -- 6 Upper Bounds for More General Settings -- 7 Conclusion -- References -- A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP -- 1 Introduction -- 1.1 High Level Proof Overview. 2 Preliminaries -- 2.1 Notation -- 2.2 Randomized Algorithm of ch19KKO21a -- 2.3 Polyhedral Background -- 3 Computing Probabilities -- 3.1 Notation -- 3.2 Matrix Tree Theorem -- 3.3 Computing Parities in a Simple Case -- 4 A Deterministic Algorithm in the Degree Cut Case -- 5 General Case -- References -- Monoidal Strengthening of Simple V-Polyhedral Disjunctive Cuts -- 1 Introduction -- 2 Notation and Background -- 3 Correspondence Between PRLP and CGLP Solutions -- 3.1 Simple VPCs -- 3.2 Relaxations Without Primal Degeneracy -- 3.3 Relaxations with Primal Degeneracy -- 4 Computational Experiments -- 5 Choosing a Relaxation Amenable to Strengthening -- 6 Conclusion -- References -- Optimal General Factor Problem and Jump System Intersection -- 1 Introduction -- 1.1 General Factor Problem -- 1.2 Jump System Intersection -- 1.3 Our Contribution: Jump System with SBO Property -- 1.4 Organization -- 2 Preliminaries -- 3 Algorithm and Correctness -- 4 Outline of the Proof of Lemma 1 -- 4.1 Minimal Counterexample -- 4.2 Part of Case Analysis: |U|=3 -- 5 Extension to Valuated Problem -- 6 Weighted Optimal General Factor Problem -- 7 Concluding Remarks -- References -- Decomposition of Probability Marginals for Security Games in Abstract Networks -- 1 Introduction -- 1.1 Motivation -- 1.2 Abstract Networks -- 1.3 Previous Results -- 1.4 Our Results -- 1.5 Notation -- 2 Feasible Decompositions in Abstract Networks -- 3 Computing Feasible Decompositions -- 4 Computing Shortest Paths in Abstract Networks -- 5 Dahan et al.'s Network Security Game -- 6 The Conservation Law for Partially Ordered Sets -- 7 Other Set Systems -- References -- Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques -- 1 Introduction -- 2 Algorithmic Framework -- 2.1 Offline Problems and Hardness of Approximation -- 2.2 Algorithmic Framework. 3 MinSet with Deterministic Right-Hand Sides -- 4 MinSet Under Uncertainty -- 5 Disjoint MinSet -- References -- Towards a Characterization of Maximal Quadratic-Free Sets -- 1 Introduction -- 1.1 Contributions -- 2 Examples of Maximal Homogeneous Quadratic-Free Sets -- 3 A Proof of Theorem 5 -- 4 A Proof of Theorem 1 -- 5 A Proof of Theorem 2 -- 6 Preliminary Results on Non-expansive Functions -- 7 A Proof of Theorem 3 -- 8 A Proof of Theorem 4 -- References -- Compressing Branch-and-Bound Trees -- 1 Introduction -- 2 The Tree Compression Problem (TCP) -- 3 Complexity Results and Lower Bounds -- 4 Compression Algorithms -- 4.1 An Exact Method -- 4.2 A Heuristic Method -- 5 Computational Experiments -- 5.1 Methodology -- 5.2 Full Strong Branching Results -- 5.3 Reliability Branching with Plunging -- 6 Future Work -- References -- Exploiting the Polyhedral Geometry of Stochastic Linear Bilevel Programming -- 1 Introduction -- 1.1 Problem Formulation and Contributions -- 2 Preliminaries -- 3 Vertex-Supported Beliefs and Bayesian Formulation -- 3.1 Sample Average Formulation -- 4 Geometrical Structure of Vertex-Supported Beliefs -- 5 Algorithms -- 5.1 Enumeration Algorithm -- 5.2 Monte-Carlo Approximation Scheme -- 6 Numerical Experiments -- References -- Towards an Optimal Contention Resolution Scheme for Matchings -- 1 Introduction -- 1.1 Our Results -- 1.2 Our Techniques -- 2 An Optimal CRS When "026B30D x"026B30D 0 -- 2.1 The Karp-Sipser Algorithm -- 2.2 Random Trees -- 2.3 The Karp-Sipser Algorithm on Trees -- 2.4 Putting It Together -- 3 Improved CRSs for Bipartite Matchings -- 3.1 A 0.480-Balanced Scheme for Bipartite Matchings -- 3.2 A 0.509-Balanced Scheme for Bipartite Matchings -- References -- Advances on Strictly -Modular IPs -- 1 Introduction -- 1.1 Group-Constrained Problems and Proof Strategy for Theorem 1 -- 1.2 Further Related Work. 1.3 Structure of the Paper. |
Record Nr. | UNISA-996534465903316 |
Del Pia Alberto | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 24th International Conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023, Proceedings / / edited by Alberto Del Pia, Volker Kaibel |
Autore | Del Pia Alberto |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (494 pages) |
Disciplina | 519.77 |
Altri autori (Persone) | KaibelVolker |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer science—Mathematics
Mathematics—Data processing Discrete mathematics Application software Mathematics of Computing Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science Computer and Information Systems Applications |
Soggetto non controllato |
Technology
Technology & Engineering |
ISBN |
9783031327261
9783031327254 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Information Complexity of Mixed-Integer Convex Optimization -- 1 First-order Information Complexity -- 1.1 Our Results -- 1.2 Formal Definitions and Statement of Results -- 1.3 Discussion and Future Avenues -- 2 Proof Sketches -- 2.1 Proof Sketch of Theorem 1 -- 2.2 Proof of Theorem 3 -- 2.3 Proof Sketch of Theorem 5 -- 2.4 Proof Sketch of Theorems 2 and 4 -- References -- Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products -- 1 Introduction -- 2 RLT for Bilinear Products -- 3 Detection of Implicit Products -- 4 Separation Algorithm -- 4.1 Row Marking -- 4.2 Projection Filtering -- 5 Computational Results -- 5.1 Setup -- 5.2 Impact of RLT Cuts -- 5.3 Separation -- 5.4 Experiments with Gurobi -- 5.5 Summary -- References -- A Nearly Optimal Randomized Algorithm for Explorable Heap Selection -- 1 Introduction -- 2 The Explorable Heap Selection Problem -- 3 A New Algorithm -- 3.1 The Algorithm -- 3.2 Proof of Correctness -- 3.3 Running Time Analysis -- 3.4 Space Complexity Analysis -- 4 Lower Bound -- References -- Sparse Approximation over the Cube -- 1 Introduction and Literature Review -- 2 Preliminaries -- 3 The l1-Relaxation for Random Targets b -- 4 Proximity Between Optimal Solutions of ([P0]P0) and ([P1]P1) -- 5 A Deterministic Algorithm -- 6 Extension -- References -- Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty -- 1 Introduction -- 2 Recycling Valid Inequalities -- 3 Facet-Defining Recycled Inequalities -- 4 Computational Study -- 4.1 Robust Independent Set -- 4.2 Robust Bipartite Matching -- 5 Conclusion -- References -- Inapproximability of Shortest Paths on Perfect Matching Polytopes -- 1 Introduction -- 1.1 Our Result -- 1.2 Pivot Rules for Circuit-Augmentation Algorithms -- 1.3 Related Works -- 2 Proof of Theorem 1.
2.1 Preliminaries -- 2.2 Reduction -- 2.3 Proof of Lemma 3 -- References -- Monoidal Strengthening and Unique Lifting in MIQCPs -- 1 Introduction -- 2 Monoidal Strengthening in the Homogeneous Case -- 3 Monoidal Strengthening in the Non-homogeneous Case -- 3.1 A Technical Consideration for Sg -- 3.2 Monoid Construction -- 4 Solving the Monoidal Strengthening Problem -- 5 Unique Lifting -- 6 Computational Results -- References -- From Approximate to Exact Integer Programming -- 1 Introduction -- 1.1 Contributions of This Paper -- 1.2 Related Work -- 2 Preliminaries -- 3 The Cut-Or-Average Algorithm -- 3.1 Bounding the Number of Iterations -- 3.2 Correctness and Efficiency of Subroutines -- 3.3 Conclusion on the Cut-Or-Average Algorithm -- 4 An Asymmetric Approximate Carathéodory Theorem -- 5 IPs with Polynomial Variable Range -- References -- Optimizing Low Dimensional Functions over the Integers -- 1 Introduction -- 1.1 Applications -- 1.2 Overview of Techniques -- 2 Non-negative Variables -- 3 Bounded Variables -- 4 Overview of Hunkenschröder Et Al. ch9hunkenschroder2022optimizing and Related Improvements -- 5 Conclusion and Open Questions -- References -- Configuration Balancing for Stochastic Requests -- 1 Introduction -- 1.1 Our Results -- 1.2 Technical Overview -- 1.3 Related Work -- 2 Configuration Balancing with Stochastic Requests -- 2.1 Structural Theorem -- 2.2 Offline Setting -- 2.3 Online Setting -- 3 Load Balancing on Related Machines -- References -- An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem -- 1 Introduction -- 2 Preliminaries -- 2.1 Optimal Solutions and Proximity -- 2.2 The Centroid Mapping -- 3 The Update-and-Stabilize Framework -- 4 Analysis -- 5 Computational Experiments -- References -- Stabilization of Capacitated Matching Games -- 1 Introduction -- 2 Preliminaries and Notation -- 3 M-vertex-stabilizer. 4 Vertex-Stabilizer -- 5 Capacitated Cooperative Matching Games -- References -- Designing Optimization Problems with Diverse Solutions -- 1 Introduction -- 2 Statement of Main Results -- 2.1 The Cyclic Polytope -- 2.2 Results and Techniques -- 3 Preliminaries -- 4 Upper Bound (Proof of Theorem 1) -- 5 General Lower Bound (Proof of Theorem 2) -- 5.1 Construction Based on Moment Curve -- 5.2 Dual Certificate for Loadouts -- 5.3 Counting the Number of k-Loadouts -- 6 Conclusion -- References -- ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation -- 1 Introduction -- 1.1 Our Main Results -- 1.2 Discussion of the Results -- 1.3 Further Related Work -- 2 Algorithms and Proof Overview -- References -- On the Correlation Gap of Matroids -- 1 Introduction -- 1.1 Our Techniques -- 2 Preliminaries -- 3 Locating the Correlation Gap -- 4 Lower Bounding the Correlation Gap -- 4.1 Lower Bounding G(x*) -- 4.2 Lower Bounding H(x*) -- 4.3 Putting Everything Together -- References -- A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP -- 1 Introduction -- 2 Preliminaries -- 3 Proof of Theorem 1 -- 4 Conclusion and Open Questions -- References -- The Polyhedral Geometry of Truthful Auctions -- 1 Introduction -- 2 Preliminaries -- 3 Characterization of One-Player Mechanisms -- 4 Sensitivity of Mechanisms -- 5 Conclusion -- References -- Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling -- 1 Introduction -- 2 Preliminaries -- 3 Lower Bound -- 4 The b-scaling Strategy -- 4.1 The Deterministic b-scaling Strategy -- 4.2 The Randomized b-scaling Strategy -- 5 Weighted Shortest Elapsed Time First -- 6 Upper Bounds for More General Settings -- 7 Conclusion -- References -- A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP -- 1 Introduction -- 1.1 High Level Proof Overview. 2 Preliminaries -- 2.1 Notation -- 2.2 Randomized Algorithm of ch19KKO21a -- 2.3 Polyhedral Background -- 3 Computing Probabilities -- 3.1 Notation -- 3.2 Matrix Tree Theorem -- 3.3 Computing Parities in a Simple Case -- 4 A Deterministic Algorithm in the Degree Cut Case -- 5 General Case -- References -- Monoidal Strengthening of Simple V-Polyhedral Disjunctive Cuts -- 1 Introduction -- 2 Notation and Background -- 3 Correspondence Between PRLP and CGLP Solutions -- 3.1 Simple VPCs -- 3.2 Relaxations Without Primal Degeneracy -- 3.3 Relaxations with Primal Degeneracy -- 4 Computational Experiments -- 5 Choosing a Relaxation Amenable to Strengthening -- 6 Conclusion -- References -- Optimal General Factor Problem and Jump System Intersection -- 1 Introduction -- 1.1 General Factor Problem -- 1.2 Jump System Intersection -- 1.3 Our Contribution: Jump System with SBO Property -- 1.4 Organization -- 2 Preliminaries -- 3 Algorithm and Correctness -- 4 Outline of the Proof of Lemma 1 -- 4.1 Minimal Counterexample -- 4.2 Part of Case Analysis: |U|=3 -- 5 Extension to Valuated Problem -- 6 Weighted Optimal General Factor Problem -- 7 Concluding Remarks -- References -- Decomposition of Probability Marginals for Security Games in Abstract Networks -- 1 Introduction -- 1.1 Motivation -- 1.2 Abstract Networks -- 1.3 Previous Results -- 1.4 Our Results -- 1.5 Notation -- 2 Feasible Decompositions in Abstract Networks -- 3 Computing Feasible Decompositions -- 4 Computing Shortest Paths in Abstract Networks -- 5 Dahan et al.'s Network Security Game -- 6 The Conservation Law for Partially Ordered Sets -- 7 Other Set Systems -- References -- Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques -- 1 Introduction -- 2 Algorithmic Framework -- 2.1 Offline Problems and Hardness of Approximation -- 2.2 Algorithmic Framework. 3 MinSet with Deterministic Right-Hand Sides -- 4 MinSet Under Uncertainty -- 5 Disjoint MinSet -- References -- Towards a Characterization of Maximal Quadratic-Free Sets -- 1 Introduction -- 1.1 Contributions -- 2 Examples of Maximal Homogeneous Quadratic-Free Sets -- 3 A Proof of Theorem 5 -- 4 A Proof of Theorem 1 -- 5 A Proof of Theorem 2 -- 6 Preliminary Results on Non-expansive Functions -- 7 A Proof of Theorem 3 -- 8 A Proof of Theorem 4 -- References -- Compressing Branch-and-Bound Trees -- 1 Introduction -- 2 The Tree Compression Problem (TCP) -- 3 Complexity Results and Lower Bounds -- 4 Compression Algorithms -- 4.1 An Exact Method -- 4.2 A Heuristic Method -- 5 Computational Experiments -- 5.1 Methodology -- 5.2 Full Strong Branching Results -- 5.3 Reliability Branching with Plunging -- 6 Future Work -- References -- Exploiting the Polyhedral Geometry of Stochastic Linear Bilevel Programming -- 1 Introduction -- 1.1 Problem Formulation and Contributions -- 2 Preliminaries -- 3 Vertex-Supported Beliefs and Bayesian Formulation -- 3.1 Sample Average Formulation -- 4 Geometrical Structure of Vertex-Supported Beliefs -- 5 Algorithms -- 5.1 Enumeration Algorithm -- 5.2 Monte-Carlo Approximation Scheme -- 6 Numerical Experiments -- References -- Towards an Optimal Contention Resolution Scheme for Matchings -- 1 Introduction -- 1.1 Our Results -- 1.2 Our Techniques -- 2 An Optimal CRS When "026B30D x"026B30D 0 -- 2.1 The Karp-Sipser Algorithm -- 2.2 Random Trees -- 2.3 The Karp-Sipser Algorithm on Trees -- 2.4 Putting It Together -- 3 Improved CRSs for Bipartite Matchings -- 3.1 A 0.480-Balanced Scheme for Bipartite Matchings -- 3.2 A 0.509-Balanced Scheme for Bipartite Matchings -- References -- Advances on Strictly -Modular IPs -- 1 Introduction -- 1.1 Group-Constrained Problems and Proof Strategy for Theorem 1 -- 1.2 Further Related Work. 1.3 Structure of the Paper. |
Record Nr. | UNINA-9910726288203321 |
Del Pia Alberto | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Machine Intelligence Techniques for Data Analysis and Signal Processing [[electronic resource] ] : Proceedings of the 4th International Conference MISP 2022, Volume 1 / / edited by Dilip Singh Sisodia, Lalit Garg, Ram Bilas Pachori, M. Tanveer |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (879 pages) |
Disciplina | 780 |
Collana | Lecture Notes in Electrical Engineering |
Soggetto topico |
Computational intelligence
Artificial intelligence Application software Computational Intelligence Artificial Intelligence Computer and Information Systems Applications |
Soggetto non controllato |
Artificial Intelligence
Engineering Computers Technology & Engineering |
ISBN | 981-9900-85-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | On Diverse and Serendipitous item Recommendation: A Reinforced Similarity and Multi-Objective Optimization based Composite Recommendation Framework -- Comparative Analysis of Node Dependent and Node Independent Graph Matrices for Brain Connectivity -- Facial Expression Recognition from low resolution facial segments using Pre-trained networks -- Design and Analysis of Quad Element UWB MIMO Antenna with Mutual Coupling Reduction Techniques -- Enhancing Agriculture Outcome with Multiple Crop Recommendations Using Sequential Forword Feature Selection -- Kernel Level Pruning for CNN. |
Record Nr. | UNINA-9910728400003321 |
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Machine Learning and Computational Intelligence Techniques for Data Engineering [[electronic resource] ] : Proceedings of the 4th International Conference MISP 2022, Volume 2 / / edited by Pradeep Singh, Deepak Singh, Vivek Tiwari, Sanjay Misra |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (885 pages) |
Disciplina | 780 |
Collana | Lecture Notes in Electrical Engineering |
Soggetto topico |
Computational intelligence
Artificial intelligence Application software Computational Intelligence Artificial Intelligence Computer and Information Systems Applications |
Soggetto non controllato |
Artificial Intelligence
Engineering Computers Technology & Engineering |
ISBN |
9789819900473
9789819900466 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Contents -- About the Editors -- A Review on Rainfall Prediction Using Neural Networks -- 1 Introduction -- 2 Literature Survey -- 3 Theoretical Analysis of Survey and Discussion -- 4 Conclusions -- References -- Identifying the Impact of Crime in Indian Jail Prison Strength with Statical Measures -- 1 Introduction -- 2 Related Work -- 3 Methods and Materials -- 3.1 Dataset -- 3.2 Experimental Work -- 3.3 Correlation Coefficient Between Two Random Variables -- 4 Result and Discussion -- 5 Conclusion -- References -- Visual Question Answering Using Convolutional and Recurrent Neural Networks -- 1 Introduction -- 2 Literature Survey -- 3 Dataset Description -- 4 Proposed Method -- 4.1 Experiment 1 -- 4.2 Experiment 2 -- 5 Results and Analysis -- 5.1 Experiment 1 -- 5.2 Experiment 2 -- 6 Conclusion -- References -- Brain Tumor Segmentation Using Deep Neural Networks: A Comparative Study -- 1 Introduction -- 2 Methodology -- 2.1 2-Path Convolutional Neural Network -- 2.2 Cascaded Architecture -- 2.3 U-Net -- 3 Empirical Studies -- 3.1 Dataset -- 3.2 Experiment Setup -- 3.3 Data Preprocessing -- 3.4 Performance Evaluation Metrics -- 4 Visualization and Result Analysis -- 4.1 Cascaded CNN -- 4.2 U-Net -- 5 Conclusions -- References -- Predicting Bangladesh Life Expectancy Using Multiple Depend Features and Regression Models -- 1 Introduction -- 2 Literature Review -- 3 Proposed Methodology -- 3.1 Data Preprocessing -- 3.2 Regressor Relevant Theory -- 3.3 Preformation Calculation -- 4 Results and Discussions -- 5 Conclusion and Future Work -- References -- A Data-Driven Approach to Forecasting Bangladesh Next-Generation Economy -- 1 Introduction -- 2 Literature Review -- 3 Methodology -- 4 Analysis and Results -- 5 Conclusion and Future Work -- References -- A Cross Dataset Approach for Noisy Speech Identification -- 1 Introduction.
2 Problem Statement -- 3 Prior Work -- 4 Experimental Setup -- 4.1 Phoneme Detection rate -- 4.2 Softmax Probability of Clean Speech and Noisy Speech -- 4.3 Utterance Level Scoring -- 5 Results -- 6 Conclusion and Future Work -- References -- A Robust Distributed Clustered Fault-Tolerant Scheduling for Wireless Sensor Networks (RDCFT) -- 1 Introduction -- 2 Literature Review -- 2.1 Classification of Fault Levels -- 2.2 Redundancy Based Fault Tolerance in WSNs -- 3 Proposed Work -- 3.1 Network Model, Preliminaries, and Assumptions -- 3.2 Fault Detection and Recovery -- 3.3 Redundancy Check and Clustering in WSNs -- 3.4 Selection of Cluster Head -- 3.5 Algorithm Phase: Distributed Clustered Fault-Tolerant Scheduling -- 3.6 Simulation Setup and Results -- 4 Conclusion and Future Remarks -- References -- Audio Scene Classification Based on Topic Modelling and Audio Events Using LDA and LSA -- 1 Introduction -- 2 Related Work -- 3 LSA and LDA -- 3.1 Latent Semantic Analysis (LSA) -- 3.2 Latent Dirichlet Allocation (LDA) -- 4 Framework of the Proposed Work -- 4.1 Input Vocabulary Creation -- 4.2 Event Term Cooccurrence Matrix -- 4.3 Output Generation -- 5 Experimental Results -- 6 Conclusion and Future Enhancement -- References -- Diagnosis of Brain Tumor Using Light Weight Deep Learning Model with Fine Tuning Approach -- 1 Introduction -- 2 Motivation -- 3 Literature Review -- 4 Research Gap -- 5 Our Contribution -- 6 Characteristics improved using our Brain Tumor Analysis Model -- 6.1 Light Weight -- 6.2 Reliability -- 6.3 Time Efficiency -- 7 Dataset -- 8 Deep Learning Based Brain Tumor Diagnosis Using Yolov5 -- 8.1 Yolov5 -- 9 Proposed Model -- 10 Conclusion -- References -- Comparative Study of Loss Functions for Imbalanced Dataset of Online Reviews -- 1 Introduction -- 2 Literature Review -- 3 Loss Functions -- 3.1 Cross-Entropy Loss. 3.2 Focal Loss -- 4 Dataset -- 5 Methodology -- 6 Training and Classification -- 7 Results -- 8 Conclusion -- References -- A Hybrid Approach for Missing Data Imputation in Gene Expression Dataset Using Extra Tree Regressor and a Genetic Algorithm -- 1 Introduction -- 2 Literature Survey -- 3 About Genetic Algorithm, K-Means, and Extra Tree Regression -- 3.1 Genetic Algorithm -- 3.2 K-Means Algorithm -- 3.3 Extra Tree Regression -- 4 About Dataset -- 5 Proposed Model -- 5.1 Experimental Implementation -- 6 Performance Analysis -- 7 Experimental Results -- 8 Conclusion and Future Work -- References -- A Clustering and TOPSIS-Based Developer Ranking Model for Decision-Making in Software Bug Triaging -- 1 Introduction -- 2 Motivation -- 3 Related Work -- 4 Methodology -- 5 Illustrative Example: A Case Study -- 6 Threats to Validity -- 7 Conclusion and Future Scope -- References -- GujAGra: An Acyclic Graph to Unify Semantic Knowledge, Antonyms, and Gujarati-English Translation of Input Text -- 1 Introduction -- 2 Gujarati Language -- 3 Literature Review -- 4 Software Description -- 4.1 Software Architecture -- 5 Proposed Algorithm -- 6 Experiment and Result -- 7 Conclusion -- References -- Attribute-Based Encryption Techniques: A Review Study on Secure Access to Cloud System -- 1 Introduction -- 2 Background of the Review Study -- 3 Review Study -- 4 Review Summary -- 5 Conclusion -- References -- Fall Detection and Elderly Monitoring System Using the CNN -- 1 Introduction -- 2 Related Work -- 3 Proposed Method -- 3.1 ADLs and Falls Comparison -- 3.2 The Visualization of the Bitmap Generation -- 3.3 CNN Model -- 4 Experimental Results and Analysis -- 4.1 Fall Detection -- 4.2 Computation Complexity -- 5 Conclusion -- References. Precise Stratification of Gastritis Associated Risk Factors by Handling Outliers with Feature Selection in Multilayer Perceptron Model -- 1 Introduction -- 2 Methods -- 2.1 Data Source -- 2.2 Data Pre-processing -- 2.3 Feature Selection -- 2.4 Learning Curves -- 2.5 Data Modeling -- 2.6 Naive Bayes Bernoulli -- 2.7 Data Package -- 3 Results and Discussion -- 3.1 Original Dataset -- 3.2 Outliers Removed Using Interquartile Range Method -- 3.3 Outliers Removed Using One-Class SVM -- 3.4 Outlier Removed Using Isolation Forest -- 3.5 Outliers Replaced by Median -- 3.6 Outliers Replaced by Median Values + Feature Selection -- 4 Benchmarking Machine Learning Systems -- 5 Risk Factors for Gastritis-Associated H. Pylori -- 6 Conclusion -- References -- Portfolio Selection Using Golden Eagle Optimizer in Bombay Stock Exchange -- 1 Introduction -- 2 Related Work -- 3 The Problem Statement -- 4 Proposed Strategy -- 4.1 Attack (Exploitation) -- 4.2 Cruise (Exploration) -- 5 Experimental Results -- 6 Conclusion -- References -- Hybrid Moth Search and Dragonfly Algorithm for Energy-Efficient 5G Networks -- 1 Introduction -- 2 Literature Review -- 3 Methodology -- 3.1 Delay-Bounded QoS Provisioning -- 3.2 EPE Under QoS Provisioning -- 3.3 Optimal Power Allocation Via MS-DA Model -- 4 Results and Discussions -- 5 Conclusions -- References -- Automatic Cataract Detection Using Ensemble Model -- 1 Introduction -- 2 Literature Survey -- 3 Materials and Methods -- 3.1 Methodology -- 3.2 Dataset -- 3.3 Proposed Designed -- 4 Experiments and Results -- 4.1 First model -- 4.2 Second Model -- 4.3 Third Model -- 4.4 Ensemble Model -- 5 Comparative Study -- 6 Conclusion and Future Scope -- References -- Nepali Voice-Based Gender Classification Using MFCC and GMM -- 1 Introduction -- 2 Literature Review -- 3 Methodology -- 3.1 Data Collection -- 3.2 Data Processing. 3.3 Feature Extraction -- 3.4 Model Training -- 4 Experiments and Results -- 5 Conclusion -- References -- Analysis of Convolutional Neural Network Architectures for the Classification of Lung and Colon Cancer -- 1 Introduction -- 2 Related Works -- 3 Proposed Work -- 3.1 Image Acquisition and Preprocessing -- 3.2 Feature Extraction -- 3.3 Classification -- 3.4 Inception-ResNet V2 -- 4 Experimental Setup -- 5 Experimented Results -- 6 Conclusion -- References -- Wireless String: Machine Learning-Based Estimation of Distance Between Two Bluetooth Devices -- 1 Introduction -- 2 Related Works -- 3 Distance Estimation Between Bluetooth Devices as a Regression Problem -- 3.1 Generating the Dataset -- 3.2 Regression -- 4 Performance Evaluation -- 4.1 Comparison Using Separate Datasets -- 4.2 Comparison Using Combined Dataset -- 5 Conclusions -- References -- Function Characterization of Unknown Protein Sequences Using One Hot Encoding and Convolutional Neural Network Based Model -- 1 Introduction -- 2 Related Work -- 3 Methodology -- 3.1 Protein Dataset -- 3.2 Preprocessing -- 3.3 Prediction Using Convolutional Neural Network -- 3.4 Performance Measures -- 4 Results and Discussion -- 4.1 Results -- 4.2 Discussion -- 5 Conclusion -- References -- Prediction of Dementia Using Whale Optimization Algorithm Based Convolutional Neural Network -- 1 Introduction -- 2 Related Work -- 3 Proposed WOA Based CNN -- 4 Experimental Results -- 4.1 Comparison of Accuracy for Various Values of Dropout Rate and Mini Batch Size -- 4.2 Comparison of Accuracy -- 4.3 Comparison of Loss -- 5 Conclusion -- References -- Goodput Improvement with Low-Latency in Data Center Network -- 1 Introduction -- 2 Related Work -- 3 Enhanced Multipath Transmission Control Protocol -- 3.1 Multipath Transmission Control Protocol (MPTCP) -- 3.2 Packet Sprinkle -- 4 Design of Proposed Protocol. 4.1 Architecture. |
Record Nr. | UNINA-9910725079503321 |
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Proceedings of the International Health Informatics Conference [[electronic resource] ] : IHIC 2022 / / edited by Sarika Jain, Sven Groppe, Nandana Mihindukulasooriya |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (414 pages) |
Disciplina | 780 |
Collana | Lecture Notes in Electrical Engineering |
Soggetto topico |
Application software
Computational intelligence Artificial intelligence Quantitative research Computer and Information Systems Applications Computational Intelligence Artificial Intelligence Data Analysis and Big Data |
Soggetto non controllato |
Engineering
Artificial Intelligence Technology & Engineering Computers |
ISBN |
9789811990908
9789811990892 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Development of Health Care System using Soft Computing Methods -- A Novel Yoga Based Practice Protocol to Quantify Stress after Performing Attention Task using Non-Invasive Techniques -- A Study of Deep Learning Algorithms in Sentiment Analysis of Diverse Domain -- Frequency Allocation in Cognitive Radio Networks -- An IoT Based Advanced Health Monitoring System -- Fault Tolerance in Vehicular Cloud Networks: Link Failure and Malicious Node Detection and Reconfiguration -- Multifilter Enhanced Doctor and Patient Optimization Algorithm for Cancer Diagnosis -- Disease Diagnostic Model using Fine-Tuned Intensive Learning for Medical Image -- Challenges in Digital Health Care- A Hybrid Decision Approach Understanding Key Challenges in India -- Telemedicine and Healthcare Setting for Remote Care of Patients: Status and Future Implications -- Performance Evaluation of ML Models in the Health Care Domain to Classify Liver Disease: A Case Study. |
Record Nr. | UNINA-9910726278403321 |
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Proceedings of the International Health Informatics Conference [[electronic resource] ] : IHIC 2022 / / edited by Sarika Jain, Sven Groppe, Nandana Mihindukulasooriya |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (414 pages) |
Disciplina | 780 |
Collana | Lecture Notes in Electrical Engineering |
Soggetto topico |
Application software
Computational intelligence Artificial intelligence Quantitative research Computer and Information Systems Applications Computational Intelligence Artificial Intelligence Data Analysis and Big Data |
Soggetto non controllato |
Engineering
Artificial Intelligence Technology & Engineering Computers |
ISBN |
9789811990908
9789811990892 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Development of Health Care System using Soft Computing Methods -- A Novel Yoga Based Practice Protocol to Quantify Stress after Performing Attention Task using Non-Invasive Techniques -- A Study of Deep Learning Algorithms in Sentiment Analysis of Diverse Domain -- Frequency Allocation in Cognitive Radio Networks -- An IoT Based Advanced Health Monitoring System -- Fault Tolerance in Vehicular Cloud Networks: Link Failure and Malicious Node Detection and Reconfiguration -- Multifilter Enhanced Doctor and Patient Optimization Algorithm for Cancer Diagnosis -- Disease Diagnostic Model using Fine-Tuned Intensive Learning for Medical Image -- Challenges in Digital Health Care- A Hybrid Decision Approach Understanding Key Challenges in India -- Telemedicine and Healthcare Setting for Remote Care of Patients: Status and Future Implications -- Performance Evaluation of ML Models in the Health Care Domain to Classify Liver Disease: A Case Study. |
Record Nr. | UNISA-996547966903316 |
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Real-time and Autonomous Systems 2022 [[electronic resource] ] : Automation in Everyday Life / / edited by Herwig Unger, Marcel Schaible |
Autore | Unger Herwig |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (239 pages) |
Disciplina | 629.89 |
Altri autori (Persone) | SchaibleMarcel |
Collana | Lecture Notes in Networks and Systems |
Soggetto topico |
Engineering—Data processing
Application software Computational intelligence Data Engineering Computer and Information Systems Applications Computational Intelligence |
Soggetto non controllato |
Mechanical Engineering
Technology & Engineering |
ISBN |
9783031327001
9783031326998 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The Real-Time Systems Archive -- Deadlock detection in OpenPEARL -- Taking Real-Time and Virtualization to Open Source Hardware -- Industrie 4.0-Compliant Digital Twins Boosting Machine Servitization -- MBSE for SMEs with Domain-Specific Safety Analyses and Loose Tool Coupling -- Live GNSS Tracking of Search and Rescue Dogs with LoRa -- Authentication in P2P Environment based on multi dimensional administration Graph -- Reduction of Overhead for Protocols with Remote Memory Properties. |
Record Nr. | UNINA-9910725082803321 |
Unger Herwig | ||
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Robotics, Control and Computer Vision [[electronic resource] ] : Select Proceedings of ICRCCV 2022 / / edited by Hariharan Muthusamy, János Botzheim, Richi Nayak |
Autore | Muthusamy Hariharan |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (600 pages) |
Disciplina | 629.892 |
Altri autori (Persone) |
BotzheimJános
NayakRichi |
Collana | Lecture Notes in Electrical Engineering |
Soggetto topico |
Control engineering
Robotics Automation Computer vision Application software Control, Robotics, Automation Computer Vision Computer and Information Systems Applications |
Soggetto non controllato |
Computer Graphics
Automation Computers Technology & Engineering |
ISBN | 981-9902-36-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Chapter 1: Challenges and Opportunity for Salient Object Detection in COVID-19 Era: A Study -- Chapter 2: Multi-agent Task Assignment Using Swap-Based Particle Swarm Optimization for Surveillance and Disaster Management -- Chapter 3: Facemask Detection and Maintaining Safe Distance Using AI and ML to Prevent COVID-19—A Study. |
Record Nr. | UNINA-9910728392203321 |
Muthusamy Hariharan | ||
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|