中村 太信

Nakamura Taishin

  • 講師
  • 学位:博士(工学)

基本情報

所属

  • Undergraduate School of Information Science and Technology / Department of Applied Computer Engineering
  • Graduate School of Engineering / Course of Electrical and Electronic Engineering

詳細情報

研究キーワード

  • Reliability engineering
  • Operations research
  • mathematical optimization
  • combinatorial optimization
  • algorithm

研究分野

  • Social infrastructure (civil Engineering, architecture, disaster prevention) Safety engineering
  • Social infrastructure (civil Engineering, architecture, disaster prevention) Social systems engineering

論文

Weighting Local Search with Variable Neighborhood Descent for the Network Topology Design Problem

Birnbaum Importance-Based Simulated Annealing Algorithm for Solving the Component Assignment Problem of Linear Connected-$(r,s)$-out-of-$(m,n)$:F Lattice Systems

Proposal of an Algorithm for Solving the Component Assignment Problem of an Adjacent Triangle-(m, n):F Triangular Lattice System

A weighting local search for the network topology design problem

The Optimal Design of Consecutive-k Systems

Proposal of the Algorithm for Solving the Component Assignment Problem in a Linear Consecutive System with Three Failure Modes

Investigating properties of the optimal arrangement in multistate sliding window systems

Branch‐and‐bound‐based algorithm for solving the multi‐type component assignment problem in a consecutive‐$k$‐out‐of‐$n$:F system

Ant Colony Optimization Algorithm with Three Types of Pheromones for the Component Assignment Problem in Linear Consecutive-k-out-of-n:F Systems

Algorithm for Computing the System Signatures of Linear and Circular Connected-(1,2)-or-(2,1)-out-of-(m,n):F Lattice Systems

Evaluation methods for the reliability of a Linear Connected-(1,2)-or-(2,1)-out-of-(m,n):F Lattice System

Reliability of a Toroidal Connected-(r,s)-out-of-(m,n):F Lattice System

Generalization of Limit Theorems for Connected-(r,s)-out-of-(m,n):F Lattice Systems

Optimal Arrangement of Linear Connected-(1,2)-or-(2,1)-out-of-(2,n):F System

Algorithm for Solving Optimal Arrangement Problem in Connected-(r,s)-out-of-(m,n):F Lattice System

講演・口頭発表等

  • Proposal of an algorithm for solving the component assignment problem of an adjacent triangle-(m,n):F triangular lattice system

ResearchMapへ移動します

Contact Us

Inquiries about coverage

Public Affairs Division Public Affairs and Communications Department

Tel. 0463-63-4670(direct dialing)