[go: up one dir, main page]

Next Issue
Volume 8, September
Previous Issue
Volume 8, March
 
 

Future Internet, Volume 8, Issue 2 (June 2016) – 19 articles

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Order results
Result details
Section
Select all
Export citation of selected articles as:
2670 KiB  
Article
Elusive Learning—Using Learning Analytics to Support Reflective Sensemaking of Ill-Structured Ethical Problems: A Learner-Managed Dashboard Solution
by Yianna Vovides and Sarah Inman
Future Internet 2016, 8(2), 26; https://doi.org/10.3390/fi8020026 - 11 Jun 2016
Cited by 4 | Viewed by 7446
Abstract
Since the turn of the 21st century, we have seen a surge of studies on the state of U.S. education addressing issues such as cost, graduation rates, retention, achievement, engagement, and curricular outcomes. There is an expectation that graduates should be able to [...] Read more.
Since the turn of the 21st century, we have seen a surge of studies on the state of U.S. education addressing issues such as cost, graduation rates, retention, achievement, engagement, and curricular outcomes. There is an expectation that graduates should be able to enter the workplace equipped to take on complex and “messy” or ill-structured problems as part of their professional and everyday life. In the context of online learning, we have identified two key issues that are elusive (hard to capture and make visible): learning with ill-structured problems and the interaction of social and individual learning. We believe that the intersection between learning and analytics has the potential, in the long-term, to minimize the elusiveness of deep learning. A proposed analytics model is described in this article that is meant to capture and also support further development of a learner’s reflective sensemaking. Full article
(This article belongs to the Special Issue eLearning)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Sensemaking process model for deep learning.</p>
Full article ">Figure 2
<p>Learning analytics model of reflective sensemaking.</p>
Full article ">Figure 3
<p>Cohere concept network (showing complexity of network).</p>
Full article ">Figure 4
<p>Schematic of Learner-Managed Dashboard.</p>
Full article ">
986 KiB  
Article
A Methodological Approach to Evaluate Livestock Innovations on Small-Scale Farms in Developing Countries
by Antón García-Martínez, José Rivas-Rangel, Jaime Rangel-Quintos, José Antonio Espinosa, Cecilio Barba and Carmen De-Pablos-Heredero
Future Internet 2016, 8(2), 25; https://doi.org/10.3390/fi8020025 - 3 Jun 2016
Cited by 24 | Viewed by 7761
Abstract
The aim of the study was deepening the knowledge of livestock innovations knowledge on small-scale farms in developing countries. First, we developed a methodology focused on identifying potential appropriate livestock innovations for smallholders and grouped them in innovation areas, defined as a set [...] Read more.
The aim of the study was deepening the knowledge of livestock innovations knowledge on small-scale farms in developing countries. First, we developed a methodology focused on identifying potential appropriate livestock innovations for smallholders and grouped them in innovation areas, defined as a set of well-organized practices with a business purpose. Finally, a process management program (PMP) was evaluated according to the livestock innovation level and viability of the small-scale farms. Logistic regression was used to evaluate the impact of PMP on the economic viability of the farm. Information from 1650 small-scale livestock farms in Mexico was collected and the innovations were grouped in five innovation areas: A1. Management, A2. Feeding, A3. Genetic, A4. Reproduction and A5. Animal Health. The resulting innovation level in the system was low at 45.7% and heterogeneous among areas. This study shows the usefulness of the methodology described and confirms that implementing a PMP allows improving the viability an additional 21%, due to a better integration of processes, resulting in more efficient management. Full article
(This article belongs to the Special Issue Future Intelligent Systems and Networks)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Dimensions of innovation in the agricultural sector.</p>
Full article ">Figure 2
<p>Steps for evaluating livestock innovations on small-scale farms.</p>
Full article ">Figure 3
<p>Evaluation of livestock innovations.</p>
Full article ">
2133 KiB  
Article
A Service-Oriented Approach for Dynamic Chaining of Virtual Network Functions over Multi-Provider Software-Defined Networks
by Barbara Martini and Federica Paganelli
Future Internet 2016, 8(2), 24; https://doi.org/10.3390/fi8020024 - 1 Jun 2016
Cited by 38 | Viewed by 10445
Abstract
Emerging technologies such as Software-Defined Networks (SDN) and Network Function Virtualization (NFV) promise to address cost reduction and flexibility in network operation while enabling innovative network service delivery models. However, operational network service delivery solutions still need to be developed that actually exploit [...] Read more.
Emerging technologies such as Software-Defined Networks (SDN) and Network Function Virtualization (NFV) promise to address cost reduction and flexibility in network operation while enabling innovative network service delivery models. However, operational network service delivery solutions still need to be developed that actually exploit these technologies, especially at the multi-provider level. Indeed, the implementation of network functions as software running over a virtualized infrastructure and provisioned on a service basis let one envisage an ecosystem of network services that are dynamically and flexibly assembled by orchestrating Virtual Network Functions even across different provider domains, thereby coping with changeable user and service requirements and context conditions. In this paper we propose an approach that adopts Service-Oriented Architecture (SOA) technology-agnostic architectural guidelines in the design of a solution for orchestrating and dynamically chaining Virtual Network Functions. We discuss how SOA, NFV, and SDN may complement each other in realizing dynamic network function chaining through service composition specification, service selection, service delivery, and placement tasks. Then, we describe the architecture of a SOA-inspired NFV orchestrator, which leverages SDN-based network control capabilities to address an effective delivery of elastic chains of Virtual Network Functions. Preliminary results of prototype implementation and testing activities are also presented. The benefits for Network Service Providers are also described that derive from the adaptive network service provisioning in a multi-provider environment through the orchestration of computing and networking services to provide end users with an enhanced service experience. Full article
(This article belongs to the Special Issue Ecosystemic Evolution Feeded by Smart Systems)
Show Figures

Figure 1

Figure 1
<p>Scenarios for dynamic composition of Virtual Network Functions.</p>
Full article ">Figure 2
<p>Service Oriented Architecture, Network Function Virtualization, and Software Defined Networking synergy for adaptive network service composition and delivery models.</p>
Full article ">Figure 3
<p>Service-oriented mechanisms for dynamic service chaining of Virtual Network Functions (VNFs).</p>
Full article ">Figure 4
<p>Functional architecture for adaptive service composition and delivery.</p>
Full article ">Figure 5
<p>Orchestration workflows for adaptive service delivery.</p>
Full article ">Figure 6
<p>Prototype design and emulated testbed environment. (<b>a</b>) Emulation environment adopting the Mininet tool and the Abilene network topology; (<b>b</b>) architecture of the SDN Orchestrator prototype.</p>
Full article ">
498 KiB  
Review
Cognitive Spectrum Sharing: An Enabling Wireless Communication Technology for a Wide Use of Smart Systems
by Romano Fantacci and Dania Marabissi
Future Internet 2016, 8(2), 23; https://doi.org/10.3390/fi8020023 - 20 May 2016
Cited by 14 | Viewed by 8030
Abstract
A smart city is an environment where a pervasive, multi-service network is employed to provide citizens improved living conditions as well as better public safety and security. Advanced communication technologies are essential to achieve this goal. In particular, an efficient and reliable communication [...] Read more.
A smart city is an environment where a pervasive, multi-service network is employed to provide citizens improved living conditions as well as better public safety and security. Advanced communication technologies are essential to achieve this goal. In particular, an efficient and reliable communication network plays a crucial role in providing continue, ubiquitous, and reliable interconnections among users, smart devices, and applications. As a consequence, wireless networking appears as the principal enabling communication technology despite the necessity to face severe challenges to satisfy the needs arising from a smart environment, such as explosive data volume, heterogeneous data traffic, and support of quality of service constraints. An interesting approach for meeting the growing data demand due to smart city applications is to adopt suitable methodologies to improve the usage of all potential spectrum resources. Towards this goal, a very promising solution is represented by the Cognitive Radio technology that enables context-aware capability in order to pursue an efficient use of the available communication resources according to the surrounding environment conditions. In this paper we provide a review of the characteristics, challenges, and solutions of a smart city communication architecture, based on the Cognitive Radio technology, by focusing on two new network paradigms—namely, Heterogeneous Network and Machines-to-Machines communications—that are of special interest to efficiently support smart city applications and services. Full article
(This article belongs to the Special Issue Ecosystemic Evolution Feeded by Smart Systems)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Cognitive communication architecture for smart city. M2M: Machine-to-Machine; DCSC: dedicated cognitive small cell.</p>
Full article ">Figure 2
<p>Spectrum Opportunities.</p>
Full article ">Figure 3
<p>Cognitve Beamforming and Resource allocation.</p>
Full article ">
2562 KiB  
Article
Development of an Expert System for the Evaluation of Students’ Curricula on the Basis of Competencies
by Luis Enrique Sánchez, Antonio Santos-Olmo, Esther Álvarez, Monica Huerta, Sara Camacho and Eduardo Fernández-Medina
Future Internet 2016, 8(2), 22; https://doi.org/10.3390/fi8020022 - 18 May 2016
Cited by 20 | Viewed by 7555
Abstract
The concept of competence, which emerged during the reform of computer engineering degrees, has not brought benefits to companies when attempting to select the most suitable candidates for their jobs. This article aims to show some of the research that has been conducted [...] Read more.
The concept of competence, which emerged during the reform of computer engineering degrees, has not brought benefits to companies when attempting to select the most suitable candidates for their jobs. This article aims to show some of the research that has been conducted to determine why companies have not found these skills useful and how both can be aligned. Finally, we show the development of an Expert System that will enable companies to select the most suitable candidates for their jobs, considering personal and social skills, along with technical knowledge. This prototype will serve as a basis to align the competencies defined in the curricula with professional requirements, thus allowing a true alignment between degree courses and the needs of professional companies. Full article
(This article belongs to the Collection Information Systems Security)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>General schema of prototype.</p>
Full article ">Figure 2
<p>Context diagram.</p>
Full article ">Figure 3
<p>Behavioral model.</p>
Full article ">Figure 4
<p>Candidate′s application form based on sub-competences.</p>
Full article ">Figure 5
<p>Results of Evaluation of sub-competences.</p>
Full article ">
17609 KiB  
Article
Using Financial Instruments to Transfer the Information Security Risks
by Pankaj Pandey and Einar Snekkenes
Future Internet 2016, 8(2), 20; https://doi.org/10.3390/fi8020020 - 17 May 2016
Cited by 5 | Viewed by 8413
Abstract
For many individuals and organizations, cyber-insurance is the most practical and only way of handling a major financial impact of an information security event. However, the cyber-insurance market suffers from the problem of information asymmetry, lack of product diversity, illiquidity, high transaction cost, [...] Read more.
For many individuals and organizations, cyber-insurance is the most practical and only way of handling a major financial impact of an information security event. However, the cyber-insurance market suffers from the problem of information asymmetry, lack of product diversity, illiquidity, high transaction cost, and so on. On the other hand, in theory, capital market-based financial instruments can provide a risk transfer mechanism with the ability to absorb the adverse impact of an information security event. Thus, this article addresses the limitations in the cyber-(re)insurance markets with a set of capital market-based financial instruments. This article presents a set of information security derivatives, namely options, vanilla options, swap, and futures that can be traded at an information security prediction market. Furthermore, this article demonstrates the usefulness of information security derivatives in a given scenario and presents an evaluation of the same in comparison with cyber-insurance. In our analysis, we found that the information security derivatives can at least be a partial solution to the problems in the cyber-insurance markets. The information security derivatives can be used as an effective tool for information elicitation and aggregation, cyber risk pricing, risk hedging, and strategic decision making for information security risk management. Full article
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Process Flow Model for Design Science Research Approach (adapted from [<a href="#B13-futureinternet-08-00020" class="html-bibr">13</a>]).</p>
Full article ">Figure 2
<p>An Information Security Risk Management Process.</p>
Full article ">Figure 3
<p>A Taxonomy of Cyber-Threats (adapted from [<a href="#B22-futureinternet-08-00020" class="html-bibr">22</a>]).</p>
Full article ">Figure 4
<p>Cyber Risk Framework (adapted from [<a href="#B77-futureinternet-08-00020" class="html-bibr">77</a>]).</p>
Full article ">Figure 5
<p>Application Scenario of ISD.</p>
Full article ">Figure 6
<p>Process of Designing and Using Information Security Derivatives.</p>
Full article ">Figure 7
<p>Unhedged Expected Future Value for Market’s Probability Estimate.</p>
Full article ">Figure 8
<p>Unhedged Expected Future Value for CVaR Probability Estimate.</p>
Full article ">Figure 9
<p>Hedged Expected Future Value for Market’s Probability Estimate.</p>
Full article ">Figure 10
<p>Hedged Expected Future Value for CVaR’s Probability Estimate.</p>
Full article ">Figure 11
<p>Unhedged Expected Future Value for Market’s Probability Estimate.</p>
Full article ">Figure 12
<p>Unhedged Expected Future Value for Company’s Probability Estimate.</p>
Full article ">Figure 13
<p>Hedged Expected Future Value for Market’s Probability Estimate.</p>
Full article ">Figure 14
<p>Hedged Expected Future Value for Company’s Probability Estimate.</p>
Full article ">Figure 15
<p>Unhedged Expected Future Value for Company’s Probability Estimate.</p>
Full article ">Figure 16
<p>Unedged Expected Future Value for Counterparty’s Probability Estimate.</p>
Full article ">Figure 17
<p>Hedged Expected Future Value for Counterparty’s Probability Estimate.</p>
Full article ">Figure 18
<p>Hedged Expected Future Value for Company’s Probability Estimate.</p>
Full article ">Figure 19
<p>Unhedged Expected Future Value for Market’s Probability Estimate.</p>
Full article ">Figure 20
<p>Unhedged Expected Future Value for Company’s Probability Estimate.</p>
Full article ">Figure 21
<p>Hedged Expected Future Value for Market’s Probability Estimate.</p>
Full article ">Figure 22
<p>Hedged Expected Future Value for Company’s Probability Estimate.</p>
Full article ">Figure 23
<p>ISD Evaluation Process (adapted from [<a href="#B13-futureinternet-08-00020" class="html-bibr">13</a>]).</p>
Full article ">
370 KiB  
Review
Information Is Not a Virus, and Other Consequences of Human Cognitive Limits
by Kristina Lerman
Future Internet 2016, 8(2), 21; https://doi.org/10.3390/fi8020021 - 13 May 2016
Cited by 50 | Viewed by 10769
Abstract
The many decisions that people make about what to pay attention to online shape the spread of information in online social networks. Due to the constraints of available time and cognitive resources, the ease of discovery strongly impacts how people allocate their attention [...] Read more.
The many decisions that people make about what to pay attention to online shape the spread of information in online social networks. Due to the constraints of available time and cognitive resources, the ease of discovery strongly impacts how people allocate their attention to social media content. As a consequence, the position of information in an individual’s social feed, as well as explicit social signals about its popularity, determine whether it will be seen, and the likelihood that it will be shared with followers. Accounting for these cognitive limits simplifies mechanics of information diffusion in online social networks and explains puzzling empirical observations: (i) information generally fails to spread in social media and (ii) highly connected people are less likely to re-share information. Studies of information diffusion on different social media platforms reviewed here suggest that the interplay between human cognitive limits and network structure differentiates the spread of information from other social contagions, such as the spread of a virus through a population. Full article
Show Figures

Figure 1

Figure 1
<p>Size of simulated outbreaks on a real-world and random graphs as a function of transmissibility. Contagions are simulated using the independent cascade model (ICM) on the follower graph of the Digg social news platform (<b>red dots</b>) and a random graph with the same degree distribution (<b>black crosses</b>). The golden line gives theoretically predicted outbreak sizes.</p>
Full article ">Figure 2
<p>Size of outbreaks in social media. Empirical measurements of the size of contagious outbreaks in social media sites (<b>a</b>) Digg and (<b>b</b>) Twitter. The <span class="html-italic">x</span>-axis represents the size of outbreak in terms of the number of people who dugg or retweeted specific information, and <span class="html-italic">y</span>-axis reports the frequency of events of that size.</p>
Full article ">Figure 3
<p>The exposure response function for social media users. The figures report the probability (averaged over all users) to respond to information, <span class="html-italic">i.e.</span>, (<b>a</b>) to digg a news story or (<b>b</b>) retweet a URL, as a function of number of friends who previously did so.</p>
Full article ">Figure 4
<p>Size of simulated outbreaks on Digg as a function of transmissibility. Simulations of social contagion on the Digg follower graph (<b>black crosses</b>) using suppressed exposure response function suggested by <a href="#futureinternet-08-00021-f003" class="html-fig">Figure 3</a>a. Actual outbreaks on Digg are shown as red dots, while theoretically predicted (<b>gold</b>) line is the same as in <a href="#futureinternet-08-00021-f001" class="html-fig">Figure 1</a>. Suppressed response to repeated exposures vastly decreases the size of outbreaks as compared to prediction of the ICM (<a href="#futureinternet-08-00021-f001" class="html-fig">Figure 1</a>).</p>
Full article ">Figure 5
<p>Position bias. The relative decrease in recommendations received by items at different position within a list, compared to expected recommendations. Items in top positions (1–5) receive four to five times as much attention as items in lower positions (50–75). The increase near the end of the list is created by people who start inspecting the list from the end.</p>
Full article ">Figure 6
<p>Time response function for social media. The probability to (<b>a</b>) digg a news story and (<b>b</b>) retweet a URL, as a function of the time since exposure, <span class="html-italic">i.e.</span>, message’s arrival in the user’s feed. To remove the confounding effects of multiple exposures, the figure only considers single exposure items. Digg stories were only followed until promotion (the first 24 hours) during which time they were only visible to the followers. The data are smoothed using progressively wider smoothing windows, as in [<a href="#B24-futureinternet-08-00021" class="html-bibr">24</a>].</p>
Full article ">Figure 7
<p>Exposure response function for Twitter. The figure shows the average probability to retweet a message as a function of the number of friends who previously tweeted it for two classes of users, separated according to the number of friends they follow. The well-connected users with many friends are less likely to retweet; hence, they are less susceptible than users with few friends.</p>
Full article ">Figure 8
<p>Predicting response. Observed probability to (<b>a</b>) digg or (<b>b</b>) retweet an item as a function of predicted probability, for different numbers of exposures to the item.</p>
Full article ">
1573 KiB  
Article
Computational Social Science, the Evolution of Policy Design and Rule Making in Smart Societies
by Nicola Lettieri
Future Internet 2016, 8(2), 19; https://doi.org/10.3390/fi8020019 - 12 May 2016
Cited by 10 | Viewed by 9265
Abstract
In the last 20 years, the convergence of different factors—the rise of the complexity of science, the “data deluge” and the advances in information technologies—triggered a paradigm shift in the way we understand complex social systems and their evolution. Beyond shedding new light [...] Read more.
In the last 20 years, the convergence of different factors—the rise of the complexity of science, the “data deluge” and the advances in information technologies—triggered a paradigm shift in the way we understand complex social systems and their evolution. Beyond shedding new light onto social dynamics, the emerging research area of Computational Social Science (CSS) is providing a new rationale for a more scientifically-grounded and effective policy design. The paper discusses the opportunities potentially deriving from the intersection between policy design issues and CSS methods. After a general introduction to the limits of traditional policy-making and a brief review of the most promising CSS methodologies, the work deals with way in which the insights potentially offered by CSS can concretely flow in policy choices. The attention is focused, to this end, on the legal mechanisms regulating the formulation and the evaluation of public policies. Our goal is two-fold: sketch how the project of a “smart society” is connected to the evolution of social sciences and emphasize the need for change in the way in which public policies are conceived of, designed and implemented. Full article
(This article belongs to the Special Issue Ecosystemic Evolution Feeded by Smart Systems)
Show Figures

Figure 1

Figure 1
<p>Number of papers published in the period 2000–2014 and containing an explicit reference to “computational social science” in the title (source: Google Scholar).</p>
Full article ">Figure 2
<p>Computational social science: scientific background (source: adapted from ref.[<a href="#B11-futureinternet-08-00019" class="html-bibr">11</a>]).</p>
Full article ">Figure 3
<p>The policy cycle (source: adapted from ref.[<a href="#B56-futureinternet-08-00019" class="html-bibr">56</a>]).</p>
Full article ">
7711 KiB  
Article
iNUIT: Internet of Things for Urban Innovation
by Francesco Carrino, Elena Mugellini, Omar Abou Khaled, Nabil Ouerhani and Juergen Ehrensberger
Future Internet 2016, 8(2), 18; https://doi.org/10.3390/fi8020018 - 11 May 2016
Cited by 4 | Viewed by 7259
Abstract
Internet of Things (IoT) seems a viable way to enable the Smart Cities of the future. iNUIT (Internet of Things for Urban Innovation) is a multi-year research program that aims to create an ecosystem that exploits the variety of data coming from multiple [...] Read more.
Internet of Things (IoT) seems a viable way to enable the Smart Cities of the future. iNUIT (Internet of Things for Urban Innovation) is a multi-year research program that aims to create an ecosystem that exploits the variety of data coming from multiple sensors and connected objects installed on the scale of a city, in order to meet specific needs in terms of development of new services (physical security, resource management, etc.). Among the multiple research activities within iNUIT, we present two projects: SmartCrowd and OpEc. SmartCrowd aims at monitoring the crowd’s movement during large events. It focuses on real-time tracking using sensors available in smartphones and on the use of a crowd simulator to detect possible dangerous scenarios. A proof-of-concept of the application has been tested at the Paléo Festival (Switzerland) showing the feasibility of the approach. OpEc (Optimisation de l’Eclairage public) aims at using IoT to implement dynamic street light management and control with the goal of reducing street light energy consumption while guaranteeing the same level of security of traditional illumination. The system has been tested during two months in a street in St-Imier (Switzerland) without interruption, validating its stability and resulting in an overall energy saving of about 56%. Full article
(This article belongs to the Special Issue Ecosystemic Evolution Feeded by Smart Systems)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>A graphic representation of the vision within the Internet of Things for Urban Innovation (iNUIT) program with main services based on a network of connected objects (Internet of Things paradigm).</p>
Full article ">Figure 2
<p>iNUIT architecture divided in five layers from the sensors (bottom) to the services (up).</p>
Full article ">Figure 3
<p>The iNUIT architecture with the modules developed within the SmartCrowd and OpEC (Optmisation de l’Eclairage public) projects tinted in purple and orange, respectively. The modules in white have been developed during other projects within the iNUIT program.</p>
Full article ">Figure 4
<p>SmartCrowd app structure. The red dashed lines regroup the modules developed within the mobile app.</p>
Full article ">Figure 5
<p>Three screenshots of the SmartCrowd application showing: (<b>a</b>) The main screen; (<b>b</b>) The map; (<b>c</b>) The reward information.</p>
Full article ">Figure 6
<p>A picture from the manual annotation operation.</p>
Full article ">Figure 7
<p>The output generated by the simulator: (<b>a</b>) two Voronoi diagrams for density and velocity of a portion of the map; and (<b>b</b>) the heat map generated by the simulation of an evacuation on the Paléo site (the orange circles indicate the exits).</p>
Full article ">Figure 8
<p>(<b>a</b>) A screenshot of the simulation scene seen form above; the red line represents the defined escaping route. (<b>b</b>) A closer look at the crowd moving toward a gate during a simulated evacuation. The color of the agent is related to the local density calculated by the simulator.</p>
Full article ">Figure 9
<p>(<b>a</b>) Two users’ location points during the one-hour collect time. (<b>b</b>) The accuracy distribution and (<b>c</b>) the time distribution of data collected during the event.</p>
Full article ">Figure 10
<p>Dynamic street lighting system overview.</p>
Full article ">Figure 11
<p>Decision tree implemented in Drools.</p>
Full article ">Figure 12
<p>Luminaire intensity level variation during one night.</p>
Full article ">
1930 KiB  
Article
Supporting Privacy of Computations in Mobile Big Data Systems
by Sriram Nandha Premnath and Zygmunt J. Haas
Future Internet 2016, 8(2), 17; https://doi.org/10.3390/fi8020017 - 10 May 2016
Cited by 1 | Viewed by 6294
Abstract
Cloud computing systems enable clients to rent and share computing resources of third party platforms, and have gained widespread use in recent years. Numerous varieties of mobile, small-scale devices such as smartphones, red e-health devices, etc., across users, are connected to one [...] Read more.
Cloud computing systems enable clients to rent and share computing resources of third party platforms, and have gained widespread use in recent years. Numerous varieties of mobile, small-scale devices such as smartphones, red e-health devices, etc., across users, are connected to one another through the massive internetwork of vastly powerful servers on the cloud. While mobile devices store “private information” of users such as location, payment, health data, etc., they may also contribute “semi-public information” (which may include crowdsourced data such as transit, traffic, nearby points of interests, etc.) for data analytics. In such a scenario, a mobile device may seek to obtain the result of a computation, which may depend on its private inputs, crowdsourced data from other mobile devices, and/or any “public inputs” from other servers on the Internet. We demonstrate a new method of delegating real-world computations of resource-constrained mobile clients using an encrypted program known as the garbled circuit. Using the garbled version of a mobile client’s inputs, a server in the cloud executes the garbled circuit and returns the resulting garbled outputs. Our system assures privacy of the mobile client’s input data and output of the computation, and also enables the client to verify that the evaluator actually performed the computation. We analyze the complexity of our system. We measure the time taken to construct the garbled circuit as well as evaluate it for varying number of servers. Using real-world data, we evaluate our system for a practical, privacy preserving search application that locates the nearest point of interest for the mobile client to demonstrate feasibility. Full article
(This article belongs to the Special Issue Security in Cloud Computing and Big Data)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Our secure cloud computing model with <math display="inline"> <semantics> <mrow> <mo>(</mo> <mi>n</mi> <mo>+</mo> <mn>2</mn> <mo>)</mo> <mo>=</mo> <mn>5</mn> </mrow> </semantics> </math> servers. (1) Client sends unique seed value, <math display="inline"> <semantics> <msub> <mi>s</mi> <mi>i</mi> </msub> </semantics> </math>, to each <math display="inline"> <semantics> <mrow> <msub> <mi>p</mi> <mi>i</mi> </msub> <mspace width="3.33333pt"/> <mrow> <mo>(</mo> <mn>1</mn> <mo>≤</mo> <mi>i</mi> <mo>≤</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow> </semantics> </math>; (2) <math display="inline"> <semantics> <mrow> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>,</mo> <mspace width="3.33333pt"/> <msub> <mi>p</mi> <mn>2</mn> </msub> <mo>,</mo> <mspace width="3.33333pt"/> <msub> <mi>p</mi> <mn>3</mn> </msub> </mrow> </semantics> </math> interact (<math display="inline"> <semantics> <mrow> <msub> <mi>I</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>,</mo> <mn>1</mn> <mo>≤</mo> <mi>i</mi> <mo>&lt;</mo> <mi>j</mi> <mo>≤</mo> <mn>3</mn> </mrow> </semantics> </math>) to construct shares of the garbled circuit <math display="inline"> <semantics> <mrow> <mi>G</mi> <mi>C</mi> </mrow> </semantics> </math>; (3) Each <math display="inline"> <semantics> <msub> <mi>p</mi> <mi>i</mi> </msub> </semantics> </math> sends its share (<math display="inline"> <semantics> <mrow> <mi>G</mi> <msub> <mi>C</mi> <mi>i</mi> </msub> </mrow> </semantics> </math>) to <math display="inline"> <semantics> <msub> <mi>p</mi> <mi>c</mi> </msub> </semantics> </math>; (4) <math display="inline"> <semantics> <msub> <mi>p</mi> <mi>c</mi> </msub> </semantics> </math> computes <math display="inline"> <semantics> <mrow> <mi>G</mi> <mi>C</mi> <mo>=</mo> <mi>G</mi> <msub> <mi>C</mi> <mn>1</mn> </msub> <mo>⊕</mo> <mi>G</mi> <msub> <mi>C</mi> <mn>2</mn> </msub> <mo>⊕</mo> <mi>G</mi> <msub> <mi>C</mi> <mn>3</mn> </msub> </mrow> </semantics> </math>, and sends it to <math display="inline"> <semantics> <msub> <mi>p</mi> <mi>e</mi> </msub> </semantics> </math>; (5) Client generates garbled inputs, and sends them to <math display="inline"> <semantics> <msub> <mi>p</mi> <mi>e</mi> </msub> </semantics> </math> for evaluation; (6) <math display="inline"> <semantics> <msub> <mi>p</mi> <mi>e</mi> </msub> </semantics> </math> evaluates <math display="inline"> <semantics> <mrow> <mi>G</mi> <mi>C</mi> </mrow> </semantics> </math>, and returns the garbled outputs to the client.</p>
Full article ">Figure 2
<p>A circuit with three gates, <math display="inline"> <semantics> <mrow> <mi>P</mi> <mo>,</mo> <mi>Q</mi> <mo>,</mo> <mi>R</mi> </mrow> </semantics> </math>, and seven wires, <math display="inline"> <semantics> <mrow> <msub> <mi>ω</mi> <mi>i</mi> </msub> <mspace width="3.33333pt"/> <mrow> <mo>(</mo> <mn>0</mn> <mo>≤</mo> <mi>i</mi> <mo>≤</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow> </semantics> </math>.</p>
Full article ">Figure 3
<p>Number of gates in the circuit that computes one garbled table entry as a function of <span class="html-italic">n</span>.</p>
Full article ">Figure 4
<p>Amount of network traffic to compute one garbled table entry as a function of <span class="html-italic">n</span>.</p>
Full article ">Figure 5
<p>Total number of Mbits generated randomly while creating one garbled table entry for the 32-bit adder.</p>
Full article ">Figure 6
<p>Size of the garbled circuit in Kbits for the 32-bit adder.</p>
Full article ">Figure 7
<p>Total number of Kbits that the client generates to delegate the construction and evaluation of the garbled circuit, and to verify the outputs for the 32-bit adder.</p>
Full article ">Figure 8
<p>Time taken to construct one garbled table.</p>
Full article ">Figure 9
<p>Time taken to evaluate one garbled gate.</p>
Full article ">Figure 10
<p>Absolute difference between the <span class="html-italic">X</span> and <span class="html-italic">Y</span> coordinates.</p>
Full article ">Figure 11
<p>Manhattan Distance Computation.</p>
Full article ">Figure 12
<p>Finding minimum value and index.</p>
Full article ">Figure 13
<p>Server-side network traffic to construct the garbled circuit for determining the nearest ATM.</p>
Full article ">Figure 14
<p>Client-side cost to determine the nearest ATM.</p>
Full article ">
648 KiB  
Article
Digital Libraries: The Challenge of Integrating Instagram with a Taxonomy for Content Management
by Simona Ibba and Filippo Eros Pani
Future Internet 2016, 8(2), 16; https://doi.org/10.3390/fi8020016 - 10 May 2016
Cited by 9 | Viewed by 6971
Abstract
Interoperability and social implication are two current challenges in the digital library (DL) context. To resolve the problem of interoperability, our work aims to find a relationship between the main metadata schemas. In particular, we want to formalize knowledge through the creation of [...] Read more.
Interoperability and social implication are two current challenges in the digital library (DL) context. To resolve the problem of interoperability, our work aims to find a relationship between the main metadata schemas. In particular, we want to formalize knowledge through the creation of a metadata taxonomy built with the analysis and the integration of existing schemas associated with DLs. We developed a method to integrate and combine Instagram metadata and hashtags. The final result is a taxonomy, which provides innovative metadata with respect to the classification of resources, as images of Instagram and the user-generated content, that play a primary role in the context of modern DLs. The possibility of Instagram to localize the photos inserted by users allows us to interpret the most relevant and interesting informative content for a specific user type and in a specific location and to improve access, visibility and searching of library content. Full article
(This article belongs to the Special Issue Human–Computer Interaction and the Social Web)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>The resulting metadata taxonomy.</p>
Full article ">
9797 KiB  
Article
Routing Based on Information about the Routes of Fixed-Route Traveling Nodes and on Destination Areas Aimed at Reducing the Load on the DTN
by Kazuaki Okamoto and Kazumasa Takami
Future Internet 2016, 8(2), 15; https://doi.org/10.3390/fi8020015 - 27 Apr 2016
Cited by 2 | Viewed by 6074
Abstract
In recent years, the interest in delay/disruption tolerant networking (DTN) is growing as a means of communication in times of disaster. To ensure that a DTN works well in an emergency, it is desirable to promote general use of the DTN, so that [...] Read more.
In recent years, the interest in delay/disruption tolerant networking (DTN) is growing as a means of communication in times of disaster. To ensure that a DTN works well in an emergency, it is desirable to promote general use of the DTN, so that it will also be used in normal times. Since the DTN uses mobile terminals and vehicles, which are not dedicated network devices, as relay nodes, the routing method should be such that it does not impose a large processing load on relay nodes. This paper considers use of a DTN for a day-to-day service of delivering content to a specific area and proposes a new routing method that is based on information about the routes of fixed-route traveling nodes, such as public transportation vehicles. The destination of a bundle is specified not by a terminal identifier, but by an area, which is identified by its location information. This paper presents an outbound-type bundle protocol, which is used by relay nodes when they have received a forwarding-bundle request from a sending terminal and try to determine whether the bundle can reach its destination area. Using simulation, the superiority of the proposed routing was confirmed by comparing it to existing routing methods in terms of the bundle arrival rate and factors that affect the network load, such as the number of bundle copies, the number of hops and the maximum required buffer size. Full article
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Classification of existing and proposed delay/disruption tolerant networking (DTN) routing methods.</p>
Full article ">Figure 2
<p>Traveling route information-based routing and local content delivery.</p>
Full article ">Figure 3
<p>Two examples of destination area.</p>
Full article ">Figure 4
<p>Example of generating a circular covered area.</p>
Full article ">Figure 5
<p>Example of generating a vectorial covered area.</p>
Full article ">Figure 6
<p>Layout example of the destination area and covered areas.</p>
Full article ">Figure 7
<p>Routing example.</p>
Full article ">Figure 8
<p>DTN protocol stack. Note: T; Transport, N; Network.</p>
Full article ">Figure 9
<p>The control protocol part and the bundle relay protocol part for traveling route information-based routing.</p>
Full article ">Figure 10
<p>Bundle relay sections between the sending node and the receiving node.</p>
Full article ">Figure 11
<p>Procedure for sending a bundle from the sending node to a relay node. Note: the bold arrow shows that a bundle copy is sent.</p>
Full article ">Figure 12
<p>Structures of the messages exchanged between the sending node and a relay node.</p>
Full article ">Figure 13
<p>Procedure for relaying a bundle between relay nodes. Note: the bold arrow shows that a bundle copy is sent.</p>
Full article ">Figure 14
<p>Structures of the messages exchanged between relay nodes.</p>
Full article ">Figure 15
<p>Procedure for relaying a bundle between relay nodes. Note: the bold arrow shows that a bundle copy is sent.</p>
Full article ">Figure 16
<p>Structures of messages exchanged between a relay node and a receiving node.</p>
Full article ">Figure 17
<p>Protocol stack used in the Scenargie simulator [<a href="#B15-futureinternet-08-00015" class="html-bibr">15</a>].</p>
Full article ">Figure 18
<p>Routes of the traveling nodes and locations of storage points.</p>
Full article ">Figure 19
<p>Locations of the sending nodes and destination areas. Note: JR; Japan Railway.</p>
Full article ">Figure 20
<p>Application conditions for existing routing methods.</p>
Full article ">Figure 21
<p>Number of bundles that were sent from sending nodes.</p>
Full article ">Figure 22
<p>Bundle arrival rate.</p>
Full article ">Figure 23
<p>How to measure the number of copies.</p>
Full article ">Figure 24
<p>Percentage of the reduction in the number of copies.</p>
Full article ">Figure 25
<p>How to measure the number of hops.</p>
Full article ">Figure 26
<p>How the required buffer size of a node varies over time.</p>
Full article ">Figure 27
<p>Distribution of the maximum required buffer sizes.</p>
Full article ">Figure 28
<p>Comparison in terms of the maximum covered area size.</p>
Full article ">Figure 29
<p>Characteristics of the proposed and other methods selected for comparison. (<b>a</b>) Percentage of reduction in the bundle arrival rate and the numbers of copies; (<b>b</b>) percentages of reduction in the number of hops and the maximum required buffer size.</p>
Full article ">
3066 KiB  
Article
The Evolution of Wikipedia’s Norm Network
by Bradi Heaberlin and Simon DeDeo
Future Internet 2016, 8(2), 14; https://doi.org/10.3390/fi8020014 - 20 Apr 2016
Cited by 28 | Viewed by 39771
Abstract
Social norms have traditionally been difficult to quantify. In any particular society, their sheer number and complex interdependencies often limit a system-level analysis. One exception is that of the network of norms that sustain the online Wikipedia community. We study the fifteen-year evolution [...] Read more.
Social norms have traditionally been difficult to quantify. In any particular society, their sheer number and complex interdependencies often limit a system-level analysis. One exception is that of the network of norms that sustain the online Wikipedia community. We study the fifteen-year evolution of this network using the interconnected set of pages that establish, describe, and interpret the community’s norms. Despite Wikipedia’s reputation for ad hoc governance, we find that its normative evolution is highly conservative. The earliest users create norms that both dominate the network and persist over time. These core norms govern both content and interpersonal interactions using abstract principles such as neutrality, verifiability, and assume good faith. As the network grows, norm neighborhoods decouple topologically from each other, while increasing in semantic coherence. Taken together, these results suggest that the evolution of Wikipedia’s norm network is akin to bureaucratic systems that predate the information age. Full article
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Cumulative growth in policy (red/solid line) and non-policy (green/dashed line) pages, overlaid on active population (blue/dotted line). Policy creation precedes the arrival of the majority of users, while the creation of non-policy pages, usually in the form of essay and commentary, lags the growth in population.</p>
Full article ">Figure 2
<p>Evolution of the Gini coefficient over time. As new pages enter the system, overall network inequality increases, stabilizing in 2008.</p>
Full article ">Figure 3
<p>Evolution of influence overlap among the core norms (top twenty norms by eigenvector centrality) over time (solid line, labeled). In terms of the pages they influence, core norms draw apart over time, stabilizing in 2008. At the same time, semantic coherence (dashed line, labeled) increases. Neighborhoods become topologically distinct, but internally coherent.</p>
Full article ">Figure 4
<p>The topology of the norm network is organized around five central clusters, found using the Louvain algorithm. Cluster themes are based on a sample of high-eigenvector centrality (EC) nodes in each cluster and confirmed by reference to a topic model of word usage. Left panel: full network, with cluster membership indicated by color. Right panel: cluster structure. Each node is a Louvain cluster, and node size indicates cluster size by number of pages. Edge weights are defined as the fraction of the origin cluster’s out-links that link to each other cluster (self-loops are not shown).</p>
Full article ">Figure 5
<p>The relationship between EC of a page and the percent of the network’s page views it accumulates.</p>
Full article ">Figure 6
<p>Important pages are old, but not all old pages are important. Left panel: page age (from the end of our data, in August 2015) <span class="html-italic">vs.</span> eigenvector centrality; “core norms” (top twenty pages by EC) are marked by a lower bound in EC and a lower bound in age. While the very top pages in the hierarchy are all old (in the top-right region), there are many old pages that have eigenvector centrality comparable to much younger pages. Right panel: number of (unique) editors on the page <span class="html-italic">vs.</span> eigenvector centrality. A much tighter correlation shows that pages that attract many unique editors have higher EC. When both effects are taken into account in a simple linear regression model, the number of editors dominates.</p>
Full article ">Figure 7
<p>Ranked eigenvector centrality for pages, broken out by page category. Policy (blue diamond) and guideline (red plus) pages dominate the system. More interpretive essays (green squares; includes humor and related pages), the most common by number, appear at lower relative rank; the highest ranked essay, for example, has lower centrality than the 10th ranked policy. Proposals, failed or current (grey triangles), are the lowest ranked of all.</p>
Full article ">Figure 8
<p>Eigenvector centrality for all the pages in our data, ordered by rank. Major divisions (see text) are marked by vertical lines.</p>
Full article ">Figure 9
<p>The average local clustering coefficient, as a function of time. Despite large-scale changes in overall network properties, this local property remains remarkably constant.</p>
Full article ">
4082 KiB  
Article
Modeling and Security in Cloud Ecosystems
by Eduardo B. Fernandez, Nobukazu Yoshioka, Hironori Washizaki and Madiha H. Syed
Future Internet 2016, 8(2), 13; https://doi.org/10.3390/fi8020013 - 20 Apr 2016
Cited by 26 | Viewed by 9550
Abstract
Clouds do not work in isolation but interact with other clouds and with a variety of systems either developed by the same provider or by external entities with the purpose to interact with them; forming then an ecosystem. A software ecosystem is a [...] Read more.
Clouds do not work in isolation but interact with other clouds and with a variety of systems either developed by the same provider or by external entities with the purpose to interact with them; forming then an ecosystem. A software ecosystem is a collection of software systems that have been developed to coexist and evolve together. The stakeholders of such a system need a variety of models to give them a perspective of the possibilities of the system, to evaluate specific quality attributes, and to extend the system. A powerful representation when building or using software ecosystems is the use of architectural models, which describe the structural aspects of such a system. These models have value for security and compliance, are useful to build new systems, can be used to define service contracts, find where quality factors can be monitored, and to plan further expansion. We have described a cloud ecosystem in the form of a pattern diagram where its components are patterns and reference architectures. A pattern is an encapsulated solution to a recurrent problem. We have recently expanded these models to cover fog systems and containers. Fog Computing is a highly-virtualized platform that provides compute, storage, and networking services between end devices and Cloud Computing Data Centers; a Software Container provides an execution environment for applications sharing a host operating system, binaries, and libraries with other containers. We intend to use this architecture to answer a variety of questions about the security of this system as well as a reference to design interacting combinations of heterogeneous components. We defined a metamodel to relate security concepts which is being expanded. Full article
(This article belongs to the Special Issue Security in Cloud Computing and Big Data)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>A cloud ecosystem (showing its latest additions).</p>
Full article ">Figure 2
<p>Secure Virtual Machine Image (VMI) Repository System.</p>
Full article ">Figure 3
<p>Class diagram of the CASB pattern.</p>
Full article ">Figure 4
<p>Sequence diagram for the use case “Access an application service”.</p>
Full article ">Figure 5
<p>Two containers sharing one OS.</p>
Full article ">Figure 6
<p>Class diagram of the container pattern.</p>
Full article ">Figure 7
<p>Class diagram of the Fog Computing pattern.</p>
Full article ">Figure 8
<p>Metamodel for security concepts.</p>
Full article ">Figure 9
<p>Metamodel and cloud services.</p>
Full article ">
709 KiB  
Article
A Method for Assessing the Performance of e-Government Twitter Accounts
by Konstantinos Antoniadis, Kostas Zafiropoulos and Vasiliki Vrana
Future Internet 2016, 8(2), 12; https://doi.org/10.3390/fi8020012 - 18 Apr 2016
Cited by 8 | Viewed by 6830
Abstract
This paper introduces a method for assessing the influence of Twitter accounts of central e-government agencies. It first stresses the importance of activity and popularity of the e-government accounts, and also the importance of community formation among followers-citizens, as the two main stages [...] Read more.
This paper introduces a method for assessing the influence of Twitter accounts of central e-government agencies. It first stresses the importance of activity and popularity of the e-government accounts, and also the importance of community formation among followers-citizens, as the two main stages of e-government adoption. The proposed approach combines activity and popularity of the accounts and followers’ community characteristics in a ranking system, using an idea originally introduced to measure blogosphere authority. A Twitter Authority Index is produced. The method is demonstrated through an extended example: 56 Twitter accounts of ministries of EU countries are sorted according to their indexes in the proposed ranking system. Detailed values for the ministries’ accounts and average values for the countries that the ministries belong to are reported and commented. Full article
Show Figures

Figure 1

Figure 1
<p>Scatterplot of PC “activity/popularity” against its ranks.</p>
Full article ">Figure 2
<p>Scatterplot of PC “centrality” against its ranks.</p>
Full article ">Figure 3
<p>Scatterplot of PC “community formation” against its ranks.</p>
Full article ">
174 KiB  
Article
Environmental Factors Affecting Where People Geocache
by Jennifer Golbeck and Carman Neustaedter
Future Internet 2016, 8(2), 11; https://doi.org/10.3390/fi8020011 - 12 Apr 2016
Cited by 5 | Viewed by 5674
Abstract
Outdoor leisure activities are important for public health as well as family cohesiveness, yet environmental factors may easily affect someone’s ability to participate in such activities. We explored this with a focus on the social web-based treasure hunt game called Geocaching. We collected [...] Read more.
Outdoor leisure activities are important for public health as well as family cohesiveness, yet environmental factors may easily affect someone’s ability to participate in such activities. We explored this with a focus on the social web-based treasure hunt game called Geocaching. We collected data on all US and Canadian geocaches from OpenCaching.com and conducted an online survey with twenty geocachers as a follow-up to our data analysis. Data analysis showed that geocaches were more often found in areas that were wealthier, better educated, younger, and more urban, and had higher population density and better weather. Survey results showed similar trends: Most people actively thought about where they would cache and tried to minimize risks, despite cache hiders thinking less about these concerns. These results further emphasize the importance of environmental factors when it comes to participation in outdoor activities and leads to Human–Computer Interaction design implications for location-based online social activities. Full article
(This article belongs to the Special Issue Human–Computer Interaction and the Social Web)
2491 KiB  
Article
FaceMashup: An End-User Development Tool for Social Network Data
by Daniele Massa and Lucio Davide Spano
Future Internet 2016, 8(2), 10; https://doi.org/10.3390/fi8020010 - 29 Mar 2016
Cited by 5 | Viewed by 10306
Abstract
Every day, each active social network user produces and shares texts, images and videos. While developers can access such data through application programming interfaces (APIs) for creating games, visualizations and routines, end users have less control on such information. Their access is mediated [...] Read more.
Every day, each active social network user produces and shares texts, images and videos. While developers can access such data through application programming interfaces (APIs) for creating games, visualizations and routines, end users have less control on such information. Their access is mediated by the social application features, which limits them in combining sources, filtering results and performing actions on groups of elements. In order to fill this gap, we introduce FaceMashup, an end user development (EUD) environment supporting the manipulation of the Facebook graph. We describe the tool interface, documenting the choices we made during the design iterations. Data types are represented through widgets containing user interface (UI) elements similar to those used in the social network application. Widgets can be connected with each other with the drag and drop of their inner fields, and the application updates their content. Finally, we report the results of a user-test on the FaceMashup prototype, which shows a good acceptance of the environment by end-users. Full article
(This article belongs to the Special Issue Human–Computer Interaction and the Social Web)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>A mock-up of the social network application (SNA) solving the scenario problem with the first FaceMashup design, which used a pipe paradigm for connecting data (blue boxes), filters (green boxes) and actions (yellow boxes).</p>
Full article ">Figure 2
<p>A sample Social Network Application developed with FaceMashup.</p>
Full article ">Figure 3
<p>Two examples of content widgets: photo (<b>a</b>) and friend list (<b>b</b>).</p>
Full article ">Figure 4
<p>Examples of place (<b>a</b>) and tagger (<b>b</b>) widgets, together with a set of stickers providing help to the SNA user (<b>c</b>).</p>
Full article ">Figure 5
<p>A photo widget immediately after adding it into the environment.</p>
Full article ">Figure 6
<p>Example of user feedback while dragging a field from a widget into another. The (<b>a</b>) part shows the information displayed about the data field, while the (<b>b</b>) part shows the environment suggestion (which may be more than one) for dropping the selected field.</p>
Full article ">Figure 7
<p>Temporal relationships representation’ in FaceMashup: the sequence with the vertical axis, parallelism with the horizontal axis.</p>
Full article ">Figure 8
<p>Content filtering for a photo widget. In the (<b>a</b>) part, the user manually selects the photos to be retrieved. In the (<b>b</b>) part, the user defines a filter that automatically selects the posts created in location specified in another widget. Clicking the “Field connected” button, the environment automatically highlights the data source.</p>
Full article ">Figure 9
<p>Stickers are used for supporting other SNA users in interacting with the application and makes it more aesthetically pleasant.</p>
Full article ">Figure 10
<p>FaceMashup architecture.</p>
Full article ">Figure 11
<p>Task completion time in seconds. The white boxes represent the time required for planning the task on Facebook, while light-blue boxes represent the completion time with FaceMashup.</p>
Full article ">Figure 12
<p>Evaluation questionnaire results. The ratings range from 1 (most negative) to 7 (most positive). The SUS [<a href="#B16-futureinternet-08-00010" class="html-bibr">16</a>] questions having a negative connotation are reported with inverted ratings.</p>
Full article ">
1790 KiB  
Article
User Perception of Facebook App Data Access: A Comparison of Methods and Privacy Concerns
by Jennifer Golbeck and Matthew Louis Mauriello
Future Internet 2016, 8(2), 9; https://doi.org/10.3390/fi8020009 - 25 Mar 2016
Cited by 27 | Viewed by 11930
Abstract
Users share vast amounts of personal information online, but are they fully aware of what information they are sharing and with whom? In this paper, we focused on Facebook apps and set out to understand how concerned users are about privacy and how [...] Read more.
Users share vast amounts of personal information online, but are they fully aware of what information they are sharing and with whom? In this paper, we focused on Facebook apps and set out to understand how concerned users are about privacy and how well-informed they are about what personal data apps can access. We found that initially, subjects were generally under-informed about what data apps could access from their profiles. After viewing additional information about these permissions, subjects’ concern about privacy on Facebook increased. Subjects’ understanding of what data apps were able to access increased, although even after receiving explicit information on the topic, many subjects still did not fully understand the extent to which apps could access their data. Full article
(This article belongs to the Special Issue Human–Computer Interaction and the Social Web)
Show Figures

Figure 1

Figure 1
<p>A screen capture of the creepy Facebook Stalker looking at a person’s profile, taken as a screen capture from the Take This Lollipop video, the app used in our study.</p>
Full article ">Figure 2
<p>Data access requested by Take This Lollipop.</p>
Full article ">Figure 3
<p>The interface of the Facebook Data App.</p>
Full article ">Figure 4
<p>Data access requested by our App Permissions App.</p>
Full article ">
1860 KiB  
Article
Enhanced Local Fisher Discriminant Analysis for Indoor Positioning in Wireless Local Area Network
by Zhi-An Deng, Di Wu, Yiran Zhou and Zhenyu Na
Future Internet 2016, 8(2), 8; https://doi.org/10.3390/fi8020008 - 25 Mar 2016
Cited by 2 | Viewed by 5174
Abstract
Feature extraction methods have been used to extract location features for indoor positioning in wireless local area networks. However, existing methods, such as linear discriminant analysis and principal component analysis, all suffer from the multimodal property of signal distribution. This paper proposes a [...] Read more.
Feature extraction methods have been used to extract location features for indoor positioning in wireless local area networks. However, existing methods, such as linear discriminant analysis and principal component analysis, all suffer from the multimodal property of signal distribution. This paper proposes a novel method, based on enhanced local fisher discriminant analysis (LFDA). First, LFDA is proposed to extract discriminative location features. It maximizes between-class separability while preserving within-class local structure of signal space, thereby guaranteeing maximal discriminative information involved in positioning. Then, the generalization ability of LFDA is further enhanced using signal perturbation, which generates more number of representative training samples. Experimental results in realistic indoor environment show that, compared with previous feature extraction methods, the proposed method reduces the mean and standard deviation of positing error by 23.9% and 33.0%, respectively. Full article
(This article belongs to the Special Issue Future Mobile Computing)
Show Figures

Figure 1

Figure 1
<p>Multimodal distribution of RSS values at a fixed physical location.</p>
Full article ">Figure 2
<p>Overview of the proposed E-LFDA positioning method.</p>
Full article ">Figure 3
<p>Layout of reference and test points in realistic indoor environment.</p>
Full article ">Figure 4
<p>Positioning accuracy comparisons.</p>
Full article ">Figure 5
<p>Accuracy within 2 m <span class="html-italic">versus</span> feature dimensions.</p>
Full article ">Figure 6
<p>Cumulative percentage of eigenvalues <span class="html-italic">versus</span> feature dimensions.</p>
Full article ">Figure 7
<p>Accuracy within 2 m <span class="html-italic">versus</span> the number of training samples added per reference point by signal perturbation.</p>
Full article ">Figure 8
<p>Online computation cost comparisons (Calculation times of multiplications and additions).</p>
Full article ">
Previous Issue
Next Issue
Back to TopTop