Exploring AI supported Citizen Argumentation on Urban Participation Platforms

The paradigm shift in urban planning toward citizen participation originates from the Smart City concept, as politicians and scientists argue that citizens should be included in the design of their environment. This led to the development of urban participation platforms and was enhanced by the COVID-19 pandemic as on-site participation was unavailable. Past projects showed that urban participation platforms can reach thousands of citizens, but it became apparent that citizens' contributions vary widely and are sometimes not understandable and comprehensible which limits their value for urban projects. Therefore, we examined how an AI-based feedback system can increase citizens’ argumentation on urban platforms. For this, an explorative comparison of two prototypes was conducted by applying Argumentation Theory and Mayring's qualitative content analysis to empirically analyze collected data. The findings highlight that the developed AI-based feedback system supports citizens and leads to more argumentative and comprehensible argumentations on urban participation platforms

Graph-based methods for Significant Concept Selection

It is well known in information retrieval area that one important issue is the gap between the query and document vocabularies. Concept-based representation of both the document and the query is one of the most effective approaches that lowers the effect of text mismatch and allows the selection of relevant documents that deal with the shared semantics hidden behind both. However, identifying the best representative concepts from texts is still challenging. In this paper, we propose a graph-based method to select the most significant concepts to be integrated into a conceptual indexing system. More specifically, we build the graph whose nodes represented concepts and weighted edges represent semantic distances. The importance of concepts are computed using centrality algorithms that levrage between structural and contextual importance. We experimentally evaluated our method of concept selection using the standard ImageClef2009 medical data set. Results showed that our approach significantly improves the retrieval effectiveness in comparison to state-of-the-art retrieval models

Weighted string distance approach based on modified clustering technique for optimizing test case prioritization

Numerous test case prioritization (TCP) approaches have been introduced to enhance the test viability in software testing activity with the goal to maximize early average percentage fault detection (APFD). String based approach had shown that applying a single string distance-based metric to differentiate the test cases can improve the APFD and coverage rate (CR) results. However, to precisely differentiate the test cases in regression testing, the string approach still requires an enhancement as it lacks priority criteria. Therefore, a study on how to effectively cluster and prioritize test cases through string-based approach is conducted. To counter the string distances problem, weighted string distances is introduced. A further enhancement was made by tuning the weighted string metric with K-Means clustering and prioritization using Firefly Algorithm (FA) technique for the TCP approach to become more flexible in manipulating available information. Then, the combination of the weighted string distances along with clustering and prioritization is executed under the designed process for a new weighted string distances-based approach for complete evaluation. The experimental results show that all the weighted string distances obtained better results compared to its single string metric with average APFD values 95.73% and CR values 61.80% in cstcas Siemen dataset. As for the proposed weighted string distances approach with clustering techniques for regression testing, the combination obtained better results and flexibility than the conventional string approach. In addition, the proposed approach also passed statistical assessment by obtaining p-value higher than 0.05 in Shapiro-Wilk’s normality test and p-value lower than 0.05 in Tukey Kramer Post Hoc tests. In conclusion, the proposed weighted string distances approach improves the overall score of APFD and CE and provides flexibility in the TCP approach for regression testing environment

Addressing consumer demands: a manufacturing collaboration process using blockchain for knowledge representation

Under I4.0, the evolution of the manufacturing processes is supported by an increase of data that is available and produced by organisations, the digitalisation of manufacturing pipelines, and a paradigm shift in production (from mass production to mass personalisation). Additionally, organisations need to gather the necessary conditions to ensure their quick adaptation to a changing environment and replace reactiveness for proactivity. Collaboration can act as the foundation to an answer for the increase demand for customised products, with an open and transparent environment where information is shared, and actors can work together to solve a common problem. In this work we propose a model definition for an industrial collaboration network composed by a network of entities, with reasoning and interaction, that uses a blockchain for knowledge representation. Current definitions of MAS already include a representation of equipment, transportation, products, and organisations; our contribution proposes the inclusion of the consumer, represented by an agent, directly in the manufacturing process. This agent represents the preferences and needs of the consumer in product customisation scenarios which, together with the other agents, negotiate criteria and cooperate with each other. The network is composed by distinct types of agents, across multiple organisations, that share common objectives. We use Hyperledger Fabric to represent knowledge, assuring that the data is stored and shared with all entities, while keeping the information secure and assuring that it cannot be tampered with.FCT - Fundação para a Ciência e a Tecnologia(UIDB/04728/2020

How Fast Can We Play Tetris Greedily With Rectangular Pieces?

Consider a variant of Tetris played on a board of width $w$ and infinite height, where the pieces are axis-aligned rectangles of arbitrary integer dimensions, the pieces can only be moved before letting them drop, and a row does not disappear once it is full. Suppose we want to follow a greedy strategy: let each rectangle fall where it will end up the lowest given the current state of the board. To do so, we want a data structure which can always suggest a greedy move. In other words, we want a data structure which maintains a set of $O(n)$ rectangles, supports queries which return where to drop the rectangle, and updates which insert a rectangle dropped at a certain position and return the height of the highest point in the updated set of rectangles. We show via a reduction to the Multiphase problem [P\u{a}tra\c{s}cu, 2010] that on a board of width $w=\Theta(n)$, if the OMv conjecture [Henzinger et al., 2015] is true, then both operations cannot be supported in time $O(n^{1/2-\epsilon})$ simultaneously. The reduction also implies polynomial bounds from the 3-SUM conjecture and the APSP conjecture. On the other hand, we show that there is a data structure supporting both operations in $O(n^{1/2}\log^{3/2}n)$ time on boards of width $n^{O(1)}$, matching the lower bound up to a $n^{o(1)}$ factor.Comment: Correction of typos and other minor correction

Extension of Dictionary-Based Compression Algorithms for the Quantitative Visualization of Patterns from Log Files

Many services today massively and continuously produce log files of different and varying formats. These logs are important since they contain information about the application activities, which is necessary for improvements by analyzing the behavior and maintaining the security and stability of the system. It is a common practice to store log files in a compressed form to reduce the sheer size of these files. A compression algorithm identifies frequent patterns in a log file to remove redundant information. This work presents an approach to detect frequent patterns in textual data that can be simultaneously registered during the file compression process with low consumption of resources. The log file can be visualized with the possibility to explore the extracted patterns using metrics based on such properties as frequency, length and root prefixes of the acquired pattern. This allows an analyst to gain the relevant insights more efficiently reducing the need for manual labor-intensive inspection in the log data. The extension of the implemented dictionary-based compression algorithm has the advantage of recognizing patterns in log files of any format and eliminates the need to manually perform preparation for any preprocessing of log files.Comment: submitted to EuroVA 202

Optimal overcurrent relay coordination in wind farm using genetic algorithm

Wind farms are ones of the most indispensable types of sustainable energies which are progressively engaged in smart grids with tenacity of electrical power generation predominantly as a distribution generation system. Thus, rigorous protection of wind power plants is an immensely momentous aspect in electrical power protection engineering which must be contemplated thoroughly during designing the wind plants to afford a proper protection for power components in case of fault occurrence. The most commodious protection apparatus are overcurrent relays (OCRs) which are responsible for protecting power systems from impending faults. In order to employ a prosperous and proper protection for wind farms, these relays must be set precisely and well-coordinated with each other to clear the faults at the system in the shortest possible time. These relays are set and coordinated with each other by applying IEEE or IEC standards methods, however, their operation times are relatively long and the coordination between these relays are not optimal. The other common problem in these power systems is when a fault occurs in a plant, several OCRs operate instead of a designated relay to that particular fault location. This, if undesirable can result in unnecessary power loss and disconnection of healthy feeders out of the plant which is extremely dire. It is necessary to address the problems related inefficient coordination of OCRs. Many suggestions have been made and approaches implemented, however one of the most prominent methods is the use of Genetic Algorithm (GA) to improve the function and coordination of OCRs. GA optimization technique was implemented in this project due to its ample advantages over other AI techniques including proving high accuracy, fast response and most importantly obtaining optimal solutions for nonlinear characteristics of OCRs. In addressing the mentioned problems, the main objective of this research is to improve the protection of wind farms by optimizing the relay settings, reducing their operation time, Time Setting Multiplier (TSM) of each relay, improving the coordination between relays after implementation of IEC 60255-151:2009 standard. The most recent and successful OF for GA technique has been used, unique parameters for GA was selected for this research to significantly improve the protection for wind farms that is highly better compared to any research accomplished before for the purpose of wind farm protection. GA was used to obtain improved values for each relay settings based on their coordination criteria. Each relay operation time and TSM are optimized which would contribute to provide a better protection for wind farm. Thus, the objective of this work which is improving the protection of wind farms by optimizing the relay settings, reducing their operation time, Time Setting Multiplier (TSM) of each relay, improving the coordination between relays, have been successfully fulfilled and solved the problems associated with wind farm relay protection system settings. The new approach has shown significant improvement in operation of OCRs at the wind farm, have drastically reduced the accumulative operation time of the relays by 26.8735% (3.7623 seconds)