Scalable Audience Reach Estimation in Real-time Online Advertising

Online advertising has been introduced as one of the most efficient methods of advertising throughout the recent years. Yet, advertisers are concerned about the efficiency of their online advertising campaigns and consequently, would like to restrict their ad impressions to certain websites and/or certain groups of audience. These restrictions, known as targeting criteria, limit the reachability for better performance. This trade-off between reachability and performance illustrates a need for a forecasting system that can quickly predict/estimate (with good accuracy) this trade-off. Designing such a system is challenging due to (a) the huge amount of data to process, and, (b) the need for fast and accurate estimates. In this paper, we propose a distributed fault tolerant system that can generate such estimates fast with good accuracy. The main idea is to keep a small representative sample in memory across multiple machines and formulate the forecasting problem as queries against the sample. The key challenge is to find the best strata across the past data, perform multivariate stratified sampling while ensuring fuzzy fall-back to cover the small minorities. Our results show a significant improvement over the uniform and simple stratified sampling strategies which are currently widely used in the industry

Adding Contextual Information to Intrusion Detection Systems Using Fuzzy Cognitive Maps

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.In the last few years there has been considerable increase in the efficiency of Intrusion Detection Systems (IDSs). However, networks are still the victim of attacks. As the complexity of these attacks keeps increasing, new and more robust detection mechanisms need to be developed. The next generation of IDSs should be designed incorporating reasoning engines supported by contextual information about the network, cognitive information and situational awareness to improve their detection results. In this paper, we propose the use of a Fuzzy Cognitive Map (FCM) in conjunction with an IDS to incorporate contextual information into the detection process. We have evaluated the use of FCMs to adjust the Basic Probability Assignment (BPA) values defined prior to the data fusion process, which is crucial for the IDS that we have developed. The experimental results that we present verify that FCMs can improve the efficiency of our IDS by reducing the number of false alarms, while not affecting the number of correct detections

Design and Analysis of an Estimation of Distribution Approximation Algorithm for Single Machine Scheduling in Uncertain Environments

In the current work we introduce a novel estimation of distribution algorithm to tackle a hard combinatorial optimization problem, namely the single-machine scheduling problem, with uncertain delivery times. The majority of the existing research coping with optimization problems in uncertain environment aims at finding a single sufficiently robust solution so that random noise and unpredictable circumstances would have the least possible detrimental effect on the quality of the solution. The measures of robustness are usually based on various kinds of empirically designed averaging techniques. In contrast to the previous work, our algorithm aims at finding a collection of robust schedules that allow for a more informative decision making. The notion of robustness is measured quantitatively in terms of the classical mathematical notion of a norm on a vector space. We provide a theoretical insight into the relationship between the properties of the probability distribution over the uncertain delivery times and the robustness quality of the schedules produced by the algorithm after a polynomial runtime in terms of approximation ratios

On-demand fuzzy clustering and ant-colony optimisation based mobile data collection in wireless sensor network

In a wireless sensor network (WSN), sensor nodes collect data from the environment and transfer this data to an end user through multi-hop communication. This results in high energy dissipation of the devices. Thus, balancing of energy consumption is a major concern in such kind of network. Appropriate cluster head (CH) selection may provide to be an efficient way to reduce the energy dissipation and prolonging the network lifetime in WSN. This paper has adopted the concept of fuzzy if-then rules to choose the cluster head based on certain fuzzy descriptors. To optimise the fuzzy membership functions, Particle Swarm Optimisation (PSO) has been used to improve their ranges. Moreover, recent study has confirmed that the introduction of a mobile collector in a network which collects data through short-range communications also aids in high energy conservation. In this work, the network is divided into clusters and a mobile collector starts from the static sink or base station and moves through each of these clusters and collect data from the chosen cluster heads in a single-hop fashion. Mobility based on Ant-Colony Optimisation (ACO) has already proven to be an efficient method which is utilised in this work. Additionally, instead of performing clustering in every round, CH is selected on demand. The performance of the proposed algorithm has been compared with some existing clustering algorithms. Simulation results show that the proposed protocol is more energy-efficient and provides better packet delivery ratio as compared to the existing protocols for data collection obtained through Matlab Simulations

On Causal Relations between Mental Organizer, Action under Mental Processes, and Social Environment

The purpose of the research was to study the relationships between mental organizers, action under mental process, and social environment through observation. A category system for each behavior was constructed and data were analyzed with matrices to find out kinds of root causes in causal dynamic. Reliability, subjectivity, and validity of observation were assessed. The coefficient of reliability was 0.937. The observation had about 11% subjectivity, and the frequencies were in the categories where they should be, mainly. Results indicate that there occurs causal variety. The causes are not stable. As an entity, the results show that it is possible to tackle mind processes through the causation. Furthermore, the processes are in series but they drop by in a parallel mode when the task becomes more difficult. However, the mindamic seems to have the greatest possible number of the degrees of freedom, simultaneously

On the Leakage of Fuzzy Matchers

In a biometric recognition system, the matcher compares an old and a fresh template to decide if it is a match or not. Beyond the binary output (`yes' or `no'), more information is computed. This paper provides an in-depth analysis of information leakage during distance evaluation, with an emphasis on threshold-based obfuscated distance (\textit{i.e.}, Fuzzy Matcher). Leakage can occur due to a malware infection or the use of a weakly privacy-preserving matcher, exemplified by side channel attacks or partially obfuscated designs. We provide an exhaustive catalog of information leakage scenarios as well as their impacts on the security concerning data privacy. Each of the scenarios leads to generic attacks whose impacts are expressed in terms of computational costs, hence allowing the establishment of upper bounds on the security level.Comment: Minor correction