| 18th week of 2012 patent applcation highlights part 80 |
| Patent application number | Title | Published |
|---|
| 20120110524 | METHODS, PHOTOMASKS AND METHODS OF FABRICATING PHOTOMASKS FOR IMPROVING DAMASCENE WIRE UNIFORMITY WITHOUT REDUCING PERFORMANCE - A method of improving damascene wire uniformity without reducing performance. The method includes simultaneously forming a multiplicity of damascene wires and a multiplicity metal dummy shapes in a dielectric layer of a wiring level of an integrated circuit chip, the metal dummy shapes dispersed between damascene wires of the multiplicity of damascene wires; and removing or modifying those metal dummy shapes of the multiplicity of metal dummy shapes within exclusion regions around selected damascene wires of the multiplicity of damascene wires. Also a method of fabricating a photomask and a photomask for use in improving damascene wire uniformity without reducing performance. | 2012-05-03 |
| 20120110525 | HYBRID ELECTRONIC DESIGN SYSTEM AND RECONFIGURABLE CONNECTION MATRIX THEREOF - A hybrid electronic design system and a reconfigurable connection matrix thereof are disclosed. The electronic design system includes a virtual unit, a hybrid unit and a communication channel. The virtual unit further includes a plurality of proxy units, a plurality of virtual components and a driver. The virtual components are connected with the driver via the proxy units. The hybrid unit further includes an emulate unit, a physical unit and a chip level transactor. The chip level transactor is connected with the emulate unit and the physical unit. The communication channel is connected with the driver of the virtual unit and the chip level transactor of the hybrid unit. | 2012-05-03 |
| 20120110526 | Method and Apparatus for Tracking Uncertain Signals - A method and an apparatus for tracking uncertain signals in the simulation of chip design are provided. The method comprises: generating a directed graph which contains sequential logic devices and IO devices from the netlist of chip design, wherein the directed graph illustrates the signal association among the sequential logic devices and IO devices; obtaining the signals related with the sequential logic devices and IO devices from the simulation results, wherein the signals contain a plurality of uncertain signals; and back tracing at least a part of the plurality of uncertain signals along the directed graph to determine the device which firstly generates an uncertain signal. The corresponding apparatus is also provided. With the above method and apparatus, uncertain signals can be traced and their source can be determined, which improves the debugging efficiency. | 2012-05-03 |
| 20120110527 | CONNECTION VERIFICATION METHOD, RECORDING MEDIUM THEREOF, AND CONNECTION VERIFICATION APPARATUS - A connection verification method is disclosed. A computer verifies a connection between a first node and a second node by starting from the first node in a designed integrated circuit, based on connection information stored in a storage part. The computer detects whether a module connected to the second node is a predetermined module predetermined module having a logic condition therein, based on connection relationship logic information stored in the storage part. The computer conducts a connection verification starting the module to verify a connection between the module and a third node when the module is the predetermined module. | 2012-05-03 |
| 20120110528 | METHOD OF PREDICTING ELECTRONIC CIRCUIT FLOATING GATES - Software method to identify which transistor gates float, and why, in complex, multi-transistor, electronic circuit designs. Transistor gates suspected of floating are analyzed by expanding backwards to build a logical tree representation of the previous predecessor circuit portions which drive that suspect gate. The method checks if the previous level of predecessor circuit node states earlier in the circuit show up more than once with different values, thus indicating by logical conflict that a particular floating suspect gate does not float. It then repeats this back-trace analysis for the next previous level of predecessor circuit portions, further seeking logical conflicts within the expanding logic tree. This is continued until either no predecessor circuit portion that can cause the suspect gate to float is found, or until a portion that does cause the suspect gate to float is found, in which case the suspect gate is identified as a probable floating gate. | 2012-05-03 |
| 20120110529 | CLOCK DOMAIN CROSSING BUFFER - Techniques are disclosed relating to detecting and minimizing timing problems created by clock domain crossing (CDC) in integrated circuits. In various embodiments, one or more timing parameters are associated with a path that crosses between clock domains in an integrated circuit, where the one or more timing parameters specify a propagation delay for the path. In one embodiment, the timing parameters may be distributed to different design stages using a configuration file. In some embodiments, the one or more parameters may be used in conjunction with an RTL model to simulate propagation of a data signal along the path. In some embodiments, the one or more parameters may be used in conjunction with a netlist to create a physical design for the integrated circuit, where the physical design includes a representation of the path that has the specified propagation delay. | 2012-05-03 |
| 20120110530 | COMPUTER SYSTEM AND METHOD OF PREPARING A LAYOUT - The present application discloses a method of preparing a layout for manufacturing an integrated circuit chip according to a circuit design. In at least one embodiment, a pattern for the layout based on the circuit design is generated. After the generation of the pattern, it is determined if at least one layout rule is violated in the layout, the at least one layout rule being specified according to a predetermined maximum value for at least one of an estimated voltage drop along a signal path in the layout or an estimated current density on the signal path. If the at least one layout rule is violated, a violation is indicated. | 2012-05-03 |
| 20120110531 | DEFECT AND YIELD PREDICTION FOR SEGMENTS OF AN INTEGRATED CIRCUIT - Defect prediction information is determined for a segment of an integrated circuit layout. Marker information is obtained, for example from user input into a computer design tool, where the marker information defines the segment. A segment can be defined to be any arbitrary portion of the layout and can include portions of multiple blocks. The marker information is used to extract layout information corresponding to the segment. The extracted segment layout information is analyzed to determine the defect prediction information. In one example, the determination involves performing a Critical Area Analysis such that the defect prediction information is a yield prediction value. This process is repeated for multiple segments, and the defect prediction information for the segments is compared to identify the segment most susceptible to defects. The user can modify the design of the segment, and repeat the process to improve yield in the manufacture of the integrated circuit. | 2012-05-03 |
| 20120110532 | LATCH CLUSTERING WITH PROXIMITY TO LOCAL CLOCK BUFFERS - A method, system, and computer usable program product for latch clustering with proximity to local clock buffers (LCBs) where an algorithm is used to cluster a plurality of latches into a first plurality of groups in an integrated circuit. A number of groups in the first plurality of groups of clustered latches is determined. A plurality of LCBs are added where a number of added LCBs is the same as the number of groups in the first plurality of groups. A cluster radius for a subset of the first plurality of groups of clustered latches is determined, a group in the subset having a cluster radius that is a maximum cluster radius in the subset. The plurality of latches are reclustered into a second plurality of groups responsive to the maximum cluster radius exceeding a radius threshold, the second plurality of groups exceeding the first plurality of groups by one. | 2012-05-03 |
| 20120110533 | IMPLEMENTING ENHANCED CLOCK TREE DISTRIBUTIONS TO DECOUPLE ACROSS N-LEVEL HIERARCHICAL ENTITIES - A method, system and computer program product for implementing enhanced clock tree distributions to decouple across N-level hierarchical entities of an integrated circuit chip. Local clock tree distributions are constructed. Top clock tree distributions are constructed. Then constructing and routing a top clock tree is provided. The local clock tree distributions and the top clock tree distributions are independently constructed, each using an equivalent local clock distribution of high performance buffers to balance the clock block regions. | 2012-05-03 |
| 20120110534 | Self-Propelling Decoupling Capacitor Design for Flexible Area Decoupling Capacitor Fill Design Flow - A method of filling dcaps in an integrated circuit includes identifying a set of dcap-eligible areas of the integrated circuit for areas large enough to accommodate at least one dcap cell having a selected size smaller than a default size. The dcap cell includes at least one built-in power track. A set of dcap cells are filled in the identified set of dcap-eligible areas. Each of the built-in power tracks included in the set of dcap cells is connected to a corresponding power grid. An integrated circuit including a power grid channel formed between at least two power grids and a plurality of dcaps including a first dcap included in a dcap cell, the dcap cell including built-in power tracks, each one of the built-in power tracks being connected to a corresponding one of the at least two power grids is also described. | 2012-05-03 |
| 20120110535 | INTEGRATED CIRCUIT MANUFACTURING METHOD AND SEMICONDUCTOR INTEGRATED CIRCUIT - In layout design step of the semiconductor integrated circuit manufacturing method, when it is found that the wiring length between an external terminal and an IO block (external terminal I/F circuit) corresponding to the external terminal increases after a floorplan of a circuit including a functional block and the IO block is determined, placement of the IO block is determined such that the IO block is placed close to the external terminal to alleviate constraints on the wiring between the IO block and the external terminal, and timing adjustment circuits whose number is determined according to the wiring length of a bus (or a shared bus) connecting a data transfer circuit and the IO block is inserted into the bus. | 2012-05-03 |
| 20120110536 | STATISTICAL METHOD FOR HIERARCHICALLY ROUTING LAYOUT UTILIZING FLAT ROUTE INFORMATION - An integrated circuit design is routed by first creating temporary routes in a flattened layout, generating blockage information for sub-blocks in the layout based on the temporary routes, and establishing a routing order for cells using a depth-first search. Cells in the original layout are then routed according to the routing order using the blockage information. The temporary routes are sorted into internal routes, terminal routes, and spanning routes. Blockage information for each sub-block includes a first cellview equal to the internal routes, a second cellview equal to the terminal routes plus the spanning routes, and a third cellview equal to the total tracks in the sub-block minus the first and second cellviews. The invention is particularly suited for routing a hierarchical integrated circuit design. By examining the complete hierarchy, the invention ensures that enough metal will be remaining at upper level sub-blocks to complete the routing automatically. | 2012-05-03 |
| 20120110537 | METHODS AND SYSTEMS FOR FLEXIBLE AND REPEATABLE PRE-ROUTE GENERATION - Methods and systems for flexible and repeatable pre-route generation are described. In one embodiment, a routing selection is received. The routing selection is for a path between at least a first cell and a second cell. The first and second cell are associated with a functional description of an integrated circuit. A floorplan associated with the functional description is modified to create a modified floorplan. The modified floorplan has a physical design change relative to the floorplan. A pre-route is automatically generated based on receipt of the routing selection and the modified floorplan. The pre-route is added to a physical design of the chip to create a pre-routed physical design. Additional methods and systems are disclosed. | 2012-05-03 |
| 20120110538 | CLOCK-TREE STRUCTURE AND METHOD FOR SYNTHESIZING THE SAME - A method for synthesizing a clock-tree structure may be applied to a physical design such as an integrated circuit or a printed circuit board to form a symmetrical clock-tree structure, while achieving the effects including minimizing a clock skew, having a process variation tolerance and increasing the synthesizing rate. To prevent a certain level from having too many branches and ensure that the clock-tree structure satisfies the fan-out constraint, a plurality of pseudo sinks are provided such that the result of factorizing the value of the number of the total sinks may satisfy the fan-out constraint. The levels in the clock-tree structure may have equal branch lengths by employing snaking routing, so as to achieve a symmetrical clock-tree structure design and reduce the clock skew of the clock-tree. | 2012-05-03 |
| 20120110539 | Automatically Routing Nets with Variable Spacing - A technique will automatically route interconnect of an integrated circuit and adjust spacing between tracks or interconnect in order to improve performance or reduce electromigration effects. By increasing spacing between certain tracks or moving tracks, performance can improve because a track will be more noise immunity from nearby tracks on the same layer or on different layers. The automatic router will adjust spacing between tracks depending on one or more factors. These factors may include current associated with a track, width of a track, capacitance, inductance, and electromigration. In a specific implementation, the technique uses a shape-based approach where a grid is not used. The technique may further vary the width of the tracks. | 2012-05-03 |
| 20120110540 | METHOD OF OPTIMIZING PARAMETERS OF ELECTRONIC COMPONENTS ON PRINTED CIRCUIT BOARDS - In a method of optimizing parameters of electronic components on printed circuit boards (PCBs), a first experiment table for m variables of one type of parameter of P electronic components on a PCB is designed using n values of each variable and the RSM. P EHs of each first experiment are obtained by simulating, and P EH empirical formulas are computed according to the P EHs. A second experiment table for the m variables is designed using n′ values of each variable and the full factorial design, and P EHs of each second experiment are computed using the P EH empirical formulas. Experiments, all the P EHs of which are greater than 1, are filtered from the second experiment tables, and an average EH of each filtered experiment is computed to pick an experiment the average EH of which is the greatest. The values of the m variables in the picked experiment are considered as optimized. | 2012-05-03 |
| 20120110541 | CONSTRAINT OPTIMIZATION OF SUB-NET LEVEL ROUTING IN ASIC DESIGN - Functionality can be implemented for optimizing connection constraints in an integrated circuit design. A target timing path associated with a first of a plurality of sub-connections of the integrated circuit is determined. A timing probability value and a route probability value associated with the first of the plurality of sub-connections is determined based, at least in part, on the target timing path associated with the first of the plurality of sub-connections. The timing probability value indicates a probability that timing closure is satisfied on the target timing path. The route probability value indicates a probability that a physical routing track on the target timing path associated with the first of the plurality of sub-connections resolves congestion. A current connection constraint associated with the first of the plurality of sub-connections is modified in accordance with a connection constraint model to which the first of the plurality of sub-connections corresponds. | 2012-05-03 |
| 20120110542 | METHOD TO SCALE DOWN IC LAYOUT - A method scales down an integrated circuit layout structure without substantially jeopardizing electronic characteristics of devices. First, a conductive line set includes a first conductive line and a second conductive line respectively passing through a first region and a second region. Second, a sizing-down operation is performed so that the first conductive line and the second conductive line respectively have a first region scaled-down line width, a first region scaled-down space and a first region scaled-down pitch in the first region as well as selectively have a second region original line width, a second region scaled-down space and a second region scaled-down pitch in the second region. The first region scaled-down line width and the second region original line width are substantially different from each other. | 2012-05-03 |
| 20120110543 | Application Store System for Supporting Development of Application Interoperated with Unified Device and Method for Managing Application Store - Provided are an application store system for supporting development of an application interoperated with a unified device and a method for managing an application store in the application store system. The application store system may include an authority application processing unit to process a developer's authority application for a multiprotocol adapter system; a software development kit (SDK) distributing unit to distribute a SDK for the multiprotocol adapter system; an application registering unit to receive an application developed using the SDK, and to register and store the application; an application list providing unit to provide a list of registered and stored applications; and an application providing unit to provide the user with an application selected from the list. The SDK may include an application development tool for controlling a plurality of different kinds of devices by controlling the multiprotocol adapter system interoperated with the plurality of different kinds of devices. | 2012-05-03 |
| 20120110544 | SYSTEM AND METHOD FOR SOFTWARE DEVELOPMENT REPORT GENERATION - A computer implemented method includes extracting requirement data from a software development system, the requirement data defining a software development requirement during a predetermined period of time. The method further includes extracting from the software development system an indication of a state of software development at the beginning of the period of time, and an indication of a state of software development at the end of the period of time. The method further includes calculating a change in the state of software development during the period of time and generating a report that enables comparing the calculated change in the state of software development with the software development requirement. A computer readable medium product and a data processing system are also disclosed. | 2012-05-03 |
| 20120110545 | ABSTRACTING TRANSFORMATION FOR MODEL DRIVEN ARCHITECTURE - An example embodiment of the present invention provides a process for abstracting an implementation-independent model to an implementation-specific model during transformation in a MDA system. In the example embodiment, the MDA system comprises a transformation engine whose components might include software tools such as AndroMDA and Muse. The transformation engine accepts as input an implementation-independent model written in a modeling language such as UML that provides graphical notation to describe inheritable classes and their attributes and relationships. The transformation engine also accepts a configuration file which allows the designation of a class in the model as a manageable resource. From these inputs, the transformation engine creates a manageable resource corresponding to the class, which resource includes any subclasses by inheritance from the designated class unless the subclass is specifically excluded in the configuration file. In one embodiment, the manageable resources created by the transformation engine are WSMD manageable resources. | 2012-05-03 |
| 20120110546 | APPARATUS AND METHOD FOR GENERATING APPLICATIONS AUTOMATICALLY - Disclosed are an apparatus and method for generating applications. A plurality of source codes corresponding to functional modules of the applications are stored in the module storage unit | 2012-05-03 |
| 20120110547 | SYSTEM AND METHOD FOR A GENERIC OBJECT ACCESS LAYER - An object access interface is described that effectively decouples a functional layer from a user interface (UI) layer. In the context of pre-existing functional objects that are specifically tailored to a pre-existing UI, a single entry point access-interface may define generic and object-specific functions. The function may be used to collect input routed to the associated function object, compile an input set in a form similar to how the pre-existing UI provided input sets, and process the compiled input and any resulting outputs from the function object. | 2012-05-03 |
| 20120110548 | DATA TYPE PROVIDER FOR AN OPERATING SYSTEM INSTRUMENTATION STORE - A system and method for facilitating development of a computer program that interfaces with an operating system instrumentation store (OSIS). A system queries an OSIS to retrieve interface information, including schema information corresponding to a portion of data in the OSIS relevant to a user application. The system uses the retrieved information to provide an integrated development environment to a user. The IDE may include one or more features such as completion lists, tool tips, and quick info. The schema information may be used to create synthetic types for use in the target program. The interface information may be used to create synthetic elements to be inserted into a target program. The synthetic types may be used to perform static type checking during an editing session or a program compilation, or to provide the IDE services. During a build, the synthetic elements may be removed and replaced with OSIS access code, which is subsequently used during program runtime to access the store. The system enables a user to work with the OSIS as they would for built-in parts of their program. | 2012-05-03 |
| 20120110549 | Code Breakage Detection Using Source Code History Background - An illustrative embodiment of a computer-implemented process for detecting code breakage using source code change history receives a point in time within an identified range of time to form a selected time, receives a set of source files associated with the a selected time, receives a set of history files associated with the received set of source files and initializes a workspace in a sandbox using the set of source files and the set of history files. The computer-implemented process incrementally executes the received set of source files from the selected time forward, determines whether a code break occurs and responsive to a determination that the code break occurs, presents a list of files. The computer-implemented process receives an identified file from the list of files to form a suspect file, and receives a correction for the suspect file. | 2012-05-03 |
| 20120110550 | NODE COMPUTATION INITIALIZATION TECHNIQUE FOR EFFICIENT PARALLELIZATION OF SOFTWARE ANALYSIS IN A DISTRIBUTED COMPUTING ENVIRONMENT - A method for verifying software includes determining an initialization path condition of a received software verification job, determining a termination path condition of a computing node, and initializing the execution of the received software verification job on the computing node based on the initialization path condition and the termination path condition. The initialization path condition includes a sequence of program predicates for reaching a starting state of software to be verified. The received software verification job includes an indication of a portion of the software to be verified. The termination path condition includes an indication of the last state reached during the execution of a previous software verification job on the computing node. The computing node is assigned to execute the received software verification job. | 2012-05-03 |
| 20120110551 | SIMULATING BLACK BOX TEST RESULTS USING INFORMATION FROM WHITE BOX TESTING - Systems, methods are program products for simulating black box test results using information obtained from white box testing, including analyzing computer software (e.g., an application) to identify a potential vulnerability within the computer software application and a plurality of milestones associated with the potential vulnerability, where each of the milestones indicates a location within the computer software application, tracing a path from a first one of the milestones to an entry point into the computer software application, identifying an input to the entry point that would result in a control flow from the entry point and through each of the milestones, describing the potential vulnerability in a description indicating the entry point and the input, and presenting the description via a computer-controlled output medium. | 2012-05-03 |
| 20120110552 | PROTECTING BREAKPOINTS IN A SOFTWARE DEBUGGER - A debugger that includes a breakpoint protection mechanism that detects when the program being debugged has been modified to overwrite one or more instructions corresponding to existing breakpoints. When the debugger halts execution of a program being debugged, all of the set breakpoints are checked by determining whether the instruction corresponding to each breakpoint has changed. If any of the instructions corresponding to the breakpoints has changed, the corresponding breakpoint is removed. An optional warning may be provided to the user to inform the user of any removed breakpoints. | 2012-05-03 |
| 20120110553 | IMPLEMENTING A STEP-TYPE OPERATION DURING DEBUGGING OF CODE USING INTERNAL BREAKPOINTS - Debugging of code of a computer program is facilitated by implementing a step-type operation using internal breakpoints to ensure debugger control of the code. During a debugging session, a step-type operation is implemented by setting active internal breakpoints on every line of code of every routine currently on the call stack referenced by the processor and on entry points of the code being debugged, and subsequently leaving in place, upon completion of the step-type operation, active internal breakpoints. Subsequent to implementing the step-type operation any active internal breakpoints encountered during execution of one or more other operations of the code and deemed unnecessary to completion of the other operation(s) are disabled, and the location of any internal breakpoints disabled during execution of the one or more other operations are tracked in a data structure(s) for subsequent use in reestablishing needed internal breakpoints for implementation of another step-type operation. | 2012-05-03 |
| 20120110554 | STEP-TYPE OPERATION PROCESSING DURING DEBUGGING BY MACHINE INSTRUCTION STEPPING CONCURRENT WITH SETTING BREAKPOINTS - Debugging of code of a computer program is facilitated by implementing, during a debugging session, a step-type operation by machine instruction stepping through the code, and concurrent therewith, setting up breakpoints to perform the step-type operation. Responsive to the machine instruction stepping reaching a next debuggable line of code prior to completion of setup of breakpoints to perform the step-type operation, the machine instruction stepping is discontinued, and the setting up of breakpoints to perform the step-type operation is discontinued. Alternatively, responsive to completing setup of the breakpoints to perform the step-type operation prior to machine instruction stepping reaching the next debuggable line of code, the machine instruction stepping is discontinued, and the code is executed to perform the step-type operation using the set breakpoints. | 2012-05-03 |
| 20120110555 | VARYING REMOVAL OF INTERNAL BREAKPOINTS DURING DEBUGGING OF CODE - Debugging of code of a computer program is facilitated by having a plurality of internal breakpoints associated with lines of code previously set by a processor, during a debugging session, while implementing one or more step-type operations. During execution of another operation, internal breakpoints are disabled as encountered and deemed unnecessary to completion of the another operation. A count of a number of interrupts of one or more interrupt-types experienced during execution of the another operation is maintained, and responsive to the count exceeding a threshold, the disabling is varied to remove at least N internal breakpoints responsive to encountering an internal breakpoint during execution of the another operation deemed unnecessary to completion of the another operation, where N≧2. | 2012-05-03 |
| 20120110556 | HOLDING THREADS IN A SOFTWARE DEBUGGER - A debugger includes a thread holding mechanism that analyzes the code being executed by multiple threads, and delays holding each thread that is currently executing system code external to the program until the thread is no longer executing the system code external to the program, or until some threshold is exceeded. Delaying holding of a thread that is executing system code external to the program avoids potential conditions that could lock up the debugger. | 2012-05-03 |
| 20120110557 | AUTOMATED PARALLEL SOFTWARE CODE IMPACT ANALYSIS - A server device is configured to receive a request to identify a manner in which changed code propagates within an application; generate a group of blocks that correspond to code associated with a parent function corresponding to the application and which includes the changed code; perform an intra-procedural analysis on the group of blocks to identify a block that is affected by the changed code included within an epicenter block; perform an inter-procedural analysis on functions associated with the block, where, when performing the inter-procedural analysis, the server device is to generate another group of blocks associated with the functions, and identify another block that is affected by the changed code included within the epicenter block; and present, for display, information associated with the block or the other block that enables the application to be tested based on the block or the other block. | 2012-05-03 |
| 20120110558 | CUSTOMIZED BINARIES ON-THE-FLY - One or more techniques and/or systems are disclosed for dynamically generating a customized binary on the fly, without a build process. One or more customizing resources are identified for a requested binary, such as from customizing parameter identified from a decoded binary request that was sent from a client computer at runtime. Using an injection map, a location for one or more customizing resources used to customized the requested binary are identified on a resource server, which can be provided by the binary provider. The customized binary is generated by injecting the one or more customizing resources retrieved from the resource server into a decoded base binary. | 2012-05-03 |
| 20120110559 | PROCESSING METHOD - A method for processing computer program code to enable different parts of the computer program code to be executed by different processing elements of a plurality of communicating processing elements. The method comprises identifying at least one first part of the computer program code, which is to be executed by a particular one of said processing elements. The method further comprises identifying at least one further part of the computer code which is related to the at least one first part of the computer code. The at least one first part of the computer program code and the at least one further part of the computer program code are caused to be executed by the particular one of said processing elements. | 2012-05-03 |
| 20120110560 | DATA TYPE PROVIDER FOR A WEB SEMANTIC STORE - A system and method for facilitating development of a computer program that interfaces with a Web Semantic store (WSS). A system queries an WSS to retrieve interface information, including schema information corresponding to a portion of data in the WSS relevant to a user application. The system uses the retrieved information to provide an integrated development environment to a user. The IDE may include one or more features such as completion lists, tool tips, and quick info. The schema information may be used to create synthetic types for use in the target program. The interface information may be used to create synthetic elements to be inserted into a target program. The synthetic types may be used to perform static type checking during an editing session or a program compilation, or to provide the IDE services. During a build, the synthetic elements may be removed and replaced with WSS access code, which is subsequently used during program runtime to access the store. The system enables a user to work with the WSS as they would for built-in parts of their program. | 2012-05-03 |
| 20120110561 | STRUCTURE LAYOUT OPTIMIZATIONS - More effective compiler optimizations provide improved cache utilization. The compiler optimizations include a structure layout optimization that leaves the physical layout of the structure fields intact and instead changes the access order to these fields. The compiler optimizations apply to arrays using array remappings analogous to structure layout optimizations in which the array is considered as a structure and the physical layout of the array remains intact and instead the access order to the array changes. | 2012-05-03 |
| 20120110562 | SYNCHRONIZED FIRMWARE UPDATE - A first firmware image is copied from a first memory to a second memory. Firmware access requests are directed from a host processing system to a memory location in the second memory. A second firmware image is written to the first memory. Conditioned on occurrence of a switching event a switch is set to direct firmware access requests from the host processing system to a memory location in the first memory storing the second firmware image. In some cases, firmware access requests are directed from a host processing system to a memory location in a first memory storing a first firmware image. A second firmware image is written to a second memory. Conditioned on occurrence of a switching event, a switch is set to direct firmware access requests from the host processing system to a memory location in the second memory storing the second firmware image. | 2012-05-03 |
| 20120110563 | DYNAMIC APPLICATION IDENTIFIER FOR USE IN AN UPDATE WORKFLOW - During an update technique, an update for the software application is received from a provider of the software application. Then, update information is either received from the provider or is generated. This update information specifies an update relationship between the update and at least a previous version of the software application. Next, inventory information associated with a portable electronic device is accessed (such as whether the previous version of the software application is currently installed on the portable electronic device). In response to the accessed inventory information, an identifier associated with the update is dynamically generated, and the update and the dynamically generated identifier are provided to the portable electronic device. Using the dynamically generated identifier, an application management system or the operating system installed on the portable electronic device determines whether an update workflow is executed. | 2012-05-03 |
| 20120110564 | UPDATE WORKFLOW IN A PORTABLE DEVICE BASED ON METADATA - During an update technique, an update to a software application is received from a provider of a software application. Then, update information is either received from the provider or is generated. This update information, which is other than an application identifier and a version number associated with the update, specifies an update relationship between the update and at least a previous version of the software application. Subsequently, configuration information (such as whether the previous version of the software application is currently installed on a portable electronic device) is received from the portable electronic device. In response to the received configuration information, the update is provided to the portable electronic device along with update information. Using the update information, an application management system or the operating system installed on the portable electronic device determines whether an update workflow is executed. | 2012-05-03 |
| 20120110565 | CHAINED DATA PROCESSING AND APPLICATION UTILIZATION - The disclosed embodiments provide a system that facilitates application usage. During operation, the system obtains a user context associated with a first user, wherein the user context includes at least one of a location of the first user, profile data for the first user, device data associated with a computing device for the first user, and data types associated with existing applications on the computing device. Next, the system obtains a first set of new applications matching the user context. Finally, the system provides the first set of new applications to the first user for installation and use by the first user. | 2012-05-03 |
| 20120110566 | APPARATUS AND METHOD FOR SETTING UP MULTI-TENANT SAAS APPLICATIONS - Disclosed herein is an apparatus and method for setting up multi-tenant. SaaS applications, which convert setup information for SaaS applications into metadata, manage the metadata, and dynamically generate and provide a relevant service based on the metadata at the request of a user. The apparatus for setting up multi-tenant SaaS applications includes an environment setup unit for receiving setup information required to set up service environments of SaaS applications and converting the setup information into metadata. A setup information management unit manages setup information for SaaS applications for respective tenants using the metadata converted by the environment setup unit. A service provision unit provides SaaS applications that have been set up in different environments for the respective tenants using the metadata managed by the setup information management unit. | 2012-05-03 |
| 20120110567 | OPERATING SYSTEM INSTALLATION USING BUILD PLANS - A method for using a build plan for installing an operating system (OS) on a target computing device includes receiving a selection of one or more steps to a base OS build plan; receiving a statement of one or more parameter values for at least one of the steps; creating an extended OS build plan by combining the selected steps with the base OS build plan; and deploying the OS and the extended OS build plan to the target computing device | 2012-05-03 |
| 20120110568 | Viral Application Distribution - Viral application distribution facilitates distribution of an application among users and increases likelihood of downloading the application by the users. A first device may receive information of an application from a second device through a short-range communication channel. The information may comprise identification information of the application without any personally identifiable information of the second device to protect privacy of a user of the second device. A version of the application that is compatible with the first device is determined by searching a catalog using the identification information of the application. The compatible version of the application may then be downloaded or obtained by the first device. Location-based viral distribution may also be performed between devices that visit a location, even at different times. | 2012-05-03 |
| 20120110569 | Installing and Updating Interpreted Programming Language Applications using a Designated Virtual Machine - A method, system and program of executing an interpreted programming language application from a server at a designated virtual machine on a client computer are provided. A manifest file is extracted which indicates at least one resource for the interpreted programming language application as well as the repository file associated with the resource. The repository file is located in a web start cache and moved to a run directory accessible by the designated virtual machine, outside the web start cache. The interpreted programming language application is then executed from the run directory using the at least one resource. | 2012-05-03 |
| 20120110570 | STATEFUL APPLICATIONS OPERATING IN A STATELESS CLOUD COMPUTING ENVIRONMENT - A cloud computing environment may use a virtualization layer within a stateless cloud computing process to capture, store, and retrieve state information generated by a stateful application executing within the process. The virtualization layer may monitor various state storage systems to identify changes to stateful items and store the stateful items in a state storage mechanism. The virtualization layer may intercept and redirect calls to the stateful items stored in the state storage mechanism. A cloud computing manager may start and stop the stateless cloud computing process, and may recover the state and resume executing the application. | 2012-05-03 |
| 20120110571 | Inherited Product Activation for Virtual Machines - Methods and systems are disclosed in which inherited activation opens a secure communication path from the host operating system (OS) to the guest (virtual machine) OS. The license state of the software on the host is passed through this channel, and software installed in the guest uses this information to inform its own product activation process. The virtualized (guest) software may then activate without any outside communication when the license requirements for the host are met. | 2012-05-03 |
| 20120110572 | Dynamic Allocation and Assignment of Virtual Environment - A mechanism for enabling enterprise data centers to allocate portions of their infrastructure and assign them to specific line of business unit IT organizations. The mechanism allows the business unit to dynamically and rapidly provision virtual infrastructure as needed to run line of business applications. This can also enable the business unit to focus more on the development and management of the applications rather than invest significant resources in managing the infrastructure layer. In various embodiments, data center administrators may be enabled to allocate and assign a portion of their physical infrastructure (Storage, Network and Compute) and expose them as a virtualized environment to different business unit organizations. | 2012-05-03 |
| 20120110573 | TRANSFERRING OBJECTS BETWEEN VIRTUAL MACHINES - Object calls for objects not available on a local virtual machine are fulfilled by requesting the object itself from a remote virtual machine and reconstructing a local instance of the requested object on the local virtual machine. The local instance is reconstructed using information about the class, variables, and methods associated with the remote instance of the object communicated to the local virtual machine. Present and future calls to the object are then directed to the local instance of the requested object. | 2012-05-03 |
| 20120110574 | METHODS AND SYSTEMS TO CLONE A VIRTUAL MACHINE INSTANCE - In one embodiment, an initialization script including instructions to define a value of a parameter at a cloned virtual machine instance is generated and stored at a virtual disk of a source virtual machine instance. The value of the parameter at the cloned virtual machine instance is different from the value of the parameter at the source virtual machine instance. An image of the virtual disk is then sent to a virtual machine module. The cloned virtual machine instance is instantiated at the virtual machine module based on the image of the virtual disk. | 2012-05-03 |
| 20120110575 | SECURE PARTITIONING WITH SHARED INPUT/OUTPUT - A soft partitioning system for allowing multiple virtual system environments to execute on a single platform may include I/O service partitions (IOSPs). The IOSPs operating in a separate virtual memory space on the platform and service disk and network requests from multiple guests. The IOSPs provide translation from virtual addresses to physical addresses such that from the point of view of the guest the virtual addresses used by the guest appear to be physical addresses. The IOSP may be implemented in a Linux kernel. The address space of the IOSP may be extended to include DMA memory sections such that the Linux kernel does not include all of the guest's memory. The IOSP may operate on hardware that does or does not support virtualization technology for directed I/O. | 2012-05-03 |
| 20120110576 | RESOURCE SHARING SYSTEM AND METHOD THEREOF - A resource sharing system for a plurality of user devices accessing at least one resource at the same time is provided. The system comprises a plurality of virtual machines and a connection broker. The virtual machines are established on at least one computer, wherein each user device corresponds to at least one of the virtual machines and each of the at least one resource corresponds to one of the virtual machines. The connection broker connects to the virtual machines and receives login information from each of the virtual machines and joins the virtual machines sending the login information into a group. Through the connection broker, the user devices share and access the resources corresponding to the virtual machines in the group. | 2012-05-03 |
| 20120110577 | CONTROLLING MEMORY CONDITIONS IN A VIRTUAL MACHINE - A method of managing host physical memory using a balloon application executing within a guest virtual machine (GVM) running on a host platform is described. The balloon application receives allocation parameters from an entity outside the GVM, the allocation parameters identifying an amount of memory for the balloon application to allocate. The balloon application adjusts the allocated amount of memory according to the allocated amount. Physical memory backing up the allocated memory can then be assigned by virtualization software for use by another virtual machine running on the host platform. | 2012-05-03 |
| 20120110578 | DATA PROCESSING SYSTEM AND METHOD - A data processing system includes a hardware platform, a virtualization platform, a physical machine, and at least two virtual machines. The virtual machines run on the virtualization platform. The physical machine is configured to bear the virtualization platform. The physical machine is connected to the hardware platform through a system bus. The hardware platform is configured to process data sent by a first virtual machine and send the processed data to a second virtual machine. The hardware platform is employed to process data transmission or data exchange between various virtual machines, so that the virtual machines occupy fewer Central Processing Unit (CPU) and memory resources of the physical machine that bears the running of the virtual machines, the system resource consumption is reduced, and the running performance and speed of the system are improved. | 2012-05-03 |
| 20120110579 | ENTERPRISE RESOURCE PLANNING ORIENTED CONTEXT-AWARE ENVIRONMENT - An Enterprise Resource Planning (ERP) context-aware environment may be provided. Upon receipt of an action request, a context state may be updated. The context state may be analyzed to determine whether the context state is associated with at least one predicted objective. If so, a suggested next action associated with the at least one predicted objective may be provided. | 2012-05-03 |
| 20120110580 | DYNAMIC AND INTELLIGENT PARTIAL COMPUTATION MANAGEMENT FOR EFFICIENT PARALLELIZATION OF SOFTWARE ANALYSIS IN A DISTRIBUTED COMPUTING ENVIRONMENT - A method for verifying software includes determining the result of a bounding function, and using the result of the bounding function to apply one or more policies to the execution of the received job. The bounding function evaluates the execution of a received job, the received job indicating a portion of software to be verified. The result of the bounding function is based upon the present execution of the received job, one or more historical parameters, and an evaluation of the number of idle nodes available to process other jobs. | 2012-05-03 |
| 20120110581 | TASK CANCELLATION GRACE PERIODS - A command to perform a task can be received and the task can be started. A command to cancel the task can also be received. The task can be provided with a warning signal and a predetermined grace period of time before cancelling the task, which can allow the task to prepare for cancellation, such as by shutting down cleanly. If the task has not shut down within the grace period, then the task can be cancelled after the grace period expires. | 2012-05-03 |
| 20120110582 | REAL-TIME COMPUTING RESOURCE MONITORING - Techniques used to enhance the execution of long-running or complex software application instances and jobs on computing systems are disclosed herein. In one embodiment, a real time, self-predicting job resource monitor is employed to predict inadequate system resources on the computing system and failure of a job execution on the computing system. This monitor may not only determine if inadequate resources exist prior to execution of the job, but may also detect in real time if inadequate resources will be encountered during the execution of the job for cases where resource availability has unexpectedly decreased. If a resource deficiency is predicted on the executing computer system, the system may pause the job and automatically take corrective action or alert a user. The job may resume after the resource deficiency is met. Additional embodiments also integrate this resource monitoring capability with the adaptive selection of a computer system or application execution environment based on resource capability predictions and benchmarks. | 2012-05-03 |
| 20120110583 | DYNAMIC PARALLEL LOOPING IN PROCESS RUNTIME - Systems and methods for dynamic parallel looping in process runtime environment are described herein. A currently processed process-flow instance of a business process reaches a dynamic loop activity including a repetitive task to be executed with each loop cycle. A predefined expression is evaluated on top of the current data context of the process-flow instance to discover a number of loop cycles for execution within the dynamic loop activity. A number of parallel activities corresponding to the repetitive task recurrences are instantiated and executed in parallel. The results of the parallel activities are coordinated to confirm that the dynamic loop activity is completed. | 2012-05-03 |
| 20120110584 | SYSTEM AND METHOD OF ACTIVE RISK MANAGEMENT TO REDUCE JOB DE-SCHEDULING PROBABILITY IN COMPUTER CLUSTERS - Systems and methods are provided for generating backup tasks for a plurality of tasks scheduled to run in a computer cluster. Each scheduled task is associated with a target probability for execution, and is executable by a first cluster element and a second cluster element. The system classifies the scheduled tasks into groups based on resource requirements of each task. The system determines the number of backup tasks to be generated. The number of backup tasks is determined in a manner necessary to guarantee that the scheduled tasks satisfy the target probability for execution. The backup tasks are desirably identical for a given group. And each backup task can replace any scheduled task in the given group. | 2012-05-03 |
| 20120110585 | ENERGY CONSUMPTION OPTIMIZATION IN A DATA-PROCESSING SYSTEM - A method for optimizing energy consumption in a data-processing system comprising a set of data-processing units is disclosed. In one embodiment, such a method includes indicating a set of data-processing jobs to be executed on a data-processing system during a production period. An ambient temperature expected for each data-processing unit during the production period is estimated. The method calculates an execution scheme for the data-processing jobs on the data-processing system. The execution scheme optimizes the energy consumed by the data-processing system to execute the data-processing jobs based on the ambient temperature of the data-processing units. The method then executes the data-processing jobs on the data processing system according to the execution scheme. A corresponding apparatus and computer program product are also disclosed. | 2012-05-03 |
| 20120110586 | THREAD GROUP SCHEDULER FOR COMPUTING ON A PARALLEL THREAD PROCESSOR - A parallel thread processor executes thread groups belonging to multiple cooperative thread arrays (CTAs). At each cycle of the parallel thread processor, an instruction scheduler selects a thread group to be issued for execution during a subsequent cycle. The instruction scheduler selects a thread group to issue for execution by (i) identifying a pool of available thread groups, (ii) identifying a CTA that has the greatest seniority value, and (iii) selecting the thread group that has the greatest credit value from within the CTA with the greatest seniority value. | 2012-05-03 |
| 20120110587 | Methods and apparatuses for accumulating and distributing processing power - Calculating and distributing resources of at least one electronic device over a network. | 2012-05-03 |
| 20120110588 | UNIFIED RESOURCE MANAGER PROVIDING A SINGLE POINT OF CONTROL - An integrated hybrid system is provided. The hybrid system includes compute components of different types and architectures that are integrated and managed by a single point of control to provide federation and the presentation of the compute components as a single logical computing platform. | 2012-05-03 |
| 20120110589 | TECHNIQUE FOR EFFICIENT PARALLELIZATION OF SOFTWARE ANALYSIS IN A DISTRIBUTED COMPUTING ENVIRONMENT THROUGH INTELLIGENT DYNAMIC LOAD BALANCING - A method for verifying software includes monitoring a resource queue and a job queue, determining whether the resource queue and the job queue contain entries, and if both the resource queue and the job queue contain entries, then applying a scheduling policy to select a job, selecting a worker node as a best match for the characteristics of the job among the resource queue entries, assigning the job to the worker node, assigning parameters to the worker node for a job creation policy for creating new jobs in the job queue while executing the job, and assigning parameters to the worker node for a termination policy for halting execution of the job. The resource queue indicates worker nodes available to verify a portion of code. The job queue indicates one or more jobs to be executed by a worker node. A job includes a portion of code to be verified. | 2012-05-03 |
| 20120110590 | EFFICIENT PARTIAL COMPUTATION FOR THE PARALLELIZATION OF SOFTWARE ANALYSIS IN A DISTRIBUTED COMPUTING ENVIRONMENT - An electronic device includes a memory, a processor coupled to the memory, and one or more policies stored in the memory. The policies include a resource availability policy determining whether the processor should continue evaluating the software, and a job availability policy determining whether new jobs will be created for unexplored branches. The processor is configured to receive a job to be executed, evaluate the software, select a branch to explore and store an initialization sequence of one or more unexplored branches if a branch in the software is encountered, evaluate the job availability policy, decide whether to create a job for each of the unexplored branches based on the job availability policy, evaluate the resource availability policy, and decide whether to continue evaluating the software at the branch selected to explore based on the resource availability policy. The job indicates of a portion of software to be evaluated. | 2012-05-03 |
| 20120110591 | SCHEDULING POLICY FOR EFFICIENT PARALLELIZATION OF SOFTWARE ANALYSIS IN A DISTRIBUTED COMPUTING ENVIRONMENT - A method for verifying software includes accessing a job queue, accessing a resource queue, and assigning a job from the job queue to a resource from the resource queue if an addition is made to the a job queue or to a resource queue. The job queue includes an indication of one or more jobs to be executed by a worker node, each job indicating a portion of a code to be verified. The resource queue includes an indication of a one or more worker nodes available to verify a portion of software. The resource is selected by determining the best match for the characteristics of the selected job among the resources in the resource queue. | 2012-05-03 |
| 20120110592 | Autonomic Self-Tuning Of Database Management System In Dynamic Logical Partitioning Environment - An automated monitor monitors one or more resource parameters in a logical partition running a database application in a logically partitioned data processing host. The monitor initiates dynamic logical partition reconfiguration in the event that the parameters vary from predetermined parameter values. In particular, the monitor can initiate removal of resources if one of the resource parameters is being underutilized and initiate addition of resources if one of the resource parameters is being overutilized. The monitor can also calculate an amount of resources to be removed or added. The monitor can interact directly with a dynamic logical partition reconfiguration function of the data processing host or it can utilize an intelligent intermediary that listens for a partition reconfiguration suggestion from the monitor. In the latter configuration, the listener can determine where available resources are located and attempt to fully or partially satisfy the resource needs suggested by the monitor. | 2012-05-03 |
| 20120110593 | System and Method for Migration of Data - Systems and methods for data migration are disclosed. A method may include allocating a destination storage resource to receive migration data. The method may also include assigning the destination storage resource a first identifier value equal to an identifier value associated with a source storage resource. The method may additionally include assigning the source storage resource a second identifier value different than the first identifier value. The method may further include migrating data from the source storage resource to the destination storage resource. | 2012-05-03 |
| 20120110594 | LOAD BALANCING WHEN ASSIGNING OPERATIONS IN A PROCESSOR - A method and apparatus for assigning operations in a processor are provided. An incoming instruction is received. The incoming instruction is capable of being processed: only by a first processing unit (PU), only by a second PU or by either first and second PUs. The processing of first and second PUs is load balanced by assigning the received instructions capable of being processed by either the first and the second PUs based on a metric representing differential loads placed on the first and the second PUs. | 2012-05-03 |
| 20120110595 | METHODS AND SYSTEMS FOR MANAGING CONCURRENT DESIGN OF COMPUTER-AIDED DESIGN OBJECTS - The present disclosure features methods and systems for managing concurrent design of computer-aided design objects or models. The systems include a common data model, comprising chapters of different information items to describe various aspects of the CAD model, and lightweight change instructions representative of modifications made by a user to a chapter of the CAD model. By utilizing a common data model and difference-based change instructions, a plurality of users may concurrently collaborate on the design of a CAD model, or a single user may utilize a plurality of applications of a CAD suite efficiently and with an enhanced user experience. | 2012-05-03 |
| 20120110596 | Method for Giving Message Prompt When Mobile Terminal Accesses Mobile Internet Website and Mobile Terminal - A method for giving a message prompt when a mobile terminal accesses a mobile Internet website and the mobile terminal are disclosed in the present disclosure. The method comprises the following steps of: A. receiving a message of browsing a mobile Internet webpage from a user, and triggering a corresponding message prompt event as needed; and B. parsing the message prompt event to obtain a corresponding prompt message, and displaying the prompt message. Because the present disclosure provides a new function of giving a corresponding message prompt when the mobile terminal accesses a mobile Internet website (e.g., prompting the user of the website traffic, the fee charging information, advertisement information, and etc.), the user can timely know conditions of his or her mobile terminal accessing the Internet, which is very convenient for the user. | 2012-05-03 |
| 20120110597 | DETERMINING MULTI-PROGRAMMING LEVELS - An embodiment includes determining user loads and control parameter values. The determining control parameter values are mapped to a performance metric using a function. A constant performance metric is determined where the value of the function calculated at each control parameter value is less than said constant performance metric. An isocontour is defined based on the constant performance metric for each user load. Finally an operating envelope is calculated by correlating the isocontours of multiple user loads. | 2012-05-03 |
| 20120110598 | CLIENT APPLICATION INDEPENDENT EXTENSIBILITY MODEL - Information describing a type registration regarding which an action is being requested by the client application is received as one or more parameters of an application programming interface method invoked by the client application. Based on the one or more parameters, one of multiple type extensions to which the action being requested corresponds is determined. At least part of the information describing the type registration is sent to the one of the multiple type extensions, and the one of the multiple type extensions performs the action being requested. | 2012-05-03 |
| 20120110599 | Systems and/or methods for appropriately handling events - Certain example embodiments described herein relate to techniques for the attachment of priorities and/or reaction time limits to various entities of a system such as, for example, events, event types, queries, etc. The system's processing may be tailored behavior to match these boundary conditions while at the same time increasing (and sometimes even maximizing) the rate of events processed. Advantageously, the system may be made to adapt its behavior to the current situation, which is changeable and may even be changing quite frequently, e.g., as in connection with a potentially rapidly changing stream. Users may in certain example embodiments specify policies to control this adaptation in certain example embodiments and, thus, in certain example instances, events (including events of special interest) may be handled appropriately, even in response to changing conditions. | 2012-05-03 |
| 20120110600 | Relevant Alert Delivery With Event And Alert Suppression In A Distributed Processing System - Methods, systems and products are provided for relevant alert delivery with event and alert suppression including identifying by the event analyzer in dependence upon the event arrival rules one or more alerts; closing, by the event analyzer in dependence upon the events pool operation rules, the events pool; determining, by the events analyzer in dependence upon the event suppression rules, whether to suppress one or more events in the closed events pool; identifying by the event analyzer in dependence upon the events pool closure rules and any unsuppressed events assigned to the events pool, one or more additional alerts; assigning by the alert analyzer the identified alerts to an alerts pool; determining by the alert analyzer in dependence upon alert analysis rules and the alerts in the alert pool whether to suppress any alerts; and transmitting the unsuppressed alerts to one or more components of the distributed processing system. | 2012-05-03 |
| 20120110601 | DYNAMICALLY INSTALLING IMAGE PROCESSING - Methods, computer-readable media, and systems are provided for dynamically installing and image processing filter. One method for dynamically installing and image processing filter includes starting to obtain image information by infrastructure of an image processing device and processing the obtained image information with an application. After starting to obtain image information, receiving an operating system (OS) application programming interface (API) allowing just-in-time (JIT) bytecode to be executed as a filter during processing the obtained image information. | 2012-05-03 |
| 20120110602 | Community Sensor-Coordinating Entity - In one embodiment, a method includes generating in a unified computing system (UCS) environment a first software process representing a person, a second software process representing a sensor associated with the person, a third software process representing a property associated with the person, and a fourth software process representing a virtual community that the person is associated with. The method includes establishing in the UCS environment by execution of the first, second, third, and fourth software processes a virtual relationship among the person, sensor, property, and virtual community. | 2012-05-03 |
| 20120110603 | INFORMATION PROCESSING DEVICE AND COMPUTER PROGRAM PRODUCT - According to an embodiment, an information processing device offering various APIs stores, for every application program, a WSDL file which indicates definition information of an API which is permitted to be used by an application program, and developer information which specifies a developer of an application program. The information processing device releases to an application program a WSDL file corresponding to the application program, receives, through a web service, a request that is a request for use of a first API, determines whether or not the definition information of the first API is indicated in a first WSDL file corresponding to the first application program, and determines whether or not the first WSDL file is leaked, using developer information. | 2012-05-03 |
| 20120110604 | LOCKING MECHANISM AND AN OPTICAL DISK DRIVE HAVING THE SAME - A locking mechanism for installation on a device body, which includes an actuating element, includes a bezel having a through hole and a first positioning portion spaced apart from the through hole, and a locking element including a front operating portion extending through and movable along the through hole in a left-right direction, at least one guide pin extending in a front-rear direction, and an engaging portion. A press button is mounted slidably on the guide pin, and includes a contact portion adapted to be spaced apart from the actuating element in the left-right direction. The front operating portion is operable to move the press button between non-operative and operative positions, where the contact portion is adapted to be placed out of and in alignment with the actuating element, respectively. The engaging portion engages the first positioning portion when the press button is in the non-operative position. | 2012-05-03 |
| 20120110605 | Optical Disc Drive - An optical disc drive is provided to comprise a main circuit board; an optical pickup head, electrically connected to the main circuit board for reading data from an optical disc and for writing a label side of the optical disc; an spindle motor module, electrically connected to the main circuit board through a first flexible flat cable for supporting and rotating the optical; and a spoke detecting module, electrically connected to the main circuit board through a second flexible flat cable for detecting a spoke pattern formed on inner radius of the label side of the optical disc. | 2012-05-03 |
| 20120110606 | SPINDLE MOTOR - Disclosed is a spindle motor, the spindle motor including a turntable coupled to a rotating shaft and supporting the rotating shaft and a disc, a centering unit fitted over the rotating shaft and supporting an inner circumference of the disc, and a coil spring interposed between the turntable and the centering unit to elastically support the centering unit, wherein a first end of the coil spring is brought into contact with a spring hanging portion protruding from a side surface of the centering unit, and a second end opposite to the first end of the coil spring is supported by a spring support portion formed in the turntable. | 2012-05-03 |
| 20120110607 | MULTI-PLATFORM TELEVISION EPISODE PRODUCTION PROCESS - A multi-platform television production process that results in an almost completely viewer-guided television episode. The production process begins at an online website where criteria for a first portion of the episode are selected by the public. Production commences on this portion of the episode, based on the criterion chosen by the online users, and the first portion of the episode is aired online. Viewers of this online airing of the initial production of the episode provide feedback on the first portion of the episode and are able to vote on criteria for the second portion of the episode. The second portion of the episode is produced, based on the criterion chosen by viewers. Then, the full episode, incorporating viewer feedback received during the production process) is aired on television. The full episode may also include content received from the online viewers. | 2012-05-03 |
| 20120110608 | DIGITAL CONTENT AND RESPONSE PROCESSING SYSTEM AND METHOD - Systems and methods are provided for allowing responses to offers displayed with digital content. The responses may be provided on a receiver system via a conventional feedback through the same distribution channel through which the content and offer were provided, or through an alternative channel, with data being transmitted from an alternative channel device to a transacting entity. For time-shifted playback, content is identified and time-adapted offers may be provided, taking into account factors such as the content, the time of play back, the date of play back, and so forth. The alternate response channel may be more suitable for time-adapted offer responses then for contemporaneously transmitted offers. | 2012-05-03 |
| 20120110609 | METHOD AND APPARATUS FOR PEER-TO-PEER STREAMING OF LAYERED CONTENT - A method and apparatus are described including receiving buffer maps of neighbor peers, measuring serving rates from the neighbor peers, measuring serving rates to the neighbor peers, requesting a unit of data from one of the neighbor peers responsive to information in the buffer maps of the neighbor peers at a rate responsive to the serving rate from the one of the neighbor peers, receiving incoming requests for units of data, sorting the incoming requests into a plurality of queues, selecting one of the incoming requests to serve responsive to the serving rates to the neighbor peers corresponding to the incoming request, updating the queues and selecting a new neighbor peer. | 2012-05-03 |
| 20120110610 | Systems and methods for providing a token registry and encoder - Systems and methods for using tokens to link the television and the Internet platforms. The tokens are tightly encoded into the content and a registry controls the linking of the television content to specific Internet-based content. The registry also polices the validity of the tokens and optionally provides the token owner with continued control over the Internet content associated with that token. When the two platforms are linked successfully, the consumer receives quality content, while being protected from unwanted Internet content. | 2012-05-03 |
| 20120110611 | MULTI-CHANNEL AUDIO ENHANCEMENT FOR TELEVISION - A comprehensive mechanism is provided for broadcasting and accessing multiple audio sources in connection with the viewing of a television program. Audio is collected through the use of standard audio capture techniques. Next, the audio is distributed by either of in-band via broadcast or out-of-band techniques. In-band audio is preferably provided via an MPEG stream associated with the current television program. Out-of-band (OOB) audio can be broadcast as well, although it is preferable to select which channel is distributed upstream first, rather than broadcast all channels downstream and consume bandwidth for unselected audio. The viewer operates a set top box to select the appropriate audio channel(s) for reproduction. | 2012-05-03 |
| 20120110612 | Method and System for Providing Security within Multiple Set-Top Boxes Assigned for a Single Customer - Two or more set-top boxes are installed in a household. A communications link, preferably a physical link, is provided between or among the set-top boxes. One of the boxes is designated as a “master” box while the other box or boxes are “slaves.” The slave box will use the communications link to communicate in a secured and encrypted manner with the master box. If that communication is severed, e.g., if an attempt is made to move the slave box to another household to provide unauthorized service in that household, the slave box will stop working when it can no longer communicate with the master box. | 2012-05-03 |
| 20120110613 | SYSTEM, APPARATUS, METHOD AND COMPUTER PROGRAM FOR TRANSFERRING CONTENT - Apparatus and methods are provided for moving electronic content between devices. In one implementation, an content-transmitting apparatus may include a transmitting unit configured to transmit content to a content-receiving apparatus. The content-transmitting apparatus may also include a determination unit configured to determine, in response to the transmission, whether first key information associated with the content-receiving apparatus corresponds to second key information associated with the content-transmitting apparatus. A receiving unit may be configured to receive a confirmation message from the content-receiving apparatus, and a confirmation unit may be configured to confirm whether the content is usable at the content-receiving apparatus, based on at least the confirmation message. | 2012-05-03 |
| 20120110614 | APPARATUS, SYSTEMS AND METHODS FOR CUSTOMER PREMISES WEATHER REPORTING AT A MEDIA DEVICE - Customer premises weather station systems and methods are operable to present local weather information on a media presentation system display located at the customer premises. An exemplary embodiment detects at least one ambient weather condition using a detector located at a customer premises, determines occurrence of a degradation of at least one characteristic of an over the air (OTA) media content signal received by a receiving antenna located at the customer premises, and generates a report in response to the determined degradation of the OTA media content signal characteristic. The report is configured to be presented on a display to a customer. The report may indicate the at least one ambient weather condition. | 2012-05-03 |
| 20120110615 | METHOD AND APPARATUS FOR PERMITTING USER INTERRUPTION OF AN ADVERTISEMENT AND THE SUBSTITUTION OF ALTERNATE ADVERTISEMENT VERSION - A method, apparatus, article of manufacture, and a memory structure for providing advertisements with a media program transmitted to a user device are described. The method permits the user to interrupt the playback of the advertisement and continue with the playback of the media program with no further advertisements, or to interrupt the playback of the advertisement to substitute a different version of the advertisement. | 2012-05-03 |
| 20120110616 | METHOD AND APPARATUS FOR PROVIDING USER CONTROL OF ADVERTISING BREAKS ASSOCIATED WITH A MEDIA PROGRAM - A method, apparatus, article of manufacture, and a memory structure for presenting an advertisement for playback in conjunction with a streamed media program are described. The method permits the user to control advertising breaks and in particular, the timing of advertising breaks associated with the media program. | 2012-05-03 |
| 20120110617 | PROGRAM REPLACING METHOD - A program replacing method capable of updating a program by executing a temporarily downloaded program without deleting an existing program, as well as being capable of easily restoring such existing program. When a function not equipped to the existing program is required to be added, the program replacing method downloads a program so that it can be executed concurrently with the existing program. | 2012-05-03 |
| 20120110618 | METHOD AND APPARATUS FOR PROVIDING DIRECTED ADVERTISING BASED ON USER PREFERENCES - A method, apparatus, article of manufacture, and a memory structure for providing advertisements with a media program transmitted to a user device are described. The method permits the user to control the presentation of advertisements. | 2012-05-03 |
| 20120110619 | METHOD AND APPARATUS FOR PROVIDING USER INFORMATION TO IMPROVE ADVERTISING EXPERIENCE - A method, apparatus, article of manufacture, and a memory structure for providing advertisements with a media program transmitted to a user device are described. The method permits the user to manage the provision of user information such as surveys and advertisement feedback to the media program provider to improve the advertising experience. | 2012-05-03 |
| 20120110620 | METHOD AND APPARATUS FOR USER SELECTION OF ADVERTISING COMBINATIONS - A method, apparatus, article of manufacture, and a memory structure for providing advertisements with a media program transmitted to a user device are described. The method permits the user to control the presentation of advertisements to select prefacing advertisements in lieu of more time consuming or more numerous intervening advertisements presented during the media program. | 2012-05-03 |
| 20120110621 | Social Aspects of Media Guides - A computer-implemented method, including receiving, at a computing device, a request from a user to display descriptors of media programming content for a time period; identifying people associated with the user employing information stored in a computer database, and identifying time-associated media programs electronically scheduled on behalf of the identified people; and providing for display, to the user, the descriptions of the identified people and of the time-associated media programs. | 2012-05-03 |
| 20120110622 | System and method for location-appropriate service listings - Systems and methods applicable, for example, in the provision of service listings, channel listings, and/or the like. The location of a device may, for example, be determined, and one or more service parameters corresponding, for instance, to the location may, for example, be employed in receiving service listings data, channel listings data, and/or the like. | 2012-05-03 |
| 20120110623 | SEARCH QUERY COLUMN FOR INTERNET-CONNECTED TV'S - A TV display presents a grid of thumbnails representing content available for display from the Internet and next to the grid, a column of thumbnails representing content that conforms to a user-entered query. The conforming content is located by searching the Internet, from an EPG, from local TV storage, and from the TV's home network. Search result thumbnails are prioritized according to user navigation history. | 2012-05-03 |
