Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 8,270 papers for “object sharing”

Interlanguage object sharing with SOM

Jennifer Hamilton · 1996

Object-oriented programming languages may encourage reuse at the source code level, but they inhibit reuse at the binary object level. Differences in object representation make it much more difficult to share objects, even across different implementations of the C++ language, than to share libraries between different procedural languages such as C and Fortran. IBM has addressed this problem through the System Object Model (SOM). The purpose of this paper is to provide a brief description of the SOM and the mapping from SOM to the object models of several languages: C++, Smalltalk, OO COBOL, and to discuss how binary object interoperability can be achieved through SOM.

Cited by 6

Object Sharing Over Mobile Devices

Sharad Agarwal, Ioannis Mavroidis, Alec Woo · 1999

With the advent of hand-held computing devices, the need for collaborative applications has become more urgent. In order to allow for the design of collaborative applications, a common infrastructure for the sharing of data is required for mobile devices. Such an infrastructure should be built for devices that have low compute capabilities and have low bandwidth, high latency network connections. The infrastructure should also allow for such devices to periodically disconnect from the network and reconnect, as is typical of the use of hand-held computing devices. Typical software implementations of distributed shared memory are not suitable for mobile devices. Thus this study implements and explores a software based shared object system for

Cited by 0

DIVVALA et al.: OBJECT INSTANCE SHARING 1 Object Instance Sharing by Enhanced Bounding Box Correspondence

Santosh K. Divvala, Alexei A. Efros, Martial Hebert · 2013

Most contemporary object detection approaches assume each object instance in the training data to be uniquely represented by a single bounding box. In this paper, we go beyond this conventional view by allowing an object instance to be described by multiple bounding boxes. The new bounding box annotations are determined based on the alignment of an object instance with the other training instances in the dataset. Our proposal enables the training data to be reused multiple times for training richer multi-component category models. We operationalize this idea by two complementary operations: bounding box shrinking, which finds subregions of an object instance that could be shared; and bounding box enlarging, which enlarges object instances to include local contextual cues. We empirically validate our approach on the PASCAL VOC detection dataset. 1

Cited by 0

Secret Sharing for Object Structure Data

Wen‐Pinn Fang · 2010

Summary This paper proposed a secure sharing method for object structure data. Based on the secret sharing scheme, a safe, fault tolerance method for transmission and store object structure data is achieved. Different from traditional transmission method, the method of this paper is not only easy to manage critical data but also have all advantages.

Cited by 0

An Approach To Safe Object Sharing

Chrislain Razafimahefa · 2000

It is essential for security to be able to isolate mistrusting programs from one another, and to protect the host platform from programs. Isolation is difficult in object-oriented systems because objects can easily become aliased. Aliases that cross program boundaries can allow programs to exchange information without using a system provided interface that could control information exchange. In Java, mistrusting programs are placed in distinct loader spaces but uncontrolled sharing of system classes can still lead to aliases between programs. This paper presents the object spaces protection model for an object-oriented system. The model decomposes an application into a set of spaces, and each object is assigned to one space. All method calls between objects in different spaces are mediated by a security policy. An implementation of the model in Java is presented. 1

Cited by 0

An approach to safe object sharing

Ciarán Bryce, Chrislain Razafimahefa · 2000

It is essential for security to be able to isolate mistrusting programs from one another, and to protect the host platform from programs. Isolation is difficult in object-oriented systems because objects can easily become aliased. Aliases that cross program boundaries can allow programs to exchange information without using a system provided interface that could control information exchange. In Java, mistrusting programs are placed in distinct loader spaces but uncontrolled sharing of system classes can still lead to aliases between programs. This paper presents the object spaces protection model for an object-oriented system. The model decomposes an application into a set of spaces, and each object is assigned to one space. All method calls between objects in different spaces are mediated by a security policy. An implementation of the model in Java is presented.

Cited by 28

An Approach to Safe Object Sharing

Ciar'an Bryce Chrislain, Chrislain Razafimahefa · 2000

It is essential for security to be able to isolate mistrusting programs from one another, and to protect the host platform from programs. Isolation is difficult in object-oriented systems because objects can easily become aliased. Aliases that cross program boundaries can allow programs to exchange information without using a system provided interface that could control information exchange. In Java, mistrusting programs are placed in distinct loader spaces but uncontrolled sharing of system classes can still lead to aliases between programs. This paper presents the object spaces protection model for an object-oriented system. The model decomposes an application into a set of spaces, and each object is assigned to one space. All method calls between objects in different spaces are mediated by a security policy. An implementation of the model in Java is presented. KEYWORDS Protection domains, access control, aliasing, sharing, Java. 1 Introduction In the age of Internet programming,...

Cited by 0

Secure Object Sharing on Java Card

Jang, Syeng Ho · SHAREOK (University of Oklahoma; Oklahoma State University; Central Oklahoma University) · 2014

This research concerns enhancement in on-card verification of downloaded applets in Java Card technology. In this thesis, we propose the on-card installer with a one-way hash function to support on-card verification of download applets. The hash value generated from the on0card installer is used to verify download applets hwyn they try to gain a SIO from a server applet. This thesis is organized into five chapters and an appendix. Chapter 1, Introduction, depicts the background of Java Card technology, the current problem in the Java Card platform, and the objectives of this research. Chapter 2, Literature Review, introduces fundamental concepts and background knowledge on Smart Card, Java Card, and message digest algorithms. Chapter 3, Secure Object Sharing, presents solution to meet the objectives. Chapter 4, Secure Object Sharing Simulation, simulates the object sharing process between a server applet and a client applet. Chapter 5, Conclusion, draws a conclusion ofenhancement in on-card verification of downloaded applets. Appendix presents source codes that are used for the simulation.

Cited by 0

Simple Shared Object - An Architectural Pattern for Simple Object Sharing

Robert Ott · 1996

This paper describes a pattern for object sharing across different address spaces. The pattern is intended for applications where collaborators on clients across a network work closely together. The Simple Shared Object pattern allows distributed applications to create, modify and delete shared objects on a corresponding server. The clients have copies of shared objects they use in their own address spaces. All modifications made to the primary copies on the server are propagated to clients having copies in their address spaces. The pattern is not designed for high traffic communication between concurrent running applications. Rather, it is designed for applications where some objects have to be shared across a network and where shared objects have to be synchronised and informed whenever a shared object changes. 1 Intent The Simple Shared Object pattern allows object sharing across networks. The primary instance of a shared object will exist in the address space of a server program; ...

Cited by 0

Real-time object sharing with minimal support

Srikanth Ramamurthy, Mark Moir, James H. Anderson · 1996

We show that, for a large class of hard real-time systems, any object with consensus number P in Herlihy's wait-free hierarchy isuniversal for any number of tasks executing on P processors. These results exploit characteristics of priority-based schedulers common to most hard real-time systems. An important special case of this result is that, for hard real-time applications on uniprocessors, reads and writes are universal. Thus, Herlihy's hierarchy collapses for such applications. 1

Cited by 0

Object-level Perception Sharing Among Connected Vehicles

Moreno Ambrosin, Ignacio Álvarez, Cornelius Buerkle et al. · 2019

Advances in vehicular communication technologies have made Connected Vehicles (CVs) a near-term reality. Compared to models where vehicles rely solely on their own perception to sense and make decision on the environment, CVs have the potential to allow information sharing among vehicles to improve sensing and decision making collectively. A first concrete step towards this goal is enabling vehicles to share perception-related information, to overcome limitations of their respective sensors (e.g., partial awareness due to occlusions). Sharing processed information vs raw sensor data has the advantage of reducing the amount of data to be transmitted, and the required computation burden at the receiver side.This paper proposes an approach to enable object-level sharing among vehicles. Following state-of-the-art object-level management techniques, we developed a two-layer architecture that handles object tracking and fusion from dynamic remote sources of information. We implemented our approach and showed that it can achieve realistic performance, and robustness both in terms of quality of information and computation.

Cited by 28

Sharing composite objects in object-oriented databases

João Henrique dos Santos [UNESP] Ferreira · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 1996

Este trabalho apresenta uma proposta para o compartilhamento de dados entre bases de dados orientadas a objetos, em ambientes de desenvolvimento de projetos. O processo de compartilhamento e realizado através de três fases: separação, evolução e integração de dados. Esta forma de compartilhamento atua através de vínculos entre os objetos de base original com a base produto. Foram definidos seis tipos de vínculos, que são estabelecidos no processo de separação: apenas leitura, isolado, flagrante, mutuamente exclusivo, independente e on-line. Com isso, ambas as bases, respeitando as limitações impostas pelo tipo de vinculo entre as mesmas, podem evoluir separadamente e depois de um determinado tempo realizarem, se conveniente, um processo de reintegração. O processo de compartilhamento de dados tem por unidade de gerenciamento os objetos, compostos de base de dados. Os conceitos apresentados podem ser universalmente aplicados, em qualquer base de dados que efetue gerenciamento sobre a composição de seus objetos. Neste trabalho os conceitos de compartilhamento de dados são exemplificados através do modelo de dados SIRIUS.

Cited by 0

Efficient Object Sharing in Shared-Memory Multiprocessors

Mark Moir · 1996

The goal of this work is to facilitate efficient use of concurrent shared objects in asynchronous, shared-memory multiprocessors. Shared objects are usually implemented using locks in such systems. However, lock-based implementations result in substantial inefficiency in multiprogrammed systems, where processes are frequently subject to delays due to preemption. This inefficiency arises because processes can be delayed while holding a lock, thereby delaying other processes that require the lock. In contrast, lock-free and wait-free implementations guarantee that the delay of one process will not delay another process. We show that lock-free and wait-free implementations for shared objects provide a viable alternative to lock-based ones, and that they can provide a significant performance advantage over lock-based implementations in multiprogrammed systems. Lock-free and wait-free implementations are notoriously difficult to design and to verify as correct. Universal constructions alleviate this problem by generating lock-free and wait-free shared object implementations using sequential implementations. However, previous universal constructions either require significant creative effort on the part of the programmer for each object, or result in objects that have high space and time overhead due to excessive copying. We present lock-free and wait-free universal constructions that achieve low space and time overhead for a wide spectrum of important objects, while not placing any extra burden on the object programmer. We also show that the space and time overhead of these

Cited by 0