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.
CGI : developer's guide / Eugene Eric Kim
| CGI : developer's guide / Eugene Eric Kim |
| Autore | Kim, Eugene Eric |
| Edizione | [1st ed] |
| Pubbl/distr/stampa | Indianapolis, Ind. : Sams.net, c1996 |
| Descrizione fisica | xi, 497 p. : ill. ; 23 cm + 1 computer laser optical disc (4 3/4 in.) |
| Disciplina | 005.11 |
| Collana | Sams developer's guide |
| Soggetto topico |
CGI |
| ISBN | 1575210878 |
| Classificazione |
AMS 68N15
CR D.3.2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | en |
| Record Nr. | UNISALENTO-991000738469707536 |
Kim, Eugene Eric
|
||
| Indianapolis, Ind. : Sams.net, c1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
CGI programming on the World Wide Web / Shishir Gundavaran
| CGI programming on the World Wide Web / Shishir Gundavaran |
| Autore | Gundavaran, Shishir |
| Edizione | [1st ed] |
| Pubbl/distr/stampa | Bonn : O'Reilly & Associates, 1996 |
| Descrizione fisica | xiv, 433 p. : ill. ; 24 cm. |
| Disciplina | 005.11 |
| Collana | A Nutshell handbook |
| Soggetto topico |
CGI Perl (Computer program language) Programming languages World Wide Web servers-computer programs |
| ISBN | 1565921682 |
| Classificazione |
AMS 68N15
CR D.3.2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | en |
| Record Nr. | UNISALENTO-991000738619707536 |
|
Gundavaran, Shishir
|
||
| Bonn : O'Reilly & Associates, 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
CI/CD pipeline using Jenkins Unleashed : solutions while setting up CI/CD processes / / Pranoday Pramod Dingare
| CI/CD pipeline using Jenkins Unleashed : solutions while setting up CI/CD processes / / Pranoday Pramod Dingare |
| Autore | Dingare Pranoday Pramod |
| Pubbl/distr/stampa | Berkeley, California : , : Apress, , [2022] |
| Descrizione fisica | 1 online resource (432 pages) |
| Disciplina | 005.11 |
| Soggetto topico |
Open source software
Computer software - Development |
| ISBN | 1-4842-7508-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1: Understanding CI/CD Chapter 2: Introduction to Jenkins Chapter 3: Installing Jenkins Chapter 4: Configuring Jenkins Chapter 5:Understanding Global Tool Configuration Chapter 6: Managing Plugins Chapter 7: Managing Security with Jenkins Chapter 8: Managing Credentials Chapter 9: Managing Users Chapter 10: Understanding Jobs in Jenkins Chapter 11: Preparing Java API Project Chapter 12: Creating Freestyle Job to Manage Java API Project Chapter 13: Creating an Auto-trigger Free Style Job to Manage JAVA API Releases Chapter 14: Creating a Pipeline Job Chapter 15: Creating a Pipeline Job to Manage Web Application Project Chapter 16: Triggering Pipeline as Code from GitLab Chapter 17: Understanding Distributed Pipelines Chapter 18: Integrating Jenkins with AWS Chapter 19: Miscellaneous Topics Part 1 Chapter 20: Miscellaneous Topics Part 2 |
| Record Nr. | UNINA-9910584483003321 |
|
Dingare Pranoday Pramod
|
||
| Berkeley, California : , : Apress, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The Coder's Path to Wealth and Independence [[electronic resource] /] / by Mark Beckner
| The Coder's Path to Wealth and Independence [[electronic resource] /] / by Mark Beckner |
| Autore | Beckner Mark |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berkeley, CA : , : Apress : , : Imprint : Apress, , 2014 |
| Descrizione fisica | 1 online resource (234 p.) |
| Disciplina | 005.11 |
| Soggetto topico |
Success in business
Computer programmers |
| Soggetto non controllato |
computerwetenschappen
computer sciences programmeren programming software engineering operating systems Information and Communication Technology (General) Informatie- en communicatietechnologie (algemeen) |
| ISBN | 1-4842-0421-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Foreword; About the Author; Acknowledgments; Introduction; Roadmap to Content; Chapter 1: Travel; From Rest to Motion; The Two Types of Business Travel; Critical Business Travel; Noncritical Business Travel; Redefining the Rules; Seven Techniques to Avoid Unnecessary Travel; A Word on Staying in Motion Mentally; Nine Essential Rules for Travel; Conclusion; Chapter 2: Skills; The Nature of Programming; Programming Skills; Beyond Programming; The Nature of Business; Factors for Success; A Word on Luck and Chance; From Programmer to Entrepreneur; Conclusion.
Chapter 3: Discipline and EducationDiscipline; Eleven Steps for Professional Discipline; Six Activities for Mental Discipline; Types of Education; Traditional Education; Professional Education; Personal Education; Reading; Mentorships; A Word on Education; Conclusion; Chapter 4: Ethics; The Transitory Nature of Morality; Fundamental Ethics of Behavior; The Ethics of Business; The Ethics of Coding; Coding for the Next Generation; Focusing on Project and Client Priorities; Delivering the Best Possible Solution; Being a Strong Communicator; Dealing with Unethical People; Conclusion. Chapter 5: Structuring Your BusinessProtecting Yourself; Business Structure Options; Creating the Business; Taxes; Payroll; Insurance; Professional Insurance; Personal Insurance; Infrastructure; Retirement Planning; Conclusion; Chapter 6: Advertising and Marketing; Publishing; Ten Steps to Publishing a Book; Step 1: Select Several Topics; Step 2: Create the Title and Summary; Step 3: Contact a Publisher; Step 4: Submit Your Proposal; Step 5: Finalize Your Proposal; Step 6: Receive a Contract; Step 7: Write; Step 8: Respond to Edits; Step 9: Compile "Front Matter" Material; Biography. IntroductionForeword; Step 10: Prepare to Reach Out; Publishing an Article; Utilizing Your Published Material; Offer It to Known Contacts; Use It to Solidify Introductions; Use It to Open Conversations with New Contacts; Use It to Sell Your Services; Your Web Presence; Additional Collateral; A Word on Branding; Conclusion; Chapter 7: Sales; Networking; The Importance of Partnerships; Prospecting and Finding New Work; Converting Prospects to Sales; Six Steps to Close a Sale; Pricing Strategies; The Sales Plateau; Balancing Sales with Delivery; Conclusion; Chapter 8: Proposals and Contracts. The Proposal ProcessThe Contract Process; How to Write a Contract; Hourly Contracts; Retainer Contracts; Sample Fixed-Fee Contract; Invoicing; Payment Strategies; Conclusion; Chapter 9: Fees and Income; Get Comfortable with Money; Take Every Opportunity: Multiple Revenue Streams; Five Techniques for Delivering on Multiple Projects; Create Appropriate Fee Structures; Hourly Fees; Fixed Fees; Retainer-Based Fees; Determine Appropriate Fees; Define Your Goals for Income; Conclusion; Chapter 10: Goal Setting; Types of Goals; Business Goals; Personal Goals; How to Define and Execute on Goals. |
| Record Nr. | UNINA-9910300659903321 |
|
Beckner Mark
|
||
| Berkeley, CA : , : Apress : , : Imprint : Apress, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings / / edited by Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos
| Combinatorial Optimization and Applications [[electronic resource] ] : Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings / / edited by Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIII, 542 p.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer networks Software engineering Algorithms Computer science—Mathematics Discrete mathematics Programming Techniques Computer Communication Networks Software Engineering Discrete Mathematics in Computer Science |
| ISBN | 3-642-02026-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms for Network Design -- Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision -- A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices -- A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines -- A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs -- Bioinformatics -- DNA Library Screening, Pooling Design and Unitary Spaces -- Improved Algorithms for the Gene Team Problem -- Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting -- Combinatorics and Its Applications -- Generalized Russian Cards Problem -- Computing the Transitive Closure of a Union of Affine Integer Tuple Relations -- Matching Techniques Ride to Rescue OLED Displays -- Computational Geometry -- On Open Rectangle-of-Influence Drawings of Planar Graphs -- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems -- Variable-Size Rectangle Covering -- On-Line Multiple-Strip Packing -- Game Theory -- A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game -- Improved Bounds for Facility Location Games with Fair Cost Allocation -- Graph Algorithms -- Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem -- On Construction of Almost-Ramanujan Graphs -- A 2log2(n)-Approximation Algorithm for Directed Tour Cover -- Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation -- Graph Theory -- Hamiltonian Decomposition of Some Interconnection Networks -- Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge -- A Note on Edge Choosability and Degeneracy of Planar Graphs -- A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices -- On Integrity of Harary Graphs -- A Note on n-Critical Bipartite Graphs and Its Application -- Network Models and Problems -- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem -- Deterministically Estimating Data Stream Frequencies -- Positive Influence Dominating Set in Online Social Networks -- On-line Algorithms -- Optimal Algorithms for the Online Time Series Search Problem -- A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information -- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine -- A Note on Online Scheduling for Jobs with Arbitrary Release Times -- Size-Problems -- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem -- On Disjoint Shortest Paths Routing on the Hypercube -- A New Approach for Rearrangeable Multicast Switching Networks -- Scheduling -- Bicriteria Scheduling on Single-Machine with Inventory Operations -- Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine -- Scheduling with Rejection to Minimize the Makespan -- Scheduling Problems in Cross Docking -- Makespan Minimization with Machine Availability Constraints -- A Mathematical Programming Approach for Online Hierarchical Scheduling -- Recoverable Robust Timetables on Trees -- Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems -- Integrated Production and Delivery Scheduling with Disjoint Windows -- Wireless and Optical Networks -- Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks -- A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks -- Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas -- Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings -- An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings. |
| Record Nr. | UNISA-996465526903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings / / edited by Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos
| Combinatorial Optimization and Applications [[electronic resource] ] : Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings / / edited by Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIII, 542 p.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer networks Software engineering Algorithms Computer science—Mathematics Discrete mathematics Programming Techniques Computer Communication Networks Software Engineering Discrete Mathematics in Computer Science |
| ISBN | 3-642-02026-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms for Network Design -- Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision -- A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices -- A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines -- A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs -- Bioinformatics -- DNA Library Screening, Pooling Design and Unitary Spaces -- Improved Algorithms for the Gene Team Problem -- Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting -- Combinatorics and Its Applications -- Generalized Russian Cards Problem -- Computing the Transitive Closure of a Union of Affine Integer Tuple Relations -- Matching Techniques Ride to Rescue OLED Displays -- Computational Geometry -- On Open Rectangle-of-Influence Drawings of Planar Graphs -- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems -- Variable-Size Rectangle Covering -- On-Line Multiple-Strip Packing -- Game Theory -- A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game -- Improved Bounds for Facility Location Games with Fair Cost Allocation -- Graph Algorithms -- Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem -- On Construction of Almost-Ramanujan Graphs -- A 2log2(n)-Approximation Algorithm for Directed Tour Cover -- Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation -- Graph Theory -- Hamiltonian Decomposition of Some Interconnection Networks -- Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge -- A Note on Edge Choosability and Degeneracy of Planar Graphs -- A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices -- On Integrity of Harary Graphs -- A Note on n-Critical Bipartite Graphs and Its Application -- Network Models and Problems -- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem -- Deterministically Estimating Data Stream Frequencies -- Positive Influence Dominating Set in Online Social Networks -- On-line Algorithms -- Optimal Algorithms for the Online Time Series Search Problem -- A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information -- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine -- A Note on Online Scheduling for Jobs with Arbitrary Release Times -- Size-Problems -- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem -- On Disjoint Shortest Paths Routing on the Hypercube -- A New Approach for Rearrangeable Multicast Switching Networks -- Scheduling -- Bicriteria Scheduling on Single-Machine with Inventory Operations -- Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine -- Scheduling with Rejection to Minimize the Makespan -- Scheduling Problems in Cross Docking -- Makespan Minimization with Machine Availability Constraints -- A Mathematical Programming Approach for Online Hierarchical Scheduling -- Recoverable Robust Timetables on Trees -- Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems -- Integrated Production and Delivery Scheduling with Disjoint Windows -- Wireless and Optical Networks -- Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks -- A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks -- Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas -- Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings -- An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings. |
| Record Nr. | UNINA-9910483868103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinators and Functional Programming Languages [[electronic resource] ] : Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985. Proceedings / / edited by Guy Cousineau, Pierre-Louis Curien, Bernard Robinet
| Combinators and Functional Programming Languages [[electronic resource] ] : Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985. Proceedings / / edited by Guy Cousineau, Pierre-Louis Curien, Bernard Robinet |
| Edizione | [1st ed. 1986.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 |
| Descrizione fisica | 1 online resource (VIII, 212 p.) |
| Disciplina | 005.11 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Computer logic Programming Techniques Computation by Abstract Devices Logics and Meanings of Programs |
| ISBN | 3-540-47253-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Streams are not dreams -- Amber -- The amber machine -- Sur l'analogie entre les propositions et les types -- Combinateurs Catégoriques et Implémentation des Langages Fonctionnels -- Combinators and lambda-calculus, a short outline -- Cartesian closed categories and lambda-calculus -- Cartesian closed categories and typed ?-calculi -- An introduction to fully-lazy supercombinators. |
| Record Nr. | UNISA-996465684203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Composability, Comprehensibility and Correctness of Working Software [[electronic resource] ] : 8th Summer School, CEFP 2019, Budapest, Hungary, June 17–21, 2019, Revised Selected Papers / / edited by Zoltán Porkoláb, Viktória Zsók
| Composability, Comprehensibility and Correctness of Working Software [[electronic resource] ] : 8th Summer School, CEFP 2019, Budapest, Hungary, June 17–21, 2019, Revised Selected Papers / / edited by Zoltán Porkoláb, Viktória Zsók |
| Autore | Porkoláb Zoltán |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (398 pages) |
| Disciplina | 005.11 |
| Altri autori (Persone) | ZsókViktória |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Software engineering Compilers (Computer programs) Computer science Programming Techniques Software Engineering Compilers and Interpreters Computer Science Logic and Foundations of Programming |
| ISBN | 3-031-42833-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Main Lectures -- Writing Internet of Things Applications with Task Oriented Programming -- 1 Introduction -- 1.1 Internet of Things -- 1.2 Task Oriented Programming -- 1.3 iTask -- 1.4 TOP for the IoT -- 1.5 Structure of the Paper -- 2 mTask system architecture -- 2.1 Blink -- 2.2 Language -- 2.3 Class Based Shallow Embedding -- 2.4 DSL design -- 2.5 Backends -- 2.6 Bytecode -- 2.7 Skeleton -- 3 mTask language -- 3.1 Expressions -- 3.2 Functions -- 3.3 Basic Tasks -- 3.4 Parallel Task Combinators -- 3.5 Threaded Blinking -- 3.6 Sequential Task Combinators -- 3.7 Shared Data Source -- 3.8 Lifted Shared Data Sources -- 3.9 Interactive Blinking -- 3.10 Peripherals -- 4 IoT applications with TOP -- 4.1 Hardware and Client -- 4.2 Temperature -- 4.3 LED matrix -- 4.4 Temperature Plotter -- 5 Related Work -- 5.1 Interpretation -- 5.2 Task Oriented Programming -- 5.3 Functional Reactive Programming -- 5.4 Functional Programming -- 5.5 Multitasking -- 5.6 mTask history -- 6 Discussion -- A Embedded Domain Specific Language Techniques -- A.1 Deep Embedding -- A.2 Shallow Embedding -- B iTask reference -- B.1 Types -- B.2 Editors -- B.3 Task Combinators -- B.4 Shared Data Sources -- B.5 Extra Task Combinators -- B.6 Examples -- C How to Install -- C.1 Fetch the CEFP distribution -- C.2 Setup -- C.3 Compile the Test Program -- C.4 Setup the Microcontroller Unit -- D Solutions -- References -- Paint Your Programs Green: On the Energy Efficiency of Data Structures -- 1 Introduction -- 2 Data Structures Libraries -- 2.1 Haskell Data Structures -- 2.2 Java Data Structures -- 3 Experimental Setup -- 3.1 Haskell Operations -- 3.2 Java Operations -- 3.3 Measuring Energy Consumption -- 4 Comparing Data Structure Energy Consumption -- 4.1 Haskell Data Structures -- 4.2 Java Data Structures -- 5 Related Work.
6 Conclusions -- References -- Energy Efficient Software in an Engineering Course -- 1 Introduction -- 2 Energy Efficient Software in Higher Education -- 2.1 Sustainable Development and Its Dimentions -- 2.2 Sustainable Development in Higher Education -- 2.3 Energy Efficient Software in Higher Education -- 3 Software Analysis and Testing with a Green Flavor -- 3.1 Green Software: A Multidisciplinary Module -- 3.2 Green Software: Module Objectives -- 3.3 Green Software: Module Supporting Tools -- 4 Energy Efficent Software: Students Assessment -- 4.1 A Catalog of Energy Smells and Refactorings -- 4.2 Students Grades -- 5 Conclusions -- References -- Utilizing Rail Traffic Control Simulator in Verified Software Development Courses -- 1 Introduction -- 2 TD/TS2JC Toolset -- 2.1 Train Director -- 2.2 TS2JavaConn -- 2.3 Communication with Control Modules -- 3 Control Modules and Configuration Files -- 3.1 Non-parametric Module -- 3.2 Parametric Module -- 4 Teaching Verified Software Development in B-Method with TD/TS2JC Toolset -- 4.1 Software Development Process of B-Method -- 4.2 B-Language -- 4.3 Abstract Specification -- 4.4 Refinement to Implementation -- 4.5 Three Sections Control Module Development Project -- 5 Conclusion -- References -- The Role of Functional Programming in Management and Orchestration of Virtualized Network Resources -- 1 Introduction -- 2 Background -- 3 Network Evolution -- 3.1 Cloud Computing Platforms -- 3.2 Network Function Virtalisation and Software Defined Network -- 4 Management and Orchestration of Virtualized Network Resources -- 4.1 Design Principles for Implementing Autonomic Behavior -- 4.2 Current State -- 5 OpenStack -- 5.1 Graphical User Interface for Manipulating Virtual Resources -- 5.2 Authentification and Authorisation Functions -- 5.3 Management of Disk Images -- 5.4 Network Management Functions. 5.5 Management of Virtual Instances -- 5.6 Management of Persistent Memory -- 5.7 Management of Object Storage -- 5.8 Performance Measurement Functions -- 5.9 Orchestration Functions -- 6 Examples -- 6.1 Example 1 -- 6.2 Example 2 -- 6.3 Example 3 -- 6.4 Example 4 -- 7 Use Cases from Industry and Reflection on Design Principles -- 7.1 Virtualisation of Mobile Switching Centre -- 7.2 Management Functions for Reliable and Stable Operation -- 8 Discussion -- 9 Conclusion -- References -- Towards Better Tool Support for Code Comprehension -- 1 Introduction -- 2 Model of Code Comprehension -- 2.1 Top-Down Models -- 2.2 Bottom-Up Models -- 2.3 Other Approaches -- 2.4 The Role of Concept Location -- 3 Nature of the Problems -- 3.1 Growing Complexity -- 3.2 Knowledge Erosion -- 3.3 Multiple Views of the Software Based on Various Information Sources -- 3.4 Communication Barriers -- 3.5 Multiple Programming Languages -- 3.6 Hard to Deploy New Tools -- 3.7 Requirement of Open Extensibility -- 3.8 API Usage -- 4 State of the Art -- 5 The CodeCompass Architecture -- 5.1 Layers of the Architecture -- 5.2 Web User Interface -- 5.3 Language Server Protocol -- 5.4 Performance -- 6 Important Design Workflows -- 6.1 Bug Investigation -- 6.2 Feature Development Planning and Estimation -- 6.3 Refactoring -- 6.4 Knowledge Transfer and Newcomers' Catch-Up -- 7 User Acceptance in Real Production -- 8 Conclusion and Future Work -- References -- Balanced Distributed Computation Patterns -- 1 Introduction -- 2 Go Essentials -- 2.1 Syntax of Basic Language Elements -- 3 Concurrent Programming -- 3.1 Goroutine -- 3.2 WaitGroup -- 3.3 Mutual Exclusion -- 3.4 Channels -- 3.5 Select -- 3.6 Concurrency Principles -- 3.7 Parallelism -- 3.8 Concurrent Job Processing -- 4 Advanced Message Queueing Protocol (AMQP) -- 4.1 AMQP Components -- 4.2 Connection and Channel. 4.3 Safe Message Delivery in Go -- 4.4 Prefetch -- 4.5 AMQP at Network Failures -- 4.6 AMQP Management -- 4.7 AMQP Advantages -- 4.8 AMQP Usage -- 4.9 AMQP 0.9.1 Model -- 4.10 Go RabbitMQ Client Library -- 5 Distributed Programming -- 5.1 RabbitMQ Hello World -- 5.2 RabbitMQ Exchange -- 5.3 RabbitMQ Shared Queue -- 5.4 Parallel Receive -- 5.5 Distributed Job Processing -- 5.6 Distributed Pipeline -- 5.7 Distributed Divide and Conquer -- 6 Testing Performances -- 7 Related Work -- 8 Conclusion -- A Code Listings and Outputs -- A.1 Parallel Receive -- A.2 Distributed Job Processing with Shared Response Queue, Version2 -- A.3 Distributed Job Processing with Private Response Queue, Version3 -- A.4 Distributed Job Processing with Worker Generator, Version4 -- A.5 Distributed Pipeline with Connection Confirmation (Version 2) -- A.6 Distributed Pipeline with Worker Generator (Version 3) -- A.7 Distributed Divide and Conquer -- B Task for Readers -- References -- PhD Workshop -- Tunnel Parsing -- 1 Introduction -- 2 Parsing Overview -- 3 Problem -- 4 Tunnel Parsing Algorithm -- 4.1 Tunnels -- 4.2 Routers -- 4.3 Segments -- 4.4 Control Layer -- 5 Results -- 6 Conclusion -- References -- Finding Code Clone Refactoring Techniques by Mapping Clone Context -- 1 Introduction -- 2 Background and Related Work -- 2.1 Clone Context Analysis -- 2.2 Clone Refactoring -- 3 Context Analysis of Clones -- 3.1 Relation -- 3.2 Location -- 3.3 Contents -- 4 CloneRefactor -- 5 Experimental Setup -- 5.1 The Corpus -- 5.2 Tool Validation -- 6 Results -- 6.1 Relation -- 6.2 Location -- 6.3 Contents -- 7 Discussion -- 8 Conclusion -- References -- Code Quality Metrics for Functional Features in Modern Object-Oriented Languages -- 1 Introduction -- 2 Problem Analysis -- 3 Candidate Measures -- 3.1 Number of Lambda-Functions Used in a Class (LC) -- 3.2 Source Lines of Lambda (SLOL). 3.3 Lambda Score (LSc) -- 3.4 Number of Lambda-Functions Using Mutable Field Variables in a Class (LMFV) -- 3.5 Number of Lambda-Functions Using Mutable Local Variables in a Class (LMLV) -- 3.6 Number of Lambda-Functions with Side-Effects Used in a Class (LSE) -- 3.7 Number of Non-terminated Collection Queries in a Class (UTQ) -- 4 Experimental Setup -- 4.1 Methodology -- 4.2 Relating Functional Constructs to Error-Proneness -- 4.3 Measuring Functional Constructs -- 4.4 Measuring Error-Proneness -- 4.5 Dataset -- 5 Experimental Evaluation -- 6 Threats to Validity -- 7 Related Work -- 8 Conclusion and Discussion -- References -- An Empirical Study on the Energy Efficiency of Matrix Transposition Algorithms -- 1 Introduction -- 2 Related Work -- 2.1 Energy Complexity Model -- 2.2 Empirical Studies on Cache Efficiency -- 2.3 Empirical Studies on Energy Efficiency -- 3 Algorithms for Matrix Transposition -- 4 Methodology and Experimental Setup -- 4.1 Experimental Setup -- 4.2 Performance Counter Measurement Tools -- 4.3 Intermediate Machine Code Generation Tool -- 5 Experimental Analysis -- 6 Conclusion and Future Work -- References -- Author Index. |
| Record Nr. | UNINA-9910754096803321 |
|
Porkoláb Zoltán
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Composability, Comprehensibility and Correctness of Working Software [[electronic resource] ] : 8th Summer School, CEFP 2019, Budapest, Hungary, June 17–21, 2019, Revised Selected Papers / / edited by Zoltán Porkoláb, Viktória Zsók
| Composability, Comprehensibility and Correctness of Working Software [[electronic resource] ] : 8th Summer School, CEFP 2019, Budapest, Hungary, June 17–21, 2019, Revised Selected Papers / / edited by Zoltán Porkoláb, Viktória Zsók |
| Autore | Porkoláb Zoltán |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (398 pages) |
| Disciplina | 005.11 |
| Altri autori (Persone) | ZsókViktória |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Software engineering Compilers (Computer programs) Computer science Programming Techniques Software Engineering Compilers and Interpreters Computer Science Logic and Foundations of Programming |
| ISBN | 3-031-42833-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Main Lectures -- Writing Internet of Things Applications with Task Oriented Programming -- 1 Introduction -- 1.1 Internet of Things -- 1.2 Task Oriented Programming -- 1.3 iTask -- 1.4 TOP for the IoT -- 1.5 Structure of the Paper -- 2 mTask system architecture -- 2.1 Blink -- 2.2 Language -- 2.3 Class Based Shallow Embedding -- 2.4 DSL design -- 2.5 Backends -- 2.6 Bytecode -- 2.7 Skeleton -- 3 mTask language -- 3.1 Expressions -- 3.2 Functions -- 3.3 Basic Tasks -- 3.4 Parallel Task Combinators -- 3.5 Threaded Blinking -- 3.6 Sequential Task Combinators -- 3.7 Shared Data Source -- 3.8 Lifted Shared Data Sources -- 3.9 Interactive Blinking -- 3.10 Peripherals -- 4 IoT applications with TOP -- 4.1 Hardware and Client -- 4.2 Temperature -- 4.3 LED matrix -- 4.4 Temperature Plotter -- 5 Related Work -- 5.1 Interpretation -- 5.2 Task Oriented Programming -- 5.3 Functional Reactive Programming -- 5.4 Functional Programming -- 5.5 Multitasking -- 5.6 mTask history -- 6 Discussion -- A Embedded Domain Specific Language Techniques -- A.1 Deep Embedding -- A.2 Shallow Embedding -- B iTask reference -- B.1 Types -- B.2 Editors -- B.3 Task Combinators -- B.4 Shared Data Sources -- B.5 Extra Task Combinators -- B.6 Examples -- C How to Install -- C.1 Fetch the CEFP distribution -- C.2 Setup -- C.3 Compile the Test Program -- C.4 Setup the Microcontroller Unit -- D Solutions -- References -- Paint Your Programs Green: On the Energy Efficiency of Data Structures -- 1 Introduction -- 2 Data Structures Libraries -- 2.1 Haskell Data Structures -- 2.2 Java Data Structures -- 3 Experimental Setup -- 3.1 Haskell Operations -- 3.2 Java Operations -- 3.3 Measuring Energy Consumption -- 4 Comparing Data Structure Energy Consumption -- 4.1 Haskell Data Structures -- 4.2 Java Data Structures -- 5 Related Work.
6 Conclusions -- References -- Energy Efficient Software in an Engineering Course -- 1 Introduction -- 2 Energy Efficient Software in Higher Education -- 2.1 Sustainable Development and Its Dimentions -- 2.2 Sustainable Development in Higher Education -- 2.3 Energy Efficient Software in Higher Education -- 3 Software Analysis and Testing with a Green Flavor -- 3.1 Green Software: A Multidisciplinary Module -- 3.2 Green Software: Module Objectives -- 3.3 Green Software: Module Supporting Tools -- 4 Energy Efficent Software: Students Assessment -- 4.1 A Catalog of Energy Smells and Refactorings -- 4.2 Students Grades -- 5 Conclusions -- References -- Utilizing Rail Traffic Control Simulator in Verified Software Development Courses -- 1 Introduction -- 2 TD/TS2JC Toolset -- 2.1 Train Director -- 2.2 TS2JavaConn -- 2.3 Communication with Control Modules -- 3 Control Modules and Configuration Files -- 3.1 Non-parametric Module -- 3.2 Parametric Module -- 4 Teaching Verified Software Development in B-Method with TD/TS2JC Toolset -- 4.1 Software Development Process of B-Method -- 4.2 B-Language -- 4.3 Abstract Specification -- 4.4 Refinement to Implementation -- 4.5 Three Sections Control Module Development Project -- 5 Conclusion -- References -- The Role of Functional Programming in Management and Orchestration of Virtualized Network Resources -- 1 Introduction -- 2 Background -- 3 Network Evolution -- 3.1 Cloud Computing Platforms -- 3.2 Network Function Virtalisation and Software Defined Network -- 4 Management and Orchestration of Virtualized Network Resources -- 4.1 Design Principles for Implementing Autonomic Behavior -- 4.2 Current State -- 5 OpenStack -- 5.1 Graphical User Interface for Manipulating Virtual Resources -- 5.2 Authentification and Authorisation Functions -- 5.3 Management of Disk Images -- 5.4 Network Management Functions. 5.5 Management of Virtual Instances -- 5.6 Management of Persistent Memory -- 5.7 Management of Object Storage -- 5.8 Performance Measurement Functions -- 5.9 Orchestration Functions -- 6 Examples -- 6.1 Example 1 -- 6.2 Example 2 -- 6.3 Example 3 -- 6.4 Example 4 -- 7 Use Cases from Industry and Reflection on Design Principles -- 7.1 Virtualisation of Mobile Switching Centre -- 7.2 Management Functions for Reliable and Stable Operation -- 8 Discussion -- 9 Conclusion -- References -- Towards Better Tool Support for Code Comprehension -- 1 Introduction -- 2 Model of Code Comprehension -- 2.1 Top-Down Models -- 2.2 Bottom-Up Models -- 2.3 Other Approaches -- 2.4 The Role of Concept Location -- 3 Nature of the Problems -- 3.1 Growing Complexity -- 3.2 Knowledge Erosion -- 3.3 Multiple Views of the Software Based on Various Information Sources -- 3.4 Communication Barriers -- 3.5 Multiple Programming Languages -- 3.6 Hard to Deploy New Tools -- 3.7 Requirement of Open Extensibility -- 3.8 API Usage -- 4 State of the Art -- 5 The CodeCompass Architecture -- 5.1 Layers of the Architecture -- 5.2 Web User Interface -- 5.3 Language Server Protocol -- 5.4 Performance -- 6 Important Design Workflows -- 6.1 Bug Investigation -- 6.2 Feature Development Planning and Estimation -- 6.3 Refactoring -- 6.4 Knowledge Transfer and Newcomers' Catch-Up -- 7 User Acceptance in Real Production -- 8 Conclusion and Future Work -- References -- Balanced Distributed Computation Patterns -- 1 Introduction -- 2 Go Essentials -- 2.1 Syntax of Basic Language Elements -- 3 Concurrent Programming -- 3.1 Goroutine -- 3.2 WaitGroup -- 3.3 Mutual Exclusion -- 3.4 Channels -- 3.5 Select -- 3.6 Concurrency Principles -- 3.7 Parallelism -- 3.8 Concurrent Job Processing -- 4 Advanced Message Queueing Protocol (AMQP) -- 4.1 AMQP Components -- 4.2 Connection and Channel. 4.3 Safe Message Delivery in Go -- 4.4 Prefetch -- 4.5 AMQP at Network Failures -- 4.6 AMQP Management -- 4.7 AMQP Advantages -- 4.8 AMQP Usage -- 4.9 AMQP 0.9.1 Model -- 4.10 Go RabbitMQ Client Library -- 5 Distributed Programming -- 5.1 RabbitMQ Hello World -- 5.2 RabbitMQ Exchange -- 5.3 RabbitMQ Shared Queue -- 5.4 Parallel Receive -- 5.5 Distributed Job Processing -- 5.6 Distributed Pipeline -- 5.7 Distributed Divide and Conquer -- 6 Testing Performances -- 7 Related Work -- 8 Conclusion -- A Code Listings and Outputs -- A.1 Parallel Receive -- A.2 Distributed Job Processing with Shared Response Queue, Version2 -- A.3 Distributed Job Processing with Private Response Queue, Version3 -- A.4 Distributed Job Processing with Worker Generator, Version4 -- A.5 Distributed Pipeline with Connection Confirmation (Version 2) -- A.6 Distributed Pipeline with Worker Generator (Version 3) -- A.7 Distributed Divide and Conquer -- B Task for Readers -- References -- PhD Workshop -- Tunnel Parsing -- 1 Introduction -- 2 Parsing Overview -- 3 Problem -- 4 Tunnel Parsing Algorithm -- 4.1 Tunnels -- 4.2 Routers -- 4.3 Segments -- 4.4 Control Layer -- 5 Results -- 6 Conclusion -- References -- Finding Code Clone Refactoring Techniques by Mapping Clone Context -- 1 Introduction -- 2 Background and Related Work -- 2.1 Clone Context Analysis -- 2.2 Clone Refactoring -- 3 Context Analysis of Clones -- 3.1 Relation -- 3.2 Location -- 3.3 Contents -- 4 CloneRefactor -- 5 Experimental Setup -- 5.1 The Corpus -- 5.2 Tool Validation -- 6 Results -- 6.1 Relation -- 6.2 Location -- 6.3 Contents -- 7 Discussion -- 8 Conclusion -- References -- Code Quality Metrics for Functional Features in Modern Object-Oriented Languages -- 1 Introduction -- 2 Problem Analysis -- 3 Candidate Measures -- 3.1 Number of Lambda-Functions Used in a Class (LC) -- 3.2 Source Lines of Lambda (SLOL). 3.3 Lambda Score (LSc) -- 3.4 Number of Lambda-Functions Using Mutable Field Variables in a Class (LMFV) -- 3.5 Number of Lambda-Functions Using Mutable Local Variables in a Class (LMLV) -- 3.6 Number of Lambda-Functions with Side-Effects Used in a Class (LSE) -- 3.7 Number of Non-terminated Collection Queries in a Class (UTQ) -- 4 Experimental Setup -- 4.1 Methodology -- 4.2 Relating Functional Constructs to Error-Proneness -- 4.3 Measuring Functional Constructs -- 4.4 Measuring Error-Proneness -- 4.5 Dataset -- 5 Experimental Evaluation -- 6 Threats to Validity -- 7 Related Work -- 8 Conclusion and Discussion -- References -- An Empirical Study on the Energy Efficiency of Matrix Transposition Algorithms -- 1 Introduction -- 2 Related Work -- 2.1 Energy Complexity Model -- 2.2 Empirical Studies on Cache Efficiency -- 2.3 Empirical Studies on Energy Efficiency -- 3 Algorithms for Matrix Transposition -- 4 Methodology and Experimental Setup -- 4.1 Experimental Setup -- 4.2 Performance Counter Measurement Tools -- 4.3 Intermediate Machine Code Generation Tool -- 5 Experimental Analysis -- 6 Conclusion and Future Work -- References -- Author Index. |
| Record Nr. | UNISA-996558467403316 |
|
Porkoláb Zoltán
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Intelligence in Music, Sound, Art and Design [[electronic resource] ] : 8th International Conference, EvoMUSART 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24–26, 2019, Proceedings / / edited by Anikó Ekárt, Antonios Liapis, María Luz Castro Pena
| Computational Intelligence in Music, Sound, Art and Design [[electronic resource] ] : 8th International Conference, EvoMUSART 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24–26, 2019, Proceedings / / edited by Anikó Ekárt, Antonios Liapis, María Luz Castro Pena |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (X, 249 p. 113 illus., 78 illus. in color.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence Data mining Computer arithmetic and logic units Artificial Intelligence Data Mining and Knowledge Discovery Arithmetic and Logic Structures |
| ISBN | 3-030-16667-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Deep Learning Concepts for Evolutionary Art -- Adversarial Evolution and Deep Learning – How Does An Artist Play with Our Visual System -- Autonomy, Authenticity, Authorship and Intention in Computer Generated Art -- Camera Obscurer: Generative Art for Design Inspiration -- Swarm-Based Identification of Animation Key Points from 2D-medialness Maps -- Paintings, Polygons and Plant Propagation -- Evolutionary Games for Audiovisual Works: Exploring the Demographic Prisoner's Dilemma -- Emojinating: Evolving Emoji Blends -- Automatically Generating Engaging Presentation Slide Decks -- Tired of choosing? Just Add Structure and Virtual Reality -- EvoChef: Show Me What to Cook! Artificial Evolution of Culinary Arts -- Comparing Models for Harmony Prediction in An Interactive Audio Looper -- Stochastic Synthesizer Patch Exploration in Edisyn -- Evolutionary Multi-Objective Training Set Selection of Data Instances and Augmentations for Vocal Detection -- Automatic Jazz Melody Composition Through a Learning-Based Genetic Algorithm -- Exploring Transfer Functions in Evolved CTRNNs for Music Generation. . |
| Record Nr. | UNISA-996466274903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
