Patent application number | Description | Published |
20100262964 | Virtual Machine Packing Method Using Scarcity - A method for packing virtual machines onto host devices may calculate scarcity values for several different parameters. A host's scarcity for a parameter may be determined by multiplying the host's capacity for a parameter with the overall scarcity of that parameter. The sum of a host's scarcity for all the parameters determines the host's overall scarcity. Hosts having the highest scarcity are attempted to be populated with a group of virtual machines selected for compatibility with the host. In many cases, several different scenarios may be evaluated and an optimal scenario implemented. The method gives a high priority to those virtual machines that consume scarce resources, with the scarcity being a function of the available hardware and the virtual machines that may be placed on them. | 10-14-2010 |
20100281478 | MULTIPHASE VIRTUAL MACHINE HOST CAPACITY PLANNING - A virtual machine distribution system is described herein that uses a multiphase approach that provides a fast layout of virtual machines on physical computers followed by at least one verification phase that verifies that the layout is correct. During the fast layout phase, the system uses a dimension-aware vector bin-packing algorithm to determine an initial fit of virtual machines to physical hardware based on rescaled resource utilizations calculated against hardware models. During the verification phase, the system uses a virtualization model to check the recommended fit of virtual machine guests to physical hosts created during the fast layout phase to ensure that the distribution will not over-utilize any host given the overhead associated with virtualization. The system modifies the layout to eliminate any identified overutilization. Thus, the virtual machine distribution system provides the advantages of a fast, automated layout planning process with the robustness of slower, exhaustive processes. | 11-04-2010 |
20110067030 | FLOW BASED SCHEDULING - A job scheduler may schedule concurrent distributed jobs in a computer cluster by assigning tasks from the running jobs to compute nodes while balancing fairness with efficiency. Determining which tasks to assign to the compute nodes may be performed using a network flow graph. The weights on at least some of the edges of the graph encode data locality, and the capacities provide constraints that ensure fairness. A min-cost flow technique may be used to perform an assignment of the tasks represented by the network flow graph. Thus, online task scheduling with locality may be mapped onto a network flow graph, which in turn may be used to determine a scheduling assignment using min-cost flow techniques. The costs may encode data locality, fairness, and starvation-freedom. | 03-17-2011 |
20110164746 | MAINTAINING PRIVACY DURING USER PROFILING - Systems, methods, and computer storage media having computer-executable instructions embodied thereon that maintain privacy during user profiling are provided. A profiling service receives, from a first device, rules for profiling a user. The rules were encrypted using a private key. The profiling service also receives, from a second device, user data. The user data was encrypted using a public key communicated to the second device by the first device. The profiling service then matches the encrypted rules with the encrypted user data, and based on the matching, generates a profile for the user. In embodiments, such a user profile can be utilized to deliver personalized digital content to a user. | 07-07-2011 |
20110167003 | MAINTAINING PRIVACY DURING PERSONALIZED CONTENT DELIVERY - Embodiments of the present invention relate to systems, methods, and computer-storage media for maintaining privacy while delivering advertisements based on encrypted user profile identifiers. In embodiments, a Public key Encryption with Keyword Search (PEKS) is used to generate a public key and a private key. In embodiments, a public key and a private key are used to encrypt user profile identifiers and generate trapdoors associated with defined profile identifiers, respectively. A portion of the encrypted user profile identifiers are compared to a portion of the trapdoors. If a match is present between at least one encrypted user profile identifier and an associated trapdoor, a delivery engine is provided with an identification of content to be delivered to the user. The provided description is then used to determine an advertisement to present to a user. The advertisement is then presented to the user. | 07-07-2011 |
20130275977 | VIRTUAL MACHINE PACKING METHOD USING SCARCITY - A method for packing virtual machines onto host devices may calculate scarcity values for several different parameters. A host's scarcity for a parameter may be determined by multiplying the host's capacity for a parameter with the overall scarcity of that parameter. The sum of a host's scarcity for all the parameters determines the host's overall scarcity. Hosts having the highest scarcity are attempted to be populated with a group of virtual machines selected for compatibility with the host. In many cases, several different scenarios may be evaluated and an optimal scenario implemented. The method gives a high priority to those virtual machines that consume scarce resources, with the scarcity being a function of the available hardware and the virtual machines that may be placed on them. | 10-17-2013 |
Patent application number | Description | Published |
20090164715 | Protecting Against Stale Page Overlays - A method, data processing system and program product for protecting against stale page overlays which includes executing a process in memory of the data processing system. A storage controller pages data from the memory to a disk in pages when the memory is constrained by other processes being executed by the data processing system. Data is then paged from the disk into memory in a one or more paged-in pages. The paged-in page is updated with updated data by the process, and the version on the disk is marked as stale. The storage controller commands the disk to make the stale disk version of the updated paged-in page as write-only, thereby providing that the disk version may be overwritten with new data while providing that the disk version cannot be read. | 06-25-2009 |
20130019063 | STORAGE CONTROLLER CACHE PAGE MANAGEMENTAANM Astigarraga; TaraAACI TucsonAAST AZAACO USAAGP Astigarraga; Tara Tucson AZ USAANM Browne; Michael E.AACI StaatsburgAAST NYAACO USAAGP Browne; Michael E. Staatsburg NY USAANM Demczar; JosephAACI Salt PointAAST NYAACO USAAGP Demczar; Joseph Salt Point NY USAANM Wieder; Eric C.AACI New PaltzAAST NYAACO USAAGP Wieder; Eric C. New Paltz NY US - A cache page management method can include paging out a memory page to an input/output controller, paging the memory page from the input/output controller into a real memory, modifying the memory page in the real memory to an updated memory page and purging the memory page paged to the input/output controller. | 01-17-2013 |
20130021597 | CABLE IDENTIFICATION - A storage area network cable apparatus can include a cable, an identification adaptor disposed in the cable, an illuminator disposed in the identification adaptor, an endpoint adaptor disposed at an end of the cable and an integrated device disposed in the endpoint adapter and configured to generate a frequency in the cable. | 01-24-2013 |
20130181816 | MECHANISM AND METHOD FOR RFID CABLE PATH LABELING, IDENTIFICATION, AND INVENTORY - The present invention relates to the use of RFID technology to identify the specific location of cable ends in a network configuration. An end of a cable has an attached RFID tag capable of storing cable identification information. The cable end is connected to an endpoint adapter having a means for communicating with the identification adapter in the cable end. A database stores the cable identification information read by the communication means within the endpoint adapter. | 07-18-2013 |
Patent application number | Description | Published |
20140190335 | Music and Sound that Varies from One Playback to Another Playback - A method and apparatus for the creation and playback of music and/or sound, so that sound sequences are generated that vary from one playback to another playback. In one embodiment, during composition creation, artist(s) may define how the composition may vary from playback to playback using visually interactive display(s). The artist's definition may be embedded into a composition dataset. During playback, a composition data set may be processed by a playback device and/or a playback program, so that each time the composition is played-back a unique version may be generated. Variability during playback may include: the variable selection of alternative sound segment(s); variable editing of sound segment(s) during playback processing; variable placement of sound segment(s) during playback processing; the spawning of group(s) of alternative sound segments from initiating sound segment(s); and the combining and/or mixing of alternative sound segments in one or more sound channels. MIDI-like variable compositions and the variable use of sound segments comprised of a timed sequence of MIDI-like commands are also disclosed. | 07-10-2014 |
20140195025 | Adaptive Personalized Playback or Presentation using Count - Methods and apparatus for providing a personalized entertainment experience, which may be customized for each user. A user's playback/presentation history and/or user actions may be captured and associated with each played/presented composition. A target time for playback/presentation of a composition to the user may be determined by using a user's playback/presentation history and/or user actions. The target time for playback/presentation may incorporate a target time between playbacks/presentations of a composition, which may be at least partially based on a user's playback/presentation history and/or user actions. A customized sequence of compositions may be automatically generated for each user. The personalized sequence may automatically adapt to changing user actions and preferences over time. The user's collection of compositions may be automatically integrated with the generated customized sequence. In one embodiment, a target time for next playback/presentation may incorporate a time between playback/presentation, which is at least partially based on a count of the number of times the user has experienced a composition. | 07-10-2014 |
20140195026 | Adaptive Personalized Playback or Presentation using Rating - Methods and apparatus for providing a personalized entertainment experience, which may be customized for each user. A user's playback/presentation history and/or user actions may be captured and associated with each played/presented composition. A target time for playback/presentation of a composition to the user may be determined by using a user's playback/presentation history and/or user actions. The target time for playback/presentation may incorporate a target time between playbacks/presentations of a composition, which may be at least partially based on a user's playback/presentation history and/or user actions. A customized sequence of compositions may be automatically generated for each user. The personalized sequence may automatically adapt to changing user actions and preferences over time. The user's collection of compositions may be automatically integrated with the generated customized sequence. In one embodiment, a target time for next playback/presentation may incorporate a time between playback/presentation, which is at least partially based on rating (preference) of the user for the composition. The user rating (preference) may be explicitly provided by the user or may be implicitly determined at least partially based upon controls or action(s) by the user, that are related to the composition. | 07-10-2014 |
20140195919 | Adaptive Personalized Playback or Presentation using Cumulative Time - Methods and apparatus for providing a personalized entertainment experience, which may be customized for each user. A user's playback/presentation history and/or user actions may be captured and associated with each played/presented composition. A target time for playback/presentation of a composition to the user may be determined by using a user's playback/presentation history and/or user actions. The target time for playback/presentation may incorporate a target time between playbacks/presentations of a composition, which may be at least partially based on a user's playback/presentation history and/or user actions. A customized sequence of compositions may be automatically generated for each user. The personalized sequence may automatically adapt to changing user actions and preferences over time. The user's collection of compositions may be automatically integrated with the generated customized sequence. In one embodiment, a target time for next playback/presentation may incorporate a time between playback/presentation, which is at least partially based on the cumulative time that the user has experienced a composition. | 07-10-2014 |
20140230629 | Using Sound-Segments to Find & Act-Upon a Composition - A method, apparatus and system that enables a user to find and act-upon a sound-containing composition, in a group of compositions. One or more sound-segments, which are intended to prompt a user's memory, may be associated with each composition in a group of compositions. A recognition sound-segment may include a portion of its associated composition, which is more recognizable to users than the beginning part of its associated composition. A recognition-segment may contain one or more highly recognizable portion(s) of a composition. When the user is trying to locate or select a particular composition, the recognition-segments are navigated and played-back to the user, based upon a user-device context/mode. When a user recognizes the desired composition from its recognition-segment, the user may initiate a control action to playback; arrange; and/or act-upon, the composition that is associated with the currently playing recognition-segment. | 08-21-2014 |
20140230630 | Simultaneously Playing Sound-Segments to Find & Act-Upon a Composition - A method, apparatus and system that enables a user to find and act-upon a sound-containing composition, in a group of compositions. One or more sound-segments, which are intended to prompt a user's memory, may be associated with each composition in a group of compositions. A recognition sound-segment may include a portion of its associated composition, which is more recognizable to users than the beginning part of its associated composition. A recognition-segment may contain one or more highly recognizable portion(s) of a composition. When the user is trying to locate or select a particular composition, the recognition-segments are navigated and played-back to the user, based upon a user-device context/mode. When a user recognizes the desired composition from its recognition-segment, the user may initiate a control action to playback; arrange; and/or act-upon, the composition that is associated with the currently playing recognition-segment. | 08-21-2014 |
20140230631 | Using Recognition-Segments to Find and Act-Upon a Composition - A method, apparatus and system that enables a user to find and act-upon a sound-containing composition, in a group of compositions. One or more sound-segments, which are intended to prompt a user's memory, may be associated with each composition in a group of compositions. A recognition sound-segment may include a portion of its associated composition, which is more recognizable to users than the beginning part of its associated composition. A recognition-segment may contain one or more highly recognizable portion(s) of a composition. When the user is trying to locate or select a particular composition, the recognition-segments are navigated and played-back to the user, based upon a user-device context/mode. When a user recognizes the desired composition from its recognition-segment, the user may initiate a control action to playback; arrange; and/or act-upon, the composition that is associated with the currently playing recognition-segment. | 08-21-2014 |
Patent application number | Description | Published |
20110212866 | WATER-RICH STRIPPING AND CLEANING FORMULATION AND METHOD FOR USING SAME - The present invention relates to water-rich formulations and the method using same, to remove bulk photoresists, post-etched and post-ashed residues, residues from Al back-end-of-the-line interconnect structures, as well as contaminations. The formulation comprises: hydroxylamine; corrosion inhibitor containing a mixture of alkyl dihydroxybenzene and hydroxyquinoline; an alkanolamine, a water-soluble solvent or the combination of the two; and at least 50% by weight of water. | 09-01-2011 |
20110311921 | Composition For Stripping And Cleaning And Use Thereof - A composition comprising one or more water soluble organic solvents comprising a glycol ether; water; a fluoride containing compound provided that if the fluoride containing compound is ammonium fluoride than no additional fluoride containing compound is added to the composition; optionally a quaternary ammonium compound; and optionally a corrosion inhibitor is disclosed herein that is capable of removing residues from an article such as photoresist and/or etching residue. Also disclosed herein is a method for removing residues from an article using the composition disclosed herein. | 12-22-2011 |
20130296215 | WATER-RICH STRIPPING AND CLEANING FORMULATION AND METHOD FOR USING SAME - The present invention relates to water-rich formulations and the method using same, to remove bulk photoresists, post-etched and post-ashed residues, residues from Al back-end-of-the-line interconnect structures, as well as contaminations. The formulation comprises: hydroxylamine; corrosion inhibitor containing a mixture of alkyl dihydroxybenzene and hydroxyquinoline; an alkanolamine, a water-soluble solvent or the combination of the two; and at least 50% by weight of water. | 11-07-2013 |