­
­
­
­

Inventi Impact - Computational Mathematics

Patent Watch

  • System And Method For Applying A Reflectance Modifying Agent To Improve The Visual Attractiveness Of Human Skin

    A computer-controlled system determines attributes of a frexel, an area of human skin, and applies a modifying agent (RMA) at the pixel level, typically to make the skin appear more youthful and so more attractive. The system scans the frexel, identifies unattractive attributes, and applies the RMA, typically with an inkjet printer. The identified attributes relate to reflectance and may refer to features such as irregular-looking light and dark spots, age-spots, scars, and bruises. Identified attributes may also relate to the surface topology of the skin, for more precisely enhancing surface irregularities such as bumps and wrinkles. Feature mapping may be used, for example to make cheeks appear pinker and cheekbones more prominent. The RMA can be applied in agreement with identified patterns, such as adding red to a red frexel, or in opposition, such as adding green or blue to a red frexel, according to idealized models of attractiveness.

  • METHOD, APPARATUS, AND SYSTEM FOR TIME SYNCHRONIZATION OF XDSL

    The present invention provides a method, an apparatus, and a system for time synchronization of an xDigital Subscriber Line (xDSL). The method includes: transmitting, by a customer premises equipment (CPE), a first symbol to a central office (CO) equipment, and obtaining time Ts2 indicating the moment that the first symbol is transmitted; receiving, by the CPE, a second symbol transmitted by the CO, and obtaining time Ts1 indicating the moment that the second symbol is received; obtaining, by the CPE obtains time Tm2 indicating the moment that the first symbol is received by the CO and time Tm1 indicating the moment that the second symbol is transmitted by the CO; the CPE calculates an offset between a clock of the CPE and a clock of the CO according to Ts1, Ts2, Tm1, Tm2 and a delay of the CPE; and the CPE adjusts the clock of the CPE according to the offset to achieve synchronization. According to the present invention, by adjusting the time of the clock of the CPE and the time of the clock of the CO, the offset between the clock of the CPE and the clock of the CO can be obtained accurately to effectively achieve time synchronization between the CPE and the CO.

  • Method And Apparatus For Transient Frequency Distortion Compensation

    Transient distortion is compensated for by multiplying an exponentially-decaying phase shift onto the distorted waveform. The exponentially decaying phase shift waveform is patterned after the transient which typically takes the form of an exponential and occurs upon introduction of power to a circuit or circuit component. A digital circuit produces an appropriate exponentially-decaying waveform which is used as the input for a look up table whose output is a complex sinusoidal waveform capable of compensating for the distortion. The complex sinusoid is multiplied onto the transmitted waveform. The decaying exponential is biased so that it crosses a threshold at which point the compensating circuitry is turned off.

  • SIGNAL CODING WITH ADAPTIVE NEURAL NETWORK

    The invention relates to sparse parallel signal coding using a neural network which parameters are adaptively determined in dependence on a pre-determined signal shaping characteristic. A signal is provides to a neural network encoder implementing a locally competitive algorithm for sparsely representing the signal. A plurality of interconnected nodes receive projections of the input signal, and each node generates an output once an internal potential thereof exceeds a node-dependent threshold value. The node-dependent threshold value for each of the nodes is set based upon the pre-determined shaping characteristic. In one embodiment, the invention enables to incorporate perceptual auditory masking in the sparse parallel coding of audio signals.

  • METHOD FOR QUANTIFYING AND ANALYZING INTRINSIC PARALLELISM OF AN ALGORITHM

    A method for quantifying and analyzing intrinsic parallelism of an algorithm is adapted to be implemented by a computer, and includes the steps of: configuring the computer to represent the algorithm by means of a plurality of operation sets; configuring the computer to obtain a Laplacian matrix according to the operation sets; configuring the computer to compute eigenvalues and eigenvectors of the Laplacian matrix; and configuring the computer to obtain a set of information related to intrinsic parallelism of the algorithm according to the eigenvalues and the eigenvectors of the Laplacian matrix.

  • Efficient Distributed Algorithm for the Location Design and Routing Problem

    The Location Design and Routing problem asks to find a subset of "depot" nodes and a spanning forest of a graph such that every connected component in the forest contains at least one depot. This problem arises in a number of both logistical and computer networking problems, for example, in selecting the number and location of distribution centers in vehicle routing networks. This problem is functionally equivalent to that of supernode selection in peer-to-peer networks. A distributed algorithm approximates a solution to this problem that runs in a logarithmic number of communication rounds with respect to the number of nodes (independent of the topology of the network), and, under assumptions on the embedding of the edge weights, whose solutions are within a factor of 2 of optimal.

  • TX BACK CHANNEL ADAPTATION ALGORITHM

    Disclosed is a method and system that adapts coefficients of taps of a Finite Impulse Response (FIR) filter to increase elimination of Inter-Symbol Interference (ISI) introduced into a digital communications signal due to distortion characteristics caused by a real-world communications channel. In the communications system there is a Finite Impulse Response (FIR) filter. The FIR filter has at least one pre and/or post cursor tap that removes pre and/or post cursor ISI from the signal, respectively. The pre/post cursor taps each have pre/post cursor coefficients, respectively, that adjusts the effect of the pre/post cursor portion of the FIR filter. The FIR filtered signal is transmitted over the channel which distorts the signal due to the changing and/or static distortion characteristics of the channel. The channel distorted signal is received at a receiver that may pass the channel distorted signal through a quantifier/decision system (e.g., a slicer) as the quantifier input signal to quantify the quantifier input signal to one of multiple digital values. The channel distorted signal may be further adjusted by summing the channel distorted signal with the output of a Decision Feedback Equalizer (DFE) filter to create a DFE corrected signal which then becomes the quantifier input signal. An error signal is determined by finding the difference between the scaled quantifier decision and the quantifier input signal. The pre/post cursor coefficient values that adjust the effects of the pre/post cursor taps of the FIR filter are updated as a function of the error signal and at least two quantifier decision values, and update coefficient values, may be sent over a communications back-channel to the FIR filter.

  • REAL-TIME PCR ELBOW CALLING BY EQUATION-LESS ALGORITHM

    Systems and methods for determining a transition value in a sigmoid or growth curve, such as the end of the baseline region or the elbow value or Ct value of a PCR amplification curve. Numerical determinations of the second derivatives and curvature values of a PCR data set are made. A Gaussian Mixture Model (GMM) function with parameters determined using a Levenberg-Marquardt (LM), or other, regression process is used to find an approximation to the second derivative values and to the curvature values, where the maximum values of the numerically determined second derivative values and/or curvature values are used as initial conditions for parameters of the GMM function. The determined parameters provide fractional Ct values. The Ct value(s) are then returned and may be displayed or otherwise used for further processing.

  • Topographic Optical Infrared Tomography System for Biophysical Imaging With Infrared Diagnostic Exploratory Algorithm Sequencing (IDEAS) Scripting Language

    A topographic optical infrared tomography system for biophysical imaging includes a thermal camera operably disposed adjacent a body part equipped for obtaining thermal data readings from the body part and apparatus operably connected to the thermal camera for correcting thermal emissivity variations in the thermal data readings to provide corrected thermal data. A method for obtaining physiological data using the thermally corrected data is also provided.

  • METHOD AND APPARATUS FOR PROCESSING SAR IMAGES BASED ON A COMPLEX ANISOTROPIC DIFFUSION FILTERING ALGORITHM

    A computer system for processing complex synthetic aperture radar (SAR) images includes a database for storing complex SAR images to be processed, and a processor for processing a complex SAR image from the database. The processing includes receiving a complex SAR data set for a SAR image comprising a plurality of pixels, and applying a complex anisotropic diffusion algorithm to the complex SAR data set. The complex SAR data set includes a real and an imaginary part for each pixel.

  • METHOD AND APPARATUS FOR REGISTRATION AND VECTOR EXTRACTION OF SAR IMAGES BASED ON AN ANISOTROPIC DIFFUSION FILTERING ALGORITHM

    A computer system for registering synthetic aperture radar (SAR) images includes a database for storing SAR images to be registered, and a processor for registering SAR images from the database. The registering includes selecting first and second SAR images to be registered, individually processing the selected first and second SAR images with an anisotropic diffusion algorithm, and registering the first and second SAR images after the processing. A shock filter is applied to the respective first and second processed SAR images before the registering. Elevation data is extracted based on the registered SAR images.

  • METHOD FOR QUANTIFYING AND ANALYZING INTRINSIC PARALLELISM OF AN ALGORITHM

    A method for quantifying and analyzing intrinsic parallelism of an algorithm is adapted to be implemented by a computer, and includes the steps of: configuring the computer to represent the algorithm by means of a plurality of operation sets; configuring the computer to obtain a Laplacian matrix according to the operation sets; configuring the computer to compute eigenvalues and eigenvectors of the Laplacian matrix; and configuring the computer to obtain a set of information related to intrinsic parallelism of the algorithm according to the eigenvalues and the eigenvectors of the Laplacian matrix.

  • METHOD AND SYSTEM FOR DOCUMENT CLASSIFICATION OR SEARCH USING DISCRETE WORDS

    A method of operating a computerized document search system where information is matched against a database containing documents in response to user queries includes receiving a query identifying a source document that has information content related to the documents within the database. Important words within the source document are detected automatically, where at least one of the important words has been processed using at least two dictionary functions consisting of Derived Words, Acronym, Word Capitalization, and Hyphenation. An importance value is generated for important words in a processed document using a WordRatio and at least one of a selected set of values. A score is generated for a processed document based partly on the importance value of at least one important word in that document. A document list is created for identifying documents that are related to a source document.

  • METHOD AND SYSTEM USING A SECURE COMPUTER NETWORK FOR MATCHING CUSTOMERS AND VENDORS

    A secure computer network, competitive offer system, and associated methods for facilitating the exchange of confidential information between service vendors and consumers with a reasonable expectation of privacy. In an embodiment, the methods and systems comprise using a secure computer network for facilitating the exchange of confidential information between vendors and consumer in service or service/good hybrid industries.

  • APPARATUS AND METHOD FOR MEASURING BINDING KINETICS WITH A RESONATING SENSOR

    A subject material in a fluid sample is detected using a resonating sensor immersible in the fluid sample. Binding kinetics of an interaction of an analyte material present in the fluid sample are measured with the resonating sensor, which has binding sites for the analyte material. Prior to exposing the resonating sensor to the fluid sample, operation of the resonating sensor is initiated, producing a sensor output signal representing a resonance characteristic of the resonating sensor. Optionally, a reference resonator that lacks binding sites for the analyte is used to produce a reference output signal. Introduction of a fluid sample to the resonating sensor is automatically detected based on a characteristic change in the sensor output signal or a reference output signal. In response to the detecting of the introduction of the fluid sample, automated measurement of the binding kinetics are measured.

  • Fracture Fatigue Entropy Determination

    A method and apparatus are disclosed for approximating in real time the fracture fatigue entropy (FFE) of a metallic object subjected to cyclic loading. Such objects experience fatigue, which can lead to failure after a number of loading cycles. The disclosed invention allows for real time monitoring of the entropy increase in a metallic object under cyclic loading, and allows for removing the object from service before fatigue fracture occurs. Through use of the present invention, users may keep metallic objects in service for longer periods, because such objects may be safely taken closer to the fatigue fracture point. The invention therefore can effectively extend the useful life of many critical components and reduce downtime resulting from repair or premature replacement.

  • Two-Level Scheduler for Multi-Threaded Processing

    One embodiment of the present invention sets forth a technique for scheduling thread execution in a multi-threaded processing environment. A two-level scheduler maintains a small set of active threads called strands to hide function unit pipeline latency and local memory access latency. The strands are a sub-set of a larger set of pending threads that is also maintained by the two-leveler scheduler. Pending threads are promoted to strands and strands are demoted to pending threads based on latency characteristics. The two-level scheduler selects strands for execution based on strand state. The longer latency of the pending threads is hidden by selecting strands for execution. When the latency for a pending thread is expired, the pending thread may be promoted to a strand and begin (or resume) execution. When a strand encounters a latency event, the strand may be demoted to a pending thread while the latency is incurred.

  • SYSTEMS AND METHODS OF WIRELESS POWER TRANSFER WITH INTERFERENCE DETECTION

    Performance of wireless charging systems may be significantly degraded when parasitic metal objects come in close proximity to the transmitting coil. Some of the transmitted energy may be coupled by these metal objects and wasted as heat. This may create a danger as the metal objects may get hot enough to create a fire hazard, to cause plastic parts deformation, or operator skin burns when touched. Systems and methods of wireless power transfer system with interference detection disclosed herein detects possible excessive energy transfer associated with parasitic metal objects placed in close proximity with system coils by comparing power received on the receiving side of the system with the power consumed on the primary side considering known losses in the system. If the result of such comparison shows that power consumed on the primary side substantially exceeds power received on the secondary side, the system may terminate operation.

  • PRODUCTION MONITORING SYSTEM AND METHOD

    A production monitoring system (10) comprises a plurality of injection and production units (80) coupled in operation to sensors (410) for measuring physical processes occurring in operation in the injection and production units (80) and generating corresponding measurement signals (420) for computing hardware (400). The computing hardware (400) is operable to execute software products (300) for processing the signals (420). Moreover, the software products (300) are adapted for the computing hardware (400) to analyse the measurement signals (420) to abstract a parameter representation of the measurement signals (420), and to apply a temporal analysis of the parameters to identify temporally slow processes and temporally fast processes therein, and to employ information representative of the slow processes and fast processes to control a management process for controlling operation of the system (10).

  • SYSTEM AND METHOD FOR A COMPUTERIZED LEARNING SYSTEM

    There is a computerized learning system and method which updates a conditional estimate of a user signal representing a characteristic of a user based on observations including observations of user behavior. The conditional estimate may be updated using a non-linear filter. Learning tools may be generated using the computerized learning system based on distributions of desired characteristics of the learning tools. The learning tools may include educational items and assessment items. The learning tools may be requested by a user or automatically generated based on estimates of the user's characteristics. Permissions may be associated with the learning tools which may only allow delegation of permissions to other users of lower levels. The learning system includes a method for annotating learning tools and publishing those annotations. In-line text editors of scientific text allow users to edit and revised previously published documents.

  • METHOD AND APPARATUS FOR SECURE ITERATIVE PROCESSING

    Disclosed embodiments include methods and apparatuses for secure iterative processing of encrypted signals based on implementing a secure iterative processing protocol that avoids cipher blowup, and applying an iterative algorithm directly on the encrypted signals to generate an encrypted processed output signal. In a particular embodiment, the protocol comprises applying homomorphic linear processing, preparing and applying a resealing module to avoid cypher blowup, and homomorphically adapting the encrypted signals. Specific embodiments implement iterative adaptive filtering algorithms in the encrypted domain including non-collaborative secure filtering and two-party filtering based on homomorphic encryption, interactive secure protocols, garbed circuits, or a combination thereof.

  • WIDE PROCESS RANGE LIBRARY FOR METROLOGY

    Methods of generating wide process range libraries for metrology are described. For example, a method includes generating a first library having a first process range for a first parameter. A second library is generated having a second process range for the first parameter. The second process range is overlapping with the first process range. The second library is stitched to the first library to generate a third library having a third process range for the first parameter. The third process range is wider than each of the first and second process ranges.

  • ENCODING AND DECODING USING ELASTIC CODES WITH FLEXIBLE SOURCE BLOCK MAPPING

    Data can be encoded by assigning source symbols to base blocks, assigning base blocks to source blocks and encoding each source block into encoding symbols, where at least one pair of source blocks is such they have at least one base block in common with both source blocks of the pair and at least one base block not in common with the other source block of the pair. The encoding of a source block can be independent of content of other source blocks. Decoding to recover all of a desired set of the original source symbols can be done from a set of encoding symbols from a plurality of source blocks wherein the amount of encoding symbols from the first source block is less than the amount of source data in the first source block and likewise for the second source block.

  • Method and Appartus to Perform Real-Time Audience Estimation and Commercial Selection Suitable for Targeted Advertising

    Input measurements from a measurement device are processed as a Markov chain whose transitions depend upon the signal. The desired information related to the device can then be obtained by estimating the state of the signal at a time of interest. A nonlinear filter system can be used to provide an estimate of the signal based on the observation model. The nonlinear filter system may involve a nonlinear filter model and an approximation filter for approximating an optimal nonlinear filter solution. The approximation filter may be a particle filter or a discrete state filter for enabling substantially real-time estimates of the signal based on the observation model. In one application, a click stream entered with respect to a digital set top box of a cable television network is analyzed to determine information regarding users of the digital set top box so that ads can be targeted to the users.

  • Methods and Systems for Preparing Mixed-Content Documents

    Embodiments of the present invention are directed to automated methods and systems for generating mixed-content documents. In one embodiment, an automated method for generating a document layout includes receiving raw text, figures, references, and semantic information as input (901), and determining an allocation (1003) of text, figures, and references for each page of a document. The method also includes, for each page of the document, determining a template (1005) for displaying the allocation assigned to the page, and scaling template fields to exhibit the text, figures, and references assigned to the page. The method then renders (1007) the document with text, figures, and references allocated to each page within appropriate scaled template fields of the template selected for each page.

  • SYSTEM AND METHOD FOR IMPROVED DENTAL GEOMETRY REPRESENTATION

    A digital data set representing a pre-scanned tooth geometry, including generic crown data, is merged with data representing a scanned patient tooth crown image, which lacks sufficient data to completely represent a complete tooth crown.

  • CONNECTIVITY DEPENDED GEOMETRY OPTIMIZATION FOR REAL-TIME RENDERING

    Disclosed is a computer-implemented method for visualising/rendering a computer model, the computer model comprising a plurality of components wherein the method comprises: storing a plurality of parts of at least one of the plurality of components, each part including geometry information for visualising/rendering the part, storing information indicative of the position and orientation of a plurality of components in a coordinate system, determining a spatial relationship between individual components, determining for the at least one component a number of stored parts to use for visualising/rendering the component, based on the determined spatial relationship between the individual components. By using the spatial relationship between the components to determine the number of parts to use for visualising/rendering a component, knowledge about the geometry of individual components and the connections of the components with other components can be used to find hidden parts that can be removed.

  • BEARING FACE GEOMETRY FOR GEAR PUMP

    A bearing includes a bridge land geometry having a finger cut that defines a width ISW, a center of the width ISW displaced from a shaft axis a radial distance ISR, a ratio of ISW/ISR between 0.074-0.293, to reduce cavitation and pressure ripple.

  • USING GATHERED SYSTEM ACTIVITY STATISTICS TO DETERMINE WHEN TO SCHEDULE A PROCEDURE

    Provided are a method, system, and computer program product for using gathered system activity statistics to determine when to schedule a procedure. Activity information is gathered in a computer system during time slots for recurring time periods. A high activity value is an activity amount of a slot having a maximum amount of activity and a low activity value is an activity amount of a slot having a minimum amount of activity. A threshold point is determined as a function of the high activity, the low activity, and a threshold percent comprising a percentage value. A selection is made of at least one lull window having a plurality of consecutive time slots each having an activity value lower than the threshold point and the procedure in the computer system is scheduled to be performed during the time slots in the lull window in a future time period.

  • ADAPTIVE INTEGRATED CIRCUITRY WITH HETEROGENOUS AND RECONFIGURABLE MATRICES OF DIVERSE AND ADAPTIVE COMPUTATIONAL UNITS HAVING FIXED, APPLICATION SPECIFIC COMPUTATIONAL ELEMENTS

    The present invention concerns a new category of integrated circuitry and a new methodology for adaptive or reconfigurable computing. The preferred IC embodiment includes a plurality of heterogeneous computational elements coupled to an interconnection network. The plurality of heterogeneous computational elements include corresponding computational elements having fixed and differing architectures, such as fixed architectures for different functions such as memory, addition, multiplication, complex multiplication, subtraction, configuration, reconfiguration, control, input, output, and field programmability. In response to configuration information, the interconnection network is operative in real-time to configure and reconfigure the plurality of heterogeneous computational elements for a plurality of different functional modes, including linear algorithmic operations, non-linear algorithmic operations, finite state machine operations, memory operations, and bit-level manipulations. The various fixed architectures are selected to comparatively minimize power consumption and increase performance of the adaptive computing integrated circuit, particularly suitable for mobile, hand-held or other battery-powered computing applications.

  • METHOD AND SYSTEM FOR OFFERING FINANCIAL PRODUCTS BASED ON A CUSTOMER'S DETERMINED LIFE STATUS

    The present invention concerns a new category of integrated circuitry and a new methodology for adaptive or reconfigurable computing. The preferred IC embodiment includes a plurality of heterogeneous computational elements coupled to an A system and method to provide financial products throughout the life of a customer. The present invention determines the life status of a customer. The life status is determined by analyzing the customer information from a variety of sources. This information is filtered or inputted into an algorithmic model to identify appropriate financial products to offer to the customer. In addition, the customer's creditworthiness is used to determine or optimize the financial product offered to the customer.

  • HYBRID CONTROL DEVICE

    A brain-based device (BBD) for moving in a real-world environment has sensors that provide data about the environment, actuators to move the BBD, and a hybrid controller which includes a neural controller having a simulated nervous system being a model of selected areas of the human brain and a non-neural controller based on a computational algorithmic network. The neural controller and non-neural controller interact with one another to control movement of the BBD.

  • SYSTEMS AND METHODS FOR CONDUCTING MORE RELIABLE ASSESSMENTS WITH CONNECTIVITY STATISTICS

    Systems and methods for social graph data analytics to determine the connectivity between nodes within a community are provided. A user may assign user connectivity values to other members of the community, or connectivity values may be automatically harvested, calculated, or assigned from third parties or based on the frequency of interactions between members of the community. The paths connecting a first node to a second node may be retrieved, and social graph data analytics may be used to determine a network connectivity value from all or a subset of all of the retrieved paths and/or one or more connectivity statistics value associated with the first node and/or the second node. Network connectivity values and/or other social graph data may be outputted to third-party processes and services for use in initiating automatic transactions or making automated network-based or real-world decisions.

  • Rearrangement of Algebraic Expressions Based on Operand Ranking Schemes

    A system and method for rearranging algebraic expressions occurring in program code based on a scheme of ranking operands. The system scans program code to identify an algebraic expression specified by the program code. The expression includes binary operations, scalar operands and at least one array operand. The system operates on the algebraic expression to obtain a final expression by: computing a rank for each of the operands; and performing algebraic transformations on selected subexpressions of the algebraic expression so that in the final expression operands are combined in the order of their rank. The ranking scheme may be designed to force scalars to be combined before arrays, and/or, to force constants to be combined first, loop invariants second, and variants last. In some embodiments, the ranking scheme is a vector ranking scheme including two or more components (such as invariance rank, dimensional rank and data-size rank).

  • DISTRIBUTED COMPUTING SYSTEM HIERARCHAL STRUCTURE MANIPULATION

    A hierarchal structure manipulation system may include a nested table generation module to generate nested tables representing hierarchal relationships of computing systems in a distributed computing environment. A hierarchal structure manipulation module may access at least one nested table to manipulate a hierarchal structure represented by the nested table. The hierarchal structure manipulation module may use a generic algebraicspecification to manipulate the hierarchal structure represented by the nested table. The generic algebraic specification may provide a generic abstraction across a plurality of the computing systems in the distributed computing environment.

  • 3D Chemical Pattern Control in 2D Fluidics Devices

    Methods of controllably creating three-dimensional (3D) combined-flow-interface patterns in multi-lane fluidic devices, and systems, apparatuses and software therefor. In one example, the 3D-pattern is created and varied as a function of one or more of the geometry of the inlets to a main fluidic channel in which the 3D-pattern is formed, the Reynolds number of the flows, the dimensions of the main fluidic channel and the inlets, and the spacing of adjacent inlets. In one embodiment particularly disclosed, differing 3D combined-flow-interface patterns are created using a three-lane fluidic device having a fixed inlet geometry. In another embodiment particularly disclosed, differing 3D combined-flow-interface patterns are created using a five-lane fluidic device having a fixed inlet geometry that can be used to effectively mimic variable inlet geometries. ________________________________________

  • ASPHALT COMPOSITION

    A computational method is provided for predicting roadway failure due to degradation of the roadway over time as a function of the input loads, the roadway geometry, the material properties of the constitutents in the asphaltic pavement, the shape, distribution, orientation and volume fractions of the constituents, and environmental conditions. The unique and new feature of the method is that it employs several physically based predictive methodologies simultaneously.

  • N-PHASIC FINITE ELEMENT METHOD FOR CALCULATING A FULLY COUPLED RESPONSE OF MULTIPHASE COMPOSITIONAL FLUID FLOW AND A SYSTEM FOR UNCERTAINTY ESTIMATION OF THE CALCULATED RESERVOIR RESPONSE

    In an exemplary embodiment, a method is disclosed for developing an N-phasic finite element model for performing fully coupled analyses of multi-phase compositional fluid flow and heat flow in nonlinearly deforming porous solid media with time-dependent failure. The method can include formulating a finite element model of the behavior of a coupled solid-fluid formation, having complex geometry and behavior, and applying the model to derive the response of the formation in the form of one or more displacement fields for the solid phases and one or more pressure fields for the fluid phases in a zone of interest in a formation. In an exemplary embodiment, a system is disclosed for estimating the uncertainties in the derived displacement and pressure field solutions for the response of the fully coupled solid-fluid phases.

  • REDUCED TOPOLOGY ROUTING IN SHARED MEDIA COMMUNICATION NETWORKS

    In one embodiment, a particular node in a shared communication network determines a current path cost in a routing topology from itself to a root node via a current parent node. The particular node also determines a respective path cost from each reachable potential parent node of the particular node to the root node via each potential parent and a respective link metric to each potential parent node. A set of acceptable parent nodes are determined from the potential parent nodes that have a respective path cost that is less than the current path cost plus an acceptable cost increase, and also have a respective link metric that is within an acceptable range. By determining a respective number of child nodes for each acceptable parent node, the particular node may then select a new parent node based on giving preference to those having a greater respective number of child nodes.

  • SELECTIVE TOPOLOGY ROUTING FOR DISTRIBUTED DATA COLLECTION

    In one embodiment, a device, such as a network management server, determines a traffic matrix of a mesh network, where the traffic matrix indicates an amount of traffic per type of traffic transitioning between the mesh network and a global computer network via one or more current root devices. One or more optimized root devices may then be selected for corresponding directed acyclic graphs (DAGs) based on the amount of traffic and type of traffic. As such, a DAG formation request may be transmitted to the selected root devices, carrying a characteristic for a corresponding DAG to form by the respective selected root devices that indicates which one or more types of traffic correspond to the corresponding DAG.

  • METHOD AND APPARATUS FOR DETERMINING A NETWORK TOPOLOGY DURING NETWORK PROVISIONING

    In one embodiment, a method includes receiving a provisioning instruction including a device identifier from an external management entity, receiving the device identifier from a network device, associating the provisioning instruction the network device, and sending a portion of the provisioning instruction to the network device. The device identifier being associated with a virtual resource. The associating is based on the device identifier of the virtual resource and a device identifier of a network device. The portion of the provisioning instruction is sent to the network device based on the associating.

  • OVERLAY AND SEMICONDUCTOR PROCESS CONTROL USING A WAFER GEOMETRY METRIC

    The present invention may include acquiring a wafer shape value at a plurality of points of a wafer surface at a first and second process level, generating a wafer shape change value at each of the points, generating a set of slope of shape change values at each of the points, calculating a set of process tool correctables utilizing the generated set of slope of shape change values, generating a set of slope shape change residuals (SSCRs) by calculating a slope of shape change residual value at each of the points utilizing the set of process tool correctables, defining a plurality of metric analysis regions distributed across the surface, and then generating one or more residual slope shape change metrics for each metric analysis region based on one or more SSCRs within each metric analysis region.

  • TIME SLICE PROCESSING OF TESSELLATION AND GEOMETRY SHADERS

    One embodiment of the present invention sets forth a technique for redistributing geometric primitives generated by tessellation and geometry shaders for processing by multiple graphics pipelines. Geometric primitives that are generated in a first processing cycle are collected and redistributed more evenly and in smaller tasks to the multiple graphics pipelines for vertex processing in a second processing cycle. The smaller tasks do not exceed the resource limits of a graphics pipeline and the per-vertex processing workloads of the graphics pipelines in the second cycle are balanced and make full use of resources. Therefore, the performance of the tessellation and geometry shaders is improved

  • TIME SLICE PROCESSING OF TESSELLATION AND GEOMETRY SHADERS

    One embodiment of the present invention sets forth a technique for redistributing geometric primitives generated by tessellation and geometry shaders for processing by multiple graphics pipelines. Geometric primitives that are generated in a first processing cycle are collected and redistributed more evenly and in smaller tasks to the multiple graphics pipelines for vertex processing in a second processing cycle. The smaller tasks do not exceed the resource limits of a graphics pipeline and the per-vertex processing workloads of the graphics pipelines in the second cycle are balanced and make full use of resources. Therefore, the performance of the tessellation and geometry shaders is improved

  • Editing and Saving Key-Indexed Geometries in Media Editing Applications

    Some embodiment provide media editing applications that include libraries that (i) provide presets (i.e., predefined operations and/or predefined attribute values) for modifying key indices and interpolation between the key indices, and/or (ii) provide storage for storing presets defined by a user of the media editing application. Some embodiments display the presets as thumbnails, thumbnails with text descriptions, and/or text-defined operations. In addition, some embodiments provide user-interface tools that allow the user of the media editing application to augment the preset libraries by storing a selected part of one key-indexed geometry or parts of multiple different geometries as a user-defined preset

  • REMOTE HIGH-PERFORMANCE MODELING SYSTEM FOR MATERIAL JOINING AND MATERIAL FORMING

    A system and method for creating computerized models of forming processes, wherein forming process parameters including material type, material geometry, forming method, incoming material properties, forming diegeometry, forming die thermal management method, lubrication method, forming rate, material constraint conditions, incoming material temperature, and other possible parameters are preselected by a user.

  • METHOD AND SYSTEM FOR PATIENT-SPECIFIC MODELING OF BLOOD FLOW

    Embodiments include a system for determining cardiovascular information for a patient. The system may include at least one computer system configured to receive patient-specific data regarding a geometry of the patient's heart, and create a three-dimensional model representing at least a portion of the patient's heart based on the patient-specific data. The at least one computer system may be further configured to create a physics-based model relating to a blood flow characteristic of the patient's heart and determine a fractional flow reserve within the patient's heart based on the three-dimensional model and the physics-based model.

  • MORPHING SEGMENTED WIND TURBINE AND RELATED METHOD

    A downwind morphing rotor that exhibits bending loads that will be reduced by aligning the rotor blades with the composite forces. This reduces the net loads on the blades which therefore allow for a reduced blade mass for a given maximum stress. Also provided is a pre-aligned configuration rotor whereby the rotor geometry and orientation does not change with wind speed, and instead is fixed at a constant downwind deflection consistent with alignment at or near the rated wind speed conditions. Also provided is a twist morphing rotor where the airfoil-shapes around the spars twist relative to the wind due to aerodynamic forces so as to unload the rotors when there is a gust. This can help reduce unsteady stresses on the blade and therefore may allow for reduced blade mass and cost. The twist morphing rotor may be combined with either downwind morphing rotor or pre-alignment rotor.

  • SWIRL HELICAL ELEMENTS FOR A VISCOUS IMPINGEMENT PARTICLE COLLECTION AND HYDRAULIC REMOVAL SYSTEM

    A system and methods for separating liquids, aerosols, and solids from a flowing gas stream whereby gas flows through a helical path formed in a separator element. Partially separated gas exits the bottom of the separator element at a generally conical cavity. Clean gas exits through an inner tube that is axially aligned beneath the helical path. Separated materials exit through an annular space between the inner tube and an outer tube. Separation occurs in the helical channels which include radially diverging walls to provide an aerodynamically efficient flow, in a region of high swirl created in a generally conical cavity beneath the separator element, and in a toroidal vortex ring created in the annular space. The area and geometry of the helical path, the conical cavity, and the inner and outer tubes is optimized to provide efficient separation at varying gas flow rates and at varying liquid loads.

  • CIRCUIT VERIFICATION USING COMPUTATIONAL ALGEBRAIC GEOMETRY

    In one exemplary embodiment of the invention, a method includes: receiving a first description for a circuit whose operation over a plurality of inputs is to be verified; receiving a second description for expected behavior of the circuit, where the expected behavior in the second description is expressed as a set of algebraic systems of multivariable polynomials over at least one Galois field; applying at least one computational algebraic geometry technique to a combination of the first description and the second description to determine whether the circuit is verified, where verification of the circuit confirms that at least one output obtained based on the first description corresponds to at least one expected value based on the expected behavior expressed in the second description; and outputting an indication as to whether the circuit is verified.

  • SIMULATION MODEL OPTIMIZATION

    A method can include providing a finite element grid described with respect to a lateral coordinate axis and a depth coordinate axis to model a multilayer sedimentary basin; coarsening the finite element grid with respect to the lateral coordinate axis to provide a coarsened finite element grid; performing a backstripping and forward simulation cycle using the coarsened finite element grid to provide geometry and porosity results for the model of the multilayer sedimentary basin; refining the finite element grid with respect to the lateral coordinate axis to provide a refined finite element grid; and performing backstripping and forward simulation cycle using the refined finite element grid and at least the porosity results to provide enhanced geometry and porosity results for the model of the multilayer sedimentary basin. Various other apparatuses, systems, methods, etc., are also disclosed.

  • GIGA-CELL LINEAR SOLVER METHOD AND APPARATUS FOR MASSIVE PARALLEL RESERVOIR SIMULATION

    A linear solver methodology is applied to reservoir data to solve for large system of equations arising from high-resolution reservoir simulation of giant oil fields with minimal upscaling using either structured grids or unstructured grids. Full geologic complexity and discontinuities at the resolution desired for accurate simulation results may be taken into account. A general unstructured method is provided, so that very complex flowgeometry near multi-lateral wells can be modeled.

  • SYSTEMS AND METHODS FOR AUDITING OPTIMIZERS TRACKING LUMBER IN A SAWMILL

    An audit system and method audits operation of an optimizer system in a mill, for example auditing operation of a cant optimizer which optimizes sawing patterns. The audit system may be completely independent of the optimizer. For example, the audit system may acquire information (e.g., optically) indicative of a geometry of boards downstream from a piece of equipment such as a gangsaw. The audit system may computationally reconstruct a cant from which the boards were sawn, determine an outside dimension indicative of wane, and simulate alternative sawing patterns, determining a theoretical amount of recovery that would have resulted from each and comparing such to actual recovery from the log or cant. Alternative sawing patterns may take into account various wane rules and comparison may take into account current demand and/or prices for dimensional lumber.

  • GEOMETRY OF HEAT EXCHANGER WITH HIGH EFFICIENCY

    The present disclosure includes geometry of a two-fluid heat exchanger to provide higher energy efficiency than conventional heat exchangers. The geometry is based upon sequential branching of nearly circular passages in sets, followed by some deformation and twisting of the sequential branches that intermingle flow passages of one fluid with flow passages of another fluid. The flow passages gradually vary in dimension from larger branching at fluid entrance and exit to smaller branching in the middle section of the heat exchanger. The heat exchanger is substantially symmetric, with the sequential branching in the first half being mirrored as serial regrouping in the second half. The present disclosure also provides stacking methods and layered manufacturing methods for fabricating the three-dimensional geometry of the heat exchanger.

  • 3D FABRICATION OF NEEDLE TIP GEOMETRY AND KNIFE BLADE

    The present invention provides a method for creating a beveled needle or a blade. The method employs a side wall surface of an angled post as a base to control beveled tip geometry. The invention provides needles, microneedle arrays, blades and microblade arrays with sufficient sharpness and toughness.

  • APPARATUS AND METHOD FOR MERGING GEOMETRY-BASED SPATIAL AUDIO CODING STREAMS

    An apparatus for generating a merged audio data stream is provided. The apparatus includes a demultiplexer for obtaining a plurality of single-layer audio data streams, wherein each input audio data stream includes one or more layers, wherein the demultiplexer is adapted to demultiplex each one of one or more input audio data streams having one or more layers into two or more demultiplexed audio data streams having exactly one layer. Furthermore, the apparatus includes a merging module for generating the merged audio data stream based on the plurality of single-layer audio data streams. Each layer of the input data audio streams, of the demultiplexed audio data streams, of the single-layer data streams and of the merged audio data stream includes a pressure value of a pressure signal, a position value and a diffuseness value as audio data.

  • Wayside Measurement of Railcar Wheel to Rail Geometry

    Considerable damage to rails, wheels, and trucks can result from geometric anomalies in the wheelsets, rails, and truck hardware. A solution for identifying and quantifying geometric anomalies known to influence the service life of the rolling stock or the ride comfort for the case of passenger service is described. The solution comprises an optical system, which can be configured to accurately perform measurements at mainline speeds (e.g., greater than 100 mph). The optical system includes laser line projectors and imaging cameras and can utilize structured light triangulation.

  • METHOD AND DEVICE FOR USING SUBSTRATE GEOMETRY TO DETERMINE OPTIMUM SUBSTRATE ANALYSIS SAMPLING

    A method and apparatus for process control in the processing of a substrate is disclosed in the present invention. Embodiments of the present invention utilize a first analysis tool to determine changes in a substrate's geometry. The substrate geometry data is used to generate sampling plan that will be used to check areas of the substrate that are likely to have errors after processing. The sampling plan is fed forwards to a second analysis tool that samples the substrate after it has been processed. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

  • METHOD AND APPARATUS FOR ACQUIRING GEOMETRY OF SPECULAR OBJECT BASED ON DEPTH SENSOR

    A method of acquiring geometry of a specular object is provided. Based on a single-view depth image, the method may include receiving an input of a depth image, estimating a missing depth value based on connectivity with a neighboring value in a local area of the depth image, and correcting the missing depth value. Based on a composite image, the method may include receiving an input of a composite image, calibrating the composite image, detecting an error area in the calibrated composite image, and correcting a missing depth value of the error area.

  • DYNAMIC GEOMETRY SUPPORT FOR VEHICLE COMPONENTS

    Apparatuses and methods for adjusting a position of at least one component of a vehicle for a user of the vehicle. A user is identified with a user key associated with the user. The user key and a vehicle identifier associated with the vehicle are transmitted to a server remote from the vehicle. At least one user setting for the vehicle is received from the remote server, with the at least one user setting relating to the user key, the vehicle identifier, and the position of the at least one component. A vehicle system setting is updated with the at least one user setting so as to adjust the position of the at least one component based on the at least one user setting when the vehicle system setting does not correspond with the at least one user setting.

  • DECOMPOSITION OF 3D GEOMETRY INTO DEVELOPABLE SURFACE PATCHES AND 2D CUT PATTERNS

    Embodiments disclosed herein provide techniques for decomposing 3D geometry into developable surface patches and cut patterns. In one embodiment, a decomposition application receives a triangulated 3D surface as input and determines approximately developable surface patches from the 3D surface using a variant of k-means clustering. Such approximately developable surface patches may have undesirable jagged boundaries, which the decomposition application may eliminate by generating a data structure separate from the mesh that contains patch boundaries and optimizing the patch boundaries or, alternatively, remeshing the mesh such that patch boundaries fall on mesh edges. The decomposition application may then flatten the patches into truly developable surfaces by re-triangulating the patches as ruled surfaces. The decomposition application may further flatten the ruled surfaces into 2D shapes and lay those shapes out on virtual sheets of material. A person, or machinery, may cut out those shapes from physical sheets of material based on the layout.

  • OPERATIVELY TUNING IMPLANTS FOR INCREASED PERFORMANCE

    A method for preoperatively characterizing an individual patient's biomechanic function in preparation of implanting a prosthesis is provided. The method includes subjecting a patient to various activities, recording relative positions of anatomy during said various activities, measuring force environments responsive to said patient's anatomy and affected area during said various activities, characterizing the patient's biomechanic function from said relative positions and corresponding force environments, inputting the measured force environments, relative positions of knee anatomy, and patient's biomechanic function characterization into one or more computer simulation models, inputting a computer model of the prosthesis into said one or more computer simulation models, and manipulating the placement of the prosthesis in the computer simulation using said patient's biomechanic function characterization and said computer model of the prosthesis to approximate a preferred biomechanical fit of the prosthesis.

  • High Throughput Screening for Antimicrobial Dosing Regimens

    Provided herein are methods and computer-implemented systems for using computer simulations to predict likelihood of a cell population associated with a pathophysiological condition acquiring resistance to a therapeutic agent, to screen for therapeutic agents effective to suppress acquisition of resistance within a cell population and to treat the pathophysiological conditions associated therewith. The computer simulation comprises at least an input/out system and a mathematical model, including operably linked equations, parameter values and constant values, of growth response over a period of time of a cell population in contact with an therapeutic agent. Also provide is a method for determining a best-fit mathematical model of adaptation of a microbial population to a therapeutic agent over time and using the model to simulate microbial population behavior to a therapeutic agent.

  • Determination Of Failure In Sheet Metal Forming Simulation Using Isotropic Metal Failure Criteria

    Systems and methods of determining structural failure in a computer simulation of manufacturing a sheet metal part are disclosed. A FEA model defined for a sheet metal manufacturing procedure includes a plurality of shell elements representing sheet metal blank. Shell elements are configured for emulating anisotropic material properties of the sheet metal. Numerically-simulated structural behaviors are obtained by conducting acomputer simulation of manufacturing the sheet metal part using the FEA model with a metal forming simulation application module. The numerically-simulated structural behaviors include structural deformations in forms of equivalent strain and plastic flow direction during forming of the sheet metal part. A structural failure determination criterion is constructed using a planar isotropic material model of the sheet metal. Finally, the obtained structural behaviors are compared with the failure determination criterion to determine whether there is a structural failure in the computer simulation of manufacturing the sheet metal part.

  • TAILOR-MADE STENT GRAFT AND PROCEDURE FOR MINIMALLY INVASIVE ANEURYSM REPAIR WITH NOVEL TAILOR-MADE BALLOON, NOVEL GUIDEWIRE, AND NOVEL CAPSULATED BIOGLUE

    An individually tailored endovascular stent graft device and procedure is for performing a no-cut repair of different aneurysm types: ascending, descending, arch, abdominal and cerebral aneurysms. Many aneurysm types can thus be treated without the need for open heart surgery. The stent may be biomaterial based (collagen-based in the preferred embodiment). No shape-memory metals need be used therefore allowing better implantation flexibility and better patient recovery. The stent may be fixated in the designated treatment area by remotely activating individually capsulated bicomponent biological glue by UV light/ultrasound means, wherein each component of the glue is coated separately. Further presented is a method for calculating stent graft implantation path by determining the sequence of implantation points through computer simulation means, wherein the implantation is done by discrete pulses.