255 results about "Active object" patented technology

A user interface method and apparatus for a mobile terminal having a touchscreen are provided. The apparatus and method improve interactivity using a toolbar menu mode screen which allows a user to execute functions and commands with drag and drop behaviors on the touchscreen to graphical objects such as toolbar, icons, and other active objects. An interface apparatus includes a touchscreen unit that displays a screen including a second region for presenting a toolbar having at least one User Interface (UI) element representing a specific function and a first region for activating, when the UI element is dragged from the toolbar and dropped in the first region on the touchscreen, the function represented by the UI element. The interface apparatus also includes a control unit which detects a drag and drop action of the UI element and activates, when the drag and drop action is detected, the function associated with the UI element in the form of an active function object. The interface apparatus of the present invention registers the frequently used functions with the toolbar in the form of icons such that, when an icon is dragged from the toolbar to the main window, the function represented by the icon is activated.

A Graphical User Interface (GUI) for an ultrasound system. The ultrasound system has operational modes and the GUI has corresponding icons, tabs, and menu items image and information fields. The User Interface (UI) provides several types of graphical elements with intelligent behavior, such as being context sensitive and adaptive, called active objects, for example, tabs, menus, icons, windows of user interaction and data display and an alphanumeric keyboard. In addition the UI may also be voice activated. The UI further provides for a touchscreen for direct selection of displayed active objects. In an embodiment, the UI is for a medical ultrasound handheld imaging instrument. The UI provides a limited set of hard and soft keys with adaptive functionality that can be used with only one hand and potentially with only one thumb.

An interactive table has a display surface on which a physical object is disposed. A camera within the interactive table responds to infrared (IR) light reflected from the physical object enabling a location of the physical object on the display surface to be determined, so that the physical object appear part of a virtual environment displayed thereon. The physical object can be passive or active. An active object performs an active function, e.g., it can be self-propelled to move about on the display surface, or emit light or sound, or vibrate. The active object can be controlled by a user or the processor. The interactive table can project an image through a physical object on the display surface so the image appears part of the object. A virtual entity is preferably displayed at a position (and a size) to avoid visually interference with any physical object on the display surface.

We construct a systematic scheme of information concerning provenance among digital objects, make this information available to the user, and use it to modify the effect of user's actions. Such relationships are derived by comparison of elements in the files or by making records when creating them. This information may be displayed by a view of a descent tree, a flow diagram, or internal markup of a combined view of object content. The provenance structure enables selection of related subsets for search, constraints on search such as ‘root occurrence’ or ‘unmerged occurrences’, and selection of appropriate objects to merge or respond to. It defines the active set of objects for any chosen time, enabling a display of commonality and difference among versions at any stage of a project involving one or more collaborators, with or without one of them having final authority over the suggestions of the others. Applications include but are not limited to project flow management including bug reporting and correction, collaborative authoring (by document circulation or by wiki), enhanced chat, enhanced navigation among available objects, and retrieval of objects by following provenance pathways.

A computer implemented method, apparatus, and computer usable program code for creating a composite service. Dependencies are identified utilizing a set of active objects used to manage services to form identified dependencies in response to receiving a request for the composite service. The identified dependencies specify requirements of the composite service. The composite service has multiple components. Components are identified for the composite service using the identified dependencies to form identified components. The composite service is created using the identified components.

A dynamic content routing network routes update messages containing updates to properties of live objects from input sources to clients. The clients receive a web page having live objects, identify the object IDs associated with the objects, and contact an object state storage to obtain update messages specifying the objects'initial properties. The clients register the object IDs with the routing network. The routing network maintains a registry of object IDs and clients. The input source provides an update message to the routing network containing the object ID and data for updating a property of the object. The routing network routes update messages from the input source to the clients registered for the object ID contained in the message. Upon receipt of the message, a client updates the specified property of the live object. The update messages are also provided to, and stored by, the object state storage.

A system that performs real-time garbage collection by dynamically expanding and contracting the heap is provided. This system performs real-time garbage collection in that the system guarantees garbage collection will not take more time than expected. The system dynamically expands and contracts the heap to correspond to the actual memory space used by live objects. This dynamic resizing of the heap has the advantages of expanding when the amount of objects increases and contracting to free memory space for use by other procedures when the amount of objects decreases. Keeping the heap as small as possible frees resources for other processes and increases the locality of reference for the application. This dynamic resizing also ensures that the new memory space will not run out of memory before all of the live objects from the old memory space are copied, even if all of the live objects in the old memory space survive.

A data management system or “DMS” provides data services to data sources associated with a set of application host servers. The data management system typically comprises one or more regions, with each region having one or more clusters. A given cluster has one or more nodes that share storage. When providing continuous data protection and data distribution, the DMS nodes create distributed object storage to provide the necessary real-time data management services. The objects created by the DMS nodes are so-called active objects. The distributed object store can be built above raw storage devices, a traditional file system, a special purpose file system, a clustered file system, a database, and so on. According to the present invention, the DMS active object store provides an indexing service to the active objects. In an illustrative embodiment, any object property that has a given attribute is indexed and, as a result, the attribute becomes searchable. The DMS provides hierarchical distributed indexing using index trees to facilitate searching in a highly efficient manner.

The present mechanism provides a grammar for specifying required prerequisites (e.g., number and type of input parameters) that an object must possess in order for processing to occur on the object. The mechanism allows programmers and non-programmers to easily specify these prerequisites. The prerequisites may be associated directly or indirectly with a data structure. For a direct specification, the data structure comprises a parameter declaration for each expected input parameter. For an indirect specification, the data structure comprises a parameter definition that references an external description, such as in an XML document. The data structure also providing a mechanism that identifies a corresponding parameter within an input source for each expected input parameter based on its declaration. The input source does not include live objects. The mechanism further populates each expected input parameter with information associated with the corresponding parameter when the data structure becomes instantiated into an object.

Embodiments of the present invention address deficiencies of the art in respect to managing the scatter and flood problem of the activity-centric computing environment and provide a method, system and computer program product for sorting and filtering activities in an activity-centric computing environment. In one embodiment of the invention, a method for filtering and sorting activity objects in an activity-centric computing environment can include generating at least one activity thread of hierarchically arranged activity objects, selecting at least one filtering criterion for the activity objects, and filtering the activity objects in the activity threads. Additionally, a filtered view of the activity objects can be generated in an activity map in the activity-centric computing environment.

A dynamic content routing network routes update messages containing updates to properties of live objects from input sources to clients having the objects. Certain objects served to clients by a server are indicated as “live.” When the clients receive live objects, the clients identify the object IDs associated with the objects and register the object IDs with the routing network. The routing network maintains a registry of object IDs and clients. An input source provides an update message to the routing network containing the object ID and data specifying an update to a property of the object. The routing network routes the message to each client that has registered for the object ID contained in the message. Upon receipt of the message, a client updates the specified property of the live object.

A method of memory management can include creating an initial root set of pointers for a program during execution of the program and performing a marking process by iteratively marking referred objects of each pointer of the root set and expanding the root set with filtered, encoded pointers. The method also can include identifying each non-live object for any marked object as red-marked and performing, using a processor, a re-marking process on the root set in which red-marked objects are excluded. Each object of the root set not marked can be designated as including a memory leak.

A system for auto-sorting of lists based on most frequent component access or partner collaboration. The elements in the lists may represent collaboration partners (e.g. instant messaging contacts), and/or collaboration components such as Web addresses, events, collaborative documents, activity objects, and/or desktop applications. The system monitors component accesses and/or partner collaborations over a configurable time period to determine the frequency of collaborations with specific collaboration partners, and/or the frequency of accesses to collaboration components. The disclosed system then determines a set of collaboration partners and/or components that are most frequently collaborated with and/or accessed, and moves the list elements representing those collaboration partners and/or components into a top-located sub-list within a list of elements representing a larger number of collaboration partners and/or components in a user interface provided to a local user. The size of the top-located sub-list is user configurable, and the user may further indicate that certain collaboration partners and/or components are to be added to the sub-list, removed from the sub-list, always excluded from the sub-list, or always included in the sub-list. The local user may also be provided with a configurable set of alert notifications through the user interface communicating when collaboration partners and/or components have been added to and/or removed from the sub-list.

A system and method to perform a system-wide file system image without time smear in a distributed object-based data storage system. A realm manager is elected as an image master using the Distributed Consensus Algorithm to execute image-taking. All pending write capabilities are invalidated prior to taking the system-wide file system image so as to quiesce the realm and prepare the storage system for the system-wide image. Once the system is quiesced, the image master instructs each storage manager in the system to clone each live object group contained therein without explicitly cloning any objects contained in such object group. In one embodiment, a file manager copies an object in the system before a write operation is performed on that object after the image is taken. Neither the cloning operation nor the copying operation update any directory objects in the system. At run time, a client application may use a mapping scheme to access objects contained in the system-wide image.

A garbage collection process for managing a memory includes a defragmentation cycle. The garbage collection process is interleaved with a running application on a time-based or work-based schedule. The memory is divided into pages which are further divided into blocks falling into one of a number of block size classes. Objects that were not used during the last garbage collection phase are marked. Objects that were used are moved from pages containing the least live objects to pages containing the most live objects. Objects of the largest block size classes are moved first and objects of the smallest block size class are moved last. The garbage collection interval can be selected to satisfy desired CPU utilization or memory overhead requirements.

Methods and apparatus for enabling an efficient generational scavenging garbage collection to be performed on a managed memory area are disclosed. According to one aspect of the present invention, a method for reclaiming memory space uses a managed memory area that includes a first area and a second area. The first area is arranged to store recently allocated objects, while the second area being arranged to store older objects. The method includes determining when a first section of the first area in which new objects are to be allocated is substantially filled. When it is determined that the first section is substantially filled, a garbage collection is performed on a second section of the first. After the garbage collection, the second section is set to support new object allocation such that new objects are allocated in the second section, while the first section is reset such that it is no longer arranged to support new object allocation. In one embodiment, performing the garbage collection on the second section includes copying a live object from the second section into the second area.

A method (300) and apparatus (1000) for determining active objects contributing to a run of pixels corresponding to a scanline is disclosed. The method 300 utilizes two memory (1006) integer arrays (1101) and (1102) of size N, where N represents the number of objects in a job to be rendered. The first array (1101) is an active priority list and is preferably stored in memory (1006). The first array (1101) will be hereinafter referenced as the ‘active priority list (i.e. L[ ])’. The second array (1102) is an array of pointers (i.e. indexes) that indicate vacant memory 1006 locations in the active priority list (1101), when an object is deactivated. The second array (1102) will be hereinafter referred to as a ‘free list (F[ ])’ and is also preferably stored in memory (1006). The active priority list (1101) and free list (1102) can be stored at consecutive memory (1006) addresses (e.g. Memory address 0 to memory address 2N) or alternatively, the active priority list (1101) and free list (1102) can be stored in any suitable free memory (1006) locations.

A method, apparatus, and computer instructions for collecting data for analyzing memory leaks. A plurality of indicators are associated with a plurality of objects. The plurality of indicators are set to a first state. An indicator is set for each live object in the plurality of objects to a second state. In response to a request for the data, data is collected from all objects in the plurality of objects having indicators set to the first state.

A dynamic content routing network routes update messages containing updates to properties of live objects from input sources to clients. The clients receive a web page having live objects, identify the object IDs associated with the objects, and contact an object state storage to obtain update messages specifying the objects' initial properties. The clients register the object IDs with the routing network. The routing network maintains a registry of object IDs and clients. The input source provides an update message to the routing network containing the object ID and data for updating a property of the object. The routing network routes update messages from the input source to the clients registered for the object ID contained in the message. Upon receipt of the message, a client updates the specified property of the live object. The update messages are also provided to, and stored by, the object state storage.