scholarly journals A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

Algorithms ◽  
2020 ◽  
Vol 13 (6) ◽  
pp. 146
Author(s):  
Andreas Emil Feldmann ◽  
Karthik C. Karthik C. S. ◽  
Euiwoong Lee ◽  
Pasin Manurangsi
Keyword(s):  
Parameterized Complexity ◽  
Future Research ◽  
Np Hard ◽  
New Techniques ◽  
Research Directions ◽  
Ways Of Coping ◽  
Hard Problems ◽  
Future Research Directions ◽  
Np Hard Problems

Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results. We survey developments in the area both from the algorithmic and hardness perspectives, with emphasis on new techniques and potential future research directions.

Evolution of Malware in the Digital Transformation Age

2021 ◽  
pp. 244-266
Author(s):  
Shahid Alam
Keyword(s):  
Leading Edge ◽  
Digital Transformation ◽  
Future Research ◽  
Malware Analysis ◽  
New Wave ◽  
New Techniques ◽  
Research Directions ◽  
Detection Techniques ◽  
Future Research Directions ◽  
Native Code

As corporations are stepping into the new digital transformation age and adopting leading-edge technologies such as cloud, mobile, and big data, it becomes crucial for them to contemplate the risks and rewards of this adoption. At the same time, the new wave of malware attacks is posing a severe impediment in implementing these technologies. This chapter discusses some of the complications, challenges, and issues plaguing current malware analysis and detection techniques. Some of the key challenges discussed are automation, native code, obfuscations, morphing, and anti-reverse engineering. Solutions and recommendations are provided to solve some of these challenges. To stimulate further research in this thriving area, the authors highlight some promising future research directions. The authors believe that this chapter provides an auspicious basis for future researchers who intend to know more about the evolution of malware and will act as a motivation for enhancing the current and developing the new techniques for malware analysis and detection.

Computerized Paleographic Investigation of Hebrew Iron Age Ostraca

Radiocarbon ◽  
2015 ◽  
Vol 57 (2) ◽  
pp. 317-325 ◽  
Author(s):  
Shira Faigenbaum-Golovin ◽  
Arie Shaus ◽  
Barak Sober ◽  
Israel Finkelstein ◽  
David Levin ◽  
...  
Keyword(s):  
Iron Age ◽  
Multispectral Imaging ◽  
Imaging Systems ◽  
Future Research ◽  
Signal Acquisition ◽  
New Techniques ◽  
Research Directions ◽  
Ongoing Research ◽  
Tel Aviv ◽  
Future Research Directions

This article surveys ongoing research of the Legibility Enhancement of Ostraca (LEO) team of Tel Aviv University in the field of computerized paleography of Hebrew Iron Age ink-written ostraca. We perform paleographic tasks using tools from the fields of image processing and machine learning. Several new techniques serving this aim, as well as an adaptation of existing ones, are described herein. This includes testing a range of signal-acquisition methodologies, out of which multispectral imaging and Raman spectroscopy have matured into imaging systems. In addition, we deal with semior fully automated facsimile construction and refinement, facsimile, and character evaluation, as well as the reconstruction of broken character strokes. We conclude with future research directions, addressing some of the long-standing epigraphic questions, such as the number of scribes in specific corpora or detection of chronological concurrences and inconsistencies.

scholarly journals Multivariate Investigation of NP-Hard Problems: Boundaries Between Parameterized Tractability and Intractability

2020 ◽  
Author(s):  
Uéverton Souza ◽  
Fábio Protti ◽  
Maise Da Silva ◽  
Dieter Rautenbach
Keyword(s):  
Polynomial Time ◽  
Parameterized Complexity ◽  
Complexity Analysis ◽  
Np Hard ◽  
Fixed Parameter Tractable ◽  
Complementary Approach ◽  
Fixed Parameter ◽  
Hard Problems ◽  
Induced Matchings ◽  
Np Hard Problems

In this thesis we present a multivariate investigation of the complexity of some NP-hard problems, i.e., we first develop a systematic complexity analysis of these problems, defining its subproblems and mapping which one belongs to each side of an “imaginary boundary” between polynomial time solvability and intractability. After that, we analyze which sets of aspects of these problems are sources of their intractability, that is, subsets of aspects for which there exists an algorithm to solve the associated problem, whose non-polynomial time complexity is purely a function of those sets. Thus, we use classical and parameterized complexity in an alternate and complementary approach, to show which subproblems of the given problems are NP-hard and latter to diagnose for which sets of parameters the problems are fixed-parameter tractable, or in FPT. This thesis exhibits a classical and parameterized complexity analysis of different groups of NP-hard problems. The addressed problems are divided into four groups of distinct nature, in the context of data structures, combinatorial games, and graph theory: (I) and/or graph solution and its variants; (II) flooding-filling games; (III) problems on P3-convexity; (IV) problems on induced matchings.

Sign in / Sign up

Export Citation Format

Share Document