scholarly journals Q-Learnheuristics: Towards Data-Driven Balanced Metaheuristics

Mathematics ◽  
2021 ◽  
Vol 9 (16) ◽  
pp. 1839
Author(s):  
Broderick Crawford ◽  
Ricardo Soto ◽  
José Lemus-Romani ◽  
Marcelo Becerra-Rozas ◽  
José M. Lanza-Gutiérrez ◽  
...  
Keyword(s):  
Combinatorial Problems ◽  
Set Covering ◽  
Covering Problem ◽  
Integration Framework ◽  
Q Learning ◽  
Whale Optimization ◽  
Sine Cosine Algorithm ◽  
Exploration Exploitation ◽  
Selection Of

One of the central issues that must be resolved for a metaheuristic optimization process to work well is the dilemma of the balance between exploration and exploitation. The metaheuristics (MH) that achieved this balance can be called balanced MH, where a Q-Learning (QL) integration framework was proposed for the selection of metaheuristic operators conducive to this balance, particularly the selection of binarization schemes when a continuous metaheuristic solves binary combinatorial problems. In this work the use of this framework is extended to other recent metaheuristics, demonstrating that the integration of QL in the selection of operators improves the exploration-exploitation balance. Specifically, the Whale Optimization Algorithm and the Sine-Cosine Algorithm are tested by solving the Set Covering Problem, showing statistical improvements in this balance and in the quality of the solutions.

scholarly journals Large Linguistic Corpus Reduction with SCP Algorithms

2015 ◽  
Vol 41 (3) ◽  
pp. 355-383 ◽  
Author(s):  
Nelly Barbot ◽  
Olivier Boëffard ◽  
Jonathan Chevelu ◽  
Arnaud Delhay
Keyword(s):  
Lower Bound ◽  
Set Covering ◽  
Covering Problem ◽  
Huge Amount ◽  
Text Corpora ◽  
Corpus Design ◽  
Text Content ◽  
The Cost ◽  
Greedy Solution

Linguistic corpus design is a critical concern for building rich annotated corpora useful in different domains of applications. For example, speech technologies such as ASR (Automatic Speech Recognition) or TTS (Text-to-Speech) need a huge amount of speech data to train data-driven models or to produce synthetic speech. Collecting data is always related to costs (recording speech, verifying annotations, etc.), and as a rule of thumb, the more data you gather, the more costly your application will be. Within this context, we present in this article solutions to reduce the amount of linguistic text content while maintaining a sufficient level of linguistic richness required by a model or an application. This problem can be formalized as a Set Covering Problem (SCP) and we evaluate two algorithmic heuristics applied to design large text corpora in English and French for covering phonological information or POS labels. The first considered algorithm is a standard greedy solution with an agglomerative/spitting strategy and we propose a second algorithm based on Lagrangian relaxation. The latter approach provides a lower bound to the cost of each covering solution. This lower bound can be used as a metric to evaluate the quality of a reduced corpus whatever the algorithm applied. Experiments show that a suboptimal algorithm like a greedy algorithm achieves good results; the cost of its solutions is not so far from the lower bound (about 4.35% for 3-phoneme coverings). Usually, constraints in SCP are binary; we proposed here a generalization where the constraints on each covering feature can be multi-valued.

Automating the Appending of Image Information to Grid Map Corresponding to Object Shape

2017 ◽  
Vol 29 (4) ◽  
pp. 713-719
Author(s):  
Tomohito Takubo ◽  
◽  
Hironobu Takaishi ◽  
Atsushi Ueno
Keyword(s):  
Optimization Method ◽  
Mapping Method ◽  
Set Covering ◽  
Covering Problem ◽  
Inspection System ◽  
Object Surface ◽  
Object Shape ◽  
Image Information ◽  
Grid Map ◽  
Selection Of

A technique for automating the Image-Information-Added Map, a mapping method for photographing an object at a required resolution, is proposed. The picture shooting vector indicating the angle for taking a picture with sufficient resolution is defined according to the shape of the object surface, and the operator controls a robot remotely to acquire pictures by checking the picture shooting vector in our previous study. For an automated inspection system, image acquisition should be automated. Assuming a 2-D grid map is prepared, first, the shooting vectors are set on the surface of the object in the map, and the picture shooting areas are defined. In order to reduce the number of the points that the mobile robot moves to to take pictures, an overlapping picture shooting area should be selected. As the selection of the points where pictures are taken is a set covering problem, the ant colony optimization method is used to solve it. Edge Exchange Crossover (EXX) is used to select picture taking points that are connected for efficient checking. The proposed method is implemented in a robot and evaluated according to the resolution of the collected images in an experimental environment.

scholarly journals A Db-Scan Binarization Algorithm Applied to Matrix Covering Problems

2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
José García ◽  
Paola Moraga ◽  
Matias Valenzuela ◽  
Broderick Crawford ◽  
Ricardo Soto ◽  
...  
Keyword(s):  
Transfer Functions ◽  
Optimization Problems ◽  
Metaheuristic Algorithms ◽  
Set Covering ◽  
Covering Problem ◽  
Random Operators ◽  
Combinatorial Optimization Problems ◽  
Hybrid Techniques ◽  
Area Of Interest

The integration of machine learning techniques and metaheuristic algorithms is an area of interest due to the great potential for applications. In particular, using these hybrid techniques to solve combinatorial optimization problems (COPs) to improve the quality of the solutions and convergence times is of great interest in operations research. In this article, the db-scan unsupervised learning technique is explored with the goal of using it in the binarization process of continuous swarm intelligence metaheuristic algorithms. The contribution of the db-scan operator to the binarization process is analyzed systematically through the design of random operators. Additionally, the behavior of this algorithm is studied and compared with other binarization methods based on clusters and transfer functions (TFs). To verify the results, the well-known set covering problem is addressed, and a real-world problem is solved. The results show that the integration of the db-scan technique produces consistently better results in terms of computation time and quality of the solutions when compared with TFs and random operators. Furthermore, when it is compared with other clustering techniques, we see that it achieves significantly improved convergence times.

ON THE EXPERT’S RIGHT TO BE PRESENT AT LEGAL PROCEEDINGS

2016 ◽  
Vol 15 ◽  
pp. 163-171
Author(s):  
M. G. Shcherbakovskiy
Keyword(s):  
Initial Data ◽  
Legal Proceedings ◽  
Reliable Assessment ◽  
Data Acquiring ◽  
Selection Of

The article discusses the reasonsfor an expert to participate in legal proceedings. The gnoseological reason for that consists of the bad quality of materials subject to examination that renders the examination either completely impossible or compromises objective, reasoned and reliable assessment of the findings. The procedural reason consists ofa proscription for an expert to collect evidence himself or herself. The author investigates into the ways of how an expert can participate in legal proceedings. If the defense invites an expert to participate in the proceedings, then it is recommended that his or her involvement should be in the presence of attesting witnesses and recorded in the protocol. In the course of the legal proceedings an expert has the following tasks: adding initial data, acquiring new initial data, understanding the situation of the incident, acquiring new objects to be studied, including samples for examination. An expert’s participation in legal proceedings differs from the participation of a specialist or an examination on the scene of the incident. The author describes the tasks that an expert solves in the course of legal proceedings, the peculiarities ofan investigation experiment practices, the selection of samples for an examination, inspection, interrogation.

Implementasi Voip Server Berbasis IPV6 Dengan Raspberry PI

2019 ◽  
Vol 9 (01) ◽  
pp. 47-54
Author(s):  
Rabbai San Arif ◽  
Yuli Fitrisia ◽  
Agus Urip Ari Wibowo
Keyword(s):  
Internet Protocol ◽  
Wireless Transmission ◽  
Raspberry Pi ◽  
Test Results ◽  
Average Delay ◽  
Ipv6 Network ◽  
Ip Network ◽  
Selection Of ◽  
Better Than

Voice over Internet Protocol (VoIP) is a telecommunications technology that is able to pass the communication service in Internet Protocol networks so as to allow communicating between users in an IP network. However VoIP technology still has weakness in the Quality of Service (QoS). VOPI weaknesses is affected by the selection of the physical servers used. In this research, VoIP is configured on Linux operating system with Asterisk as VoIP application server and integrated on a Raspberry Pi by using wired and wireless network as the transmission medium. Because of depletion of IPv4 capacity that can be used on the network, it needs to be applied to VoIP system using the IPv6 network protocol with supports devices. The test results by using a wired transmission medium that has obtained are the average delay is 117.851 ms, jitter is 5.796 ms, packet loss is 0.38%, throughput is 962.861 kbps, 8.33% of CPU usage and 59.33% of memory usage. The analysis shows that the wired transmission media is better than the wireless transmission media and wireless-wired.

DESIGN, SIMULATION AND IMPLEMENTATION MONITORING SYSTEM FOR SYSTEM CONTROL C4 FEEDING PUMP FOR FEED VAPORIZATION IN THE BUTADIENE PLANT

2020 ◽  
Vol 1 (1) ◽  
pp. 31-35
Author(s):  
Fahmi Yunistyawan ◽  
Yunistyawan J Berchmans ◽  
Gembong Baskoro
Keyword(s):  
Motor Control ◽  
Control System ◽  
Field Operator ◽  
System Control ◽  
Variable Speed ◽  
Variable Speed Drive ◽  
Software And Hardware ◽  
Discharge Pressure ◽  
Selection Of

This study implements the auto start control system on an electric motor 3 phase C4Feeding pump when the discharge pressure is low-low (4.3 kg /cm²). The C4 feeding pumpmotor was initially manually operated from the local control station, this was very ineffectiveand inefficient because it still relied on the field operator to operate the pump motor and whenthe plant was in normal operating it is very risk if the field operator late to operate motor then itwill impact to quality of the product, and if the delay time to operate motor is too long then planthave to shut down, therefore improvement is needed in the C4 feeding pump motor controlsystem. In this paper, various types of 3-phase motor control are explained which allow it to beapplied to the C4 feeding pump motor that are on-off, inverter, and variable speed drive andefficient selection of the three systems control of the motor. Software and hardware used in thisthesis work are DCS CENTUM VP Yokogawa.

Thomas More’s Correspondence in a Spanish Ambiance

Moreana ◽  
2002 ◽  
Vol 39 (Number 149) (1) ◽  
pp. 41-60 ◽  
Author(s):  
Eugenio M. Olivares Merino
Keyword(s):  
The Subject ◽  
Selection Of

The recent reprinting of Álvaro de Silva’s 1998 edition of a selection of More’s letters prompts the author to examine the subject of Spanish translations of More, and of de Silva’s general commentary on More’s correspondence and on his relationship to other humanists. The author reflects on aspects of More’s personality as exposed in his letters and uses what he finds as a corrective to several biographical misconceptions. He points out the strengths and weaknesses of de Silva’s work and compares it with that of other translators, particularly Elizabeth Rogers, and notes the particularly Spanish quality of de Silva’s edition.

COMBINATORIAL POLYNOMIALLY COMPUTABLE CHARACTERISTICS OF SUBSTITUTIONS AND THEIR PROPERTIES

2020 ◽  
Vol 7 (2) ◽  
pp. 34-41
Author(s):  
VLADIMIR NIKONOV ◽  
◽  
ANTON ZOBOV ◽  
Keyword(s):  
Mathematical Expectation ◽  
Point Of View ◽  
Small Range ◽  
Computational Point ◽  
Wide Range ◽  
Bijective Function ◽  
The Difference ◽  
Element Base ◽  
Selection Of

The construction and selection of a suitable bijective function, that is, substitution, is now becoming an important applied task, particularly for building block encryption systems. Many articles have suggested using different approaches to determining the quality of substitution, but most of them are highly computationally complex. The solution of this problem will significantly expand the range of methods for constructing and analyzing scheme in information protection systems. The purpose of research is to find easily measurable characteristics of substitutions, allowing to evaluate their quality, and also measures of the proximity of a particular substitutions to a random one, or its distance from it. For this purpose, several characteristics were proposed in this work: difference and polynomial, and their mathematical expectation was found, as well as variance for the difference characteristic. This allows us to make a conclusion about its quality by comparing the result of calculating the characteristic for a particular substitution with the calculated mathematical expectation. From a computational point of view, the thesises of the article are of exceptional interest due to the simplicity of the algorithm for quantifying the quality of bijective function substitutions. By its nature, the operation of calculating the difference characteristic carries out a simple summation of integer terms in a fixed and small range. Such an operation, both in the modern and in the prospective element base, is embedded in the logic of a wide range of functional elements, especially when implementing computational actions in the optical range, or on other carriers related to the field of nanotechnology.

Sign in / Sign up

Export Citation Format

Share Document