Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Machine”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Selecting an Encapsulant for an Aerospace Superconducting Machine

Achieving larger benefits from electrified propulsion in single aisle aircraft (the largest commercial aircraft market segment) necessitates that a significant fraction of their 20 MW or greater propulsion system be electrified. These aircraft would require up to 10-20 of today’s state-of-the art machines, which have been demonstrated up to 2.5 MW for aerospace use, and could benefit further from 5 MW+ designs. However, when conventionally cooled, high power density machines still produce a significant amount of waste heat, translating into heavy thermal management and detracting from system benefits. Highly efficient fully superconducting electric machines (or those with a cryogenically cooled, high purity copper or aluminum stator) are a possible solution but have multiple barriers to overcome. One such barrier is the durability of superconducting windings. Superconductors are typically brittle, and encapsulants used to hold windings in place are a significant source of stress due to mismatches in coefficient of thermally induced contraction between ambient and operational temperatures (20 to 77 K). Lack of compliance between the materials at operational temperatures also adds significant stress. These encapsulants also form a thermal barrier that can be detrimental to cooling the superconductors. This work describes an initial study of commercially available encapsulants as it relates to superconducting machine applications, along with initial modeling of thermal stress in superconducting windings for a superconducting or cryogenically cooled stator in a 5 MW electric machine.

encapsulant↗
NASA NTRS1971

Machine tools and fixtures: A compilation

As part of NASA's Technology Utilizations Program, a compilation was made of technological developments regarding machine tools, jigs, and fixtures that have been produced, modified, or adapted to meet requirements of the aerospace program. The compilation is divided into three sections that include: (1) a variety of machine tool applications that offer easier and more efficient production techniques; (2) methods, techniques, and hardware that aid in the setup, alignment, and control of machines and machine tools to further quality assurance in finished products: and (3) jigs, fixtures, and adapters that are ancillary to basic machine tools and aid in realizing their greatest potential.

Source record↗
NASA NTRS1977

Prosthetic EMG control enhancement through the application of man-machine principles

An area in medicine that appears suitable to man-machine principles is rehabilitation research, particularly when the motor aspects of the body are involved. If one considers the limb, whether functional or not, as the machine, the brain as the controller and the neuromuscular system as the man-machine interface, the human body is reduced to a man-machine system that can benefit from the principles behind such systems. The area of rehabilitation that this paper deals with is that of an arm amputee and his prosthetic device. Reducing this area to its man-machine basics, the problem becomes one of attaining natural multiaxis prosthetic control using Electromyographic activity (EMG) as the means of communication between man and prothesis. In order to use EMG as the communication channel it must be amplified and processed to yield a high information signal suitable for control. The most common processing scheme employed is termed Mean Value Processing. This technique for extracting the useful EMG signal consists of a differential to single ended conversion to the surface activity followed by a rectification and smoothing.

Simcox, W. A.↗
NASA NTRS1983

Human evolution in the age of the intelligent machine

A systems analysis of the future evolution of man can be conducted by analyzing the biological material of the galaxy into three subsystems: man, intelligent machines, and intelligent extraterrestrial organisms. A binomial interpretation is applied to this system wherein each of the subsystems is assigned a designation of success or failure. For man the two alternatives are, respectively, 'decline' or 'flourish', for machine they are 'become intelligent' or 'stay dumb', while for extraterrestrial intelligence the dichotomy is that of 'existence' or 'nonexistence'. The choices for each of three subsystems yield a total of eight possible states for the system. The relative lack of integration between brain components makes man a weak evolutionary contestant compared to machines. It is judged that machines should become dominant on earth within 100 years, probably by means of continuing development of existing man-machine systems. Advanced forms of extraterrestrial intelligence may exist but are too difficult to observe. The prospects for communication with extraterrestrial intelligence are reviewed.

Mclaughlin, W. I.↗
NASA NTRS1987

Initial planetary base construction techniques and machine implementation

Conceptual designs of (1) initial planetary base structures, and (2) an unmanned machine to perform the construction of these structures using materials local to the planet are presented. Rock melting is suggested as a possible technique to be used by the machine in fabricating roads, platforms, and interlocking bricks. Identification of problem areas in machine design and materials processing is accomplished. The feasibility of the designs is contingent upon favorable results of an analysis of the engineering behavior of the product materials. The analysis requires knowledge of several parameters for solution of the constitutive equations of the theory of elasticity. An initial collection of these parameters is presented which helps to define research needed to perform a realistic feasibility study. A qualitative approach to estimating power and mass lift requirements for the proposed machine is used which employs specifications of currently available equipment. An initial, unmanned mission scenario is discussed with emphasis on identifying uncompleted tasks and suggesting design considerations for vehicles and primitive structures which use the products of the machine processing.

Crockford, William W.↗
NASA NTRS1989

EDM machinability of SiCw/Al composites

Machinability of high temperature composites was investigated. Target materials, 15 and 25 vol pct SiC whisker-2124 aluminum composites, were machined by electrodischarge sinker machining and diamond saw. The machined surfaces of these metal matrix composites were examined by SEM and profilometry to determine the surface finish. Microhardness measurements were also performed on the as-machined composites.

Ramulu, M.↗
NASA NTRS1992

The Bearingless Electrical Machine

Electromagnetic bearings allow the suspension of solids. For rotary applications, the most important physical effect is the force of a magnetic circuit to a high permeable armature, called the MAXWELL force. Contrary to the commonly used MAXWELL bearings, the bearingless electrical machine will take advantage of the reaction force of a conductor carrying a current in a magnetic field. This kind of force, called Lorentz force, generates the torque in direct current, asynchronous and synchronous machines. The magnetic field, which already exists in electrical machines and helps to build up the torque, can also be used for the suspension of the rotor. Besides the normal winding of the stator, a special winding was added, which generates forces for levitation. So a radial bearing, which is integrated directly in the active part of the machine, and the motor use the laminated core simultaneously. The winding was constructed for the levitating forces in a special way so that commercially available standard ac inverters for drives can be used. Besides wholly magnetic suspended machines, there is a wide range of applications for normal drives with ball bearings. Resonances of the rotor, especially critical speeds, can be damped actively.

Bichsel, J.↗
NASA NTRS1992

High-resolution turbulent simulations using the Connection Machine-2

The spectral method provides an efficient algorithm for solving the 3D incompressible Navier-Stokes equations in periodic boundaries. Most people, so far, have used vectorized machines, such as the CRAY-2, to implement fast Fourier transformations and time integrations in the spectral calculations. In this paper, new results are presented using the spectral calculations on the Connection Machine-2 with a parallel algorithm. The large memory of the Connection Machine-2 and the parallel algorithm allows, of the first time, to implement a 512-cubed mesh resolution for high Reynolds number flows. The computational speed of the present code is about 30 percent faster than the fastest CRAY-2 simulations with four processors. Parallel machines, such as the Connection Machine-2, will possibly provide new computational power for understanding the intermittency and cascade mechanism in fluid turbulence.

Chen, Shiyi↗
NASA NTRS1995

The scheme machine: A case study in progress in design derivation at system levels

The Scheme Machine is one of several design projects of the Digital Design Derivation group at Indiana University. It differs from the other projects in its focus on issues of system design and its connection to surrounding research in programming language semantics, compiler construction, and programming methodology underway at Indiana and elsewhere. The genesis of the project dates to the early 1980's, when digital design derivation research branched from the surrounding research effort in programming languages. Both branches have continued to develop in parallel, with this particular project serving as a bridge. However, by 1990 there remained little real interaction between the branches and recently we have undertaken to reintegrate them. On the software side, researchers have refined a mathematically rigorous (but not mechanized) treatment starting with the fully abstract semantic definition of Scheme and resulting in an efficient implementation consisting of a compiler and virtual machine model, the latter typically realized with a general purpose microprocessor. The derivation includes a number of sophisticated factorizations and representations and is also deep example of the underlying engineering methodology. The hardware research has created a mechanized algebra supporting the tedious and massive transformations often seen at lower levels of design. This work has progressed to the point that large scale devices, such as processors, can be derived from first-order finite state machine specifications. This is roughly where the language oriented research stops; thus, together, the two efforts establish a thread from the highest levels of abstract specification to detailed digital implementation. The Scheme Machine project challenges hardware derivation research in several ways, although the individual components of the system are of a similar scale to those we have worked with before. The machine has a custom dual-ported memory to support garbage collection. It consists of four tightly coupled processes--processor, collector, allocator, memory--with a very non-trivial synchronization relationship. Finally, there are deep issues of representation for the run-time objects of a symbolic processing language. The research centers on verification through integrated formal reasoning systems, but is also involved with modeling and prototyping environments. Since the derivation algebra is basd on an executable modeling language, there is opportunity to incorporate design animation in the design process. We are looking for ways to move smoothly and incrementally from executable specifications into hardware realization. For example, we can run the garbage collector specification, a Scheme program, directly against the physical memory prototype, and similarly, the instruction processor model against the heap implementation.

Johnson, Steven D.↗
NASA NTRS1996

Adaptive Machining Of Large, Somewhat Flexible Parts

Adaptive machining is method of machining large, somewhat flexible workpieces to close tolerances. Devised for machining precise weld lands on aft skirts of rocket nozzles, but underlying concept generally applicable to precise machining of any of large variety of workpieces deformed by thermal, gravitational, and/or machining forces. For example, in principle, method used to bore precise hole on unanchored end of long cantilever beam.

Gutow, David↗
NASA NTRS2003

Intelligent Machines in the 21st Century: Automating the Processes of Inference and Inquiry

The last century saw the application of Boolean algebra toward the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines. in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. However, modern intelligent machines work by inferring knowledge using only their pre-programmed prior knowledge and the data provided. They lack the ability to ask questions, or request data that would aid their inferences. Recent advances in understanding the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we identified the algebra of questions as the free distributive algebra, which now allows us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper we describe this logic of inference and inquiry using the mathematics of partially ordered sets and the scaffolding of lattice theory, discuss the far-reaching implications of the methodology, and demonstrate its application with current examples in machine learning. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them to not only make inferences from data, but also decide which question to ask, experiment to perform, or measurement to take given what they have learned and what they are designed to understand.

Knuth, Kevin H.↗
NASA NTRS2003

Intelligent machines in the twenty-first century: foundations of inference and inquiry

The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.

Review↗
NASA NTRS2004

Design of Ultra-High-Power-Density Machine Optimized for Future Aircraft

The NASA Glenn Research Center's Structural Mechanics and Dynamics Branch is developing a compact, nonpolluting, bearingless electric machine with electric power supplied by fuel cells for future "more-electric" aircraft with specific power in the projected range of 50 hp/lb, whereas conventional electric machines generate usually 0.2 hp/lb. The use of such electric drives for propulsive fans or propellers depends on the successful development of ultra-high-power-density machines. One possible candidate for such ultra-high-power-density machines, a round-rotor synchronous machine with an engineering current density as high as 20,000 A/sq cm, was selected to investigate how much torque and power can be produced.

Choi, Benjamin B.↗
NASA NTRS2004

Fast Query-Optimized Kernel-Machine Classification

A recently developed algorithm performs kernel-machine classification via incremental approximate nearest support vectors. The algorithm implements support-vector machines (SVMs) at speeds 10 to 100 times those attainable by use of conventional SVM algorithms. The algorithm offers potential benefits for classification of images, recognition of speech, recognition of handwriting, and diverse other applications in which there are requirements to discern patterns in large sets of data. SVMs constitute a subset of kernel machines (KMs), which have become popular as models for machine learning and, more specifically, for automated classification of input data on the basis of labeled training data. While similar in many ways to k-nearest-neighbors (k-NN) models and artificial neural networks (ANNs), SVMs tend to be more accurate. Using representations that scale only linearly in the numbers of training examples, while exploring nonlinear (kernelized) feature spaces that are exponentially larger than the original input dimensionality, KMs elegantly and practically overcome the classic curse of dimensionality. However, the price that one must pay for the power of KMs is that query-time complexity scales linearly with the number of training examples, making KMs often orders of magnitude more computationally expensive than are ANNs, decision trees, and other popular machine learning alternatives. The present algorithm treats an SVM classifier as a special form of a k-NN. The algorithm is based partly on an empirical observation that one can often achieve the same classification as that of an exact KM by using only small fraction of the nearest support vectors (SVs) of a query. The exact KM output is a weighted sum over the kernel values between the query and the SVs. In this algorithm, the KM output is approximated with a k-NN classifier, the output of which is a weighted sum only over the kernel values involving k selected SVs. Before query time, there are gathered statistics about how misleading the output of the k-NN model can be, relative to the outputs of the exact KM for a representative set of examples, for each possible k from 1 to the total number of SVs. From these statistics, there are derived upper and lower thresholds for each step k. These thresholds identify output levels for which the particular variant of the k-NN model already leans so strongly positively or negatively that a reversal in sign is unlikely, given the weaker SV neighbors still remaining. At query time, the partial output of each query is incrementally updated, stopping as soon as it exceeds the predetermined statistical thresholds of the current step. For an easy query, stopping can occur as early as step k = 1. For more difficult queries, stopping might not occur until nearly all SVs are touched. A key empirical observation is that this approach can tolerate very approximate nearest-neighbor orderings. In experiments, SVs and queries were projected to a subspace comprising the top few principal- component dimensions and neighbor orderings were computed in that subspace. This approach ensured that the overhead of the nearest-neighbor computations was insignificant, relative to that of the exact KM computation.

Mazzoni, Dominic↗
NASA NTRS2008

Review, Selection and Installation of a Rapid Prototype Machine

The objective of this paper is to impress upon the reader the benefits and advantages of investing in rapid prototyping (additive manufacturing) technology thru the procurement of one or two new rapid prototyping machines and the creation of a new Prototype and Model Lab at the Kennedy Space Center (KSC). This new resource will be available to all of United Space Alliance, LLC (USA), enabling engineers from around the company to pursue a more effective means of communication and design with our co-workers, and our customer, the National Aeronautics and Space Administration (NASA). The Rapid Protoyping/3D printing industry mirrors the transition the CAD industry made several years ago, when companies were trying to justify the expenditure of converting to a 3D based system from a 2D based system. The advantages of using a 3D system seemed to be outweighed by the cost it would take to convert not only legacy 2D drawings into 3D models but the training of personnel to use the 3D CAD software. But the reality was that when a 3D CAD system is employed, it gives engineers a much greater ability to conceive new designs and the ability to engineer new tools and products much more effectively. Rapid Prototyping (RP) is the name given to a host of related technologies that are used to fabricate physical objects directly from Computer Aided Design (CAD) data sources. These methods are generally similar to each other in that they add and bond materials in a layer wise-fashion to form objects, instead of machining away material. The machines used in Rapid Prototyping are also sometimes referred to as Rapid Manufacturing machines due to the fact that some of the parts fabricated in a RP machine can be used as the finished product. The name "Rapid Prototyping" is really a misnomer. It is much more than prototypes and it is not always rapid.

McEndree, Caryl↗
NASA NTRS2018

Creating a Multifunctional Composite Stator Slot Material System to Enable High Power Density Electric Machines for Electrified Aircraft Applications

Increasing the power density and efficiency of electric machines (motors and generators) is integral to bringing Electrified Aircraft (EA) to commercial realization. However, power density and efficiency are not qualities that can be developed independently. At the heart of any electric machine are the conductors (usually copper) that carry current and generate magnetic fields. Increased power density means increased current density and increased joule heating in a smaller volume. To increase efficiency at the wire level means minimizing electrical resistance and hence power lost to joule heating. There are fundamental challenges with concomitantly increasing both power density and efficiency since the copper resistivity is very temperature sensitive at common electric machine operating conditions. Simple calculations of the linear increase in resistivity of copper as a function of temperature, reveals that a one degree Celsius increase in temperature results in a 0.39% decrease in efficiency. Conversely, a 20 degree Celsius decrease in copper temperature produces a 7.8% increase in efficiency. Therefore, improved thermal management concepts for electric machine building blocks such as stator winding are a priority for improving efficiency and power density. This paper proposing changing the view of component materials in the stator slots from individual components with singular functionality to a composite system where the components take on a multifunctional roles. In the composite framework, achievable material development goals are defined that together have maximum system impact on the thermal environment inside of high power density electric machines for aerospace applications.

thermal management↗
NASA NTRS2019

Machine Learning Prototype App For Recognition of Fruits

As the incidence of obesity and associated negative health consequences is rising, it becomes crucial to monitor the dietary choices of individuals. Unfortunately, traditional methods to collect this information involve collecting food frequency questionnaires from individuals using paper. Electronic food trackers have been developed to collect food data, but they require participants to manually label and describe the content of their meals, and which may be difficult for researchers to interpret in a standardized fashion. Machine learning, however, provides an easy and efficient method for both participants and researchers to label food items with standardized descriptions. This project aims to create a prototype phone application that can identify and label photos of apples. This is done by making a machine learning model through Turicreate, a python module, which is then implemented into an iOS app through Xcode and Swift. The modules used in Swift include CoreML and AVFoundation. This machine learning application will be incorporated with a MealLogger phone app that is also under development. The MealLogger app will be used to keep track of participants' calorie intake and other personal details throughout the sleep study. The machine learning model will present several potential identities of the foods found in the photo, and the user will only need to select the correct option. This will be a user-friendly method for participants to easily log their food consumption without the hard work of manually inputting each and every description. Some limitations to this project include the wide variety of food, including those within different cultures. To deal with this, the model will include the most generic food categories, which the participant may select, and produce a drop-down menu of more specific dishes under that specified category, with the option of self-input. Additional questionnaires may be implemented according to the food type selected This will allow the process to be quick and easy, but also specific for the purpose of analysis. The release of the application will require a much longer process, but the machine learning prototype presents a first step toward an application that may change data analysis for researchers interested in collecting food intake from individuals living in the real world.

Food tracker↗
NASA NTRS2019

Reusing Data and Metadata to Create New Metadata Through Machine-Learning & Other Programmatic Methods

Recent improvements in natural language processing (NLP) enable metadata to be created programmatically from reused original metadata or even the dataset itself. Transfer-learning applied to NLP has greatly improved performance and reduced training data requirements. In this talk, we’ll compare machine-generated metadata to human-generated metadata and discuss characteristics of metadata and data archives that affect suitability for machine-learning reuse of metadata. Where as human-generated metadata is often populated once, populated from the perspective of data supplier, populated by many individuals with different words for the same thing, and limited in length, machine-generated metadata can be updated any number of times, generated from the perspective of any user, constrained to a standardized set of terms that can be evolved over time, and be any length required. Machine-learning generated metadata offers benefits but also additional needs in terms of version control, process transparency, human-computer interaction, and IT requirements. As a successful example, we’ll discuss how a dataset of abstracts and associated human-tagged keywords from a standardized list of several thousand keywords were used to create a machine-learning model that predicted keyword metadata for open-source code projects on code.nasa.gov. We’ll also discuss a less successful example from data.nasa.gov to show how data archive architecture and characteristics of initial metadata can be strong controls on how easy it is to leverage programmatic methods to reuse metadata to create additional metadata.

Gosses, Justin↗