Making the Distribution Subsystem Secure

This report presents how the Distribution Subsystem is made secure. A set of different security threats to a shared data programming system are identifed. The report presents the extensions nessesary to the DSS in order to cope with the identified security threats by maintaining reference security. A reference to a shared data structure cannot be forged or guessed; only by proper delegation can a thread acquire access to data originating at remote processes. Referential security is a requirement for secure distributed applications. By programmatically restricting access to distributed data to trusted nodes, a distributed application can be made secure. However, for this to be true, referential security must be supported on the level of the implementation

Salient Objects in Clutter: Bringing Salient Object Detection to the Foreground

We provide a comprehensive evaluation of salient object detection (SOD) models. Our analysis identifies a serious design bias of existing SOD datasets which assumes that each image contains at least one clearly outstanding salient object in low clutter. The design bias has led to a saturated high performance for state-of-the-art SOD models when evaluated on existing datasets. The models, however, still perform far from being satisfactory when applied to real-world daily scenes. Based on our analyses, we first identify 7 crucial aspects that a comprehensive and balanced dataset should fulfill. Then, we propose a new high quality dataset and update the previous saliency benchmark. Specifically, our SOC (Salient Objects in Clutter) dataset, includes images with salient and non-salient objects from daily object categories. Beyond object category annotations, each salient image is accompanied by attributes that reflect common challenges in real-world scenes. Finally, we report attribute-based performance assessment on our dataset.Comment: ECCV 201

Damage identification in structural health monitoring: a brief review from its implementation to the Use of data-driven applications

The damage identification process provides relevant information about the current state of a structure under inspection, and it can be approached from two different points of view. The first approach uses data-driven algorithms, which are usually associated with the collection of data using sensors. Data are subsequently processed and analyzed. The second approach uses models to analyze information about the structure. In the latter case, the overall performance of the approach is associated with the accuracy of the model and the information that is used to define it. Although both approaches are widely used, data-driven algorithms are preferred in most cases because they afford the ability to analyze data acquired from sensors and to provide a real-time solution for decision making; however, these approaches involve high-performance processors due to the high computational cost. As a contribution to the researchers working with data-driven algorithms and applications, this work presents a brief review of data-driven algorithms for damage identification in structural health-monitoring applications. This review covers damage detection, localization, classification, extension, and prognosis, as well as the development of smart structures. The literature is systematically reviewed according to the natural steps of a structural health-monitoring system. This review also includes information on the types of sensors used as well as on the development of data-driven algorithms for damage identification.Peer ReviewedPostprint (published version

Simulation and optimization in production planning: A case study (Version 2)

Management Information Systems;Production;produktieleer/ produktieplanning

Pointing a ground antenna at a spinning spacecraft using Conscan-simulation results

The results are presented for an investigation of ground antenna pointing errors which are caused by fluctuations of the receiver AGC signal due to thermal noise and a spinning spacecraft. Transient responses and steady-state errors and losses are estimated using models of the digital Conscan (conical scan) loop, the FFT, and antenna characteristics. Simulation results are given for the on-going Voyager mission and for the upcoming Galileo mission, which includes a spinning spacecraft. The simulation predicts a 1 sigma pointing error of 0.5 to 2.0 mdeg for Voyager, assuming an AGC loop SNR of 35 to 30 dB with a scan period varying from 128 to 32 sec, respectively. This prediction is in agreement with the DSS 14 antenna Conscan performance of 1.7 mdeg for 32 sec scans as reported in earlier studies. The simulation of Galileo predicts 1 mdeg error with a 128 sec scan and 4 mdeg with a 32 sec scan under similar AGC conditions

Fast Lean Erasure-Coded Atomic Memory Object

In this work, we propose FLECKS, an algorithm which implements atomic memory objects in a multi-writer multi-reader (MWMR) setting in asynchronous networks and server failures. FLECKS substantially reduces storage and communication costs over its replication-based counterparts by employing erasure-codes. FLECKS outperforms the previously proposed algorithms in terms of the metrics that to deliver good performance such as storage cost per object, communication cost a high fault-tolerance of clients and servers, guaranteed liveness of operation, and a given number of communication rounds per operation, etc. We provide proofs for liveness and atomicity properties of FLECKS and derive worst-case latency bounds for the operations. We implemented and deployed FLECKS in cloud-based clusters and demonstrate that FLECKS has substantially lower storage and bandwidth costs, and significantly lower latency of operations than the replication-based mechanisms

A deep, wide-field search for substellar members in NGC 2264

We report the first results of our ongoing campaign to discover the first brown dwarfs (BD) in NGC 2264, a young (3 Myr), populous star forming region for which our optical studies have revealed a very high density of potential candidates - 236 in $<$ 1 deg$^2$ - from the substellar limit down to at least $\sim$ 20 M$_{\rm Jup}$ for zero reddening. Candidate BD were first selected using wide field ($I,z$) band imaging with CFH12K, by reference to current theoretical isochrones. Subsequently, 79 (33%) of the $I,z$ sample were found to have near-infrared 2MASS photometry ($JHK_s$ $\pm$ 0.3 mag. or better), yielding dereddened magnitudes and allowing further investigation by comparison with the location of NextGen and DUSTY isochrones in colour-colour and colour-magnitude diagrams involving various combinations of $I$,$J$,$H$ and $K_s$. We discuss the status and potential substellarity of a number of relatively unreddened (A$_{\rm v}$ $<$ 5) likely low-mass members in our sample, but in spite of the depth of our observations in $I,z$, we are as yet unable to unambiguously identify substellar candidates using only 2MASS data. Nevertheless, there are excellent arguments for considering two faint (observed $I$ $\sim$ 18.4 and 21.2) objects as cluster candidates with masses respectively at or rather below the hydrogen burning limit. More current candidates could be proven to be cluster members with masses around 0.1 M$_{\odot}$ {\it via} gravity-sensitive spectroscopy, and deeper near-infrared imaging will surely reveal a hitherto unknown population of young brown dwarfs in this region, accessible to the next generation of deep near-infrared surveys.Comment: 10 pages, 12 figures, accepted by A&