Search

With the rapid development of information technology, scientific social networks (SSNs) have become the fastest and most convenient way for researchers to communicate with each other. Many published papers are shared via SSNs every day, resulting in the problem of information overload. How to appropriately recommend personalized and highly valuable papers for researchers is becoming more urgent. However, when recommending papers in SSNs, only a small amount of positive instances are available, leaving a vast amount of unlabelled data, in which negative instances and potential unseen positive instances are mixed together, which naturally belongs to One-Class Collaborative Filtering (OCCF) problem. Therefore, considering the extreme data imbalance and data sparsity of this OCCF problem, a hybrid approach of Social and Content aware One-class Recommendation of Papers in SSNs, termed SCORP, is proposed in this study. Unlike previous approaches recommended to address the OCCF problem, social information, which has been proved playing a significant role in performing recommendations in many domains, is applied in both the profiling of content-based filtering and the collaborative filtering to achieve superior recommendations. To verify the effectiveness of the proposed SCORP approach, a real-life dataset from CiteULike was employed. The experimental results demonstrate that the proposed approach is superior to all of the compared approaches, thus providing a more effective method for recommending papers in SSNs. [ABSTRACT FROM AUTHOR]

Research paper recommenders emerged over the last decade to ease finding publications relating to researchers’ area of interest. The challenge was not just to provide researchers with very rich publications at any time, any place and in any form but to also offer the right publication to the right researcher in the right way. Several approaches exist in handling paper recommender systems. However, these approaches assumed the availability of the whole contents of the recommending papers to be freely accessible, which is not always true due to factors such as copyright restrictions. This paper presents a collaborative approach for research paper recommender system. By leveraging the advantages of collaborative filtering approach, we utilize the publicly available contextual metadata to infer the hidden associations that exist between research papers in order to personalize recommendations. The novelty of our proposed approach is that it provides personalized recommendations regardless of the research field and regardless of the user’s expertise. Using a publicly available dataset, our proposed approach has recorded a significant improvement over other baseline methods in measuring both the overall performance and the ability to return relevant and useful publications at the top of the recommendation list. [ABSTRACT FROM AUTHOR]

Blockchain is a decentralized transaction and data management technology developed first for Bitcoin cryptocurrency. The interest in Blockchain technology has been increasing since the idea was coined in 2008. The reason for the interest in Blockchain is its central attributes that provide security, anonymity and data integrity without any third party organization in control of the transactions, and therefore it creates interesting research areas, especially from the perspective of technical challenges and limitations. In this research, we have conducted a systematic mapping study with the goal of collecting all relevant research on Blockchain technology. Our objective is to understand the current research topics, challenges and future directions regarding Blockchain technology from the technical perspective. We have extracted 41 primary papers from scientific databases. The results show that focus in over 80% of the papers is on Bitcoin system and less than 20% deals with other Blockchain applications including e.g. smart contracts and licensing. The majority of research is focusing on revealing and improving limitations of Blockchain from privacy and security perspectives, but many of the proposed solutions lack concrete evaluation on their effectiveness. Many other Blockchain scalability related challenges including throughput and latency have been left unstudied. On the basis of this study, recommendations on future research directions are provided for researchers. [ABSTRACT FROM AUTHOR]

Computer networks face vulnerability to numerous attacks, which pose significant threats to our data security and the freedom of communication. This paper introduces a novel intrusion detection technique that diverges from traditional methods by leveraging Recurrent Neural Networks (RNNs) for both data preprocessing and feature extraction. The proposed process is based on the following steps: (1) training the data using RNNs, (2) extracting features from their hidden layers, and (3) applying various classification algorithms. This methodology offers significant advantages and greatly differs from existing intrusion detection practices. The effectiveness of our method is demonstrated through trials on the Network Security Laboratory (NSL) and Canadian Institute for Cybersecurity (CIC) 2017 datasets, where the application of RNNs for intrusion detection shows substantial practical implications. Specifically, we achieved accuracy scores of 99.6% with Decision Tree, Random Forest, and CatBoost classifiers on the NSL dataset, and 99.8% and 99.9%, respectively, on the CIC 2017 dataset. By reversing the conventional sequence of training data with RNNs and then extracting features before applying classification algorithms, our approach provides a major shift in intrusion detection methodologies. This modification in the pipeline underscores the benefits of utilizing RNNs for feature extraction and data preprocessing, meeting the critical need to safeguard data security and communication freedom against ever-evolving network threats. [ABSTRACT FROM AUTHOR]

Recently, computational Grids have proven to be a good solution for processing large-scale, computation intensive problems. However, the heterogeneity, dynamics of resources and diversity of applications requirements have always been important factors affecting their performance. In response to these challenges, this work first builds a Grid job scheduling architecture that can dynamically monitor Grid computing center resources and make corresponding scheduling decisions. Second, a Grid job model is proposed to describe the application requirements. Third, this paper studies the characteristics of commercial interconnection networks used in Grids and forecast job transmission time. Fourth, this paper proposes an application-aware job scheduling mechanism (AJSM) that includes periodic scheduling flow and a heuristic application-aware deadline constraint job scheduling algorithm. The rigorous performance evaluation results clearly demonstrate that the proposed application-aware job scheduling mechanism can successful schedule more Grid jobs than the existing algorithms. For successful scheduled jobs, our proposed AJSM method is the best algorithm for job average processing time and makespan. [ABSTRACT FROM AUTHOR]

Increasingly, scholarly articles contain URI references to “web at large” resources including project web sites, scholarly wikis, ontologies, online debates, presentations, blogs, and videos. Authors reference such resources to provide essential context for the research they report on. A reader who visits a web at large resource by following a URI reference in an article, some time after its publication, is led to believe that the resource’s content is representative of what the author originally referenced. However, due to the dynamic nature of the web, that may very well not be the case. We reuse a dataset from a previous study in which several authors of this paper were involved, and investigate to what extent the textual content of web at large resources referenced in a vast collection of Science, Technology, and Medicine (STM) articles published between 1997 and 2012 has remained stable since the publication of the referencing article. We do so in a two-step approach that relies on various well-established similarity measures to compare textual content. In a first step, we use 19 web archives to find snapshots of referenced web at large resources that have textual content that is representative of the state of the resource around the time of publication of the referencing paper. We find that representative snapshots exist for about 30% of all URI references. In a second step, we compare the textual content of representative snapshots with that of their live web counterparts. We find that for over 75% of references the content has drifted away from what it was when referenced. These results raise significant concerns regarding the long term integrity of the web-based scholarly record and call for the deployment of techniques to combat these problems. [ABSTRACT FROM AUTHOR]

The nodes and their connection relationships are the two main bodies for dynamic complex networks. In existing theoretical researches, the phenomena of stabilization and synchronization for complex dynamical networks are generally regarded as the dynamic characteristic behaviors of the nodes, which are mainly caused by coupling effect of connection relationships between nodes. However, the connection relationships between nodes are also one main body of a time-varying dynamic complex network, and thus they may evolve with time and maybe show certain characteristic phenomena. For example, the structural balance in the social networks and the synaptic facilitation in the biological neural networks. Therefore, it is important to investigate theoretically the reasons in dynamics for the occurrence. Especially, from the angle of large-scale systems, how the dynamic behaviors of nodes (such as the individuals, neurons) contribute to the connection relationships is one of worthy research directions. In this paper, according to the structural balance theory of triad proposed by F. Heider, we mainly focus on the connection relationships body, which is regarded as one of the two subsystems (another is the nodes body), and try to find the dynamic mechanism of the structural balance with the internal state behaviors of the nodes. By using the Riccati linear matrix differential equation as the dynamic model of connection relationships subsystem, it is proved under some mathematic conditions that the connection relationships subsystem is asymptotical structural balance via the effects of the coupling roles with the internal state of nodes. Finally, the simulation example is given to show the validity of the method in this paper. [ABSTRACT FROM AUTHOR]

Although high degrees of reliability have been found for many types of forecasts purportedly due to the existence of accountability, public forecasts of technology are rarely assessed and continue to have a poor reputation. This paper’s analysis of forecasts made by MIT’s Technology Review provides a rare assessment and thus a means to encourage accountability. It first shows that few of the predicted “breakthrough technologies” currently have large markets. Only four have sales greater than $10 billion while eight technologies not predicted by Technology Review have sales greater than $10 billion including three with greater than $100 billion and one other with greater than $50 billion. Second, possible reasons for these poor forecasts are then discussed including an over emphasis on the science-based process of technology change, sometimes called the linear model of innovation. Third, this paper describes a different model of technology change, one that is widely used by private companies and that explains the emergence of those technologies that have greater than $10 billion in sales. Fourth, technology change and forecasts are discussed in terms of cognitive biases and mental models. [ABSTRACT FROM AUTHOR]

Internet and social media participation open doors to a plethora of positive opportunities for the general public. However, in addition to these positive aspects, digital technology also provides an effective medium for spreading hateful content in the form of cyberbullying, bigotry, hateful ideologies, and harassment of individuals and groups. This research aims to investigate the growing body of online hate research (OHR) by mapping general research indices, prevalent themes of research, research hotspots, and influential stakeholders such as organizations and contributing regions. For this, we use scientometric techniques and collect research papers from the Web of Science core database published through March 2019. We apply a predefined search strategy to retrieve peer-reviewed OHR and analyze the data using CiteSpace software by identifying influential papers, themes of research, and collaborating institutions. Our results show that higher-income countries contribute most to OHR, with Western countries accounting for most of the publications, funded by North American and European funding agencies. We also observed increased research activity post-2005, starting from more than 50 publications to more than 550 in 2018. This applies to a number of publications as well as citations. The hotbeds of OHR focus on cyberbullying, social media platforms, co-morbid mental disorders, and profiling of aggressors and victims. Moreover, we identified four main clusters of OHR: (1) Cyberbullying, (2) Sexual solicitation and intimate partner violence, (3) Deep learning and automation, and (4) Extremist and online hate groups, which highlight the cross-disciplinary and multifaceted nature of OHR as a field of research. The research has implications for researchers and policymakers engaged in OHR and its associated problems for individuals and society. [ABSTRACT FROM AUTHOR]

Objective: To conduct a time-cost analysis of formatting in scientific publishing. Design: International, cross-sectional study (one-time survey). Setting: Internet-based self-report survey, live between September 2018 and January 2019. Participants: Anyone working in research, science, or academia and who submitted at least one peer-reviewed manuscript for consideration for publication in 2017. Completed surveys were available for 372 participants from 41 countries (60% of respondents were from Canada). Main outcome measure: Time (hours) and cost (wage per hour x time) associated with formatting a research paper for publication in a peer-reviewed academic journal. Results: The median annual income category was US$61,000–80,999, and the median number of publications formatted per year was four. Manuscripts required a median of two attempts before they were accepted for publication. The median formatting time was 14 hours per manuscript, or 52 hours per person, per year. This resulted in a median calculated cost of US$477 per manuscript or US$1,908 per person, per year. Conclusions: To our knowledge, this is the first study to analyze the cost of manuscript formatting in scientific publishing. Our results suggest that scientific formatting represents a loss of 52 hours, costing the equivalent of US$1,908 per researcher per year. These results identify the hidden and pernicious price associated with scientific publishing and provide evidence to advocate for the elimination of strict formatting guidelines, at least prior to acceptance. [ABSTRACT FROM AUTHOR]

To solve the problem of the deadline-constrained task scheduling in the cloud computing system, this paper proposes a deadline-constrained scheduling algorithm for cloud computing based on the driver of dynamic essential path (Deadline-DDEP). According to the changes of the dynamic essential path of each task node in the scheduling process, the dynamic sub-deadline strategy is proposed. The strategy assigns different sub-deadline values to every task node to meet the constraint relations among task nodes and the user’s defined deadline. The strategy fully considers the dynamic sub-deadline affected by the dynamic essential path of task node in the scheduling process. The paper proposed the quality assessment of optimization cost strategy to solve the problem of selecting server for each task node. Based on the sub-deadline urgency and the relative execution cost in the scheduling process, the strategy selects the server that not only meets the sub-deadline but also obtains much lower execution cost. In this way, the proposed algorithm will make the task graph complete within its deadline, and minimize its total execution cost. Finally, we demonstrate the proposed algorithm via the simulation experiments using Matlab tools. The experimental results show that, the proposed algorithm produces remarkable performance improvement rate on the total execution cost that ranges between 10.3% and 30.8% under meeting the deadline constraint. In view of the experimental results, the proposed algorithm provides better-quality scheduling solution that is suitable for scientific application task execution in the cloud computing environment than IC-PCP, DCCP and CD-PCP. [ABSTRACT FROM AUTHOR]

The last several decades have witnessed a shift in the way in which news is delivered and consumed by users. With the growth and advancements in mobile technologies, the Internet, and Web 2.0 technologies users are not only consumers of news, but also producers of online content. This has resulted in a novel and highly participatory cyber-physical news awareness ecosystem that fosters digital activism, in which volunteers contribute content to online communities. While studies have examined the various components of this news awareness ecosystem, little is still known about how news media coverage (and in particular digital media) impacts digital activism. In order to address this challenge and develop a greater understanding of it, this paper focuses on a specific form of digital activism, that of the production of digital geographical content through crowdsourcing efforts. Using refugee camps from around the world as a case study, we examine the relationship between news coverage (via Google news), search trends (via Google trends) and user edit contribution patterns in OpenStreetMap, a prominent geospatial data crowdsourcing platform. In addition, we compare and contrast these patterns with user edit patterns in Wikipedia, a well-known non-geospatial crowdsourcing platform. Using Google news and Google trends to derive a measure of thematic public awareness, our findings indicate that digital activism bursts tend to take place during periods of sustained build-up of public awareness deficit or surplus. These findings are in line with two prominent mass communication theories: agenda setting and corrective action, and suggest the emergence of a novel stimulus-awareness-activism framework in today’s participatory digital age. Moreover, these findings further complement existing research examining the motivational factors that drive users to contribute to online collaborative communities. This paper brings us one step closer to understanding the underlying mechanisms that drive digital activism in particular in the geospatial domain. [ABSTRACT FROM AUTHOR]

Automatic detection of surface defects in electronic panels is receiving increasing attention in the quality control of products. The surface defect detection of electronic panels is different from other target detection scenarios and is a meaningful and challenging problem. Its main manifestation is that surface defects of electronic panels usually exhibit extreme irregularity and small target characteristics, which bring great difficulties to the task of surface defect target detection including feature extraction and so on. The traditional methods can only detect a very small number of defect classes under specific detection conditions. And due to the weak robustness of these methods, they cannot be applied in real production scenarios on a large scale. Based on this, this paper applies the target detection technique under deep learning to the surface defect detection scenario of electronic panels for the first time. At the same time, in order to make the designed target detection network applicable to the electronic panel surface defect detection scenario and to enhance the interpretability of the designed target detection network in terms of computer mechanism. We design a deformable convolution module with a convolutional self-attentive module to learn the offset and a dual detection head incorporating the SE (Squeeze-and-Excitation) mechanism for the irregular characteristics of electronic panel surface defects and the small target characteristics, respectively. Finally, we carried out a series of experiments on our own electronic panel defect data set, including comparison with the most advanced target detection algorithms and a series of ablation experiments against our proposed method. The final experimental results prove that our method not only has better interpretability, but also has better metric performance, in which the map_0.5 metric reaches 78.257%, which is an increase of 13.506 percentage points over YOLOV5 and 33.457 percentage points higher than Retinanet. The results prove the proposed method is effective. [ABSTRACT FROM AUTHOR]

Traffic congestion is an important problem both on an individual and on a societal level and much research has been done to explain and prevent their emergence. There are currently many systems which provide a reasonably good picture of actual road traffic by employing either fixed measurement points on highways or so called “floating car data” i.e. by using velocity and location data from roaming, networked, GPS enabled members of traffic. Some of these systems also offer forecasting of road conditions based on such historical data. To my knowledge there is as yet no system which offers advance notice on road conditions based on a signal which is guaranteed to occur in advance of these conditions and this is the novelty of this paper. Google Search intensity for the German word (i.e. traffic jam) peaks 2 hours ahead of the number of traffic jam reports as reported by the ADAC, a well known German automobile club and the largest of its kind in Europe. This is true both in the morning (7 am to 9 am) and in the evening (4 pm to 6 pm). The main result of this paper is then that after controlling for time-of-day and day-of-week effects we can still explain a significant additional portion of the variation of the number of traffic jam reports with Google Trends and we can thus explain well over 80% of the variation of road conditions using Google search activity. A one percent increase in Google stau searches implies a .4 percent increase of traffic jams. Our paper is a proof of concept that aggregate, timely delivered behavioural data can help fine tune modern societies and prompts for more research with better, more disaggregated data in order to also achieve practical solutions. [ABSTRACT FROM AUTHOR]

For high-dimensional and massive data sets, traditional centralized gene expression programming (GEP) or improved algorithms lead to increased run-time and decreased prediction accuracy. To solve this problem, this paper proposes a new improved algorithm called distributed function mining for gene expression programming based on fast reduction (DFMGEP-FR). In DFMGEP-FR, fast attribution reduction in binary search algorithms (FAR-BSA) is proposed to quickly find the optimal attribution set, and the function consistency replacement algorithm is given to solve integration of the local function model. Thorough comparative experiments for DFMGEP-FR, centralized GEP and the parallel gene expression programming algorithm based on simulated annealing (parallel GEPSA) are included in this paper. For the waveform, mushroom, connect-4 and musk datasets, the comparative results show that the average time-consumption of DFMGEP-FR drops by 89.09%%, 88.85%, 85.79% and 93.06%, respectively, in contrast to centralized GEP and by 12.5%, 8.42%, 9.62% and 13.75%, respectively, compared with parallel GEPSA. Six well-studied UCI test data sets demonstrate the efficiency and capability of our proposed DFMGEP-FR algorithm for distributed function mining. [ABSTRACT FROM AUTHOR]

This paper presents vehicle-to-vehicle telescreen (VVT) and a multicast scheme to disseminate digital signage multimedia services to vehicular ad hoc networks (VANETs). Multimedia dissemination in VANETs is challenging because of the high packet losses (PLs), delays and longer disconnection times, which degrade the network quality of service (QoS) and user quality of experience (QoE). To reduce the PLs and delays, most existing multimedia multicast schemes in VANETs primarily select routes based on longer route expiration times (RET) or lowest path delays. The RET-based schemes suffer less from PLs when there are fewer active multicastings in the network. When the number of active multicastings increases, delay-based schemes suffer less from PLs comparatively. This tradeoff implies to design an adaptive mechanism by mutually complementing the RET-based and delay-based schemes to reduce PLs and delays. In this paper, we propose a multicriteria adaptive opportunistic treecast routing protocol (MAOTRP), which adapts the route selection mechanism according to active multicastings for efficient multimedia dissemination in VVT. The MAOTRP adjusts the weights of route selection parameters, including RET and delays, by considering their contribution in improving packet delivery ratio. MAOTRP extends a tree-based multicast protocol to provide robustness through alternate routes for link failures to reduce PLs. Through several experimental evaluations, we show that the proposed dissemination scheme improves QoS and QoE, and reduces the average disconnection time. [ABSTRACT FROM AUTHOR]

The loss of talented women from senior academic positions has partly resulted from a lower number of published papers and the accompanying reduced visibility of female compared to male scientists. The reasons for these gender-differences in authorship is unclear. One potential reason is a bias in the editorial and review process of scientific journals. We investigated whether patterns of authorship and editorial outcome were biased according to gender and geographic location in the Journal of Evolutionary Biology. Such potential bias may contribute to inequality in the field. We found patterns of gender differences in authorship, but this was unrelated to the editorial decision of whether to publish the manuscript. Female first-authors (the lead role) were six times less likely to be named as the corresponding author than male first-authors, and female first-authors were more likely to be displaced as corresponding authors by female co-authors than were male first-authors. We found an under-representation of female first- and last-authors compared to baseline populations of members of the European Society for Evolutionary Biology (which publishes the Journal of Evolutionary Biology) and of Evolutionary Biology faculty at the world top-10 universities for the Life Sciences. Also, manuscripts from Asia were five times more likely to be rejected on the final decision, independent of gender. Overall our results suggest that the peer review processes we investigated at the Journal of Evolutionary Biology are predominately gender-neutral, but not neutral to geographic location. Editorial gender-bias is thus unlikely to be a contributing factor to differences in authorship in this journal. [ABSTRACT FROM AUTHOR]

With the convergence of various broadcasting systems, the amount of content available in mobile terminals including IPTV has significantly increased. In this paper, we propose a system that enables users to schedule programs considering both section video clips and full video clips based on the user detection method with similar preference. And, since the system constituting the contents can be classified according to the program, the proposed method can store a program desired by the user, and thus create and schedule a kind of individual channel. Experimental results show that the proposed method has a higher prediction accuracy; this is accomplished by comparing existing channel recommendation methods with the program recommendation methods proposed in this paper. [ABSTRACT FROM AUTHOR]

Recommender systems are vulnerable to shilling attacks. Forged user-generated content data, such as user ratings and reviews, are used by attackers to manipulate recommendation rankings. Shilling attack detection in recommender systems is of great significance to maintain the fairness and sustainability of recommender systems. The current studies have problems in terms of the poor universality of algorithms, difficulty in selection of user profile attributes, and lack of an optimization mechanism. In this paper, a shilling behaviour detection structure based on abnormal group user findings and rating time series analysis is proposed. This paper adds to the current understanding in the field by studying the credibility evaluation model in-depth based on the rating prediction model to derive proximity-based predictions. A method for detecting suspicious ratings based on suspicious time windows and target item analysis is proposed. Suspicious rating time segments are determined by constructing a time series, and data streams of the rating items are examined and suspicious rating segments are checked. To analyse features of shilling attacks by a group user’s credibility, an abnormal group user discovery method based on time series and time window is proposed. Standard testing datasets are used to verify the effect of the proposed method. [ABSTRACT FROM AUTHOR]

Research on temporal characteristics of human dynamics has attracted much attentions for its contribution to various areas such as communication, medical treatment, finance, etc. Existing studies show that the time intervals between two consecutive events present different non-Poisson characteristics, such as power-law, Pareto, bimodal distribution of power-law, exponential distribution, piecewise power-law, et al. With the occurrences of new services, new types of distributions may arise. In this paper, we study the distributions of the time intervals between two consecutive visits to QQ and WeChat service, the top two popular instant messaging services in China, and present a new finding that when the value of statistical unit T is set to 0.001s, the inter-event time distribution follows a piecewise distribution of exponential and power-law, indicating the heterogeneous character of IM services users’ online behavior in different time scales. We infer that the heterogeneous character is related to the communication mechanism of IM and the habits of users. Then we develop a combination model of exponential model and interest model to characterize the heterogeneity. Furthermore, we find that the exponent of the inter-event time distribution of the same service is different in two cities, which is correlated with the popularity of the services. Our research is useful for the application of information diffusion, prediction of economic development of cities, and so on. [ABSTRACT FROM AUTHOR]

Combining a deep neural network with fuzzy theory, this paper proposes an advertising click-through rate (CTR) prediction approach based on a fuzzy deep neural network (FDNN). In this approach, fuzzy Gaussian-Bernoulli restricted Boltzmann machine (FGBRBM) is first applied to input raw data from advertising datasets. Next, fuzzy restricted Boltzmann machine (FRBM) is used to construct the fuzzy deep belief network (FDBN) with the unsupervised method layer by layer. Finally, fuzzy logistic regression (FLR) is utilized for modeling the CTR. The experimental results show that the proposed FDNN model outperforms several baseline models in terms of both data representation capability and robustness in advertising click log datasets with noise. [ABSTRACT FROM AUTHOR]

Miniaturization of computer hardware and the demand for network capable devices has resulted in the emergence of a new class of technology called wearable computing. Wearable devices have many purposes like lifestyle support, health monitoring, fitness monitoring, entertainment, industrial uses, and gaming. Wearable devices are hurriedly being marketed in an attempt to capture an emerging market. Owing to this, some devices do not adequately address the need for security. To enable virtualization and connectivity wearable devices sense and transmit data, therefore it is essential that the device, its data and the user are protected. In this paper the use of novel Integrated Circuit Metric (ICMetric) technology for the provision of security in wearable devices has been suggested. ICMetric technology uses the features of a device to generate an identification which is then used for the provision of cryptographic services. This paper explores how a device ICMetric can be generated by using the accelerometer and gyroscope sensor. Since wearable devices often operate in a group setting the work also focuses on generating a group identification which is then used to deliver services like authentication, confidentiality, secure admission and symmetric key generation. Experiment and simulation results prove that the scheme offers high levels of security without compromising on resource demands. [ABSTRACT FROM AUTHOR]

With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is beneficial to save large storage space, it has several shortcomings such as the existence of backtracking and empty nodes. This paper proposes a new packet classification algorithm, Hierarchical Trie Algorithm Based on Expectation-Maximization Clustering (HTEMC). Firstly, this paper uses the formalization method to deal with the packet classification problem by means of mapping the rules and data packets into a two-dimensional space. Secondly, this paper uses expectation-maximization algorithm to cluster the rules based on their aggregate characteristics, and thereby diversified clusters are formed. Thirdly, this paper proposes a hierarchical trie based on the results of expectation-maximization clustering. Finally, this paper respectively conducts simulation experiments and real-environment experiments to compare the performances of our algorithm with other typical algorithms, and analyzes the results of the experiments. The hierarchical trie structure in our algorithm not only adopts trie path compression to eliminate backtracking, but also solves the problem of low efficiency of trie updates, which greatly improves the performance of the algorithm. [ABSTRACT FROM AUTHOR]

This paper examined, with a behavioral paradigm, to what extent people choose to view stimuli that portray death, violence or harm. Based on briefly presented visual cues, participants made choices between highly arousing, negative images and positive or negative alternatives. The negative images displayed social scenes that involved death, violence or harm (e.g., war scene), or decontextualized, close-ups of physical harm (e.g., mutilated face) or natural threat (e.g., attacking shark). The results demonstrated that social negative images were chosen significantly more often than other negative categories. Furthermore, participants preferred social negative images over neutral images. Physical harm images and natural threat images were not preferred over neutral images, but were chosen in about thirty-five percent of the trials. These results were replicated across three different studies, including a study that presented verbal descriptions of images as pre-choice cues. Together, these results show that people deliberately subject themselves to negative images. With this, the present paper demonstrates a dynamic relationship between negative information and behavior and advances new insights into the phenomenon of morbid curiosity. [ABSTRACT FROM AUTHOR]

Empirical studies show that discrimination by identity found in offline markets also prevails online. This paper reveal that in a competitive market, buyers that intend to discriminate exist but they are prevented from influencing the market outcome. To this end, we construct a field experiment on eBay, where half of the sellers disclose their names in their usernames while the other half do not. eBay, however, automatically discloses the seller’s names to the buyer after the auction. In the anonymous auctions, winning bidders thus learn the identity of the seller after the auction ends, and here we find buyers to discriminate against sellers with foreign-sounding names by leaving them feedback less often. However, there is no such discrimination in feedback provision when the seller name was known to the buyer before the auction. When bidders know the names of the sellers, the bidders with animus towards individuals with specific names can select out of auctions from these sellers, leaving winners that do not discriminate. One would expect that the auctions of for example sellers with foreign-sounding names would receive fewer bidders and thus lower auction prices. However, we observe no such differences: there are no statistically significant differences in the number of bids or auction prices received by sellers with foreign or domestic sounding names. [ABSTRACT FROM AUTHOR]

The user interaction in online social networks can not only reveal the social relationships among users in e-commerce systems, but also imply the social preferences of a target user for recommendation services. However, the current research has rarely explored the impact of social interaction on recommendation performance, especially now that recommender systems face increasing challenges and suffer from poor efficiency due to social data overload. Therefore, applied research on user interaction has become increasingly necessary in the field of social recommendation. In this paper, we develop a novel social recommendation method based on the user interaction in complex social networks, called the SRUI model, to present a basis for improving the efficiency of the recommender systems. Specifically, a weighted social interaction network is first mapped to represent the interactions among social users according to the gathered information about historical user behavior. Thereafter, the complete path set is mined by the complete path mining (CPM) algorithm to find social similar neighbors with tastes similar to those of the target user. Finally, the social similar tendencies of the users on the complete paths are obtained to predict the final ratings of items through the SRUI model. A series of experimental results based on two real public datasets show that our approach performs better than other state-of-the-art methods in terms of recommendation performance. [ABSTRACT FROM AUTHOR]

The 5Rights Youth Juries are an educational intervention to promote digital literacy by engaging participants (i.e. jurors) in a deliberative discussion around their digital rights. The main objective of these jury-styled focus groups is to encourage children and young people to identify online concerns and solutions with a view to developing recommendations for government policy-makers and industry chiefs. The methodology included a series of dramatized scenarios that encourage jurors to deliberate about their digital rights. This paper compares two formats for these scenarios: live actors and professionally recorded and edited videos of the same actors. Results failed to show any major differences between formats indicating the cost-effectiveness of the video-recorded format and the possibility for others to run the 5Rights Youth Juries with the support of an online open educational resource. [ABSTRACT FROM AUTHOR]

The Internet provides students with a unique opportunity to connect and maintain social ties with peers from other schools, irrespective of how far they are from each other. However, little is known about the real structure of such online relationships. In this paper, we investigate the structure of interschool friendship on a popular social networking site. We use data from 36, 951 students from 590 schools of a large European city. We find that the probability of a friendship tie between students from neighboring schools is high and that it decreases with the distance between schools following the power law. We also find that students are more likely to be connected if the educational outcomes of their schools are similar. We show that this fact is not a consequence of residential segregation. While high- and low-performing schools are evenly distributed across the city, this is not the case for the digital space, where schools turn out to be segregated by educational outcomes. There is no significant correlation between the educational outcomes of a school and its geographical neighbors; however, there is a strong correlation between the educational outcomes of a school and its digital neighbors. These results challenge the common assumption that the Internet is a borderless space, and may have important implications for the understanding of educational inequality in the digital age. [ABSTRACT FROM AUTHOR]

In network security, firewall is a security system that observes and controls the network traffic based on some predefined rules. A firewall sets up a barrier between internal network and another outside unsecured network, such as the Internet. A number of signcryption schemes for firewall are proposed over the years, many of them are proved to have security flaws. In this paper, an elliptic curve based signcryption scheme for firewalls is analyzed. It is observed that the scheme is not secure and has many security flaws. Anyone who knows the public parameters, can modify the message without the knowledge of sender and receiver. The claimed security attributes of non-repudiation, unforgeability, integrity and authentication are compromised. After successful cryptanalysis of this scheme, we proposed a modified version of the scheme. [ABSTRACT FROM AUTHOR]

This paper investigates the feasibility, from a user perspective, of integrating a heterogeneous information network mining (HINM) technique into SensePlace3 (SP3), a web-based geovisual analytics environment. The core contribution of this paper is a user study that determines whether an analyst with minimal background can comprehend the network data modeling metaphors employed by the resulting system, whether they can employ said metaphors to explore spatial data, and whether they can interpret the results of such spatial analysis correctly. This study confirms that all of the above is, indeed, possible, and provides empirical evidence about the importance of a hands-on tutorial and a graphical approach to explaining data modeling metaphors in the successful adoption of advanced data mining techniques. Analysis of outcomes of data exploration by the study participants also demonstrates the kinds of insights that a visual interface to HINM can enable. A second contribution is a realistic case study that demonstrates that our HINM approach (made accessible through a visual interface that provides immediate visual feedback for user queries), produces a clear and a positive difference in the outcome of spatial analysis. Although this study does not aim to validate HINM as a data modeling approach (there is considerable evidence for this in existing literature), the results of the case study suggest that HINM holds promise in the (geo)visual analytics domain as well, particularly when integrated into geovisual analytics applications. A third contribution is a user study protocol that is based on and improves upon the current methodological state of the art. This protocol includes a hands-on tutorial and a set of realistic data analysis tasks. Detailed evaluation protocols are rare in geovisual analytics (and in visual analytics more broadly), with most studies reviewed in this paper failing to provide sufficient details for study replication or comparison work. [ABSTRACT FROM AUTHOR]

Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges. The attack strategies are selected based on degree and betweenness centralities calculated for either the initial network or the current network during the removal, among which random failure is as a comparison. It is found that the node-based strategies are often more harmful to the network controllability than the edge-based ones, and so are the recalculated strategies than their counterparts. The Barabási-Albert scale-free model, which has a highly biased structure, proves to be the most vulnerable of the tested model networks. In contrast, the Erdős-Rényi random model, which lacks structural bias, exhibits much better robustness to both node-based and edge-based attacks. We also survey the control robustness of 25 real-world networks, and the numerical results show that most real networks are control robust to random node failures, which has not been observed in the model networks. And the recalculated betweenness-based strategy is the most efficient way to harm the controllability of real-world networks. Besides, we find that the edge degree is not a good quantity to measure the importance of an edge in terms of network controllability. [ABSTRACT FROM AUTHOR]

This paper proposes a method to predict fluctuations in the prices of cryptocurrencies, which are increasingly used for online transactions worldwide. Little research has been conducted on predicting fluctuations in the price and number of transactions of a variety of cryptocurrencies. Moreover, the few methods proposed to predict fluctuation in currency prices are inefficient because they fail to take into account the differences in attributes between real currencies and cryptocurrencies. This paper analyzes user comments in online cryptocurrency communities to predict fluctuations in the prices of cryptocurrencies and the number of transactions. By focusing on three cryptocurrencies, each with a large market size and user base, this paper attempts to predict such fluctuations by using a simple and efficient method. [ABSTRACT FROM AUTHOR]

The rich get richer principle, manifested by the Preferential attachment (PA) mechanism, is widely considered one of the major factors in the growth of real-world networks. PA stipulates that popular nodes are bound to be more attractive than less popular nodes; for example, highly cited papers are more likely to garner further citations. However, it overlooks the transient nature of popularity, which is often governed by trends. Here, we show that in a wide range of real-world networks the recent popularity of a node, i.e., the extent by which it accumulated links recently, significantly influences its attractiveness and ability to accumulate further links. We proceed to model this observation with a natural extension to PA, named Trending Preferential Attachment (TPA), in which edges become less influential as they age. TPA quantitatively parametrizes a fundamental network property, namely the network’s tendency to trends. Through TPA, we find that real-world networks tend to be moderately to highly trendy. Networks are characterized by different susceptibilities to trends, which determine their structure to a large extent. Trendy networks display complex structural traits, such as modular community structure and degree-assortativity, occurring regularly in real-world networks. In summary, this work addresses an inherent trait of complex networks, which greatly affects their growth and structure, and develops a unified model to address its interaction with preferential attachment. [ABSTRACT FROM AUTHOR]

On 5th December 2012, a scientific article reviewing a change in the feeding behaviour of the European catfish, one of the largest freshwater fish, was published in the American scientific journal, PLOS ONE, an open access journal, which also allows the mass publication of pictures and videos. Within a few days following the publication of this article, it was relayed by numerous web sites and generated a media craze. In this paper, we analyse the circulation of this scientific information in the sphere of Web-based media during the two months following its publication, by revealing the citation mechanisms of the original article and the logic of the Internet users participating in its diffusion. In addition, since the circulation of its informational content travelled beyond linguistic and geographical boundaries, we chose to compare the citation modalities and intertextual relationships of documents in the three countries where the article spread the most widely, namely: France, the United States and Great Britain. Even though our study shows that the media circulation of scientific papers operates in a traditional way, the intertextual analysis underlines the grand variety of participants (such as journalists, non-scientists, fishermen, technology enthusiasts and Internet users) involved in the diffusion of this information, each of them mobilizing different intertextual strategies, according to their various targets. They all transformed, reformulated and appropriated the scientific information according to their own, unique interests. This study also emphasizes the importance of journalistic websites as opinion relays. They were the first diffusers involved in spreading the information but this role was rarely acknowledged by the Internet users - through citations, for example. In contrast, we observed that amateurs’ communities (communities of practices and communities of interest of fishermen or of buzz fans), which only became involved in a second temporal phase of the spreading, preferred to build up their credibility through citations of the original article. Finally, this research helps to rethink the mechanisms of the circulation of scientific information in the Web-based media, highlighting both the variety and the inventiveness of the interactions between the academic and public spheres. [ABSTRACT FROM AUTHOR]

Research utilizing repeated-measures such as daily assessments with self-report and/or objective measures [e.g., physical activity (PA) monitors] are important in understanding health behaviors and informing practice and policy. However, studies that utilize daily assessment often encounter issues with attrition and non-compliance. The current research yielded high levels of retention and adherence with both self-report and objective daily measures. The purpose of this paper is to highlight and discuss strategies utilized in maximizing retention, minimizing missing data, and some lessons learned from the research experience. Fifty community participants took part in a 4-week study utilizing both daily self-report questionnaires and daily use of PA monitors (Fitbit One™). This study focused on typical daily PA and was not an intervention study (e.g., participants were not randomized nor asked to change their PA behavior). Participants completed the study in two waves (wave 1 n = 10, wave 2 n = 40). The research team utilized several retention strategies including automating the data collection process, a prorated incentive structure, having a dedicated and responsive study staff, and utilizing the 2-wave process to optimize data collection during the 2nd wave. The study had 100% retention and generally positive anonymous feedback post-study. Overall, participants completed the vast majority of daily surveys (97%) and wore their Fitbits (for at least part of the day) on almost all days (99.57%) of the study, although there were individual differences. The strategies discussed and lessons learned may be useful to other researchers using daily measurements for whom adherence and retention are important issues. Future research employing these strategies in different populations, with different measurements, and for longer durations is warranted to determine generalizability. [ABSTRACT FROM AUTHOR]

Web service has become irreplaceable for service-oriented application in both academia and industry in recent years. Quality of Service (QoS) is used to describe the nonfunctional characteristics of Web service. Identifying Web service QoS is crucial for service-oriented application designers because service users may obtain very different QoS performance of the same service in the client-side due to dynamic changes of Internet environment as well as user context. However, evaluating QoS performance of a large scale of Web services requires considerable time and resources in real-world. Existing methods can make a personalized prediction for average QoS values by employing historical data but fail to take into consideration the fluctuation feature of Web service QoS values. To address this issue, this paper proposes a novel method for personalized QoS prediction of dynamic Web Services. First, a novel approach is used to extract feature points of QoS sequences and dynamic time warping distance is used to compute the similarity instead of Euclidean distance. By finding the most similar QoS sequences of the target QoS sequence, the missing QoS values can be predicted without extra Web services invoking. To validate our method, we conduct a large number of experiments based on real-world Web service QoS data set. The experimental studies show that our method has higher accuracy rate compared with the existing methods. [ABSTRACT FROM AUTHOR]

Over the past decades, plagiarism has been classified as a multi-layer phenomenon of dishonesty that occurs in higher education. A number of research papers have identified a host of factors such as gender, socialisation, efficiency gain, motivation for study, methodological uncertainties or easy access to electronic information via the Internet and new technologies, as reasons driving plagiarism. The paper at hand examines whether such factors are still effective and if there are any differences between German and Slovene students’ factors influencing plagiarism. A quantitative paper-and-pencil survey was carried out in Germany and Slovenia in 2017/2018 academic year, with a sample of 485 students from higher education institutions. The major findings of this research reveal that easy access to information-communication technologies and the Web is the main reason driving plagiarism. In that regard, there are no significant differences between German and Slovene students in terms of personal factors such as gender, motivation for study, and socialisation. In this sense, digitalisation and the Web outrank national borders. [ABSTRACT FROM AUTHOR]

Radio propagation prediction simulation methods based on deterministic technique such as ray launching is extensively used to accomplish radio channel characterization. However, the superiority of the simulation depends on the number of rays launched and received. This paper presented the indoor three-dimensional (3D) Minimum Ray Launching Maximum Accuracy (MRLMA) technique, which is applicable for an efficient indoor radio wave propagation prediction. Utilizing the novel MRLMA technique in the simulation environment for ray lunching and tracing can drastically reduce the number of rays that need to be traced, and improve the efficiency of ray tracing. Implementation and justification of MRLMA presented in the paper. An indoor office 3D layouts are selected and simulations have been performed using the MRLMA and other reference techniques. Results showed that the indoor 3D MRLMA model is appropriate for wireless communications network systems design and optimization process with respect to efficiency, coverage, number of rays launching, number of rays received by the mobile station, and simulation time. [ABSTRACT FROM AUTHOR]

Ultrasound is an efficacious, versatile and affordable imaging technique in emergencies, but has limited utility without expert interpretation. Telesonography, in which experts may remotely support the use of ultrasound through a telecommunications link, may broaden access to ultrasound and improve patient outcomes, particularly in remote settings. This review assesses the literature regarding telesonography in emergency medicine, focussing on evidence of feasibility, diagnostic accuracy and clinical utility. A systematic search was performed for articles published from 1946 to February 2017 using the Cochrane, Medline, EMBASE, and CINAHL databases. Further searches utilising Scopus, Google Scholar, and citation lists were conducted. 4388 titles were identified and screened against inclusion criteria which resulted in the inclusion of 28 papers. These included feasibility, diagnostic accuracy and clinical pilot studies. Study design, methodology and quality were heterogeneous. There was good evidence of feasibility from multiple studies. Where sufficient bandwidth and high quality components were used, diagnostic accuracy was slightly reduced by image transmission. There was evidence of clinical utility in remote hospitals and low-resource settings, although reliability was infrequently reported. Further exploratory research is required to determine minimum requirements for image quality, bandwidth, frame rate and to assess diagnostic accuracy. Clinical trials in remote settings are justifiable. Telecommunication options will depend on local requirements; no one system conveys universal advantages. The methodological quality of research in this field must improve: studies should be designed to minimise bias, and must include details of their methods to allow replication. Analysis of cost effectiveness and sustainability should be provided. [ABSTRACT FROM AUTHOR]

An end-to-end network traffic matrix is significantly helpful for network management and for Software Defined Networks (SDN). However, the end-to-end network traffic matrix's inferences and estimations are a challenging problem. Moreover, attaining the traffic matrix in high-speed networks for SDN is a prohibitive challenge. This paper investigates how to estimate and recover the end-to-end network traffic matrix in fine time granularity from the sampled traffic traces, which is a hard inverse problem. Different from previous methods, the fractal interpolation is used to reconstruct the finer-granularity network traffic. Then, the cubic spline interpolation method is used to obtain the smooth reconstruction values. To attain an accurate the end-to-end network traffic in fine time granularity, we perform a weighted-geometric-average process for two interpolation results that are obtained. The simulation results show that our approaches are feasible and effective. [ABSTRACT FROM AUTHOR]

Finding communities in multilayer networks is a vital step in understanding the structure and dynamics of these layers, where each layer represents a particular type of relationship between nodes in the natural world. However, most community discovery methods for multilayer networks may ignore the interplay between layers or the unique topological structure in a layer. Moreover, most of them can only detect non-overlapping communities. In this paper, we propose a new community discovery method for multilayer networks, which leverages the interplay between layers and the unique topology in a layer to reveal overlapping communities. Through a comprehensive analysis of edge behaviors within and across layers, we first calculate the similarities for edges from the same layer and the cross layers. Then, by leveraging these similarities, we can construct a dendrogram for the multilayer networks that takes both the unique topological structure and the important interplay into consideration. Finally, by introducing a new community density metric for multilayer networks, we can cut the dendrogram to get the overlapping communities for these layers. By applying our method on both synthetic and real-world datasets, we demonstrate that our method has an accurate performance in discovering overlapping communities in multilayer networks. [ABSTRACT FROM AUTHOR]

This paper studies the Retailer Stackelberg game in a supply chain consisting of two manufacturers and one retailer where they compete simultaneously under three factors including price, service and simple price discount contract. It is assumed that the second manufacturer provides service directly to his customers, and the retailer provides service for the first product’s customers, while the retailer buys the first product under price discount from the first manufacturer. The analysis of the optimal equilibrium solutions and the results of the numerical examples show that if a manufacturer chooses the appropriate range of discount rate, he will gain more profit than when there is no discount given to the retailer. This situation can be considered as an effective tool for the coordination of the first manufacturer and the retailer to offer discount by manufacturer and to provide the service by the retailer. We obtain equilibrium solution of Retailer Stackelberg game and analyze the numerical examples under two cases: a) the manufacturers sell their products to the retailer without price discount contract. b) The first manufacturer sells his products to the retailer with the simple price discount contract. The preliminary results show that the service and the price discount contract can improve the performance of supply chain. [ABSTRACT FROM AUTHOR]

The Session Initiation Protocol (SIP) is an extensive and esteemed communication protocol employed to regulate signaling as well as for controlling multimedia communication sessions. Recently, Kumari et al. proposed an improved smart card based authentication scheme for SIP based on Farash’s scheme. Farash claimed that his protocol is resistant against various known attacks. But, we observe some accountable flaws in Farash’s protocol. We point out that Farash’s protocol is prone to key-compromise impersonation attack and is unable to provide pre-verification in the smart card, efficient password change and perfect forward secrecy. To overcome these limitations, in this paper we present an enhanced authentication mechanism based on Kumari et al.’s scheme. We prove that the proposed protocol not only overcomes the issues in Farash’s scheme, but it can also resist against all known attacks. We also provide the security analysis of the proposed scheme with the help of widespread AVISPA (Automated Validation of Internet Security Protocols and Applications) software. At last, comparing with the earlier proposals in terms of security and efficiency, we conclude that the proposed protocol is efficient and more secure. [ABSTRACT FROM AUTHOR]

Controllability of complex networks has been a hot topic in recent years. Real networks regarded as interdependent networks are always coupled together by multiple networks. The cascading process of interdependent networks including interdependent failure and overload failure will destroy the robustness of controllability for the whole network. Therefore, the optimization of the robustness of interdependent network controllability is of great importance in the research area of complex networks. In this paper, based on the model of interdependent networks constructed first, we determine the cascading process under different proportions of node attacks. Then, the structural controllability of interdependent networks is measured by the minimum driver nodes. Furthermore, we propose a parameter which can be obtained by the structure and minimum driver set of interdependent networks under different proportions of node attacks and analyze the robustness for interdependent network controllability. Finally, we optimize the robustness of interdependent network controllability by redundant design including node backup and redundancy edge backup and improve the redundant design by proposing different strategies according to their cost. Comparative strategies of redundant design are conducted to find the best strategy. Results shows that node backup and redundancy edge backup can indeed decrease those nodes suffering from failure and improve the robustness of controllability. Considering the cost of redundant design, we should choose BBS (betweenness-based strategy) or DBS (degree based strategy) for node backup and HDF(high degree first) for redundancy edge backup. Above all, our proposed strategies are feasible and effective at improving the robustness of interdependent network controllability. [ABSTRACT FROM AUTHOR]

“The Belt and Road” initiative has been expected to facilitate interactions among numerous city centers. This initiative would generate a number of centers, both economic and political, which would facilitate greater interaction. To explore how information flows are merged and the specific opportunities that may be offered, Chinese cities along “the Belt and Road” are selected for a case study. Furthermore, urban networks in cyberspace have been characterized by their infrastructure orientation, which implies that there is a relative dearth of studies focusing on the investigation of urban hierarchies by capturing information flows between Chinese cities along “the Belt and Road”. This paper employs Baidu, the main web search engine in China, to examine urban hierarchies. The results show that urban networks become more balanced, shifting from a polycentric to a homogenized pattern. Furthermore, cities in networks tend to have both a hierarchical system and a spatial concentration primarily in regions such as Beijing-Tianjin-Hebei, Yangtze River Delta and the Pearl River Delta region. Urban hierarchy based on web search activity does not follow the existing hierarchical system based on geospatial and economic development in all cases. Moreover, urban networks, under the framework of “the Belt and Road”, show several significant corridors and more opportunities for more cities, particularly western cities. Furthermore, factors that may influence web search activity are explored. The results show that web search activity is significantly influenced by the economic gap, geographical proximity and administrative rank of the city. [ABSTRACT FROM AUTHOR]

In an age when people are predisposed to report real-world events through their social media accounts, many researchers value the benefits of mining user generated content from social media. Compared with the traditional news media, social media services, such as Twitter, can provide more complete and timely information about the real-world events. However events are often like a puzzle and in order to solve the puzzle/understand the event, we must identify all the sub-events or pieces. Existing Twitter event monitoring systems for sub-event detection and summarization currently typically analyse events based on partial data as conventional data collection methodologies are unable to collect comprehensive event data. This results in existing systems often being unable to report sub-events in real-time and often in completely missing sub-events or pieces in the broader event puzzle. This paper proposes a Sub-event detection by real-TIme Microblog monitoring (STRIM) framework that leverages the temporal feature of an expanded set of news-worthy event content. In order to more comprehensively and accurately identify sub-events this framework first proposes the use of adaptive microblog crawling. Our adaptive microblog crawler is capable of increasing the coverage of events while minimizing the amount of non-relevant content. We then propose a stream division methodology that can be accomplished in real time so that the temporal features of the expanded event streams can be analysed by a burst detection algorithm. In the final steps of the framework, the content features are extracted from each divided stream and recombined to provide a final summarization of the sub-events. The proposed framework is evaluated against traditional event detection using event recall and event precision metrics. Results show that improving the quality and coverage of event contents contribute to better event detection by identifying additional valid sub-events. The novel combination of our proposed adaptive crawler and our stream division/recombination technique provides significant gains in event recall (44.44%) and event precision (9.57%). The addition of these sub-events or pieces, allows us to get closer to solving the event puzzle. [ABSTRACT FROM AUTHOR]

Nowadays, quality of service (QoS) is very popular in various research areas like distributed systems, multimedia real-time applications and networking. The requirements of these systems are to satisfy reliability, uptime, security constraints and throughput as well as application specific requirements. The real-time multimedia applications are commonly distributed over the network and meet various time constraints across networks without creating any intervention over control flows. In particular, video compressors make variable bit-rate streams that mismatch the constant-bit-rate channels typically provided by classical real-time protocols, severely reducing the efficiency of network utilization. Thus, it is necessary to enlarge the communication bandwidth to transfer the compressed multimedia streams using Flexible Time Triggered- Enhanced Switched Ethernet (FTT-ESE) protocol. FTT-ESE provides automation to calculate the compression level and change the bandwidth of the stream. This paper focuses on low-latency multimedia transmission over Ethernet with dynamic quality-of-service (QoS) management. This proposed framework deals with a dynamic QoS for multimedia transmission over Ethernet with FTT-ESE protocol. This paper also presents distinct QoS metrics based both on the image quality and network features. Some experiments with recorded and live video streams show the advantages of the proposed framework. To validate the solution we have designed and implemented a simulator based on the Matlab/Simulink, which is a tool to evaluate different network architecture using Simulink blocks. [ABSTRACT FROM AUTHOR]

The Grid scheduler, schedules user jobs on the best available resource in terms of resource characteristics by optimizing job execution time. Resource failure in Grid is no longer an exception but a regular occurring event as resources are increasingly being used by the scientific community to solve computationally intensive problems which typically run for days or even months. It is therefore absolutely essential that these long-running applications are able to tolerate failures and avoid re-computations from scratch after resource failure has occurred, to satisfy the user’s Quality of Service (QoS) requirement. Job Scheduling with Fault Tolerance in Grid Computing using Ant Colony Optimization is proposed to ensure that jobs are executed successfully even when resource failure has occurred. The technique employed in this paper, is the use of resource failure rate, as well as checkpoint-based roll back recovery strategy. Check-pointing aims at reducing the amount of work that is lost upon failure of the system by immediately saving the state of the system. A comparison of the proposed approach with an existing Ant Colony Optimization (ACO) algorithm is discussed. The experimental results of the implemented Fault Tolerance scheduling algorithm show that there is an improvement in the user’s QoS requirement over the existing ACO algorithm, which has no fault tolerance integrated in it. The performance evaluation of the two algorithms was measured in terms of the three main scheduling performance metrics: makespan, throughput and average turnaround time. [ABSTRACT FROM AUTHOR]

This paper proposes an innovative internet of things (IoT) based communication framework for monitoring microgrid under the condition of packet dropouts in measurements. First of all, the microgrid incorporating the renewable distributed energy resources is represented by a state-space model. The IoT embedded wireless sensor network is adopted to sense the system states. Afterwards, the information is transmitted to the energy management system using the communication network. Finally, the least mean square fourth algorithm is explored for estimating the system states. The effectiveness of the developed approach is verified through numerical simulations. [ABSTRACT FROM AUTHOR]