Patent application number | Description | Published |
20080215579 | INCLUDING ANNOTATION DATA WITH DISPARATE RELATIONAL DATA - Methods, systems, and articles of manufacture that may be used for identifying and indicating annotations made for a variety of different type (i.e., heterogeneous) data objects are provided. According to some embodiments, an annotation store may be queried to identify annotations for data objects in a current view of data. For certain identifiable portions of the view (e.g., a row in a relational view), a callable function may be created that returns a set of indicia maps indicating which objects in the portions are annotated. Bits in an indicia map may correspond to different objects (e.g., individual cells in a row or the row itself). Using these indicia maps, an indication of which data objects are annotated may be provided in the view, for example, by displaying annotation icons proximate annotated objects. | 09-04-2008 |
20080221855 | Simulating partition resource allocation - An apparatus, system, and storage medium that, in an embodiment, simulate allocation of a simulated resource to simulated partitions in a simulated logically-partitioned computer and determine whether the allocation conflicts. The simulation may include summing amounts of the simulated resource for the simulated partition in an order, where the order of the simulated partitions is received via a user interface. In various embodiments, the allocation may conflict if the allocation exceeds the capacity of the simulated logically-partitioned computer or if the simulated resource is restricted to exclusive allocation. The result of the simulation, including whether the allocation conflicts, is presented via the user interface. In various embodiments, the simulated resource may be memory, an I/O controller, or a storage device. | 09-11-2008 |
20080256062 | METHOD AND SYSTEM FOR PROPAGATING ANNOTATIONS USING PATTERN MATCHING - Methods, systems, and articles of manufacture for propagating annotations created for data objects appearing in a variety of different application types are provided. Some embodiments present users collaborating on a project with an indication of data objects in a current document that have been annotated, or that related data objects have been annotated, in other documents. Users may then review the annotations and selectively associate the annotations with the related data object in the current document, thereby spreading the tacit knowledge reflected in the annotation about related data objects across many documents in an enterprise network. Further, an annotation management system may maintain a thesaurus of related terms and corresponding annotation points to find annotations for data objects that exist in other documents without having to inspect the data object(s) associated with each existing annotation. | 10-16-2008 |
20090105999 | METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR IMPLEMENTING IMPORTATION AND CONVERGING SYSTEM DEFINITIONS DURING PLANNING PHASE FOR LOGICAL PARTITION (LPAR) SYSTEMS - Hardware and partition information of an existing LPAR system is collected and stored in a first system plan file. The first system plan file is applied to a partition planning tool. The partition planning tool identifies hardware to be reused in a second LPAR system and filters hardware to be excluded from the second LPAR system. The partition planning tool creates a plan for the second LPAR system using the identified hardware to be reused and the partition information. The created plan for the second LPAR system is applied to a partition deployment tool to partition the second LPAR system. The created plan for the second LPAR system is used to move and place hardware to be reused in the second LPAR system. | 04-23-2009 |
20110023049 | OPTIMIZING WORKFLOW EXECUTION AGAINST A HETEROGENEOUS GRID COMPUTING TOPOLOGY - Optimizing workflow execution by the intelligent dispatching of workflow tasks against a grid computing system or infrastructure. For some embodiments, a grid task dispatcher may be configured to dispatch tasks in a manner that takes into account information about an entire workflow, rather than just an individual task. Utilizing information about the tasks (task metadata), such a workflow-scoped task dispatcher may more optimally assign work to compute resources available on the grid, leading to a decrease in workflow execution time and more efficient use of grid computing resources. | 01-27-2011 |
20110154178 | ANNOTATION STRUCTURE TYPE DETERMINATION - Methods, systems, and articles of manufacture for organizing and selecting structures used to generate forms for capturing information as annotations made for a variety of different type data objects are provided. Some embodiments allow annotation structures to be associated with specific pairings of data object types and user roles via entries in a configuration file. When a user selects a set of one or more data objects for annotation, the configuration file may be accessed to determine a proper annotation structure for use in generating an annotation form based on the selected data objects and a role of the user. | 06-23-2011 |
20120150962 | METHOD AND SYSTEM FOR INFORMATION WORKFLOWS - A method and apparatus for information repository workflows to transfer information between a first domain (e.g., healthcare sites) and a second domain (e.g., medical research facilities). Large quantities of medical information may be directly transferred to an information repository or indirectly transferred to the repository through the use of pointers. The information is cleansed and normalized prior to storage in a production database within the repository. The cleansing process is conducted while ensuring integrity of the production database is maintained and while continuing to receive additional information transfers. Errors encountered during processing are logged and reported. | 06-14-2012 |
20120151248 | REDUCED POWER FAILOVER SYSTEM AND METHOD - Embodiments include a power-efficient failover system and method. In one embodiment, a primary server operating in a normal operating state is configured to dynamically backup device states or transaction logs. A redundant server coupled to the primary server in a failover cluster is operated at a reduced power state. The redundant server dynamically receives the backup from the primary server and is elevated to a normal operating state in response to a failure of the primary server. By enforcing a reduced power state of the redundant server, a failover system provides a desired combination of high power efficiency with low latency. | 06-14-2012 |
20120272094 | REDUCED POWER FAILOVER - Embodiments include a power-efficient failover method. The method includes operating a primary server at a normal operating state in which program code is executed, and dynamically generating a backup of the results of the executed program code while in the normal operating state. The method further includes operating a redundant server at a reduced power state in which less power is consumed than in the normal operating state of the primary server. The workload of the primary server may be assumed according to the backup in response to a failure of the primary server. The power state of the redundant server is managed, including maintaining the redundant server in the reduced power state prior to detecting a failure of the primary server and increasing the power state of the redundant server and assuming the workload of the primary server in response to the failure of the primary server. | 10-25-2012 |
Patent application number | Description | Published |
20080255290 | Method of Dust Abatement - A method of dust abatement, including applying and reapplying to a surface having particulate material a single-phase solution including a water-soluble polymer selected from the group consisting of polyvinyl alcohol, derivatives thereof, and combinations thereof, at a rate of 0.1 g/m to 6 g/m | 10-16-2008 |
20090004373 | Methods and Compositions for Temporary Barrier Coatings - Methods of temporarily protecting an exterior surface of a structure, an interior hard surface, and an automobile part, including the step of applying to the surface a solution including a water-soluble polymer, and allowing the solution to dry, thereby forming a water-soluble polymer coating on the surface, is disclosed. The protective coating can thereafter be removed by washing the surface with water, such as with a power sprayer, taking with it any secondary substance which has coated it or otherwise has been bound to it. | 01-01-2009 |
20100311299 | Hobby Blocks Including Latently-Adhesive Surfaces - Described herein is a block set including a plurality of blocks having latently adhesive surfaces. Also described is a method of creating a bound structure from the individual blocks, including activating the adhesive of the latently adhesive surface of one or more of the blocks; and contacting an activated adhesive surface of the one or more blocks with another of said blocks, to bond the blocks together. | 12-09-2010 |
20140230346 | Apparatus and System for Grain Storage - A modular food storage apparatus for storing dry goods and/or perishable goods. The food storage apparatus may be fixed or mobile. The apparatus includes a scalable frame. A plurality of scalable side panels are securely affixed to the frame. A plurality of scalable roofing panels are securely affixed to the frame and to the side panels. The food storage apparatus may be stationary and affixed to a concrete foundation. The apparatus may be modified with monitoring devices and venting devices for storage of dry goods. The apparatus may be modified for storage of perishable goods using refrigeration or a controlled atmosphere environment. | 08-21-2014 |
Patent application number | Description | Published |
20080285537 | System and method for communicating packet in a wireless multicast and broadcast communication network - A method and system for communicating packets in a Wireless Multicast and Broadcast communication network is provided. The method includes selecting a Modulation and Coding Scheme (MCS) for transmission of a packet. The packet is then transmitted using the selected MCS on at least one of a subset of available time slots, a subset of available frequency sub-carriers and a subset of available antennas. Thereafter, it is autonomously decided whether the plurality of transmitters are to retransmit the packet. Then, the packet is retransmitted on at least one of a different subset of time slots, a different subset of frequency sub-carriers and a different subset of antennas. | 11-20-2008 |
20090310550 | Method and apparatus for link adaptation in wirless communication network - A method and apparatus for link adaptation in a wireless communication network is provided. The method includes computing a first channel quality parameter based on one or more channel quality parameters. The one or more channel quality parameters are associated with a communication link between a Mobile Station (MS) and a Base Station (BS). The method further includes determining a qualifying transmission unit to compute a correction parameter. The correction parameter is computed based on the first channel quality parameter and one or more transmission parameters. The one or more transmission parameter is associated with the communication link. Thereafter, the method schedules a transmission mode of the communication link based on a second channel quality parameter. The second channel quality parameter is estimated based the first channel quality parameter and the correction parameter. | 12-17-2009 |
20090316636 | Selecting a transmission mode between a subscriber and a base station - Embodiments for a method and apparatus of selecting a transmission mode between the subscriber and a base station are disclosed. One method includes determining a predictive window. Instantaneous channel quality measurements are averaged, wherein the averaging is dependent upon a size of the predictive window. A first estimate of the transmission mode is determined based on the averaged instantaneous channel quality measurements. A margin is calculated based on reception of a qualifying downlink transmission. The transmission mode is selected by updating the first estimate with the margin. | 12-24-2009 |
20130010734 | SELECTING A TRANSMISSION MODE BETWEEN A SUBSCRIBER AND A BASE STATION - Embodiments for a method and apparatus of selecting a transmission mode between the subscriber and a base station are disclosed. One method includes determining a predictive window. Instantaneous channel quality measurements are averaged, wherein the averaging is dependent upon a size of the predictive window. A first estimate of the transmission mode is determined based on the averaged instantaneous channel quality measurements. A margin is calculated based on reception of a qualifying downlink transmission. The transmission mode is selected by updating the first estimate with the margin. | 01-10-2013 |
Patent application number | Description | Published |
20110228747 | Methods and Systems for Uplink Network Entry and Bandwidth Requests - Methods and systems of a mobile station transmitting information to a base station are disclosed. The mobile station may transmit information with improved uplink coverage, and bandwidth requests may be more efficient. Additionally, the mobile station may transmit information over multiple uplink frames using hybrid ARQ. | 09-22-2011 |
20120071195 | Transmit Power Management for Specific Absorption Rates - Systems and methods for regulating transmit power in a mobile station to comply with SAR limits are disclosed. A mobile station may include a processor, transmitter, and proximity sensor. The transmitter is configured to operate at a transmit power controlled by a first transmit power limit. The proximity sensor identifies how close the mobile station is to a human head. A transmit power regulator, implemented on the processor, determines the cumulative energy radiated by the transmitter over a specified number of frames. If the cumulative energy exceeds an energy limit based on a SAR limit, and the proximity sensor indicates that the mobile station is close to a human head, the transmit power regulator may decrease the transmit power limit of the transmitter. | 03-22-2012 |
20120142291 | Distribution of Transmit Signal to Multiple Transmit Antennas for Reduction of Measured Specific Absorption Rate - Various embodiments of the present invention recognize at least two zones of operation for a communication device. In a first zone, which is sufficiently spaced away from a human head or body that SAR limits will be met, transmit power delivered to an antenna of a communication device may be maximized within any other constraints under which the communication device operates. In a second zone, which is not sufficiently spaced away from a human head or body, transmit power is redistributed such that SAR limitations are met without affecting the transmit power control loop of the communication device. For example, a second antenna physically disposed at a different location within the communication device may be used either instead of, or in addition to, the first transmit antenna in order that the SAR limits are met. | 06-07-2012 |
20120213149 | Method and System for Power Headroom Reporting in the Presence of Multiple Transmit Antennas - A method and system are provided in which a mobile device may be operable for long term evolution (LTE) communication or some other wireless technology via two or more transmit antennas. The device may comprise a power amplifier for each transmit antenna with substantially similar maximum power being provided by both amplifiers. A power headroom value may be determined in the device based on path loss values between the transmit antennas and a base station and the maximum transmit power for each transmit antenna. Transmission via one of the transmit antennas may occur concurrently with transmission via another of the transmit antennas. The device may generate an indication of the determined power headroom value for communication to the base station. The power headroom value may be reported periodically or in response to a change in the power received at the base station. | 08-23-2012 |
20130170418 | Wireless Communication Device Capable of Scanning for Available Base Stations Using Reduced Bandwidth - A wireless communication device is disclosed that includes multiple antennas capable of being used for carrier aggregation, and that uses its additional antennas to scan for available base stations without interfering with connectivity to a current base station and/or while maximizing useable bandwidth. The wireless communication device may scan using multiple of the antennas to maximize scanning results and reduce scan time, and may scan for available base stations using some of its antennas while maintaining its connection to the current base station with its other antennas. The device can also analyze control channel portions of received signals to utilize periods of signal inactivity to scan for available base stations, such as DRX or SPS modes of operation. In addition, the device can measure various parameters to optimize its scanning capabilities. | 07-04-2013 |
20130198582 | SUPERCHARGED CODES - A system and method is provided for encoding k input symbols into a longer stream of n output symbols for transmission over an erasure channel such that the original k input symbols can be recovered from a subset of the n output symbols without the need for any retransmission. A symbol is a generic data unit, consisting of one or more bits, that can be, for example, a packet. The system and method utilize a network of erasure codes, including block codes and parallel filter codes to achieve performance very close to the ideal MDS code with low encoding and decoding computational complexity for both small and large encoding block sizes. This network of erasure codes is referred to as a supercharged code. The supercharged code can be used to provide packet-level protection at, for example, the network, application, or transport layers of the Internet protocol suite. | 08-01-2013 |
20130258873 | Adaptive Transmit Beamforming for Frequency Division Duplexing Systems - Embodiments of a method and apparatus for performing an adaptive transmission scheme in a frequency division duplexing communication system based on channel state information estimated using an open-loop mode are described herein. In one example, the method includes estimating an impulse response of a channel using a signal received over a first frequency band of the channel from a device, transforming the impulse response into a frequency response of the channel, and subsequently performing the adaptive transmission scheme using the frequency response to transmit a signal to the device over a second frequency band of the channel that is different from the first frequency band. | 10-03-2013 |
20140148119 | Emergency (SOS) Mode Enhancements for Cellular Networks - Systems and methods for enabling a group of user equipments located in an emergency area to cooperatively transmit an emergency (SOS) message to a cellular network and to cooperatively receive an SOS message (or response) from the cellular network are provided. Embodiments further provide a scheme for enabling dedicated receivers, and/or user equipments that are attached to the cellular network to serve as relay stations for SOS messages, thereby extending the coverage of the cellular network to the emergency area. | 05-29-2014 |
20140307638 | INTERFERENCE MITIGATION THROUGH CARRIER AGGREGATION - A system for interference mitigation through carrier aggregation may include one or more processors and a memory. The memory may include instructions that, when executed by the one or more processors, cause the one or more processors to: provide data transmissions and control transmissions to a wireless device over a primary component carrier, determine that interference exists on the primary component carrier, and switch at least a portion of the data or control transmissions to a secondary component carrier in response to determining that the interference exists on the primary component carrier, while maintaining connectivity on the primary component carrier. | 10-16-2014 |
20140355522 | Systems and Methods for Splitting and Recombining Communications in Multi-Network Environments - Systems and methods for providing dynamic substream definition and handover are provided. In embodiments, a user device includes a multiple radio access technology (RAT) communications modules and a communication controller. Each RAT communication module is further configured to communicate using a different RAT. The user device identifies available networks for communication. Then, the controller determines whether a need to split a communications stream exists (e.g., the user device is engaged in a bandwidth intensive application). If the communications stream is to be split, the controller defines the substreams (either equally or unequally) and assigns a first substream to a communication pathway in a first available network and assigns a second substream to a communication pathway in a second available network. The destination then recombines the substreams. In embodiments, the controller inserts synchronization in the substreams. | 12-04-2014 |
20140355566 | Cross Radio Access Technology Access with Handoff and Interference Management Using Communication Performance Data - Systems and methods for adaptive access and handover configuration based on historical data are provided. Access and handover decisions are optimized in a multiple radio access technology environment using historical data associated with network performance. Future needs for access and handovers are predicted using historical data associated with the user and historical data associated with network performance. Performance metrics are received periodically or continuously from nodes in one or more networks at a centralized controller. The centralized multi RAT controller correlates these performance metrics and determines predicted handovers for a user device. Preparations for the predicted handovers can then be made prior to the handover event. | 12-04-2014 |
20140357224 | Application Layer Integration Into a Multi-Rat Access and Handover Environment - A wireless communication device communicating with a serving base station in a wireless communication environment may have one or more applications running. When seeking to handover from the serving base station to a target base station, the wireless communication device adjusts the configurations of the applications based on the new communication link properties. Likewise, when an application is loaded that prefers communication link properties that exceeds a current communication link's capabilities, the wireless communication device may seek out and hand over to other communication links. By cooperatively coordinating the functionality of installed applications with communication link properties, the wireless communication device can maintain high levels of device and application functionality. | 12-04-2014 |
20140378141 | Cross Radio Access Technology: Handoff Using Caching - Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product embodiments for handing off wireless communication. The apparatus comprises an antenna configured to receive data from a first access point; a cache configured to store the data; and a controller configured to predict when the transceiver will hand off a connection from the first access point to a second access point and request a burst of data from the first access point to supplement the data in the cache in preparation for the hand off. | 12-25-2014 |
Patent application number | Description | Published |
20120321656 | OLIGOPEPTIDES AND THEIR USE FOR TREATING INFECTIOUS DISEASES - The invention discloses identification, method of making and therapeutic use of synthetic oligopeptides for the treatment of infectious diseases, in particular tuberculosis. The oligopeptides are designed using virulence mediating protein for | 12-20-2012 |
20130011423 | METALLOPROTEINASE OLIGOPEPTIDES AND THEIR THERAPEUTIC USE - The invention discloses identification and therapeutic use of matrix metalloproteinase oligopeptides, SEQID 5-SEQID 21. These oligopeptides are bound to antibodies to create an immune response in the subject mammal against the matrix metalloproteinases of various diseases. This is a means of therapeutic intervention against the disease spread created by the matrix metalloproteinases. Further use of these oligopeptide-antibody responses can be extended to any and all diseases that use the matrix metalloproteinases to aid in their pathogenicity. | 01-10-2013 |
20130040273 | INTEGRATED MULTIMEDIA TOOL SYSTEM AND METHOD TO EXPLORE AND STUDY THE VIRTUAL HUMAN BODY - Several methods, processes and system for modular tool as an integrated multimedia tool system to explore and study the virtual human body is disclosed. Content and context modules allow for scientific gaming using modular multimedia objects, social media and different configurations. The disclosure allows an individual to travel through the virtual human body in a self guided and interactive tour. It specifically enables the user to learn the structure and function of different organs, different types of cells, intercellular space as well as different cellular organelles etc. Further, the system may be used by the local authority as an electronic study tool for seamless integrated mode of delivering the educational tool suited to the local curriculum. This may also serve as a tool for patients, doctors, focus groups and student to explore and learn about the pathological and physiological conditions in a human body. | 02-14-2013 |
20130040274 | INTEGRATED INTERACTIVE SYSTEM AND METHOD FOR VISUALIZING HUMAN PHYSIOLOGY, DISEASE, TREATMENT OPTIONS AND USE - A novel integrated system and method for visualizing human physiology, disease and treatment options are described in the instant application. The graphical rendering of the human body is in depth and the user can explore the internal workings of the organs and cells by simply performing a pealing like act using a cursor and the layer as a flap opens up to show the details. A user can click on a specific topic and watch a video, narration or text relevant to the topic of choice. The integrated system provides storage of curated data, social media access and interaction, database storage and analytics to calculate user behavior. This technology may used as an application on any mobile and hardware device. | 02-14-2013 |
20150074835 | TRANSGENIC MOUSE EXPRESSING HUMAN LIPOPROTEIN (A) WITH DISABLED VITAMIN C GENE AND ITS USE AS A DISEASE TREATMENT MODEL - The invention discloses novel model of transgenic mammal, a method of crossbreeding transgenic mammal and the use of the transgenic mammal for assessing prevention and/or treatment methods for cardiovascular and other diseases related to lipoprotein(a). The transgenic mammal expresses human apolipoprotein (a) (apo(a)) and human apolipoprotein B-100 (apo B-100) genes and produces human lipoprotein (a), apo (a) and apo B-100 and produces no vitamin C. This novel dual transgenic mammal is the ideal model for testing pharmaceutical compounds for efficacy and usefulness in the prevention and/or treatment of human diseases. | 03-12-2015 |
20150074837 | Transgenic mouse expressing human apo(a) and human apo(B-100) with disabled vitamin C gene produces human Lp(a) - The invention discloses novel model of transgenic mammal, a method of crossbreeding transgenic mammal and the use of the transgenic mammal for assessing prevention and/or treatment methods for cardiovascular and other diseases related to lipoprotein(a). The transgenic mammal expresses human apolipoprotein (a) (apo(a)) and human apolipoprotein B-100 (apo B-100) genes and produces human lipoprotein (a), apo (a) and apo B-100 and produces no vitamin C. This novel dual transgenic mammal is the ideal model for testing pharmaceutical compounds for efficacy and usefulness in the prevention and/or treatment of human diseases. | 03-12-2015 |
20150149217 | METHOD AND SYSTEM FOR REAL TIME VISUALIZATION OF INDIVIDUAL HEALTH CONDITION ON A MOBILE DEVICE - A method and technology to display 3D graphical output for a user using body sensor data, personal medical data in real time is disclosed. A consolidated methodology to bring user meaningful life information based on real-time sensor results, analysis, expert Q&As, “What if” scenarios and future emulation all in one artificial intelligence expert system is described. A unique rendering of 3D image of ones organ, cell or subcellular level display related to one's health condition can be visualized on a graphical user interface of a devices or devices. The change of the display from one level such as from organ to cell or cell to subcellular level or vice versa is enabled is disclosed. | 05-28-2015 |
20160106777 | NOVEL COMPOSITION METHOD OF USING THE SAME FOR THE TREATMENT OF LYME DISEASE - A composition for treating Lyme disease caused by | 04-21-2016 |
Patent application number | Description | Published |
20080242574 | Metal and Dielectric Compatible Sacrificial Anti-Reflective Coating Cleaning and Removal Composition - A liquid removal composition and process for removing sacrificial anti-reflective coating (SARC) material from a substrate having same thereon. The liquid removal composition includes at least one fluoride-containing compound, at least one organic solvent, optionally water, and optionally at least one chelating agent. The composition achieves at least partial removal of SARC material in the manufacture of integrated circuitry with minimal etching of metal species on the substrate, such as aluminum, copper and cobalt alloys, and without damage to low-k dielectric materials employed in the semiconductor architecture. | 10-02-2008 |
20090118153 | METALS COMPATIBLE POST-ETCH PHOTORESIST REMOVER AND/OR SACRIFICIAL ANTIREFLECTIVE COATING ETCHANT - A liquid removal composition and process for removing photoresist and/or sacrificial anti-reflective coating (SARC) material from a microelectronic device having same thereon. The liquid removal composition includes at least one organic quaternary base and at least one surface interaction enhancing additive. The composition achieves at least partial removal of photoresist and/or SARC material in the manufacture of integrated circuitry with minimal etching of metal species on the microelectronic device, such as copper and cobalt, and without damage to low-k dielectric materials employed in the microelectronic device architecture. | 05-07-2009 |
20090215659 | COMPOSITION USEFUL FOR REMOVAL OF POST-ETCH PHOTORESIST AND BOTTOM ANTI-REFLECTION COATINGS - An aqueous-based composition and process for removing hardened photoresist and/or bottom anti-reflective coating (BARC) material from a microelectronic device having same thereon. The aqueous-based composition includes at least one chaotropic solute, at least one alkaline base, and deionized water. The composition achieves high-efficiency removal of hardened photoresist and/or BARC material in the manufacture of integrated circuitry without adverse effect to metal species on the substrate, such as copper, and without damage to low-k dielectric materials employed in the microelectronic device architecture. | 08-27-2009 |
20120302483 | PHOTORESIST REMOVAL - Disclosed herein is a composition and method for semiconductor processing. In one embodiment, a wet-cleaning composition for removal of photoresist is provided. The composition comprises a strong base; an oxidant; and a polar solvent. In another embodiment, a method for removing photoresist is provided. The method comprises the steps of applying a wet-cleaning composition comprising about 0.1 to about 30 weight percent strong base; about one to about 30 weight percent oxidant; about 20 to about 95 weight percent polar solvent; and removing the photoresist. | 11-29-2012 |
20130109605 | COMPOSITION AND PROCESS FOR POST-ETCH REMOVAL OF PHOTORESIST AND/OR SACRIFICIAL ANTI-REFLECTIVE MATERIAL DEPOSITED ON A SUBSTRATE | 05-02-2013 |
20140213498 | PHOTORESIST REMOVAL - Disclosed herein is a composition and method for semiconductor processing. In one embodiment, a wet-cleaning composition for removal of photoresist is provided. The composition comprises a strong base; an oxidant; and a polar solvent. In another embodiment, a method for removing photoresist is provided. The method comprises the steps of applying a wet-cleaning composition comprising about 0.1 to about 30 weight percent strong base; about one to about 30 weight percent oxidant; about 20 to about 95 weight percent polar solvent; and removing the photoresist. | 07-31-2014 |
Patent application number | Description | Published |
20090236281 | SYSTEM AND METHOD FOR TREATING PRODUCED WATER - Systems and methods have been developed for treating the waste water contaminated with methanol and boron in addition to other contaminants. The systems and methods allow specifically for the removal of the methanol and boron without the addition of significant chemicals to raise the pH. The water is treated by removing the methanol via biological digestion in a bioreactor, separating a majority of the contaminants from the water by reverse osmosis and removing the boron that passes through the reverse osmosis system with a boron-removing ion exchange resin. | 09-24-2009 |
20100038310 | Waste Water Treatment Method - Systems and methods have been developed for reclaiming water contaminated with the expected range of contaminants typically associated with produced water, including water contaminated with slick water, methanol and boron. The system includes anaerobically digesting the contaminated water, followed by aerating the water to enhance biological digestion. After aeration, the water is separated using a flotation operation that effectively removes the spent friction reducing agents and allows the treated water to be reclaimed and reused as fracturing water, even though it retains levels of contaminants, including boron and methanol, that would prevent its discharge to the environment under existing standards. The treated water may further be treated by removing the methanol via biological digestion in a bioreactor, separating a majority of the contaminants from the water by reverse osmosis and removing the boron that passes through the reverse osmosis system with a boron-removing ion exchange resin. | 02-18-2010 |
20120152830 | WASTE WATER TREATMENT METHOD - Systems and methods have been developed for reclaiming water contaminated with the expected range of contaminants typically associated with produced water, including water contaminated with slick water, methanol and boron. The system includes anaerobically digesting the contaminated water, followed by aerating the water to enhance biological digestion. After aeration, the water is separated using a flotation operation that effectively removes the spent friction reducing agents and allows the treated water to be reclaimed and reused as fracturing water, even though it retains levels of contaminants, including boron and methanol, that would prevent its discharge to the environment under existing standards. The treated water may further be treated by removing the methanol via biological digestion in a bioreactor, separating a majority of the contaminants from the water by reverse osmosis and removing the boron that passes through the reverse osmosis system with a boron-removing ion exchange resin. | 06-21-2012 |
20130330128 | WASTE WATER TREATMENT METHOD - Systems and methods have been developed for reclaiming water contaminated with the expected range of contaminants typically associated with produced water, including water contaminated with slick water, methanol and boron. The system includes anaerobically digesting the contaminated water, followed by aerating the water to enhance biological digestion. After aeration, the water is separated using a flotation operation that effectively removes the spent friction reducing agents and allows the treated water to be reclaimed and reused as fracturing water, even though it retains levels of contaminants, including boron and methanol, that would prevent its discharge to the environment under existing standards. The treated water may further be treated by removing the methanol via biological digestion in a bioreactor, separating a majority of the contaminants from the water by reverse osmosis and removing the boron that passes through the reverse osmosis system with a boron-removing ion exchange resin. | 12-12-2013 |
Patent application number | Description | Published |
20150100630 | SYSTEM AND METHOD FOR THROTTLING SERVICE REQUESTS HAVING NON-UNIFORM WORKLOADS - A system that provides services to clients may receive and service requests, various ones of which may require different amounts of work. The system may determine whether it is operating in an overloaded or underloaded state based on a current work throughput rate, a target work throughput rate, a maximum request rate, or an actual request rate, and may dynamically adjust the maximum request rate in response. For example, if the maximum request rate is being exceeded, the maximum request rate may be raised or lowered, dependent on the current work throughput rate. If the target or committed work throughput rate is being exceeded, but the maximum request rate is not being exceeded, a lower maximum request rate may be proposed. Adjustments to the maximum request rate may be made using multiple incremental adjustments. Service request tokens may be added to a leaky token bucket at the maximum request rate. | 04-09-2015 |
20150112999 | SYSTEM AND METHOD FOR IMPLEMENTING A SCALABLE DATA STORAGE SERVICE - A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies. | 04-23-2015 |
20150120658 | SYSTEM AND METHOD FOR SPLITTING A REPLICATED DATA PARTITION - A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of partitions that are stored on respective computing nodes in the system. The system may split a data partition into two new partitions, and may split the replica group that stored the original partitions into two new replica groups, each storing one of the new partitions. To split the replica group, the master replica may propagate membership changes to the other members of the replica group for adding members to the original replica group and for splitting the expanded replica group into two new replica groups. Subsequent to the split, replicas may attempt to become the master for the original replica group or for a new replica group. If an attempt to become master replica for the original replica group succeeds, the split may fail. | 04-30-2015 |
20150156123 | SYSTEM AND METHOD FOR THROTTLING SERVICE REQUESTS USING WORK-BASED TOKENS - A system that provides services to clients may receive and service requests, various ones of which may require different amounts of work. An admission control mechanism may manage requests based on tokens, each of which represents a fixed amount of work. The tokens may be added to a token bucket at rate that is dependent on a target work throughput rate while the number of tokens in the bucket does not exceed its maximum capacity. If at least a pre-determined minimum number of tokens is present in the bucket when a service request is received, it may be serviced. Servicing a request may include deducting an initial number of tokens from the bucket, determining that the amount of work performed in servicing the request is different than that represented by the initially deducted tokens, and deducting additional tokens from or replacing tokens in the bucket to reflect the difference. | 06-04-2015 |
20150268890 | SYSTEM AND METHOD FOR PERFORMING LIVE PARTITIONING IN A DATA STORE - A system that implements a scalable data storage service may maintain tables in a data store on behalf of storage service clients. The service may maintain table data in multiple replicas of partitions that are stored on respective computing nodes in the system. In response to detecting an anomaly in the system, detecting a change in data volume on a partition or service request traffic directed to a partition, or receiving a service request from a client to split a partition, the data storage service may create additional copies of a partition replica using a physical copy mechanism. The data storage service may issue a split command defined in an API for the data store to divide the original and additional replicas into multiple replica groups, and to configure each replica group to maintain a respective portion of the table data that was stored in the partition before the split. | 09-24-2015 |
20150301901 | SYSTEM AND METHOD FOR ADJUSTING MEMBERSHIP OF A DATA REPLICATION GROUP - A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of partitions that are stored on respective computing nodes in the system. A master replica for a replica group may increment a membership version indicator for the group, and may propagate metadata (including the membership version indicator) indicating a membership change for the group to other members of the group. Propagating the metadata may include sending a log record containing the metadata to the other replicas to be appended to their respective logs. Once the membership change becomes durable, it may be committed. A replica attempting to become the master of a replica group may determine that another replica in the group has observed a more recent membership version, in which case logs may be synchronized or snipped, or the attempt may be abandoned. | 10-22-2015 |
20150363124 | SYSTEM AND METHOD FOR DATA REPLICATION USING A SINGLE MASTER FAILOVER PROTOCOL - A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of various partitions that are stored on respective computing nodes in the system. The system may employ a single master failover protocol, usable when a replica attempts to become the master replica for a replica group of which it is a member. Attempting to become the master replica may include acquiring a lock associated with the replica group, and gathering state information from the other replicas in the group. The state information may indicate whether another replica supports the attempt (in which case it is included in a failover quorum) or stores more recent data or metadata than the replica attempting to become the master (in which case synchronization may be required). If the failover quorum includes enough replicas, the replica may become the master. | 12-17-2015 |
20150370872 | EMBEDDABLE CLOUD ANALYTICS - An analytics module may be embedded into an application developed, published, or used by an entity in addition to the owner of the data under analysis. An access token may be submitted by the analytics module to a provider of hosted services. The access token may correspond to an n-dimensional cube containing data at a level of granularity permitted to the application. The access token may incorporate additional policies controlling access to the corresponding n-dimensional cube. | 12-24-2015 |
20150370881 | DYNAMIC N-DIMENSIONAL CUBES FOR HOSTED ANALYTICS - An online analytical processing system may comprise an n-dimensional cube structured using slice-based partitioning in which each slice comprises one or more hierarchies of data points. A region of a hierarchy may be classified according to computational demands associated with the region. A scaling or replication mechanism may be applied to the region based on the computational demands associated with that region. | 12-24-2015 |
20150370882 | USE OF DEPENDENCY GRAPHS TO DYNAMICALLY UPDATE N-DIMENSIONAL CUBES - An online analytical processing system may comprise an n-dimensional cube structured using slice-based partitioning in which each slice comprises data points corresponding to a set of dimension values fixed across the slice and a set of dimension values allowed to vary. Slices may be partitioned and replicated across computing nodes. Views of the n-dimensional cube may be partially materialized by determining dependencies between slices. A central data dictionary may maintain information about slices and slice dependencies. Dimensions may be added by adding a new slice without requiring immediate recomputation of existing data points. | 12-24-2015 |
20150370883 | DATA INTEREST ESTIMATION FOR N-DIMENSIONAL CUBE COMPUTATIONS - An online analytical processing system may comprise an n-dimensional cube partitioned into slices, in which each slice may represent data points at the intersections of fixed and variable dimensions. Computation of data points within a slice may be deferred. A dependency graph may be initially constructed, in which the dependency graph is utilized in a subsequent computation. Calculation of data points may be prioritized based on information indicative of a chance that the data points will be accessed. | 12-24-2015 |
20160070589 | SCALABLE LOG-BASED TRANSACTION MANAGEMENT - A first transaction manager of a partitioned storage group stores a first conditional commit record for a first write of a multi-partition transaction based on a first conflict detection operation. A second transaction manager stores a second conditional commit record for a second write of the transaction based on a second conflict detection operation. A client-side component of the storage group determines that both writes have been conditionally committed, and stores an unconditional commit record in a commit decision repository. A write applier examines the first conditional commit record and the unconditional commit record before propagating the first write to the first partition. | 03-10-2016 |
20160070740 | STATELESS DATASTORE-INDEPENDENT TRANSACTIONS - At a client-side component of a storage group, a read descriptor generated in response to a read request directed to a first data store is received. The read descriptor includes a state transition indicator corresponding to a write that has been applied at the first data store. A write descriptor indicative of a write that depends on a result of the read request is generated at the client-side component. The read descriptor and the write descriptor are included in a commit request for a candidate transaction at the client-side component, and transmitted to a transaction manager. | 03-10-2016 |
20160070771 | READ DESCRIPTORS AT HETEROGENEOUS STORAGE SYSTEMS - In response to a read request directed to a first data store of a storage group, a state transition indicator is identified, corresponding to a modification that has been applied at the data store before a response to the read is prepared. A read descriptor that includes the state transition indicator and read repeatability verification metadata is prepared. The metadata can be used to check whether the read request is a repeatable read. The read descriptor is transmitted to a client-side component of the storage group. | 03-10-2016 |
Patent application number | Description | Published |
20120330954 | System And Method For Implementing A Scalable Data Storage Service - A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies. | 12-27-2012 |
20140082028 | SYSTEM AND METHOD FOR IMPLEMENTING A SCALABLE DATA STORAGE SERVICE - A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies. | 03-20-2014 |
20140244581 | SYSTEM AND METHOD FOR LOG CONFLICT DETECTION AND RESOLUTION IN A DATA STORE - A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas that are stored on respective computing nodes in the system. Updates to the stored data and to the membership of replica groups are propagated as replicated log records. A replica receiving a log record may compare metadata in the received log record to corresponding metadata in a log record that was previously appended to its log to determine a response. The metadata may include a sequence number, a lock generation identifier, an epoch identifier, or an indication of an epoch change. The replica may append the received log record to its log, drop the received log record, or cache the received log record for future use. If a log conflict indicates an invalid log stream branch, one or more log records may be deleted. | 08-28-2014 |
20140258232 | SYSTEM AND METHOD FOR PERFORMING REPLICA COPYING USING A PHYSICAL COPY MECHANISM - A system that implements a data storage service may maintain tables in a data store on behalf of clients. The service may maintain table data in multiple replicas of partitions of the data that are stored on respective computing nodes in the system. In response to detecting a failure or fault condition, or receiving a service request from a client to move or copy a partition replica, the data store may copy a partition replica to another computing node using a physical copy mechanism. The physical copy mechanism may copy table data from physical storage locations in which it is stored to physical storage locations allocated to a destination replica on the other computing node. During copying, service requests to modify table data may be logged and applied to the replica being copied. A catch-up operation may be performed to apply modification requests received during copying to the destination replica. | 09-11-2014 |
20140279905 | TOKEN-BASED ADMISSION CONTROL FOR REPLICATED WRITES - Methods and apparatus for token-based admission control for replicated writes are disclosed. Data objects are divided into partitions, and corresponding to each partition, at least a master replica and a slave replica are stored. A determination as to whether to accept a write request directed to the partition is made based at least in part on one or more of (a) available throughput capacity at the master replica, and (b) an indication, obtained using a token-based protocol, of available throughput capacity at the slave replica. If the write request is accepted, one or more data modification operations are initiated. | 09-18-2014 |
20140344236 | Index Update Pipeline - Distributed database management systems may maintain collections of items spanning multiple partitions. Index structures may correspond to items on one partition or to items on multiple partitions. Item collections and indexes may be replicated. Changes to the data maintained by the distributed database management system may result in updates to multiple index structures. The changes may be compiled into an instruction set applicable to the index structures. In-memory buffers may contain the instructions prior to transmission to affected partitions. Replication logs may be combined with an acknowledgment mechanism for reliable transmission of the instructions to the affected partitions. | 11-20-2014 |
20140359341 | LOCALITY BASED QUORUMS - Disclosed are various embodiments for distributing data items within a plurality of nodes. A data item that is subject to a data item update request is updated from a master node to a plurality of slave notes. The update of the data item is determined to be locality-based durable based at least in part on acknowledgements received from the slave nodes. Upon detection that the master node has failed, a new master candidate is determined via an election among the plurality of slave nodes. | 12-04-2014 |
20140379921 | RESOURCE SILOS AT NETWORK-ACCESSIBLE SERVICES - Methods and apparatus for resource silos at network-accessible services are disclosed. A subset of resources used for a database service, including at least one resource from each of a plurality of data centers, is selected for membership in a resource silo based on grouping criteria. A silo routing layer node identifies the resource silo as the target silo to which a client work request is to be directed. The client work request is sent to a front-end resource of the target silo either by the client, or by the silo routing layer node on behalf of the client. The front-end resource of the target silo transmits a representation of the work request to a back-end resource of the target silo, where a work operation corresponding to request is performed. | 12-25-2014 |
20150046395 | SYSTEM AND METHOD FOR MAINTAINING A MASTER REPLICA FOR READS AND WRITES IN A DATA STORE - A system that implements a data storage service may store data on behalf of clients in multiple replicas on respective computing nodes. The system may employ an external service to select a master replica for a replica group. The master replica may service consistent read operations and/or write operations that are directed to the replica group (or to a data partition stored by the replica group). The master replica may employ a quorum based mechanism for performing replicated write operations, and a local lease mechanism for determining the replica authorized to perform consistent reads, even when the external service is unavailable. The master replica may propagate local leases to replica group members as replicated writes. If another replica assumes mastership for the replica group, it may not begin servicing consistent read operations that are directed to the replica group until the lease period for a current local lease expires. | 02-12-2015 |
20150269239 | STORAGE DEVICE SELECTION FOR DATABASE PARTITION REPLICAS - A system that implements a data storage service may store data in multiple replicated partitions on respective storage nodes. The selection of the storage nodes (or storage devices thereof) on which to store the partition replicas may be performed by administrative components that are responsible for partition management and resource allocation for respective groups of storage nodes (e.g., based on a global view of resource capacity or usage), or the selection of particular storage devices of a storage node may be determined by the storage node itself (e.g., based on a local view of resource capacity or usage). Placement policies applied at the administrative layer or storage layer may be based on the percentage or amount of provisioned, reserved, or available storage or IOPS capacity on each storage device, and particular placements (or subsequent operations to move partition replicas) may result in an overall resource utilization that is well balanced. | 09-24-2015 |