Object (computer science)

About: Object (computer science) is a research topic. Over the lifetime, 106024 publications have been published within this topic receiving 1360115 citations. The topic is also known as: obj & Rq.

Method and system for in-place interaction with contained objects

Abstract: A computer method and system for interacting with a containee object contained within a container object. In a preferred embodiment of the present invention, the container object has a container application with a container window environment that has container resources for interacting with the container object. The containee object has a server application with a server window environment with server resources for interacting with the containee object. The method of the present invention displays the container window environment on a display device. A user then selects the containee object. In response to selecting the containee object, the method integrates a plurality of the server resources with the displayed container window environment. When a user then selects a server resource, the method invokes the server application to process the server resource selection. Conversely, when a user selects a container resource, the method invokes the container application to process the container resource selection.

Dynamic rule-based version control system

Abstract: A data processing system and method for controlling versions of data, features a processor, a storage device for storing versions of objects, and an object version selector for providing the processor with access only to specific versions of target data objects as determined by a set of selection rules. The selection rules are evaluated for an object when that object is accessed by the processor. The version selector includes a means for viewing the selected versions of the target objects as a transparent file system having directories, files, and links. The version selector applies the existing version selection rules to newly created objects, and can also store the identity of a selected object version in a cache memory. The version selection rules include a rule for selecting that version of an object that was the most recent version of that object at a specific time in the past, and a rule for selecting that version of an object that was the most recent version of that object at the specific time that a process requiring that object began. The time that the process began is adjusted to compensate for time skew among the storage devices storing the required objects. The process includes a system build.

Sparse R-CNN: End-to-End Object Detection with Learnable Proposals

Abstract: We present Sparse R-CNN, a purely sparse method for object detection in images. Existing works on object detection heavily rely on dense object candidates, such as $k$ anchor boxes pre-defined on all grids of image feature map of size $H\times W$. In our method, however, a fixed sparse set of learned object proposals, total length of $N$, are provided to object recognition head to perform classification and location. By eliminating $HWk$ (up to hundreds of thousands) hand-designed object candidates to $N$ (e.g. 100) learnable proposals, Sparse R-CNN completely avoids all efforts related to object candidates design and many-to-one label assignment. More importantly, final predictions are directly output without non-maximum suppression post-procedure. Sparse R-CNN demonstrates accuracy, run-time and training convergence performance on par with the well-established detector baselines on the challenging COCO dataset, e.g., achieving 45.0 AP in standard $3\times$ training schedule and running at 22 fps using ResNet-50 FPN model. We hope our work could inspire re-thinking the convention of dense prior in object detectors. The code is available at: https://github.com/PeizeSun/SparseR-CNN.

Home automation system

Abstract: A home automation system comprises a number of sub-systems for controlling various aspects of a house, such as a security sub-system, an HVAC sub-system, a lighting control sub-system, and an entertainment sub-system. The network comprises a host computer connected through a host interface to a plurality of nodes. The network is in a free form topology and employ asynchronous communication. The host computer polls each node on the network to determine system configuration and to perform a diagnostic check on the system. The messages that are transmitted between the nodes are comprised of a source address, a destination address that uniquely identifies the location of each piece of hardware on the system, a message type field, and a data length segment. Each hardware device has a mirror image software object in the host computer to which messages are directed. The user interfaces for the various sub-systems share a common interfacing method whereby use of the system is greatly simplified.

Naming and synchronization in a decentralized computer system

Abstract: In this dissertation a new approach to the synchronization of accesses to shared data objects is developed. Traditional approaches to the synchronization problems of shared data accessed by concurrently running computations have relied on mutual exclusion -- the ability of one computation to stop the execution of other computations that might access or change shared data accessed by that computation. Our approach is quite different. We regard an object that is modifiable as a sequence of immutable versions; each version is the state of the object after an update is made to the object. Synchronization can then be treated as a mechanism for naming versions to be read and for defining where in the sequence of versions the version resulting from some update should be placed. In systems based on mutual exclusion, the timing of accesses selects the versions accessed. In the system developed here, called NAMOS, versions have two component names consisting of the name of an object and a pseudo-time, the name of the system state to which the version belongs. By giving programs control over the pseudo-time in which an access is made, synchronization of access to multiple objects is simplified. NAMOS is intended to be used in an environment where unreliable components, such as communication lines and processors, and autonomous control of resources occasionally cause certain objects to become inaccessible, perhaps in the middle of an atomic transaction. Computations may also suddenly halt (perhaps as the result of a system crash) never to be restarted. NAMOS provides facilities for recovering from such sudden failures, grouping updates into sets called possibilities, such that failure of any update belonging to a possibility prevents all of the other updates in the possibility. The naming mechanism of NAMOS also provides a useful tool for restoring a consistent state of the system after a failure resulting in irrecoverable loss of information or a user mistake resulting in an inconsistent state. An important motivation for the development of NAMOS is the need to support decentralized development of application systems by combining existing application systems that deal with shared data. NAMOS supports the construction of modules that locally ensure their own correct synchronization and recovery from inaccessibility. Larger modules that use several separately designed modules can then be constructed, perhaps with additional synchronization constraints, without modifying the modules used. In most systems based on mutual exclusion, such post hoc integration of modules is difficult or impossible.