Phronesis in Defense Engineering: A Case Study in the Heroic Actions of Two Defence Engineers as they Navigate their Careers

This case study investigated the experiences of engineers in the U.S. defense industry. The research identified two engineers that demonstrated phronesis, or practical wisdom, that sets them apart from their peers. These defense engineers demonstrated exemplary selflessness and ability to navigate the murky moral path while facing personal and professional hardships. In the end, regardless of their right actions and good outcome, they are neither recognized nor rewarded due to various industry and business forces. I call them unsung hero engineers and link their ideas and action to phronesis. This study documents their experiences, their ideas, and the outcomes. I also capture the history and current condition of the defense industry and describe the defense engineering work environment. This case study applies various theoretical lenses including Flybjerg’s phronesis, Bourdieu’s logic of practice, and Goffman’s moral career. The result is a rich study in the experiences of defense engineers and how they navigate the defense business, careers, and personal growth

Reductive Biotransformation of Ethyl Acetoacetate: A Comparative Studies using Free and Immobilized Whole Yeast Cells

Bioreduction of ethyl acetoacetate with free and immobilized yeast whole cell was achieved by using water and sucrose combination. After detachment from immobilized beads under basic condition, the corresponding ethyl(S)-(+)-3-hydroxybutanoate was isolated with 98 to 100% yield. Immobilized beads of yeast whole cell were prepared at different temperature which affects the morphology and physiology of the beads for the diffusion of the enzyme, which shown the maximum conversion of the substrate to products as compared to the free yeast whole cell

Colorectal Cancer Classification from Protein Sequences Using Several RNN Pre-Trained Models

Bioinformatics is one field that can integrate health information with data mining applications in order to predict or analyze the patient’s information. One among the several diseases is colorectal cancer,which is horrible and rated the third leading disease in the area of cancer which leads to death in both men and women.In general, there are several intelligent methods to identify several kinds of problems in gene selection for predicting cancer,but there is no method to give a solution for patients who are diagnosed in the advanced stage.This motivated me to design theproposed approach in which we try to identify all the homo protein sequences and then train these sequences corresponding to one which causes colorectal cancer.InBioinformatics,a protein acts as one of the main agent or source to perform a biological function by interacting with molecules like Deoxyribonucleic acid (DNA), Ribonucleic acid (RNA). The function of a protein determines the healthy or diseased states of an organism. Protein interaction with other proteins can be visualized through a network called Protein-Protein Interaction Network (PPIN).In general classification of protein sequences is a very complex task. Deep learning techniques like CNN and RNN can be used to solve the problem.In computational bioinformatics,the classification of protein sequence plays an important role in determining accuracy.To improve the accuracy of our current model, the suggested method incorporates GRU, LSTM, RNN, and Customized LSTM into an RNN based architecture by optimizing the parameters in a two-way direction.Here we try to test all the models on sample protein sequences that are collected from TCGA and then determine the correctness of testing data and training data

Settlement Analysis of Circular Footings on Layered Soil Systems

Many studies are available on the settlement analysis of footings on a homogeneous soil deposit underlain by a rigid base. However, the soil profile is seldom homogenous and typically a layered soil system is encountered in practice. The present study deals with the settlement profiles of soil underneath a circular footing of radius equal to a, and resting on a finite two-layered soil system with thicknesses equal to H1 and H2. The deformation moduli and Poisson’s ratios of the two layers are E1, υ1, and E2, υ2. The settlement profiles are proposed for varying H1/a and H2/a ratios (H1/a= 0.2, 0.5, 1, 2, 4 and 6, and H2/a= 1, 2, 4 and 6). The moduli ratio E1/E2is varied as 0.01, 0.05, 0.1, 0.5, 1, 2, 5 and 20. The extent of settlement due to load is also proposed from the surface settlement profile which can help in determining the influence of a footing on the neighboring footing or structure. The analysis is carried out using PLAXIS 2D vAE. In addition, the settlement influence factors are proposed for the above mentioned ratios to estimate the maximum settlement of the footing on a layered system. The results are also compared with the settlement measured in a building on a layered system in Adelaide, Southern Australia, and the results are found to be comparable

Bicriteria Network Design Problems

We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a <subgraph \from a given subgraph-class that minimizes the second objective subject to the budget on the first. We consider three different criteria - the total edge cost, the diameter and the maximum degree of the network. Here, we present the first polynomial-time approximation algorithms for a large class of bicriteria network design problems for the above mentioned criteria. The following general types of results are presented. First, we develop a framework for bicriteria problems and their approximations. Second, when the two criteria are the same %(note that the cost functions continue to be different) we present a ``black box'' parametric search technique. This black box takes in as input an (approximation) algorithm for the unicriterion situation and generates an approximation algorithm for the bicriteria case with only a constant factor loss in the performance guarantee. Third, when the two criteria are the diameter and the total edge costs we use a cluster-based approach to devise a approximation algorithms --- the solutions output violate both the criteria by a logarithmic factor. Finally, for the class of treewidth-bounded graphs, we provide pseudopolynomial-time algorithms for a number of bicriteria problems using dynamic programming. We show how these pseudopolynomial-time algorithms can be converted to fully polynomial-time approximation schemes using a scaling technique.Comment: 24 pages 1 figur