Abstract:
Generalized Processor Sharing (GPS) is a scheduling discipline which provides minimum service guarantees as well as fair resource sharing. The performance of GPS is governed by the scheduling weights associated with individual connections. The system discloses methods for GPS scheduling that handle an arbitrary number of connection classes and reservation-based weights and admission control techniques to achieve fairness among connection classes. The methods allow statistical multiplexing gains in the presence of multiple traffic and Quality of Service (QoS) classes of connections that share a common trunk. Also disclosed are several novel techniques to compute and adapt the weights.
Abstract:
Operations in a cellular system are controlled based on cost values that are generated using neighbor association. In neighbor association, each cost value corresponds to a cost of assigning a candidate channel to a first cell in the cellular system, assuming that the candidate channel is already assigned to a second cell in the cellular system and each cost value is based on an average power attenuation for all of the cells in the cellular system that share the same tier as the second cell with respect to the first cell, wherein the average power attenuation is based on the reuse distances between the first cell and the cells in the same tier. In one embodiment, the cost values are used in a cost-function-based dynamic channel assignment (DCA) algorithm that is, but does not have to be, applied to a list of candidate channels generated using a measurement-based DCA algorithm.
Abstract:
Method for identifying geologic features from seismic data (11) using seismic anomaly detection by a double-windowed statistical analysis. Subtle features that may be obscured using a single window on the data are made identifiable using two moving windows of user-selected size and shape: a pattern window located within a sampling window larger than the pattern window (12). If Gaussian statistics are assumed, the statistical analysis may be performed by computing mean and covariance matrices for the data within the pattern window in its various positions within the sampling window (13). Then a specific measure of degree of anomaly for each voxel such as a residue value may be computed for each sampling window using its own mean and covariance matrix (14), and finally the resulting residue volume may be analyzed, with or without thresholding, for physical features indicative of hydrocarbon potential (15).
Abstract:
Selectively actuated plungers and systems and methods including the same are disclosed herein. The methods include flowing a wellbore fluid stream in fluid contact with a plunger and in an uphole direction within a wellbore conduit while the plunger is located within a target region of the wellbore conduit. The methods further include maintaining the plunger in a low fluid drag state while a variable associated with the wellbore fluid stream is outside a threshold range and transitioning the plunger to a high fluid drag state responsive to the variable associated with the wellbore conduit being within the threshold range. The methods further include conveying the plunger in the uphole direction within the wellbore conduit. The systems include the plungers and/or hydrocarbon wells that include the plungers.
Abstract:
Methods and apparatus for actuating a downhole tool in wellbore includes acquiring a CCL data set or log from the wellbore that correlates recorded magnetic signals with measured depth, and selects a location within the wellbore for actuation of a wellbore device. The CCL log is then downloaded into an autonomous tool. The tool is programmed to sense collars as a function of time, thereby providing a second CCL log. The autonomous tool also matches sensed collars with physical signature from the first CCL log and then self-actuates the wellbore device at the selected location based upon a correlation of the first and second CCL logs.
Abstract:
There is provided a system and method for determining interwell communication in a hydrocarbon-producing field that has a plurality of wells. An exemplary method comprises determining communication relationships for the plurality of wells using a multivariate dynamic joint analysis algorithm based on data representing properties of each of the plurality of wells. The multivariate dynamic joint analysis algorithm may employ a self-response of each of the plurality of wells and an interwell response between combinations of the plurality of wells. Data representative of the communication relationships is provided.
Abstract:
Method for analysis of hydrocarbon potential of subterranean regions by generating surfaces or geobodies and analyzing them for hydrocarbon indications. Reflection-based surfaces may be automatically created in a topologically consistent manner where individual surfaces do not overlap themselves and sets of multiple surfaces are consistent with stratigraphic superposition principles. Initial surfaces are picked from the seismic data (41), then broken into smaller parts (“patches”) that are predominantly topologically consistent (42), whereupon neighboring patches are merged in a topologically consistent way (43) to form a set of surfaces that are extensive and consistent (“skeleton”). Surfaces or geobodies thus extracted may be automatically analyzed and rated (214) based on a selected measure (213) such as one or more direct hydrocarbon indications (“DHI”), e.g. AVO classification. Topological consistency for one or more surfaces may be defined as no self overlap plus local and global consistency among multiple surfaces (52).
Abstract:
The present invention is a method for clustering data points. The method represents data-points as vertices of a graph (a well-known mathematical construct) with distance-weighted arcs (lines joining each paid of points). The method then involves sorting the arcs in increasing order of their weights and adding them in ascending order, at each stage determining the number of connected components in the graph and the length of the longest added edge. The longest edge is a measure of the quality of the clustering (low values are good), and the connected components are the clusters.
Abstract:
Techniques are disclosed for controlling the transmission of packets over a communication link in a network. The invention in accordance with one aspect thereof determines a number of packet transmission connections supportable for a given buffer size in a node of the network while maintaining one or more specified quality of service requirements for packet transmission. This determination in the case of homogeneous input sources utilizes a combined approximation of a maximum number of supportable connections for a range of buffer sizes, the combined approximation being generated as a combination of a first approximation for small buffer sizes and a second approximation for large buffer sizes. The invention can also be used to determine an optimal operating point on a buffer-capacity tradeoff curve for each of a number of different types of heterogenous input sources. Data packets from multiple input sources may be admitted to the node of the network, or otherwise processed within the node, based at least in part on the determined number of supportable connections.
Abstract:
Techniques and systems for design of optical switch arrays so as to minimize power requirements are described. A design system includes a computer system hosting a design program. The design program receives parameters for the switch array, including a number N of outputs required, and either a maximum number L of stages allowed or maximum and average power requirements allowed. If power requirements are used as parameters, the design program uses N and the power requirements to compute the value of L. The design program then constructs a minimum power sequence of L switches or N switches, whichever is less. If N is less than L+1, N outputs are present and the array is complete. If N is greater than L+1, the design program then adds switches one at a time to the minimum power switch path of the array, until the array provides N outputs.