Fire accidents resulting from human errors caused by human attention distractions or minor medical memory lapses during cooking activities pose significant risks to residential safety. In this paper, we propose a smart home fuzzy logic-based system that detects the likelihood of fire and activates emergency alerts and actions. The system integrates fuzzy logic principles with intelligent sensing and decision-making techniques that mitigate fire hazards in real-time. The effectiveness and reliability of the system is demonstrated through experimentation and evaluation. The findings highlight the potential of using fuzzy logic-based approaches in enhancing residential safety and reducing fire-related incidents.

The Frequent Itemset Hiding Problem (FIHP) is an important research topic in the field of Privacy-Preserving Data Mining. Knowledge Graphs (KGs) have also recently emerged as a popular data representation model for various applications. However, the integration of KGs and FIHP is a relatively unexplored area of research. In this paper, we propose a novel approach to address the FIHP by incorporating Community Detection graph-based algorithms to hide sensitive knowledge in our data. Our approach preserves the structure and utility of the KG and efficiently produces the set of Itemsets that must be hidden. We evaluate our approach on popular FIHP datasets and demonstrate its effectiveness in terms of time efficiency.

Hiding sensitive knowledge in transactional databases is a problem that can be addressed through the use of frequent itemset hiding. A well established and robust methodology for hiding sensitive itemsets in transactional databases is embodied through different database extension schemes. Having considered this field extensively in our past and recent research agenda, we proposed a constraint-based hiding model that relies on Border revision and Linear Programming. The Linear Program strives to find the optimal solution to our problem by suggesting which itemsets to add in the extended database for maximum security and data quality. Unfortunately, linear programs do not always have either feasible or optimal solutions, so in this paper we propose some alternate approaches in case of not feasible Linear Programs and suggest the most suitable ones, depending on the needs of the user.

Nowadays, privacy preserving data mining is an increasingly popular field of data mining research. frequent itemset-based approaches comprise a large category of techniques where the hiding is exemplified through the Apriori algorithm. This paper extends the work on a previously presented hiding scheme that sanitizes the input database by extending it based on the ideal positive border that is computed through the application of a constraint-based frequent itemset mining algorithm. The goal of the proposed approach is to improve at large on computational aspects of the hiding methodology, and in particular to accommodate bigger datasets by customizing the hiding scheme and allowing it to run in parallel while ensuring the hiding of the sensitive knowledge in its entirety. The proposed approach is a significant acceleration factor provided to business user directly in the form of Software as a Service.

In this paper, we present a solution that introduces, an electronic guide application for Android smartphones and tablets that aims to assist users with guidance to predefined or user defined points of interest and routes. Instead of buying a tour guide book, visiting an online site, joining a sightseeing tour group or hiring a personal tour guide the proposed smartphone application uses the user's preferences and internet technologies to guide them to their chosen destinations while providing information about them. Our approach includes (a) study of existing navigational systems using mobile devices to find basic and modern functionality requirements (b) design and creation of software for displaying cultural sites, displaying information for such sites on demand and guiding the user through predefined or customized routes and (c) the creation of a central management system (insertion, deletion and editing) of cultural interest points.

Positioning capabilities offered in modern mobile devices enable usage of location-based services. Privacy and security is of great importance for related applications. We present a framework that allows conducting research on anonymity techniques in a real-life environment using smartphones. The proposed solution also includes logging mechanisms that facilitate positioning research dataset development in open format. To present the capabilities of the solution, we deliver the concept of K-anonymity to protect mobile users that issue queries to location-based services. Experimental evaluation of the solution includes development of real-life logging dataset using smartphones by volunteers. Different flavours of anonymity algorithms are easy to be included and tested. The solution has received encouraging feedback and successfully assists the researchers of location based services to experiment, validate and develop their techniques in real life environment.

The explosive growth in the size and use of the World Wide Web continuously creates new great challenges and needs. One such need is dealing with click fraud, which aims at increasing clicks on certain ads and thus the profit of the websites which display them. In this work, we extend the concept of click fraud and redefine it as any pattern of clicks whose goal is to alternate the normal operation of a website in order to produce specific results. An indication of a click fraud may be a burst of clicks that can be simulated by an automated program or script. We deal with the problem of efficient real-time Click Fraud detection utilizing advanced data structures and exploiting their advantages concerning space and time required.

We focus on range query processing on large-scale, typically distributed infrastructures. In this work we present the ART (Autonomous Range Tree) structure, which outperforms the most popular decentralized structures, including Chord (and some of its successors), BATON (and its successor) and Skip-Graphs. ART supports the join/leave and range query operations in O(log log N) and O(log2b logN +|A|) expected w.h.p number of hops respectively, where the base b is a double-exponentially power of two, N is the total number of peers and |A| the answer size.

In this paper we introduce a novel distributed simulation environment with GUI for P2P simulations (D-P2P-Sim). The key aim is to provide the appropriate integrated set of tools in a single software solution to evaluate the performance of various protocols. The basic architecture of the distributed P2P simulator is based on a multi-threading, asynchronous, message passing and distributed environment with graphical user interface to facilitate ease of use by both researchers and programmers.

In this paper we discuss the integration of QoS-awa research and personalization algorithms in order to discover effectual Web Services for the case of mobile web users. We present a number of novel ranking algorithms specially designed for mobile web architectures. To validate and evaluate the proposed algorithms we developed a fully working prototype for mobile-PDA devices. The prototype enables PDA users to access electronic shops and to retrieve information about their products, while going shopping. Comparative experimental results have shown encouraging results that prove m-scroutz to be effective.

In this work, we introduce metrics and a proposed procedure to measure the popularity of a website. We present two novel metrics, Promo and Promo(2) that take advantage of the internal link structure of a website, in order to gain important navigation information. This is indicative of the difficulty the user encounters to access a particular link and can be combined with statistics gained from the log files as a metric of popularity. The two metrics propose a different definition of the popularity of a web object in order to generate a sorted list of promotion values for a website's links. We have delivered a web tool that implements the proposed procedure in order to facilitate a site designer to manipulate his/her web server log data, receive recommendations and popularity results and finally proceed with changes in the structure or position of links. Overall, the experimental study using user-based accesses log data, has been encouraging and it has verified the effectiveness of the Promo metrics.

Late developments in Web Service discovery approaches mainly focus on the incorporation of the QoS concept in the selection process. In this paper, we present a generalized design and implementation of a QoS enabled Web Service discovery mechanism. We describe a mechanism extending the propositions of [1] in a generalized environment that consists of dynamic groups/ categories of different Web Services. A UDDI search wrapper is introduced to facilitate the traditional WS discovery by taking into account QoS characteristics in transparent way. Our aim is the combination of the classic Web Service discovery, at design or execution time, with the benefit of QoS characteristics without affecting the existing UDDI search facilities. To evaluate the functionality, feasibility and effectiveness of the mechanism proposed, a number of experimental applications have been developed. All applications have been available for evaluation online in laboratory.