Wherein is the concept of disease normative? From weak normativity to value-conscious naturalism

In this paper we focus on some new normativist positions and compare them with traditional ones. In so doing, we claim that if normative judgments are involved in determining whether a condition is a disease only in the sense identified by new normativisms, then disease is normative only in a weak sense, which must be distinguished from the strong sense advocated by traditional normativisms. Specifically, we argue that weak and strong normativity are different to the point that one ‘normativist’ label ceases to be appropriate for the whole range of positions. If values and norms are not explicit components of the concept of disease, but only intervene in other explanatory roles, then the concept of disease is no more value-laden than many other scientific concepts, or even any other scientific concept. We call the newly identified position “value-conscious naturalism” about disease, and point to some of its theoretical and practical advantages.

A Decomposability Property to the Weighted Myerson Value and the Weighted Position Value

Myerson value and position value are important values in a cooperative game with a graph structure. Usually, due to the differences of players in the game, the weighted Myerson value and weighted position value are more widely used in practical situations. This article offers a new calculation approach of the weighted Myerson value and weighted position value. Instead of using induced games (point game and edge game), we prove that the weighted Myerson value and weighted position value meet decomposability property.

A Revision of Kola Babarinde's Stance on Value Statements In Education

The place of value statements in education cannot be undermined and should consequently not be overemphasized. Value statements have been characterized to be part of most educational discussions and writings, however, its centrality should not be hindered (rather worked on) as conceived and supported by some philosophers, as against the logical positivists or empiricists who considered it to be a mere expression of thoughts. As the popular saying is, when the purpose of a thing is not known, abuse becomes inevitable; this paper seeks a revision of Kola Babarinde’s stance on value statements in education, and further emphasizes the position value plays in the contemporary schools.

Un Squirrel Search Algorithm discreto aplicado al problema Job Shop con operadores calificados

Introducción: El problema Job Shop Con Operadores Calificados o Job Shop With Skilled Operators (JSSO) es una extensión del problema clásico Job Shop en el cual, una operación debe ser ejecutada por un conjunto limitados de trabajadores, con el objetivo de minimizar el tiempo de terminación total de los trabajos o Makespan, situación que puede representar distintas aplicaciones en la vida cotidiana. Es un problema complejo y es catalogado como NP-HARD. Objetivo: En este artículo, se aborda el problema JSSO desde la adaptación de un algoritmo conocido como Squirrel Search Algorithm (SSA). Metodología: Se propone un esquema de codificación discreto para el algoritmo SSA utilizando el método Smallest Position Value (SPV). Además, para evitar soluciones que violen las relaciones de precedencia; se corrigen con el método Valid Particle Generator (VPG), el cual garantiza soluciones factibles. Dos versiones del algoritmo se colocan a prueba en 28 instancias propuesta en la literatura para validar su rendimiento. Resultados: Los experimentos computacionales realizados muestran que los dos algoritmos propuestos alcanzan soluciones óptimas en 25 de las 28 instancias analizadas. Además, para las instancias en donde no se logró soluciones óptimas, el gap promedio no supera el 2% para ambas versiones de los algoritmos propuestos. Conclusiones: El esquema de codificación propuesto garantiza la discretización del algoritmo, generando soluciones que convergen hacia el óptimo. Además, la codificación propuesta, permite utilizar de manera natural los operadores de movimiento propuestos originalmente para el algoritmo utilizado. El rendimiento obtenido por los algoritmos es adecuado y de alta calidad.