THE CAD-GIS MANAGEMENT OF THE REGIONAL DIGITAL TECHNICAL MAP (CTRN) OF FRIULI VENEZIA GIULIA REGION

I nuovi strumenti software messi a disposizione dall’informatica consentono, anche in ambito cartografico, ampi miglioramenti nella gestione dei dati e delle rappresentazioni grafiche sia a video che in stampa. La procedura automatizzata qui presentata permette di gestire, in ambiente CAD – GIS, la cartografia numerica della regione Friuli Venezia Giulia; le sue caratteristiche principali sono: la gestione continua di tutto il territorio regionale, la visualizzazione delle singole sottoclassi della carta numerica, l’utilizzo di immagini raster di sfondo (ortofoto), la gestione dello “storico” della carta, nonché ampie possibilità di personalizzazione e di stampa. Pur non volendo essere un’alternativa alla produzione tradizionale di cartografia, risulta comunque un ottimo strumento operativo di lavoro.The new software tools from IT world concur to obtain large improvement in managing data and graphical representations on video and paper mapping. The automatic procedure here introduced concur in managing via CAD and GIS instruments the digital cartography of Friuli Venezia Giulia region. The main characteristics of this procedure deal with the continuous management of the regional territory, the visualization of the single features of the digital cartography, as well as the use of raster backgrounds like orthophotos and the possibility to manage and monitor the modifications occurred in the digital cartography in time. The system does not represent an alternative to the traditional cartography plotted on paper but represent a very efficient and useful working instrument

Local Ranking Problem on the BrowseGraph

The "Local Ranking Problem" (LRP) is related to the computation of a centrality-like rank on a local graph, where the scores of the nodes could significantly differ from the ones computed on the global graph. Previous work has studied LRP on the hyperlink graph but never on the BrowseGraph, namely a graph where nodes are webpages and edges are browsing transitions. Recently, this graph has received more and more attention in many different tasks such as ranking, prediction and recommendation. However, a web-server has only the browsing traffic performed on its pages (local BrowseGraph) and, as a consequence, the local computation can lead to estimation errors, which hinders the increasing number of applications in the state of the art. Also, although the divergence between the local and global ranks has been measured, the possibility of estimating such divergence using only local knowledge has been mainly overlooked. These aspects are of great interest for online service providers who want to: (i) gauge their ability to correctly assess the importance of their resources only based on their local knowledge, and (ii) take into account real user browsing fluxes that better capture the actual user interest than the static hyperlink network. We study the LRP problem on a BrowseGraph from a large news provider, considering as subgraphs the aggregations of browsing traces of users coming from different domains. We show that the distance between rankings can be accurately predicted based only on structural information of the local graph, being able to achieve an average rank correlation as high as 0.8

Search Behaviour On Photo Sharing Platforms

The behaviour, goals, and intentions of users while searching for images in large scale online collections are not well understood, with image search log analysis providing limited insights, in part because they tend only to have access to user search and result click information. In this paper we study user search behaviour in a large photo-sharing platform, analyzing all user actions during search sessions (i.e. including post result-click pageviews). Search accounts for a significant part of user interactions with such platforms, and we show differences between the queries issued on such platforms and those on general image search. We show that search behaviour is influenced by the query type, and also depends on the user. Finally, we analyse how users behave when they reformulate their queries, and develop URL class prediction models for image search, showing that query-specific models significantly outperform query-agnostic models. The insights provided in this paper are intended as a launching point for the design of better interfaces and ranking models for image search. © 2013 IEEE.published_or_final_versio

Reverse engineering of logic-based differential equation models using a mixed-integer dynamic optimisation approach

Motivation: Systems biology models can be used to test new hypotheses formulated on the basis of previous knowledge or new experimental data, contradictory with a previously existing model. New hypotheses often come in the shape of a set of possible regulatory mechanisms. This search is usually not limited to finding a single regulation link, but rather a combination of links subject to great uncertainty or no information about the kinetic parameters.Results: In this work, we combine a logic-based formalism, to describe all the possible regulatory structures for a given dynamic model of a pathway, with mixed-integer dynamic optimization (MIDO). This framework aims to simultaneously identify the regulatory structure (represented by binary parameters) and the real-valued parameters that are consistent with the available experimental data, resulting in a logic-based differential equation model. The alternative to this would be to perform real-valued parameter estimation for each possible model structure, which is not tractable for models of the size presented in this work. The performance of the method presented here is illustrated with several case studies: a synthetic pathway problem of signaling regulation, a two component signal transduction pathway in bacterial homeostasis, and a signaling network in liver cancer cells.D.H., J.R.B. and J.S.R. acknowledge funding from the EU FP7 projects 'NICHE' (ITN Grant number 289384) and 'BioPreDyn' (KBBE grant number 289434). J.R.B. also acknowledges funding from the Spanish Ministerio de Economia y Competitividad (and the FEDER) through the project MultiScales (DPI2011-28112-C04-03)

MONETIZATION ABUSE DETECTION BASED ON CO-WATCH SIMILARITY

A system for detecting monetization abuse by channels of content sharing networks is disclosed. The proposed system uses machine learning methods to generate a predictive model capable of being applied to channels to determine a likelihood that the channel is engaged in monetization abuse. Specifically, the proposed system may train a machine learning classifier using a plurality of training videos. The training may be based on generating clusters of videos and identifying which clusters are risky. The machine learning classifier may then be applied to existing and new channels to detect monetization abuse (e.g., channels uploading inappropriate content) and flag the potentially abusive channels for administrative review

Method to Identify Change based on Content-based Embedding

A method for identifying change based on content-based embedding is disclosed. The proposed method computes content similarity of content items uploaded to a user’s personal channel. The method then computes a channel risk score, which identifies whether the type(s) of content uploaded to a user’s personal channel has changed after a specific point in time. A channel in which the type(s) of content has changed after a specific point in time, for example after the channel was reviewed for a monetization program, may indicate potential abuse of the monetization program. Based on the risk score, the method may flag potentially abusive channels for administrative review, which may be reviewed by an automated system, a human reviewer, or a combination

Scalable Methods And Systems For Storing Matching Segments

Disclosed herein is a mechanism for providing a compact representation of match information. Such a mechanism can include (i) accessing a repository or database of match information or other information about a segment of a video being re-used by a segment of another video, (ii) dividing each video from the match information into multiple segments (e.g., segments of a fixed duration or segments of a fixed number), and (iii) selecting a representative segment from the multiple segments, where the representative segment is stored in a storage device. The representative segment can be a compact approximate representation of the match information from a match database. A real-time matcher can reconstruct match information from the compact approximate representation retrieved from the storage device, which can be transmitted for use by a real-time application

Handling preferences in student-project allocation

We consider the problem of allocating students to project topics satisfying side constraints and taking into account students’ preferences. Students rank projects according to their preferences for the topic and side constraints limit the possibilities to team up students in the project topics. The goal is to find assignments that are fair and that maximize the collective satisfaction. Moreover, we consider issues of stability and envy from the students’ viewpoint. This problem arises as a crucial activity in the organization of a first year course at the Faculty of Science of the University of Southern Denmark. We formalize the student-project allocation problem as a mixed integer linear programming problem and focus on different ways to model fairness and utilitarian principles. On the basis of real-world data, we compare empirically the quality of the allocations found by the different models and the computational effort to find solutions by means of a state-of-the-art commercial solver. We provide empirical evidence about the effects of these models on the distribution of the student assignments, which could be valuable input for policy makers in similar settings. Building on these results we propose novel combinations of the models that, for our case, attain feasible, stable, fair and collectively satisfactory solutions within a minute of computation. Since 2010, these solutions are used in practice at our institution.</p