Handling Problems at the Ocean-Air Interface

1968 ◽  
Vol 5 (04) ◽  
pp. 410-426
Author(s):  
Arthur Pitchersky ◽  
Arthur Southerland
Keyword(s):  
Broad Spectrum ◽  
State Of The Art ◽  
The State ◽  
New Techniques ◽  
New Methods ◽  
Air Interface ◽  
Degree Of Control ◽  
Increasing Demand ◽  
Improved Technology

The increasing demand for a flexible Naval response to a broad spectrum of military situations imposes a demand to carry out missions in increasingly higher sea states. Launching and retrieving buoyant objects or loading cargo into boats responding to the ocean-air interface requires improved technology for successful operations in high sea states. There is an urgent need for handling systems that provide the degree of control necessary for those Navy missions subjected to an increasing all-weather response. Advances in the state of the art or the development of new techniques are needed to support these operational requirements. This paper will discuss present handling systems and proposed new methods.

On the Exact Solution of Prize-Collecting Steiner Tree Problems

2021 ◽  
Author(s):  
Daniel Rehfeldt ◽  
Thorsten Koch
Keyword(s):  
Exact Solution ◽  
Steiner Tree ◽  
State Of The Art ◽  
The State ◽  
Steiner Tree Problem ◽  
New Techniques ◽  
Practical Applications ◽  
Computational Performance ◽  
Benchmark Instances ◽  
Prize Collecting

The prize-collecting Steiner tree problem (PCSTP) is a well-known generalization of the classic Steiner tree problem in graphs, with a large number of practical applications. It attracted particular interest during the 11th DIMACS Challenge in 2014, and since then, several PCSTP solvers have been introduced in the literature. Although these new solvers further, and often drastically, improved on the results of the DIMACS Challenge, many PCSTP benchmark instances have remained unsolved. The following article describes further advances in the state of the art in exact PCSTP solving. It introduces new techniques and algorithms for PCSTP, involving various new transformations (or reductions) of PCSTP instances to equivalent problems, for example, to decrease the problem size or to obtain a better integer programming formulation. Several of the new techniques and algorithms provably dominate previous approaches. Further theoretical properties of the new components, such as their complexity, are discussed. Also, new complexity results for the exact solution of PCSTP and related problems are described, which form the base of the algorithm design. Finally, the new developments also translate into a strong computational performance: the resulting exact PCSTP solver outperforms all previous approaches, both in terms of runtime and solvability. In particular, it solves several formerly intractable benchmark instances from the 11th DIMACS Challenge to optimality. Moreover, several recently introduced large-scale instances with up to 10 million edges, previously considered to be too large for any exact approach, can now be solved to optimality in less than two hours. Summary of Contribution: The prize-collecting Steiner tree problem (PCSTP) is a well-known generalization of the classic Steiner tree problem in graphs, with many practical applications. The article introduces and analyses new techniques and algorithms for PCSTP that ultimately aim for improved (practical) exact solution. The algorithmic developments are underpinned by results on theoretical aspects, such as fixed-parameter tractability of PCSTP. Computationally, we considerably push the limits of tractibility, being able to solve PCSTP instances with up to 10 million edges. The new solver, which also considerably outperforms the state of the art on smaller instances, will be made publicly available as part of the SCIP Optimization Suite.

New approaches to European loess: a stratigraphic and methodical review of the past decade

2010 ◽  
Vol 2 (1) ◽  
Author(s):  
Ludwig Zoeller
Keyword(s):  
Environmental Change ◽  
Review Paper ◽  
State Of The Art ◽  
The State ◽  
The Past ◽  
New Methods ◽  
New Approaches ◽  
Climatic And Environmental Change

AbstractThis review paper intends to summarize the state of the art in loess research at the first international “Loess-fest’99” conference and to outline progress in loess research during the past decade. The focus is on loess as a terrestrial archive of climatic and environmental change during the Quaternary. The review highlights remarkable new results from regional investigations into European loess, as well as the emergence of new methods and refinements of established techniques, focussing on stratigraphy, dating and palaeoenvironment. It is concluded that loess research during the past decade not only has developed rapidly to take an outstanding place in Quaternary sciences, but also promises exciting perspectives for the next decade, in particular when combined approaches are applied to benefit from the now comprehensive pool of established and new methods.

Advances in Forensic Geophysics

2022 ◽  
pp. 15-36
Author(s):  
Elhoucine Essefi
Keyword(s):  
Magnetic Susceptibility ◽  
State Of The Art ◽  
The State ◽  
Efficient Tool ◽  
New Techniques ◽  
Buried Objects ◽  
Localization And Mapping ◽  
Pollution Detection ◽  
Environmental Crimes

Traditionally, forensic geophysics involves the study, search, localization, and mapping of buried objects or elements within soil, buildings, or water using geophysics tools for legal purposes. Recently, with the evolution of environmental crimes, forensic geophysics gave special care to detection, location, and quantification of polluting products. New techniques including the magnetic susceptibility have emerged to investigate this type of crimes. After discussing the state of the art of forensic geophysics, this chapter proposed the magnetic susceptibility as an efficient tool of environmental crimes detection. A case study of pollution detection was proposed from Tunisia. Being a fast and cheap technique, magnetic surveys represent a real promise for environmental forensic geophysics.

A New Approach to Evaporation

1968 ◽  
Author(s):  
Derek F. Dinnage
Keyword(s):  
State Of The Art ◽  
The State ◽  
New Techniques ◽  
New Approach

The ever growing need for the removal of water from solutions has brought forward the development of many new techniques. As the state-of-the-art has become more sophisticated, specialist designs have been evolved to cater for particular requirements. Paper published with permission.

scholarly journals LMPP: A Large Margin Point Process Combining Reinforcement and Competition for Modeling Hashtag Popularity

2017 ◽  
Author(s):  
Bidisha Samanta ◽  
Abir De ◽  
Abhijnan Chakraborty ◽  
Niloy Ganguly
Keyword(s):  
Point Process ◽  
Broad Spectrum ◽  
State Of The Art ◽  
The State ◽  
Probabilistic Framework ◽  
Additional Advantage ◽  
Large Margin ◽  
Two Factors ◽  
Popularity Dynamics ◽  
Popularity Prediction

Predicting the popularity dynamics of Twitter hashtags has a broad spectrum of applications. Existing works have mainly focused on modeling the popularity of individual tweets rather than the popularity of the underlying hashtags. Hence, they do not consider several realistic factors for hashtag popularity. In this paper, we propose Large Margin Point Process (LMPP), a probabilistic framework that integrates hashtag-tweet influence and hashtag-hashtag competitions, the two factors which play important roles in hashtag propagation. Furthermore, while considering the hashtag competitions, LMPP looks into the variations of popularity rankings of the competing hashtags across time. Extensive experiments on seven real datasets demonstrate that LMPP outperforms existing popularity prediction approaches by a significant margin. Going further, LMPP can accurately predict the relative rankings of competing hashtags, offering additional advantage over the state-of-the-art baselines.

scholarly journals The Automated Negotiating Agents Competition, 2010–2015

AI Magazine ◽  
2015 ◽  
Vol 36 (4) ◽  
pp. 115-118 ◽  
Author(s):  
Tim Baarslag ◽  
Reyhan Aydoğan ◽  
Koen V. Hindriks ◽  
Katsuhide Fujita ◽  
Takayuki Ito ◽  
...  
Keyword(s):  
Learning Strategies ◽  
Design Space ◽  
State Of The Art ◽  
The State ◽  
New Techniques ◽  
Negotiation Agents ◽  
International Event ◽  
Acceptable Agreement

The Automated Negotiating Agents Competition is an international event that, since 2010, has contributed to the evaluation and development of new techniques and benchmarks for improving the state-of-the-art in automated multi-issue negotiation. A key objective of the competition has been to analyze and search the design space of negotiating agents for agents that are able to operate effectively across a variety of domains. The competition is a valuable tool for studying important aspects of negotiation including profiles and domains, opponent learning, strategies, bilateral and multilateral protocols. Two of the challenges that remain are: How to develop argumentation-based negotiation agents that next to bids, can inform and argue to obtain an acceptable agreement for both parties, and how to create agents that can negotiate in a human fashion.

Reconfigurable Antennas: the State of the Art

2010 ◽  
Vol 56 (3) ◽  
pp. 319-326 ◽  
Author(s):  
Yevhen Yashchyshyn
Keyword(s):  
Broad Spectrum ◽  
State Of The Art ◽  
Reconfigurable Antennas ◽  
The State ◽  
High Quality ◽  
Fundamental Research

Reconfigurable Antennas: the State of the ArtThe paper provides an overview of the state of the art in the area of reconfigurable antennas. This emerging area has been rapidly developing in the recent years. This article brings a comprehensive summary of the high quality applied and fundamental research contributions in the above-mentioned field. A broad spectrum of topics is covered, reflecting the areas in which Institute of Radioelectronics's expertise is recognized worldwide.

scholarly journals Revisiting the Posttherapeutic Cure Criterion in Chagas Disease: Time for New Methods, More Questions, Doubts, and Polemics or Time to Change Old Concepts?

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Marta de Lana ◽  
Olindo Assis Martins-Filho
Keyword(s):  
Chagas Disease ◽  
State Of The Art ◽  
The State ◽  
Future Perspectives ◽  
Sensitivity Limit ◽  
New Methods ◽  
Analytical Review ◽  
Simultaneous Use ◽  
Critical Overview

One of the most relevant issues beyond the effectiveness of etiological treatment of Chagas disease is the lack of consensual/feasible tools to identify and certify the definitive parasitological cure. Several methods of distinct natures (parasitological, serological, and molecular) have been continuously proposed and novel perspectives are currently under investigation. Although the simultaneous use of distinct tests may offer better contributions and advances, it also leads to controversies of interpretation, with lack of mutual consent of cure criterion amongst researchers and physicians. In fact, when distinct host compartments (blood/tissues) are evaluated and explored, novel questions may arise due to the nature and sensitivity limit of each test. This short analytical review intends to present a chronological and critical overview and discuss the state-of-the-art distinct devices available for posttherapeutic cure assessment in Chagas disease, their contributions, meanings, and interpretation, aiming to point out the major gaps and propose novel insight for future perspectives of posttherapeutic management of Chagas disease patients.

scholarly journals Solving Moving-Blocks Problems

2017 ◽  
Author(s):  
André G. Pereira ◽  
Luciana S. Buriol ◽  
Marcus Ritt
Keyword(s):  
Computational Complexity ◽  
Heuristic Search ◽  
State Of The Art ◽  
The State ◽  
New Methods ◽  
Complexity Results

Moving-blocks problems are extremely hard to solve and a representative abstraction of many applications. Despite their importance, the known computational complexity results are limited to few versions of these problems. In addition, there are no effective methods to optimally solve them. We address both of these issues. This thesis proves the PSPACE-completeness of many versions of moving-blocks problems. Moreover, we propose new methods to optimally solve these problems based on heuristic search with admissible heuristic functions and tie-breaking strategies. Our methods advance the state of the art, create new lines of research and improve the results of applications.

scholarly journals Implications, conflicts, and reductions for Steiner trees

2021 ◽  
Author(s):  
Daniel Rehfeldt ◽  
Thorsten Koch
Keyword(s):  
Steiner Tree ◽  
State Of The Art ◽  
The State ◽  
Branch And Cut ◽  
Steiner Tree Problem ◽  
New Methods ◽  
Current State ◽  
Benchmark Instances ◽  
Extensive Collection ◽  
First Time

AbstractThe Steiner tree problem in graphs (SPG) is one of the most studied problems in combinatorial optimization. In the past 10 years, there have been significant advances concerning approximation and complexity of the SPG. However, the state of the art in (practical) exact solution of the SPG has remained largely unchallenged for almost 20 years. While the DIMACS Challenge 2014 and the PACE Challenge 2018 brought renewed interest into Steiner tree problems, even the best new SPG solvers cannot match the state of the art on the vast majority of benchmark instances. The following article seeks to advance exact SPG solution once again. The article is based on a combination of three concepts: Implications, conflicts, and reductions. As a result, various new SPG techniques are conceived. Notably, several of the resulting techniques are (provably) stronger than well-known methods from the literature that are used in exact SPG algorithms. Finally, by integrating the new methods into a branch-and-cut framework, we obtain an exact SPG solver that is not only competitive with, but even outperforms the current state of the art on an extensive collection of benchmark sets. Furthermore, we can solve several instances for the first time to optimality.

Sign in / Sign up

Export Citation Format

Share Document