scholarly journals Quantum and Classical Log-Bounded Automata for the Online Disjointness Problem

Mathematics ◽  
2022 ◽  
Vol 10 (1) ◽  
pp. 143
Author(s):  
Kamil Khadiev ◽  
Aliya Khadieva
Keyword(s):  
Online Algorithms ◽  
Minimization Problem ◽  
Competitive Ratio ◽  
Communication Complexity ◽  
Point Of View ◽  
Online Version ◽  
Query Complexity

We consider online algorithms with respect to the competitive ratio. In this paper, we explore one-way automata as a model for online algorithms. We focus on quantum and classical online algorithms. For a specially constructed online minimization problem, we provide a quantum log-bounded automaton that is more effective (has less competitive ratio) than classical automata, even with advice, in the case of the logarithmic size of memory. We construct an online version of the well-known Disjointness problem as a problem. It was investigated by many researchers from a communication complexity and query complexity point of view.

Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time

2018 ◽  
Vol 35 (06) ◽  
pp. 1850048
Author(s):  
Xing Chai ◽  
Lingfa Lu ◽  
Wenhua Li ◽  
Liqi Zhang
Keyword(s):  
Online Algorithms ◽  
Single Machine ◽  
Competitive Ratio ◽  
Completion Time ◽  
Online Algorithm ◽  
Optimal Schedule ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Asia Pacific ◽  
Weighted Completion Time

In this paper, we consider the online single machine scheduling problem to minimize the maximum weighted completion time of the jobs. For the preemptive problem, we show that the LW (Largest Weight first) rule yields an optimal schedule. For the non-preemptive problem, Li [Li, W (2015). A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completion time. Asia-Pacific Journal of Operational Research, 32(4), 1550030 (10 pages)] presented a lower bound 2, and then provided an online algorithm with a competitive ratio of 3. In this paper, we present two online algorithms with the best-possible competitive ratio of [Formula: see text] for the non-preemptive problem.

scholarly journals Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices

2019 ◽  
Vol 53 (2) ◽  
pp. 559-576 ◽  
Author(s):  
Pascal Schroeder ◽  
Imed Kacem ◽  
Günter Schmidt
Keyword(s):  
Portfolio Selection ◽  
Online Algorithms ◽  
Competitive Ratio ◽  
Numerical Experiments ◽  
Input Sequence ◽  
Relative Price ◽  
Selection Problem ◽  
Online Search ◽  
Worst Case ◽  
Portfolio Selection Problem

In this work we investigate the portfolio selection problem (P1) and bi-directional trading (P2) when prices are interrelated. Zhang et al. (J. Comb. Optim. 23 (2012) 159–166) provided the algorithm UND which solves one variant of P2. We are interested in solutions which are optimal from a worst-case perspective. For P1, we prove the worst-case input sequence and derive the algorithm optimal portfolio for interrelated prices (OPIP). We then prove the competitive ratio and optimality. We use the idea of OPIP to solve P2 and derive the algorithm called optimal conversion for interrelated prices (OCIP). Using OCIP, we also design optimal online algorithms for bi-directional search (P3) called bi-directional UND (BUND) and optimal online search for unknown relative price bounds (RUN). We run numerical experiments and conclude that OPIP and OCIP perform well compared to other algorithms even if prices do not behave adverse.

Current metaphoric models in modern Spanish media discourse

2022 ◽  
Vol 7 (5) ◽  
pp. 8-15
Author(s):  
R. R. Alimova ◽  
V. V. Yakovleva
Keyword(s):  
Quantitative Analysis ◽  
Social Impact ◽  
Point Of View ◽  
Online Version ◽  
Media Discourse ◽  
Community Based ◽  
Spanish Society ◽  
Significant Events ◽  
The World ◽  
Universal Category

In the article, a metaphor as a universal category of thinking, a special cognitive analogy-based operation, and a method of modeling reality, is investigated on journalistic materials of modern Spanish media discourse, the online version of the Spanish newspaper EL MUNDO in particular from the discursive point of view. The use of various types of metaphors by Spanish politicians, which are part of the national-linguistic picture of the world, is examined on the example of media materials concerning the most significant events in the internal life of Spain and international community. Based on the classification by A.P. Chudinov, a semantic and quantitative analysis of metaphorical models in Spanish media discourse is carried out. It is concluded that at the time being Spanish political discourse abounds predominantly in anthropomorphic and sociomorphic metaphors. It was also found that the most frequent is the use of morbial metaphors, which reflect the crisis the Spanish society is undergoing in the pandemic period and its economic, political and social impact on the life of modern Spanish society.

ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST

2007 ◽  
Vol 24 (02) ◽  
pp. 263-277 ◽  
Author(s):  
YONG HE ◽  
SHUGUANG HAN ◽  
YIWEI JIANG
Keyword(s):  
Lower Bound ◽  
Online Algorithms ◽  
Competitive Ratio ◽  
Online Algorithm ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Scheduling Problem ◽  
Identical Machines ◽  
Parallel Machine Scheduling Problem

In this paper, we consider a variant of the classical parallel machine scheduling problem. For this problem, we are given m potential identical machines to non-preemptively process a sequence of independent jobs. Machines need to be activated before starting to process, and each machine activated incurs a fixed machine activation cost. No machines are initially activated, and when a job is revealed the algorithm has the option to activate new machines. The objective is to minimize the sum of the makespan and activation cost of machines. We first present two optimal online algorithms with competitive ratios of 3/2 and 5/3 for m = 2, 3 cases, respectively. Then we present an online algorithm with a competitive ratio of at most 2 for general m ≥ 4, while the lower bound is 1.88.

scholarly journals Online Graph Coloring Against a Randomized Adversary

2018 ◽  
Vol 29 (04) ◽  
pp. 551-569 ◽  
Author(s):  
Elisabet Burjons ◽  
Juraj Hromkovič ◽  
Rastislav Královič ◽  
Richard Královič ◽  
Xavier Muñoz ◽  
...  
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Online Algorithms ◽  
Graph Coloring ◽  
Competitive Ratio ◽  
Upper And Lower Bounds ◽  
Coloring Problem ◽  
Single Instance ◽  
Graph Coloring Problem

We consider an online model where an adversary constructs a set of [Formula: see text] instances [Formula: see text] instead of one single instance. The algorithm knows [Formula: see text] and the adversary will choose one instance from [Formula: see text] at random to present to the algorithm. We further focus on adversaries that construct sets of [Formula: see text]-chromatic instances. In this setting, we provide upper and lower bounds on the competitive ratio for the online graph coloring problem as a function of the parameters in this model. Both bounds are linear in [Formula: see text] and matching upper and lower bound are given for a specific set of algorithms that we call “minimalistic online algorithms”.

scholarly journals Online hypergraph coloring with rejection

2015 ◽  
Vol 7 (1) ◽  
pp. 5-17
Author(s):  
Csanád Imreh ◽  
Judit Nagy-György
Keyword(s):  
Online Algorithms ◽  
Competitive Ratio ◽  
Hypergraph Coloring ◽  
Coloring Problem ◽  
Trace Model ◽  
Total Penalty

Abstract In this paper we investigate the online hypergraph coloring problem with rejection, where the algorithm is allowed to reject a vertex instead of coloring it but each vertex has a penalty which has to be paid if it is not colored. The goal is to minimize the sum of the number of the used colors for the accepted vertices and the total penalty paid for the rejected ones. We study the online problem which means that the algorithm receives the vertices of the hypergraph in some order v1, . . . , vn and it must decide about vi by only looking at the subhypergraph Hi = (Vi, Ei) where Vi = {v1, . . . , vi} and Ei contains the edges of the hypergraph which are subsets of Vi. We consider two models: in the full edge model only the edges where each vertex is accepted must be well-colored, in the trace model the subsets of the edges formed by the accepted vertices must be well colored as well. We consider proper and conflict free colorings. We present in each cases optimal online algorithms in the sense that they achieve asymptotically the smallest possible competitive ratio.

scholarly journals Emotional Branding: emotions and feelings aroused by the design of the olfactory experience of consumption according to the ecosystem approach to communication.

2016 ◽  
Author(s):  
Sarah Batista
Keyword(s):  
Communication Complexity ◽  
Graduate Program ◽  
Ecosystem Approach ◽  
Theoretical Background ◽  
Point Of View ◽  
Consumer Experience ◽  
Systematic Observation ◽  
Systematic Analysis ◽  
Contact Points ◽  
Store Environment

This article discusses the recognition of semiotics experience and olfactory experienced by consumers in Farm brand’s physical store environment, so that it can be achieved the goal of conceptualizing the consumer olfactory design experience within the environment aroma of the brand from the semiotic point of view and the ecosystem approach to communication. In this sense, the theoretical background involves studying and researching of languages, representations and aesthetic communication from an ecosystem perspective, according to authors Monteiro (2011) and Pereira (2012), Peirce’s semiotics and the semiotics of culture, theory the affordances Gibson (1979) and Morin’s complex thought (2008). The developed research is qualitative, empirical and exploratory nature, it has having been used in its methodology techniques by Moraes and Mont'Alvão (2010) as a basis for modeling Farm brand’s communication ecosystem, as well as systematic observation Gil (2010) to collect data on the environment selected as analysis system target. The development of the research took place in the physical store of Farm brand, located in Shopping Manauara, placed in Manaus city, within the Graduate Program in Communication Sciences - PPGCCOM, from Federal University of Amazonas - UFAM. The main results can be mentioned the presentation of communication complexity of the brand studied through systematic analysis of their contact points and the subsequent location of the physical store environment and the aroma within this ecosystem, so that they can understand the process of management of intangible presence in the consumer experience organized with the aim and achieve the emotional and sensory consumer’s memory. DOI: http://dx.doi.org/10.4995/IFDP.2016.3270

scholarly journals Fleet management for autonomous vehicles: Online PDP under special constraints

2019 ◽  
Vol 53 (3) ◽  
pp. 1007-1031 ◽  
Author(s):  
Sahar Bsaybes ◽  
Alain Quilliot ◽  
Annegret K. Wagler
Keyword(s):  
Online Algorithms ◽  
Competitive Analysis ◽  
Autonomous Vehicles ◽  
Industrial Area ◽  
Point Of View ◽  
Fleet Management ◽  
Economic Point ◽  
Management Framework ◽  
Innovative Idea ◽  
Tour Length

The VIPAFLEET project consists in developing models and algorithms for managing a fleet of Individual Public Autonomous Vehicles (VIPA). Hereby, we consider a fleet of cars distributed at specified stations in an industrial area to supply internal transportation, where the cars can be used in different modes of circulation (tram mode, elevator mode, taxi mode). One goal is to develop and implement suitable algorithms for each mode in order to satisfy all the requests under an economic point of view by minimizing the total tour length. The innovative idea and challenge of the project is to develop and install a dynamic fleet management system that allows the operator to switch between the different modes within the different periods of the day according to the dynamic transportation demands of the users. We model the underlying online transportation system and propose a corresponding fleet management framework, to handle modes, demands and commands. We consider two modes of circulation, tram and elevator mode, propose for each mode appropriate online algorithms and evaluate their performance, both in terms of competitive analysis and practical behavior.

Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead

2019 ◽  
Vol 36 (05) ◽  
pp. 1950024
Author(s):  
Chengwen Jiao ◽  
Jinjiang Yuan ◽  
Qi Feng
Keyword(s):  
Online Algorithms ◽  
Competitive Ratio ◽  
Online Algorithm ◽  
Positive Root ◽  
Unit Length ◽  
Online Scheduling ◽  
Time Interval ◽  
Steady Growth ◽  
Scheduling Model

In this paper, we propose a new online scheduling model with linear lookahead intervals, which has the character that at any time [Formula: see text], one can foresee the jobs that will coming in the time interval [Formula: see text] in which [Formula: see text]. In this new lookahead model, the length of the lookahead intervals are variable as the time going on and the number of jobs increasing, and has the tend of steady growth. In this paper, we consider online scheduling of unit length jobs on [Formula: see text] identical parallel-batch machines under this new lookahead model to minimize makespan. The batch capacity is unbounded, that is [Formula: see text]. We present an optimal online algorithm for [Formula: see text], and provide a best possible online algorithm of competitive ratio [Formula: see text] for [Formula: see text], where [Formula: see text] is the positive root of [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document