A kernel-based framework for image collection exploration

While search engines have been a successful tool to search text information, image search systems still face challenges. The keyword-based query paradigm used to search in image collection systems, which has been successful in text retrieval, may not be useful in scenarios where the user does not have the precise way to express a visual query. Image collection exploration is a new paradigm where users interact with the image collection to discover useful and relevant pictures. This paper proposes a framework for the construction of an image collection exploration system based on kernel methods, which offers a mathematically strong basis to address each stage of an image collection exploration system: image representation, summarization, visualization and interaction. In particular, our approach emphasizes a semantic representation of images using kernel functions, which can be seamlessly harnessed across all system components. Experiments were conducted with real users to verify the effectiveness and efficiency of the proposed strategy.     

Multi-target tracking on confidence maps: An application to people tracking

We propose a generic online multi-target track-before-detect (MT-TBD) that is applicable on confidence maps used as observations. The proposed tracker is based on particle filtering and automatically initializes tracks. The main novelty is the inclusion of the target ID in the particle state, enabling the algorithm to deal with unknown and large number of targets. To overcome the problem of mixing IDs of targets close to each other, we propose a probabilistic model of target birth and death based on a Markov Random Field (MRF) applied to the particle IDs. Each particle ID is managed using the information carried by neighboring particles. The assignment of the IDs to the targets is performed using Mean-Shift clustering and supported by a Gaussian Mixture Model. We also show that the computational complexity of MT-TBD is proportional only to the number of particles. To compare our method with recent state-of-the-art works, we include a postprocessing stage suited for multi-person tracking. We validate the method on real-world and crowded scenarios, and demonstrate its robustness in scenes presenting different perspective views and targets very close to each other.     

Constructed wetland as a low cost and sustainable solution for wastewater treatment adapted to rural settlements: the Chorfech wastewater treatment pilot plant

The paper presents the detailed design and some preliminary results obtained from a study regarding a wastewater treatment pilot plant (WWTPP), serving as a multistage constructed wetland (CW) located at the rural settlement of 'Chorfech 24' (Tunisia). The WWTPP implemented at Chorfech 24 is mainly designed as a demonstration of sustainable water management solutions (low-cost wastewater treatment), in order to prove the efficiency of these solutions working under real Tunisian conditions and ultimately allow the further spreading of the demonstrated techniques. The pilot activity also aims to help gain experience with the implemented techniques and to improve them when necessary to be recommended for wide application in rural settlements in Tunisia and similar situations worldwide. The selected WWTPP at Chorfech 24 (rural settlement of 50 houses counting 350 inhabitants) consists of one Imhoff tank for pre-treatment, and three stages in series: as first stage a horizontal subsurface flow CW system, as second stage a subsurface vertical flow CW system, and a third horizontal flow CW. The sludge of the Imhoff tank is treated in a sludge composting bed. The performances of the different components as well as the whole treatment system were presented based on 3 months monitoring. The results shown in this paper are related to carbon, nitrogen and phosphorus removal as well as to reduction of micro-organisms. The mean overall removal rates of the Chorfech WWTPP during the monitored period have been, respectively, equal to 97% for total suspended solids and biochemical oxygen demand (BOD5), 95% for chemical oxygen demand, 71% for total nitrogen and 82% for P-PO4. The removal of E. coli by the whole system is 2.5 log units.     

Tensor Clustering for Rendering Many‐Light Animations

Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long‐standing challenge. Prior work has shown that complex lighting can be accurately approximated by a large collection of point lights. In this formulation, rendering of animation sequences becomes the problem of efficiently shading many surface samples from many lights across several frames. This paper presents a tensor formulation of the animated many‐light problem, where each element of the tensor expresses the contribution of one light to one pixel in one frame. We sparsely sample rows and columns of the tensor, and introduce a clustering algorithm to select a small number of representative lights to efficiently approximate the animation. Our algorithm achieves efficiency by reusing representatives across frames, while minimizing temporal flicker. We demonstrate our algorithm in a variety of scenes that include deformable objects, complex illumination and arbitrary shading and show that a surprisingly small number of representative lights is sufficient for high quality rendering. We believe out algorithm will find practical use in applications that require fast previews of complex animation.     

Formal Models and Analysis of Secure Multicast in Wired and Wireless Networks

The spreading of multicast technology enables the development of group communication and so dealing with digital streams becomes more and more common over the Internet. Given the flourishing of security threats, the distribution of streamed data must be equipped with sufficient security guarantees. To this aim, some architectures have been proposed, to supply the distribution of the stream with guarantees of, e.g., authenticity, integrity, and confidentiality of the digital contents. This paper shows a formal capability of capturing some features of secure multicast protocols. In particular, both the modeling and the analysis of some case studies are shown, starting from basic schemes for signing digital streams, passing through protocols dealing with packet loss and time-synchronization requirements, concluding with a secure distribution of a secret key. A process-algebraic framework will be exploited, equipped with schemata for analysing security properties and compositional principles for evaluating if a property is satisfied over a system with more than two components.     

Routing and resource optimization in service overlay networks

Service Overlay Networks (SONs) create a virtual topology on top of the Internet and provide end-to-end quality of service guarantees without requiring support by the underlying network.The optimization of the resources utilized by an SON is a fundamental issue for an overlay operator owing to the costs involved and the need to satisfy user requirements. Careful decisions are necessary to provide enough capacity to overlay links, to route traffic, to assign users to access nodes and to deploy overlay nodes.In this paper, we propose two mathematical programming models for the user assignment problem, the traffic routing optimization and the dimensioning of the capacity reserved on overlay links in SONs. The first model minimizes the SON installation cost while providing full access to all users. The second model maximizes the SON profit by selecting which users to serve, based on the expected gain, and taking into consideration budget constraints of the SON operator. Moreover, we extend these models to include the optimization of the number and position of overlay nodes.We provide the optimal solutions of the proposed SON design formulations on a set of realistic-size instances and discuss the effect of different parameters on the characteristics of the planned networks. Numerical results show that the proposed approach is able to solve the problem to the optimum even for large-scale networks.     

gRosSo: mining statistically robust patterns from a sequence of datasets

Knowledge and Information Systems - Pattern mining is a fundamental data mining task with applications in several domains. In this work, we consider the scenario in which we have a sequence of...     

Sorafenib delivery nanoplatform based on superparamagnetic iron oxide nanoparticles magnetically targets hepatocellular carcinoma

Currently,sorafenib is the only systemic therapy capable of increasing overall survival of hepatocellular carcinoma patients.Unfortunately,its side effects,particularly its overall toxicity,limit the therapeutic response that can be achieved.Superparamagnetic iron oxide nanoparticles (SPIONs) are very attractive for drug delivery because they can be targeted to specific sites in the body through application of a magnetic field,thus improving intratumoral accumulation and reducing adverse effects.Here,nanoformulations based on polyethylene glycol modified phospholipid micelles,loaded with both SPIONs and sorafenib,were successfully prepared and thoroughly investigated by complementary techniques.This nanovector system provided effective drug delivery,had an average hydrodynamic diameter of about 125 nm,had good stability in aqueous medium,and allowed controlled drug loading.Magnetic analysis allowed accurate determination of the amount of SPIONs embedded in each micelle.An in vitro system was designed to test whether the SPION micelles can be efficiently held using a magnetic field under typical flow conditions found in the human liver.Human hepatocellular carcinoma (HepG2) cells were selected as an in vitro system to evaluate tumor cell targeting efficacy of the superparamagnetic micelles loaded with sorafenib.These experiments demonstrated that this delivery platform is able to enhance sorafenib's antitumor effectiveness by magnetic targeting.The magnetic nanovectors described here represent promising candidates for targeting specific hepatic tumor sites,where selective release of sorafenib can improve its efficacy and safety profile.