51st week of 2012 patent applcation highlights part 68 |
Patent application number | Title | Published |
20120324401 | METHODS AND SYSTEM FOR THREE DIMENSIONAL TIME AND SPACIAL USER INTERFACE - A three dimensional graphical user interface module operating within a computing system in a manner to display information retrieved from a database within or operatively connected to the computing system that stores a plurality of data files. The graphical user interface is configured as a plurality of viewable surfaces, wherein at least one of the plurality of viewable surfaces is configured as a sphere, displayed three-dimensionally and includes a plurality of interface items displayed thereon. In using the three dimensional graphical user interface, the user may access a second viewable surface configured as a three-dimensional sphere through an entrance point within a first viewable surface configured as a three-dimensional sphere. The three dimensional graphical user interface allows the user to access and retrieve the data stored in the database upon selecting one of the plurality of interface items illustrated on the surface of one of the plurality of viewable surfaces. | 2012-12-20 |
20120324402 | Vascular Assessment System - Systems and methods for aiding treatment of a medical condition are described. One such method includes: displaying at an interface (i) a graphical representation of at least a portion of an anatomic area, and (ii) regions of interest at locations in the representation, each of the regions representing an anatomic site of a medical event; receiving from a user a first selection representing a first site among the anatomic sites; determining a first set of morphologies of the first site, each member of the first set being clinically associated with occurrence of the event at a diseased portion of the first site; and determining, based on a second selection by the user, a second set of morphologies of the first site, each member of the second set including at least one of a shape and a size of the diseased portion associated with the first member. | 2012-12-20 |
20120324403 | METHOD OF INFERRING NAVIGATIONAL INTENT IN GESTURAL INPUT SYSTEMS - In a processing system having a touch screen display, a method of inferring navigational intent by a user in a gestural input system of the processing system is disclosed. A graphical user interface may receive current gestural input data for an application of the processing system from the touch screen display. The graphical user interface may generate an output action based at least in part on an analysis of one or more of the current gestural input data, past gestural input data for the application, and current and past context information of usage of the processing system. The graphical user interface may cause performance of the output action. | 2012-12-20 |
20120324404 | SYSTEM AND METHOD FOR RENDERING A REMOTE VIEW AT A CLIENT DEVICE - Examples of systems and methods are provided for facilitating rendering at a local client device a remote view associated with a remote application on a remote server. A method may comprise generating the remote view of the remote application based on display output data of the remote application, wherein a portion of the display output data is visible in the remote view, tracking coordinates and dimensions of the portion of the display output that is visible, receiving a message from the remote server comprising coordinates and dimensions of one of a window box, a dialog box and an object, comparing the coordinates and dimensions of the portion of the display output data that is visible with the coordinates and dimensions of the one of the window box, the dialog box and the object, and adjusting the portion of the display output data that is visible based on the comparison. | 2012-12-20 |
20120324405 | Performing OPC on Hardware or Software Platforms with GPU - Optical proximity correction techniques performed on one or more graphics processors improve the masks used for the printing of microelectronic circuit designs. Execution of OPC techniques on hardware or software platforms utilizing graphics processing units. GPUs may share the computation load with the system CPUs to efficiently and effectively execute the OPC method steps. | 2012-12-20 |
20120324406 | METHOD OF OPTIMIZATION OF A MANUFACTURING PROCESS OF AN INTEGRATED CIRCUIT LAYOUT - A computer-implemented method, article of manufacture, and computer system for optimization of a manufacturing process of an integrated circuit or IC layout. The method includes: receiving input; organizing IC patterns; selecting IC patterns amongst the organized IC patterns; and optimizing a design of a manufacturing process of the IC layout based on the selected IC patterns. | 2012-12-20 |
20120324407 | SIMULATION MODEL CREATING METHOD, COMPUTER PROGRAM PRODUCT, AND METHOD OF MANUFACTURING A SEMICONDUCTOR DEVICE - According to a simulation model creating method of an embodiment, a resist pattern is formed by transferring a mask pattern on a first substrate with an exposing amount and a focus value being changed, and a line width of the resist pattern is measured. Next, measurement results which are not within an allowable change range due to an irregularity of the exposing amount, an irregularity of the focus value or pattern feature amount are removed. In addition, measurement results which are not with in an allowable change range due to an irregularity of the line width of the mask pattern are removed. Next, a simulation model is created by using measurement results which are not removed. | 2012-12-20 |
20120324408 | System and Method for a Chip Generator - A chip generator according to an embodiment of the present invention codifies designer knowledge and design trade-offs into a template that can be used to create many different chips. Like reconfigurable designs, an embodiment of the present invention fixes the top level system architecture, amortizes software and validation and design costs, and enables a rich system simulation environment for application developers. Meanwhile, below the top level, the developer can “program” the individual inner components of the architecture. Unlike reconfigurable chips, a chip generator according to an embodiment of the present invention, compiles the program to create a customized chip. This compilation process occurs at elaboration time—long before silicon is fabricated. The result is a framework that enables more customization of the generated chip at the architectural level because additional components and logic can be added if the customization process requires it. | 2012-12-20 |
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. | 2012-12-20 |
20120324410 | AUTOMATIC REDUCTION OF MODES OF ELECTRONIC CIRCUITS FOR TIMING ANALYSIS - Modes of a circuit are merged together to reduce the number of modes. Subsets of modes are identified such that modes belonging to each subset are mergeable. A set of modes is mergeable if every pair of modes in the set is mergeable. Constraints of modes belonging to each pair of modes are compared to determine whether two modes are mergeable. To allow two modes to be merged, a constraint is transformed such that it affects the same paths in the merged mode and the first mode but excludes paths from the second mode. Determining whether two modes are mergeable may include verifying whether a clock in one mode blocks propagation of a clock in another mode and whether a value specified in a constraint in a mode is within specified tolerance of the value of a corresponding constraint in another mode. | 2012-12-20 |
20120324411 | INTEGRATED CIRCUIT OPTIMIZATION MODELING TECHNOLOGY - A design optimization method for a target circuit design specified by a machine-readable file, comprises providing a computer-implemented model as a function of a set of characteristics of circuit designs of circuit optimization achievable due to a circuit modification procedure, such as timing constrained gate length modification for leakage power reduction. Using values of said set of characteristics for the target circuit design, the computer-implemented model is applied to the target circuit design to produce an indication of susceptibility of the target circuit design to optimization. The model can be produced using Monte Carlo simulations of a set of virtual designs, and fitting a function of said characteristics to the results. | 2012-12-20 |
20120324412 | Reducing Leakage Power in Integrated Circuit Designs - A method for reducing leakage power of an IC during the design of the IC. A cell based IC design is received that includes a plurality of signal paths with positive slack. The positive slack is converted to negative slack by replacing cell instances in the IC design with footprint equivalent variants of the cell instances. The negative slack is converted back to positive slack via an iterative path-based analysis of the IC design. In each iteration, a path is selected that has negative slack and replacement values are computed for cell instances in the path. One or more cell instances in the path are then replaced with variants based on the replacement values. | 2012-12-20 |
20120324413 | SEMICONDUCTOR MEMORY - A method includes simulating a first design of a semiconductor memory that includes at least one device disposed between and coupled to a memory bit cell and to a power supply line, determining if at least one simulated operational value of the semiconductor memory is above a threshold value, and adjusting at least one of a size of the device or a type of the device if the at least one simulated operational value is below the threshold value. The memory bit cell is disposed in a column including a plurality of bit cells. The size or type of the device is repeatedly adjusted and the design of the semiconductor memory is repeatedly simulated until the at least one simulated operational value is at or above the threshold value. | 2012-12-20 |
20120324414 | BDD-BASED FUNCTIONAL MODELING - A computer-implemented method, apparatus, and computer program product for assisting in dynamic verification of a System Under Test (SUT). The method comprising obtaining a set of functional attributes and associated domains with respect to a System Under Test (SUT), and obtaining a set of restrictions over the functional attributes and associated domains. The method comprising encoding a Binary Decision Diagram (BDD) to represent a Cartesian cross-product test-space of all possible combinations of values of the functional attributes excluding combinations that are restricted by the set of restrictions, whereby the BDD symbolically represents the Cartesian cross-product test-space. The method may further comprise analyzing the Cartesian cross-product test-space by manipulating the BDD so as to assist in performing dynamic verification of the SUT. | 2012-12-20 |
20120324415 | System Comprising Development Environments And Machine Controls - The invention relates to a system having one or more development environments ( | 2012-12-20 |
20120324416 | PATTERN ANALYSIS AND PERFORMANCE ACCOUNTING - A performance accounting framework may be provided. Upon receiving a section of source code associated with an application, an evaluation may be performed on the section of source code. A performance metric may be calculated according to the at least one evaluation and a report of the calculated performance metric may be provided. | 2012-12-20 |
20120324417 | SYSTEMS AND METHODS FOR INCREMENTAL SOFTWARE DEVELOPMENT - Methods and systems for facilitating incremental software development are disclosed. For example, a method can include receiving a plurality of binary software libraries sufficient for building a software project. A request from a user to modify source code for at least one of the plurality of binary libraries is received, in response to receiving the request, the source code for the at least one of the plurality of binary libraries is retrieved. The source code for the at least one of the plurality of binary libraries is presented to the user. Modified source code for the at least one of the plurality of binary libraries is received. The modified source code is compiled to produce compiled modified code. A revised version of the software project is built using the compiled modified code and the plurality of binary libraries. | 2012-12-20 |
20120324418 | Software Application Framework Using Microsoft SharePoint - A software invention that utilizes Microsoft's SharePoint as a foundation upon which a web based software application framework is built that can be used as a tool to quickly and easily create unique user applications with reduced programming effort via web service consolidation. The framework is made up of software layers that provide a fast, easy and efficient platform to build and execute complete web applications and to improve the use of and add new functions to SharePoint itself. The framework provides methods to be used with Microsoft development tools like Visual Studio. The data interface layer (consists of SharePoint Lists, Libraries, Tasks, Contacts, etc. with links and metadata) and is used as the data repository (database) for the framework resulting in a unique database layer in which SharePoint can be used to view and modify user application data making it uniquely simplified and easier to access than normal application database technology like transact SQL. | 2012-12-20 |
20120324419 | MULTI-TENANT COLLABORATIVE REVIEW SERVICE - A multi-tenant collaborative review service that facilitates collaborative review of a review target artifact set. The service is multi-tenant in that it provides common functions and infrastructure that are available across multiple tenants supported by the review service. Furthermore, the review service is extensible in that it provides an extensibility point into which tenant-specific functions may be incorporated into the review service. For each one or more of the tenants, the corresponding review target artifact set is distributed such that a tenant-accessible subset of the artifact set is maintained uniquely accessible by the corresponding tenant, and such that a centralized service subset of the review target artifact set is maintained remote from the corresponding tenant. | 2012-12-20 |
20120324420 | PROCESS FOR DEVELOPMENT OF MONITORING TOOLS - A process for creation of an equipment health monitoring (EHM) tool, including defining functional requirements for a proposed EHM tool in a structured hierarchical format. The functional requirements definition is used to generate an outline model for a plurality of functions of the proposed EHM tool according to a model template, wherein the outline model is captured as one or more graphical representations. Each graphical representation includes at least one component representative of a defined EHM functional requirement. Source code for the proposed EHM tool is automatically generated based upon the graphically represented model and then compiled to create a deployable EHM tool from the source code by applying a compilation strategy dependent on an intended mode of operation for said EHM tool. An EHM generation tool and associated data carrier are also recited. | 2012-12-20 |
20120324421 | APPLICATION CREATION TOOL TOOLKIT - Various embodiments of systems and methods for an application creation tool (ACT) toolkit are described herein. The ACT toolkit includes a set of application creation APIs and an application creation service for invoking the set of application creation API. An ACT is in communication with the application creation service of the ACT toolkit. The ACT sends an application creation request to the application creation service for creating a UI application. The ACT can be customized by re-defining the application creation service of the ACT toolkit and establishing a communication between the re-defined application creation service and the ACT. The re-defined application creation service invokes the set of API to create a customized application object for the UI application. | 2012-12-20 |
20120324422 | LIVE BROWSER TOOLING IN AN INTEGRATED DEVELOPMENT ENVIRONMENT - A selection in a browser can be mapped back to a corresponding location range in one or more source files that generated the selection. A selection in a source file can be mapped to the corresponding location range in the browser's DOM. The selection in the browser can be mapped to a location range in a block list generated from the DOM. The location range in the DOM's block list can be mapped to a corresponding location range in a block list generated from the fetched file received from a web server. The location range in the fetched file's block list can be mapped to a particular location in the particular source file responsible for generating the selection in the browser. The selection in the browser and the source file can be displayed concurrently, the source file scrolled to the location range corresponding to the selection in the browser. | 2012-12-20 |
20120324423 | NAVIGATION HISTORY VISUALIZATION IN INTEGRATED DEVELOPMENT ENVIRONMENT - An integrated development environment displays a diagram that indicates relationships between code elements navigated by a user. The diagram provides a visualization of the navigation history of the user to allow the user to understand the code structure and flow of a program. A navigation history engine extracts the navigation history, generates the diagram, and displays the diagram adjacent to code displayed by a code editor. | 2012-12-20 |
20120324424 | SOFTWARE ACCESSIBILITY TESTING - According to exemplary embodiments, method and systems for software accessibility testing are provided. Aspects of the exemplary embodiments include: obtaining accessibility information on content of a graphical user interface (GUI) of software under test, wherein accessibility information is content of the GUI for which describing text is available or content of the GUI which is accessible by keyboard use; determining content of the GUI which should not be available in a test due to a lack of accessibility information; restricting the GUI to restrict access to the content not available; and providing the restricted GUI to a user for testing. | 2012-12-20 |
20120324425 | AUTOMATIC CODE DECORATION FOR CODE REVIEW - The automated generation of code decoration for a body of code under review. Upon accessing the body of code, the system evaluates portions of the code for context. For at least some of those portions of code, the system identifies a decoration corresponding to that context, and adds the identified decoration to the body of code in a manner that the decoration is visually associated with the corresponding portion of the code. | 2012-12-20 |
20120324426 | SYSTEM AND METHOD TO IN-LINE SCRIPT DEPENDENCIES - Systems, methods and articles of manufacture to in-line script dependencies are discussed herein. An embodiment includes extracting test resources addressed in language defining a test web page, placing markers identifying the location of each extracted test resource within the language defining the test page, iteratively loading external resources associated with a path of each test resource, analyzing each test resource to identify one or more dynamically added dependencies, and replacing each marker with external resources and dependencies that reference their respective marker to generate updated language defining an updated test web page. The embodiment further includes adding each identified dependency after or before a top level parent resource, performing the analyzing and the adding until no new dependencies are identified and providing each new dependency with a reference to a parent marker associated with the top level parent resource. | 2012-12-20 |
20120324427 | STREAMLINED TESTING EXPERIENCE - Tests can be categorized as important with respect to ensuring software functions correctly as a function of one or more rules that define importance. The rules can be configurable to enable control of categorization. Further, tests categorized as important can be highlighted in some manner, for instance by displaying important tests in a group designated for such tests. | 2012-12-20 |
20120324428 | CONTENT DESIGN TOOL - Among other disclosed subject matter, a method includes providing a user interface allowing the insertion of elements into a document flow comprising static and dynamic elements, the user interface presenting a graphical depiction of the document that is dynamically altered by the insertion of the element, wherein the dynamically altered appearance of the document correctly reflects the position and type of the inserted element and rearranges all existing static and flow elements of the document around the inserted element. | 2012-12-20 |
20120324429 | Selectable Dual-Mode JIT Compiler for SIMD Instructions - A JIT (Just-In-Time) compiler performs dual-mode code generation by determining whether an application has opted-in to SIMD (Single Instruction Multiple Data) code generation both at JIT-time and at runtime. The application may select the code generation mode by identifying whether it has opted-in to SIMD code generation. As a result, the underlying implementation guarantees application compatibility by allowing the application to select the code generation mode. Additionally, applications have the ability to select into different code generation modes during concurrent execution. | 2012-12-20 |
20120324430 | ALIASING BUFFERS - The present invention extends to methods, systems, and computer program products for aliasing buffers. Embodiment of the inventions supporting buffer aliasing through introduction of a level of indirection between a source program's buffer accesses and the target executable physical buffers, and binding the logical buffer accesses to actual physical buffer accesses at runtime. A variety of techniques for can be used supporting runtime aliasing of buffers, in a system which otherwise disallows such runtime aliasing between separately defined buffers in the target executable code. Binding of logical buffer accesses in the source program to the actual physical buffers defined in the target executable code is delayed until runtime. | 2012-12-20 |
20120324431 | PATTERN-BASED COMPILATION OF ASYNCHRONOUS CONSUMPTION - The present invention extends to methods, systems, and computer program products for transforming source code to await execution of asynchronous operations. Embodiments of the invention simplify authoring and use of asynchronous methods, by generating statements that use well-defined awaitable objects to await completion of asynchronous operations. For example, a computer system can transform a statement that requests to await the completion of an asynchronous operation into a plurality of statements that use a predefined pattern of members of an awaitable object corresponding the asynchronous operation. The pattern can include one or more members configured to return a completion status of the asynchronous operation, one or more members configured to resume execution of the asynchronous method at a resumption point when the asynchronous operation completes, and one or more members configured to retrieve completion results. Accordingly, the plurality of statements can use these members to await execution of the asynchronous operation. | 2012-12-20 |
20120324432 | SYSTEMS AND METHODS TO AUTOMATICALLY GENERATE CLASSES FROM API SOURCE CODE - According to some embodiments, Application Programming Interface (API) source code, including command design patterns, is determined to be executed as a runtime scenario. Class may then be automatically generated as linkable building blocks in accordance with the API source code and command design patterns. For example, API command classes and associated methods may be dynamically read using reflection, and a building block class associated with each API command class may be generated. Runtime readable embedded metadata may be planted in the building block classes, at least some of the metadata being provided by the reflection. According to some embodiments, a logical sequence of the building blocks classes may be linked in accordance with the runtime scenario. | 2012-12-20 |
20120324433 | METHOD AND ARRANGEMENT FOR RE-LOADING A CLASS - The method is for deploying an input class in a computer readable memory. A state class is created that has at least one field and at least one proxy method and a behavior class version that includes at least one method on the basis of the input class. At least one method call of the state class is redirected to the behavior class version. Also, an arrangement and a computer-software are disclosed. | 2012-12-20 |
20120324434 | CONTEXT AWARE APPLICATION MODEL FOR CONNECTED DEVICES - An application management system is described herein that uses context information based on what the user is currently doing and what platform the user is using to determine which applications to offer to a user and to affect behavior of applications that the user invokes. The system provides a hardware/software driven policy manager coupled with context data in an application manifest to provide for device- and situation-specific application modes. Such a model leverages device-specific dynamics to create context aware installation, cataloging, management, interaction, and uninstallation of applications, hence providing better user engagement and experience. Thus, the application management system makes it easier for users to find relevant applications, configures applications to work well on the user's present device, and makes application experiences more relevant to what the user is currently doing. | 2012-12-20 |
20120324435 | SYSTEMS AND METHODS FOR INCREMENTAL SOFTWARE DEPLOYMENT - Methods and systems for facilitating incremental software deployment are disclosed. For example, a method can include receiving a command to deploy a second version of software to a computing system for execution on the computing system in response to the command, differences between the second version of the software and a first version of the software being executed on the computing system are determined. Code changes to be made to the first version of the software to produce the second version of the software are determined based on the differences. The code changes to be made to the first version of the software are transmitted to the computing system. | 2012-12-20 |
20120324436 | METHOD OF UPDATING VERSIONED SOFTWARE USING A SHARED CACHE - The present invention relates to the replacement of an existing version of versioned software with a new version of versioned software using a shared cache, in which the software is versioned and each version of the software has an associated area within the shared cache for storing data, including at least software identification and version information. In a first step of a data store change process a new version data store is created, having a new version data store schema, containing data derived from the data in the existing version data store at an initial point at the start of a data migration phase. In a second step of the data store change process change, information stored by the existing version software in the shared cache and relating to changes to the existing version data store made by the existing version software during the step of creating the new version data store, is converted to replay information relating to corresponding changes to the new version data store. In a third step of the data store change process the new version data store is updated using the replay information during a replay phase of the data store change process. | 2012-12-20 |
20120324437 | SERVICE PROVIDING APPARATUS AND SERVER PROVIDING METHOD - In service providing apparatus and method, system identification data for specifying a service target device and the user of the device concerned are issued to the device concerned, and authentication processing is carried out on the basis of the system identification data to provide a service to the device concerned. | 2012-12-20 |
20120324438 | METHODS AND SYSTEMS FOR GENERATING READ-ONLY OPERATING SYSTEMS - Methods and systems for use in generating read-only production operating systems including at least one application for use with a target workstation are disclosed. One example method includes providing a baseline operating system based on a hardware profile of the target workstation, executing an installation script for a target application, adding at least one resource to the baseline operating system based on an error message indicating at least one resource called by the installation script is not found, and writing, at a computing device, a production operating system to a read-only media. The production operating includes the baseline operating system and the at least one resource. | 2012-12-20 |
20120324439 | CONFIGURATION INFORMATION MANAGEMENT METHOD AND CONFIGURATION INFORMATION MANAGEMENT DEVICE - A configuration information management method includes: installing, by a computer, a first application based on an instruction for installation of the first application including first identification information; determining whether or not related identification information relating to the first identification information is stored in a first file for storing information of the first application in the installation; holding the related identification information stored in the first file when the related identification information is stored; and registering, in the first file, the first identification information as identification information for the first application when the related identification information is not stored. | 2012-12-20 |
20120324440 | CLOUD BASED MANAGEMENT OF AN IN-STORE DEVICE EXPERIENCE - The technology allows a user's demo experience to be set up and maintained remotely. Retailers and vendors may remotely manage and update the user experience on demonstration devices. A package of applications that highlight a particular device's capabilities can be selected and installed on demo versions of the particular device in stores all across the country. Usage information from the demonstration devices may be collected. With the collected information, retailers can ascertain user interest in particular devices and applications. Further, the user experience may be maintained and reset to default settings on a regular basis. Automatically resetting the experience maintains a consistent retail experience. | 2012-12-20 |
20120324441 | DECENTRALIZED MANAGEMENT OF VIRTUALIZED HOSTS - One or more embodiments of the present invention provide a technique for effectively managing virtualized computing systems with an unlimited number of hardware resources. Host systems included in a virtualized computer system are organized into a scalable, peer-to-peer (P2P) network in which host systems arrange themselves into a network overlay to communicate with one another. The network overlay enables the host systems to perform a variety of operations, which include dividing computing resources of the host systems among a plurality of virtual machines (VMs), load balancing VMs across the host systems, and performing an initial placement of a VM in one of the host systems. | 2012-12-20 |
20120324442 | System and Method for an In-Server Virtual Switch - In accordance with an embodiment, a data processing system includes a processor, a memory, and an interface port configured to be coupled to a hardware network interface device. The processor is configured to run a process that maps network switching functions of each of a plurality of virtual machines to the hardware network interface device. | 2012-12-20 |
20120324443 | REDUCING DATA TRANSFER OVERHEAD DURING LIVE MIGRATION OF A VIRTUAL MACHINE - A computer-implemented method is provided for reducing network traffic associated with live migration. The method comprises selecting a virtual machine on a first physical host for migration to a second physical host, and providing each application running in the selected virtual machine with notification that the migration has started. In response to receiving the notification that the migration has started, each application reducing the number of memory pages in use during the migration. The selected virtual machine and each application is then migrated from the first physical host to the second physical host, wherein the migration of each application includes migration of the reduced number of memory pages. Non-limiting examples of methods that may be used to reduce the number of memory pages includes identifying memory that contains garbage, reducing the size of the heap, increasing the pause time used for garbage collection, deferring just-in-time compilation of hot methods, and releasing caches and buffers. | 2012-12-20 |
20120324444 | DECENTRALIZED MANAGEMENT OF VIRTUALIZED HOSTS - One or more embodiments of the present invention provide a technique for effectively managing virtualized computing systems with an unlimited number of hardware resources. Host systems included in a virtualized computer system are organized into a scalable, peer-to-peer (P2P) network in which host systems arrange themselves into a network overlay to communicate with one another. The network overlay enables the host systems to perform a variety of operations, which include dividing computing resources of the host systems among a plurality of virtual machines (VMs), load balancing VMs across the host systems, and performing an initial placement of a VM in one of the host systems. | 2012-12-20 |
20120324445 | IDENTIFICATION OF OVER-CONSTRAINED VIRTUAL MACHINES - A method for virtual machine management that includes establishing a first virtual machine on a hardware platform, performing a selected task on the first virtual machine and recording a first data set indicating a characteristic of the first virtual machine performing the selected task. The method also includes establishing a second virtual machine on the hardware platform, performing the selected task on the first and second virtual machines, recording a second data set indicating the characteristic of the first and second virtual machines performing the selected task and indicating acceptable data and unacceptable data within the first and second data sets. The method also includes creating and training a decision tree based on the acceptable and unacceptable data from the first and second data sets and inputting a third data set from a third virtual machine into the decision tree to determine if the third virtual machine is over-constrained. | 2012-12-20 |
20120324446 | VIRTUAL MACHINE IMAGE COMPOSITION AND SIGNING - Techniques are described for composing virtual machine images, generating signatures thereof, and verifying virtual machine images. A virtual machine image may be generated by installing or inserting software to a base virtual machine image. A signature may be computed using hash values of blocks of the base virtual machine image; blocks of the base image that are unchanged need not be hashed to generate the signature. A copy of the new virtual machine image can be verified at a computer hosting virtual machines by computing hashes only for modified or new blocks (relative to the base image). Block verification can take place in the background when a virtual machine starts; all of the blocks are verified (hashed and compared) in some order, and at the same time, unverified blocks are verified on demand as needed by the virtual machine. | 2012-12-20 |
20120324447 | SOFTWARE VIRTUAL MACHINE FOR ACCELERATION OF TRANSACTIONAL DATA PROCESSING - In general, this disclosure is directed to a software virtual machine that provides high-performance transactional data acceleration optimized for multi-core computing platforms. The virtual machine utilizes an underlying parallelization engine that seeks to maximize the efficiencies of multi-core computing platforms to provide a highly scalable, high performance (lowest latency), virtual machine. In some embodiments, the virtual machine may be viewed as an in-memory virtual machine with an ability in its operational state to self organize and self seek, in real time, available memory work boundaries to automatically optimize maximum available throughput for data processing acceleration and content delivery of massive amounts of data. | 2012-12-20 |
20120324448 | SOFTWARE VIRTUAL MACHINE FOR CONTENT DELIVERY - In general, this disclosure is directed to a software virtual machine that provides high-performance transactional data acceleration optimized for multi-core computing platforms. The virtual machine utilizes an underlying parallelization engine that seeks to maximize the efficiencies of multi-core computing platforms to provide a highly scalable, high performance (lowest latency), virtual machine. In some embodiments, the virtual machine may be viewed as an in-memory virtual machine with an ability in its operational state to self organize and self seek, in real time, available memory work boundaries to automatically optimize maximum available throughput for data processing acceleration and content delivery of massive amounts of data. | 2012-12-20 |
20120324449 | SOFTWARE VIRTUAL MACHINE FOR DATA INGESTION - In general, this disclosure is directed to a software virtual machine that provides high-performance transactional data acceleration optimized for multi-core computing platforms. The virtual machine utilizes an underlying parallelization engine that seeks to maximize the efficiencies of multi-core computing platforms to provide a highly scalable, high performance (lowest latency), virtual machine. In some embodiments, the virtual machine may be viewed as an in-memory virtual machine with an ability in its operational state to self organize and self seek, in real time, available memory work boundaries to automatically optimize maximum available throughput for data processing acceleration and content delivery of massive amounts of data. | 2012-12-20 |
20120324450 | COMPUTER SYSTEM, VIRTUAL COMPUTER SYSTEM, COMPUTER ACTIVATION MANAGEMENT METHOD AND VIRTUAL COMPUTER ACTIVATION MANAGEMENT METHOD - A virtualization mechanism in a first computer of the plurality of computers generates at least one virtual computer on the first computer. The virtualization mechanism in the first computer executes at least one of a first judgment and a second judgment when a request for activating a first virtual computer of the at least one virtual computer is received, the first judgment being for judging whether or not the activation of the first virtual computer is prohibited based on first information stored in a memory of the virtualization mechanism, and the second judgment being for judging whether or not an identifier included in a logic I/O adapter device assigned to the first virtual computer is invalid based on second information stored in the memory of the virtualization mechanism. The activation of the first virtual computer is permitted or prohibited based on the executed judgment. | 2012-12-20 |
20120324451 | VIRTUALIZATION PLANNING SYSTEM - The embodiments related to systems and methods for virtualization planning. A set of target machines may employ one or more virtualization technologies to divide resources of the given target computer system into multiple execution environments for virtual machines. Overhead profiles are determined based on a configuration of a given target computer system, the virtualization technology, and work performed by the virtual machines. The overhead consumed by the virtualization technologies is estimated for the proposed allocation of virtual machines. Performance of the proposed allocation of virtual machines is then modeled and various performance measures are provided. | 2012-12-20 |
20120324452 | HIGH AVAILABILITY SYSTEM AND EXECUTION STATE CONTROL METHOD - A high availability system includes a first computer on which a first virtual computer and a first hypervisor managing the first virtual computer operate, and a second computer on which a second virtual computer and a second hypervisor managing the second virtual computer operate. The first hypervisor includes an acquisition unit which acquires synchronization information associated with an event, wherein the event has occurred in the first virtual computer and accompanies an input to the first virtual computer, and a transmission unit which transmits the acquired synchronization information to the second hypervisor. The second hypervisor includes a reception unit which receives the synchronization information from the first hypervisor, and a control unit which performs control to match an input to the second virtual computer with an input to the first virtual computer in accordance with the received synchronization information. | 2012-12-20 |
20120324453 | EFFICIENT LOGICAL MERGING OVER PHYSICALLY DIVERGENT STREAMS - A logical merge module is described herein for producing an output stream which is logically compatible with two or more physically divergent input streams. Representative applications of the logical merge module are also set forth herein. | 2012-12-20 |
20120324454 | Control Flow Graph Driven Operating System - An operating system may be reconfigured during execution by adding new components to a control flow graph defining a system's executable flow. The operating system may use a control flow graph that defines executable elements and relationships between those elements. The operating system may traverse the control flow graph during execution to monitor execution flow and prepare executable elements for processing. By placing new components in memory then modifying the control flow graph, the operating system functionality may be updated or changed. In some embodiments, a lightweight version of an operating system may be deployed, then additional features or capabilities may be added. | 2012-12-20 |
20120324455 | MONAD BASED CLOUD COMPUTING - Systems and methods are provided for using monads to facilitate complex computation tasks in a cloud computing environment. In particular, monads can be employed to facilitate creation and execution of data mining jobs for large data sets. Monads can allow for improved error handling for complex computation tasks. Monads can also facilitate identification of opportunities for improving the efficiency of complex computations. | 2012-12-20 |
20120324456 | MANAGING NODES IN A HIGH-PERFORMANCE COMPUTING SYSTEM USING A NODE REGISTRAR - A method of managing nodes in a high-performance computing (HPC) system, which includes a management subsystem and a job scheduler subsystem, includes providing a node registrar subsystem. Logical node management functions are performed with the node registrar subsystem. Other management functions are performed with the management subsystem using the node registrar subsystem. Job scheduling functions are performed with the job scheduler subsystem using the node registrar subsystem. | 2012-12-20 |
20120324457 | USING COMPILER-GENERATED TASKS TO REPRESENT PROGRAMMING ELEMENTS - The present invention extends to methods, systems, and computer program products for representing various programming elements with compiler-generated tasks. Embodiments of the invention enable access to the future state of a method through a handle to a single and composable task object. For example, an asynchronous method is rewritten to generate and return a handle to an instance of a builder object, which represents one or more future states of the asynchronous method. Information about operation of the asynchronous method is then passed through the handle. Accordingly, state of the asynchronous method is trackable prior to and after completing. | 2012-12-20 |
20120324458 | SCHEDULING HETEROGENOUS COMPUTATION ON MULTITHREADED PROCESSORS - Aspects include computation systems that can identify computation instances that are not capable of being reentrant, or are not reentrant capable on a target architecture, or are non-reentrant as a result of having a memory conflict in a particular execution situation. A system can have a plurality of computation units, each with an independently schedulable SIMD vector. Computation instances can be defined by a program module, and a data element(s) that may be stored in a local cache for a particular computation unit. Each local cache does not maintain coherency controls for such data elements. During scheduling, a scheduler can maintain a list of running (or runnable) instances, and attempt to schedule new computation instances by determining whether any new computation instance conflicts with a running instance and responsively defer scheduling. Memory conflict checks can be conditioned on a flag or other indication of the potential for non-reentrancy. | 2012-12-20 |
20120324459 | PROCESSING HIERARCHICAL DATA IN A MAP-REDUCE FRAMEWORK - Methods and arrangements for processing hierarchical data in a map-reduce framework. Hierarchical data is accepted, and a map-reduce job is performed on the hierarchical data. This performing of a map-reduce job includes determining a cost of partitioning the data, determining a cost of redefining the job and thereupon selectively performing at least one step taken from the group consisting of: partitioning the data and redefining the job. | 2012-12-20 |
20120324460 | Thread Execution in a Computing Environment - A technique for executing normally interruptible threads of a process in a non-preemptive manner includes in response to a first entry associated with a first message for a first thread reaching a head of a run queue, receiving, by the first thread, a first wake-up signal. In response to receiving the wake-up signal, the first thread waits for a global lock. In response to the first thread receiving the global lock, the first thread retrieves the first message from an associated message queue and processes the retrieved first message. In response to completing the processing of the first message, the first thread transmits a second wake-up signal to a second thread whose associated entry is next in the run queue. Finally, following the transmitting of the second wake-up signal, the first thread releases the global lock. | 2012-12-20 |
20120324461 | Effective Management Of Blocked-Tasks In Preemptible Read-Copy Update - A technique for managing read-copy update readers that have been preempted while executing in a read-copy update read-side critical section. A single blocked-tasks list is used to track preempted reader tasks that are blocking an asynchronous grace period, preempted reader tasks that are blocking an expedited grace period, and preempted reader tasks that require priority boosting. In example embodiments, a first pointer may be used to segregate the blocked-tasks list into preempted reader tasks that are and are not blocking a current asynchronous grace period. A second pointer may be used to segregate the blocked-tasks list into preempted reader tasks that are and are not blocking an expedited grace period. A third pointer may be used to segregate the blocked-tasks list into preempted reader tasks that do and do not require priority boosting. | 2012-12-20 |
20120324462 | VIRTUAL FLOW PIPELINING PROCESSING ARCHITECTURE - A computer system for embodying a virtual flow pipeline programmable processing architecture for a plurality of wireless protocol applications is disclosed. The computer system includes a plurality of functional units for executing a plurality of tasks, a synchronous task queue and a plurality of asynchronous task queues for linking the plurality of tasks to be executed by the functional units in a priority order, and a virtual flow pipeline controller. The virtual flow pipeline controller includes a processing engine for processing a plurality of commands; a scheduler, communicatively coupled to the processing engine, for selecting a next task for processing at run time for each of the plurality of functional units; a processing engine controller, communicatively coupled to the processing engine, for providing commands and arguments to the processing engine and monitoring command completion; and a task flow manager, communicatively coupled to the processing engine controller, for activating the next task for processing. Also disclosed is a computer-implemented method for executing a plurality of wireless protocol applications embodying a virtual flow pipeline programmable processing architecture in a computer system. | 2012-12-20 |
20120324463 | System for Managing Data Collection Processes - A system and process for managing data collection processes is disclosed. An apparatus that incorporates teachings of the present disclosure can include, a data collection system having a controller element that assigns to each of the processes a query interval according to a priority level of the data collection process for requesting use of processing resources, receiving one or more requests from the processes, once per respective query interval, for use of at least a portion of available processing resources, releases at least a portion of the available processing resources to a requesting one of the processes when the use of the available processing resources exceeds a utilization threshold. Additional embodiments are disclosed. | 2012-12-20 |
20120324464 | PRODUCT-SPECIFIC SYSTEM RESOURCE ALLOCATION WITHIN A SINGLE OPERATING SYSTEM INSTANCE - Resource constraints for a group of individual application products to be configured for shared resource usage of at least one shared resource within a single operating system instance are analyzed by a resource allocation module. An individual resource allocation for each of the group of individual application products is determined based upon the analyzed resource constraints for the group of individual application products. The determined individual resource allocation for each of the group of individual application products is implemented within the single operating system instance using local inter-product message communication bindings by the single operating system instance. | 2012-12-20 |
20120324465 | WORK ITEM PROCESSING IN DISTRIBUTED APPLICATIONS - A system for organizing messages related to tasks in a distributed application is disclosed. The system includes a work-list creator to create a work list of the top-level work items to be accomplished in performing a task. Work-item processors are distributed in the system. The work-item processors process the top-level work item included in a task and also append additional work items to the work list. A work-list scheduler invokes the work-item processors so local work-item processors are invoked prior to remote work-item processors. | 2012-12-20 |
20120324466 | Scheduling Execution Requests to Allow Partial Results - The subject disclosure is directed towards scheduling requests using quality values that are defined for partial responses to the requests. For each request in a queue, an associated processing time is determined using a system load and/or the quality values. The associated processing time is less than or equal to a service demand, which represents an amount of time to produce a complete response. | 2012-12-20 |
20120324467 | COMPUTING JOB MANAGEMENT BASED ON PRIORITY AND QUOTA - In one embodiment, the invention provides a method of managing a computing job based on a job priority and a submitter quota, the method including determining whether a declared priority of a computing job exceeds a predetermined declared priority quota of a submitter; in the case that the declared priority of the computing job exceeds the predetermined declared priority of the submitter, substituting a reduced priority for the declared priority of the computing job; determining whether the reduced priority of the computing job exceeds a predetermined reduced priority quota for the submitter; and in the case that the reduced priority of the computing job does not exceed the predetermined reduced priority quota of the submitter, assigning the computing job to at least one computer resource at the reduced priority. | 2012-12-20 |
20120324468 | PRODUCT-SPECIFIC SYSTEM RESOURCE ALLOCATION WITHIN A SINGLE OPERATING SYSTEM INSTANCE - Resource constraints for a group of individual application products to be configured for shared resource usage of at least one shared resource within a single operating system instance are analyzed by a resource allocation module. An individual resource allocation for each of the group of individual application products is determined based upon the analyzed resource constraints for the group of individual application products. The determined individual resource allocation for each of the group of individual application products is implemented within the single operating system instance using local inter-product message communication bindings by the single operating system instance. | 2012-12-20 |
20120324469 | RESOURCE ALLOCATION APPARATUS, RESOURCE ALLOCATION METHOD, AND COMPUTER READABLE MEDIUM - A parameter determination unit | 2012-12-20 |
20120324470 | SYSTEM AND METHOD FOR DYNAMIC RESCHEDULING OF MULTIPLE VARYING RESOURCES WITH USER SOCIAL MAPPING - A system and method for scheduling resources includes a memory storage device having a resource data structure stored therein which is configured to store a collection of available resources, time slots for employing the resources, dependencies between the available resources and social map information. A processing system is configured to set up a communication channel between users, between a resource owner and a user or between resource owners to schedule users in the time slots for the available resources. The processing system employs social mapping information of the users or owners to assist in filtering the users and owners and initiating negotiations for the available resources. | 2012-12-20 |
20120324471 | CONTROL DEVICE, MANAGEMENT DEVICE, DATA PROCESSING METHOD OF CONTROL DEVICE, AND PROGRAM - A virtual server for measuring performance ( | 2012-12-20 |
20120324472 | TRANSACTIONAL COMPUTATION ON CLUSTERS - Computations are performed on shared datasets in a distributed computing cluster using aggressive speculation and a distributed runtime that executes code transactionally. Speculative transactions are conducted with currently available data on the assumption that no dependencies exist that will render the input data invalid. For those specific instances where this assumption is found to be incorrect—that the input data did indeed have a dependency (thereby impacting the correctness of the speculated transaction)—the speculated transaction is aborted and its results (and all transactions that relied on its results) are rolled-back accordingly for re-computation using updated input data. In operation, shared state data is read and written using only the system's data access API which ensures that computations can be rolled-back when conflicts stemming from later-determined dependencies are detected. | 2012-12-20 |
20120324473 | Effective Management Of Blocked-Tasks In Preemptible Read-Copy Update - A technique for managing read-copy update readers that have been preempted while executing in a read-copy update read-side critical section. A single blocked-tasks list is used to track preempted reader tasks that are blocking an asynchronous grace period, preempted reader tasks that are blocking an expedited grace period, and preempted reader tasks that require priority boosting. In example embodiments, a first pointer may be used to segregate the blocked-tasks list into preempted reader tasks that are and are not blocking a current asynchronous grace period. A second pointer may be used to segregate the blocked-tasks list into preempted reader tasks that are and are not blocking an expedited grace period. A third pointer may be used to segregate the blocked-tasks list into preempted reader tasks that do and do not require priority boosting. | 2012-12-20 |
20120324474 | INTERFACING BETWEEN A CALLER APPLICATION AND A SERVICE MODULE - A method and associated system for interfacing between a caller application and a service module. Upon receiving a request for performing a transaction that includes at least one caller application attribute describing the request, the service module builds a service module data structure pursuant to the received request. The service module data structure includes a generic service document and at least one service module attribute. Each service module attribute is stored in a relational table of the service module data structure, which includes. The request is serviced within the service module data structure, resulting in instantiating the generic service document. The generic service document is returned to the caller application. Storing each service module attribute in the relational table includes: determining a category and a level of a first service module attribute; and storing in the relational table a first container pursuant to the category and the level. | 2012-12-20 |
20120324475 | INTERFACING BETWEEN A CALLER APPLICATION AND A SERVICE MODULE - A method and associated system for interfacing between a caller application and a service module. Upon receiving a request for performing a transaction that includes at least one caller application attribute describing the request, the service module builds a service module data structure pursuant to the received request. The service module data structure includes a generic service document and at least one service module attribute. Each service module attribute is stored in a relational table of the service module data structure, which includes. The request is serviced within the service module data structure, resulting in instantiating the generic service document. The generic service document is returned to the caller application. Servicing the request includes: servicing comprising: performing the transaction; reloading containers from the relational table into respective containers of the generic service document; and returning the generic service document to the caller application. | 2012-12-20 |
20120324476 | PASTING DATA - A method of pasting data from a source application to a destination application, where the source and destination applications are not the same; the method comprising the steps of: identifying a data type for the data and an appropriate input handler for the data type; converting the data using the appropriate input handle to a standard format based on the data type; in an output module determining the context of the data in the standard format to identify an appropriate output handler; obtaining a suggested paste operation from a suggestion engine based on the type and context of the data; and instructing a paste operation on the basis of the suggested paste operation. | 2012-12-20 |
20120324477 | INFORMATION PROCESSING APPARATUS, EXECUTION METHOD, AND OBJECT PROGRAM - There is provided an information processing apparatus including a message storage unit for storing a message sent to a component, and an execution processing unit for loading the component body into a computer in response to receiving an execution instruction on the component to execute the component body and process the message stored in the message storage unit prior to the execution instruction. | 2012-12-20 |
20120324478 | Applying Timed Operations to Non-Timed Functions - For applying timed operations to non-timed functions, a computer causes the computer to discover, by parsing source code, a caller calling a function. The function does not perform timed operations. The computer further encapsulates the function in a timed method adapter and calls the timed method adapter in place of the function from the caller, passing the timed method adapter an object and an argument for the function. The computer further calls an invoke thread from the set invoker and returns from the set invoker to the timed method adapter. The computer waits for an execution result from the function at the timed method adapter, monitoring for an expiration of a timeout, and invokes the function from the invoke thread, passing the function the object and the argument. | 2012-12-20 |
20120324479 | OBJECT MARSHALING - Object marshaling techniques in a marshaling system for computer networks are disclosed. A gesture is provided to the object marshaling system that a reference object has expired on a sender side and a target side when the reference object is closed. Parent and child relationships are recognized in a descendent reference object to the reference object. The descendent reference object closes when the reference object closes. | 2012-12-20 |
20120324480 | EFFICIENT SERIALIZATION OF MUTABLE OBJECTS - A method of serialization in a data processing system includes serializing a mutable object utilizing a full serialization process, caching primitive data and metadata regarding the mutable object in binary format in cache and then checking whether primitive fields of the mutable object are modified. Thereafter, the mutable object is again serialized utilizing an abbreviated serialization process by reference to the cached primitive data and metadata if the primitive fields of the object are not modified. In the event that primitive fields of the object are modified, the full serialization process is utilized. Thereafter, the serialized mutable object is communicated to a distributed code element. | 2012-12-20 |
20120324481 | ADAPTIVE TERMINATION AND PRE-LAUNCHING POLICY FOR IMPROVING APPLICATION STARTUP TIME - A method and device for adaptively determining processes to kill when a low memory situation is detected, and for adaptively determining processes to pre-launch, are disclosed. The method for determining processes to kill includes tracking statistics of application launching behaviors, predicting application behaviors under certain system states in accordance with the tracked statistics, detecting a certain system state, and, if the certain system state is detected, adaptively selecting an application loaded in a cache memory to kill in accordance with the predicted behaviors. The method of determining processes to pre-launch includes tracking statistics of application launching behaviors, predicting application behaviors under certain system states in accordance with the tracked statistics, detecting a certain system state, and, if the certain system state is detected, adaptively selecting and pre-launching an application by loading the selected application into cache memory in accordance with the predicted behaviors and the certain system state. | 2012-12-20 |
20120324482 | METHODS, APPARATUSES AND COMPUTER PROGRAM PRODUCTS FOR PROVISIONING APPLICATIONS TO IN VEHICLE INFOTAINMENT SYSTEMS WITH SECURED ACCESS - An apparatus for providing one or more applications to an IVI client device(s) may include a processor and memory storing executable computer code causing the apparatus to at least perform operations including providing an application(s) and associated data to a device in response to receipt of an indication of a selection associated with the application(s). The computer program code may further cause the apparatus to enable the application(s) to access requested data via a plurality of application programming interfaces during execution of the application. The computer program code may further cause the apparatus to provide the requested data to the application in response to receipt of a message(s) generated by a first application programming interface of the interfaces that received a request for the requested data from a second application programming interface of the interfaces. Corresponding methods and computer program products are also provided. | 2012-12-20 |
20120324483 | REMOTE PROCEDURE CALL (RPC) BIND SERVICE WITH PHYSICAL INTERFACE QUERY AND SELECTION - A service module that provides for discovery of one or more network interfaces connecting a prospective remote procedure call (RPC) client, facilitates the provision of RPC programs in a network including multi-horned systems. When a request for a network address to an RPC application providing an RPC program is received from the RPC client, the RPC bind daemon discovers from the module, using the client response address, over which interface(s) the client is accessible. The daemon then selects an address of a network path to the RPC application that the prospective client can access and returns the corresponding network address. The service module monitors the network stack for RPC get address requests and builds tables of client address entries with corresponding network interface identifiers. The entries are retired according to an aging policy. | 2012-12-20 |
20120324484 | Dynamic Loading of Kernel Extensions - An approach is provided in preparing a dynamically loaded kernel extension. The approach includes compiling a kernel extension program that includes a symbol, such as a function. The symbol is exported from the kernel extension program and a symbol broker that references the exported symbol is compiled. A kernel extension loader library is created with a defined callable symbol that corresponds to the exported symbol. The kernel extension loader library is linked by an external program after compilation of the external program resulting in a compiled external program. The kernel extension loader library dynamically loads the compiled kernel extension program, the compiled symbol broker, and the exported symbol when the defined callable symbol is referenced by during execution of the compiled external program. | 2012-12-20 |
20120324485 | OPTICAL DISK DRIVE - An optical disk drive includes a housing, a tray, a detecting switch, a slide actuating member, and a restricting structure. The tray is received in the housing for carrying a disk and is slidable relative to the housing to interchange between a closed position and an open position. The detecting switch is disposed in the housing for being actuated and detecting the position of the tray. The slide actuating member slidably engages with the housing and is capable of actuating the detecting switch under the drive of the tray. The restricting structure is disposed between the tray and the slide actuating member for restricting the slide actuating member from disengaging from the tray after the detecting switch is actuated. | 2012-12-20 |
20120324486 | OPTICAL DISC DEVICE - An optical disc device comprises a disc clamper. The disc clamper is provided with: a first member provided with a first circular disc, and with a plurality of upstanding pieces formed with predetermined spaces therebetween along a circle concentric to the first circular disc, the upstanding pieces having an engaging claw at the distal end thereof; and a second member provided with a second circular disc in which are formed a plurality of through-holes into which the plurality of upstanding pieces are inserted, and with a plurality of peripheral walls formed with predetermined spaces therebetween along a circle concentric to the second circular disc. Rotation in a state where the upstanding pieces have been inserted into the through-holes through the spaces between the peripheral walls causes the engaging claws to engage the peripheral walls. | 2012-12-20 |
20120324487 | OPTICAL DISC AND OPTICAL DISC DEVICE - In a multilayer optical disc having information layers conforming to a plurality of different optical disc standards, because the type of each information layer is not recorded in the other information layers, every time the information layer being accessed changes, it has been necessary to read the type of the information layer and select a method of generating a tracking error signal adapted to the type of information layer, so access has taken time. In order to solve the above problem, in the optical multilayer disc according to the present invention, having information layers conforming to a plurality of different optical disc standards, in an area in one of the information layers, information about the other information layers is recorded. The time required to access the other information layers can be reduced by using this information to select a tracking error signal generating method. | 2012-12-20 |
20120324488 | Configuration of Presentations of Selectable TV Services According to Usage - The present invention provides a method and system for accessing services in a television system. In one implementation, a DHCT presents a user a menu containing a plurality of selectable link representations corresponding to separate services or applications offered by the cable television system. The user navigates the menu with a remote device and selects a desired service by choosing the selectable link representation corresponding to the desired service or application. The DHCT receives the user input, translates the selectable link command into an executable call, and activates the service or application corresponding to the selected link representation from the menu chosen by the user. | 2012-12-20 |
20120324489 | Flexible Video-on-Demand Viewing Period - A flexible video-on-demand viewing period is varied depending on whether the customer has completed viewing the entire program, allowing the viewing period to be extended if the customer has not completed viewing the entire program. The approach better assures the customer that they will have the opportunity to complete viewing the entire program, compared to a fixed rental period, while assuring program copyright owners that the utility of the rental is limited, fundamentally as intended, preserving the future value of the asset. The approach also enables viewers to retain bookmarks as needed for content that is not naturally tied to a rental period, such as subscription video-on-demand, without unnecessarily enlarging their list of active rentals. | 2012-12-20 |
20120324490 | APPARATUS AND METHOD FOR PROVIDING ADAPTIVE MULTIMEDIA SERVICE - An apparatus and a method for providing an adaptive multimedia service in a mobile communication system are provided. The method of providing a multimedia service includes collecting user-preference-aware information, device-capability-aware information, and network-aware information, generating a packet according to a correlation among the user-preference-aware information, the device-capability-aware information, and the network-aware information, and providing a multimedia service according to the generated packet. | 2012-12-20 |
20120324491 | VIDEO HIGHLIGHT IDENTIFICATION BASED ON ENVIRONMENTAL SENSING - Embodiments related to identifying and displaying portions of video content taken from longer video content are disclosed. In one example embodiment, a portion of a video item is provided by receiving, for a video item, an emotional response profile for each viewer of a plurality of viewers, each emotional response profile comprising a temporal correlation of a particular viewer's emotional response to the video item when viewed by the particular viewer. The method further comprises selecting, using the emotional response profiles, a first portion of the video item judged to be more emotionally stimulating than a second portion of the video item, and sending the first portion of the video item to another computing device in response to a request for the first portion of the video item without sending the second portion of the video item. | 2012-12-20 |
20120324492 | VIDEO SELECTION BASED ON ENVIRONMENTAL SENSING - Embodiments related to providing video items to a plurality of viewers in a video viewing environment are provided. In one embodiment, the video item is provided by determining identities for each of the viewers from data received from video viewing environment sensors, obtaining the video item based on those identities, and sending the video item for display. | 2012-12-20 |
20120324493 | INTEREST-BASED VIDEO STREAMS - Embodiments related to delivering a video stream to a requesting viewer are disclosed. In one example embodiment, a video stream is delivered by receiving a request for the video stream from a requesting device, the request including the requesting viewer's identity, assembling a list of selected video content items for display to the requesting viewer, the selected video items being selected from a plurality of video items based on the identity of the requesting viewer and a viewing interest profile comprising the requesting viewer's viewing interests, and sending the video stream for display, the video stream including one or more of the selected video items. | 2012-12-20 |
20120324494 | SELECTION OF ADVERTISEMENTS VIA VIEWER FEEDBACK - Embodiments related to selecting advertisements for display to targeted viewers are disclosed. In one example embodiment, an advertisement is selected by, for each of a plurality of advertisements, aggregating a plurality of emotional response profiles from a corresponding plurality of prior viewers of the advertisement to form an aggregated emotional response profile for the advertisement, wherein each of the emotional response profiles comprises a temporal record of a prior viewer's emotional response to the advertisement. The method further includes identifying a group of potentially positively correlated viewers for the targeted viewer, filtering the aggregated emotional response profiles based on the group of potentially positively correlated viewers, selecting a particular advertisement from the plurality of advertisements based on a correlation of the filtered aggregated emotional response profiles, and sending the particular advertisement for display to the targeted viewer. | 2012-12-20 |
20120324495 | DETECTING AND DISTRIBUTING VIDEO CONTENT IDENTITIES - Embodiments related to distributing an identity of a video item being presented on a video presentation device within a video viewing environment to applications configured to obtain content related to the video item are disclosed. In one example embodiment, an identity is transmitted by determining an identity of the video item currently being presented on the video presentation device and responsive to a trigger, transmitting the identity of the video item to a receiving application while the video item is being presented on the video presentation device. | 2012-12-20 |
20120324496 | METHODS AND APPARATUS TO COUNT AUDIENCE MEMBERS - Methods and apparatus to count audience members are disclosed. An example method includes identifying a first audience member present at a first time, incrementing a stored first count of a number of times the first audience member is present during a day part corresponding to the first time, incrementing a stored tuning occasion count, identifying a second audience member present at a second time, incrementing a stored second count of a number of times the second audience member is present during the day part, incrementing the stored tuning occasion count, determining a probability that an unidentified audience member is the first audience member based on the first count, the second count, and the tuning occasion count, and counting the first audience member based on a comparison of the probability to a threshold. | 2012-12-20 |
20120324497 | CONTENT DISTRIBUTION SYSTEM AND METHOD FOR OPTIMIZING MULTIPLEXED TRANSPORT CHANNELS - A content distribution system includes a distribution center, a processor, a switch, and first and second multiplexers. The distribution center receives and applies program content on program channels. The processor identifies subsets of the program channels in response to a respective score associated with the program channels. The switch couples the distribution center to the multiplexers. The switch applies program channels to respective inputs of the first and second multiplexers in response to the processor. A method for optimizing a multiplexed transport channel includes the steps of identifying a set of program channels designated for distribution via the multiplexed transport channel, arranging the set of program channels in subsets, the program channels within a subset grouped in accordance with a viewing score, multiplexing the program channels of the subsets to a respective transport channel and applying the respective transport channels to a distribution medium for delivery to the destination. | 2012-12-20 |
20120324498 | METHOD AND APPARATUS FOR ANALYZING DISCUSSION REGARDING MEDIA PROGRAMS - A system that incorporates teachings of the present disclosure may include, for example, a device including a controller to detect a plurality of users engaging in a voice conference related to a presentation of a media program, convert speech dialog detected in the voice conference to textual dialog, detect from the textual dialog a behavioral profile of at least one of the plurality of users, and identify at least one of advertisement content and marketable media content based on the behavioral profile of the at least one user. Other embodiments are disclosed. | 2012-12-20 |
20120324499 | AUDIO BASED METHODS AND APPARATUS FOR DETECTING A CHANNEL CHANGE EVENT - Methods and apparatus for detecting a channel change event are disclosed. An example method identifying at least one of a first muted audio condition or a first transient audio condition in a second portion of a media signal having first, second, and third portions, the first portion occurring earlier in time than the second portion and the second portion occurring earlier in time than the third portion, and identifying, using a processor, a channel change event in response to: 1) identifying the at least one of the first muted audio condition or the first transient audio condition; 2) failing to identify a second muted audio condition or a second transient audio condition in the first and third portions of the media signal; and 3) determining that a time domain length of the second portion of the media signal is greater than a first threshold and less than a second threshold. | 2012-12-20 |
20120324500 | SYSTEM AND METHOD FOR PRESENTING INFORMATION ASSOCIATED WITH A MEDIA PROGRAM - A system that incorporates teachings of the present disclosure may include, for example, an apparatus having a processor adapted to receive a message from a portable communication device communicatively coupled to a set-top box presenting a media program and to retrieve from the message a media descriptor associated with the media program. The processor is further adapted to identify according to the media descriptor one or more images of one or more performers commonly presented in the media program, to monitor one or more frames of a live media feed including the media program, and compare the one or more human figures to the one or more images of performers. The processor can also be adapted to recognize a performer from the comparison, to retrieve information associated with the performer, and to transmit the information to the portable communication device. Other embodiments are disclosed. | 2012-12-20 |