Abstract: In a communication system, an access source page is printed, together with an entry column and code regions on a sheet of paper, the entry column being provided for entering a command content to access destination pages, the code regions being provided for entering codes for specifying access destination pages corresponding to the entry column. Then, the sheet of paper on which the command content has been entered by a user is read. A URL of an access destination page corresponding to each entry column in which the command content has been entered is specified on the basis of contents entered in the code regions, a link list or a text file. At least one command to the specified URL is specified on the basis of check-off states of check columns constituting each entry column. Then, at least one process corresponding to the command is applied to the URL.

Abstract: It is one object of the present invention to improve the text editing operation provided by document creation application software. A text editing apparatus that is implemented by a computer under the control of document creation application software comprises: a document data controller for controlling a process for editing target document data read from a memory; and a document display controller for displaying a document, on a predetermined display device, based on the document data read by the document data controller, wherein, for each section constituting the document data, the document display controller provides a display area, and in accordance with the size of the display area, displays part of the document in the section.

Abstract: Image forming device and image forming method providing at least two printing speed of a printing engine dependent on data volume of a raster. Printing data transmitted from a host computer are stored in RAM and developed into image data by CPU. The image data are compressed by ASIC and stored in the RAM. The CPU determines if the compressed image data can be printed at a high printing speed by comparing a predetermined data volume with the compressed data volume of the raster having the largest data volume (the greatest raster length) among rasters constituting the image data. High speed printing is selected for the laser units if determination falls that high speed printing is feasible, whereas low speed printing is selected for the laser units if high speed printing is not feasible. Then, the compressed image data are sent to the ASIC on a raster by raster basis and transferred to the laser units for printing after having been decompressed.

Abstract: An apparatus and method for incorporating driver sizing into buffer insertion such that the two optimization techniques are performed simultaneously are provided. In particular, the apparatus and method extends van Ginneken's algorithm to handle driver sizing by treating a source node as a “driver library”. With the apparatus and method, the circuit design is converted to a Steiner tree representation of the circuit design. Buffer insertion is performed on the Steiner tree using the van Ginneken algorithm to generate a first set of possible optimal solutions. For each solution in the first set, a driver of the same type as the original driver in the Steiner tree is selected from a driver library and virtually inserted into the solution. A delay penalty is retrieved for the selected driver. This delay penalty is then used along with the new driver's characteristics to generate a second set of solutions based on the first set of solutions.

Abstract: Formal verification methods provide for improved efficiency of popular binary decision diagram (BDD) based algorithms. A lazy pre-image computation method builds new transition relation partitions on-demand for relevant internal variables of a state predicate, and conjoins only next state relations for relevant internal variables to a pre-image including the state predicate. A lazy fixpoint computation method makes iterative use of lazy pre-image computation to compute conditions that must be satisfied to produce a given set of states. A forward assumption propagation method generates assumptions to characterize a set of interesting states for a property being evaluated at one or more evaluation stages. A dynamic transition relation reduction improves the efficiency for symbolic model checking by reducing transition relations under assumptions dynamically generated from properties being evaluated.

Abstract: In a multi-wide class design layout, design rule checks for enclosure of multi wide class objects prevent false errors or false passes by performing such checks against the non-virtual boundaries of a wide class object, and not against the virtual boundaries. An exemplary embodiment provides a method for identifying as a violation, for each wide class wi object, any geometry on another layer which is located at least partially inside the wi object and has any portion thereof located within a distance encli of any non-virtual boundary of the wi object. The exemplary method is preferably performed using effective wide class objects.

Abstract: In a Pure Fill Via Area (PFVA) extraction design flow, the extracted PFVAs may violate the minimum via spacing rule with the existing vias and may also violate the minimum via spacing rule among themselves. Such extracted PFVA violations may be corrected in an automatable design flow not requiring user intervention by removing any portion of a PFVA falling within a minimum via spacing rule of an existing via, to form a DRC-clean PFVA relative to existing vias, and removing any portion of a DRC-clean PFVA falling within the minimum via spacing rule of another DRC-clean PFVA.

Abstract: In a multi-wide object class design layout, an automatic extraction of pure fill via areas (PFVA) among multi wide class objects treats the virtual boundaries of the wide objects differently than non-virtual boundaries to allow an extracted pure fill via area to extend across a virtual edge of a wide class object. An exemplary method is provided for deriving one or more pure fill via areas for geometries on a first layer in a design layout having multi-wide object classes on the first layer. The exemplary method includes forming a Current PFVA, initially as a PFVA for the geometries of the layer, and successively adjusting the Current PFVA for each higher wide object class corresponding to the geometries, to accommodate the respective enclosure rules for each higher wide object class.

Abstract: Physical design optimizations for integrated circuits, such as placement, buffer insertion, floorplanning and routing, require fast and accurate analysis of resistive-capacitive (RC) delays in the network. A method is disclosed for estimating delays at nodes in an RC circuit by calculating a first and second impulse response moments of the RC circuit, and matching the impulse response moments to a Weibull distribution. Based on the match, a signal delay value is computed. The invention may thus be used to determine whether the RC circuit meets a desired optimization condition, based on the signal delay value. In the exemplary implementation, the signal delay value at a delay point is calculated by finding a percentile of the Weibull distribution corresponding to the delay point. This implementation is accurate and very efficient as it uses only two very small look-up tables.

Abstract: A clock network synthesis method and apparatus corrects for clock skew and impedance differences. A method includes identifying clock networks having more active elements as compared to other clock networks of a plurality of clock networks, for those identified clock networks, identifying a pattern of active elements therein as transversed by a clock signal, and for those unidentified clock networks in the correlated clock networks, adding active elements such that those added active elements transversed by the clock signal match those transversed in the identified clock networks. A method for preventing clock skew and impedance differences includes performing a clock balancing, identifying each related node across a sub-network, identifying each input driven via the identified related nodes, and adding one or more active elements to one or more nodes until each element in the identified related nodes drives a same number of inputs.

Abstract: A method for allocating decoupling capacitor cells in an integrated circuit (IC) design, includes (a) obtaining geometrical information of rectangular areas in the IC design, each of the rectangular areas not intersecting any design figure in selected metal layers of the IC design in a design area, (b) determining possible locations for rows of decoupling capacitor cell arrays to be placed in the rectangular areas, a row including a set of cell arrays to be placed across the rectangular areas in a direction of a first coordinate axis of the design area, (c) determining for each possible location a number of decoupling capacitor cells included in the row, and (d) selecting row locations satisfying a certain design rule from among the possible locations in a descending order of the number of the decoupling capacitor cells.

Abstract: Techniques which allow a bit value stored/generated by integrated circuits to be changed by changing potentially only one of several masks used to fabricate the circuits. For example, when a single mask is to be re-designed to implement a design change (e.g., to fix minor bugs) and a version identifier is to be changed, the same mask can be used to implement the change in the version identifier as well. An embodiment allows the bit value to be changed any number of times by changing only one mask. As a result, the invention minimizes the number of masks that may need to be changed when implementing design changes.

Abstract: Methods and apparatus, including computer program products, for implementing a computer system that provides a model, a first view and at least a second view for presenting the model, a first controller and at least a second controller for manipulating the model. The first and second views relate to the first and second controllers, respectively. The computer system further comprises at least a first context, a second context and a third context. A user interface element of the first view binds to a first structure element of the first context and a user interface element of the second view binds to a second structure element of the second context. The first structure element and the second structure element reference a third structure element of the third context.

Abstract: A validation system comprises a memory accessible by a processor and having an extensible markup language (XML) data model of a computer network relating at least two objects corresponding to a set of syntax rules. The system also comprises a set of semantic rules accessible by the processor and having semantic information expressed in XML format corresponding to the XML data model. The system further comprises a validator adapted to validate the XML data model using the set of semantic rules.

Abstract: A method for generating a partitioned enterprise application, including obtaining a business object specification defining a characteristic of a business object, obtaining an application usage specification defining how the business object is to be used in the partitioned enterprise application, obtaining partitioning information, and generating the partitioned enterprise application using the business object specification, the application usage specification, and the partitioning information.

Abstract: Systems and methods for producing a software product are disclosed. In a beginning of developing a software product, a project manager considers a number of stations, where each station specializes in one of a plurality of process steps for converting existing product descriptions and/or code into code segments operable in enabling the software product. Based on the knowledge of the station specialties, the project manager may distribute a number of tasks associated with developing the software product to the various stations. One of the stations is operable to assemble the enabling code segments into the software product. In this way, expertise is continually made available during multiple development processes for multiple software products. Thus, both a cost and a time for completion of the software products can be reduced, while a predictability of each is improved.

Abstract: There is described a method, computer program product and system which relate to the execution of verifiable processes in a distributed computing/processing environment. More particularly the invention relates to the autonomic implementation and verification of a business logic specification in a heterogeneous distributed computing environment. The business logic specification (102) is rendered (step 112) as a plurality of validated processes (104) for execution in a distributed processing environment (110). By monitoring and analysing the information generated in that execution (step 114), it is possible to correlate a view of the executing processes (106). Comparison between the original specification and the correlated view is performed, context information is applied (step 116) and amendments made to the specification as a result. The invention achieves the full cycle of events substantially autonomically.

Abstract: The invention provides for extracting language and culture information from a POSIX™* conforming locale source file for the purpose of formatting sample data for country and language expert validation. The invention is performed on a computer system by obtaining a locale source file, in a preferred form, containing a plurality of elements having language and culture information, extracting and then using those elements and their associated values cooperatively with sample data, to generate readable text representations, thereby providing a country and language expert reviewer with textual data formatted according to the conventions embodied in the locale source file. * ISO/IEC 9945-1:1900 (IEEE Standard 1003.2-1990) Information Technology-Portable Operating System Interface (POSIX™) Shell Utilities, IEEE Standards 1003.2 and 1003.2a.

Abstract: An optimizing apparatus includes a data item extraction unit, a layout unit, an unused data item extraction unit, a merge determination unit, and a data item merge unit. The data item extraction unit extracts data items from a program. The layout unit lays out the extracted data item in memory. The unused data item extraction unit extracts defined but unused data items from the extracted data items. The merge determination unit determines based on the layout result whether or not a plurality of unused data items forming a data item having a hierarchical structure can be merged into a new data item. The data item merge unit merges the plurality of data items into a data item based on the determination result.

Abstract: Disclosed are systems and methods for optimizing a program.

Abstract: An arrangement is provided for translating a plurality of scalar single instruction multiple data stream (SIMD) instructions into a plurality of optimized non-scalar SIMD instructions to be executed on a target architecture supporting only parallel SIMD instructions. After receiving a plurality of scalar SIMD instructions, translation from the scalar SIMD instructions to non-scalar SIMD instructions is performed. The translation is optimized so that the number of translated non-scalar SIMD instructions is minimized. The translated non-scalar SIMD instructions are executed on a target architecture that supports only parallel SIMD instructions.

Abstract: An improved register allocation technique is provided. An interference graph coloring is attempted multiple times prior to spilling one or more nodes. Each node has a spill cost derived from the time it takes to store and recall the variable's data combined with how often the compiler thinks the variable is needed. Similarly, each coloring failure has a spill cost which is the accumulation of the spill costs of the remaining un-colorable nodes. If any solutions are found, the process is complete. If only failures are found, the cheapest node(s) to spill is evaluated based on the multiple failures. In one embodiment, the cheapest node of the cheapest failure is spilled. In another embodiment, the cheapest node is evaluated across all failures. This process is repeated until a solution is found (all nodes are colored or spilled).

Abstract: A system and method for updating a version of client software in a client computer, the client software enabling the client computer to communicate properly with a hardcopy device, includes receiving a job from the client computer, the job including information regarding a version of the client software in the client computer. A determination is made of whether the version of the client software of the client computer is an up-to-date version. The up-to-date version of the client software is provided to the client computer if the version of client software of the client computer is not the up-to-date version.

Abstract: In one embodiment, a method for resolving address space conflicts includes detecting that a guest operating system attempts to access a region occupied by a first portion of a virtual machine monitor and relocating the first portion of the virtual machine monitor within the first address space to allow the guest operating system to access the region previously occupied by the first portion of the virtual machine monitor.

Abstract: Present herein is a system and method for arbitration in multi-threaded programming. Task calls are directed to a task wrapper that associates the task call with a particular unique identifier, and stores parameters provided by the task call at memory locations associated with the unique identifier. The execution of the task is handled by a task loop. The task loop queues a plurality of memory portions into a circular queue. The contents of the queue are serially provided to the task, and the results are serially written to the circular queue and provided back to the calling threads.

Abstract: An apparatus and method are provided for scheduling transmit network events in a multiprocessing environment. Each processing node handles its own linked list of transmit object queues and linked list of transport queues. Therefore efficient handling of the transmit network events is enabled. Queues may be added, made inactive, or removed depending on the status of a specific transmit event the queue handles. By maintaining queues in memory, the apparatus is easily scalable, in linear relationship with the size of the memory made available.

Abstract: A method and system that prepares a task for being swapped out from processor utilization that is executing on a computer with multiple processors that each support multiple streams. The task has one or more teams of threads, where each team represents threads executing on a single processor. The task designates, for each stream that is executing a thread, one stream as a team master stream and one stream as a task master stream. For each team master stream, the task notifies the operating system that the team is ready to be swapped out when each other thread of the team has saved its state and has quit its stream. Finally, for the task master stream, the task notifies the operating system that the task is ready to be swapped when it has saved its state and each other team has notified that it is ready to be swapped out.

Abstract: A parallel process execution method that allocates CPU time to parallel processes at any desired ratios. The method sets a time allocation ratio to determine how much of a given cycle period should be allocated for execution of a parallel program. Process switching is then performed in accordance with the time allocation ratio set to the parallel program. More specifically, parallel processes produced from a parallel program are each assigned to a plurality of processors, and those parallel processes are started simultaneously on the processors. When the time elapsed since the start of the parallel processes has reached a point that corresponds to the time allocation ratio that has been set to the parallel program, the execution of the assigned parallel processes is stopped simultaneously on the plurality of processors.

Abstract: A method and system that prepares a task for being swapped out from processor utilization that is executing on a computer with multiple processors that each support multiple streams. The task has one or more teams of threads, where each team represents threads executing on a single processor. The task designates, for each stream that is executing a thread, one stream as a team master stream and one stream as a task master stream. For each team master stream, the task notifies the operating system that the team is ready to be swapped out when each other thread of the team has saved its state and has quit its stream. Finally, for the task master stream, the task notifies the operating system that the task is ready to be swapped when it has saved its state and each other team has notified that it is ready to be swapped out.

Abstract: An application independent, in-kernel cache is implemented. In-kernel caches provide applications with commonly used data quickly and efficiently. Methods and instruments for storing content, cache objects, are implemented leveraging operating system supplied mechanisms. Every operating system has one or more specific means of in-kernel storage usable by kernel extensions. A system that acquires storage for the cache objects is implemented. Techniques for allowing multiple varying sources of data are defined. Multiple data sources may provide application specific and/or application independent data using various protocols. The aforementioned cache object storage mechanisms are independent of the source of the data and vise versa. Techniques for fast lookup and management of cache objects are defined. Mechanisms for moving the data from the data source into the cache object storage mechanism are implemented.

Abstract: In a network computing environment with a distributed software system utilizing Common Object Request Broker Architecture (CORBA), a Universal Client and Consumer tool that creates Client and Consumer implementations for use in interacting with any existing Servers and/or Suppliers in the system, and displaying the data resulting from the interactions for the purpose of validating the operation, functionality and performance of the Servers and Suppliers. The tool creates a graphical user interface for the user to select Servers or Suppliers to evaluate. The tool identifies the Server or Supplier IDL interface, and then creates either a Client or Consumer Implementation that uses the same corresponding IDL interface. The tool then attempts to connect to the Server or Supplier and where appropriate allow the user to invoke methods. Data received from the Servers and/or Suppliers is displayed on a video device and logged for later analysis.

Abstract: A request/reply middleware wrapper that transposes an application's request/reply communications into publish/subscribe communications implemented by publish/subscribe middleware where every distributed application component of a distributed application is referenced by a component type and name. Each component type has associated with it a request publish/subscribe topic and a reply publish/subscribe topic. Each distributed application component subscribes to its request and reply topics and can publish to request and reply topics of other component types. By utilizing callback objects, the middleware wrapper facilitates the transmission of a request and replies between distributed application components by posting the requests or replies on an appropriate request or reply publish/subscribe topic.

Abstract: A Web server storing a Java program for generating an HTML file of a Web page includes a portion for obtaining an HTML file, a first conversion portion for converting the file into Java codes, a portion for replacing the codes with a part of a Java program related to the Web page structure, the Java program being for generating the HTML file, a portion for extracting Java codes of a part related to a designated Web page structure, a second conversion portion for converting the codes into an HTML file, and a portion for transmitting the file to the terminal device. If the HTML file contains a tag indicating an unmodifiable part, the first conversion portion converts the tag into a Java code indicating an unmodifiable part. The second conversion portion converts the code contained in the Java codes into the tag.

Abstract: A method for calling a software method in a called CORBA application by a caller software method in a caller CORBA application in a process of a computer system is disclosed. The caller software method calls a software method in a CORBA stub sending a parameter which is created using a classloader of the caller application. The CORBA stub software method calls a software method in a dynamic proxy sending the parameter. The dynamic proxy software method calls an ORB sending the parameter. The ORB serializes the parameter and returns it to the dynamic proxy software method. The dynamic proxy software method calls the ORB sending the serialized parameter. The ORB deserializes the serialized parameter using a classloader of the called application and returns it to the dynamic proxy software method. The dynamic proxy software method calls the called software method sending the deserialized parameter.

Abstract: Methods and components for processing Universal Resource Locator (URL) requests for web content are presented. The application servers and/or application software implement request switching components adapted to route URL requests for web content to servlets adapted to perform modularized functionality in servicing URL requests. The combination of request switch and servlet components define a request processing network. The advantages are derived from a flexibility in adding, modifying, and removing servlets from the request processing network at reduced regression testing. Each URL request is optimally routed only to necessary components to service the request. The use of request switches consolidates and simplifies the servlet triggering functionality in selecting servlets to service each URL request enabling specialized processing of URL requests. Solutions using servlet network arrangements enable parallel processing of URL requests.

Abstract: A system and method for object system interoperability is provided. The system comprises an object generator, a target program, and a formatter which is a serializer and/or deserializer. The method comprises the steps of executing the object generator, which uses a data model specification to generate self-reflective object classes in the target program, which in turn calls a formatter to translate between an object instance and serial data.

Abstract: A system and method for object system interoperability is provided. The system comprises an object generator, a target program, and a formatter which is a serializer and/or deserializer. The method comprises the steps of executing the object generator, which uses a data model specification to generate self-reflective object classes in the target program, which in turn calls a formatter to translate between an object instance and serial data.

Abstract: A driver code arrangement, usable with a system having a bus that connects a host to a device, selects a dispatch routine to handle an input/output (IO) request packet (IRP) that is traversing a stack of device objects representing a portion of a communications path between the host and the device. Such a driver includes: a first code portion to receive the IRP; a second code portion to retrieve a set of data that identifies dispatch routines that are appropriate to the type of the device and/or the location within the stack associated with the code arrangement; a third code portion to extract, from the IRP, an indicator of the type of IO request which the IRP represents; and a fourth code portion to select a member from the set based upon the indicator which identifies a dispatch routine that is also appropriate to the type of request being made.

Abstract: A filter driver (usable with a system having a bus, a host connected to the bus and one or more devices connected to the bus) that supplants first device objects (DOs) with second DOs. Such a filter driver includes: an intercept code portion to intercept a set of data identifying one or more first DOs, respectively; a determination code portion to determine addresses of second DOs corresponding to the first DOs identified by the data set, respectively; and a change code portion to change the data set such that members thereof identify the second DOs rather than the first DOs.

Abstract: A method and an apparatus for identifying a processing configuration, identifying a piece of application software, and using processor affinity information from an affinity database to determine which processor(s) or duplicated component(s) of a processor to use in executing the piece of application software.

Abstract: Runtime services for network software platforms are described. In one implementation, runtime services are configured for a web application. A configuration file is created containing tags that provide references to configuration information specific to operational behavior of the web application. The configuration file is read upon receiving a request to start the web application. The runtime services for the web application are initialized based on the configuration information read from the configuration file.

Abstract: An indexing method for allowing a viewer to control the mode of delivery of program material. By mapping from time to data position, data delivery can begin at any selected time in the program material. The indexing method also provides for controlling data delivery to begin at the beginning of a frame of data. A synchronizing method is provided to minimize a time offset between audio and vide data, particularly in environments using groups of pictures.

Abstract: The present invention achieves maintenance of service quality and efficient operation of a system by dynamically and optimally relocating contents in each of an archive server, edge servers, and terminal storage devices. To achieve the object, the present invention provides a contents delivery system in which a CDN (contents delivery network) having plural edge servers intervenes between a center device managing an archive server storing contents and user terminals having large-capacity storage devices, wherein the center device includes: a viewing results collection part; a viewing results analysis part; a contents allocation part for relocating contents to each of the archive server, relay servers, and user terminals, based on an analyzed viewing tendency; a portal creation part for automatically creating a portal after the relocation; and a price decision part for automatically deciding contents prices after the relocation.

Abstract: Methods and apparatus for an advertisement display service using metadata is disclosed. The method for providing a selective advertisement display comprises constructing a user's preference for television programs; analyzing and filtering metadata of advertisements based on said user's preference; storing the selected advertisements on digital television; analyzing metadata of a program viewed by the user when the user watches television; matching the metadata of the program with the metadata of advertisements stored; and providing the most related advertisement in the form of banner, based on the result of the matching. Thus, the present system can provide a targeting service corresponding to each user's tastes without leaking user's personal information, by storing advertisements corresponding to the user's tastes beforehand and, subsequently, providing the advertisements related to a program viewed by the user in the form of a banner.

Abstract: The present invention relates to an information processing apparatus by which image data can be downloaded simply. A video camera 11 receives thumbnail images corresponding to one or more images included in an album from a video camera image station 41 and displays the thumbnail images on an LCD unit. If one or more images to be downloaded are selected, then the video camera 11 acquires image information of the selected image or images from a video camera image station 41, analyzes the image information and discriminates it one by one image whether or not the selected image data are downloadable. Every time one image is discriminated to be downloadable, the video camera 11 accesses a corresponding URL designated for each image, downloads the image from the URL and records the image onto a recording medium. The video camera 11 successively downloads the selected images in this manner.

Abstract: A system and method for content based on-demand video media overlay is presented. A user uses a media manager, such as a set-top box, to register for an event. The media manager retrieves information from an event data packet, which includes a detection identifier, to register the event. After registration, the media manager matches event identifiers provided by a content provider with the registered event's detection identifier. When the media manager determines a match, the media manager retrieves an identified event corresponding to the matched event identifier, formats the identified event using user-defined preferences, and displays the formatted identified event on a media device, such as a television. The user may also configure the media manager to store formatted identified events in a nonvolatile storage area for later viewing.

Abstract: Systems and methods for generating a walled garden program for substantially optimized bandwidth delivery are described. In particular, layers of data that are substantially similar across multiple pages of Web content are identified for subsequent reuse during transcoding operations. To this end, the content pages are transcoded into a program that includes multiple video components. The pages are transcoded such that a layer that was determined to be substantially similar across multiple ones of the pages is not encoded into a respective video component for each substantially similar occurrence of the layer. Rather, the layer and all other substantially similar layers are represented in the program with a single still of the video components and interaction model metadata. By reusing similar components, the amount of data used to represent the Web content is reduced, providing for substantially optimized bandwidth delivery to the client.

Abstract: A system for distributing contents to the terminals of users through a network. Before the distribution, it is determined whether or not the contents can be distributed according to the information about the places to which the contents are distributed and the information about the places in which the contents are shown. Thus, a larger number of users can be provided with an opportunity to enjoy the contents without disordering the commercial domain of the showing movie theater for showing the contents.

Abstract: The method is for remotely viewing a performance in real time by providing a first remote viewer, a first camera monitoring a first object to produce a first image and a second camera monitoring a digital pixel area larger than a second moving object disposed within the digital pixel area to produce a second moving image in real time. The first image is updated every first time period and sent the web site. The second image is continuously updated every second time period and sent to the web site. The second time period is shorter than the first time period. The web site superimposes the second image over the first image so that both the second and first images are viewable to the first remote viewer via the network.

Abstract: A speech recognition remote control unit (SR RCU) having the ability to leverage the advanced processing and memory capabilities of a settop box in order to provide enhanced SR capability and enhanced user control of components in an audio-video system. Programming of commands takes place in either the SR RCU or in the settop box, or both. Commands programmed into the settop box may be initiated by speech communications received by the SR RCU that are then sent to the settop box via wireless transfer. The initiated commands may further be sent to a device either directly from the settop box, or via relay from the settop box to the SR RCU, and then to the device. The SR RCU may be capable of receiving both speech communications and wireless information.