Patent application number | Description | Published |
20110137634 | CANONICALIZED VERSIONS OF REUSE CANDIDATES IN GRAPHICAL STATE DIAGRAMS - Exemplary embodiments provide techniques for replacing a portion of a state diagram with a generalized, canonical version of the portion. The canonicalized version mimics the structure or semantics (or both) of the portion of the state diagram, although the canonicalized version need not be a perfect match for the structure or semantics of the portion. Exemplary embodiments further provide techniques for identifying a portion of a state diagram for reuse, and generating a canonicalized version of the portion. | 06-09-2011 |
20130212054 | GENERATING A STATE DIAGRAM - A computing device may include a memory to store data that describes a state machine model that includes destination states and source states. The source states may be associated with conditions upon which the state machine model is to transition from a corresponding source state to one of the destination states. The device may also include a processor configured to generate data to describe a state diagram from the data that describes the state machine model. The state diagram may include the graphical symbols and lines. Each of the graphical symbols may represent one of the source states or one of the destination states. The lines may represent transitions and include one or more vertical lines to represent transitions to one of the destination states from more than one of the source states. The graphical symbol may represent the one of the destination states is not adjacent to the graphical symbols to represent the more than one of the source states. The processor may arrange graphical symbols in a first row, arrange lines, and arrange vertical lines in a second row that does not overlap with the first row. | 08-15-2013 |
20130290925 | UNIFIED STATE TRANSITION TABLE DESCRIBING A STATE MACHINE MODEL - A computer-readable memory device may include instructions to store data describing a state machine model including source states and destination states. The device may also include instructions to store, for each of the source states, a condition field identifying a condition upon which, when satisfied, the state machine model transitions from the source state to one of the destination states. The device may also include instructions to store, for each of source states, a destination field identifying the one of the destination states. Each of at least two of the source states may identify an identical destination state in the corresponding destination field. Each of at least two of the source states may identify an identical condition in the corresponding condition field. | 10-31-2013 |
20140351788 | RENAMING INSTANCES OF AN ENTITY IN A CODING ENVIRONMENT - Exemplary embodiments provide computer-implemented methods, computer-readable media, and systems for changing the identifier associated with an entity, such as a variable or function, in a portion of code. During editing, a reference may be maintained that identifies the location of each instance of the entity in the code. When the identifier associated with one instance of the entity is changed, the change in the identifier may be propagated throughout the code to change each instance of the identifier in the code. The identifier may be changed without interrupting the workflow of the user and without the need to change to a separate refactoring mode. In some embodiments, a syntactical analysis may be performed and some or all instances of the identifier may be changed based on one or more rules. | 11-27-2014 |
Patent application number | Description | Published |
20140359560 | DEFINING ATTRIBUTES OF VARIABLES IN A STATE CHART OF A TECHNICAL COMPUTING ENVIRONMENT - A device may receive a model generated via a technical computing environment, where the model included a state chart with one or more variables. The device may receive a selection of a particular variable from the state chart, and may provide, for display and based on the selection, a user interface for defining attributes associated with the particular variable. The device may receive, via the user interface, one or more user-defined attributes for the particular variable, where at least one of the one or more user-defined attributes is defined independently of a reference to the particular variable. The device may apply the one or more user-defined attributes in the model and the state chart. | 12-04-2014 |
20140359561 | IMPLICIT EVENT BROADCAST IN A STATE CHART OF A TECHNICAL COMPUTING ENVIRONMENT - A device may receive a state chart generated via a technical computing environment. The state chart may include a first state block and a second state block, and the second state block may include textual code understood by a textual engine of the technical computing environment. The device may receive, in association with the second state block, an implicit event command that references an event associated with the first state block, and may initiate execution of the state chart. The device may receive, during execution of the state chart, an indication of occurrence of the event associated with the first state block, and may initiate the second state block based on the indication. | 12-04-2014 |
20140359566 | RESOLUTION OF TEXTUAL CODE IN A GRAPHICAL HIERARCHICAL MODEL OF A TECHNICAL COMPUTING ENVIRONMENT - A device may receive a chart generated via a technical computing environment, where the chart includes a textual portion and a graphical portion, and the graphical portion includes state information. The device may parse the chart into the textual portion and the graphical portion, and may process the textual portion with a textual engine of the technical computing environment to generate textual results. The device may process the graphical portion with a graphical engine of the technical computing environment to generate graphical results, and may combine the textual results with the graphical results to generate chart results. The device may output or store the chart results. | 12-04-2014 |
20140359567 | TEXTUAL CODE PROVIDED IN TEMPORAL AND CHANGE OPERATORS OF A TECHNICAL COMPUTING ENVIRONMENT - A device may receive a state chart generated via a technical computing environment, where the state chart may include at least one state block. The device may receive a time-based or an event-based operator associated with the at least one state block. The time-based or the event-based operator may include textual code understood by a textual engine of the technical computing environment. The device may initiate execution of the state chart, and may process, during the execution the state chart, the time-based or the event-based operator and the at least one state block with a graphical engine of the technical computing environment to generate graphical results. The device may process, during the execution of the state chart, the textual code of the time-based or the event-based operator with the textual engine to generate textual results, and may combine the graphical results with the textual results to generate chart results. | 12-04-2014 |
20140359568 | TIME-BASED OPERATIONS VIA TEXTUAL CODE IN A TECHNICAL COMPUTING ENVIRONMENT - A device may receive a state chart generated via a technical computing environment. The state chart may include a state block with a single section of textual code. The single section of textual code may include a time-based portion and an output portion. The device may initiate execution of the state chart, and may process, during the execution of the state chart, the time-based portion with a graphical engine of the technical computing environment to generate a time-based method. The device may process, during the execution of the state chart, the output portion with a textual engine of the technical computing environment to generate an output method. The device may provide the time-based method and the output method in output code, where the time-based method may be separate from the output method in the output code. | 12-04-2014 |
20140359569 | GRAPHICAL FUNCTION SPECIALIZATION - A device receives a state chart generated via a technical computing environment. The state chart includes a function block that includes a function that includes function input(s)/output(s). The state chart includes a state block that includes a function call to the function of the function block. The function call includes call input(s)/output(s). The device initiates execution of the state chart, parses the function into the function input(s)/output(s), and parses the function call into the call input(s)/output(s). The device processes, during the execution of the state chart, the function input(s)/output(s) with a graphical engine of the technical computing environment to generate function-related code. The device processes, during the execution of the state chart, the call input(s)/output(s) with a textual engine of the technical computing environment to generate function call-related code, and provides the function-related code and the function call-related code in generated code. | 12-04-2014 |
20150331978 | CODE GENERATION FOR USING AN ELEMENT IN A FIRST MODEL TO CALL A PORTION OF A SECOND MODEL - A device may generate code for a caller element of a first graphical model and a called element of a second graphical model by generating a first function and a second function. The first function may represent an interface between the caller element and the called element. The first function may include a first input argument corresponding to an input variable and a first output argument corresponding to an output variable. The second function may represent an underlying function of the called element. The underlying function may include the input variable passed from the caller element and the output variable. The underlying function may further include an internal input variable and an internal output variable. The second function may include second input arguments corresponding to the input variable and the internal input variable, and may include second output arguments corresponding to the output variable and the internal output variables. | 11-19-2015 |
20150331979 | USING AN ELEMENT IN A FIRST MODEL TO CALL A PORTION OF A SECOND MODEL - A device may receive function information that describes a caller element that calls a called element that is separate from the caller element. The function information may identify a name or reference of the called element, a passed input, and a passed output. The passed input may be provided by the caller element to the called element, and the passed output may be received by the caller element from the called element. The caller element may be associated with a caller model, and the called element may be associated with a called model. The device may identify the called element, and may execute the caller element in a simulation environment. Execution of the caller element may cause execution of the called element without causing execution of an entirety of the called model. The device may receive the passed output from the called element based on executing the called element. | 11-19-2015 |
Patent application number | Description | Published |
20140112467 | System and Method for Acoustic Echo Cancellation - A system and method are presented for acoustic echo cancellation. The echo canceller performs reduction of acoustic and hybrid echoes which may arise in a situation such as a long-distance conference call with multiple speakers in varying environments, for example. Echo cancellation, in at least one embodiment, may be based on similarity measurement, statistical determination of echo cancellation parameters from historical values, frequency domain operation, double talk detection, packet loss detection, signal detection, and noise subtraction. | 04-24-2014 |
20150254338 | SYSTEM AND METHOD FOR OPTIMIZATION OF AUDIO FINGERPRINT SEARCH - A system and method are presented for optimization of audio fingerprint search. In an embodiment, the audio fingerprints are organized into a recursive tree with different branches containing fingerprint sets that are dissimilar to each other. The tree is constructed using a clustering algorithm based on a similarity measure. The similarity measure may comprise a Hamming distance for a binary fingerprint or a Euclidean distance for continuous valued fingerprints. In another embodiment, each fingerprint is stored at a plurality of resolutions and clustering is performed hierarchically. The recognition of an incoming fingerprint begins from the root of the tree and proceeds down its branches until a match or mismatch is declared. In yet another embodiment, a fingerprint definition is generalized to include more detailed audio information than in the previous definition. | 09-10-2015 |
20150255075 | System and Method to Correct for Packet Loss in ASR Systems - A system and method are presented for the correction of packet loss in audio in automatic speech recognition (ASR) systems. Packet loss correction, as presented herein, occurs at the recognition stage without modifying any of the acoustic models generated during training. The behavior of the ASR engine in the absence of packet loss is thus not altered. To accomplish this, the actual input signal may be rectified, the recognition scores may be normalized to account for signal errors, and a best-estimate method using information from previous frames and acoustic models may be used to replace the noisy signal. | 09-10-2015 |
Patent application number | Description | Published |
20090122990 | NETWORK MOBILITY OVER A MULTI-PATH VIRTUAL PRIVATE NETWORK - Methods and apparatus for applying a single virtual private network (VPN) address to tunnels or connections associated with different access interfaces are disclosed. In one embodiment, a method includes establishing a first tunnel between a node and a VPN server. The first tunnel has a first address. The method also includes assigning a VPN address to the first tunnel, as well as establishing a second tunnel between the node and the VPN server. The second tunnel has a second address. The VPN address is assigned to the second tunnel, and VPN address is accessed by both the first address and the second address. | 05-14-2009 |
20100166179 | METHODS AND APPARATUS FOR BOOTSTRAPPING MOBILE-FOREIGN AND FOREIGN-HOME AUTHENTICATION KEYS IN MOBILE IP - Methods and apparatus for dynamically generating authentication keys are disclosed. Specifically, a Mobile-Foreign authentication key is separately generated by both the Mobile Node and Foreign Agent. Similarly, a Foreign-Home authentication key is separately generated by the Foreign Agent and the Home Agent. In accordance with one embodiment, generation of the Mobile-Foreign authentication key and Foreign-Home authentication key are accomplished via the Diffie-Hellman key generation scheme. | 07-01-2010 |
20110090815 | SYSTEM AND METHOD FOR PROVIDING A TRANSLATION MECHANISM IN A NETWORK ENVIRONMENT - An example method is provided and includes receiving a packet associated with a flow, determining a tunnel identifier for the flow, and determining a flow identifier for the flow. The method includes associating the flow identifier and the tunnel identifier to an Internet protocol (IP) address to generate a binding to be used for a network address and port translation (NAPT). In other embodiments, a routing decision is executed based on the binding between the identifiers and the IP address. The flow identifier can be a context identifier (CID), and the tunnel identifier can be a softwire tunnel ID. In yet other embodiments, the packet can be tagged as part of an encapsulation operation, which includes providing information about a network location at which the network address and port translation is to be executed. | 04-21-2011 |
20110103284 | Managing Router Advertisement Messages to Support Roaming of Wireless Mobile Client Devices - Techniques are provided to manage how router advertisement messages are forwarded for ultimate wireless transmission in a wireless network. In one embodiment, a multicast router advertisement message intended for a virtual local area network is converted into individual unicast router advertisement messages directed to specific wireless mobile client devices that are part of that virtual local area network. In another embodiment, router advertisement messages are routed between controllers according to the current location of a wireless mobile client device. In still other embodiments, techniques are provided to minimize the volume of the router advertisement messages sent over a wireless network, and to proactively send a unicast router advertisement message to a mobile client device that has performed a handoff, without waiting for a router solicitation message. | 05-05-2011 |
20110103344 | Neighbor Discovery Message Handling to Support Roaming of Wireless Mobile Client Devices - Techniques are provided herein to support roaming of wireless mobile client devices from one wireless local area network access point device to another wireless local area network access point device. Neighbor discovery messages are received from wireless mobile client devices. A neighbor discovery message specifies a target address for a neighbor discovery function. A response to a neighbor discovery message is sent to a wireless mobile client device such that the response message appears to have been sent by a wireless mobile client device that has an address that corresponds to the target address of the neighbor discovery message. | 05-05-2011 |
20110258431 | SYSTEM AND METHOD FOR PROVIDING PREFIXES INDICATIVE OF MOBILITY PROPERTIES IN A NETWORK ENVIRONMENT - An example method includes receiving an Internet protocol (IP) address request in a network and selecting an IP address associated with a prefix that represents an IP subnet. The prefix includes a color attribute to be provided as part of a communication session that includes a plurality of packets. The prefix defines one or more properties associated with an application for the session. The prefix is communicated to a network element in a signaling plane, the prefix is configured to be used to make a routing decision for at least some of the plurality of packets. In more specific embodiments, the method can include applying one or more network policies based on the prefix associated with the IP address. The method could also include decrypting an encryption protocol in order to identify the prefix of a subsequent communication flow, and executing a routing decision based on the prefix. | 10-20-2011 |
20120047263 | ATTRIBUTE DRIVEN MOBILE SERVICE CONTROL LOGIC - The disclosed embodiments enable service policies to be provisioned for a Mobile Node dynamically. A network device receives a message including at least one of one or more attributes of a Mobile IP session and one or more user preferences associated with the Mobile Node. One or more rules to be applied to the Mobile Node may then be identified. One or more of the identified rules are executed according to at least one of one or more of the attributes of the Mobile IP session and one or more of the user preferences associated with the Mobile Node. | 02-23-2012 |
20130139221 | Web Authentication Support for Proxy Mobile IP - Techniques are provided for performing web authentication of mobile wireless devices that roam from a wireless wide area network to a wireless local area network. A redirect rule is invoked when a request is received from the mobile wireless device for world wide web access in order to obtain authentication for the mobile wireless device before permitting world wide web access. When a world wide web access request is received from the mobile wireless device, it is redirected to an authentication portal to allow a user of the mobile wireless device to enter user credentials to allow for world wide web access using the IP address. | 05-30-2013 |
20130142182 | MOBILITY IN MULTI-DEVICE MULTI-HOMED DEPLOYMENTS - Systems and methods for providing identity management and mobility management are disclosed. The management scheme provides mobility in multi-device and multi-homed deployments. A collection of three identities, a device identity, a link layer identity, and a user identity, can be used to provide mobility for a number of devices under different use scenarios. In one embodiment, a method is disclosed for receiving messages from a mobile device at a mobility gateway, the messages including identifiers such as a user identifier, a link layer identifier, and a device identifier where identifiers are stored or retained at the mobility gateway. When a subsequent network attach request is received including one or more identifiers, a reconnection can occur, based on a result of comparing the stored identifiers with the received one or more identifiers. | 06-06-2013 |
20130195037 | SYSTEM AND METHOD FOR PROVIDING PREFIXES INDICATIVE OF MOBILITY PROPERTIES IN A NETWORK ENVIRONMENT - An example method includes receiving an Internet protocol (IP) address request in a network and selecting an IP address associated with a prefix that represents an IP subnet. The prefix includes a color attribute to be provided as part of a communication session that includes a plurality of packets. The prefix defines one or more properties associated with an application for the session. The prefix is communicated to a network element in a signaling plane, the prefix is configured to be used to make a routing decision for at least some of the plurality of packets. In more specific embodiments, the method can include applying one or more network policies based on the prefix associated with the IP address. The method could also include decrypting an encryption protocol in order to identify the prefix of a subsequent communication flow, and executing a routing decision based on the prefix. | 08-01-2013 |
20130223421 | SYSTEMS AND METHODS FOR SUPPORTING MULTIPLE ACCESS POINT NAMES FOR TRUSTED WIRELESS LOCAL AREA NETWORK - Systems and methods are provided for supporting multiple access point names for trusted wireless local area network (LAN.) In one method, the method includes receiving a packet at a mobile access gateway from a UE operating in a trusted wireless LAN, determining at the mobile access gateway an access point name (APN) associated with the received packet, and analyzing a binding update list (BUL) table to identify an IP address of the UE used by the determined APN. The method further includes modifying a source IP address of the received packet to the IP address of the UE used by the determined APN, and transmitting the packet to a home network associated with the APN. | 08-29-2013 |
20140026206 | SYSTEM AND METHOD FOR SUPPORTING WEB AUTHENTICATION - A method is provided in one example embodiment and includes receiving a discover message over a network; determining that the discover message is associated with an unauthenticated client (e.g., identifying a media access control (MAC) address); communicating a proxy binding update (PBU) having a binding type value set to a temporary status; and establishing a bidirectional tunnel for transporting traffic for the client. | 01-23-2014 |
20140056130 | PROVIDING INTEGRATED END-TO-END ARCHITECTURE THAT INCLUDES QUALITY OF SERVICE TRANSPORT FOR TUNNELED TRAFFIC - A method is provided in one example embodiment and includes receiving a request associated with a flow over a wireless link, where the request specifies resource requirements for the flow. The method also includes mapping an Internet protocol (IP) flow description to a plurality of tunnel IP addresses, and mapping a framed IP address to an access point (AP) tunnel endpoint address in order to establish a quality of service (QoS) for tunneled traffic. | 02-27-2014 |
20140153473 | Managing Router Advertisement Messages To Support Roaming Of Wireless Mobile Client Devices - Techniques are provided to manage how router advertisement messages are forwarded for ultimate wireless transmission in a wireless network. In one embodiment, a multicast router advertisement message intended for a virtual local area network is converted into individual unicast router advertisement messages directed to specific wireless mobile client devices that are part of that virtual local area network. In another embodiment, router advertisement messages are routed between controllers according to the current location of a wireless mobile client device. In still other embodiments, techniques are provided to minimize the volume of the router advertisement messages sent over a wireless network, and to proactively send a unicast router advertisement message to a mobile client device that has performed a handoff, without waiting for a router solicitation message. | 06-05-2014 |
20140169374 | SYSTEM AND METHOD FOR PROVIDING A TRANSLATION MECHANISM IN A NETWORK ENVIRONMENT - An example method is provided and includes receiving a packet associated with a flow, determining a tunnel identifier for the flow, and determining a flow identifier for the flow. The method includes associating the flow identifier and the tunnel identifier to an Internet protocol (IP) address to generate a binding to be used for a network address and port translation (NAPT). In other embodiments, a routing decision is executed based on the binding between the identifiers and the IP address. The flow identifier can be a context identifier (CID), and the tunnel identifier can be a softwire tunnel ID. In yet other embodiments, the packet can be tagged as part of an encapsulation operation, which includes providing information about a network location at which the network address and port translation is to be executed. | 06-19-2014 |
20150029947 | SYSTEM FOR SUPPORTING LOGICAL MOBILE NODES ON A MOBILE ACCESS GATEWAY - In one embodiment, a mobile access gateway (MAG) includes a processor, a communications interface, and logic. The communications interface is configured to communicate with at least one mobile network and at least one local mobility anchor. The logic includes a mobile node logical instance module and an selection module. The mobile node logical instance module is configured to cooperate with the processor to create a first logical instance of a first mobile node on the MAG, and the address selection module is configured to cooperate with the processor to configure an egress roaming interface for the MAG. | 01-29-2015 |
Patent application number | Description | Published |
20120296948 | PROVISIONAL AUTHORITY IN A DISTRIBUTED DATABASE - Techniques for writing data in a distributed database system having a plurality of members and a master are disclosed. In one embodiment, a write request is received at an originating member. The write request is applied to a version of a database on the originating member and is placed in a journal queue of items for propagating to the master in one single atomic action. The write request is propagated to the master. Whether the propagated write request is associated with a conflict is determined, and in an event it is determined that the propagated write request is associated with the conflict, an indication that the write request is associated with the conflict is sent to the originating member. | 11-22-2012 |
20130318130 | AUTOMATIC ENFORCEMENT OF RELATIONSHIPS IN A DATABASE SCHEMA - A technique for enforcing a database relationship is disclosed. The technique includes specifying within a database schema a reference type that associates two structures and specifies the relationship between the two structures, and automatically generating code that checks the relationship between the two structures based on the specified reference in the database schema. | 11-28-2013 |
20140012811 | PROVISIONAL AUTHORITY IN A DISTRIBUTED DATABASE - Techniques for writing data in a distributed database system having a plurality of members and a master are disclosed. In one embodiment, a write request is received at an originating member. The write request is applied to a version of a database on the originating member and is placed in a journal queue of items for propagating to the master in one single atomic action. The write request is propagated to the master. Whether the propagated write request is associated with a conflict is determined, and in an event it is determined that the propagated write request is associated with the conflict, an indication that the write request is associated with the conflict is sent to the originating member. | 01-09-2014 |
20140012827 | INDEXING OF DATABASE QUERIES - Making data available from a database is disclosed. Making data available includes specifying a query function having a query function name, wherein the query function includes a structure and a member, determining the structure and the member included in the query function, wherein the query function has a query function name and includes the structure and the member, creating an index for the structure on the member, and compiling the query function to be available to a user by invoking the query function name without the user having to specify the structure and the member. Retrieving data from a database is disclosed. Retrieving includes invoking a query function that specifies a plurality of structures and a value, accessing a cross index of the plurality of structures, and using the cross index to access the data. | 01-09-2014 |
20140012828 | MAINTAINING CONSISTENCY IN A DATABASE - Maintaining consistent DNS information is disclosed. Information associated with a resource is received. A resource record is populated with the information. View information is derived from the resource record. | 01-09-2014 |
20140019411 | SEMANTIC REPLICATION - Replicating data in a distributed database having a plurality of nodes is disclosed. Replicating includes receiving a semantic command at a local version of the database at a node, interpreting the semantic command, and applying the semantic command to the local version of the database. | 01-16-2014 |
20140019428 | TRANSACTIONAL REPLICATION - Writing data in a distributed database having a plurality of nodes is disclosed. Writing includes receiving a write request at a node, wherein the write request is associated with one or more operations to define an atomic transaction and performing the atomic transaction based on the request. The atomic transaction includes writing to a first version of the database in the node and writing to an entity representative of a state of the first version of the database. | 01-16-2014 |
20150106329 | SEMANTIC REPLICATION - Replicating data in a distributed database having a plurality of nodes is disclosed. Replicating includes receiving a semantic command at a local version of the database at a node, interpreting the semantic command, and applying the semantic command to the local version of the database. | 04-16-2015 |
Patent application number | Description | Published |
20110113020 | MAINTAINING CONSISTENCY IN A DATABASE - Maintaining consistent DNS information is disclosed. Information associated with a resource is received. A resource record is populated with the information. View information is derived from the resource record. | 05-12-2011 |
20110213782 | INDEXING OF DATABASE QUERIES - Making data available from a database is disclosed. Making data available includes specifying a query function having a query function name, wherein the query function includes a structure and a member, determining the structure and the member included in the query function, wherein the query function has a query function name and includes the structure and the member, creating an index for the structure on the member, and compiling the query function to be available to a user by invoking the query function name without the user having to specify the structure and the member. Retrieving data from a database is disclosed. Retrieving includes invoking a query function that specifies a plurality of structures and a value, accessing a cross index of the plurality of structures, and using the cross index to access the data. | 09-01-2011 |
20120150914 | AUTOMATIC ENFORCEMENT OF RELATIONSHIPS IN A DATABASE SCHEMA - A technique for enforcing a database relationship is disclosed. The technique includes specifying within a database schema a reference type that associates two structures and specifies the relationship between the two structures, and automatically generating code that checks the relationship between the two structures based on the specified reference in the database schema. | 06-14-2012 |
20130060734 | SEMANTIC REPLICATION - Replicating data in a distributed database having a plurality of nodes is disclosed. Replicating includes receiving a semantic command at a local version of the database at a node, interpreting the semantic command, and applying the semantic command to the local version of the database. | 03-07-2013 |
20130198136 | DATABASE MIGRATION - A technique for converting a first version of a database to a second version is disclosed. The technique includes determining available translation steps, selecting a translation path from the first version of the database to the second version, and executing the selected translation steps in the translation path. The translation path includes selected translation steps from among the available translation steps. | 08-01-2013 |
Patent application number | Description | Published |
20130346035 | EVALUATING FLUID FLOW IN A WELLBORE - Techniques for evaluating a fluid flow through a wellbore include identifying an input characterizing a fluid flow through a wellbore; identifying an input characterizing a geometry of the wellbore; generating a model of the wellbore based on the inputs characterizing the fluid flow and the geometry of the wellbore; simulating the fluid flow through the wellbore based on evaluating the model with a numerical method that determines fluid flow conditions at a first boundary location uphole and adjacent to a perforation of a plurality of perforations in the wellbore and at a second boundary location downhole and adjacent to the perforation; and preparing, based on the fluid flow conditions determined with the numerical method, an output associated with the simulated fluid flow through the wellbore for display to a user. | 12-26-2013 |
20150025858 | Simulating Well System Fluid Flow Based on a Pressure Drop Boundary Condition - In some aspects, techniques and systems for modeling fluid flow are described. Pressure gradient values for respective nodes of a one-dimensional flow model are computed. The nodes represent locations of fluid flow along a flow path, and the pressure gradient values are computed based on an approximation of the flow velocity at a point on the flow path. A pressure drop between two opposite ends of the flow path is calculated based on the pressure gradient values. An improved approximation of the flow velocity for the point on the flow path is calculated based on a difference between the calculated pressure drop and a pressure drop boundary condition. | 01-22-2015 |
20150066446 | CONNECTION CONDITIONS FOR MODELING FLUID TRANSPORT IN A WELL SYSTEM ENVIRONMENT - In some aspects, flow path connection conditions are generated for a flow path intersection in a one-dimensional fluid flow model. The one-dimensional fluid flow model represents a flow of well system fluid in a well system environment. The flow path connection conditions conserve fluid momentum among three or more flow path branches that meet at the flow path intersection. Fluid flow is simulated in the fracture network by operating the one-dimensional fluid flow model based on the connection condition. | 03-05-2015 |
20150066455 | Proppant Transport Model for Well System Fluid Flow Simulations - In some aspects, a one-dimensional proppant transport flow model represents flow of a proppant-fluid mixture in a subterranean region. The one-dimensional proppant transport flow model includes a proppant momentum conservation model that balances axial proppant momentum in an axial flow direction of the proppant-fluid mixture against dynamic changes in transverse proppant momentum. In some instances, the proppant momentum conservation model can vary the axial proppant momentum, for example, to account for interphase momentum transfer between the proppant and the fluid. | 03-05-2015 |
20150066457 | Modeling Fluid Displacement in a Well System Environment - In some aspects, a one-dimensional flow model is generated. The one-dimensional flow model can represent flow of a first fluid and a second fluid in a flow path in a well system environment. The one-dimensional flow model comprises an effective diffusion coefficient model for a composite fluid volume comprising the first and second fluids. The effective diffusion coefficient model calculates an effective diffusion coefficient for the composite fluid volume based on a difference between the respective densities and viscosities of the first fluid and the second fluid. | 03-05-2015 |
Patent application number | Description | Published |
20120166259 | Adjusting Demand Parameters To Reduce Allocation Errors in Display Advertising - A system and method for adjusting demand parameters to produce an optimized allocation plan for delivering a plurality of impressions to a plurality of contracts for display advertising. The method commences upon receiving a first eligibility graph, the first eligibility graph comprising a plurality of impressions, a plurality of contracts and at least one first demand parameter. For reducing errors in sampling that affect the eligibility graph, demand parameters contained within the first eligibility graph are adjusted, resulting in an adjusted first eligibility graph. Once the adjusted first eligibility graph is available, a network solver is used for solving the adjusted first eligibility graph to produce an adjusted allocation plan, which adjusted allocation plan is used for displaying at least one of the plurality of impressions. | 06-28-2012 |
20130173384 | METHODS AND SYSTEMS FOR AD PLACEMENT PLANNING - Methods and systems are disclosed which allow shifting inventory to fulfill guaranteed delivery advertisement contracts. Inventory may be allocated from a supply of unallocated inventory to one or more advertisers in accordance with guaranteed delivery agreements. Inventory may be reserved for the one or more advertisers from the remaining supply of unallocated inventory. Inventory may then be allocated to an additional advertiser by using unallocated inventory or shifted inventory, or a combination of unallocated inventory and shifted inventory. The shifted inventory is shifted out of the allocation for the first advertiser and the shifted inventory is replaced by the reserve inventory for the respective advertiser. | 07-04-2013 |
20130246161 | SYSTEMS AND METHODS FOR OPTIMIZATION-AWARE DELIVERY PACING ADJUSTMENT IN ADVERTISEMENT SERVING - Systems and methods for adjusting online ads delivery pace derive, in a computer system, a current impression delivery for an ads display contract. A plurality of estimation bands are delivered corresponding to over delivery and under delivery for the ads display contract. A relative distance is determined between the current impression delivery and the plurality of estimation bands. An adjustment factor is selected according to the relative distance. The adjustment factor is sent to a database. | 09-19-2013 |
20150348086 | METHODS AND SYSTEMS FOR AD PLACEMENT PLANNING - Methods and systems are disclosed which allow shifting inventory to fulfill guaranteed delivery advertisement contracts. Inventory may be allocated from a supply of unallocated inventory to one or more advertisers in accordance with guaranteed delivery agreements. Inventory may be reserved for the one or more advertisers from the remaining supply of unallocated inventory. Inventory may then be allocated to an additional advertiser by using unallocated inventory or shifted inventory, or a combination of unallocated inventory and shifted inventory. The shifted inventory is shifted out of the allocation for the first advertiser and the shifted inventory is replaced by the reserve inventory for the respective advertiser. | 12-03-2015 |