z-arcs in the thirty degrees sector

Yevgenya Movshovich

doi:10.1515/jaa-2021-2056

z-arcs in the thirty degrees sector

Journal of Applied Analysis ◽

10.1515/jaa-2021-2056 ◽

2021 ◽

Vol 0 (0) ◽

Author(s):

Yevgenya Movshovich

Keyword(s):

Covering Problems ◽

Worm Problem

Abstract In this detailed study of 3-segment non-convex simple arcs inscribed in the 30 ∘ {30^{\circ}} sector, we show that each such arc of length one fits in the interior of the sector of radius one with the prescribed embedding. We discuss implications of this study for covering problems involving triangular covers and for the worm problem of Leo Moser.

Download Full-text

A new Artificial Bee Colony algorithm for Set Covering Problems

Electrical Engineering and Information Technology ◽

10.2495/ceeit140051 ◽

2014 ◽

Cited By ~ 6

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Rodrigo Cuesta Aguilar ◽

Fernando Paredes

Keyword(s):

Artificial Bee Colony Algorithm ◽

Artificial Bee Colony ◽

Set Covering ◽

Covering Problems ◽

Set Covering Problems ◽

Bee Colony

Download Full-text

Hyperbolic set covering problems with competing ground-set elements

Mathematical Programming ◽

10.1007/s10107-010-0431-1 ◽

2011 ◽

Vol 134 (2) ◽

pp. 323-348 ◽

Cited By ~ 5

Author(s):

Edoardo Amaldi ◽

Sandro Bosio ◽

Federico Malucelli

Keyword(s):

Set Covering ◽

Covering Problems ◽

Set Covering Problems ◽

Hyperbolic Set

Download Full-text

Simulating realistic set covering problems with known optimal solutions

Computers & Industrial Engineering ◽

10.1016/j.cie.2011.02.008 ◽

2011 ◽

Vol 61 (1) ◽

pp. 39-47 ◽

Cited By ~ 3

Author(s):

Nabin Sapkota ◽

Charles H. Reilly

Keyword(s):

Set Covering ◽

Optimal Solutions ◽

Covering Problems ◽

Set Covering Problems

Download Full-text

Mapping OWL-S Process Model to Timed Automata

Journal of Information Technology Research ◽

10.4018/jitr.2018010103 ◽

2018 ◽

Vol 11 (1) ◽

pp. 29-48

Author(s):

Amel Boumaza ◽

Ramdane Maamri

Keyword(s):

Web Services ◽

Process Model ◽

Timed Automata ◽

Automatic Verification ◽

Covering Problems ◽

Field Verification ◽

Starting Point ◽

Quantitative Properties ◽

Time Systems

The conversion of web services to semantic web comes the opportunity to automate various tasks. OWL-S plays a key role in describing web services behaviour. While ontology-based semantics given to OWL-S is structural rather than behaviourally oriented, we cannot automate an essential task in this field, verification. In this article, the mapping of OWL-S process model to Timed automata is investigated, which is a suitable formalism for real time systems modeling and automatic verification. Hence, this has led to not only enabling automatic verification but also covering problems related to automated verification of temporal quantitative properties as bounded liveness property. As a starting point, the OWL-S and sub entry of time ontologies for describing the timed behaviour of services has been chosen. A defined set of mapping rules is used to automatically encode control constructs defined in OWL-S and temporal information into timed automata. Also, it is shown how a Uppaal checker is used to check required properties formulated in TCTL. Finally, an EClinic case study is used to illustrate the technique.

Download Full-text