Smith, TN
Aaron C. Smith, Arlington, TN US
Patent application number | Description | Published |
---|---|---|
20080249574 | Bone Screw System - A set of screws sized and configured for fixing a Jones fracture in a fifth metatarsal bone of a patient by preserving a bone thread path. Each screw has a low profile head on a trailing end, a thread portion on a leading portion, and a smooth shank portion between the head portion and the thread portion. A first screw has a thread major diameter of between about 4.4-4.6 mm, a second screw a thread major diameter of between about 5.4-5.6 mm, and a third screw a thread major diameter of between about 6.4-6.6 mm. The thread portion of all the screws in the set has a set of identical thread profile characteristics comprising a pitch, a leading edge angle, a trailing edge angle, a leading edge radius, a trailing edge radius, and a land. Each screw size is provided in various preferred lengths. | 10-09-2008 |
20090157079 | INTRAMEDULLARY FIXATION ASSEMBLY AND DEVICES AND METHODS FOR INSTALLING THE SAME - An intramedullary fixation assembly usable with different long bone types and a guide assembly for guiding deployment of the intramedullary fixation assembly. The intramedullary fixation assembly includes a fixation member that has ends and a curved body extending between the ends. The curved body of the fixation member has a radius of curvature configured to extend through the medullary canal regardless of the long bone anatomy. Fasteners fix the fixation member to the bone fragments and are guided by a guide assembly. The guide assembly includes a guide body defining openings configured to guide the fasteners through openings defined in the fixation member and into the bone fragments. A fixation end of the guide body includes a pair of opposing, converging surfaces that are configured to engage in a positive fit with an exposed end of the fixation member accessible through the side aperture in the first fragment. | 06-18-2009 |
20090292292 | GUIDE ASSEMBLY FOR INTRAMEDULLARY FIXATION AND METHOD OF USING THE SAME - An intramedullary fixation assembly usable with different long bone types and a guide assembly for guiding deployment of the intramedullary fixation assembly. The intramedullary fixation assembly includes a fixation member that has ends and a curved body extending between the ends. The curved body of the fixation member has a radius of curvature configured to extend through the medullary canal regardless of the long bone anatomy. Fasteners fix the fixation member to the bone fragments and are guided by a guide assembly. The guide assembly includes a guide body defining openings configured to guide the fasteners through openings defined in the fixation member and into the bone fragments. A fixation end of the guide body includes a pair of opposing, converging surfaces that are configured to engage in a positive fit with an exposed end of the fixation member accessible through the side aperture in the first fragment. | 11-26-2009 |
20100305706 | SPINAL IMPLANT - A spinal implant may be used to stabilize a portion of a spine. The implant may promote bone growth between adjacent vertebrae that fuses the vertebrae together. An implant may include an opening through a height of a body of the implant. The body of the implant may include curved sides. A top and/or a bottom of the implant may include protrusions that contact and/or engage vertebral surfaces to prevent backout of the implant from the disc space. A variety of instruments may be used to prepare a disc space and insert an implant. The instruments may include, but are not limited to, a distractor, a rasp, and one or more guides. The implant and instruments may be supplied in an instrument kit. | 12-02-2010 |
20110313469 | BONE SCREW SYSTEM - A set of screws sized and configured for fixing a Jones fracture in a fifth metatarsal bone of a patient by preserving a bone thread path. Each screw has a low profile head on a trailing end, a thread portion on a leading portion, and a smooth shank portion between the head portion and the thread portion. A first screw has a thread major diameter of between about 4.4-4.6 mm, a second screw a thread major diameter of between about 5.4-5.6 mm, and a third screw a thread major diameter of between about 6.4-6.6 mm. The thread portion of all the screws in the set has a set of identical thread profile characteristics comprising a pitch, a leading edge angle, a trailing edge angle, a leading edge radius, a trailing edge radius, and a land. Each screw size is provided in various preferred lengths. | 12-22-2011 |
Al Smith, Dickson, TN US
Patent application number | Description | Published |
---|---|---|
20130264945 | LIGHT EMITTING DIODE DRIVER WITH OVERLOAD PROTECTION AND INDICATION WITH REDUNDANCY - A method of driving a light-emitting diode (LED) light load is disclosed herein. The method includes the step of driving an LED light load in a plurality of different modes. Each mode is defined by at least one of constant current and constant voltage delivered by a power supply. In the exemplary embodiment disclosed herein, each mode can be defined by at least one of constant current and constant voltage and by at least one of variable current and variable voltage. | 10-10-2013 |
Anne Smith, Lenoir City, TN US
Patent application number | Description | Published |
---|---|---|
20100080339 | MODELING OF THE POINT-SPREAD-FUNCTION IN SINGLE-PINHOLE AND MULTI-PINHOLE SPECT RECONSTRUCTION - A system and method for reconstructing single photon emission computed tomography data acquired with a pinhole collimator includes sub-dividing each voxel in the imaging target object space into sub-voxels and sub-dividing each of the detector bins in the gamma camera detector into sub-bins, connecting the centers of each of the sub-voxels to each of the detector sub-bins through a pinhole provided in the pinhole collimator by ray tracing and for each ray connecting the centers of each of the sub-voxels to each of the detector sub-bins, the transmission probability is calculated by analytically solving the intersections between the ray and the pinhole surfaces. Then, a geometric-response-function of the pinhole collimator is computed which is then convolved with the intrinsic-response-function of the detector to obtain the PSF. | 04-01-2010 |
Aubrey Smith, Cordova, TN US
Patent application number | Description | Published |
---|---|---|
20090100662 | Automated three nail gun tool dolly - A new and improved automated gun tool dolly which comprises a plurality of nail guns, such as, for example, three nail guns, which are mounted upon a horizontally movable carriage assembly in a vertically and horizontally staggered mode so as to be disposed within a diagonal array. Movement of the carriage assembly along horizontally oriented guide rails is automatically controlled, such as, for example, by means of a programmable logic controller (PLC), such that the three nail guns are sequentially and continuously disposed at predetermined firing positions at which the nail guns are sequentially fired so as to insert nails within predetermined regions of 2×4 or 2×6 plate, header, or footer members of a wall panel or wall structure. | 04-23-2009 |
20090100663 | Two gun tool dolly for firing and inserting three or more nails into plate, header, or footer frame members being attached to wall stud members - A two gun tool dolly which is capable of firing and inserting two, three or four nails into plate, header, or footer frame members at predetermined locations thereof so as to fixedly secure top and bottom plate, header, or footer members to stud frame members of a wall structure or wall panel. | 04-23-2009 |
20090127311 | Single tool nailing bridge system - A new and improved nailing bridge system which comprises a single nailing gun which is mounted for movement along a stud frame locus or a seam locus, defined by means of abutting sheets of wall sheathing, covering, paneling, or the like, wherein the single nailing gun can be moved to any one of effectively an infinite number of positions so as to permit nails to be driven into the covering, sheathing, paneling, or the like, in order to fixedly secure the sheathing, covering, paneling, or the like, to underlying stud frame members of a wall structure or wall panel member. Stitcher guns are also mounted upon a separate support beam so as to fixedly secure the sheathing, covering, paneling, or the like, to the upper and lower plate, header, or footer members of the wall structure or wall panel member. | 05-21-2009 |
Barry Arlen Smith, Loudon, TN US
Patent application number | Description | Published |
---|---|---|
20140252110 | Disposable Single-Use Animal Attractant Dispensing Device - A disposable single-use animal attractant dispensing device has a pouch formed by front and back panels joined along peripheral edges, which includes a pouch section for retaining an animal attractant and a single-use absorbent lure for absorbing the attractant. A first opening formed by un-joined portions of the panels is sealed together along with a portion of the lure to form a sealing section, forming a substantially impervious seal. A notch is provided to assist the user in rupturing the seal to separate the pouch and sealing sections and to expose the lure. A securement is provided for securing the pouch to a user, and may include a pouch connection member and a user connection member. An aperture disposed in the sealing section of the pouch receives a portion of the securement. A pocket on an outer surface of the pouch holds a portion of the securement. | 09-11-2014 |
Bennett L. Smith, Knoxville, TN US
Patent application number | Description | Published |
---|---|---|
20110115628 | High-security self-adhesive stickers - The invention comprises two different versions of a self-adhesive label, or “sticker,” that may be manufactured in various dimensions and may be utilized to seal and protect the confidentiality of documents and other papers contained in file folders or other such storage media: | 05-19-2011 |
Bobby Smith, Nashville, TN US
Patent application number | Description | Published |
---|---|---|
20130297505 | SYSTEM AND METHOD FOR INSTANT ISSUE OF PERSONALIZED FINANCIAL TRANSACTION CARDS - In a method for instantly issuing a personalized financial transaction card to a customer, a bank employee receives customer and card information a branch location, including a card PIN. The customer and card information is input into a data terminal and communicated across a network to a card services provider, where the PIN is entered into a PIN database. A reference number associated with the customer and a PIN offset is generated. The reference number is used to retrieve the PIN from the PIN database. The PIN is then used to apply calculations to the card file. The card file is securely sent from the card services provider across the network to the branch location. Using information from the card file, the financial transaction card is printed for the customer at the branch location. | 11-07-2013 |
Bobby Smith, Antioch, TN US
Patent application number | Description | Published |
---|---|---|
20120016797 | System and Method for Instant Issue of Personalized Financial Transaction Cards - In a method for instantly issuing a personalized financial transaction card to a customer a bank employee receives customer information and card information from the customer at a branch location. The card information may include a card personal identification number (PIN) selected by the customer. The operator inputs the customer information and at least some the card information into a data processing terminal at the branch. The customer information and the card information are communicated from the branch across a network to a card services provider. At the card services provider, the PIN is entered into a PIN database and a reference number associated with the customer and a PIN offset is generated. The reference number and at least some of the customer data and card data may be stored in a card file associated with the customer. The reference number is used to retrieve the PIN from the PIN database. The retrieved PIN is then used to apply calculations to the card file. The card file is securely sent from the card services provider across the network to the branch location. Using information from the card file, the financial transaction card is printed for the customer at the branch location. In a preferred embodiment, the personalized card is instantly issued while the customer is present at the branch location. | 01-19-2012 |
Brenda Ann Smith, Knoxville, TN US
Patent application number | Description | Published |
---|---|---|
20140065290 | COMPOSITIONS AND METHODS OF USE FOR DETECTION AND IMAGING OF PRINTS BY SURFACE-ENHANCED SPECTROSCOPIC TECHNIQUES - The present invention relates to a print detection composition comprising nanoparticles having an aerogel metal oxide core covered by a layer of zerovalent noble metal, and optionally, a fluorescent organic dye, wherein the fluorescent organic dye is within an interacting distance of the plasmon resonance field of the layer of zerovalent noble metal. The invention is also directed to surface-enhanced spectroscopic methods for imaging a latent print, particularly a latent fingerprint, by use of the print detection composition. | 03-06-2014 |
Brian E. Smith, Knoxville, TN US
Patent application number | Description | Published |
---|---|---|
20120290863 | Budget-Based Power Consumption For Application Execution On A Plurality Of Compute Nodes - Methods, apparatus, and products are disclosed for budget-based power consumption for application execution on a plurality of compute nodes that include: assigning an execution priority to each of one or more applications; executing, on the plurality of compute nodes, the applications according to the execution priorities assigned to the applications at an initial power level provided to the compute nodes until a predetermined power consumption threshold is reached; and applying, upon reaching the predetermined power consumption threshold, one or more power conservation actions to reduce power consumption of the plurality of compute nodes during execution of the applications. | 11-15-2012 |
20120304193 | Scheduling Applications For Execution On A Plurality Of Compute Nodes Of A Parallel Computer To Manage Temperature Of The Nodes During Execution - Methods, apparatus, and products are disclosed for scheduling applications for execution on a plurality of compute nodes of a parallel computer to manage temperature of the plurality of compute nodes during execution that include: identifying one or more applications for execution on the plurality of compute nodes; creating a plurality of physically discontiguous node partitions in dependence upon temperature characteristics for the compute nodes and a physical topology for the compute nodes, each discontiguous node partition specifying a collection of physically adjacent compute nodes; and assigning, for each application, that application to one or more of the discontiguous node partitions for execution on the compute nodes specified by the assigned discontiguous node partitions. | 11-29-2012 |
20130046844 | ADMINISTERING CONNECTION IDENTIFIERS FOR COLLECTIVE OPERATIONS IN A PARALLEL COMPUTER - Administering connection identifiers for collective operations in a parallel computer, including prior to calling a collective operation, determining, by a first compute node of a communicator to receive an instruction to execute the collective operation, whether a value stored in a global connection identifier utilization buffer exceeds a predetermined threshold; if the value stored in the global ConnID utilization buffer does not exceed the predetermined threshold: calling the collective operation with a next available ConnID including retrieving, from an element of a ConnID buffer, the next available ConnID and locking the element of the ConnID buffer from access by other compute nodes; and if the value stored in the global ConnID utilization buffer exceeds the predetermined threshold: repeatedly determining whether the value stored in the global ConnID utilization buffer exceeds the predetermined threshold until the value stored in the global ConnID utilization buffer does not exceed the predetermined threshold. | 02-21-2013 |
20130060557 | DISTRIBUTED HARDWARE DEVICE SIMULATION - Distributed hardware device simulation, including: identifying a plurality of hardware components of the hardware device; providing software components simulating the functionality of each hardware component, wherein the software components are installed on compute nodes of a distributed processing system; receiving, in at least one of the software components, one or more messages representing an input to the hardware component; simulating the operation of the hardware component with the software component, thereby generating an output of the software component representing the output of the hardware component; and sending, from the software component to at least one other software component, one or more messages representing the output of the hardware component. | 03-07-2013 |
20130060844 | DIRECT INJECTION OF DATA TO BE TRANSFERRED IN A HYBRID COMPUTING ENVIRONMENT - Direct injection of a data to be transferred in a hybrid computing environment that includes a host computer and a plurality of accelerators, the host computer and the accelerators adapted to one another for data communications by a system level message passing module. Each accelerator includes a Power Processing Element (‘PPE’) and a plurality of Synergistic Processing Elements (‘SPEs’). Direct injection includes reserving, by each SPE, a slot in a shared memory region accessible by the host computer; loading, by each SPE into local memory of the SPE, a portion of data to be transferred to the host computer; executing, by each SPE in parallel, a data processing operation on the portion of the data loaded in local memory of each SPE; and writing, by each SPE, the processed data to the SPE's reserved slot in the shared memory region accessible by the host computer. | 03-07-2013 |
20130061238 | OPTIMIZING THE DEPLOYMENT OF A WORKLOAD ON A DISTRIBUTED PROCESSING SYSTEM - Optimizing the deployment of a workload on a distributed processing system, the distributed processing system having a plurality of nodes, each node having a plurality of attributes, including: profiling during operations on the distributed processing system attributes of the nodes of the distributed processing system; selecting a workload for deployment on a subset of the nodes of the distributed processing system; determining specific resource requirements for the workload to be deployed; determining a required geometry of the nodes to run the workload; selecting a set of nodes having attributes that meet the specific resource requirements and arranged to meet the required geometry; deploying the workload on the selected nodes. | 03-07-2013 |
20130061246 | PROCESSING DATA COMMUNICATIONS MESSAGES WITH INPUT/OUTPUT CONTROL BLOCKS - Processing data communications messages with an Input/Output Control Block (‘IOCB’) ring that includes a number of IOCBs characterized by a priority and arranged in sequential priority for serial operation, where processing the messages includes depositing message data in one or more IOCBs according to depositing criteria; processing, by a message processing module associated with an IOCB having a priority less than the present value of a state counter, the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits; increasing, upon completion of processing the message data of the IOCB having a priority less than the present value of the state counter, the present value of the state counter to a value greater than the next priority; and processing, by the message processing module associated with the IOCB having the next priority, the message data in the IOCB. | 03-07-2013 |
20130067111 | ROUTING DATA COMMUNICATIONS PACKETS IN A PARALLEL COMPUTER - Routing data communications packets in a parallel computer that includes compute nodes organized for collective operations, each compute node including an operating system kernel and a system-level messaging module that is a module of automated computing machinery that exposes a messaging interface to applications, each compute node including a routing table that specifies, for each of a multiplicity of route identifiers, a data communications path through the compute node, including: receiving in a compute node a data communications packet that includes a route identifier value; retrieving from the routing table a specification of a data communications path through the compute node; and routing, by the compute node, the data communications packet according to the data communications path identified by the compute node's routing table entry for the data communications packet's route identifier value. | 03-14-2013 |
20130067206 | Endpoint-Based Parallel Data Processing In A Parallel Active Messaging Interface Of A Parallel Computer - Endpoint-based parallel data processing in a parallel active messaging interface (‘PAMI’) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes coupled for data communications through the PAMI, including establishing a data communications geometry, the geometry specifying, for tasks representing processes of execution of the parallel application, a set of endpoints that are used in collective operations of the PAMI including a plurality of endpoints for one of the tasks; receiving in endpoints of the geometry an instruction for a collective operation; and executing the instruction for a collective operation through the endpoints in dependence upon the geometry, including dividing data communications operations among the plurality of endpoints for one of the tasks. | 03-14-2013 |
20130067487 | Runtime Optimization Of An Application Executing On A Parallel Computer - Identifying a collective operation within an application executing on a parallel computer; identifying a call site of the collective operation; determining whether the collective operation is root-based; if the collective operation is not root-based: establishing a tuning session and executing the collective operation in the tuning session; if the collective operation is root-based, determining whether all compute nodes executing the application identified the collective operation at the same call site; if all compute nodes identified the collective operation at the same call site, establishing a tuning session and executing the collective operation in the tuning session; and if all compute nodes executing the application did not identify the collective operation at the same call site, executing the collective operation without establishing a tuning session. | 03-14-2013 |
20130073603 | SEND-SIDE MATCHING OF DATA COMMUNICATIONS MESSAGES - Send-side matching of data communications messages in a distributed computing system comprising a plurality of compute nodes, including: issuing by a receiving node to source nodes a receive message that specifies receipt of a single message to be sent from any source node, the receive message including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer; matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes; operating by one of the source nodes having a matching send message the mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the mutual exclusion device; and sending to the receiving node from the source node operating the mutual exclusion device a matched pending message. | 03-21-2013 |
20130073733 | BALANCING A DATA PROCESSING LOAD AMONG A PLURALITY OF COMPUTE NODES IN A PARALLEL COMPUTER - Methods, apparatus, and products are disclosed for balancing a data processing load among a plurality of compute nodes in a parallel computer that include: partitioning application data for processing on the plurality of compute nodes into data chunks; receiving, by each compute node, at least one of the data chunks for processing; estimating, by each compute node, processing time involved in processing the data chunks received by that compute node for processing; and redistributing, by at least one of the compute nodes to at least one of the other compute nodes, a portion of the data chunks received by that compute node in dependence upon the processing time estimated by that compute node. | 03-21-2013 |
20130073832 | PERFORMING A DETERMINISTIC REDUCTION OPERATION IN A PARALLEL COMPUTER - A parallel computer that includes compute nodes having computer processors and a CAU (Collectives Acceleration Unit) that couples processors to one another for data communications. In embodiments of the present invention, deterministic reduction operation include: organizing processors of the parallel computer and a CAU into a branched tree topology, where the CAU is a root of the branched tree topology and the processors are children of the root CAU; establishing a receive buffer that includes receive elements associated with processors and configured to store the associated processor's contribution data; receiving, in any order from the processors, each processor's contribution data; tracking receipt of each processor's contribution data; and reducing, the contribution data in a predefined order, only after receipt of contribution data from all processors in the branched tree topology. | 03-21-2013 |
20130074097 | ENDPOINT-BASED PARALLEL DATA PROCESSING WITH NON-BLOCKING COLLECTIVE INSTRUCTIONS IN A PARALLEL ACTIVE MESSAGING INTERFACE OF A PARALLEL COMPUTER - Endpoint-based parallel data processing with non-blocking collective instructions in a parallel active messaging interface (‘PAMI’) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes coupled for data communications through the PAMI, including establishing by the parallel application a data communications geometry, the geometry specifying a set of endpoints that are used in collective operations of the PAMI, including associating with the geometry a list of collective algorithms valid for use with the endpoints of the geometry; registering in each endpoint in the geometry a dispatch callback function for a collective operation; and executing without blocking, through a single one of the endpoints in the geometry, an instruction for the collective operation. | 03-21-2013 |
20130074098 | PROCESSING DATA COMMUNICATIONS EVENTS IN A PARALLEL ACTIVE MESSAGING INTERFACE OF A PARALLEL COMPUTER - Processing data communications events in a parallel active messaging interface (‘PAMI’) of a parallel computer that includes compute nodes that execute a parallel application, with the PAMI including data communications endpoints, and the endpoints are coupled for data communications through the PAMI and through other data communications resources, including determining by an advance function that there are no actionable data communications events pending for its context, placing by the advance function its thread of execution into a wait state, waiting for a subsequent data communications event for the context; responsive to occurrence of a subsequent data communications event for the context, awakening by the thread from the wait state; and processing by the advance function the subsequent data communications event now pending for the context. | 03-21-2013 |
20130080563 | EFFECTING HARDWARE ACCELERATION OF BROADCAST OPERATIONS IN A PARALLEL COMPUTER - Compute nodes of a parallel computer organized for collective operations via a network, each compute node having a receive buffer and establishing a topology for the network; selecting a schedule for a broadcast operation; depositing, by a root node of the topology, broadcast data in a target node's receive buffer, including performing a DMA operation with a well-known memory location for the target node's receive buffer; depositing, by the root node in a memory region designated for storing broadcast data length, a length of the broadcast data, including performing a DMA operation with a well-known memory location of the broadcast data length memory region; and triggering, by the root node, the target node to perform a next DMA operation, including depositing, in a memory region designated for receiving injection instructions for the target node, an instruction to inject the broadcast data into the receive buffer of a subsequent target node. | 03-28-2013 |
20130081059 | DATA COMMUNICATIONS IN A PARALLEL ACTIVE MESSAGING INTERFACE OF A PARALLEL COMPUTER - Data communications in a parallel active messaging interface (‘PAMI’) of a parallel computer, the parallel computer including a plurality of compute nodes that execute a parallel application, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes and the endpoints coupled for data communications through the PAMI and through data communications resources, including receiving in an origin endpoint of the PAMI a data communications instruction, the instruction characterized by an instruction type, the instruction specifying a transmission of transfer data from the origin endpoint to a target endpoint and transmitting, in accordance with the instruction type, the transfer data from the origin endpoint to the target endpoint. | 03-28-2013 |
20130086358 | COLLECTIVE OPERATION PROTOCOL SELECTION IN A PARALLEL COMPUTER - Collective operation protocol selection in a parallel computer that includes compute nodes may be carried out by calling a collective operation with operating parameters; selecting a protocol for executing the operation and executing the operation with the selected protocol. Selecting a protocol includes: iteratively, until a prospective protocol meets predetermined performance criteria: providing, to a protocol performance function for the prospective protocol, the operating parameters; determining whether the prospective protocol meets predefined performance criteria by evaluating a predefined performance fit equation, calculating a measure of performance of the protocol for the operating parameters; determining that the prospective protocol meets predetermined performance criteria and selecting the protocol for executing the operation only if the calculated measure of performance is greater than a predefined minimum performance threshold. | 04-04-2013 |
20130091510 | DATA COMMUNICATIONS IN A PARALLEL ACTIVE MESSAGING INTERFACE OF A PARALLEL COMPUTER - Data communications in a parallel active messaging interface (‘PAMI’) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI and through data communications resources, including receiving in an origin endpoint of the PAMI a SEND instruction, the SEND instruction specifying a transmission of transfer data from the origin endpoint to a first target endpoint; transmitting from the origin endpoint to the first target endpoint a Request-To-Send (‘RTS’) message advising the first target endpoint of the location and size of the transfer data; assigning by the first target endpoint to each of a plurality of target endpoints separate portions of the transfer data; and receiving by the plurality of target endpoints the transfer data. | 04-11-2013 |
20130097404 | DATA COMMUNICATIONS IN A PARALLEL ACTIVE MESSAGING INTERFACE OF A PARALLEL COMPUTER - Eager send data communications in a parallel active messaging interface (‘PAMI’) of a parallel computer, the PAMI composed of data communications endpoints that specify a client, a context, and a task, including receiving an eager send data communications instruction with transfer data disposed in a send buffer characterized by a read/write send buffer memory address in a read/write virtual address space of the origin endpoint; determining for the send buffer a read-only send buffer memory address in a read-only virtual address space, the read-only virtual address space shared by both the origin endpoint and the target endpoint, with all frames of physical memory mapped to pages of virtual memory in the read-only virtual address space; and communicating by the origin endpoint to the target endpoint an eager send message header that includes the read-only send buffer memory address. | 04-18-2013 |
20130111482 | ESTABLISHING A GROUP OF ENDPOINTS IN A PARALLEL COMPUTER | 05-02-2013 |
20130111496 | PERFORMING A LOCAL BARRIER OPERATION | 05-02-2013 |
20130124666 | MANAGING INTERNODE DATA COMMUNICATIONS FOR AN UNINITIALIZED PROCESS IN A PARALLEL COMPUTER - A parallel computer includes nodes, each having main memory and a messaging unit (MU). Each MU includes computer memory, which in turn includes, MU message buffers. Each MU message buffer is associated with an uninitialized process on the compute node. In the parallel computer, managing internode data communications for an uninitialized process includes: receiving, by an MU of a compute node, one or more data communications messages in an MU message buffer associated with an uninitialized process on the compute node; determining, by an application agent, that the MU message buffer associated with the uninitialized process is full prior to initialization of the uninitialized process; establishing, by the application agent, a temporary message buffer for the uninitialized process in main computer memory; and moving, by the application agent, data communications messages from the MU message buffer associated with the uninitialized process to the temporary message buffer in main computer memory. | 05-16-2013 |
20130125135 | INTRANODE DATA COMMUNICATIONS IN A PARALLEL COMPUTER - Intranode data communications in a parallel computer that includes compute nodes configured to execute processes, where the data communications include: allocating, upon initialization of a first process of a compute node, a region of shared memory; establishing, by the first process, a predefined number of message buffers, each message buffer associated with a process to be initialized on the compute node; sending, to a second process on the same compute node, a data communications message without determining whether the second process has been initialized, including storing the data communications message in the message buffer of the second process; and upon initialization of the second process: retrieving, by the second process, a pointer to the second process's message buffer; and retrieving, by the second process from the second process's message buffer in dependence upon the pointer, the data communications message sent by the first process. | 05-16-2013 |
20130125140 | INTRANODE DATA COMMUNICATIONS IN A PARALLEL COMPUTER - Internode data communications in a parallel computer that includes compute nodes that each include main memory and a messaging unit, the messaging unit including computer memory and coupling compute nodes for data communications, in which, for each compute node at compute node boot time: a messaging unit allocates, in the messaging unit's computer memory, a predefined number of message buffers, each message buffer associated with a process to be initialized on the compute node; receives, prior to initialization of a particular process on the compute node, a data communications message intended for the particular process; and stores the data communications message in the message buffer associated with the particular process. Upon initialization of the particular process, the process establishes a messaging buffer in main memory of the compute node and copies the data communications message from the message buffer of the messaging unit into the message buffer of main memory. | 05-16-2013 |
20130160025 | RUNTIME OPTIMIZATION OF AN APPLICATION EXECUTING ON A PARALLEL COMPUTER - Identifying a collective operation within an application executing on a parallel computer; identifying a call site of the collective operation; determining whether the collective operation is root-based; if the collective operation is not root-based: establishing a tuning session and executing the collective operation in the tuning session; if the collective operation is root-based, determining whether all compute nodes executing the application identified the collective operation at the same call site; if all compute nodes identified the collective operation at the same call site, establishing a tuning session and executing the collective operation in the tuning session; and if all compute nodes executing the application did not identify the collective operation at the same call site, executing the collective operation without establishing a tuning session. | 06-20-2013 |
20130173675 | PERFORMING A GLOBAL BARRIER OPERATION IN A PARALLEL COMPUTER - Performing a global barrier operation in a parallel computer that includes compute nodes coupled for data communications, where each compute node executes tasks, with one task on each compute node designated as a master task, including: for each task on each compute node until all master tasks have joined a global barrier: determining whether the task is a master task; if the task is not a master task, joining a single local barrier; if the task is a master task, joining the global barrier and the single local barrier only after all other tasks on the compute node have joined the single local barrier. | 07-04-2013 |
20130179620 | Administering Connection Identifiers For Collective Operations In A Parallel Computer - Administering connection identifiers for collective operations in a parallel computer, including prior to calling a collective operation, determining, by a first compute node of a communicator to receive an instruction to execute the collective operation, whether a value stored in a global connection identifier utilization buffer exceeds a predetermined threshold; if the value stored in the global ConnID utilization buffer does not exceed the predetermined threshold: calling the collective operation with a next available ConnID including retrieving, from an element of a ConnID buffer, the next available ConnID and locking the element of the ConnID buffer from access by other compute nodes; and if the value stored in the global ConnID utilization buffer exceeds the predetermined threshold: repeatedly determining whether the value stored in the global ConnID utilization buffer exceeds the predetermined threshold until the value stored in the global ConnID utilization buffer does not exceed the predetermined threshold. | 07-11-2013 |
20130179897 | Thread Selection During Context Switching On A Plurality Of Compute Nodes - Methods, apparatus, and products are disclosed for thread selection during context switching on a plurality of compute nodes that includes: executing, by a compute node, an application using a plurality of threads of execution, including executing one or more of the threads of execution; selecting, by the compute node from a plurality of available threads of execution for the application, a next thread of execution in dependence upon power characteristics for each of the available threads; determining, by the compute node, whether criteria for a thread context switch are satisfied; and performing, by the compute node, the thread context switch if the criteria for a thread context switch are satisfied, including executing the next thread of execution. | 07-11-2013 |
20130212561 | DEVELOPING COLLECTIVE OPERATIONS FOR A PARALLEL COMPUTER - Developing collective operations for a parallel computer that includes compute nodes includes: presenting, by a collective development tool, a graphical user interface (‘GUI’) to a collective developer; receiving, by the collective development tool from the collective developer through the GUI, a selection of one or more collective primitives; receiving, by the collective development tool from the collective developer through the GUI, a specification of a serial order of the collective primitives and a specification of input and output buffers for each collective primitive; and generating, by the collective development tool in dependence upon the selection of collective primitives, the serial order of the collective primitives, and the input and output buffers for each collective primitive, executable code that carries out the collective operation specified by the collective primitives. | 08-15-2013 |
20130290673 | PERFORMING A DETERMINISTIC REDUCTION OPERATION IN A PARALLEL COMPUTER - Performing a deterministic reduction operation in a parallel computer that includes compute nodes, each of which includes computer processors and a CAU (Collectives Acceleration Unit) that couples computer processors to one another for data communications, including organizing processors and a CAU into a branched tree topology in which the CAU is a root and the processors are children; receiving, from each of the processors in any order, dummy contribution data, where each processor is restricted from sending any other data to the root CAU prior to receiving an acknowledgement of receipt from the root CAU; sending, by the root CAU to the processors in the branched tree topology, in a predefined order, acknowledgements of receipt of the dummy contribution data; receiving, by the root CAU from the processors in the predefined order, the processors' contribution data to the reduction operation; and reducing, by the root CAU, the processors' contribution data. | 10-31-2013 |
20130312011 | PROCESSING POSTED RECEIVE COMMANDS IN A PARALLEL COMPUTER - Processing posted receive commands in a parallel computer, including: posting, by a parallel process of a compute node, a receive command, the receive command including a set of parameters excluding the receive command from being directed among parallel posted receive queues; flattening the parallel unexpected message queues into a single unexpected message queue; determining whether the posted receive command is satisfied by an entry in the single unexpected message queue; if the posted receive command is satisfied by an entry in the single unexpected message queue, processing the posted receive command; if the posted receive command is not satisfied by an entry in the single unexpected message queue: flattening the parallel posted receive queues into a single posted receive queue; and storing the posted receive command in the single posted receive queue. | 11-21-2013 |
20140047450 | Utilizing A Kernel Administration Hardware Thread Of A Multi-Threaded, Multi-Core Compute Node Of A Parallel Computer - Methods, apparatuses, and computer program products for utilizing a kernel administration hardware thread of a multi-threaded, multi-core compute node of a parallel computer are provided. Embodiments include a kernel assigning a memory space of a hardware thread of an application processing core to a kernel administration hardware thread of a kernel processing core. A kernel administration hardware thread is configured to advance the hardware thread to a next memory space associated with the hardware thread in response to the assignment of the kernel administration hardware thread to the memory space of the hardware thread. Embodiments also include the kernel administration hardware thread executing an instruction within the assigned memory space. | 02-13-2014 |
20140047451 | Optimizing Collective Communications Within A Parallel Computer - Methods, apparatuses, and computer program products for optimizing collective communications within a parallel computer comprising a plurality of hardware threads for executing software threads of a parallel application are provided. Embodiments include a processor of a parallel computer determining for each software thread, an affinity of the software thread to a particular hardware thread. Each affinity indicates an assignment of a software thread to a particular hardware thread. The processor also generates one or more affinity domains based on the affinities of the software threads. Embodiments also include a processor generating, for each affinity domain, a topology of the affinity domain based on the affinities of the software threads to the hardware threads. According to embodiments of the present application, a processor also performs, based on the generated topologies of the affinity domains, a collective operation on one or more software threads. | 02-13-2014 |
20140164592 | DETERMINING A SYSTEM CONFIGURATION FOR PERFORMING A COLLECTIVE OPERATION ON A PARALLEL COMPUTER - Determining a system configuration for performing a collective operation on a parallel computer that includes a plurality of compute nodes, the compute nodes coupled for data communications over a data communications network, including: selecting a system configuration on the parallel computer for executing the collective operation; executing the collective operation on the selected system configuration on the parallel computer; determining performance metrics associated with executing the collective operation on the selected system configuration on the parallel computer; selecting, using a simulated annealing algorithm, a plurality of test system configurations on the parallel computer for executing the collective operation, wherein the simulated annealing algorithm specifies a similarity threshold between a plurality of system configurations; executing, the collective operation on each of the test system configurations; and determining performance metrics associated with executing the collective operation on each of the test system configurations. | 06-12-2014 |
20140164600 | DETERMINING A SYSTEM CONFIGURATION FOR PERFORMING A COLLECTIVE OPERATION ON A PARALLEL COMPUTER - Determining a system configuration for performing a collective operation on a parallel computer that includes a plurality of compute nodes, the compute nodes coupled for data communications over a data communications network, including: selecting a system configuration on the parallel computer for executing the collective operation; executing the collective operation on the selected system configuration on the parallel computer; determining performance metrics associated with executing the collective operation on the selected system configuration on the parallel computer; selecting, using a simulated annealing algorithm, a plurality of test system configurations on the parallel computer for executing the collective operation, wherein the simulated annealing algorithm specifies a similarity threshold between a plurality of system configurations; executing, the collective operation on each of the test system configurations; and determining performance metrics associated with executing the collective operation on each of the test system configurations. | 06-12-2014 |
20140165075 | EXECUTING A COLLECTIVE OPERATION ALGORITHM IN A PARALLEL COMPUTER - Executing a collective operation algorithm in a parallel computer includes a compute node of an operational group determining a required number of participants for execution of a collective operation algorithm and determining a number of contributing nodes having data to participate in the algorithm. Embodiments also include the compute node calculating a number of ghost nodes to participate in the algorithm. According to embodiments of the present invention, the number of ghost nodes is the required number of participants minus the number of contributing nodes having data to participate. Embodiments also include the compute node selecting from a plurality of ghost nodes, the calculated number of ghost nodes for participation in the execution of the algorithm and executing the algorithm with both the selected ghost nodes and the contributing nodes. | 06-12-2014 |
20140165076 | EXECUTING A COLLECTIVE OPERATION ALGORITHM IN A PARALLEL COMPUTER - Executing a collective operation algorithm in a parallel computer includes a compute node of an operational group determining a required number of participants for execution of a collective operation algorithm and determining a number of contributing nodes having data to participate in the algorithm. Embodiments also include the compute node calculating a number of ghost nodes to participate in the algorithm. According to embodiments of the present invention, the number of ghost nodes is the required number of participants minus the number of contributing nodes having data to participate. Embodiments also include the compute node selecting from a plurality of ghost nodes, the calculated number of ghost nodes for participation in the execution of the algorithm and executing the algorithm with both the selected ghost nodes and the contributing nodes. | 06-12-2014 |
20140173201 | ACQUIRING REMOTE SHARED VARIABLE DIRECTORY INFORMATION IN A PARALLEL COMPUTER - Methods, parallel computers, and computer program products for acquiring remote shared variable directory (SVD) information in a parallel computer are provided. Embodiments include a runtime optimizer determining that a first thread of a first task requires shared resource data stored in a memory partition corresponding to a second thread of a second task. Embodiments also include the runtime optimizer requesting from the second thread, in response to determining that the first thread of the first task requires the shared resource data, SVD information associated with the shared resource data. Embodiments also include the runtime optimizer receiving from the second thread, the SVD information associated with the shared resource data. | 06-19-2014 |
20140173204 | ANALYZING UPDATE CONDITIONS FOR SHARED VARIABLE DIRECTORY INFORMATION IN A PARALLEL COMPUTER - Methods, parallel computers, and computer program products for analyzing update conditions for shared variable directory (SVD) information in a parallel computer are provided. Embodiments include a runtime optimizer receiving a compare-and-swap operation header. The compare-and-swap operation header includes an SVD key, a first SVD address, and an updated first SVD address. The first SVD address is associated with the SVD key in a first SVD associated with a first task. Embodiments also include the runtime optimizer retrieving from a remote address cache associated with the second task, a second SVD address indicating a location within a memory partition associated with the first SVD in response to receiving the compare-and-swap operation header. Embodiments also include the runtime optimizer determining whether the second SVD address matches the first SVD address and transmitting a result indicating whether the second SVD address matches the first SVD address. | 06-19-2014 |
20140173205 | ANALYZING UPDATE CONDITIONS FOR SHARED VARIABLE DIRECTORY INFORMATION IN A PARALLEL COMPUTER - Methods, parallel computers, and computer program products for analyzing update conditions for shared variable directory (SVD) information in a parallel computer are provided. Embodiments include a runtime optimizer receiving a compare-and-swap operation header. The compare-and-swap operation header includes an SVD key, a first SVD address, and an updated first SVD address. The first SVD address is associated with the SVD key in a first SVD associated with a first task. Embodiments also include the runtime optimizer retrieving from a remote address cache associated with the second task, a second SVD address indicating a location within a memory partition associated with the first SVD in response to receiving the compare-and-swap operation header. Embodiments also include the runtime optimizer determining whether the second SVD address matches the first SVD address and transmitting a result indicating whether the second SVD address matches the first SVD address. | 06-19-2014 |
20140173212 | ACQUIRING REMOTE SHARED VARIABLE DIRECTORY INFORMATION IN A PARALLEL COMPUTER - Methods, parallel computers, and computer program products for acquiring remote shared variable directory (SVD) information in a parallel computer are provided. Embodiments include a runtime optimizer determining that a first thread of a first task requires shared resource data stored in a memory partition corresponding to a second thread of a second task. Embodiments also include the runtime optimizer requesting from the second thread, in response to determining that the first thread of the first task requires the shared resource data, SVD information associated with the shared resource data. Embodiments also include the runtime optimizer receiving from the second thread, the SVD information associated with the shared resource data. | 06-19-2014 |
20140173257 | REQUESTING SHARED VARIABLE DIRECTORY (SVD) INFORMATION FROM A PLURALITY OF THREADS IN A PARALLEL COMPUTER - Methods, parallel computers, and computer program products for requesting shared variable directory (SVD) information from a plurality of threads in a parallel computer are provided. Embodiments include a runtime optimizer detecting that a first thread requires a plurality of updated SVD information associated with shared resource data stored in a plurality of memory partitions. Embodiments also include a runtime optimizer broadcasting, in response to detecting that the first thread requires the updated SVD information, a gather operation message header to the plurality of threads. The gather operation message header indicates an SVD key corresponding to the required updated SVD information and a local address associated with the first thread to receive a plurality of updated SVD information associated with the SVD key. Embodiments also include the runtime optimizer receiving at the local address, the plurality of updated SVD information from the plurality of threads. | 06-19-2014 |
20140173604 | CONDITIONALLY UPDATING SHARED VARIABLE DIRECTORY (SVD) INFORMATION IN A PARALLEL COMPUTER - Methods, parallel computers, and computer program products for conditionally updating shared variable directory (SVD) information in a parallel computer are provided. Embodiments include a runtime optimizer receiving a broadcast reduction operation header. The broadcast reduction operation header includes an SVD key and a first SVD address. The first SVD address is associated with the SVD key in a first SVD associated with a first task. Embodiments also include the runtime optimizer retrieving from a remote address cache associated with the second task, a second SVD address indicating a location within a memory partition associated with the first SVD, in response to receiving the broadcast reduction operation header. Embodiments also include the runtime optimizer determining that the first SVD address does not match the second SVD address and updating the remote address cache with the first SVD address. | 06-19-2014 |
20140173615 | CONDITIONALLY UPDATING SHARED VARIABLE DIRECTORY (SVD) INFORMATION IN A PARALLEL COMPUTER - Methods, parallel computers, and computer program products for conditionally updating shared variable directory (SVD) information in a parallel computer are provided. Embodiments include a runtime optimizer receiving a broadcast reduction operation header. The broadcast reduction operation header includes an SVD key and a first SVD address. The first SVD address is associated with the SVD key in a first SVD associated with a first task. Embodiments also include the runtime optimizer retrieving from a remote address cache associated with the second task, a second SVD address indicating a location within a memory partition associated with the first SVD, in response to receiving the broadcast reduction operation header. Embodiments also include the runtime optimizer determining that the first SVD address does not match the second SVD address and updating the remote address cache with the first SVD address. | 06-19-2014 |
20140173626 | BROADCASTING SHARED VARIABLE DIRECTORY (SVD) INFORMATION IN A PARALLEL COMPUTER - Methods, parallel computers, and computer program products for broadcasting shared variable directory (SVD) information in a parallel computer are provided. Embodiments include a runtime optimizer detecting, by a runtime optimizer of the parallel computer, a change in SVD information within an SVD associated with a first thread. Embodiments also include a runtime optimizer identifying a plurality of threads requiring notification of the change in the SVD information. Embodiments also include the runtime optimizer in response to detecting the change in the SVD information, broadcasting to each thread of the identified plurality of threads, a broadcast message header and update data indicating the change in the SVD information. | 06-19-2014 |
20140173627 | REQUESTING SHARED VARIABLE DIRECTORY (SVD) INFORMATION FROM A PLURALITY OF THREADS IN A PARALLEL COMPUTER - Methods, parallel computers, and computer program products for requesting shared variable directory (SVD) information from a plurality of threads in a parallel computer are provided. Embodiments include a runtime optimizer detecting that a first thread requires a plurality of updated SVD information associated with shared resource data stored in a plurality of memory partitions. Embodiments also include a runtime optimizer broadcasting, in response to detecting that the first thread requires the updated SVD information, a gather operation message header to the plurality of threads. The gather operation message header indicates an SVD key corresponding to the required updated SVD information and a local address associated with the first thread to receive a plurality of updated SVD information associated with the SVD key. Embodiments also include the runtime optimizer receiving at the local address, the plurality of updated SVD information from the plurality of threads. | 06-19-2014 |
20140173629 | BROADCASTING SHARED VARIABLE DIRECTORY (SVD) INFORMATION IN A PARALLEL COMPUTER - Methods, parallel computers, and computer program products for broadcasting shared variable directory (SVD) information in a parallel computer are provided. Embodiments include a runtime optimizer detecting, by a runtime optimizer of the parallel computer, a change in SVD information within an SVD associated with a first thread. Embodiments also include a runtime optimizer identifying a plurality of threads requiring notification of the change in the SVD information. Embodiments also include the runtime optimizer in response to detecting the change in the SVD information, broadcasting to each thread of the identified plurality of threads, a broadcast message header and update data indicating the change in the SVD information. | 06-19-2014 |
20140192652 | TOKEN-BASED FLOW CONTROL OF MESSAGES IN A PARALLEL COMPUTER - Token-based flow control of messages in a parallel computer, the parallel computer including a plurality of compute nodes, each compute node including one or more computer processors, including: allocating, by a token administration module to a plurality of the computer processors in the parallel computer, a number of data communications tokens; identifying all communicators executing on each computer processor, where each communicator is participating in a distinct parallel operation executing on the parallel computer; allocating, to the communicators, the data communications tokens; determining, by a communicator attempting to send data to the destination, whether the communicator has enough available data communications tokens to send the data to the destination; and responsive to determining that the communicator has enough available data communications tokens to send the data, sending, by the communicator, the data to the destination. | 07-10-2014 |
20140195688 | TOKEN-BASED FLOW CONTROL OF MESSAGES IN A PARALLEL COMPUTER - Token-based flow control of messages in a parallel computer, the parallel computer including a plurality of compute nodes, each compute node including one or more computer processors, including: allocating, by a token administration module to a plurality of the computer processors in the parallel computer, a number of data communications tokens; identifying all communicators executing on each computer processor, where each communicator is participating in a distinct parallel operation executing on the parallel computer; allocating, to the communicators, the data communications tokens; determining, by a communicator attempting to send data to the destination, whether the communicator has enough available data communications tokens to send the data to the destination; and responsive to determining that the communicator has enough available data communications tokens to send the data, sending, by the communicator, the data to the destination. | 07-10-2014 |
20140244974 | Background Collective Operation Management In A Parallel Computer - Background collective operation management in a parallel computer, the parallel computer including one or more compute nodes operatively coupled for data communications over one or more data communications networks, including: determining, by a management availability module, whether a compute node in the parallel computer is available to perform a background collective operation management task; responsive to determining that the compute node is available to perform the background collective operation management task, determining, by the management availability module, whether the compute node has access to sufficient resources to perform the background collective operation management task; and responsive to determining that the compute node has access to sufficient resources to perform the background collective operation management task, initiating, by the management availability module, execution of the background collective operation management task. | 08-28-2014 |
20140245316 | Background Collective Operation Management In A Parallel Computer - Background collective operation management in a parallel computer, the parallel computer including one or more compute nodes operatively coupled for data communications over one or more data communications networks, including: determining, by a management availability module, whether a compute node in the parallel computer is available to perform a background collective operation management task; responsive to determining that the compute node is available to perform the background collective operation management task, determining, by the management availability module, whether the compute node has access to sufficient resources to perform the background collective operation management task; and responsive to determining that the compute node has access to sufficient resources to perform the background collective operation management task, initiating, by the management availability module, execution of the background collective operation management task. | 08-28-2014 |
20140258417 | Collective Operation Management In A Parallel Computer - Methods, apparatuses, and computer program products for collective operation management in a parallel computer are provided. Embodiments include a parallel computer having a first compute node operatively coupled for data communications over a tree data communications network with a plurality of child compute nodes. Embodiments also include each child compute node performing a first collective operation. The first compute rode, for each child compute node, receives from the child compute node, a result of the first collective operation performed by the child compute node. For each result received from a child compute node, the first compute node stores a timestamp indicating a time that the child compute node completed the first collective operation. The first compute node also manages, based on the stored timestamps, execution of a second collective operation over the tree data communications network. | 09-11-2014 |
20140258538 | Collective Operation Management In A Parallel Computer - Methods, apparatuses, and computer program products for collective operation management in a parallel computer are provided. Embodiments include a parallel computer having a first compute node operatively coupled for data communications over a tree data communications network with a plurality of child compute nodes. Embodiments also include each child compute node performing a first collective operation. The first compute rode, for each child compute node, receives from the child compute node, a result of the first collective operation performed by the child compute node. For each result received from a child compute node, the first compute node stores a timestamp indicating a time that the child compute node completed the first collective operation. The first compute node also manages, based on the stored timestamps, execution of a second collective operation over the tree data communications network. | 09-11-2014 |
20140258746 | Collective Operation Management In A Parallel Computer - Methods, apparatuses, and computer program products for collective operation management in a parallel computer are provided. Embodiments include a parallel computer having a first compute node operatively coupled for data communications over a tree data communications network with a plurality of child compute nodes. Embodiments also include each child compute node performing a first collective operation. The first compute rode, for each child compute node, receives from the child compute node, a result of the first collective operation performed by the child compute node. In response to receiving at least one result, the first compute node reduces a power consumption level of the child compute node. | 09-11-2014 |
20140258748 | Collective Operation Management In A Parallel Computer - Methods, apparatuses, and computer program products for collective operation management in a parallel computer are provided. Embodiments include a parallel computer having a first compute node operatively coupled for data communications over a tree data communications network with a plurality of child compute nodes. Embodiments also include each child compute node performing a first collective operation. The first compute rode, for each child compute node, receives from the child compute node, a result of the first collective operation performed by the child compute node. In response to receiving at least one result, the first compute node reduces a power consumption level of the child compute node. | 09-11-2014 |
20140280601 | Collective Operation Management In A Parallel Computer - Methods, apparatuses, and computer program products for collective operation management in a parallel computer are provided. Embodiments include a parallel computer having a plurality of compute nodes coupled for data communications over a data communications network. Embodiments include a first compute node entering a collective operation. Each compute node of the plurality of compute nodes is associated with the collective operation. In response to entering the collective operation, the first compute node decreases power consumption of the first compute node. | 09-18-2014 |
20140280820 | Collective Operation Management In A Parallel Computer - Methods, apparatuses, and computer program products for collective operation management in a parallel computer are provided. Embodiments include a parallel computer having a plurality of compute nodes coupled for data communications over a data communications network. Embodiments include a first compute node entering a collective operation. Each compute node of the plurality of compute nodes is associated with the collective operation. In response to entering the collective operation, the first compute node decreases power consumption of the first compute node. | 09-18-2014 |
20140281723 | Algorithm Selection For Collective Operations In A Parallel Computer - Algorithm selection for collective operations in a parallel computer that includes a plurality of compute nodes may include: profiling a plurality of algorithms for each of a set of collective operations, including for each collective operation: executing the operation a plurality times with each execution varying one or more of: geometry, message size, data type, and algorithm to effect the collective operation, thereby generating performance metrics for each execution; storing the performance metrics in a performance profile; at load time of a parallel application including a plurality of parallel processes configured in a particular geometry, filtering the performance profile in dependence upon the particular geometry; during run-time of the parallel application, selecting, for at least one collective operation, an algorithm to effect the operation in dependence upon characteristics of the parallel application and the performance profile; and executing the operation using the selected algorithm. | 09-18-2014 |
20140282429 | Algorithm Selection For Collective Operations In A Parallel Computer - Algorithm selection for collective operations in a parallel computer that includes a plurality of compute nodes may include: profiling a plurality of algorithms for each of a set of collective operations, including for each collective operation: executing the operation a plurality times with each execution varying one or more of: geometry, message size, data type, and algorithm to effect the collective operation, thereby generating performance metrics for each execution; storing the performance metrics in a performance profile; at load time of a parallel application including a plurality of parallel processes configured in a particular geometry, filtering the performance profile in dependence upon the particular geometry; during run-time of the parallel application, selecting, for at least one collective operation, an algorithm to effect the operation in dependence upon characteristics of the parallel application and the performance profile; and executing the operation using the selected algorithm. | 09-18-2014 |
Byron Smith, Memphis, TN US
Patent application number | Description | Published |
---|---|---|
20140081169 | SYSTEM AND METHOD OF TETHERLESS INSUFFLATION IN COLON CAPSULE ENDOSCOPY - A system and method of wireless controlled CO | 03-20-2014 |
Byron F. Smith, Memphis, TN US
Patent application number | Description | Published |
---|---|---|
20130324914 | SWALLOWABLE CAPSULE FOR INSUFFLATION OF GASTROINTESTINAL TRACT - A system for insufflating a body cavity comprising a swallowable capsule comprising a chamber ( | 12-05-2013 |
20150045725 | INSUFFLATION AND CO2 DELIVERY FOR MINIMALLY INVASIVE PROCEDURES - Systems and methods are described for providing carbon dioxide insufflation. The system includes a first chamber, a second chamber, and a mixing chamber. The first chamber contains an acid and the second chamber contains a base. The mixing chamber is configured to receive the acid from the first chamber and the base from the second chamber. The mixing chamber is also coupleable to an endoscope and configured to provide an amount of carbon dioxide generated by mixing the acid and the base to the endoscope. | 02-12-2015 |
Cary Smith, Brentwood, TN US
Patent application number | Description | Published |
---|---|---|
20130118937 | TOOTHBRUSH HOLDER - An apparatus for receiving a plurality of toothbrushes includes a plurality of toothbrush holders and a toothbrush holder organizer. Each toothbrush holder includes a base and a cover. The base has a top and a bottom and includes a cylindrical core and an outer wall. The cylindrical core defines a cavity and includes a top end and a bottom end. The top end of the cylindrical core is open. The outer wall has a bottom end coincident with the bottom of the base and a top end attached to the cylindrical core. The cover has a hole and is operable to engage the top end of the base and retain bristles of a toothbrush in the cavity defined by the cylindrical core while allowing a handle of the toothbrush to pass through the hole. The toothbrush holder organizer includes a plurality of receptacles, each operable to receive a toothbrush holder. | 05-16-2013 |
Charles M. Smith, Franklin, TN US
Patent application number | Description | Published |
---|---|---|
20110289170 | AUTOMATED SYSTEM AND METHOD FOR DELIVERY OF MESSAGES AND PROCESSING OF MESSAGE RESPONSES - An automated system for delivery of messages to multiple recipients, and for processing of responses to the messages, includes a message client, message server, and a system database. A message is created using a universal message form. The message content can be translated into multiple formats and sent to one or more different recipients using one or more different types of messaging devices, including pagers, e-mail readers, telephones, cellular telephones, personal computers, fax machines, and voice mail systems. A recipient profile manager allows each recipient to select the messaging devices to be used for message delivery as well as preferred messaging schedules, priorities, and message security. Receipt of the messages by the recipients is verified, response requirements collected and consolidated from multiple sources and presented to the message originator in a structured format. | 11-24-2011 |
Christopher J. Smith, Hermitage, TN US
Patent application number | Description | Published |
---|---|---|
20110132348 | GLIDE RACK - A rack for an appliance includes a main section having a support frame, and at least one arm coupled to the support frame. The arm is movable relative to the support frame between a first position and a second position. The rack further includes a release member operatively connected to the at least one arm, actuation of the release member causing the at least one arm to move from the first position to the second position. In one example, the rack includes pair of arms coupled to the support frame. In another example, actuation of the release member causes both of the arms to move to the second position. | 06-09-2011 |
20140086695 | PROCESSES AND APPARATUSES FOR MAKING CUTTING TOOL INSERTS - A process for the production of cutting tool inserts is described. A bottom punch is positioned into a powder compaction mold. A metallurgical powder is introduced into a mold cavity. A top punch is positioned into the powder compaction mold in an orientation opposed to the bottom punch. The metallurgical powder is compressed between the bottom punch and the top punch to form a powder compact. Also disclosed are cutting tool inserts produced in accordance with the process and powder pressing apparatuses for the production of cutting tool inserts. | 03-27-2014 |
Christopher W. Smith, Lexington, TN US
Patent application number | Description | Published |
---|---|---|
20080201913 | ASSEMBLY FOR ATTACHING A CLAMP TO A HOSE - Disclosed is a cover bracket for holding a clamp having a screw housing in place on a hose without contaminating the screw housing with adhesive. The cover bracket includes a cover portion configured to receive a screw housing and a first runner and a second runner connected to one another by the cover portion. Each of the first and second runners includes a hose contacting surface and the first runner includes a channel in the hose contacting surface. The channel including an aperture extending through the first runner to an exterior of the first runner. Also disclosed is a method for attaching the cover bracket to the hose having the clamp thereon. | 08-28-2008 |
Chuck Smith, Gallatin, TN US
Patent application number | Description | Published |
---|---|---|
20100087282 | Baseball bat with multiple reinforcing beams - A bat for limiting the maximum barrel response at high impact speeds while minimizing the dampening performance at low impact speeds includes a plurality of separate longitudinal beams extending from the end of the bat to the tapered portion of the bat. These beams, as well as the tapered portion and a handle, are constructed from a composite material, such as fiber reinforced plastic. An external sleeve is then provided around the barrel portion of the bat. The external sleeve is secured around the barrel of the bat using a snap-fit end cap. | 04-08-2010 |
20110183788 | Baseball bat employing a dual density foam material - A non-wood baseball or softball bat wherein the barrel portion of the bat is filled with an inner foam layer which has a relatively low compressibility surrounded by an outer foam layer having high compressibility. This configuration would not hinder the hitting performance of less skilled players in an effort to control the maximum rebound speed generated by the best players. | 07-28-2011 |
20120046137 | BASEBALL BAT EMPLOYING A DUAL DENSITY FOAM MATERIAL - A non-wood baseball or softball bat wherein the barrel portion of the bat is filled with an inner foam layer which has a relatively low compressibility surrounded by an outer foam layer having high compressibility. This configuration would not hinder the hitting performance of less skilled players in an effort to control the maximum rebound speed generated by the best players. | 02-23-2012 |
Clarence Smith, Belvidere, TN US
Patent application number | Description | Published |
---|---|---|
20150028668 | Modular Vehicle Unit - An apparatus, modular devices, and methods are disclosed. One method comprises receiving electric power at a modular device from a vehicle battery, wherein the modular device has a housing and a circuit protection block accessible through a first opening in the housing; and transmitting the received electric power to one or more external devices via one or more of a plurality of ports accessible through a plurality of second openings formed in the housing. | 01-29-2015 |
Clyde M. Smith, Nashville, TN US
Patent application number | Description | Published |
---|---|---|
20080314452 | Systems and methods for supplying and/or dispensing fluid - A system for supplying at least two fluids in proportioned quantities may include a first and second intake passages configured to be in flow communication with sources of first and second fluids, respectively. The system may include a fluid transfer device in flow communication with the first intake passage and the second intake passage, and a pump in flow communication with the first intake passage. Operation of the pump is configured to supply a quantity of the first fluid to a first chamber of the fluid transfer device such that a quantity of the second fluid is expelled from a second chamber of the fluid transfer device. When operation of the pump is ceased, a quantity of the second fluid enters the second chamber and a quantity of the first fluid is expelled from the first chamber. | 12-25-2008 |
20120111888 | FLUID DISPENSING SYSTEM WITH THERMAL CONTROL - A system for dispensing fluid may include a first fluid circuit and second fluid circuit. The first fluid circuit may include a first reservoir configured to contain a supply of first fluid for being dispensed and a first variable volume chamber in flow communication with the first fluid circuit. The second fluid circuit may be configured to provide pressure for dispensing the first fluid. The second fluid circuit may include a second reservoir, a pump, fluid passages configured to provide fluid flow within the second fluid circuit, and a second variable volume chamber in flow communication with the second fluid circuit. The second fluid circuit may be a closed-loop circuit, and the first variable volume chamber and the second variable volume chamber are associated with one another, such that flow of fluid in the second circuit controls dispensing and temperature of the first fluid in the first fluid circuit. | 05-10-2012 |
Clyde Meriwether Smith, Nashville, TN US
Patent application number | Description | Published |
---|---|---|
20090194604 | Pulsed spray system of reduced power consumption - A system for spraying fluids at variable flow rate using pulse width modulation utilizing a circuit including a reservoir, pump, spray nozzle, pulse width modulated valve. While no spray issues from a nozzle, the fluid circuit is closed with the reservoir as the initial and end point of the circuit. While no spray issues from a nozzle, the fluid flow through a heated nozzle functions as a heat sink. While spray issues from a nozzle, the circuit contains a means to maintain a specific fluid pressure. While no spray issues from a nozzle, the circuit pressure is much lower than the spray pressure allowing reduced energy consumption and lessening wear on the pump and motor. This system may be incorporated into a selective catalytic reduction (SCR) system for controlling NOX emissions from diesel engines using a urea-water solution as a fluid. | 08-06-2009 |
Danny R. Smith, Chattanooga, TN US
Patent application number | Description | Published |
---|---|---|
20100183816 | LOW VELOCITY OXYGEN-FUELED FLAME SPRAY METHOD AND APPARATUS FOR MAKING FERRITE MATERIAL PRODUCTS AND PRODUCTS PRODUCED THEREBY - A method for making ferrite powder may include providing ferrite feed materials in a form of particles, such as having different sizes and irregular shapes. The method may further include exposing the ferrite feed materials to a low velocity oxygen-fueled (LVOF) flame spray. This may provide a more spherical shape to irregularly shaped particles to thereby make the ferrite powder. An apparatus for making ferrite powder may include a feeder for ferrite feed materials and a LVOF flame spray system for exposing the ferrite feed materials to the flame spray. | 07-22-2010 |
Darrin E. Smith, Greeneville, TN US
Patent application number | Description | Published |
---|---|---|
20090004956 | HONING JIG - The honing jig has a base on which a whetstone or other abrasive substance is mounted. A pair of spaced guide rods extends the length of the base. A carriage is mounted to tubes which slide along the rods and through which the guide rods extend. The blade to be sharpened is held to the carriage by a clamp and the clamp swivels on the carriage to allow the inclination of the blade relative to the whetstone to be adjusted. The angle of the guide rods can be adjusted to permit fine adjustment of the inclination of the blade. | 01-01-2009 |
David Barton Smith, Oak Ridge, TN US
Patent application number | Description | Published |
---|---|---|
20120255599 | NANOCONE-BASED PHOTOVOLTAIC SOLAR CELLS - A photovoltaic structure including a nanocone-based three-dimensional interdigitated p-n junction is provided in the present invention. The three-dimensional p-n junction is at the interface between n-type oxide semiconductor nanocones and a p-type semiconductor material that functions as a matrix embedding the nanocones. The nanocone-based three-dimensional p-n junction allows efficient minority carriers being extracted from photo-absorber and crossing across the p-n junction, and generates completely-depleted regions throughout the nanocones and the matrix around the nanocones for efficient charge collection. Further, the bandgap energies of the p-doped semiconductor material can be tuned to match the solar light spectrum by mixing related elements. Further, the high temperature pulses can be used to remove defects in the junction interfaces and sintering nanoparticle matrix. | 10-11-2012 |
David Myron Smith, Burns, TN US
Patent application number | Description | Published |
---|---|---|
20100121287 | WOUND CARE SYSTEM - Disclosed is an apparatus for the treatment of a wound on a patient. The apparatus is capable of administering localized negative pressure therapy to the wound using a negative pressure source and a drain line for removing exudate from the wound. The apparatus is also capable of administering localized hyperbaric fluid therapy to the wound using a fluid source and a supply line for supplying fluid to the wound. | 05-13-2010 |
David S. Smith, Nashville, TN US
Patent application number | Description | Published |
---|---|---|
20130236075 | AUTOMATIC DETECTION AND CORRECTION OF MAGNETIC RESONANCE IMAGING DATA - Systems and methods for processing magnetic resonance imaging (MRI) data are provided. A method includes receiving MRI data comprising a plurality of k-space points and deriving a plurality of image data sets based on the MRI data, each of the plurality of MRI image sets obtained by zeroing a different one of the plurality of k-space points. The method further includes computing image space metric values for each of the plurality of image data sets and adjusting a portion of the MRI data associated with ones of the image space metric values that fail to meet a threshold value to yield adjusted MRI data. | 09-12-2013 |
Dean Preston Smith, Knoxville, TN US
Patent application number | Description | Published |
---|---|---|
20090021382 | Wetness Detection Device - The teachings herein are directed to devices for detecting and signaling the presence of urine or another electrically conducive liquid in an undergarment, fabric, or other thin material. Preferred devices include a clip configured to safely and releasably secure a liquid detecting sensor to a fabric or undergarment, wherein said sensor is operably coupled to a detection device that emits a notification signal when liquid is present in the fabric. | 01-22-2009 |
20130167296 | ASSEMBLIES FOR MANAGING INCONTINENCE - Bedding assemblies useful in the management of incontinence are provided herein. Preferred bedding assemblies include a top wicking layer, an electrical circuit configured to detect the presence of moisture, an absorbent layer, and a waterproof layer. Assemblies are configured to signal to a receiving device which in turn can communicate an alarm signal or be operably coupled with a notification device. Assemblies can include mattress overlays, mattress covers, and mattresses. | 07-04-2013 |
Donnie Smith, Andersonville, TN US
Patent application number | Description | Published |
---|---|---|
20130312729 | HOME APPLIANCE WITH UNDISTORTED FRONT PANEL CURVATURE - A home appliance including an appliance body having an internal framework; a metal panel covering a portion of the internal framework, the panel having a curved portion turned through the curve inwardly toward an interior of the appliance, wherein the panel surface adjacent the curve is substantially smooth and substantially undistorted, the panel being fabricated by engaging a metal sheet with a bender assembly, holding the metal sheet against translational movement, and applying pressure to the metal sheet using a punch having a curved head and being operatively associated with the bender assembly, the pressure being applied by moving the punch against the metal sheet using a damped punch driver operatively associated with the bender assembly. | 11-28-2013 |
20140263276 | SPRING CLIP ATTACHMENT FOR A SURFACE COOKING MODULE OF A HOUSEHOLD COOKING APPLIANCE - A surface cooking module for a household cooking appliance is provided in which the surface cooking module includes a frame having a front end and a rear end, a front fixation bracket on the front end of the frame, the front fixation bracket for engaging a corresponding first fixation element in a chassis of the household cooking appliance and enabling the frame to pivot about the front end of the frame when engaged with the first fixation element, and a spring clip coupled to the rear end of the frame, the rear end of the frame being opposite the front end of the frame, the spring clip for engaging a second fixation element in the chassis of the household cooking appliance when the cooking module is pivoted downward about the front end of the frame into a mounted position on the household cooking appliance. | 09-18-2014 |
20140373634 | MANOMETER QUICK CONNECT DEVICE FOR TESTING GAS PRESSURE OF A HOUSEHOLD COOKING APPLIANCE - A manometer quick connect device is provided for pressure testing a gas outlet of a household cooking appliance. The manometer quick connect device include a body having a first end and a second end opposite the first end, the body having a hollow cavity extending from the first end to the second end, wherein the first end of the body includes a feature for coupling the manometer quick connect device to a manometer, and a seal at the second end of the body, wherein the seal includes a sealing surface for sealing the hollow cavity of the body to a surface of the gas outlet, the seal including an opening for providing fluid communication between the hollow cavity and an orifice of the gas outlet. | 12-25-2014 |
Douglas W. Smith, Knoxville, TN US
Patent application number | Description | Published |
---|---|---|
20110090045 | LOCKABLE CONTAINER WITH TIME-CONTROLLED REMOTE CONTROL - Apparatus for limiting access to items only during pre-determined times, a lockable container system includes a lockable container assembly and a remote control unit. The remote control unit includes an input keypad, a display, a processor, and a transmitter. The lockable container assembly includes a receiver, a locking mechanism, and an indicator. The pre-determined time that the lockable container assembly is able to be unlocked is entered on the keypad. When the predetermined time arrives, the remote includes an operator that, when actuated, sends an unlock signal to the lockable container assembly. At other times, the lockable container assembly remains locked, thereby limiting access to its contents. In one embodiment, the container includes perforations that ensure the inside environment matches the environment outside the container. | 04-21-2011 |
20140043137 | Lockable Container with Time-Controlled Remote Control - Apparatus for limiting access to items only during pre-determined times, a lockable container system includes a lockable container assembly and a remote control unit. The remote control unit includes an input keypad, a display, a processor, and a transmitter. The lockable container assembly includes a receiver, a locking mechanism, and an indicator. The pre-determined time that the lockable container assembly is able to be unlocked is entered on the keypad. When the predetermined time arrives, the remote includes an operator that, when actuated, sends an unlock signal to the lockable container assembly. At other times, the lockable container assembly remains locked, thereby limiting access to its contents. In one embodiment, the container includes perforations that ensure the inside environment matches the environment outside the container. | 02-13-2014 |
Ernest Phillip Smith, Blountville, TN US
Patent application number | Description | Published |
---|---|---|
20140311694 | PAPER AND NONWOVEN ARTICLES COMPRISING SYNTHETIC MICROFIBER BINDERS - A paper or nonwoven article is provided comprising a nonwoven web layer, wherein the nonwoven web layer comprises a plurality of fibers and a plurality of binder microfibers, wherein the binder microfibers comprise a water non-dispersible, synthetic polymer; wherein the binder microfibers have a length of less than 25 millimeters and a fineness of less than 0.5 d/f; and wherein the binder microfibers have a melting temperature that is less than the melting temperature of the fibers. | 10-23-2014 |
20140311695 | PAPER AND NONWOVEN ARTICLES COMPRISING SYNTHETIC MICROFIBER BINDERS - A process of making a paper or nonwoven article is provide. The process comprising: | 10-23-2014 |
Geoff Smith, Jackson, TN US
Patent application number | Description | Published |
---|---|---|
20090038778 | MULTI-FLUID HEAT EXCHANGER ARRANGEMENT - A multi-fluid heat exchanger assembly Is provided that integrates multiple and distinct heat exchanger systems into a single, integrated system or housing utilizing a common header. Any combination of techniques as described may be utilized for optimizing exchanger performance according to the particular fluids being cooled. The heat exchanger assembly can be optimized by utilizing a pair of opposed headers having a first set of openings and a tube core arranged according to a first configuration and a second set of openings and a tube core arranged according to a second configuration and wherein the first and second configurations are different from one another. The heat exchanger assembly can also be optimized through different tube core/fin joining techniques for each of the distinct heat exchanger systems. Another technique for optimizing the heat exchanger assembly is through the use of differing core depths for each of the distinct heat exchanger systems. | 02-12-2009 |
Gregory Scott Smith, Madison, TN US
Patent application number | Description | Published |
---|---|---|
20130152160 | SYSTEMS AND METHODS FOR USING CIPHER OBJECTS TO PROTECT DATA - Systems, methods, and devices configured to provide an intelligent cipher transfer object are provided. The intelligent cipher transfer object includes a set of participants protected by cloaking patterns. A portable dynamic rule set, which includes executable code for managing access to the protected set of participants, is included within the intelligent cipher transfer object. For a given user, the intelligent cipher transfer object may provide access to some of the participants while preventing access to other participants, based on the portable dynamic rule set. | 06-13-2013 |
Harry C. Smith, Powell, TN US
Patent application number | Description | Published |
---|---|---|
20100196634 | Shop horse pad - A shop horse pad of closed cell foam is cylindrical in shape and having a central radial opening provided therein. An axial slit is provided along the length of the pad that creates two axial edges. A strip of adhesive is arranged along at least one of the axial edges. A covering strip, of preferably cellophane, is provided on the strip of adhesive such that when it is removed, the two axial edges adhere together. In this manner, a user may simply force the pad over the horizontal work tubing of the shop horse and removes the covering strip. Thereafter, the axial edges of the pad are forced together to form a solid pad about the exterior of the horizontal tubing. | 08-05-2010 |
Jesse J. Smith, Nashville, TN US
Patent application number | Description | Published |
---|---|---|
20110097423 | Gene Prognosis Predictor Signature for Colorectal Carcinoma - The present invention is drawn to methods of assessing colorectal cancer prognosis by examining the expression of particular genes disregulated in this disease state. Subjects exhibiting disregulation in one or more of these genes will have a higher risk of cancer recurrence and death. | 04-28-2011 |
Jessica Y. Smith, Memphis, TN US
Patent application number | Description | Published |
---|---|---|
20150201784 | CURTAIN WREATH - The curtain wreath is a device used to hold any kind of curtain together without looking odd or out of place. Its decorative design and simple use will enhance any room that has curtains! It will eliminate any wall damage, adding to the beauty of the entire house! | 07-23-2015 |
J. Michael Smith, Nashville, TN US
Patent application number | Description | Published |
---|---|---|
20080235041 | Enterprise data management - Methods and systems manage data for an enterprise. In one implementation, a computer-implemented method is provided for managing data for an enterprise. According to the method, data may be imported from a plurality of data sources into a staging area of a server. In the staging area, the data may be processed. The processing may comprise determining a category identifier for a subset of the data based on one of the plurality of data sources from which the subset of the data originated and assigning the category identifier to the subset of the data. The method may further comprise transmitting the subset of the data from the staging area to a work area of the server and applying, by the work area, one or more logical rules to the subset of the data based on the category identifier. The one or more logical rules may convert the subset of the data. The method further comprises storing the subset of the data in a database. | 09-25-2008 |
Joe Smith, Nashville, TN US
Patent application number | Description | Published |
---|---|---|
20110112933 | SYSTEM AND METHOD OF MEDIA DISTRIBUTION MANAGEMENT - There is a media distribution system and method configured to distribute media over a computerized network including a media distribution module configured to selectively permit access to media over a computerized network and including a user interface module. The media distribution system also includes an operational administration module in communication with the media distribution module and configured to facilitate operational management of the media distribution module by selectably altering operational parameters of the media distribution module. In addition, the media distribution system includes a supervisory administration module in communication with the operational administration module and configured to selectably determine operational parameters available to the operational administration module for control. Furthermore, the media distribution system includes a network module in communication with the media distribution module and configured to transfer data over a computerized network. | 05-12-2011 |
John Charles Smith, Jackson, TN US
Patent application number | Description | Published |
---|---|---|
20090104857 | IN-LINE SANDER - An in-line profile sander is disclosed. The in-line profile sander includes a sander housing configured to be grasped by a user. A plurality of interchangeable profile sanding pads can be mounted at a head of the housing. The sander includes an in-line oscillating mechanism for moving the profile sanding pads in a linear oscillating motion. | 04-23-2009 |
Joseph A. Smith, Nashville, TN US
Patent application number | Description | Published |
---|---|---|
20140308202 | NF-KB GENE SIGNATURE PREDICTS PROSTATE AND BREAST CANCER PROGRESSION - The present invention is drawn to methods of assessing hormonally-regulated cancers such as prostate and breast, by examining the expression of particular genes disregulated in this disease state. | 10-16-2014 |
Joshua David Smith, Nashville, TN US
Patent application number | Description | Published |
---|---|---|
20100096056 | Re-inflatable inner tube - A Re-Inflatable tire and inner tube system comprising of a primary flexible inflatable chamber and at least one secondary flexible inflatable chamber housed within the primary flexible inflatable chamber wherein all chambers share a single common inflation valve and wherein pressure is administered and controlled through the common valve to inflate one chamber at a time, independent and separate from all other chambers, while simultaneously releasing pressure from the chambers not being inflated. | 04-22-2010 |
20100121287 | WOUND CARE SYSTEM - Disclosed is an apparatus for the treatment of a wound on a patient. The apparatus is capable of administering localized negative pressure therapy to the wound using a negative pressure source and a drain line for removing exudate from the wound. The apparatus is also capable of administering localized hyperbaric fluid therapy to the wound using a fluid source and a supply line for supplying fluid to the wound. | 05-13-2010 |
Karrie Lea Smith, Lebanon, TN US
Patent application number | Description | Published |
---|---|---|
20110119805 | CHARM HAT - A charm hat | 05-26-2011 |
Lane Smith, Knoxville, TN US
Patent application number | Description | Published |
---|---|---|
20100320003 | BIT FOR USE IN AT LEAST ONE OF MINING, TRENCHING AND MILLING APPLICATIONS - A bit includes a body portion having a first shape, a first length, a first end and a second end. A collar portion having a second shape, a thickness, a first surface disposed adjacent a second end of the body portion and a second surface forming a ledge for seating against a surface of a rotary cutting head of a mining machine. A shank portion, has a diameter and a second length. A first end of the shank is secured to the second surface of the collar portion. A groove formed around the shaft portion closely adjacent the second end thereof. A bit tip disposed adjacent the first end of the body portion to contact a hard surface. The bit tip tapers to a pointed end. A connecting means is disposed in the groove for connecting the bit to the working machine. A plurality of fins is disposed along an outer surface of the body portion. | 12-23-2010 |
Lee Smith, Goodlettsville, TN US
Patent application number | Description | Published |
---|---|---|
20090313046 | HEALTHCARE COMMUNICATION AND WORKFLOW MANAGEMENT SYSTEM AND METHOD - A communication and workflow management system and method is provided for integrating a wide range of health care organization workflow management functions, generated by automated systems, manual and automated events associated with patients and staff interactions, through input-output devices such that requests and dispatch requests can be handled locally or over a widely distributed network, and can be tracked and escalated as required. The invention features a rules engine and database that identifies and defines resources, patients, tasks, and task handling. The invention uses extensive logic for the assignment of tasks and communication with resources that can execute tasks, tracking, completion of task, and escalation of tasks. The communication system can be integrated with staff and equipment tracking for automated closure of tasks. | 12-17-2009 |
20140142966 | Healthcare Communication and Workflow Management System and Method - A communication and workflow management system and method is provided for integrating a wide range of health care organization workflow management functions, generated by automated systems, manual and automated events associated with patients and staff interactions, through input-output devices such that requests and dispatch requests can be handled locally or over a widely distributed network, and can be tracked and escalated as required. The invention features a rules engine and database that identifies and defines resources, patients, tasks, and task handling. The invention uses extensive logic for the assignment of tasks and communication with resources that can execute tasks, tracking, completion of task, and escalation of tasks. The communication system can be integrated with staff and equipment tracking for automated closure of tasks. | 05-22-2014 |
Maurice M. Smith, Cordova, TN US
Patent application number | Description | Published |
---|---|---|
20100152791 | Minimally invasive instruments and methods for preparing vertebral endplates - Instruments and methods for treating vertebral endplates are disclosed. The instrument includes one or more treatment members movable from a reduced profile position for insertion to the operative site to a deployed position for providing treatment to the vertebral endplates. | 06-17-2010 |
Max Smith, Milan, TN US
Patent application number | Description | Published |
---|---|---|
20130091768 | DOOR CONTROL APPARATUS - A door control apparatus and methods for controlling a door motion device for a hinged door and, optionally, illuminating a designated area on the floor. During the time the designated area is illuminated, a person can expect that the door will not close. The door control apparatus may include control circuitry, and a sensor, and optionally a light emitter and/or a sound emitter. The sensor detects a person proximate to the door and signals the control circuitry upon a detection event. The light emitter is also connected to the control circuitry. Upon a detection event, the control circuitry signals the light emitter to produce light and signals the door motion device to hold the door open. The light emitter directs light to form an image on the floor in the designated area. The light emitter may be, for example, a laser generator or a light emitting diode lamp. | 04-18-2013 |
Max Stephen Smith, Milan, TN US
Patent application number | Description | Published |
---|---|---|
20110227746 | DOOR CONTROL APPARATUS - A door control apparatus and methods for controlling a door motion device for a hinged door and, optionally, illuminating a designated area on the floor. During the time the designated area is illuminated, a person can expect that the door will not close. The door control apparatus may include control circuitry, and a sensor, and optionally a light emitter and/or a sound emitter. The sensor detects a person proximate to the door and signals the control circuitry upon a detection event. The light emitter is also connected to the control circuitry. Upon a detection event, the control circuitry signals the light emitter to produce light and signals the door motion device to hold the door open. The light emitter directs light to form an image on the floor in the designated area. The light emitter may be, for example, a laser generator or a light emitting diode lamp. | 09-22-2011 |
Milton Smith, Brentwood, TN US
Patent application number | Description | Published |
---|---|---|
20090100789 | Support stand to hold a post and kit for manufacturing the same - The present invention provides a support stands as well as kits and methods for manufacturing the support stand that holds an elongate pole. In one embodiment, the stand comprises container receives a dish and a plurality of handle molds with one of a plurality of molds selectively positioned on the dish to define a cavity for the pole, for receiving a curable mixture to form the support stand, and optionally, a release solution applied to interior surfaces and, optionally, a plurality of mesh screens disposed in spaced-apart relation in the container. In an alternative embodiment, the stand comprises a container capable of receiving a filler, a removable lid, and a sleeve positioned within the container and conforming in cross-section to a post for being supported by the container. A kit for each stand and a method of manufacturing the support stands are disclosed. | 04-23-2009 |
M. Stephen Smith, Milan, TN US
Patent application number | Description | Published |
---|---|---|
20100083598 | Door Frame Assembly - A welded door frame assembly including a hinge jamb joined to a lock jamb via a frame head jamb, all of which are joined with existing studs and an existing wall. The hinge jamb has a bottom end and a top end and includes a door side base, a door contact flange, and a non-door side trim attachment track including one or more fastener holes. A hinge jamb trim piece includes a connector portion configured to be removably retained within the non-door side trim attachment track and is adapted to cover the non-door side trim attachment track, any fastener holes, and any fasteners. Both the lock jamb and frame head jamb include a door side base, a door contact flange, and a connection flange including one or more fastener holes. A lock jamb or frame head jamb trim piece covers the connection flange, any fastener holes, and any fasteners. | 04-08-2010 |
Paul J. Smith, Nashville, TN US
Patent application number | Description | Published |
---|---|---|
20100088245 | SYSTEMS AND METHODS FOR DEVELOPING STUDIES SUCH AS CLINICAL TRIALS - Systems and methods are described for developing studies such as clinical trials, including computer-assisted recruitment or selection of patients, clinical trial investigators, facilities, or clinical trial study sites. In certain examples, computer-processing of physician records scores physicians potential investigators, as determined from at least one physician characteristic, and the physician's proximity to the nearest clinical trial study site. Clinical trial study sites are also scored. In certain examples, at least one physician characteristic is used to score potential clinical trial study sites. Processes for engaging physicians and their patients in clinical trial studies are also described. Suitable patients can be contacted through their physicians or other caregivers to participate in the clinical trial study. | 04-08-2010 |
Ralph Douglass Smith, Oak Ridge, TN US
Patent application number | Description | Published |
---|---|---|
20120242311 | Systems and Methods of Dynamic Current Limit - Systems and methods of dynamic current limit are disclosed herein. A current is sensed a wireless charging circuit, for example. When the current sense reaches a reference current level while a communication is active, the current limit is enabled for the next packet. The current limit signal may be cleared for the next packet. | 09-27-2012 |
Richard Michael Smith, Memphis, TN US
Patent application number | Description | Published |
---|---|---|
20100331848 | Methods and Apparatus for Performing Knee Arthroplasty - Methods and apparatus for performing knee arthroplasty, including, but not limited to, bicruciate retaining knee arthroplasty, are described herein. Methods and apparatus for preparing a distal femur for a femoral implant as well as methods and apparatus for preparing a proximal tibia for a tibial implant are described. These methods and apparatus, in at least some embodiments and uses, facilitate decreasing the complexity of knee arthroplasty procedures such as bicruciate retaining procedures, while maintaining, if not improving on, the safety, accuracy and/or effectiveness of such procedures. | 12-30-2010 |
20110190898 | CRUCIATE-RETAINING KNEE PROSTHESIS - Certain embodiments generally provide an improved tibial base member comprising keel portions that allow one or both cruciate ligaments to be preserved. Other embodiments provide improved lateral and/or medial inserts having a mesial lip that helps relieve and/or prevent impingement between the femoral component and the tibial eminence. Other embodiments provide improved femoral components having various chamfers to provide additional clearance with respect to the tibial eminence and posterior cruciate ligament without decreasing bone coverage. | 08-04-2011 |
20140309640 | METHODS AND APPARATUS FOR PERFORMING KNEE ARTHROPLASTY - Methods and apparatus for performing knee arthroplasty, including, but not limited to, bicruciate retaining knee arthroplasty, are described herein. Methods and apparatus for preparing a distal femur for a femoral implant as well as methods and apparatus for preparing a proximal tibia for a tibial implant are described. These methods and apparatus, in at least some embodiments and uses, facilitate decreasing the complexity of knee arthroplasty procedures such as bicruciate retaining procedures, while maintaining, if not improving on, the safety, accuracy and/or effectiveness of such procedures. | 10-16-2014 |
20150088265 | CRUCIATE-RETAINING KNEE PROSTHESIS - Certain embodiments generally provide an improved tibial base member comprising keel portions that allow one or both cruciate ligaments to be preserved. Other embodiments provide improved lateral and/or medial inserts having a mesial lip that helps relieve and/or prevent impingement between the femoral component and the tibial eminence. Other embodiments provide improved femoral components having various chamfers to provide additional clearance with respect to the tibial eminence and posterior cruciate ligament without decreasing bone coverage. | 03-26-2015 |
Rodney S. Smith, Franklin, TN US
Patent application number | Description | Published |
---|---|---|
20090179167 | Inflation/deflation adaptor assembly for inflating and deflating inflatable cargo dunnage bags - An inflation/deflation assembly, which can be mounted upon the inflation valve assembly of an inflatable bag, so as to permit both the inflation and deflation of the inflatable as may be desired. The inflation/deflation assembly comprises an outer housing, and a control rod is rotatably disposed within the housing so as to be rotatably movable between two positions angularly spaced apart from each other. When the control rod is disposed, for example, at a first one of the two positions, the inflatable bag can be inflated, whereas, when the control rod is disposed at the second one of the two positions, the inflatable bag can be deflated. | 07-16-2009 |
Roger Gordon Smith, Germantown, TN US
Patent application number | Description | Published |
---|---|---|
20130036562 | Golf Club Cleaner - A golf club head cleaning device having a manual driven and/or motor-driven round cleaning brush removabally mounted inside a bucket on one end of a telescope brush shaft which has the other end extends through the side wall of a bucket of which top open area having at least one groove to accommodate golf club shaft heads for cleaning therein, and a handle removably mounted on the other end of the shaft outside the bucket for manually actuation by hand or by an electric motor to rotate the brush for cleaning the club surface therein. The cleaning device may further have an axle assembly to prevent shaft from wobbling when turning handle to rotate the brush, and a bucket lid to prevent water from splashing to the user. The device is easy to manufacture, ergonomic to operate, efficient in cleaning, less expensive in respect of maintenance and manufacturing. | 02-14-2013 |
Ronnie E. Smith, Goodlettsville, TN US
Patent application number | Description | Published |
---|---|---|
20140209546 | Pool Skimmer System - The present invention relates to systems for improving the range of pool skimmers. In some embodiments, the present invention provides at least one track that is attached to the pool sidewall and a second weir that moves along the track. In other embodiments, the present invention provides a deflector that is attached to the pool sidewall, extends from the sidewall and above the skimmer opening, and includes a side opening adjacent for feeding water to the skimmer opening. Without being bound to any particular theory, it is believed that the apparatuses are cheap to manufacture, safe, conserve water and chemical use, and allow for an aesthetically pleasing full pool. | 07-31-2014 |
Ryan Smith, Nashville, TN US
Patent application number | Description | Published |
---|---|---|
20130199131 | Insulating Rolltainer Liner - According to one aspect, an apparatus for storing temperature-sensitive goods is disclosed. In one embodiment, the apparatus includes a base and at least one side connected to the base. The base has a lower portion and an upper portion extending from the tower portion. The base and at least one side define a receptacle portion for receiving Temperature-sensitive goods, and the at least one side is configured to fold to substantially enclose the receptacle portion. | 08-08-2013 |
Sandra W. Smith, Knoxville, TN US
Patent application number | Description | Published |
---|---|---|
20150092153 | One Stem Reversible Reading Glasses - One stem reversible glasses include a first lens and a second lens. A stem having a proximal end and a distal end is connected adjacent one of the first lens and the second lens at the proximal end. An earpiece is connected adjacent the distal end of the stem, the earpiece including means for securing the earpiece to a right ear of a user when the glasses are in a first reading position and for securing the earpiece to a left ear of the user when the glasses are in a second reading position. A nosepiece is disposed between the first lens and the second lens dimensioned and configured for receiving a nose of a user when the glasses are in either the first reading position or the second reading position. | 04-02-2015 |
Scott F. Smith, Franklin, TN US
Patent application number | Description | Published |
---|---|---|
20110016029 | Group Opt Out theft Identity Services For Financial Account Holder Method - Identity theft services, made available as an inherent part of a financial services account with an optional fee structure, are believed to provide economical and attractive option to the market place, and an additional safeguard to the financial organization from the effects of fraud and security breach. By providing notice followed by a period to opt out and then instituting a new identity theft service, a revenue generating stream can be provided for a financial organization as well as a service provider. Furthermore, the customers at the financial organization are provided with identity theft service benefits not previously enjoyed. When utilizing this service with a Covered Group, even those individuals that opt out may be provided at least limited identity theft services. | 01-20-2011 |
Sean Campbell Smith, Oak Ridge, TN US
Patent application number | Description | Published |
---|---|---|
20140262810 | ELECTROCHEMICAL METHOD FOR SYNTHESIZING METAL-CONTAINING PARTICLES AND OTHER OBJECTS - The invention is directed to a method for producing metal-containing (e.g., non-oxide, oxide, or elemental) nano-objects, which may be nanoparticles or nanowires, the method comprising contacting an aqueous solution comprising a metal salt and water with an electrically powered electrode to form said metal-containing nano-objects dislodged from the electrode, wherein said electrode possesses a nanotextured surface that functions to confine the particle growth process to form said metal-containing nano-objects. The invention is also directed to the resulting metal-containing compositions as well as devices in which they are incorporated. | 09-18-2014 |
20140262811 | CONTROLLABLE REDUCTIVE METHOD FOR SYNTHESIZING METAL-CONTAINING PARTICLES - The invention is directed to a method for producing metal-containing particles, the method comprising subjecting an aqueous solution comprising a metal salt, E | 09-18-2014 |
Shane Smith, Chattanooga, TN US
Patent application number | Description | Published |
---|---|---|
20110004169 | Preparation and Use of Sleeve and Micro-Encapsulated Topical Analgesic Patch For Treating Pain - Novel micro-encapsulated topical analgesics are provided to treat pain and may be applied via sleeves having dosed therapeutic sections, especially to joints and extremities. Sleeves may be prepared and packaged inside-out and inverted when positioned by the wearer. | 01-06-2011 |
Stephen F. Smith, Loudon, TN US
Patent application number | Description | Published |
---|---|---|
20090296856 | CARRIER PHASE SYNCHRONIZATION SYSTEM FOR IMPROVED AMPLITUDE MODULATION AND TELEVISION BROADCAST RECEPTION - Systems and methods are described for carrier phase synchronization for improved AM and TV broadcast reception. A method includes synchronizing the phase of a carrier frequency of a broadcast signal with the phase of a remote reference frequency. An apparatus includes a receiver to detect the phase of a reference signal; a phase comparator coupled to the reference signal-phase receiver; a voltage controlled oscillator coupled to the phase comparator; and a phase-controlled radio frequency output coupled to the voltage controlled oscillator. | 12-03-2009 |
20100103046 | Robust Low-Frequency Spread-Spectrum Navigation System - Methods and apparatus are described for a navigation system. A process includes providing a plurality of transmitters distributed throughout a desired coverage area; locking the plurality of transmitters to a common timing reference; transmitting a signal from each of the plurality of transmitters. An apparatus includes a plurality of transmitters distributed throughout a desired coverage area; wherein each of the plurality of transmitters comprises a packet generator; and wherein the plurality of transmitters are locked to a common timing reference. | 04-29-2010 |
20100103980 | Robust Low-Frequency Spread-Spectrum Navigation System - Methods and apparatus are described for a navigation system. A process includes providing a plurality of transmitters distributed throughout a desired coverage area; locking the plurality of transmitters to a common timing reference; transmitting a signal from each of the plurality of transmitters. An apparatus includes a plurality of transmitters distributed throughout a desired coverage area; wherein each of the plurality of transmitters comprises a packet generator; and wherein the plurality of transmitters are locked to a common timing reference. | 04-29-2010 |
20100103982 | Robust Low-Frequency Spread-Spectrum Navigation System - Methods and apparatus are described for a navigation system. A process includes providing a plurality of transmitters distributed throughout a desired coverage area; locking the plurality of transmitters to a common timing reference; transmitting a signal from each of the plurality of transmitters. An apparatus includes a plurality of transmitters distributed throughout a desired coverage area; wherein each of the plurality of transmitters comprises a packet generator; and wherein the plurality of transmitters are locked to a common timing reference. | 04-29-2010 |
20100103989 | Robust Low-Frequency Spread-Spectrum Navigation System - Methods and apparatus are described for a navigation system. A process includes providing a plurality of transmitters distributed throughout a desired coverage area; locking the plurality of transmitters to a common timing reference; transmitting a signal from each of the plurality of transmitters. An apparatus includes a plurality of transmitters distributed throughout a desired coverage area; wherein each of the plurality of transmitters comprises a packet generator; and wherein the plurality of transmitters are locked to a common timing reference. | 04-29-2010 |
20120029818 | Triply Redundant Integrated Navigation and Asset Visibility System - Methods and apparatus are described for a navigation system. A method includes providing a global positioning system fix having a plurality of tracking parameters; providing a theater positioning system fix; monitoring the plurality of tracking parameters for predetermined conditions; and, when the predetermined conditions are met, sending a notifying signal and switching to the theater positioning system fix as a primary fix. An apparatus includes a system controller; a global positioning system receiver coupled to the system controller; a radio frequency locating receiver coupled to the system controller; and an operator interface coupled to the system controller. | 02-02-2012 |
20120032842 | Triply Redundant Integrated Navigation and Asset Visibility System - Methods and apparatus are described for a navigation system. A method includes providing a global positioning system fix having a plurality of tracking parameters; providing a theater positioning system fix; monitoring the plurality of tracking parameters for predetermined conditions; and, when the predetermined conditions are met, sending a notifying signal and switching to the theater positioning system fix as a primary fix. An apparatus includes a system controller; a global positioning system receiver coupled to the system controller; a radio frequency locating receiver coupled to the system controller; and an operator interface coupled to the system controller. | 02-09-2012 |
Stephen Fulton Smith, Loudon, TN US
Patent application number | Description | Published |
---|---|---|
20120256694 | ORTHOGONALLY REFERENCED INTEGRATED ENSEMBLE FOR NAVIGATION AND TIMING - An orthogonally referenced integrated ensemble for navigation and timing includes a dual-polyhedral oscillator array, including an outer sensing array of oscillators and an inner clock array of oscillators situated inside the outer sensing array. The outer sensing array includes a first pair of sensing oscillators situated along a first axis of the outer sensing array, a second pair of sensing oscillators situated along a second axis of the outer sensing array, and a third pair of sensing oscillators situated along a third axis of the outer sensing array. The inner clock array of oscillators includes a first pair of clock oscillators situated along a first axis of the inner clock array, a second pair of clock oscillators situated along a second axis of the inner clock array, and a third pair of clock oscillators situated along a third axis of the inner clock array. | 10-11-2012 |
20130141172 | Orthogonally Referenced Integrated Ensemble for Navigation and Timing - An orthogonally referenced integrated ensemble for navigation and timing includes a dual-polyhedral oscillator array, including an outer sensing array of oscillators and an inner clock array of oscillators situated inside the outer sensing array. The outer sensing array includes a first pair of sensing oscillators situated along a first axis of the outer sensing array, a second pair of sensing oscillators situated along a second axis of the outer sensing array, and a third pair of sensing oscillators situated along a third axis of the outer sensing array. The inner clock array of oscillators includes a first pair of clock oscillators situated along a first axis of the inner clock array, a second pair of clock oscillators situated along a second axis of the inner clock array, and a third pair of clock oscillators situated along a third axis of the inner clock array. | 06-06-2013 |
20140159824 | Orthogonally referenced integrated ensemble for navigation and timing - An orthogonally referenced integrated ensemble for navigation and timing includes a dual-polyhedral oscillator array, including an outer sensing array of oscillators and an inner clock array of oscillators situated inside the outer sensing array. The outer sensing array includes a first pair of sensing oscillators situated along a first axis of the outer sensing array, a second pair of sensing oscillators situated along a second axis of the outer sensing array, and a third pair of sensing oscillators situated along a third axis of the outer sensing array. The inner clock array of oscillators includes a first pair of clock oscillators situated along a first axis of the inner clock array, a second pair of clock oscillators situated along a second axis of the inner clock array, and a third pair of clock oscillators situated along a third axis of the inner clock array. | 06-12-2014 |
Steven Bradley Smith, Milan, TN US
Patent application number | Description | Published |
---|---|---|
20140037476 | MOTOR FOR COMPRESSOR PUMPS AND RELATED COMPRESSOR ASSEMBLY - An electric motor is provided, including a stator having two electromagnetic poles diametrically opposite each other, a rotor including a rotor core configured for being rotatably mounted with a shaft for rotation relative to the stator. The rotor core is formed by stacking a plurality of laminations each of which has a central hole and a plurality of generally radially extending teeth. The stator and the rotor have geometric attributes such that: R | 02-06-2014 |
Stokes Smith, Signal Mountain, TN US
Patent application number | Description | Published |
---|---|---|
20140353364 | Bag in Box Container - An improved paperboard structure to hold a fluid filled bag or plastic carton is provided. | 12-04-2014 |
20140374447 | Bottle in Box Container - An improved paperboard structure to hold a fluid filled carton is provided. | 12-25-2014 |
Timothy Smith, Middleton, TN US
Patent application number | Description | Published |
---|---|---|
20140134227 | BONE GRAFT SUBSTITUTE COMPOSITION - A composition includes calcium sulfate hemihydrate, stearic acid, an accelerant, and a mixing solution. The composition can be injected, e.g., through a needle, and is capable of setting, e.g., in vivo, in a relatively short period of time to a relatively high hardness. | 05-15-2014 |
Timothy Smith, Blountville, TN US
Patent application number | Description | Published |
---|---|---|
20090084328 | WATER HEATERS WITH COMBUSTION AIR INLET - A water heater includes a water container, a combustion chamber adjacent the, water container, a burner associated with the combustion chamber and arranged to combust fuel to heat water in the water container, a blower assembly positioned to receive combustion gases generated by the burner, a shield positioned below at least a heating portion of the burner, a diverter that directs combustion air into the combustion chamber below the shield, and a passageway that directs at least a portion of the combustion air from the combustion air inlet, as primary combustion air, to the burner. | 04-02-2009 |
Timothy C. Smith, Jackson, TN US
Patent application number | Description | Published |
---|---|---|
20080265844 | STARTER SYSTEM FOR PORTABLE INTERNAL COMBUSTION ENGINE ELECTRIC GENERATORS USING A PORTABLE UNIVERSAL BATTERY PACK - A portable power driven system has a manually movable frame. In one example, an internal combustion engine and a generator device that generates AC power are supported on the frame. The internal combustion engine drives the generator device. An electrically powered starting device is coupled to the internal combustion engine and is controllable by a remote ignition system to enable the start-up of the internal combustion engine from a remote location. A control panel is coupled to the frame and includes at least one AC outlet and a battery receptacle that is electrically coupled to the starting device. The battery receptacle is materially the same as a foot of a cordless power tool that receives a battery pack. | 10-30-2008 |
20110123362 | AIR COMPRESSOR - An air compressor assembly can include a support structure with a compressor mechanism, at least one fluid tank, a pair of wheels, and a handle attached thereto. The air compressor assembly can be configured with the compressor mechanism having a perpendicular orientation relative to the at least one fluid tank so as to provide a relatively narrow assembly and to facilitate servicing and/or maintenance of the assembly. Furthermore, the wheels and handle can be configured so that the assembly can be relatively easily located in a balanced transport position. Additionally, an accessory support plate can be attached to the top of the assembly to serve as a dolly. | 05-26-2011 |
Timothy Mitchell Smith, Blountville, TN US
Patent application number | Description | Published |
---|---|---|
20110247572 | WATER HEATER INCLUDING A DIP TUBE - A water heater includes a storage tank, a heat source for heating water stored in the storage tank, and a dip tube extending into the tank. The dip tube includes upper and lower ends, a restriction between the upper and lower ends so as to create back pressure in the dip tube above the restriction, the restriction positioned in an upper portion of the storage tank, a lower opening below the restriction for providing cold water to a lower portion of the storage tank, and an upper opening above the restriction for providing cold water to the upper portion of the storage tank due to the first restriction. | 10-13-2011 |
William C. Smith, Lexington, TN US
Patent application number | Description | Published |
---|---|---|
20090095006 | REFRIGERATION COMPARTMENT INCLUDING FREEZER SECTION - A walk-in cooler arranged in accordance with the invention includes a one or more refrigeration sections and a freezing compartment within the refrigeration section. The wall panels defining the freezing compartment are substantially thicker than the wall panels defining the refrigeration section. To accommodate the substantial change in panel thickness, panel conversion members are provided that couple panels having a substantial different in panel thickness, yet maintain a uniform exterior wall appearance. Ceiling conversion panels are also provided to enable a ceiling transition between the refrigeration section and the freezer compartment. | 04-16-2009 |