Systems methodologies for handling problem complexity

Purpose The purpose of this paper is to examine how holistic thinking and the use of systems methodologies can help organisations handle increased problem complexity. The paper provides a critical discussion of the development of applied systems thinking and examines how its main strands can deal with problem complexity, multiple perceptions of reality and the unequal access to power resources in organisations. Design/methodology/approach The paper uses social theory and a systems meta-theoretical framework to examine the different ontological and epistemological assumptions that each strand of applied systems thinking makes about the nature of problems and the way in which an intervention will be made. Findings Complex problems require joined-up thinking and the use of systems ideas. Viewing the problem situation from a holistic perspective and applying appropriate systems methodologies and tools can help managers handle the complexities that their organisations face. Originality/value The paper makes a clear link between systems approaches and social theory and emphasises the need to understand the different assumptions that theories, methodologies or people make when they intervene in complex problem situations.

Energy Management Strategy for Hybrid Multimode Powertrains: Influence of Inertial Properties and Road Inclination

Multimode hybrid powertrains have captured the attention of automotive OEMs for their flexible nature and ability to provide better and optimized efficiency levels. However, the presence of multiple actuators, with different efficiency and dynamic characteristics, increases the problem complexity for minimizing the overall power losses in each powertrain operating condition. The paper aims at providing a methodology to select the powertrain mode and set the reference torques and angular speeds for each actuator, based on the power-weighted efficiency concept. The power-weighted efficiency is formulated to normalize the efficiency contribution from each power source and to include the inertial properties of the powertrain components as well as the vehicle motion resistance forces. The approach, valid for a wide category of multimode powertrain architectures, is then applied to the specific case of a two-mode hybrid system where the engagement of one of the two clutches enables an Input Split or Compound Split operative mode. The simulation results obtained with the procedure prove to be promising in avoiding excessive accelerations, drift of powertrain components, and in managing the power flow for uphill and downhill vehicle conditions.

The Diversity Gap: When Diversity Matters for Knowledge

Can diversity make for better science? Although diversity has ethical and political value, arguments for its epistemic value require a bridge between normative and mechanistic considerations, demonstrating why and how diversity benefits collective intelligence. However, a major hurdle is that the benefits themselves are rather mixed: Quantitative evidence from psychology and behavioral sciences sometimes shows a positive epistemic effect of diversity, but often shows a null effect, or even a negative effect. Here we argue that to make progress with these why and how questions, we need first to rethink when one ought to expect a benefit of cognitive diversity. In doing so, we highlight that the benefits of cognitive diversity are not equally distributed about collective intelligence tasks and are best seen for complex, multistage, creative problem solving, during problem posing and hypothesis generation. Throughout, we additionally outline a series of mechanisms relating diversity and problem complexity, and show how this perspective can inform metascience questions.

NetTCR-2.0 enables accurate prediction of TCR-peptide binding by using paired TCRα and β sequence data

Prediction of T-cell receptor (TCR) interactions with MHC-peptide complexes remains highly challenging. This challenge is primarily due to three dominant factors: data accuracy, data scarceness, and problem complexity. Here, we showcase that “shallow” convolutional neural network (CNN) architectures are adequate to deal with the problem complexity imposed by the length variations of TCRs. We demonstrate that current public bulk CDR3β-pMHC binding data overall is of low quality and that the development of accurate prediction models is contingent on paired α/β TCR sequence data corresponding to at least 150 distinct pairs for each investigated pMHC. In comparison, models trained on CDR3α or CDR3β data alone demonstrated a variable and pMHC specific relative performance drop. Together these findings support that T-cell specificity is predictable given the availability of accurate and sufficient paired TCR sequence data. NetTCR-2.0 is publicly available at https://services.healthtech.dtu.dk/service.php?NetTCR-2.0.

Addressing Challenges to Problem Complexity: Effectiveness of AI Assistance During the Design Process

As Artificial Intelligence (AI) assistance tools become more ubiquitous in engineering design, it becomes increasingly necessary to understand the influence of AI assistance on the design process and design effectiveness. Previous work has shown the advantages of incorporating AI design agents to assist human designers. However, the influence of AI assistance on the behavior of designers during the design process is still unknown. This study examines the differences in participants’ design process and effectiveness with and without AI assistance during a complex drone design task using the HyForm design research platform. Data collected from this study is analyzed to assess the design process and effectiveness using quantitative methods, such as Hidden Markov Models and network analysis. The results indicate that AI assistance is most beneficial when addressing moderately complex objectives but exhibits a reduced advantage in addressing highly complex objectives. During the design process, the individual designers working with AI assistance employ a relatively explorative search strategy, while the individual designers working without AI assistance devote more effort to parameter design.

Meerkat Clan Algorithm for Solving N-Queen Problems

The swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environment is a directed graph, called the search space, produced for the efficient search of valid n-queens’ placement, in a way that they do not cause harm to one another. This paper also presents the development of an intelligent heuristic function which is helpful to find the solution with high speed and effectiveness. This study includes a detailed discussion of the problem background, problem complexity, Meerkat Clan Algorithm, and comparisons of the problem solution with the Practical Swarm Optimization (PSO) and Genetic Algorithm (GA. It is an entirely review-based work which implemented the suggested designs and architectures of the methods and a fair amount of experimental results.

Declarative Algorithms and Complexity Results for Assumption-Based Argumentation

The study of computational models for argumentation is a vibrant area of artificial intelligence and, in particular, knowledge representation and reasoning research. Arguments most often have an intrinsic structure made explicit through derivations from more basic structures. Computational models for structured argumentation enable making the internal structure of arguments explicit. Assumption-based argumentation (ABA) is a central structured formalism for argumentation in AI. In this article, we make both algorithmic and complexity-theoretic advances in the study of ABA. In terms of algorithms, we propose a new approach to reasoning in a commonly studied fragment of ABA (namely the logic programming fragment) with and without preferences. While previous approaches to reasoning over ABA frameworks apply either specialized algorithms or translate ABA reasoning to reasoning over abstract argumentation frameworks, we develop a direct declarative approach to ABA reasoning by encoding ABA reasoning tasks in answer set programming. We show via an extensive empirical evaluation that our approach significantly improves on the empirical performance of current ABA reasoning systems. In terms of computational complexity, while the complexity of reasoning over ABA frameworks is well-understood, the complexity of reasoning in the ABA+ formalism integrating preferences into ABA is currently not fully established. Towards bridging this gap, our results suggest that the integration of preferential information into ABA via so-called reverse attacks results in increased problem complexity for several central argumentation semantics.

Linear Programming Model and Online Algorithm for Customer-Centric Train Calendar Generation

An important objective for train operating companies is to let users, especially commuters, directly query the ICT system about trains’ availability calendar, based on an online approach, and give them clear and brief information, expressed through “intelligent” phrases instead of bit maps. This paper provides a linear programming model of this problem and a fast and flexible heuristic algorithm to create descriptive sentences from train calendars. The algorithmic method, based on the “Divide and Conquer” approach, takes the calendar period queried in its whole and divides it into subsets, which are successively processed one by one. The dominant limitation of previous methods is their strong dependence on the size and complexity of instances. On the contrary, our computational findings show that the proposed online algorithm has a very limited and constant computation time, even when increasing the problem complexity, keeping its processing time between 0 and 16 ms, while producing good quality solutions that differ by an average surplus of 0.13 subsentences compared to benchmark state-of-art solutions.