システム稼働率向上を考えて
•
0 likes•870 views
某会社に面接に行く際、要求され作成したものです。「よくできています」と言われつつ、不採用。 SlideShareのテストように使いました。
Report
Share
Report
Share
Recommended
The Ultimate Sequence Diagram Tutorial
Master sequence diagrams with this sequence diagram guide. It describes everything you need to know on sequence diagram notations, best practices as well as common mistakes. It also explains how to draw a sequence diagram step by step. Plus it offers Creately sequence diagram templates you can click and edit right away.
chapter 2 memory and process management
This document discusses memory management and paging in operating systems. It explains that memory management allocates space for application routines and prevents interference between programs. The memory hierarchy includes main memory, cache memory, and secondary storage. Paging is a memory management technique that divides processes and main memory into equal pages. It allows processes to be non-contiguous in memory. The operating system uses page tables to map logical addresses to physical addresses stored across different pages and frames. Paging reduces external fragmentation but can cause internal fragmentation.
Thread model of java
The document discusses the thread model of Java. It states that all Java class libraries are designed with multithreading in mind. Java uses threads to enable asynchronous behavior across the entire system. Once started, a thread can be suspended, resumed, or stopped. Threads are created by extending the Thread class or implementing the Runnable interface. Context switching allows switching between threads by yielding control voluntarily or through prioritization and preemption. Synchronization is needed when threads access shared resources using monitors implicit to each object. Threads communicate using notify() and wait() methods.
Chapter 8 : Memory
This document discusses memory management techniques used in operating systems, including:
- Base and limit registers that define the logical address space and protect memory accesses.
- Address binding from source code to executable addresses at different stages.
- The memory management unit (MMU) that maps virtual to physical addresses using base/limit registers.
- Segmentation architecture that divides memory into logical segments like code, data, stack, heap.
Transaction concurrency control
This document discusses transaction management and concurrency control. It defines a transaction as a logical unit of work that must be completed or aborted with no intermediate states. It describes the ACID properties of atomicity, consistency, isolation, and durability that transactions should have. It also discusses concurrency control techniques like locking and time stamping to ensure transactions execute serially for consistency despite concurrent access.
Distributed File Systems
This document discusses key aspects of distributed file systems including file caching schemes, file replication, and fault tolerance. It describes different cache locations, modification propagation techniques, and methods for replica creation. File caching schemes aim to reduce network traffic by retaining recently accessed files in memory. File replication provides increased reliability and availability through independent backups. Distributed file systems must also address being stateful or stateless to maintain information about file access and operations.
Arquitectura sw varios niveles.pdf
El documento describe las arquitecturas de software de varios niveles. Explica que una arquitectura de varias capas separa la presentación, la lógica del negocio y los datos en componentes distintos. Esto permite cambiar cada capa con menos impacto en las otras y favorece la extensibilidad y reutilización del software. Se mencionan ejemplos de arquitecturas físicas de dos y tres niveles que despliegan las capas lógicas en nodos separados.
IPC
Processes communicate through interprocess communication (IPC) using two main models: shared memory and message passing. Shared memory allows processes to access the same memory regions, while message passing involves processes exchanging messages through mechanisms like mailboxes, pipes, signals, and sockets. Common IPC techniques include semaphores, shared memory, message queues, and sockets that allow processes to synchronize actions and share data in both blocking and non-blocking ways. Deadlocks can occur if processes form a circular chain while waiting for resources held by other processes.
Recommended
The Ultimate Sequence Diagram Tutorial
Master sequence diagrams with this sequence diagram guide. It describes everything you need to know on sequence diagram notations, best practices as well as common mistakes. It also explains how to draw a sequence diagram step by step. Plus it offers Creately sequence diagram templates you can click and edit right away.
chapter 2 memory and process management
This document discusses memory management and paging in operating systems. It explains that memory management allocates space for application routines and prevents interference between programs. The memory hierarchy includes main memory, cache memory, and secondary storage. Paging is a memory management technique that divides processes and main memory into equal pages. It allows processes to be non-contiguous in memory. The operating system uses page tables to map logical addresses to physical addresses stored across different pages and frames. Paging reduces external fragmentation but can cause internal fragmentation.
Thread model of java
The document discusses the thread model of Java. It states that all Java class libraries are designed with multithreading in mind. Java uses threads to enable asynchronous behavior across the entire system. Once started, a thread can be suspended, resumed, or stopped. Threads are created by extending the Thread class or implementing the Runnable interface. Context switching allows switching between threads by yielding control voluntarily or through prioritization and preemption. Synchronization is needed when threads access shared resources using monitors implicit to each object. Threads communicate using notify() and wait() methods.
Chapter 8 : Memory
This document discusses memory management techniques used in operating systems, including:
- Base and limit registers that define the logical address space and protect memory accesses.
- Address binding from source code to executable addresses at different stages.
- The memory management unit (MMU) that maps virtual to physical addresses using base/limit registers.
- Segmentation architecture that divides memory into logical segments like code, data, stack, heap.
Transaction concurrency control
This document discusses transaction management and concurrency control. It defines a transaction as a logical unit of work that must be completed or aborted with no intermediate states. It describes the ACID properties of atomicity, consistency, isolation, and durability that transactions should have. It also discusses concurrency control techniques like locking and time stamping to ensure transactions execute serially for consistency despite concurrent access.
Distributed File Systems
This document discusses key aspects of distributed file systems including file caching schemes, file replication, and fault tolerance. It describes different cache locations, modification propagation techniques, and methods for replica creation. File caching schemes aim to reduce network traffic by retaining recently accessed files in memory. File replication provides increased reliability and availability through independent backups. Distributed file systems must also address being stateful or stateless to maintain information about file access and operations.
Arquitectura sw varios niveles.pdf
El documento describe las arquitecturas de software de varios niveles. Explica que una arquitectura de varias capas separa la presentación, la lógica del negocio y los datos en componentes distintos. Esto permite cambiar cada capa con menos impacto en las otras y favorece la extensibilidad y reutilización del software. Se mencionan ejemplos de arquitecturas físicas de dos y tres niveles que despliegan las capas lógicas en nodos separados.
IPC
Processes communicate through interprocess communication (IPC) using two main models: shared memory and message passing. Shared memory allows processes to access the same memory regions, while message passing involves processes exchanging messages through mechanisms like mailboxes, pipes, signals, and sockets. Common IPC techniques include semaphores, shared memory, message queues, and sockets that allow processes to synchronize actions and share data in both blocking and non-blocking ways. Deadlocks can occur if processes form a circular chain while waiting for resources held by other processes.
Deadlock in distribute system by saeed siddik
The document discusses deadlocks in distributed systems, outlining the four conditions required for a deadlock, strategies to handle deadlocks such as ignoring, detecting, preventing, and avoiding them, and algorithms for centralized deadlock detection and distributed deadlock detection and prevention. It provides examples of resource allocation graphs to illustrate deadlock conditions and explains how distributed deadlock detection and prevention algorithms work.
How to find Candidate keys , Minimal Keys and CLosure of any Attributes?
This document discusses key concepts in database normalization including functional dependencies, minimal keys, candidate keys, and how to find the closure and candidate keys of attributes. It provides examples and steps to determine if a set of attributes is a candidate key, which is a minimal set that uniquely identifies tuples. For a sample relation with attributes A, B, C, D, E, F and functional dependencies, it shows that AF is the only candidate key since its closure includes all attributes and it is the minimum set.
Tz2014 workshop rundeck
Este documento describe los pasos para configurar Rundeck y Jenkins para automatizar tareas. Se configura Rundeck en una máquina, se agregan nodos, y se crean proyectos y jobs para ejecutar comandos en los nodos de forma remota. Luego, se integra Rundeck con Jenkins mediante un plugin, y se crea un job de Jenkins que ejecuta un job de Rundeck después de cada compilación con éxito.
Deadlock Avoidance in Operating System
Deadlock avoidance methods analyze resource allocation to determine if granting a request would lead to an unsafe state where deadlock could occur. A deadlock happens when multiple processes are waiting indefinitely for resources held by each other in a cyclic dependency. To prevent deadlock, an operating system must have information on current resource availability and allocations, as well as future resource needs. The system only grants requests that will lead to a safe state where there are enough resources for all remaining processes and deadlock is not possible.
IGNOU BCS-051 Software Engineering December 2022 - Exam Solutions.docx
The document describes requirements for an Online Examination Form Submission System (OEFSS) according to the IEEE format, including developing a software requirements specification, explaining the prototype model of software development with an example, providing a structure chart to decompose a system into executable tasks using a hotel billing system as an example, and presenting a Gantt chart showing the tasks, dependencies, and time estimates for developing the OEFSS.
Dining Philosopher Problem and Solution
The Dining Philosopher Problem – The Dining Philosopher Problem states that K philosophers seated around a circular table with one chopstick between each pair of philosophers. There is one chopstick between each philosopher. A philosopher may eat if he can pick up the two chopsticks adjacent to him.
Analysis of mutual exclusion algorithms with the significance and need of ele...
Analysis of mutual exclusion algorithms with the significance and need of ele...Govt. P.G. College Dharamshala
Analysis of mutual exclusion algorithms with the significance and need of election algorithm to solve the coordinator problem for distributed systemSemophores and it's types
This document discusses semaphores and their use in solving critical section problems. It defines semaphores, describes their wait and signal methods, and types including counting and binary semaphores. It then explains how semaphores can be used to solve classical synchronization problems like the bounded buffer, readers-writers, and dining philosophers problems. Examples of semaphore implementations are provided for each problem.
Chapter 12 transactions and concurrency control
This document provides an overview and summary of key concepts related to transactions and concurrency control in distributed systems:
- Transactions allow a sequence of operations to be atomic and isolated despite crashes or concurrent operations. They ensure objects remain in a consistent state.
- Concurrency control techniques like locking and timestamp ordering ensure transactions are isolated and avoid problems like lost updates or inconsistent retrievals that could occur without synchronization.
- Transactions must commit atomically so their effects are durable even after crashes, or abort with no effect. Serializability ensures transactions have an effect equivalent to running serially one at a time.
Inter Process Communication
Independent processes operate concurrently without affecting each other, while cooperating processes can impact one another. Inter-process communication (IPC) allows processes to share information, improve computation speed, and share resources. The two main types of IPC are shared memory and message passing. Shared memory uses a common memory region for fast communication, while message passing involves establishing communication links and exchanging messages without shared variables. Key considerations for message passing include direct vs indirect communication and synchronous vs asynchronous messaging.
Processor allocation in Distributed Systems
Allocation of processors to processes in Distributed Systems. Strategies or algorithms for processor allocation. Design and Implementation Issues of Strategies.
Event handling63
This document discusses event handling in Java. It covers using the delegation event model, handling keyboard and mouse events, and using adapter classes. Key points covered include implementing the appropriate interface for the event desired, registering the listener, and providing empty implementations in adapter classes to simplify creating event handlers. Examples are provided to demonstrate handling keyboard and mouse events.
Multi threaded programming
1) A thread is a flow of execution within a process that has its own program counter, registers, and stack. Threads allow for parallelism and improved performance over single-threaded processes.
2) Multithreaded processes allow multiple parts of a program to execute concurrently using multiple threads, whereas single-threaded processes execute instructions in a single sequence.
3) There are two main types of threads: user-level threads managed by a user-space thread library, and kernel-level threads directly supported by the operating system kernel. Kernel threads can take advantage of multiprocessors but have more overhead than user-level threads.
DPP
The document describes the dining philosophers problem where philosophers share a circular table to eat rice with chopsticks. Each philosopher must pick up the two chopsticks next to them to eat, but only one chopstick can be picked up at a time to avoid deadlock situations. Solutions involve limiting the number of philosophers eating simultaneously or ensuring both chopsticks are available before picking up.
Deadlock Avoidance - OS
There are three main methods for dealing with deadlocks in an operating system: prevention, avoidance, and detection with recovery. Prevention ensures that the necessary conditions for deadlock cannot occur through restrictions on resource allocation. Avoidance uses additional information about future resource needs and requests to determine if allocating resources will lead to an unsafe state. Detection identifies when a deadlock has occurred, then recovery techniques like process termination or resource preemption are used to resolve it. No single approach is suitable for all resource types, so systems often combine methods by applying the optimal one to each resource class.
computer Netwoks - network layer
link state routing,unicast routing, multicast routing,broadcast routing, hierarical routing,congestion control, approach,
Mainframe systems
This document discusses different types of mainframe systems, beginning with batch systems where users submit jobs offline and jobs are run sequentially in batches. It then describes multiprogrammed systems which allow multiple jobs to reside in memory simultaneously, improving CPU utilization. Finally, it covers time-sharing systems which enable interactive use by multiple users at once through very fast switching between programs, minimizing response time. The key difference between multiprogrammed and time-sharing systems is the prioritization of maximizing CPU usage versus minimizing response time respectively.
「効率・品質・統制」の共通課題に着目した現場主導によるITS導入の効果検証
本スライドは、SQiP 2014（ソフトウェア品質シンポジウム）に採録された経験論文の口頭発表用スライドです。
https://www.juse.jp/sqip/symposium/archive/2014/day2/
経験論文のダウンロードはこちらです。
https://www.juse.jp/sqip/symposium/archive/2014/day2/files/ronbun_A3-4.pdf
又は http://www.slideshare.net/kakahane/s-qi-p2014kuniharuakahanea34
【経験論文】 「効率、品質、統制」の共通課題に着目した現場主導によるITS導入の効果検証
赤羽根 州晴 氏 （株）島津ビジネスシステムズ
【概要】
企業が使用する業務用ソフトウェアシステムの多くは、複数のIT統制、監査、認証に対応しなければならない。経営管理者はシステム開発・運用に係る管理記録を整備し、システムの管理品質と製品品質を長く維持しなければならない。
その一方で、開発・運用現場には多種多様な記録・管理方法の混用があり、記憶に頼る属人的な習慣も根強い。従来の方法では、管理要求を達成するために多くのコストが必要となり、また、対象システムの増加や規模拡大により、手順の実現と定着は容易でない。
IT統制、監査、認証の要求実現の急所は「管理記録の網羅性・完全性・追跡可能性の同時成立」にある。一方で、現場の要求は作業利便性と効率性の追求にある。２つの要求に通底する共通課題に着目し、統合情報基盤の構築による、強制力のみに依らない要求の実現と、有効な定着を目指した。
本論文では、島津製作所グループの基幹業務を支える業務用システムの開発・運用現場（100種、200名）において、IT統制水準とシステム品質の向上を目的としたIssue Tracking System（ITS – Redmine）の全面導入事例を紹介する。
5年間のITS運用結果（12万チケット）の定量・定性分析に基づいて「効率・品質・統制」の観点で導入効果を検証した。その結果、各種要求の実現、管理手順の有効な定着、低負荷の工数管理、多重管理の無駄をなくす、という効果が確認できた。
More Related Content
What's hot
Deadlock in distribute system by saeed siddik
The document discusses deadlocks in distributed systems, outlining the four conditions required for a deadlock, strategies to handle deadlocks such as ignoring, detecting, preventing, and avoiding them, and algorithms for centralized deadlock detection and distributed deadlock detection and prevention. It provides examples of resource allocation graphs to illustrate deadlock conditions and explains how distributed deadlock detection and prevention algorithms work.
How to find Candidate keys , Minimal Keys and CLosure of any Attributes?
This document discusses key concepts in database normalization including functional dependencies, minimal keys, candidate keys, and how to find the closure and candidate keys of attributes. It provides examples and steps to determine if a set of attributes is a candidate key, which is a minimal set that uniquely identifies tuples. For a sample relation with attributes A, B, C, D, E, F and functional dependencies, it shows that AF is the only candidate key since its closure includes all attributes and it is the minimum set.
Tz2014 workshop rundeck
Este documento describe los pasos para configurar Rundeck y Jenkins para automatizar tareas. Se configura Rundeck en una máquina, se agregan nodos, y se crean proyectos y jobs para ejecutar comandos en los nodos de forma remota. Luego, se integra Rundeck con Jenkins mediante un plugin, y se crea un job de Jenkins que ejecuta un job de Rundeck después de cada compilación con éxito.
Deadlock Avoidance in Operating System
Deadlock avoidance methods analyze resource allocation to determine if granting a request would lead to an unsafe state where deadlock could occur. A deadlock happens when multiple processes are waiting indefinitely for resources held by each other in a cyclic dependency. To prevent deadlock, an operating system must have information on current resource availability and allocations, as well as future resource needs. The system only grants requests that will lead to a safe state where there are enough resources for all remaining processes and deadlock is not possible.
IGNOU BCS-051 Software Engineering December 2022 - Exam Solutions.docx
The document describes requirements for an Online Examination Form Submission System (OEFSS) according to the IEEE format, including developing a software requirements specification, explaining the prototype model of software development with an example, providing a structure chart to decompose a system into executable tasks using a hotel billing system as an example, and presenting a Gantt chart showing the tasks, dependencies, and time estimates for developing the OEFSS.
Dining Philosopher Problem and Solution
The Dining Philosopher Problem – The Dining Philosopher Problem states that K philosophers seated around a circular table with one chopstick between each pair of philosophers. There is one chopstick between each philosopher. A philosopher may eat if he can pick up the two chopsticks adjacent to him.
Analysis of mutual exclusion algorithms with the significance and need of ele...
Analysis of mutual exclusion algorithms with the significance and need of ele...Govt. P.G. College Dharamshala
Analysis of mutual exclusion algorithms with the significance and need of election algorithm to solve the coordinator problem for distributed systemSemophores and it's types
This document discusses semaphores and their use in solving critical section problems. It defines semaphores, describes their wait and signal methods, and types including counting and binary semaphores. It then explains how semaphores can be used to solve classical synchronization problems like the bounded buffer, readers-writers, and dining philosophers problems. Examples of semaphore implementations are provided for each problem.
Chapter 12 transactions and concurrency control
This document provides an overview and summary of key concepts related to transactions and concurrency control in distributed systems:
- Transactions allow a sequence of operations to be atomic and isolated despite crashes or concurrent operations. They ensure objects remain in a consistent state.
- Concurrency control techniques like locking and timestamp ordering ensure transactions are isolated and avoid problems like lost updates or inconsistent retrievals that could occur without synchronization.
- Transactions must commit atomically so their effects are durable even after crashes, or abort with no effect. Serializability ensures transactions have an effect equivalent to running serially one at a time.
Inter Process Communication
Independent processes operate concurrently without affecting each other, while cooperating processes can impact one another. Inter-process communication (IPC) allows processes to share information, improve computation speed, and share resources. The two main types of IPC are shared memory and message passing. Shared memory uses a common memory region for fast communication, while message passing involves establishing communication links and exchanging messages without shared variables. Key considerations for message passing include direct vs indirect communication and synchronous vs asynchronous messaging.
Processor allocation in Distributed Systems
Allocation of processors to processes in Distributed Systems. Strategies or algorithms for processor allocation. Design and Implementation Issues of Strategies.
Event handling63
This document discusses event handling in Java. It covers using the delegation event model, handling keyboard and mouse events, and using adapter classes. Key points covered include implementing the appropriate interface for the event desired, registering the listener, and providing empty implementations in adapter classes to simplify creating event handlers. Examples are provided to demonstrate handling keyboard and mouse events.
Multi threaded programming
1) A thread is a flow of execution within a process that has its own program counter, registers, and stack. Threads allow for parallelism and improved performance over single-threaded processes.
2) Multithreaded processes allow multiple parts of a program to execute concurrently using multiple threads, whereas single-threaded processes execute instructions in a single sequence.
3) There are two main types of threads: user-level threads managed by a user-space thread library, and kernel-level threads directly supported by the operating system kernel. Kernel threads can take advantage of multiprocessors but have more overhead than user-level threads.
DPP
The document describes the dining philosophers problem where philosophers share a circular table to eat rice with chopsticks. Each philosopher must pick up the two chopsticks next to them to eat, but only one chopstick can be picked up at a time to avoid deadlock situations. Solutions involve limiting the number of philosophers eating simultaneously or ensuring both chopsticks are available before picking up.
Deadlock Avoidance - OS
There are three main methods for dealing with deadlocks in an operating system: prevention, avoidance, and detection with recovery. Prevention ensures that the necessary conditions for deadlock cannot occur through restrictions on resource allocation. Avoidance uses additional information about future resource needs and requests to determine if allocating resources will lead to an unsafe state. Detection identifies when a deadlock has occurred, then recovery techniques like process termination or resource preemption are used to resolve it. No single approach is suitable for all resource types, so systems often combine methods by applying the optimal one to each resource class.
computer Netwoks - network layer
link state routing,unicast routing, multicast routing,broadcast routing, hierarical routing,congestion control, approach,
Mainframe systems
This document discusses different types of mainframe systems, beginning with batch systems where users submit jobs offline and jobs are run sequentially in batches. It then describes multiprogrammed systems which allow multiple jobs to reside in memory simultaneously, improving CPU utilization. Finally, it covers time-sharing systems which enable interactive use by multiple users at once through very fast switching between programs, minimizing response time. The key difference between multiprogrammed and time-sharing systems is the prioritization of maximizing CPU usage versus minimizing response time respectively.
What's hot (20)
How to find Candidate keys , Minimal Keys and CLosure of any Attributes?
How to find Candidate keys , Minimal Keys and CLosure of any Attributes?
IGNOU BCS-051 Software Engineering December 2022 - Exam Solutions.docx
IGNOU BCS-051 Software Engineering December 2022 - Exam Solutions.docx
Analysis of mutual exclusion algorithms with the significance and need of ele...
Analysis of mutual exclusion algorithms with the significance and need of ele...
Similar to システム稼働率向上を考えて
「効率・品質・統制」の共通課題に着目した現場主導によるITS導入の効果検証
本スライドは、SQiP 2014（ソフトウェア品質シンポジウム）に採録された経験論文の口頭発表用スライドです。
https://www.juse.jp/sqip/symposium/archive/2014/day2/
経験論文のダウンロードはこちらです。
https://www.juse.jp/sqip/symposium/archive/2014/day2/files/ronbun_A3-4.pdf
又は http://www.slideshare.net/kakahane/s-qi-p2014kuniharuakahanea34
【経験論文】 「効率、品質、統制」の共通課題に着目した現場主導によるITS導入の効果検証
赤羽根 州晴 氏 （株）島津ビジネスシステムズ
【概要】
企業が使用する業務用ソフトウェアシステムの多くは、複数のIT統制、監査、認証に対応しなければならない。経営管理者はシステム開発・運用に係る管理記録を整備し、システムの管理品質と製品品質を長く維持しなければならない。
その一方で、開発・運用現場には多種多様な記録・管理方法の混用があり、記憶に頼る属人的な習慣も根強い。従来の方法では、管理要求を達成するために多くのコストが必要となり、また、対象システムの増加や規模拡大により、手順の実現と定着は容易でない。
IT統制、監査、認証の要求実現の急所は「管理記録の網羅性・完全性・追跡可能性の同時成立」にある。一方で、現場の要求は作業利便性と効率性の追求にある。２つの要求に通底する共通課題に着目し、統合情報基盤の構築による、強制力のみに依らない要求の実現と、有効な定着を目指した。
本論文では、島津製作所グループの基幹業務を支える業務用システムの開発・運用現場（100種、200名）において、IT統制水準とシステム品質の向上を目的としたIssue Tracking System（ITS – Redmine）の全面導入事例を紹介する。
5年間のITS運用結果（12万チケット）の定量・定性分析に基づいて「効率・品質・統制」の観点で導入効果を検証した。その結果、各種要求の実現、管理手順の有効な定着、低負荷の工数管理、多重管理の無駄をなくす、という効果が確認できた。
情報システム部門のタスク管理とIT全般統制 ～ Excel管理からの脱却 ～ (ITS Redmine #RxTstudy #5)
株式会社 島津ビジネスシステムズ 導入事例:
島津製作所グループの業務システムを引き受ける、情報システム子会社 株式会社 島津ビジネスシステムズでは、IT統制の情報基盤としてITS (Redmine)を全面採用しました。導入の「経過と効用」を題材に、情報 システム部門が抱えるいくつかの課題に対し「課題管理システム」が どの程度有効かという「情報と視点」をコミュニティーにご紹介します。
なぜ、現状の基幹業務システムは、ビジネス環境の変化に迅速に対応できないのか？ ～超高速開発ツールの導入が必然である理由～
ビジネス活動を支える企業や行政組織の基幹業務システム。そのシステムが環境変化に迅速に対応できないことが長年の課題となっています。このセミナーでは、今までの手作りの情報システムでは、そもそも変化へ対応することが困難であり、まったく新しい視点から再構築が必要となっていることを説明します。最近話題になっている「超高速開発」。なぜ、その考え方が重要であり、超高速開発ツールの導入が必要なのか？その理由を解説した資料です。
ITIC 2014 - 2015 グローバル・サーバー・ハードウェアおよびサーバー OS 信頼性レポート
独立機関のITIC により、世界各国の600社を超える組織の経営陣および IT 管理者を対象に実施された2014 グローバル・サーバー・ハードウェアおよびサーバー OSの信頼性調査の結果です。
Similar to システム稼働率向上を考えて (7)
オープンソース統合運用管理ツール『Hinemos』 --- その利便性及びインシデント管理について ---
オープンソース統合運用管理ツール『Hinemos』 --- その利便性及びインシデント管理について ---
情報システム部門のタスク管理とIT全般統制 ～ Excel管理からの脱却 ～ (ITS Redmine #RxTstudy #5)
情報システム部門のタスク管理とIT全般統制 ～ Excel管理からの脱却 ～ (ITS Redmine #RxTstudy #5)
なぜ、現状の基幹業務システムは、ビジネス環境の変化に迅速に対応できないのか？ ～超高速開発ツールの導入が必然である理由～
なぜ、現状の基幹業務システムは、ビジネス環境の変化に迅速に対応できないのか？ ～超高速開発ツールの導入が必然である理由～
ITIC 2014 - 2015 グローバル・サーバー・ハードウェアおよびサーバー OS 信頼性レポート
ITIC 2014 - 2015 グローバル・サーバー・ハードウェアおよびサーバー OS 信頼性レポート
Recently uploaded
「進化するアプリ イマ×ミライ ～生成AIアプリへ続く道と新時代のアプリとは～」Interop24Tokyo APPS JAPAN B1-01講演
進化するアプリ イマ×ミライ
～生成AIアプリへ続く道と新時代のアプリとは～
2024/6/12～14まで幕張メッセで開催されました、インターロップ併設アプリジャパンの展示会場内ROOM Bで、10:30～11:10の枠で登壇させてもらいましたセッション資料を公開します。
ReonHata_便利の副作用に気づかせるための発想支援手法の評価---行為の増減の提示による気づきへの影響---
我々はこれまで，新たなモノを産出する過程において「便利にすること」によって副次的に生じる課題を「便利の副作用」と定義し，その低減を目的としてアイディアの発想支援手法を提案してきた．
これまでの研究では，便利前後の行為の増減に着目することにより便利の副作用への気づきの誘発が示唆されたものの，行為の増減の提示による便利の副作用への気づきへの影響は十分に検討できていなかった．
そのため，本稿では行為の提示により便利の副作用に気づき，それを防いだアイディアの発想の支援が可能かの検証を目的として実験を行い，その有効性について検証する．
実験では，行為の増減の提示の有無によりアイディア発想にどのような影響を与えるか検証を行う．
Generating Automatic Feedback on UI Mockups with Large Language Models
Generating Automatic Feedback on UI Mockups with Large Language Modelsを和訳紹介したものです
遺伝的アルゴリズムと知識蒸留による大規模言語モデル（LLM）の学習とハイパーパラメータ最適化
オープンエンドな進化から着想を得て、個々の大規模言語モデル（LLM）が、グループとして学習を進めながら、ノームエージェントとして機能するという概念を探求しています。これは、単一のモデルでは難しい複雑な問題を解決することを目的としています。具体的な方法として、遺伝的アルゴリズムと知識蒸留を組み合わせた学習プロセスを提案しています。知識蒸留によって学習を進め、同時に遺伝的アルゴリズムでハイパーパラメータを最適化することで、より効率的な学習を目指します。ドメインタスクとして、指示からPythonコードを生成するコード生成タスクを選択しました。実験では、学習に3つの学習モデルと1つの教師モデルを使用しました。その結果、HumanEvalのpass@1で精度が1.2%向上し、学習が進むにつれて学習率が最適化された兆候が見られました。しかし、大幅な精度向上を達成し、さまざまなハイパーパラメータを最適化するには、まだ課題が残っています。
生成AIがもたらすコンテンツ経済圏の新時代 The New Era of Content Economy Brought by Generative AI
、コンテンツ制作の主体をプロのクリエーターからユーザーへと移行させている現状をご存じの方も多いでしょう。現在、画像コンテンツ制作現場では生成AIがクリエーターを支援するツールとして利用されています。セミナーでは、画像生成における自動化の境界についての議論が予定されています。
AIの利用には著作権や倫理的な問題も伴いますが、クリエーターとAIが共存し、センシング技術と統合することで新しい形のコンテンツが生み出されることが期待されています。
論文紹介：Deep Learning-Based Human Pose Estimation: A Survey
Ce Zheng, Wenhan Wu, Chen Chen, Taojiannan Yang, Sijie Zhu, Ju Shen, Nasser Kehtarnavaz, Mubarak Shah, "Deep Learning-Based Human Pose Estimation: A Survey" arXiv2020
https://arxiv.org/abs/2012.13392
Recently uploaded (12)
「進化するアプリ イマ×ミライ ～生成AIアプリへ続く道と新時代のアプリとは～」Interop24Tokyo APPS JAPAN B1-01講演
「進化するアプリ イマ×ミライ ～生成AIアプリへ続く道と新時代のアプリとは～」Interop24Tokyo APPS JAPAN B1-01講演
ReonHata_便利の副作用に気づかせるための発想支援手法の評価---行為の増減の提示による気づきへの影響---
ReonHata_便利の副作用に気づかせるための発想支援手法の評価---行為の増減の提示による気づきへの影響---
Humanoid Virtual Athletics Challenge2024 技術講習会 スライド
Humanoid Virtual Athletics Challenge2024 技術講習会 スライド
This is the company presentation material of RIZAP Technologies, Inc.
This is the company presentation material of RIZAP Technologies, Inc.
Generating Automatic Feedback on UI Mockups with Large Language Models
Generating Automatic Feedback on UI Mockups with Large Language Models
キンドリル ネットワークアセスメントサービスご紹介 今のネットワーク環境は大丈夫？ 調査〜対策までご支援します
キンドリル ネットワークアセスメントサービスご紹介 今のネットワーク環境は大丈夫？ 調査〜対策までご支援します
ハイブリッドクラウド研究会_Hyper-VとSystem Center Virtual Machine Manager セッションMM
ハイブリッドクラウド研究会_Hyper-VとSystem Center Virtual Machine Manager セッションMM
生成AIがもたらすコンテンツ経済圏の新時代 The New Era of Content Economy Brought by Generative AI
生成AIがもたらすコンテンツ経済圏の新時代 The New Era of Content Economy Brought by Generative AI
論文紹介：Deep Learning-Based Human Pose Estimation: A Survey
論文紹介：Deep Learning-Based Human Pose Estimation: A Survey
システム稼働率向上を考えて
- 1. システム稼動率の維持 について サービス障害発生の 防止要点
- 2. サービス障害の定義 システム稼動率を高めるため、稼働率を影響する最大の要因サービス障害の定義を明確にする必要があります。 サービス意義上の障害： 予め定義した期間以上に、システムは設計された諸機能が停止、または予期された時間以内、所定の自動または手動復旧手順に従っても機能が回復しなかった際、障害発生と定義 技術的な意義上の障害： システムは、設計された機能が異常停止、また予期された動きと異なるように動作する際、障害発生と定義 一般的に、サービス意義上の障害を商業システムの稼動率影響する要因とします。