424 results about "Distributed object" patented technology

A network storage system includes a virtual file system (“VFS”) that manages the files of the network storage system, and a storage center that stores the files. The VFS and the storage center are separated, such that a client accesses the VFS to conduct file system operations and the client accesses the storage center to upload / download files. The client accesses the network storage system through one or more storage ports. The storage center includes a plurality of distributed object storage managers (DOSMS) and a storage cluster that includes a plurality of intelligent storage nodes. The network storage system includes additional storage centers at geographically disparate locations. The network storage system uses a multi-cast protocol to maintain file information at the DOSMs regarding files stored in the intelligent storage nodes, including files stored in disparate storage centers.

A distributed object-oriented geospatial database system and method thereof over the Internet using Web-based technology to perform data-driven queries, such as retrieving, viewing and updating, geospatial data of the object oriented geospatial database, such as vector, raster, hypertext and multimedia data, including data types or formats of ESRI shape files, GSF, oceanographic ASCII text data by NAVOCEANO and geospatial data with temporal information and supporting 3D display of the geospatial data. The object-oriented geospatial database system is implemented in a heterogeneous object-oriented development and integration environment through the Common Object Request Broker Architecture (CORBA).

A system assures quality of service provided by a distributed network having at least one object. The system creates a contract that stores levels of quality of service offered by the network, determines a quality of service required by the object, and evaluates the contract to select a level of quality of service that corresponds to a current quality of service provided by the network. The system then compares the current quality of service to the required quality of service, and adjusts the current quality of service to obtain the required quality of service when the current quality of service fails to satisfy the required quality of service.

A control engine (12) downloaded by a server (1) to a student computer (2) instantiates panel objects (16) and multiple media objects (15) linked to each panel object (16). At any one time multiple media objects (15) operate simultaneously and in synchronism to generate multiple display and sound outputs for comprehensive learning output and student interaction. The media objects (15) operate autonomously, without even knowing their places in their respective hierarchies, thus allowing dynamic updates from the server (either server-driven or student-driven). Synchronization is achieved by the panel object activating the multiple relevant media objects for a panel and the media objects using time value attributes to control activation and termination times. The media objects access (84 )a stacking mechanism (82) in real time to determine a linked panel or media object to implement an operation in response to an event such as progression to a next panel. In addition to distributing objects in real time, the stacking mechanism (82) also dynamically modifies some objects by scripting or method invocation.

An improved system and method for flexible object placement and soft-state indexing of objects in a distributed object store is provided. A distributed object store may be provided by a large number of system nodes operably coupled to a network. A system node provided may include an access module for communicating with a client, an index module for building an index of a replicated data object, a data module for storing a data object on a computer readable medium, and a membership and routing module for detecting the configuration of operable nodes in the distributed system. Upon failure of an index node, the failure may be detected at other nodes, including those nodes that store the replicas of the object. These nodes may then send new index rebuilding requests to a different node that may rebuild the index for servicing any access request to the object.

Techniques for performing de-duplication for data blocks in a computer storage environment. At least one chunking / hashing unit receives input data from a source and processes it to output data blocks and content addresses for them. In one aspect, the chunking / hashing unit outputs all blocks without checking to see whether any is a duplicate of a block previously stored on the storage environment. In another aspect, each data block is processed by one of a plurality of distributed object addressable storage (OAS) devices that each is selected to process data blocks having content addresses with a particular range. The OAS devices determine whether each received data block is a duplicate of another previously stored on the computer storage environment, and when it is not, stores the data block.

The invention relates to an object-oriented control system for an appliance, configurable by a configuration mechanism in selective operable communication with a plurality of object oriented control systems using a packet protocol for constructing messages comprising identifiers from a plurality of namespaces associated with the building blocks of object-oriented systems. The meaning of each unique identifier within class library namespace is uniquely meaningful throughout a universe of appliances.

One embodiment of the present invention provides a distributed, differential electronic-data storage system that includes client computers, component data-storage systems, and a routing component. Client computers direct data objects to component data-storage systems within the distributed, differential electronic-data storage system. Component data-storage systems provide data storage for the distributed, differential electronic-data storage system. The routing component directs data objects, received from the clients computers, through logical bins to component data-storage systems by a compression-enhancing routing method.

A multi-user, elastic, on-demand, distributed relational database management system. The database is fragmented into distributed objects called atoms. Any change to a copy of an atom at one location is replicated to all other locations containing a copy of that atom. Transactional managers operate to satisfy the properties of atomicity, consistency, isolation and durability.

A distributed processing, interactive computer network and method of operation is described. The network is designed to provide very large numbers of simultaneous users access to large numbers of applications which feature interactive text / graphic sessions. The network includes one or more host computers having application data stores; a plurality of concentrator computers, also including application data stores, the concentrator computers being connected in groups of one of more to each of the host computers; and a plurality of reception system computers connected in groups of one or more to each of the concentrator computers, the reception system computers being arranged so that respective users can request interactive applications at the reception system computers. In accordance with the design, the reception system computers also include application data stores. The method for operating the network includes steps for generating the interactive text / graphic sessions from objects that include data and / or program instructions. Additionally, the method features steps for distributing objects among the data stores of the network computers, and, thereafter, permitting the reception system computer at which an application is requested to selectively collect objects required for the application from the network and the respective reception system so that the requested application may be presented at the reception system based on the objects collected. This operation decreases processing demand on the higher-level network elements, permitting them to function primarily as data supply and maintenance resources, thereby reducing network complexity, cost and response time.

It will be well known that a so-called object-oriented approach to computer programming has become widespread over the past few years and applications such as large multiplayer games are no exception. A number of approaches to allowing objects to communicate with one another have been developed. One set of these approaches relate to allowing so-called distributed objects, which is to say objects distributed over a client / server system, to communicate with one another. With reference to applications such as large multiplayer games, dynamic real time distributed communications between mobile objects must be considered. Present day techniques, involving the use of simple TCP / IP or UDP / IP, CORBA or DCOM are unable to provide such real time dynamic performance. According to one aspect of the invention a method of providing communication between two or more application software elements is provided comprising associating each application software element with a communication software element through which to send and / or receive messages, holding the communication state of the associated application software element in each communication software element, allowing each application software element to communicate with other application software elements by sending and receiving messages through the respectively associated communication software elements and allowing each application software element and associated communication software element to move. Holding the communication state in the communication software element associated with each application software element allows the application software element and communication software element assembly to communicate and move in particularly dynamic fashion. Messaging consequently enabled, carried out on a per software element basis, allows for continuity of communication between objects even if they move in a dynamic fashion.

A simulator machine obtains IDL information from an IDL definition storage, and automatically builds up a function of a server application or a client application based on the IDL information obtained. The simulator machine is connected to a WWW server that is one of nodes. Each of the rest of the nodes can access the WWW server by starting a WWW Browser thereby to build up on its own node a function of a server simulator or a client simulator that is provided by the simulator machine.

The present invention relates to a distributed object storage system that supports snapshots and clones without requiring any form of distributed locking—or any form of centralized processing. A clone tree can be modified in isolation and the modifications then either discarded or merged into the main tree of the distributed object storage system.

A Spontaneous Area Network (SPAN) is formed by mobile and fixed nodes using wireless transmission links between nodes, usually in a nearby geographical area. Applications allow users to create, join, leave, and manage SPANs and groups in a SPAN. Automatic procedures allow nodes to join other SPANs. Transmission power of the wireless network interface is dynamic, varying depending on battery level, type of information to transmit, state and topology of the network. A delay tolerant object layer abstraction creates, modifies, deletes, publishes, and handles Delay Tolerant Distributed Objects (DTDOs). A Patient Transport Protocol (PTP) ensures a reliable transport of information through the network while avoiding congestion conditions. An aggressive and explosive network protocol (AGENET) has routing and forwarding capacities and uses datagrams to establish communication between different nodes of the SPAN. Cooperation and diversity are exploited to react to node mobility that causes frequent changes in network topology and disconnections.

A distributed object-based storage system and method includes a plurality of object storage devices for storing object components, a metadata server coupled to each of the object storage devices, and one or more clients that access distributed, object-based files on the object storage devices. A file object having multiple components on different object storage devices is accessed by issuing a file access request from a client to an object storage device for a file object. In response to the file access request, a map is located that includes a list of object storage devices where components of the requested file object reside. The map is stored as at least one component object attribute on an object storage device. The map is sent to the client which retrieves the components of the requested file object by issuing access requests to each of the object storage devices on the list.

A method and a system for accessing services provided by network resources in communication networks. Access to service capabilities is controlled at the application level by controlling the access through a gateway wherein an object-oriented service architecture based on abstracted application programming interfaces is implemented. Preferably, the service architecture is defined in OSA / Parlay standards. Access control is carried out by means of a logical entity, the service reference monitor, which is linked to the gateway and configured so that it intercepts all the communications passing between the client applications and the gateway. The service reference monitor captures the object reference to the service capability and assigns to the object reference a lifetime. At the expiration of the lifetime, the service reference monitor destroys the service capability. The probability of a malicious attack is lowered by limiting the time window of the life of access to a service.

A distributed object execution system delegates the allocation and control of computing tasks to intelligent agent applications running on computing resources. User applications can invoke object methods associated with an application interface of the distributed object execution system. The system converts this method invocation into an available computing job with at least one computing tasks. The agents assess computing resources capabilities to perform available computing tasks. Based on these assessments, agents request jobs from a job server, which in turn assigns computing tasks to computing resources based on the job requests received. An agent instantiates a replica of the object and invokes a corresponding method on an associated computing resource. Upon completion of the invoked method, the user application is notified and provided with any method results. While an agent and associated computing resource is processing a method invocation, the user application can perform other activities.

A batch component model is provided within a distributed object environment. The batch component is designed to capture the iterative logic of a batch program as it reads from one or more input streams, invokes operations on other business component functions, and generates output to one or more output streams. Deployment descriptors express declarative policies for the component that will influence how the component is managed including the streams it uses, business components it depends on, how processing costs are accounted for, the resource demands the job will put on the system, and the like. Input streams and output streams are encapsulated in objects that hide the actual source of input and output data so that the component can be redeployed in different execution environments to different physical data sources without requiring the program to be changed. A batch container enforces the deployment policies declared for the batch component.

Methods, apparatus, and business techniques are disclosed for use in distributed communication systems comprising a plurality of communication protocols. In one embodiment a first air interface is used to initiate communication between a wireless client and a remote server at least partially using a first wireless access point. The server sends the wireless client a stub of a distributed object. The stub is used to instantiate an object class. The object class defines an interface that the remote client can use to communicate with the remote server using an upper layer interface. The distributed object stub also provides an implementation of a software radio configuration for a set of lower protocol layers in a second air interface. The wireless client can thereby communicate with a second wireless access point using said second air interface protocol. Exemplary embodiments of the present invention are disclosed that focus on toll-tag and electronic-commerce related highway systems, distributed federated wireless access systems, and wide area wireless system capacity augmentation.

The software system of the present invention is a distributed object oriented software system that it is customizable and flexible enough to implement a wide variety of different "business logics" without the need to rewrite the basic components of the software system because it provides scripting capability in a distributed object-oriented software system. The present invention includes a rules-based scripting language that can be interpreted by a Rules Engine that is part of the base class of component for the software system. In accordance with the present invention each individual component of the software system may have one or more predetermined rule sets defined for it. Each predetermined rule set allows customization of the behavior of the associated component of the software system.

A system and method related for performing lookup operations for objects distributed among different nodes in a peer-to-peer network are disclosed. Various nodes in the peer-to-peer network may store objects. Objects stored on a given node may be accessed by other nodes in the peer-to-peer network. To access an object, a node may first perform a lookup operation to determine where the object is stored, i.e., to determine which node in the peer-to-peer network stores the object. The peer-to-peer network may utilize a method to improve the performance of object lookup operations. In one embodiment, the method may allow object lookup operations to be performed with a latency on the order of one hop.

In one embodiment of the present invention, a graphics processing unit (GPU) is configured to detect an object in an image using a random forest classifier that includes multiple, identically structured decision trees. Notably, the application of each of the decision trees is independent of the application of the other decision trees. In operation, the GPU partitions the image into subsets of pixels, and associates an execution thread with each of the pixels in the subset of pixels. The GPU then causes each of the execution threads to apply the random forest classifier to the associated pixel, thereby determining a likelihood that the pixel corresponds to the object. Advantageously, such a distributed approach to object detection more fully leverages the parallel architecture of the PPU than conventional approaches. In particular, the PPU performs object detection more efficiently using the random forest classifier than using a cascaded classifier.

A method of distributing objects, having a random distribution of weights, according to their weights. In the method, the presence of one of the objects is detected, the detected object is grasped by a robot, and the object grasped is weighed by a sensor. The weight measured is associated with the object and stored. The process is repeated for the objects. The weight distribution obtained from the weights measured is used in filling containers with objects so that containers are optimally filled.

A distributed active knowledge and process base incorporates multiple Distributed Object Technology Systems (DOTS) connected over a network, the Internet, or wireless media to allow multiple types of data, processes, and services (system elements) to be created and modified within the same collaborative framework, and thereby permits data to be appropriately mapped to said processes, provides and updates periodically knowledge about available system elements and their values, allows separate systems to negotiate multiple forms of collaboration, and contains sufficiently flexible levels of data security in order to foster online collaboration.

A collision detection and data synchronization mechanism operates to expand the speed and capability of distributed applications. The execution environment employs collision detection and data synchronization to distribute data objects to appropriate network nodes to support local processing. The collision detection and data synchronization mechanism defines the set of processes and algorithms used to track distributed data objects and to manage changes to the distributed objects throughout a network of intelligent computing devices. Data and code are distributed to local computing devices necessitating tracking and synchronizing updates. The system and method ensures that data updates received during the course of a local transaction do not unwillingly affect the results of other transactions by notifying the local computing devices of changes to the data that are subject of the transaction. These conflicts are then resolved in the applications, and notification of the resolution is sent to the remaining intelligent computing devices.