scholarly journals Space Efficient String Mining under Frequency Constraints

2008 ◽  
Author(s):  
Johannes Fischer ◽  
Veli Mäkinen ◽  
Niki Välimäki
Keyword(s):  
Frequency Constraints ◽  
String Mining

An enhanced symbiotic organisms search algorithm for design optimization of trusses with frequency constraints

2021 ◽  
pp. 136943322110262
Author(s):  
Mohammad H Makiabadi ◽  
Mahmoud R Maheri
Keyword(s):  
Standard Deviation ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Metaheuristic Algorithms ◽  
Minimum Mass ◽  
Multiple Frequency ◽  
Frequency Constraints ◽  
Symbiotic Organisms Search ◽  
Symbiotic Organisms ◽  
Dynamic Frequency

An enhanced symbiotic organisms search (ESOS) algorithm is developed and presented. Modifications to the basic symbiotic organisms search algorithm are carried out in all three phases of the algorithm with the aim of balancing the exploitation and exploration capabilities of the algorithm. To verify validity and capability of the ESOS algorithm in solving general optimization problems, the CEC2014 set of 22 benchmark functions is first optimized and the results are compared with other metaheuristic algorithms. The ESOS algorithm is then used to optimize the sizing and shape of five benchmark trusses with multiple frequency constraints. The best (minimum) mass, mean mass, standard deviation of the mass, total number of function evaluations, and the values of frequency constraints are then compared with those of a number of other metaheuristic solutions available in the literature. It is shown that the proposed ESOS algorithm is generally more efficient in optimizing the shape and sizing of trusses with dynamic frequency constraints compared to other reported metaheuristic algorithms, including the basic symbiotic organisms search and its other recently proposed improved variants such as the improved symbiotic organisms search algorithm (ISOS) and modified symbiotic organisms search algorithm (MSOS).

scholarly journals PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA

2007 ◽  
Vol 18 (04) ◽  
pp. 799-811
Author(s):  
MATHIEU GIRAUD ◽  
PHILLIPE VEBER ◽  
DOMINIQUE LAVENIER
Keyword(s):  
Surface Area ◽  
Finite Automata ◽  
Clock Frequency ◽  
Partial Removal ◽  
Frequency Constraints ◽  
Weighted Automata ◽  
Weighted Finite Automata ◽  
Special Case

Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints, requiring efficient ∊-transitions-removal techniques. In this paper, we present bounds on the number of new transitions for the development of acyclic WFA, which is a special case of the ∊-transitions-removal problem. We introduce a new problem, a partial removal of ∊-transitions while accepting short chains of ∊-transitions.

Sign in / Sign up

Export Citation Format

Share Document