Information

15 pages, 2143 KiB

Open AccessFeature PaperArticle

A Dynamic Fuzzy Approach Based on the EDAS Method for Multi-Criteria Subcontractor Evaluation

by Mehdi Keshavarz-Ghorabaee, Maghsoud Amiri, Edmundas Kazimieras Zavadskas, Zenonas Turskis and Jurgita Antucheviciene

Information 2018, 9(3), 68; https://doi.org/10.3390/info9030068 - 19 Mar 2018

Cited by 62 | Viewed by 7948

Abstract

Selection of appropriate subcontractors for outsourcing is very important for the success of construction projects. This can improve the overall quality of projects and promote the qualification and reputation of the main contractors. The evaluation of subcontractors can be made by some experts [...] Read more.

Selection of appropriate subcontractors for outsourcing is very important for the success of construction projects. This can improve the overall quality of projects and promote the qualification and reputation of the main contractors. The evaluation of subcontractors can be made by some experts or decision-makers with respect to some criteria. If this process is done in different time periods, it can be defined as a dynamic multi-criteria group decision-making (MCGDM) problem. In this study, we propose a new fuzzy dynamic MCGDM approach based on the EDAS (Evaluation based on Distance from Average Solution) method for subcontractor evaluation. In the procedure of the proposed approach, the sets of alternatives, criteria and decision-makers can be changed at different time periods. Also, the proposed approach gives more weight to newer decision information for aggregating the overall performance of alternatives. A numerical example is used to illustrate the proposed approach and show the application of it in subcontractor evaluation. The results demonstrate that the proposed approach is efficient and useful in real-world decision-making problems. Full article

(This article belongs to the Special Issue Multiple-Criteria Decision-Making (MCDM) Techniques for Business Processes Information Management)

► Show Figures

Figure 1

2 pages, 138 KiB

Open AccessEditorial

Special Issue on Context Awareness

by Daniele Riboni

Information 2018, 9(3), 67; https://doi.org/10.3390/info9030067 - 18 Mar 2018

Cited by 1 | Viewed by 3429

Abstract

Context-awareness is a fundamental ingredient of pervasive computing.[...] Full article

(This article belongs to the Special Issue Context Awareness)

18 pages, 874 KiB

Open AccessArticle

Non-Negative Tensor Factorization for Human Behavioral Pattern Mining in Online Games

by Anna Sapienza, Alessandro Bessi and Emilio Ferrara

Information 2018, 9(3), 66; https://doi.org/10.3390/info9030066 - 16 Mar 2018

Cited by 28 | Viewed by 7096

Abstract

Multiplayer online battle arena is a genre of online games that has become extremely popular. Due to their success, these games also drew the attention of our research community, because they provide a wealth of information about human online interactions and behaviors. A [...] Read more.

Multiplayer online battle arena is a genre of online games that has become extremely popular. Due to their success, these games also drew the attention of our research community, because they provide a wealth of information about human online interactions and behaviors. A crucial problem is the extraction of activity patterns that characterize this type of data, in an interpretable way. Here, we leverage the Non-negative Tensor Factorization to detect hidden correlated behaviors of playing in a well-known game: League of Legends. To this aim, we collect the entire gaming history of a group of about 1000 players, which accounts for roughly 100K matches. By applying our framework we are able to separate players into different groups. We show that each group exhibits similar features and playing strategies, as well as similar temporal trajectories, i.e., behavioral progressions over the course of their gaming history. We surprisingly discover that playing strategies are stable over time and we provide an explanation for this observation. Full article

(This article belongs to the Special Issue Data Mining for the Analysis of Performance and Success)

► Show Figures

Figure 1

Figure 1
Framework. Our methodology is divided into several steps. First, we use Decision Trees to find the features of the dataset that are meaningful in predicting users’ performance (the outcome is the feature “winner”). Once the features are selected, we create a tensor whose dimensions coincide to users, selected features, and time. We then decompose the tensor by applying NTF and detect the factor matrices A, B, and C, providing the users’ and features membership, and temporal activity respectively. Finally, we use this information to analyze the discovered groups of users characterized by similar features and temporal behavior. Full article ">Figure 2
Feature membership in the components: we show the matrix <math display="inline"> <semantics> <mi mathvariant="bold">B</mi> </semantics> </math> in which we zero-out the entries which are not included in the <math display="inline"> <semantics> <mrow> <mn>95</mn> <mo>%</mo> </mrow> </semantics> </math> of the norm of the component. Here, the colorbar indicates the level of membership of each feature to the three different components. The features are respectively: assists (0), deaths (1), kills (2), and gold (3). Full article ">Figure 3
K-means results: (a) 2-dimensional projection of the three clusters identified by the k-means. Each dot represents a player in its corresponding cluster, and the dot’s coordinates are given by the first two columns of the matrix <math display="inline"> <semantics> <mi mathvariant="bold">A</mi> </semantics> </math>. (b) Silhouette scores of the users belonging to the three clusters. The red line identifies the final Silhouette score of 0.35, and the width of the Silhouette profiles indicates the size of the corresponding clusters. Full article ">Figure 4
Membership modulated in time, given by the product <math display="inline"> <semantics> <mrow> <msub> <mi mathvariant="bold">a</mi> <mi>r</mi> </msub> <msubsup> <mi mathvariant="bold">c</mi> <mi>r</mi> <mi>T</mi> </msubsup> </mrow> </semantics> </math>. The product is computed by separately taking into account the users belonging to the different clusters. For each cluster we report the mean of the users’ membership to each component over time, and the related standard error, marked with an error bar. Different shades of blue for cluster 0, red for cluster 1, and green for cluster 2 are assigned to distinguish the components. Full article ">Figure 5
Mean values and related standard errors over time of: (a) number of assists; (b) number of deaths; (c) number of kills; and (d) amount of gold earned. We computed the mean and the standard error over the values related to users belonging to the same cluster. Clusters are marked by a unique symbol and color, which is maintained in all the figures, to highlight the different cluster characteristics. Full article ">Figure 6
Temporal activity of each component. The values displayed coincide to those in the columns of <math display="inline"> <semantics> <mi mathvariant="bold">C</mi> </semantics> </math>. The different markers characterize the different components, according to the clusters colouring. Full article ">Figure 7
Kernel Density Estimation (KDE) computed on the values related to the feature winner (binary feature equal to 1 if a player wins the match and equal to 0 if a player loses). The figure shows the probability density function for each cluster. We maintained the color code used throughout the text to discriminate the different clusters. Full article ">

42 pages, 10819 KiB

Open AccessArticle

Storytelling and Visualization: An Extended Survey

by Chao Tong, Richard Roberts, Rita Borgo, Sean Walton, Robert S. Laramee, Kodzo Wegba, Aidong Lu, Yun Wang, Huamin Qu, Qiong Luo and Xiaojuan Ma

Information 2018, 9(3), 65; https://doi.org/10.3390/info9030065 - 14 Mar 2018

Cited by 99 | Viewed by 25046

Abstract

Throughout history, storytelling has been an effective way of conveying information and knowledge. In the field of visualization, storytelling is rapidly gaining momentum and evolving cutting-edge techniques that enhance understanding. Many communities have commented on the importance of storytelling in data visualization. Storytellers [...] Read more.

Throughout history, storytelling has been an effective way of conveying information and knowledge. In the field of visualization, storytelling is rapidly gaining momentum and evolving cutting-edge techniques that enhance understanding. Many communities have commented on the importance of storytelling in data visualization. Storytellers tend to be integrating complex visualizations into their narratives in growing numbers. In this paper, we present a survey of storytelling literature in visualization and present an overview of the common and important elements in storytelling visualization. We also describe the challenges in this field as well as a novel classification of the literature on storytelling in visualization. Our classification scheme highlights the open and unsolved problems in this field as well as the more mature storytelling sub-fields. The benefits offer a concise overview and a starting point into this rapidly evolving research trend and provide a deeper understanding of this topic. Full article

(This article belongs to the Section Information Theory and Methodology)

► Show Figures

Figure 1

21 pages, 1062 KiB

Open AccessArticle

Distributed State Estimation under State Inequality Constraints with Random Communication over Multi-Agent Networks

by Chen Hu, Zhenhua Li, Haoshen Lin, Bing He and Gang Liu

Information 2018, 9(3), 64; https://doi.org/10.3390/info9030064 - 13 Mar 2018

Viewed by 3781

Abstract

In this paper, we investigate distributed state estimation for multi-agent networks with random communication, where the state is constrained by an inequality. In order to deal with the problem of environmental/communication uncertainties and to save energy, we introduce two random schemes, including a [...] Read more.

In this paper, we investigate distributed state estimation for multi-agent networks with random communication, where the state is constrained by an inequality. In order to deal with the problem of environmental/communication uncertainties and to save energy, we introduce two random schemes, including a random sleep scheme and an event-triggered scheme. With the help of Kalman-consensus filter and projection on the constrained set, we propose two random distributed estimation algorithm. The estimation of each agent is achieved by projecting the consensus estimate, which is obtained by virtue of random exchange information with its neighbors. The estimation error is shown to be bounded with probability one when the agents randomly take the measurement or communicate with their neighbors. We show the stability of proposed algorithm based on Lyapunov method and projection and demonstrate their effectiveness via numerical simulations. Full article

► Show Figures

Figure 1

17 pages, 2065 KiB

Open AccessArticle

An Anti-Collision Algorithm for RFID Based on an Array and Encoding Scheme

by Baolong Liu and Xiaohao Su

Information 2018, 9(3), 63; https://doi.org/10.3390/info9030063 - 10 Mar 2018

Cited by 9 | Viewed by 5165

Abstract

In order to solve the problem of tag collision in Radio Frequency Identification (RFID) system, the paper proposes a Multi-Bit Identification Collision Tree (MICT) algorithm based on a collision tree. The algorithm uses an array scheme to mark the collision bits in the [...] Read more.

In order to solve the problem of tag collision in Radio Frequency Identification (RFID) system, the paper proposes a Multi-Bit Identification Collision Tree (MICT) algorithm based on a collision tree. The algorithm uses an array scheme to mark the collision bits in the identification process, and determines the collision information according to the first few bits of the tag, which can effectively reduce the number of recognitions and the amount of communication data. The testing results show that the proposed algorithm reduces the time complexity by about 38% and the communication complexity by about 27% compared to existing collision-tree-based algorithms. Through theoretical analysis and experimental evaluation, the MICT algorithm has obvious advantages in terms of time and communication complexity compared to the other typical algorithms. The algorithm can be applied to the field of RFID-related systems to significantly improve the system efficiency. Full article

(This article belongs to the Section Information and Communications Technology)

► Show Figures

Figure 1

15 pages, 1768 KiB

Open AccessArticle

On the Performance of the Cache Coding Protocol

by Behnaz Maboudi, Hadi Sehat, Peyman Pahlevani and Daniel E. Lucani

Information 2018, 9(3), 62; https://doi.org/10.3390/info9030062 - 10 Mar 2018

Cited by 2 | Viewed by 4252

Abstract

Network coding approaches typically consider an unrestricted recoding of coded packets in the relay nodes to increase performance. However, this can expose the system to pollution attacks that cannot be detected during transmission, until the receivers attempt to recover the data. To prevent [...] Read more.

Network coding approaches typically consider an unrestricted recoding of coded packets in the relay nodes to increase performance. However, this can expose the system to pollution attacks that cannot be detected during transmission, until the receivers attempt to recover the data. To prevent these attacks while allowing for the benefits of coding in mesh networks, the cache coding protocol was proposed. This protocol only allows recoding at the relays when the relay has received enough coded packets to decode an entire generation of packets. At that point, the relay node recodes and signs the recoded packets with its own private key, allowing the system to detect and minimize the effect of pollution attacks and making the relays accountable for changes on the data. This paper analyzes the delay performance of cache coding to understand the security-performance trade-off of this scheme. We introduce an analytical model for the case of two relays in an erasure channel relying on an absorbing Markov chain and an approximate model to estimate the performance in terms of the number of transmissions before successfully decoding at the receiver. We confirm our analysis using simulation results. We show that cache coding can overcome the security issues of unrestricted recoding with only a moderate decrease in system performance. Full article

(This article belongs to the Special Issue Network and Rateless Coding for Video Streaming)

► Show Figures

Figure 1

14 pages, 2282 KiB

Open AccessArticle

Online Learning of Discriminative Correlation Filter Bank for Visual Tracking

by Jian Wei and Feng Liu

Information 2018, 9(3), 61; https://doi.org/10.3390/info9030061 - 9 Mar 2018

Cited by 5 | Viewed by 4844

Abstract

Accurate visual tracking is a challenging research topic in the field of computer vision. The challenge emanates from various issues, such as target deformation, background clutter, scale variations, and occlusion. In this setting, discriminative correlation filter (DCF)-based trackers have demonstrated excellent performance in [...] Read more.

Accurate visual tracking is a challenging research topic in the field of computer vision. The challenge emanates from various issues, such as target deformation, background clutter, scale variations, and occlusion. In this setting, discriminative correlation filter (DCF)-based trackers have demonstrated excellent performance in terms of speed. However, existing correlation filter-based trackers cannot handle major changes in appearance due to severe occlusions, which eventually result in the development of a bounding box for target drift tracking. In this study, we use a set of DCFs called discriminative correlation filter bank (DCFB) for visual tracking to address the key causes of object occlusion and drift in a tracking-by-detection framework. In this work, we treat thxe current location of the target frame as the center, extract several samples around the target, and perform online learning of DCFB. The sliding window then extracts numerous samples within a large radius of the area where the object in the next frame is previously located. These samples are used for the DCFB to perform correlation operation in the Fourier domain to estimate the location of the new object; the coordinates of the largest correlation scores indicate the position of the new target. The DCFB is updated according to the location of the new target. Experimental results on the quantitative and qualitative evaluations on the challenging benchmark sequences show that the proposed framework improves tracking performance compared with several state-of-the-art trackers. Full article

► Show Figures

Figure 1

Figure 1
Overview of the proposed DCFB-based visual tracking algorithm. The operator ⨀ is the Hadamard product. Full article ">Figure 2
Overview of the training process. Full article ">Figure 3
Overview of the testing process. Full article ">Figure 4
Precision and success plots over all sequences using OPE on the OTB100 dataset. The average score on DP at 20 pixels for each tracker is shown in the legend of the precision plot. The legend of the success plot contains the area-under-the-curve (AUC) score for each tracker. Full article ">Figure 5
Precision and success plots of OPE during occlusion. The legend contains the AUC score for each tracker. Full article ">Figure 6
Qualitative evaluation of our approach in comparison with four state-of-the-art trackers. Tracking results for eight challenges of occlusion sequences (Basketball, Bolt, coke, David3, Faceocc1, Jogging1, Soccer, and Woman) from the OTB100 dataset are shown. Our approach outperforms the state-of-the-art trackers in these occlusion scenarios. Full article ">

13 pages, 1677 KiB

Open AccessArticle

Enhancement of RWSN Lifetime via Firework Clustering Algorithm Validated by ANN

by Ahmad Ali, Yu Ming, Tapas Si, Saima Iram and Sagnik Chakraborty

Information 2018, 9(3), 60; https://doi.org/10.3390/info9030060 - 9 Mar 2018

Cited by 25 | Viewed by 4835

Abstract

Nowadays, wireless power transfer is ubiquitously used in wireless rechargeable sensor networks (WSNs). Currently, the energy limitation is a grave concern issue for WSNs. However, lifetime enhancement of sensor networks is a challenging task need to be resolved. For addressing this issue, a [...] Read more.

Nowadays, wireless power transfer is ubiquitously used in wireless rechargeable sensor networks (WSNs). Currently, the energy limitation is a grave concern issue for WSNs. However, lifetime enhancement of sensor networks is a challenging task need to be resolved. For addressing this issue, a wireless charging vehicle is an emerging technology to expand the overall network efficiency. The present study focuses on the enhancement of overall network lifetime of the rechargeable wireless sensor network. To resolve the issues mentioned above, we propose swarm intelligence based hard clustering approach using fireworks algorithm with the adaptive transfer function (FWA-ATF). In this work, the virtual clustering method has been applied in the routing process which utilizes the firework optimization algorithm. Still now, an FWA-ATF algorithm yet not applied by any researcher for RWSN. Furthermore, the validation study of the proposed method using the artificial neural network (ANN) backpropagation algorithm incorporated in the present study. Different algorithms are applied to evaluate the performance of proposed technique that gives the best results in this mechanism. Numerical results indicate that our method outperforms existing methods and yield performance up to 80% regarding energy consumption and vacation time of wireless charging vehicle. Full article

► Show Figures

Figure 1

56 pages, 1878 KiB

Open AccessArticle

Efficient Delivery of Scalable Video Using a Streaming Class Model

by Jason J. Quinlan, Ahmed H. Zahran and Cormac J. Sreenan

Information 2018, 9(3), 59; https://doi.org/10.3390/info9030059 - 8 Mar 2018

Cited by 2 | Viewed by 5981

Abstract

When we couple the rise in video streaming with the growing number of portable devices (smart phones, tablets, laptops), we see an ever-increasing demand for high-definition video online while on the move. Wireless networks are inherently characterised by restricted shared bandwidth and relatively [...] Read more.

When we couple the rise in video streaming with the growing number of portable devices (smart phones, tablets, laptops), we see an ever-increasing demand for high-definition video online while on the move. Wireless networks are inherently characterised by restricted shared bandwidth and relatively high error loss rates, thus presenting a challenge for the efficient delivery of high quality video. Additionally, mobile devices can support/demand a range of video resolutions and qualities. This demand for mobile streaming highlights the need for adaptive video streaming schemes that can adjust to available bandwidth and heterogeneity, and can provide a graceful changes in video quality, all while respecting viewing satisfaction. In this context, the use of well-known scalable/layered media streaming techniques, commonly known as scalable video coding (SVC), is an attractive solution. SVC encodes a number of video quality levels within a single media stream. This has been shown to be an especially effective and efficient solution, but it fares badly in the presence of datagram losses. While multiple description coding (MDC) can reduce the effects of packet loss on scalable video delivery, the increased delivery cost is counterproductive for constrained networks. This situation is accentuated in cases where only the lower quality level is required. In this paper, we assess these issues and propose a new approach called Streaming Classes (SC) through which we can define a key set of quality levels, each of which can be delivered in a self-contained manner. This facilitates efficient delivery, yielding reduced transmission byte-cost for devices requiring lower quality, relative to MDC and Adaptive Layer Distribution (ALD) (42% and 76% respective reduction for layer 2), while also maintaining high levels of consistent quality. We also illustrate how selective packetisation technique can further reduce the effects of packet loss on viewable quality by leveraging the increase in the number of frames per group of pictures (GOP), while offering a means of reducing overall error correction and by providing equality of data in every packet transmitted per GOP. Full article

(This article belongs to the Special Issue Network and Rateless Coding for Video Streaming)

► Show Figures

Figure 1

14 pages, 1557 KiB

Open AccessArticle

Blind Channel Estimation for FBMC/OQAM Systems Based on Subspace Approach

by Han Wang, Jianqing Liao, Lingwei Xu and Xianpeng Wang

Information 2018, 9(3), 58; https://doi.org/10.3390/info9030058 - 8 Mar 2018

Cited by 7 | Viewed by 4486

Abstract

The conventional channel estimation schemes for filter bank multicarrier with offset quadrature amplitude modulation (FBMC/OQAM) systems are mainly based on preamble methods. However, the utilization of preamble for channel estimation decreases the system’s spectrum efficiency. In this paper, we propose a modified subspace [...] Read more.

The conventional channel estimation schemes for filter bank multicarrier with offset quadrature amplitude modulation (FBMC/OQAM) systems are mainly based on preamble methods. However, the utilization of preamble for channel estimation decreases the system’s spectrum efficiency. In this paper, we propose a modified subspace blind channel estimation method for FBMC/OQAM systems. The proposed method distinguishes itself from previously preamble based methods by utilizing spatial diversity technique to introduce data redundancy for blind channel estimation, which leads to high spectral utilization. Thus, the proposed method can provide significant root mean square error (RMSE) performance improvement compared to conventional preamble based methods at high SNRs. Simulation results verify the validity of the proposed method in FBMC/OQAM systems. Full article

(This article belongs to the Section Information and Communications Technology)

► Show Figures

Figure 1

14 pages, 2116 KiB

Open AccessArticle

Information Ecology in the Context of General Ecology

by Mark Burgin and Yixin Zhong

Information 2018, 9(3), 57; https://doi.org/10.3390/info9030057 - 8 Mar 2018

Cited by 8 | Viewed by 7183

Abstract

The ecological approach studied in this paper is a new level of information studies. It allows for achieving a better understanding of information processes in society as well as more efficient creation of information processing systems. At first, in Section 2, we describe [...] Read more.

The ecological approach studied in this paper is a new level of information studies. It allows for achieving a better understanding of information processes in society as well as more efficient creation of information processing systems. At first, in Section 2, we describe and analyze ecological studies in different areas ranging from biology to technology to sociology to knowledge and information. Then, in Section 3, we present elements of general ecology building methodological and philosophical foundation for information ecology. In Section 4 and Section 5, we elaborate a concise definition of information ecology and further develop information ecology as a methodological base for information studies in general based on the concepts and principles of the general theory of information. Full article

(This article belongs to the Section Information Theory and Methodology)

► Show Figures

Figure 1

14 pages, 2752 KiB

Open AccessArticle

Residual Recurrent Neural Networks for Learning Sequential Representations

by Boxuan Yue, Junwei Fu and Jun Liang

Information 2018, 9(3), 56; https://doi.org/10.3390/info9030056 - 6 Mar 2018

Cited by 69 | Viewed by 8340

Abstract

Recurrent neural networks (RNN) are efficient in modeling sequences for generation and classification, but their training is obstructed by the vanishing and exploding gradient issues. In this paper, we reformulate the RNN unit to learn the residual functions with reference to the hidden [...] Read more.

Recurrent neural networks (RNN) are efficient in modeling sequences for generation and classification, but their training is obstructed by the vanishing and exploding gradient issues. In this paper, we reformulate the RNN unit to learn the residual functions with reference to the hidden state instead of conventional gated mechanisms such as long short-term memory (LSTM) and the gated recurrent unit (GRU). The residual structure has two main highlights: firstly, it solves the gradient vanishing and exploding issues for large time-distributed scales; secondly, the residual structure promotes the optimizations for backward updates. In the experiments, we apply language modeling, emotion classification and polyphonic modeling to evaluate our layer compared with LSTM and GRU layers. The results show that our layer gives state-of-the-art performance, outperforms LSTM and GRU layers in terms of speed, and supports an accuracy competitive with that of the other methods. Full article

► Show Figures

Figure 1

15 pages, 437 KiB

Open AccessArticle

A Novel Approach for Group Decision-Making from Intuitionistic Fuzzy Preference Relations and Intuitionistic Multiplicative Preference Relations

by Rui Wang and Yan-Lai Li

Information 2018, 9(3), 55; https://doi.org/10.3390/info9030055 - 5 Mar 2018

Cited by 2 | Viewed by 3953

Abstract

During the decision-making process, evaluation information may be given in different formats based on the decision makers’ research fields or personal customs. To address the situation that alternatives are evaluated by both intuitionistic fuzzy preference relations (IFPRs) and intuitionistic multiplicative preference relations (IMPRs), [...] Read more.

During the decision-making process, evaluation information may be given in different formats based on the decision makers’ research fields or personal customs. To address the situation that alternatives are evaluated by both intuitionistic fuzzy preference relations (IFPRs) and intuitionistic multiplicative preference relations (IMPRs), a new priority approach based on a net flow score function is proposed. First, the two preference relations above are transformed into the corresponding interval-valued fuzzy preference relations (IVFPRs) and interval-valued multiplicative preference relations (IVMPRs), respectively. Second, the net flow score functions of individual IFPRs and IMPRs are obtained. Third, according to information theory, a mean deviation maximization model is constructed to compute the weights of decision-makers objectively. Finally, the collective net flow score of each alternative is obtained to determine the ranking result. The proposed method is certified to be simple, valid, and practical with three examples. Full article

► Show Figures

Figure 1

16 pages, 5065 KiB

Open AccessArticle

Unix Domain Sockets Applied in Android Malware Should Not Be Ignored

by Xu Jiang, Dejun Mu and Huixiang Zhang

Information 2018, 9(3), 54; https://doi.org/10.3390/info9030054 - 4 Mar 2018

Cited by 1 | Viewed by 7380

Abstract

Increasingly, malicious Android apps use various methods to steal private user data without their knowledge. Detecting the leakage of private data is the focus of mobile information security. An initial investigation found that none of the existing security analysis systems can track the [...] Read more.

Increasingly, malicious Android apps use various methods to steal private user data without their knowledge. Detecting the leakage of private data is the focus of mobile information security. An initial investigation found that none of the existing security analysis systems can track the flow of information through Unix domain sockets to detect the leakage of private data through such sockets, which can result in zero-day exploits in the information security field. In this paper, we conduct the first systematic study on Unix domain sockets as applied in Android apps. Then, we identify scenarios in which such apps can leak private data through Unix domain sockets, which the existing dynamic taint analysis systems do not catch. Based on these insights, we propose and implement JDroid, a taint analysis system that can track information flows through Unix domain sockets effectively to detect such privacy leaks. Full article

► Show Figures

Figure 1

20 pages, 1393 KiB

Open AccessArticle

On the Users’ Acceptance of IoT Systems: A Theoretical Approach

by Rino Falcone and Alessandro Sapienza

Information 2018, 9(3), 53; https://doi.org/10.3390/info9030053 - 1 Mar 2018

Cited by 31 | Viewed by 5725

Abstract

In the next future the IoT system will introduce extraordinary changes in our daily life. We will communicate with our domestic appliances to inform them about our preferences and goals and they will develop initiative and autonomy to be put at our service. [...] Read more.

In the next future the IoT system will introduce extraordinary changes in our daily life. We will communicate with our domestic appliances to inform them about our preferences and goals and they will develop initiative and autonomy to be put at our service. But are we sure that we can afford all the automation they could offer? Are we able to manage it? Is it compatible with our cognitive attitudes and our actual and real goals? In this paper, we face the question of the IoT from the point of view of the user. We start analyzing which reasons undermine the acceptance of IoT systems and then we propose a possible solution. The first contribution of this work is the level characterization of the autonomy a user can grant to an IoT device. The second contribution is a theoretical model to deal with users and to stimulate users’ acceptance. By the means of simulation, we show how the model works and we prove that it leads the system to an optimal solution. Full article

(This article belongs to the Special Issue Security in the Internet of Things)

► Show Figures

Figure 1

13 pages, 1278 KiB

Open AccessArticle

Multilingual and Multiword Phenomena in a lemon Old Occitan Medico-Botanical Lexicon

by Andrea Bellandi, Emiliano Giovannetti and Anja Weingart

Information 2018, 9(3), 52; https://doi.org/10.3390/info9030052 - 28 Feb 2018

Cited by 14 | Viewed by 5481

Abstract

This article illustrates the progresses made in representing a multilingual and multi-alphabetical Old Occitan medico-botanical lexicon in the context of the project Dictionnaire de Termes Médico-botaniques de l’Ancien Occitan (DiTMAO). The chosen lexical model of reference is lemon, which has been extended [...] Read more.

This article illustrates the progresses made in representing a multilingual and multi-alphabetical Old Occitan medico-botanical lexicon in the context of the project Dictionnaire de Termes Médico-botaniques de l’Ancien Occitan (DiTMAO). The chosen lexical model of reference is lemon, which has been extended accordingly to some specific linguistic and lexical features of the lexicon. In particular, issues and solutions about the modeling of multilingual and multiword phenomena are discussed, as the way they are managed through LexO, a web editor developed in the context of the project. Full article

(This article belongs to the Special Issue Towards the Multilingual Web of Data)

► Show Figures

Figure 1

26 pages, 2718 KiB

Open AccessArticle

Forecasting Monthly Electricity Demands by Wavelet Neuro-Fuzzy System Optimized by Heuristic Algorithms

by Jeng-Fung Chen, Quang Hung Do, Thi Van Anh Nguyen and Thi Thanh Hang Doan

Information 2018, 9(3), 51; https://doi.org/10.3390/info9030051 - 28 Feb 2018

Cited by 21 | Viewed by 5739

Abstract

Electricity load forecasting plays a paramount role in capacity planning, scheduling, and the operation of power systems. Reliable and accurate planning and prediction of electricity load are therefore vital. In this study, a novel approach for forecasting monthly electricity demands by wavelet transform [...] Read more.

Electricity load forecasting plays a paramount role in capacity planning, scheduling, and the operation of power systems. Reliable and accurate planning and prediction of electricity load are therefore vital. In this study, a novel approach for forecasting monthly electricity demands by wavelet transform and a neuro-fuzzy system is proposed. Firstly, the most appropriate inputs are selected and a dataset is constructed. Then, Haar wavelet transform is utilized to decompose the load data and eliminate noise. In the model, a hierarchical adaptive neuro-fuzzy inference system (HANFIS) is suggested to solve the curse-of-dimensionality problem. Several heuristic algorithms including Gravitational Search Algorithm (GSA), Cuckoo Optimization Algorithm (COA), and Cuckoo Search (CS) are utilized to optimize the clustering parameters which help form the rule base, and adaptive neuro-fuzzy inference system (ANFIS) optimize the parameters in the antecedent and consequent parts of each sub-model. The proposed approach was applied to forecast the electricity load of Hanoi, Vietnam. The constructed models have shown high forecasting performances based on the performance indices calculated. The results demonstrate the validity of the approach. The obtained results were also compared with those of several other well-known methods including autoregressive integrated moving average (ARIMA) and multiple linear regression (MLR). In our study, the wavelet CS-HANFIS model outperformed the others and provided more accurate forecasting. Full article

► Show Figures

Figure 1

17 pages, 2073 KiB

Open AccessArticle

Agent-Based Simulation of Children’s School Travel Mode with Parental Escort Decisions

by Peng Jing, Qingku You and Long Chen

Information 2018, 9(3), 50; https://doi.org/10.3390/info9030050 - 28 Feb 2018

Cited by 4 | Viewed by 4569

Abstract

In the last few years, the number of private cars has expanding quickly in China, more and more parents use cars to escort their children to school, thus cause serious traffic congestions near school in many cities. In this paper, we developed an [...] Read more.

In the last few years, the number of private cars has expanding quickly in China, more and more parents use cars to escort their children to school, thus cause serious traffic congestions near school in many cities. In this paper, we developed an agent-based model (ABM) of the parents’ choice of escort mode. The core of this model is an escort mode choice motivation adjustment function that combines distance, traffic safety and social influence. We also used ABM to exhibit the emergent decoy effect phenomenon, which is a dynamic phenomenon that the introduction of a decoy to the choice-set could increase the share of other alternatives. The model reveals the parents’ inner psychological mechanism when facing competing escort mode choice in transportation system. The simulation results show that the proportion of parents to choose bus escort was 62.45% without the decoy effect was introduced, while the proportion of parents to choose bus escort increased to 74.29% with the decoy effect was entry. The use of the ABM method gives the potential to cope with the dynamic changes in studying parent escort mode choice behavior. Full article

(This article belongs to the Section Information Applications)

► Show Figures

Figure 1

4 pages, 170 KiB

Open AccessEditorial

Summary of the Special Issue “Neutrosophic Information Theory and Applications” at “Information” Journal

by Florentin Smarandache and Jun Ye

Information 2018, 9(3), 49; https://doi.org/10.3390/info9030049 - 28 Feb 2018

Cited by 3 | Viewed by 3725

Abstract

Over a period of seven months (August 2017–February 2018), the Special Issue dedicated to “Neutrosophic Information Theory and Applications” by the “Information” journal (ISSN 2078-2489), located in Basel, Switzerland, was a success. The Guest Editors, Prof. Dr. Florentin Smarandache from the University of [...] Read more.

Over a period of seven months (August 2017–February 2018), the Special Issue dedicated to “Neutrosophic Information Theory and Applications” by the “Information” journal (ISSN 2078-2489), located in Basel, Switzerland, was a success. The Guest Editors, Prof. Dr. Florentin Smarandache from the University of New Mexico (USA) and Prof. Dr. Jun Ye from the Shaoxing University (China), were happy to select—helped by a team of neutrosophic reviewers from around the world, and by the “Information” journal editors themselves—and publish twelve important neutrosophic papers, authored by 27 authors and coauthors. There were a variety of neutrosophic topics studied and used by the authors and coauthors in Multi-Criteria (or Multi-Attribute and/or Group) Decision-Making, including Cross Entropy-Based MAGDM, Neutrosophic Hesitant Fuzzy Prioritized Aggregation Operators, Biparametric Distance Measures, Pattern Recognition and Medical Diagnosis, Intuitionistic Neutrosophic Graph, NC-TODIM-Based MAGDM, Neutrosophic Cubic Set, VIKOR Method, Neutrosophic Multiple Attribute Group Decision-Making, Competition Graphs, Intuitionistic Neutrosophic Environment, Neutrosophic Commutative N-Ideals, Neutrosophic N-Structures Applied to BCK/BCI-Algebras, Neutrosophic Similarity Score, Weighted Histogram, Robust Mean-Shift Tracking, and Linguistic Neutrosophic Cubic Numbers. Full article

(This article belongs to the Special Issue Neutrosophic Information Theory and Applications)

16 pages, 5082 KiB

Open AccessArticle

Weighted Gradient Feature Extraction Based on Multiscale Sub-Blocks for 3D Facial Recognition in Bimodal Images

by Yingchun Guo, Ruoyu Wei and Yi Liu

Information 2018, 9(3), 48; https://doi.org/10.3390/info9030048 - 28 Feb 2018

Cited by 7 | Viewed by 6234

Abstract

In this paper, we propose a bimodal 3D facial recognition method aimed at increasing the recognition rate and reducing the effect of illumination, pose, expression, ages, and occlusion on facial recognition. There are two features extracted from the multiscale sub-blocks in both the [...] Read more.

In this paper, we propose a bimodal 3D facial recognition method aimed at increasing the recognition rate and reducing the effect of illumination, pose, expression, ages, and occlusion on facial recognition. There are two features extracted from the multiscale sub-blocks in both the 3D mode depth map and 2D mode intensity map, which are the local gradient pattern (LGP) feature and the weighted histogram of gradient orientation (WHGO) feature. LGP and WHGO features are cascaded to form the 3D facial feature vector LGP-WHGO, and are further trained and identified by the support vector machine (SVM). Experiments on the CASIA database, FRGC v2.0 database, and Bosphorus database show that, the proposed method can efficiently extract the structure information and texture information of the facial image, and have a robustness to illumination, expression, occlusion and pose. Full article

► Show Figures

Figure 1

17 pages, 907 KiB

Open AccessArticle

The Evolution of Contextual Information Processing in Informatics

by Phivos Mylonas

Information 2018, 9(3), 47; https://doi.org/10.3390/info9030047 - 27 Feb 2018

Cited by 3 | Viewed by 4887

Abstract

After many decades of flourishing computer science it is now rather evident that in a world dominated by different kinds of digital information, both applications and people are forced to seek new, innovative structures and forms of data management and organization. Following this [...] Read more.

After many decades of flourishing computer science it is now rather evident that in a world dominated by different kinds of digital information, both applications and people are forced to seek new, innovative structures and forms of data management and organization. Following this blunt observation, researchers in informatics have strived over the recent years to tackle the non-unique and rather evolving notion of context, which aids significantly the data disambiguation process. Motivated by this environment, this work attempts to summarize and organize in a researcher-friendly tabular manner important or pioneer related research works deriving from diverse computational intelligence domains: Initially, we discuss the influence of context with respect to traditional low-level multimedia content analysis and search, and retrieval tasks and then we advance to the fields of overall computational context-awareness and the so-called human-generated contextual elements. In an effort to provide meaningful information to fellow researchers, this brief survey focuses on the impact of context in modern and popular computing undertakings of our era. More specifically, we focus to the presentation of a short review of visual context modeling methods, followed by the depiction of context-awareness in modern computing. Works dealing with the interpretation of context by human-generated interactions are also discussed herein, as the particular domain gains an ever-increasing proportion of related research nowadays. We then conclude the paper by providing a short discussion on (i) the motivation behind the included context type categorization into three main pillars; (ii) the findings and conclusions of the survey for each context category; and (iii) a couple of brief advices derived from the survey for both interested developers and fellow researchers. Full article

(This article belongs to the Special Issue Context Awareness)

► Show Figures

Figure 1

19 pages, 4826 KiB

Open AccessArticle

An Extension of Fuzzy SWOT Analysis: An Application to Information Technology

by Mohammad Taghi Taghavifard, Hannan Amoozad Mahdiraji, Amir Massoud Alibakhshi, Edmundas Kazimieras Zavadskas and Romualdas Bausys

Information 2018, 9(3), 46; https://doi.org/10.3390/info9030046 - 27 Feb 2018

Cited by 31 | Viewed by 8110

Abstract

When considering today’s uncertain atmosphere, many people and organizations believe that strategy has lost its meaning and position. When future is predictable, common approaches for strategic planning are applicable; nonetheless, vague circumstances require different methods. Accordingly, a new approach that is compatible with [...] Read more.

When considering today’s uncertain atmosphere, many people and organizations believe that strategy has lost its meaning and position. When future is predictable, common approaches for strategic planning are applicable; nonetheless, vague circumstances require different methods. Accordingly, a new approach that is compatible with uncertainty and unstable conditions is necessary. Fuzzy logic is a worldview compatible with today complicated requirements. Regarding today’s uncertain and vague atmosphere, there is an absolute requirement to fuzzify the tools and strategic planning models, especially for dynamic and unclear environment. In this research, an extended version of Strengths, Weaknesses, Opportunities and Threats (SWOT) fuzzy approach has been presented for strategic planning based on fuzzy logic. It has solved the traditional strategic planning key problems like internal and external factors in imprecision and ambiguous environment. The model has been performed in an information technology corporation to demonstrate the capabilities in real world cases. Full article

(This article belongs to the Section Information Systems)

► Show Figures

Figure 1

Journal Menu

Journal Browser

Information, Volume 9, Issue 3 (March 2018) – 23 articles

Further Information

Guidelines

MDPI Initiatives

Follow MDPI