Journal of Applied Logic最新文献

The standard rule of single privative modification replaces privative modifiers by Boolean negation. This rule is valid, for sure, but also simplistic. If an individual a instantiates the privatively modified property (MF) then it is true that a instantiates the property of not being an F, but the rule fails to express the fact that the properties (MF) and F have something in common. We replace Boolean negation by property negation, enabling us to operate on contrary rather than contradictory properties. To this end, we apply our theory of intensional essentialism, which operates on properties (intensions) rather than their extensions. We argue that each property F is necessarily associated with an essence, which is the set of the so-called requisites of F that jointly define F. Privation deprives F of some but not all of its requisites, replacing them by their contradictories. We show that properties formed from iterated privatives, such as being an imaginary fake banknote, give rise to a trifurcation of cases between returning to the original root property or to a property contrary to it or being semantically undecidable for want of further information. In order to determine which of the three forks the bearers of particular instances of multiply modified properties land upon we must examine the requisites, both of unmodified and modified properties. Requisites underpin our presuppositional theory of positive predication. Whereas privation is about being deprived of certain properties, the assignment of requisites to properties makes positive predication possible, which is the predication of properties the bearers must have because they have a certain property formed by means of privation.

This paper presents two major aspects of Frege's and Peirce's views on assertion and denial: first, their arguments for the notational choices concerning the representation of assertion and denial in Begriffsschrift (BS) and Existential Graphs (EGs), respectively; and second, those properties of BS and EGs which reflect their inventors' views on assertion and denial. We show that while Frege's notation has an ad hoc sign of assertion and an ad hoc sign of negation, Peirce has a sign of assertion which is also a sign of logical conjunction, and a sign of scope which is also a sign of negation.

Anomaly detection has to do with finding patterns in data that do not conform to an expected behavior. It has recently attracted the attention of the research community because of its real-world application. The correct detection unusual events empower the decision maker with the capacity to act on the system in order to correctly avoid, correct, or react to the situations associated with them. Petroleum industry is one of such real-world application scenarios. In particular, heavy extraction machines for pumping and generation operations like turbomachines are intensively monitored by hundreds of sensors each that send measurements with a high frequency for damage prevention. For dealing with this and with the lack of labeled data, in this paper we describe a combination of a fast and high quality segmentation algorithm with a one-class support vector machine approach for efficient anomaly detection in turbomachines. As a result we perform empirical studies comparing our approach to another using Kalman filters in a real-life application related to oil platform turbomachinery anomaly detection.

Double-row tapered roller bearings (TRBs) are mechanical devices designed to support a combination of preload, radial load, axial load and torque. They are widely used in vehicles for high load and moderate rotation speeds. This combination of loads produces high contact stresses on the bearing raceways that are difficult to calculate, and can cause undesirable defects like fatigue spalling and pitting. In recent decades, the Finite Element Method (FEM) has been used to obtain the distribution of the contact stresses on each of the raceways, although this method has the disadvantage of a high computational cost. The myriad of possible combinations of input loads on the TRB (preload, radial load, axial load and torque) makes it much harder to calculate the distribution of these contact stresses. This paper proposes a methodology that combines the FEM and data mining techniques to determine the maximum load capacity in TRBs. First, a three-dimensional finite element (FE) model was generated according to the real materials' properties, geometry and coefficients of friction of all parts that make up the double-row TRB. Subsequently, a Design of Experiment (DoE) was completed that considered a combination of the mentioned input loads, which were simulated in the FE model. Based on the contact stresses obtained from the FE simulations, a group of regression models – linear regression (LR), Gaussian processes (GP), artificial neural networks (ANN), support vector machines (SVM) and regression trees (RT) – were built to predict the contact stresses ratios that act on each of the row of rollers in the outer raceway of the TRB. Finally, the best combination of input loads was achieved by applying evolutionary optimization techniques based on genetic algorithms (GA) to the best regression models previously obtained. The maximum load capacity of the TRB was achieved when the radial load obtained was a maximum, while the stresses ratios of the two contacts in the outer raceway of the TRB were close to 25%.

The number of endangered species has been increased due to shifts in the agricultural production, climate change, and poor urban planning. This has led to investigating new methods to address the problem of plant species identification/classification. In this paper, a plant identification approach using 2D digital leaves images was proposed. The approach used two features extraction methods based on one-dimensional (1D) and two-dimensional (2D) and the Bagging classifier. For the 1D-based methods, Principal Component Analysis (PCA), Direct Linear Discriminant Analysis (DLDA), and PCA + LDA techniques were applied, while 2DPCA and 2DLDA algorithms were used for the 2D-based method. To classify the extracted features in both methods, the Bagging classifier, with the decision tree as a weak learner was used. The five variants, i.e. PCA, PCA + LDA, DLDA, 2DPCA, and 2DLDA, of the approach were tested using the Flavia public dataset which consists of 1907 colored leaves images. The accuracy of these variants was evaluated and the results showed that the 2DPCA and 2DLDA methods were much better than using the PCA, PCA + LDA, and DLDA. Furthermore, it was found that the 2DLDA method was the best one and the increase of the weak learners of the Bagging classifier yielded a better classification accuracy. Also, a comparison with the most related work showed that our approach achieved better accuracy under the same dataset and same experimental setup.

Thorough studies of technological and biological systems have revealed that the inherent networking structures of those systems possess similar topological properties, like node degree distribution or small-world effect, regardless of the context to which those systems are related. Based on that knowledge, there have been numerous attempts to develop models that capture particular topological properties of observed complex networks, although little attention has been paid to developing models with specific functional properties. The present paper proposes a method for the simulation of networks' structures with functional characteristics of interest using a heuristic evolutionary approach and utilizing a Simulated Annealing algorithm. An experimental study is carried out with a US air transportation network and synthetic social networks with known properties.

The integration of the different processes and players that compose the supply chain (SC) is essential to obtain a better coordination level. Inventory control and distribution management are the two processes that researchers have identified as the key to gain or lose in efficiency and effectiveness in the field of logistics, with a direct effect on the synchronization and overall performance of SCs. In practical situations demand is often not deterministic, and lead times are also variable, yielding a complex stochastic problem. In order to analyze the recent developments in the integration of these processes, this paper analyzes the state of the art of the information management in the SC, the relationship between inventory policies and available demand information, and the use of optimization methods to provide good solutions for the problem in single and multi depot versions.

The optimal workflow scheduling is one of the most important issues in heterogeneous distributed computational environments. Existing heuristic and evolutionary scheduling algorithms have their advantages and disadvantages. In this work we propose a hybrid algorithm based on heuristic methods and genetic algorithm (GA) that combines best characteristics of both approaches. We propose heuristic algorithm called Linewise Earliest Finish Time (LEFT) as an alternative for HEFT in initial population generation for GA. We also experimentally show efficiency of described hybrid schemas GAHEFT, GALEFT, GACH for traditional workflow scheduling as well as for variable workload in dynamically changing heterogeneous computational environment.

The process description languages, which are used in business, may be useful in logistics processes. The planning, organisation, direction and the control of the logistics processes might be more efficient if these formal languages are applied. During the logistics processes, many problems might arise, which should have already been addressed in the planning phase. In our days, the symptomatic treatment is a common practice, but it does not provide predictability. The obvious solution would be process control, in order to handle the main sources of faults and to give a correct list of what needs to be done during the logistics process. The process description languages may be useful not only in standardisation, but they may also help to avoid losses. Simulation experiments, on the basis of built model, also allow for the elimination of problems, standardisation and the limitation of losses. The aim of the article is a discussion of selected coordination mechanisms in the supply chain, its modelling in the form of a reference, as well as a discussion of the simulation experiment with the use of the FlexSim tool.