Abstract: A device may receive performance information for a traffic flow assigned to a quality of service (QoS) class. The device may determine an overall packet delay, associated with the traffic flow, based on the performance information. The device may determine a radio access network (RAN) delay, associated with the traffic flow, based on the performance information. The device may determine a target packet delay associated with the QoS class. The device may identify, based on the target packet delay, the RAN delay, and the overall packet delay, a QoS sub-class to which the traffic flow is to be assigned. The QoS sub-class may be associated with the QoS class. The device may cause packets, associated with the traffic flow, to be marked for treatment in accordance with the QoS sub-class.

Abstract: A device may receive performance information for a traffic flow assigned to a quality of service (QoS) class. The device may determine an overall packet delay, associated with the traffic flow, based on the performance information. The device may determine a radio access network (RAN) delay, associated with the traffic flow, based on the performance information. The device may determine a target packet delay associated with the QoS class. The device may identify, based on the target packet delay, the RAN delay, and the overall packet delay, a QoS sub-class to which the traffic flow is to be assigned. The QoS sub-class may be associated with the QoS class. The device may cause packets, associated with the traffic flow, to be marked for treatment in accordance with the QoS sub-class.

Abstract: Non-negative contributions to a spectrum from time-varying spectroscopy data can be determined. Reference basis functions can transform spectroscopy data into an equation (e.g., an objective function). Each reference basis function can correspond to a different time and a different particle, e.g., a different mass. The objective function can include a noise vector that modifies the spectroscopy data to provide a solution that is constrained to be non-negative. The noise vector can be estimated by minimizing the objective function to obtain an estimated vector, which can be truncated that satisfies a given constraint. The noise vector can be computed from the difference of the estimated vector and the truncated vector, and be accumulated. The noise vector can be used to update the objective function, thereby providing a new estimated vector in an iterative loop.

Abstract: A method for rapidly determining feasibility of a force optimization problem and for rapidly solving a feasible force optimization problem is disclosed. The method comprises formulating the force optimization problem or force feasibility problem as a convex optimization problem, formulating a primal barrier subproblem associated with the convex optimization problem, and solving the primal barrier subproblem. The method and related methods may also be used to solve each problem in a set of force optimization problems, determine the minimum or maximum force required to satisfy any of a set of force optimization problems, solve a force closure problem, compute a conservative contact force vector, or solve a feasible force optimization problem with bidirectional forces.

Abstract: A method for rapidly determining feasibility of a force optimization problem and for rapidly solving a feasible force optimization problem is disclosed. The method comprises formulating the force optimization problem or force feasibility problem as a convex optimization problem, formulating a primal barrier subproblem associated with the convex optimization problem, and solving the primal barrier subproblem. The method and related methods may also be used to solve each problem in a set of force optimization problems, determine the minimum or maximum force required to satisfy any of a set of force optimization problems, solve a force closure problem, compute a conservative contact force vector, or solve a feasible force optimization problem with bidirectional forces.

Abstract: Optimization design method for configurable analog circuits and devices resulting from same. An implementation fabric for a given application domain can be accurately pre-characterized in terms of devices and parasitics. Customization structures are designed and characterized to be applied to the fabric to customize a device for a particular application. In some embodiments, characterization is accomplished by formulating a configurable design problem as an optimization with recourse problem, for example, a geometric programming with recourse (GPR) problem. Devices can be produced for multiple applications from the application domain using the same optimized fabric to provide predictable performance.

Abstract: A generalized tunable optical filter with interconnected processing devices, such as unequal arm Mach-Zehnder interferometric devices and ring resonator devices, is described. Each of the processing elements is characterized by a parametric length ?lk=nk?lf where nk is an integer greater than 30 and ?lf is the longest length common to all of the processing elements. The optical filter is tuned by the setting of actuators in the processing elements with each setting corresponding to a predetermined filter response, such as for chromatic dispersion compensation and WDM add/drop multiplexer applications. To determine the design variables of the optical filter, such as the coupling angles ? and parametric lengths ?lk for the processing elements, a methodology of determining these variables from the desired application is also described.

Abstract: A generalized tunable optical filter with interconnected processing devices, such as unequal arm Mach-Zehnder interferometric devices and ring resonator devices, is described. Each of the processing elements is characterized by a parametric length &Dgr;lk=nk&Dgr;lf where nk is an integer greater than 30 and &Dgr;lf is the longest length common to all of the processing elements. The optical filter is tuned by the setting of actuators in the processing elements with each setting corresponding to a predetermined filter response, such as for chromatic dispersion compensation and WDM add/drop multiplexer applications. To determine the design variables of the optical filter, such as the coupling angles &thgr; and parametric lengths &Dgr;lk for the processing elements, a methodology of determining these variables from the desired application is also described.

Abstract: A method for the design and optimization of inductors for RF circuits. This method consists in the formulation of RF circuit designs as geometric programs. The designer can specify a wide variety of specifications such as gain, bandwidth, noise, etc. The method, which was implemented in simple code, determines inductor dimensions and component values in a few seconds real-time. The results was also a globally optimal design.

Abstract: A method for optimizing an integrated circuit uses a dominant time constant of a transition of the circuit. A physical layout of the circuit is characterized in terms of design parameters. The circuit is modeled by a conductance matrix G and a capacitance matrix C, wherein G and C are affine functions of the design parameters. The optimization method comprises the step of finding the values of the design parameters that optimize a property of the circuit while simultaneously enforcing a constraint that the dominant time constant must be less than a maximum value tmax. Mathematically, the constraint on the dominant time constant can be written: tmax G−C≧0. The optimization method can be used when the circuit has a non-tree topology. Furthermore, when the design parameters comprise variables that relate to sizes of elements of the circuit, a topology of the circuit is optimized by the optimization method.

Abstract: A system for designing and optimizing integrated circuits. Design objectives and constraints are described as posynomial functions of the design parameters. The circuit design problem is then expressed as a special form of optimization problem called geometric programming, to which very efficient global optimization methods are applied. The present invention can thereby efficiently determine globally optimal circuit designs, or globally optimal trade-offs among competing performance measures such as, for example for an operational amplifier (op-amp), power, open-loop gain, and bandwidth. The present invention therefore yields automated synthesis of globally optimal circuit designs for a given circuit topology library, directly from specifications.