Food bought at supermarkets in, for instance, North America or the European Union, give comprehensive information about ingredients and allergens. Meanwhile, the menus of restaurants are usually incomplete and cannot be ...

Let us consider the following types of improper integrals: $$ \int_0^\infty f(t)\:{\rm d}t \qquad ; \qquad \int_{-\infty}^0 f(t)\:{\rm d}t \qquad {\rm and} \qquad \int_{-\infty}^\infty f(t)\:{\rm d}t $$ \medskip Let ...

People have many constraints concerning the food they eat. These constraints can be based on religious believes, be due to food allergies or to illnesses, or can be derived just from personal preferences. Therefore, ...

There are diferent applications in Engineering that require to compute improper integrals of the first kind (integrals defined on an unbounded domain) such as: the work required to move an object from the surface of the ...

Traffic simulations usually require the search of a path to join two different points. Dijkstra’s algorithm [1] is one of the most commonly used for this task due to its easiness and quickness. In [2, 3] we developed an ...

In many Engineering applications the computation of improper integrals is a need. In [1] we pointed out the lack of some CAS when computing some types of improper integrals. Even more, the work developed showed that some ...

Simulations are nowadays a very important way of analyzing new improvements in different areas before the physical implementation, which may require hard resources which could only be affronted in case of a high probability ...

This paper discusses a discrete-time queueing system in which an arriving customer may adopt four di erent strategies depending on the income information, two of them correspond to a LCFS discipline where displacements ...

El cáncer es una de las principales causas de muerte a nivel mundial. Este término abarca más de doscientos tipos de enfermedades, las cuales se caracterizan por un crecimiento descontrolado de las células y la posible ...

Dijkstra's algorithm is one of the most well known algorithm to solve the shortest path problem (SPP). When applied to real situations, although the shortest path can be computed with Dijkstra's algorithm, it is not always ...