Patent application number | Description | Published |
20100168477 | HIGH SHEAR OXIDATION OF CYCLOHEXANE - Disclosed herein is a method for cyclohexane oxidation. The method comprises a) forming a dispersion comprising liquid cyclohexane and an oxidant gas utilizing a high shear device, wherein the dispersion comprises oxidant gas bubbles with a mean diameter of less than about 5 μm, and wherein the high shear device comprises at least one rotor and at least one stator; and b) hydrogenating the dispersion in the presence of a hydrogenation catalyst to form a product comprising cyclohexanol or cyclohexanone. In some embodiments, the oxidant comprises air, oxygen-enriched air, oxygen, or an oxygen-containing gas. In some embodiments, step a) of the method comprises forming the dispersion in the presence of an oxidation catalyst. Also disclosed herein is a system for oxidizing cyclohexane. | 07-01-2010 |
20100222615 | METHOD OF MAKING ALKYLENE GLYCOLS - Herein disclosed is a method of hydrating an alkylene oxide. In an embodiment, the method comprises (a) introducing an alkylene oxide into water to form a first stream; (b) flowing the first stream through a high shear device to produce a second stream; and (c) contacting the second stream with a catalyst in a reactor to hydrate the alkylene oxide and form an alkylene glycol. In some embodiments, alkylene oxide comprises ethylene oxide, propylene oxide, butylene oxide, or combinations thereof. In some embodiments, producing the second stream comprises an energy expenditure of at least about 1000 W/m | 09-02-2010 |
20110266198 | BITUMEN EXTRACTION AND ASPHALTENE REMOVAL FROM HEAVY CRUDE USING HIGH SHEAR - Herein disclosed is a method of removing at least one component from a feed by subjecting the feed to high shear in the presence of carbon dioxide to produce a high shear-treated product and separating the at least one component from the high shear-treated product to produce a component-reduced product. Also disclosed is a method of removing asphaltenes from asphaltenic oil by subjecting the asphaltenic oil to a shear rate of at least 10,000 s | 11-03-2011 |
20110269989 | METHOD OF MAKING ALKYLENE GLYCOLS - A method for halogenating, sulfonating, or sulfo-halogenating a feed comprising paraffin, by subjecting a mixture comprising the feed and a reagent selected from the group consisting of sulfonating agents, halogenating agents, and combinations thereof to a shear rate of at least 20,000 s | 11-03-2011 |
20110315601 | HIGH SHEAR PROCESS FOR PROCESSING NAPHTHA - A method and system for processing naphtha, including a high shear mechanical device. In one embodiment, the method comprises forming a dispersion of gas in a naphtha hydrocarbon liquid in a high shear device prior to introduction in a cracking reactor/furnace. In another instance the system for processing naphtha comprises a high shear device for mechanically shearing hydrocarbons. | 12-29-2011 |
20120241390 | BITUMEN EXTRACTION AND ASPHALTENE REMOVAL FROM HEAVY CRUDE USING HIGH SHEAR - Herein disclosed is a method of removing at least one component from a feed stream, the method including steps of subjecting the feed stream to high shear separation in a high shear device to produce a high shear-treated product stream; and substantially separating the at least one component from the high shear-treated product stream to produce a component-reduced product stream. | 09-27-2012 |
20130028803 | METHOD OF MAKING ALKYLENE GLYCOLS - Herein disclosed is a system for hydrating an alkylene oxide that includes a high shear device configured to form a dispersion of an alkylene oxide and water, the high shear device comprising a rotor, a stator, and a catalytic surface, wherein the dispersion comprises gas bubbles with an average gas bubble diameter of less than about 5 μm; a pump configured for delivering a liquid stream to the high shear device; and a reactor coupled to the high shear device, and configured to receive the dispersion from the high shear device, wherein the alkylene oxide is hydrated in the reactor. | 01-31-2013 |
20130030223 | METHOD OF MAKING ALKYLENE GLYCOLS - Herein disclosed is a method of hydrating an alkylene oxide that includes introducing an alkylene oxide into water to form a first stream; flowing the first stream through a high shear device to produce a second stream; and contacting the second stream with a catalyst in a reactor to hydrate the alkylene oxide and form an alkylene glycol. | 01-31-2013 |
20140161683 | HIGH SHEAR PROCESS FOR PROCESSING NAPHTHA - A method and system for processing naphtha, including a high shear mechanical device. In one embodiment, the method comprises forming a dispersion of gas in a naphtha hydrocarbon liquid in a high shear device prior to introduction in a cracking reactor/furnace. In another instance the system for processing naphtha comprises a high shear device for mechanically shearing hydrocarbons. | 06-12-2014 |
Patent application number | Description | Published |
20080282213 | METHOD TO REDUCE THE WIRELENGTH OF ANALYTICAL PLACEMENT TECHNIQUES BY MODULATION OF SPREADING FORCES VECTORS - A method of force directed placement programming is presented. The method includes: assigning a plurality of objects from a cell netlist to bins; shifting the objects based on the bins; computing a magnitude of a spreading force for each object of the plurality of objects based on the shifting; sorting the objects based on the magnitude of the spreading force of the objects; selecting a subset of the sorted objects based on a threshold value indicating at least one of a top percentage, a threshold force, and a threshold value that is based on a placement congestion; adjusting the spreading force of the selected objects to be equal to a predetermined value indicating a minimum spreading force; and determining a placement of the objects based on adjusted spreading force of the selected objects. | 11-13-2008 |
20090271752 | Legalization of VLSI circuit placement with blockages using hierarchical row slicing - A hierarchical method of legalizing the placement of logic cells in the presence of blockages selectively classifies the blockages into at least two different sets based on size (large and small). Movable logic cells are relocated first among coarse regions between large blockages to remove overlaps among the cells and the large blockages without regard to small blockages (while satisfying capacity constraints of the coarse regions), and thereafter the movable logic cells are relocated among fine regions between small blockages to remove all cell overlaps (while satisfying capacity constraints of the fine regions). The coarse and fine regions may be horizontal slices of the placement region having a height corresponding to a single circuit row height of the design. Cells are relocated with minimal perturbation from the previous placement, preserving wirelength and timing optimizations. The legalization technique may utilize more than two levels of granularity with multiple relocation stages. | 10-29-2009 |
20110302544 | POST-PLACEMENT CELL SHIFTING - A computer implemented method, data processing system, and computer program product for reworking a plurality of cells initially placed in a circuit design. An expander allocates cells to tiles. The expander determines a high detailed routing cost tile class, wherein the high detailed routing cost tile class is a class of tiles that has high detailed routing costs. The expander selects a cell within a tile of the high detailed routing cost tile class to form a selected cell in a selected tile. The expander applies multiple techniques to reposition these cells at new locations to improve the detailed routability. The expander can place an expanded bounding box around the selected cell, wherein the bounding box extends to at least one tile adjacent the selected tile, and repositions the selected cell within the bounding box to form a modified design to improve the detailed routability. The expander may also inflate and legalize those cells. | 12-08-2011 |
20110302545 | DETAILED ROUTABILITY BY CELL PLACEMENT - A computer implemented method, data processing system, and computer program product for reworking a plurality of cells initially placed in a circuit design. An expander allocates cells to tiles, wherein some tiles have cells. The expander determines a high detailed routing cost tile class, wherein the high detailed routing cost tile class is a class of tiles that are high detailed routing cost tiles. The expander selects a cell within a tile of the high detailed routing cost tile class to form a selected cell and a selected tile. The expander places an expanded bounding box around the selected cell, wherein the bounding box extends to at least one tile adjacent the selected tile. The expander expands the selected cell within the bounding box to form a modified design, determines an aggregate routing cost among other steps, and affirms the modified design for further processing. | 12-08-2011 |
20120110532 | LATCH CLUSTERING WITH PROXIMITY TO LOCAL CLOCK BUFFERS - A method, system, and computer usable program product for latch clustering with proximity to local clock buffers (LCBs) where an algorithm is used to cluster a plurality of latches into a first plurality of groups in an integrated circuit. A number of groups in the first plurality of groups of clustered latches is determined. A plurality of LCBs are added where a number of added LCBs is the same as the number of groups in the first plurality of groups. A cluster radius for a subset of the first plurality of groups of clustered latches is determined, a group in the subset having a cluster radius that is a maximum cluster radius in the subset. The plurality of latches are reclustered into a second plurality of groups responsive to the maximum cluster radius exceeding a radius threshold, the second plurality of groups exceeding the first plurality of groups by one. | 05-03-2012 |
20120124539 | Clock Optimization with Local Clock Buffer Control Optimization - A physical synthesis tool for dock optimization with local clock buffer control optimization is provided. The physical synthesis flow consists of delaying the exposure of clock routes until after the clock optimization placement stage. The physical synthesis tool clones first local clock buffers. Then, the physical synthesis tool runs timing analysis on the whole design to compute the impact of this necessarily disruptive step. After cloning local clock buffers, the physical synthesis tool adds an extra optimization step to target the control signals that drive the local clock buffers. This optimization step may includes latch cloning, timing-driven placement, buffer insertion, and repowering. The flow alleviates high-fanout nets and produces significantly better timing going into clock optimization placement. After placement, the physical synthesis tool fixes latches and local clock buffers in place, inserts clock routes, and repowers local clock buffers. | 05-17-2012 |
20120266124 | Placement of Structured Nets - Mechanisms are provided for performing placement of cells in a design of a semiconductor device. An initial design of the semiconductor device is generated, the initial design comprising a first placement of cells. A preferred direction of placement associated with the cells is determined. The preferred direction is a direction along which spreading of the cells is preferred. A second design of the semiconductor device is generated by modifying the first placement of the cells to generate a second placement of cells, different from the first placement cells, based on the preferred direction of placement associated with the cells. | 10-18-2012 |
20120297355 | WHITESPACE CREATION AND PRESERVATION IN CIRCUIT DESIGN - A method, system, and computer program product for whitespace creation and preservation in the design of an integrated circuit (IC) are provided in the illustrative embodiments. A first estimate is formed by estimating an amount of whitespace that is needed to reduce a congestion value of a congested area of the design to a threshold value. A set of virtual filler cells is added to the congested area, wherein adding the set of virtual filler cells does not add actual whitespace cells to the congested area but reduces the congested area by at least the first estimate. A virtual filler cell in the set of virtual filler cells is replaced with a corresponding real filler cell. A determination is made whether the design has improved. A final placement solution is created when the design has not improved. | 11-22-2012 |
20120324409 | ACCURACY PIN-SLEW MODE FOR GATE DELAY CALCULATION - The input slew at a selected gate of an integrated circuit design is computed by assigning a default slew rate to the output gate of a previous logic stage which is greater than a median slew rate for the design. This default slew rate is propagated through the logic stage to generate an input slew rate at the selected gate. The default slew rate corresponds to a predetermined percentile applied to a limited sample of preliminary slew rates for randomly selected gates in the design. The default slew rate is adjusted as a function of known characteristics of the wirelength from the output gate to a first gate in the second logic stage. The delay of the selected gate is calculated based on the input slew rate. The input slew rate can be stored during one optimization iteration and used as a default slew rate during a later optimization iteration. | 12-20-2012 |
20130086543 | MULTI-PATTERNING LITHOGRAPHY AWARE CELL PLACEMENT IN INTEGRATED CIRCUIT DESIGN - A method, system, and computer program product for multi-patterning lithography (MPL) aware cell placement in integrated circuit (IC) design are provided in the illustrative embodiments. A global phase of cell movement is performed. A local phase cell movement is performed, wherein the local phase includes moving a color instance of the cell from a plurality of color instances of the cell within a row of cell in the IC design, wherein the global phase and the local phase are each performed before a final placement is produced for the IC design. | 04-04-2013 |
20130097573 | ALIGNMENT NET INSERTION FOR STRAIGHTENING THE DATAPATH IN A FORCE-DIRECTED PLACER - An automated method for aligning a critical datapath in an integrated circuit design inserts an artificial alignment net in the netlist which interconnects all cells in the bit stack of the datapath. The cells are placed using a wirelength optimization which assigns weights to wire sections based on the alignment direction. The rate of change of the alignment weighting value can vary during different stages of global placement. The invention is particularly suited for a force-directed placer which uses a linear system solver to obtain a globally optimum solution for placement of the cells having some overlap among the cells, and thereafter spreads the cells to reduce the overlap. Pseudo nets are also inserted which interconnect a cell and an expected location of the cell after spreading for that iteration. | 04-18-2013 |
20130205272 | ALIGNMENT NET INSERTION FOR STRAIGHTENING THE DATAPATH IN A FORCE-DIRECTED PLACER - An automated method for aligning a critical datapath in an integrated circuit design inserts an artificial alignment net in the netlist which interconnects all cells in the bit stack of the datapath. The cells are placed using a wirelength optimization which assigns weights to wire sections based on the alignment direction. The rate of change of the alignment weighting value can vary during different stages of global placement. The invention is particularly suited for a force-directed placer which uses a linear system solver to obtain a globally optimum solution for placement of the cells having some overlap among the cells, and thereafter spreads the cells to reduce the overlap. Pseudo nets are also inserted which interconnect a cell and an expected location of the cell after spreading for that iteration. | 08-08-2013 |
20130283225 | DATAPATH PLACEMENT USING TIERED ASSIGNMENT - Datapath placement defines tiers for placement sets of a cell cluster, assigns cells to the tiers constrained by the datapath width, and then orders cells within each tier. Clusters are identified using machine-learning based datapath extraction. Datapath width is determined by computing a size of a bounding box for cells in the cluster. Placement sets are identified using a breadth-first search beginning with input cells for the cluster. Tiers are initially defined using logic depth assignment. A cell may be assigned to a tier by pulling the cell from the next higher tier to fill an empty location or by pushing an excess cell into the next higher tier. Cells are ordered within each tier using greedy cell assignment according to a wirelength cost function. The datapath placement can be part of an iterative process which applies spreading constraints to the cluster based on computed congestion information. | 10-24-2013 |
20130326455 | ELEMENT PLACEMENT IN CIRCUIT DESIGN BASED ON PREFERRED LOCATION - An improved circuit design system may include a computer processor to perform a placement for a circuit by physical synthesis. The system may also include a controller to compute a preferred location of at least one selected element of the circuit, and to calculate placement constraints for each selected element. The system may further include an updated design for the circuit generated by performing another round of physical synthesis with the placement constraints. | 12-05-2013 |
20130346938 | POST-PLACEMENT CELL SHIFTING - A computer implemented method for reworking a plurality of cells initially placed in a circuit design. An expander allocates cells to tiles. The expander determines a high detailed routing cost tile class, wherein the high detailed routing cost tile class is a class of tiles that has high detailed routing costs. The expander selects a cell within a tile of the high detailed routing cost tile class to form a selected cell in a selected tile. The expander applies multiple techniques to reposition these cells at new locations to improve the detailed routability. The expander can place an expanded bounding box around the selected cell, wherein the bounding box extends to at least one tile adjacent the selected tile, and repositions the selected cell within the bounding box to form a modified design to improve the detailed routability. The expander may also inflate and legalize those cells. | 12-26-2013 |
20140007036 | SEPARATE REFINEMENT OF LOCAL WIRELENGTH AND LOCAL MODULE DENSITY IN INTERMEDIATE PLACEMENT OF AN INTEGRATED CIRCUIT DESIGN | 01-02-2014 |
20140149957 | STRUCTURED PLACEMENT OF LATCHES/FLIP-FLOPS TO MINIMIZE CLOCK POWER IN HIGH-PERFORMANCE DESIGNS - A latch placement tool determines a shape for a cluster of latches from a preliminary layout (or based on a netlist), including an aspect ratio of the shape, and generates a template for placement of the latches in conformity with the shape. Latches are placed around a local clock buffer (LCB) based on latch size, from largest latch first to smallest latch last, and based on their ideal locations given the target aspect ratio. The ideal locations may be further based on the clock driver pin configuration of the LCB. The final template preferably has an aspect ratio that is approximately equal to the aspect ratio of the shape of the cluster, but the latch placement may be constrained by clock routing topology. Latch placement within a cluster can be further optimized by swapping one of the latches with another to minimize total wirelength of the design. | 05-29-2014 |
20150199465 | BOUNDARY LATCH AND LOGIC PLACEMENT TO SATISFY TIMING CONSTRAINTS - Boundary timing in the design of an integrated circuit is facilitated by designating a subset of boundary latches in the circuit, and applying placement constraints to the boundary latches. Global placement is performed while maintaining the boundary latch placement constraints, and a timing driven placement is performed after implementing timing assertions. Boundary latches are designated using a depth-first search to identify the first latches along interconnection paths with the PI/PO, and filtering out ineligible latches according to designer rules. A latch can be filtered out if it is in a large cluster of latches driven by a primary input or driving a primary output, if it drives too many POs, or is a feed-through latch. Constraints include movebounds, preplacement, or attractive forces between boundary latches and other boundary fixed objects, i.e., a fixed gate or a PI/PO. | 07-16-2015 |
Patent application number | Description | Published |
20100274596 | PERFORMANCE DASHBOARD MONITORING FOR THE KNOWLEDGE MANAGEMENT SYSTEM - Embodiments of the present invention provide a method, system, computer program product, or a combination of the foregoing for creating a knowledge management system including a performance dashboard monitoring system that is standardized and centralized across the channels and sub-channels in an organization. The performance dashboard monitoring system is used to track, measure, and resolve incidents that occur throughout the channels, sub-channels, systems, and applications of an organization. The system receives information related to two or more incidents, where each incident is associated with one or more of a business channel, sub-channel, or application. The system stores the information on a memory device. The system tracks the status of at least one incident between the occurrence and the resolution of the incident. The system displays on a user interface the information related to the incident on a channel, sub-channel, application, or individual incident level. | 10-28-2010 |
20100274616 | INCIDENT COMMUNICATION INTERFACE FOR THE KNOWLEDGE MANAGEMENT SYSTEM - Embodiments of the present invention include a method, system, computer program product, or a combination of the foregoing for creating a knowledge management system with an incident communication interface for production support incidents that is standardized and centralized across the channels and sub-channels in an organization. The incident communication interface system is used to track, identify, and resolve the incidents that occur throughout the organization. The incident communication interface allows business associates to initiate an incident ticket associated with an incident. The incident communication interface also communicates information related to an incident to business associates. The incident communication interface provides the business associates knowledge management system access. The incident communication interface receives user input including details related to resolving the incident and the incident details are stored in the incident report database. | 10-28-2010 |
20100274789 | OPERATIONAL RELIABILITY INDEX FOR THE KNOWLEDGE MANAGEMENT SYSTEM - Embodiments of the present invention provide systems, methods, and computer program products for an operational reliability index (“ORI”) scoring system in the knowledge management system that is standardized and centralized across the channels and sub-channels in an organization. The ORI system scores the reliability or confidence of the channels, sub-channels, and applications in an organization. The ORI receives reliability data associated with one or more predictability factors related to a business application. The ORI determines predictability factor reliability scores for each of the one or more predictability factors based on the reliability data and weighted values assigned to the predictability factors. Weighted values are also assigned to the categories, applications, sub-channels, and channels. The ORI determines at least one of a category reliability score, application reliability score, business sub-channel reliability score, or business channel score based on the determined predictability factor reliability scores and the weighted values. | 10-28-2010 |
20100274814 | ACADEMY FOR THE KNOWLEDGE MANAGEMENT SYSTEM - Embodiments of the present invention provide a method, system, computer program product, or a combination of the foregoing for creating a knowledge management system including an academy system for training and tracking training results of employees in a standardized and centralized location across the channels and sub-channels in an organization. The academy system stores a plurality of training modules, associated with one or more certification programs. The academy system further provides a user training selection interface configured to provide for user selection of one or more of the plurality of training modules. The academy system further provides the user access to the selected training module through an interactive display module interface. The academy system further provides for a user training results interface configured to provide a display of the user training results and stores the user training results of the selected training module in a user training database. | 10-28-2010 |
20100275054 | KNOWLEDGE MANAGEMENT SYSTEM - Embodiments of the present invention address the above needs and/or achieve other advantages by providing a method, system, computer program product, or a combination of the foregoing for creating a knowledge management system for production support that is standardized and centralized across the channels and sub-channels in an organization. The knowledge management system receives information relating to incidents from databases in the organization. The knowledge management system displays via a user interface at least the following information related to at least one incident, the current status of the incident, the recovery guidelines for effecting resolution of the incident, and scoring values associated with the incident. The knowledge management system also stores and displays historical information, contact information, incident reports, and outstanding incident tickets associated with the incident, as well as process maps or flowcharts for systems, applications, and customer views, and an academy for training associates. | 10-28-2010 |
20120030645 | PREDICTIVE RETIREMENT TOOLSET - A system assesses one or more applications for retirement. The system includes a processing device configured for receiving attribute data corresponding to one or more of a plurality of applications. The processing device is further configured for determining one or more of the plurality of applications to assess for retirement, translating at least some of the received attribute data into two or more translated values based at least in part on one or more predetermined values, and summing two or more of the translated values, thereby resulting in one or more combined values. The processing device is further configured for calculating one or more cumulative values based at least in part on the one or more combined values and converting the one or more cumulative values, thereby resulting in one or more probability values each indicating the probability of retirement of one of the one or more applications. | 02-02-2012 |
Patent application number | Description | Published |
20120253859 | METRICS BASED DESIGN METHOD AND SYSTEM - A metrics based design method and system is disclosed. The method includes receiving by a computer processor, an informational model comprising data objects, attributes, and relationships associated with a service. The data objects comprise sub-objects. The computer processor receives business affinity (BA) band data associated with the data objects, threshold levels associated with the business affinity (BA) band data, business affinity (BA) levels associated with the business affinity (BA) band data, and service interface operation parameters. The computer processor computes a business affinity (BA) for the informational model based on the business affinity (BA) band data, the threshold levels, the business affinity (BA) levels, and the service interface operation parameters. The computer processor computes a data variation percentage and a reusability count. The computer processor performs: a nested level computation for service valency, a factorization process for computing service valency, and a data element count. | 10-04-2012 |
20130019245 | SPECIFYING ON THE FLY SEQUENTIAL ASSEMBLY IN SOA ENVIRONMENTSAANM Jalaldeen; AhamedAACI KarnatakaAACO INAAGP Jalaldeen; Ahamed Karnataka INAANM Purohit; Siddharth N.AACI AllenAAST TXAACO USAAGP Purohit; Siddharth N. Allen TX USAANM Sharma; ManishaAACI New DelhiAACO INAAGP Sharma; Manisha New Delhi INAANM Sivakumar; GandhiAACI VictoriaAACO AUAAGP Sivakumar; Gandhi Victoria AUAANM Viswanathan; RamAACI PlanoAAST TXAACO USAAGP Viswanathan; Ram Plano TX US - A method and system for defining an interface of a service in a service-oriented architecture environment. Definitions of atomic tasks of a request or response operation included in a service are received. Unique identifiers corresponding to the atomic tasks are assigned. A sequence map required to implement the service is received. The sequence map is populated with a sequence of the assigned unique identifiers corresponding to a sequence of the atomic tasks of the operation. At runtime, an interface of the service is automatically and dynamically generated to define the service by reading the sequence of unique identifiers in the populated sequence map and assembling the sequence of the atomic tasks based on the read sequence of unique identifiers. | 01-17-2013 |
20130047230 | BUILDING DATA SECURITY IN A NETWORKED COMPUTING ENVIRONMENT - In general, embodiments of the present invention provide an approach for providing a multi-tenant/customer partition group separator and securer in a shared cloud infrastructure (e.g., as an extension to DB2®, Label-Based Access Control (LBAC), and/or an independent tool). Among other things, embodiments of the present invention provide cloud administrators with an easy to use customizable, configurable security constraint builder/tool with a built-in multi-tenant/customer enabled security model. Moreover, embodiments of the present invention enable cloud administrators to set up, configure, and manage tenants/customers and their private shards with their own security constraints. The output of this tool greatly eases the time to create an invisible (e.g., software) wall of separation for multiple tenants/customers in a shared cloud infrastructure. | 02-21-2013 |
20130238781 | SNMP-BASED MANAGEMENT OF SERVICE ORIENTED ARCHITECTURE ENVIRONMENTS - A Simple Network Management Protocol (SNMP)-based apparatus including an SNMP manager to monitor network hardware devices and define object identifiers (OIDs); a Simple SOA Performance Monitor (SSPM) manager to augment the OIDs with service-specific object identifiers to monitor services; and an SSPM agent associated with at least one service to collect details pertaining to the service, the details of the service being provided to the SSPM manager which in turn provides the details of the service to the SNMP manager. The SNMP-based apparatus may be implemented by at least one computing device. Also disclosed is a method of monitoring services and a computer program product. | 09-12-2013 |
20130254764 | ENABLING MULTI-TENANCY FOR INTEGRATED DEVELOPMENT ENVIRONMENT SOFTWARE IN VIRTUAL ENVIRONMENTS - A method and system for enabling multiple users in a computing environment is provided. The method includes receiving software comprising an operating system, integrated development environment (IDE) software, middleware software, and database software. A virtual image instance of operating system, the IDE software, the middleware software, and the database software is provisioned to a virtual instance. User IDs for access to the operating system instance are generated. Workspaces are generated and associated with the user IDs. The middleware software and the database software are configured and the virtual image instance is enabled to accept multiple concurrent logins associated with the user IDs. | 09-26-2013 |
20140059519 | ENABLING MULTI-TENANCY FOR A COMMERCE SERVER - A method and system for enabling multi-tenancy in a commerce server is provided. The method includes receiving software comprising an operating system, integrated development environment (IDE) software, commerce server middleware software, and database software. A virtual image instance of operating system, the IDE software, and the database software is provisioned to a virtual instance. User IDs for access to the operating system instance are generated. Workspaces are generated and associated with the user IDs. The commerce server middleware software is configured such that the user IDs, hosts, and ports are mapped to commerce server services associated with the commerce server middleware software. The database software is configured such that the virtual image instance is enabled to accept multiple concurrent logins associated with the user IDs. | 02-27-2014 |
20140365442 | ARCHIVAL MANAGEMENT OF BUSINESS PROCESSES IN A CLOUD ENVIRONMENT - A method for product for archival management of business processes in a cloud environment is provided. In one aspect, the method comprises archiving managed pool including one or more versions of a business process instance or business process execution in a cloud computing environment. The method further comprises a provisioning manager of the cloud computing environment that requests or tasks provisioning, deprovisioining, decommissioning or deleting the one or more versions of a business process instance or business process execution. For each of the requests or tasks, a restore manager of the cloud environment determines, if the managed pools of virtual instances contain a business process management environment or a business process archive manager environment. The restore manager further recreates a previous version of the one or more versions of the business process instance or business process execution based on the determination. | 12-11-2014 |
20150199188 | SEAL-BASED REGULATION FOR SOFTWARE DEPLOYMENT MANAGEMENT - An approach is provided for managing a deployment of a software package. A retrieved quality assurance (QA) seal corresponding to a software package is verified. A target deployment environment (TDE) is obtained. The QA seal is read to obtain first and second profiles, and metadata, which specify a deployment environment, hardware and software dependencies required in the deployment, and an approval for a release of the software package to the specified deployment environment, respectively. Based on a determination that the TDE matches the specified deployment environment, the QA seal indicates the software package is compatible with the TDE. The dependencies are determined to be satisfied. Based on the software package being compatible with the TDE, the dependencies being satisfied, and the specified approval for the release of the software package, a notification of an authorization of the deployment of the software package to the TDE is generated. | 07-16-2015 |
Patent application number | Description | Published |
20090034752 | CONSTRAINTED SWITCHED ADAPTIVE BEAMFORMING - An audio device, comprising a microphone array, a constrained switched adaptive beamformer with input coupled to said microphone array, said beamformer including (i) a first stage speech adaptive beamformer with first adaptive filters having a first adaptive step size, and (ii) a second stage noise adaptive beamformer with second adaptive filters having a second adaptive step size, and a single channel speech enhancer with input coupled to an output of said constrained switched adaptive beamformer. | 02-05-2009 |
20100091800 | INTEGRATED CIRCUITS, SYSTEMS, APPARATUS, PACKETS AND PROCESSES UTILIZING PATH DIVERSITY FOR MEDIA OVER PACKET APPLICATIONS - In one form of the invention, a process of sending real-time information from a sender computer ( | 04-15-2010 |
20110211573 | INTEGRATED CIRCUITS, SYSTEMS, APPARATUS, PACKETS AND PROCESSES UTILIZING PATH DIVERSITY FOR MEDIA OVER PACKET APPLICATIONS - In one form of the invention, a process of sending real-time information from a sender computer ( | 09-01-2011 |
20130246057 | SYSTEMS, PROCESSES AND INTEGRATED CIRCUITS FOR RATE AND/OR DIVERSITY ADAPTATION FOR PACKET COMMUNICATIONS - Packets of real-time information are sent with a source rate greater than zero kilobits per second, and a time or path or combined time/path diversity rate initially being zero kilobits per second. This results in a quality of service QoS, optionally measured at the sender or the receiver. When the QoS is on an unacceptable side of a threshold of acceptability, the sender sends diversity packets at an increased rate. Increasing the diversity rate while either reducing or maintaining the overall transmission rate is new. CELP-based multiple-description data partitioning sends the base or important information plus a subset of fixed excitation in one packet and sends the base or important information plus the complementary subset of fixed excitation in another packet. Reconstruction produces acceptable quality when only one of the two packets is received and better quality when both packets are received. Reconstruction provides for single and multiple lost packets. | 09-19-2013 |
Patent application number | Description | Published |
20090268724 | SYSTEMS, PROCESSES AND INTEGRATED CIRCUITS FOR RATE AND/OR DIVERSITY ADAPTATION FOR PACKET COMMUNICATIONS - Packets of real-time information are sent with a source rate greater than zero kilobits per second, and a time or path or combined time/path diversity rate initially being zero kilobits per second. This results in a quality of service QoS, optionally measured at the sender or the receiver. When the QoS is on an unacceptable side of a threshold of acceptability, the sender sends diversity packets at an increased rate. Increasing the diversity rate while either reducing or maintaining the overall transmission rate is new. CELP-based multiple-description data partitioning sends the base or important information plus a subset of fixed excitation in one packet and sends the base or important information plus the complementary subset of fixed excitation in another packet. Reconstruction produces acceptable quality when only one of the two packets is received and better quality when both packets are received. Reconstruction provides for single and multiple lost packets. | 10-29-2009 |
20090323679 | SYSTEMS, PROCESSES AND INTEGRATED CIRCUITS FOR RATE AND/OR DIVERSITY ADAPTATION FOR PACKET COMMUNICATIONS - Packets of real-time information are sent with a source rate greater than zero kilobits per second, and a time or path or combined time/path diversity rate initially being zero kilobits per second. This results in a quality of service QoS, optionally measured at the sender or the receiver. When the QoS is on an unacceptable side of a threshold of acceptability, the sender sends diversity packets at an increased rate. Increasing the diversity rate while either reducing or maintaining the overall transmission rate is new. CELP-based multiple-description data partitioning sends the base or important information plus a subset of fixed excitation in one packet and sends the base or important information plus the complementary subset of fixed excitation in another packet. Reconstruction produces acceptable quality when only one of the two packets is received and better quality when both packets are received. Reconstruction provides for single and multiple lost packets. | 12-31-2009 |
20100085986 | SYSTEMS, PROCESSES AND INTEGRATED CIRCUITS FOR RATE AND/OR DIVERSITY ADAPTATION FOR PACKET COMMUNICATIONS - A media over packet networking appliance provides a network interface, a voice transducer, and at least one integrated circuit assembly coupling the voice transducer to the network interface. The at least one integrated circuit assembly provides media over packet transmissions and holds bits defining reconstruction of a packet stream having a primary stage and a secondary stage. The secondary stage has one or more of linear predictive coding parameters, long term prediction lags, parity check, and adaptive and fixed codebook gains. The packet stream has an instance of single packet loss, and the reconstruction includes receiving a packet sequence represented by P(n)P(n−1)′, [Lost Packet], P(n+2)P(n+1)′, and P(n+3)P(n+2)′, obtaining as information from the secondary stage one or more of the linear predictive coding parameters, long term prediction lags, parity check, and adaptive and fixed codebook gains, and performing an excitation reconstruction utilizing said packet sequence thus received. | 04-08-2010 |
20110004808 | SYSTEMS, PROCESSES AND INTEGRATED CIRCUITS FOR RATE AND/OR DIVERSITY ADAPTATION FOR PACKET COMMUNICATIONS - A media over packet networking appliance provides a network interface, a voice transducer, and at least one integrated circuit assembly coupling the voice transducer to the network interface. The at least one integrated circuit assembly provides media over packet transmissions and holds bits defining reconstruction of a packet stream having a primary stage and a secondary stage. The secondary stage has one or more of linear predictive coding parameters, long term prediction lags, parity check, and adaptive and fixed codebook gains. The packet stream has an instance of single packet loss, and the reconstruction includes receiving a packet sequence represented by P(n)P(n−1)′, [Lost Packet], P(n+2)P(n+1)′, and P(n+3)P(n+2)′, obtaining as information from the secondary stage one or more of the linear predictive coding parameters, long term prediction lags, parity check, and adaptive and fixed codebook gains, and performing an excitation reconstruction utilizing said packet sequence thus received. | 01-06-2011 |
20110301947 | SYSTEMS, PROCESSES AND INTEGRATED CIRCUITS FOR RATE AND/OR DIVERSITY ADAPTATION FOR PACKET COMMUNICATIONS - Packets of real-time information are sent with a source rate greater than zero kilobits per second, and a time or path or combined time/path diversity rate initially being zero kilobits per second. This results in a quality of service QoS, optionally measured at the sender or the receiver. When the QoS is on an unacceptable side of a threshold of acceptability, the sender sends diversity packets at an increased rate. Increasing the diversity rate while either reducing or maintaining the overall transmission rate is new. CELP-based multiple-description data partitioning sends the base or important information plus a subset of fixed excitation in one packet and sends the base or important information plus the complementary subset of fixed excitation in another packet. Reconstruction produces acceptable quality when only one of the two packets is received and better quality when both packets are received. Reconstruction provides for single and multiple lost packets. | 12-08-2011 |
20120008645 | SYSTEMS, PROCESSES AND INTEGRATED CIRCUITS FOR RATE AND/OR DIVERSITY ADAPTATION FOR PACKET COMMUNICATIONS - A media over packet networking appliance provides a network interface, a voice transducer, and at least one integrated circuit assembly coupling the voice transducer to the network interface. The at least one integrated circuit assembly provides media over packet transmissions and holds bits defining reconstruction of a packet stream having a primary stage and a secondary stage. The secondary stage has one or more of linear predictive coding parameters, long term prediction lags, parity check, and adaptive and fixed codebook gains. The packet stream has an instance of single packet loss, and the reconstruction includes receiving a packet sequence represented by P(n)P(n−1)′, [Lost Packet], P(n+2)P(n+1)′, and P(n+3)P(n+2)′, obtaining as information from the secondary stage one or more of the linear predictive coding parameters, long term prediction lags, parity check, and adaptive and fixed codebook gains, and performing an excitation reconstruction utilizing said packet sequence thus received. | 01-12-2012 |
20120259624 | SYSTEMS, PROCESSES AND INTEGRATED CIRCUITS FOR RATE AND/OR DIVERSITY ADAPTATION FOR PACKET COMMUNICATIONS - Packets of real-time information are sent with a source rate greater than zero kilobits per second, and a time or path or combined time/path diversity rate initially being zero kilobits per second. This results in a quality of service QoS, optionally measured at the sender or the receiver. When the QoS is on an unacceptable side of a threshold of acceptability, the sender sends diversity packets at an increased rate. Increasing the diversity rate while either reducing or maintaining the overall transmission rate is new. CELP-based multiple-description data partitioning sends the base or important information plus a subset of fixed excitation in one packet and sends the base or important information plus the complementary subset of fixed excitation in another packet. Reconstruction produces acceptable quality when only one of the two packets is received and better quality when both packets are received. Reconstruction provides for single and multiple lost packets. | 10-11-2012 |
20130148651 | INTEGRATED CIRCUITS, SYSTEMS, APPARATUS, PACKETS AND PROCESSES UTILIZING PATH DIVERSITY FOR MEDIA OVER PACKET APPLICATIONS - In one form of the invention, a process of sending real-time information from a sender computer ( | 06-13-2013 |
20130230043 | SYSTEMS, PROCESSES AND INTEGRATED CIRCUITS FOR RATE AND/OR DIVERSITY ADAPTATION FOR PACKET COMMUNICATIONS - A media over packet networking appliance provides a network interface, a voice transducer, and at least one integrated circuit assembly coupling the voice transducer to the network interface. The at least one integrated circuit assembly provides media over packet transmissions and holds bits defining reconstruction of a packet stream having a primary stage and a secondary stage. The secondary stage has one or more of linear predictive coding parameters, long term prediction lags, parity check, and adaptive and fixed codebook gains. The packet stream has an instance of single packet loss, and the reconstruction includes receiving a packet sequence represented by P(n)P(n−1)′, [Lost Packet], P(n+2)P(n+1)′, and P(n+3)P(n+2)′, obtaining as information from the secondary stage one or more of the linear predictive coding parameters, long term prediction lags, parity check, and adaptive and fixed codebook gains, and performing an excitation reconstruction utilizing said packet sequence thus received. | 09-05-2013 |
20130250938 | SYSTEMS, PROCESSES AND INTEGRATED CIRCUITS FOR RATE AND/OR DIVERSITY ADAPTATION FOR PACKET COMMUNICATIONS - Packets of real-time information are sent with a source rate greater than zero kilobits per second, and a time or path or combined time/path diversity rate initially being zero kilobits per second. This results in a quality of service QoS, optionally measured at the sender or the receiver. When the QoS is on an unacceptable side of a threshold of acceptability, the sender sends diversity packets at an increased rate. Increasing the diversity rate while either reducing or maintaining the overall transmission rate is new. CELP-based multiple-description data partitioning sends the base or important information plus a subset of fixed excitation in one packet and sends the base or important information plus the complementary subset of fixed excitation in another packet. Reconstruction produces acceptable quality when only one of the two packets is received and better quality when both packets are received. Reconstruction provides for single and multiple lost packets. | 09-26-2013 |
20140337501 | INTEGRATED CIRCUITS, SYSTEMS, APPARATUS, PACKETS AND PROCESSES UTILIZING PATH DIVERSITY FOR MEDIA OVER PACKET APPLICATIONS - In one form of the invention, a process of sending real-time information from a sender computer ( | 11-13-2014 |