Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Distributed object computing platforms
Date
1998-09-01
Author
Doğaç, Asuman
Dengi, C
Oszu, MT
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
31
views
0
downloads
Cite This
Subject Keywords
General Computer Science
URI
https://hdl.handle.net/11511/62821
Journal
COMMUNICATIONS OF THE ACM
DOI
https://doi.org/10.1145/285070.285087
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Parallel Scalable PDE Constrained Optimization Antenna Identification in Hyperthermia Cancer Treatment Planning
SCHENK, Olaf; Manguoğlu, Murat; CHRİSTEN, Matthias; SATHE, Madan (Springer Science and Business Media LLC, 2009-01-01)
We present a PDE-constrained optimization algorithm which is designed for parallel scalability on distributed-memory architectures with thousands of cores. The method is based on a line-search interior-point algorithm for large-scale continuous optimization, it is matrix-free in that it does not require the factorization of derivative matrices. Instead, it uses a new parallel and robust iterative linear solver on distributed-memory architectures. We will show almost linear parallel scalability results for t...
Joint Utilization of Appearance, Geometry and Chance for Scene Logo Retrieval
Soysal, Medeni; Alatan, Abdullah Aydın (Oxford University Press (OUP), 2011-07-01)
A novel approach involving the comparison of appearance and geometrical similarity of local patterns via a combined description is presented. Candidate groups of interest points are identified based on unlikeliness of being matched by chance. For each of the keypoints in these groups, a novel description is proposed. This description utilizes quantized appearance descriptors of interest points to avoid the necessity of matching each test descriptor to each template descriptor. Additionally, one-to-many matc...
On-demand conversation customization for services in large smart environments
Elgedawy, I. (IBM, 2011-01-01)
Services in large smart environments, as defined in this paper, are "aware" of their users' contexts and goals and are able to automatically interact with one another in order to achieve these goals. Unfortunately, interactions between services (i.e., service conversations) are not necessarily compatible, as services could have different interfaces (i.e., signature incompatibilities), as well as different logic for message ordering (i.e., protocol incompatibilities). Such conversation incompatibilities crea...
A Depth-optimal Low-complexity Distributed Wireless Multicast Algorithm
Akyurek, A. Sinan; Uysal, Elif (Oxford University Press (OUP), 2011-06-01)
This paper presents a wireless multicast tree construction algorithm, SWIM (Source-initiated WIreless Multicast). SWIM constructs a tree on which each multicast destination has the minimum possible depth (number of hops from the nearest source). It is proved that SWIM is fully distributed, with a worst case complexity upper-bounded by O(N-3), and an empirically found average complexity of only O(N-2). SWIM forms one shared tree from source(s) to the multicast destinations; yet, as a by-product, it creates a...
SIMULATION CONCEPTS FOR INFORMATION-SYSTEM
MOURANT, RR; Tarı, Zehra Sibel (Elsevier BV, 1993-09-01)
Recent Improvements in document image systems and their low-cost implementation on networks of microcomputers is leading to the reengineering of many information systems. We describe how document image systems can be applied to information systems. In order to compare the performance of a conventional information system with one implemented with document imaging processing capability we conducted a discrete event simulation. We modeled the conventional information system for processing graduate student ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Doğaç, C. Dengi, and M. Oszu, “Distributed object computing platforms,”
COMMUNICATIONS OF THE ACM
, pp. 95–103, 1998, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/62821.