- Book Chapter
5
- 10.1007/978-3-030-82692-5_12
The Future of Services of General Economic Interest in the Postal Industry
- Jan 01, 2022
- Topics in Regulatory Economics and Policy
- Francesco Russo + 2 more +2
Publications from 2021 to 2026
Showing 10 of 10 papers
The Future of Services of General Economic Interest in the Postal Industry
Measuring and Managing Operational Risk
Chapter 11 - Effective Security Assessment of Mobile Apps with MAVeriC: Design, Implementation, and Integration of a Unified Analysis Environment for Mobile Apps
Partial Durations: The Case of Fixed and Floating Rate Bonds
Floating rate bonds are coupon-paying instruments generally indexed to interest parameters. At the trading date, the payment dates and indexation rules are known, while the value of future coupons is uncertain. In this perspective, floating rate bonds are generally seen as a portfolio of zero coupon bonds. Therefore, at each coupon payment date, the bond should be quoted at face value and its duration should match the maturity of the replicating zero coupon bond. However, the empirical evidence based on historical prices of real floating rate bonds shows that such an instrument is not systematically quoted at parity and its market risk profile could differ from that of the replicating zero coupon bond. The aim of this work is to study the duration of a floating rate bond using a partial modified duration approach after decomposing the floating rate bond into its main building blocks. The final goal is to capture the effective risk factors of these instruments in real financial markets in order to define synthetic risk measures that should be able to reflect the instrument’s effective risk profile.
Read moreSAM: The Static Analysis Module of the MAVERIC Mobile App Security Verification Platform
The tremendous success of the mobile application paradigm is due to the ease with which new applications are uploaded by developers, distributed through the application markets e.g.i¾?Google Play, and finally installed by the users. Yet, the very same model is causing serious security concerns, since users have no or little means to ascertain the trustworthiness of the applications they install on their devices. To protect their customers, Poste Italiane has defined the Mobile Application Verification Cluster MAVERIC, a process for the systematic security analysis of third-party mobile apps that leverage the online services provided by the company e.g.i¾?home banking, parcel tracking. We present SAM, a toolkit that supports this process by automating a number of operations including reverse engineering, privilege analysis, and automatic verification of security properties. We introduce the functionalities of SAM through a demonstration of the platform applied to real Android applications.
Read moreD-MASON: A Short Tutorial
D-Mason framework is a parallel version of the Mason library for writing and running Agent-based simulations. We briefly present Mason architecture, functionalities and some programming examples. Full documentation, additional tutorials and other material can be found at www.dmason.org where the framework can be downloaded.
Read moreTrust-Aware Clustering Collaborative Filtering: Identification of Relevant Items
Identifying a customer profile of interest is a challenging task for sellers. Preferences and profile features can range during the time in accordance with current trends. In this paper we investigate the application of different model-based Collaborative Filtering (CF) techniques and in particular propose a trusted approach to user-based clustering CF. We propose a Trust-aware Clustering Collaborative Filtering and we compare several approaches by means of Epinions, which contains explicit trust statements, and MovieLens dataset, where we have implicitly defined a trust information. Experimental results show an increased value of coverage of the recommendations provided by our approach without affecting recommendation quality. To conclude, we introduce a tool, based on recommender systems, able to assist merchants in delivering special offers or in discovering potential interests of their customers. This tool allows each merchant to identify the products to suggest to the target customer in order to best fit his profile of interests.KeywordsTrustRecommender SystemCollaborative FilteringClusteringWeb Intelligence
Read morePersonalized suggestions by means of Collaborative Filtering: A comparison of two different model-based techniques
Recommendation systems are commonly used for suggesting products or services. Among different existing techniques, Model-Based Collaborative Filtering (MBCF) approaches have been proven to address scalability and cold-starting problems that often arise. In this paper we investigate two MBCF algorithms: Self-Organizing Maps (SOM) for Collaborative Filtering and Item-based Fuzzy Clustering Collaborative Filtering (IFCCF). These two techniques have been selected because preliminary results have proven that when applied to the clustering of users or items the quality of the recommendation system increases with respect to the k-means. Within recommendation systems, no comparison of these two techniques exists. Therefore, our experimentation is aimed at comparing these two techniques by means of MovieLens and Jester dataset in order to provide a guideline for their implementation in the e-Commerce domain.
Read moreA Preliminary Experience in Optimizing the Layout of Web Pages by Genetic Algorithms to Fit Mobile Devices
Getting access to web content by mobile devices is becoming widespread. This poses the need of adapting content that have been designed for desktop application to being delivered on smaller displays. In this paper we investigate the application of a genetic algorithm as means for an automatic adaptation of existent pages to mobile device requirements, reporting preliminary results and outlining problems to be faced and solved in order to make this approach robust.
Read moreA Fast Algorithm for Mining Rare Itemsets
Mining patterns in large databases is a challenging task facing NP-hard problems. Research focused attention on the most occurrent patterns, although less frequent patterns still offer interesting insights. In this paper we propose a new algorithm for discovering infrequent patterns and compare it to other solutions.
Read more