Numerical analysis for factorial data analysis. Part I: Numerical software — the package INDA for microcomputers

A large collection of factorial data analysis methods can be characterized by the following matrices: X , the k x n matrix of data, and A, B the symmetric positive definite matrices of size n, k which represent the chosen norms of ?ⁿ, ?^k, respectively. All methods amount to computing the largest eigenvalues of U = XAX^TB or the largest singular values of E = B^1/2XA^1/2 . In Part I of this paper we begin by a geometrical and probabilistic interpretation of the various methods, showing how U and E are defined in each case. We then define the computational kernel for factorial data analysis. We conclude by devising the numerical aspects of software implementation for this kernel on microcomputers and presenting the package INDA.     

Antiviral activity of some Tunisian medicinal plants against Herpes simplex virus type 1

Fifteen species of Tunisian traditional medicinal plants, belonging to 10 families, were selected for this study. They were Inula viscosa (L.) Ait and Reichardia tingitana (L.) Roth ssp. discolor (Pom.) Batt. (Asteraceae), Mesembryanthemum cristallinum L. and M. nodiflorum L. (Aizoaceae), Arthrocnemum indicum (Willd.) Moq., Atriplex inflata Muell., A. parvifolia Lowe var. ifiniensis (Caball) Maire, and Salicornia fruticosa L. (Chenopodiaceae), Cistus monspeliensis L. (Cistaceae), Juniperus phoenicea L. (Cupressaceae), Erica multiflora L. (Ericaceae), Frankenia pulverulenta L. (Frankeniaceae), Hypericum crispum L. (Hypericaceae), Plantago coronopus L. ssp. eu-coronopus Pilger var. vulgaris G.G. (Plantaginaceae) and Zygophyllum album L. (Zygophyllaceae). Fifty extracts prepared from those plants were screened in order to assay their antiviral activity against Herpes simplex virus type 1 (HSV-1), using neutral red incorporation. Extracts from eight plants among these 15 showed some degree of antiviral activity, while the methanolic extract of E. multiflora was highly active with EC(50) of 132.6 microg mL(-1). These results corroborate that medicinal plants from Tunisia can be a rich source of potential antiviral compounds.     

Submaximal and door compactifications

In this paper, a characterization is given for compact door spaces. We, also, deal with spaces X such that a compactification K(X) of X is submaximal or door.Let X be a topological space and K(X) be a compactification of X.We prove, here, that K(X) is submaximal if and only if for each dense subset D of X, the following properties hold:

(i)

D is co-finite in K(X);

(ii)

for each x∈K(X)?D, {x} is closed.

If X is a noncompact space, then we show that K(X) is a door space if and only if X is a discrete space and K(X) is the one-point compactification of X.     

Surface characteristics analysis of nitrocarburized (Tenifer) and carbonitrided industrial steel AISI 02 types

Generally, tool steels for cold work are obtained by rolling and forging processes. They are treated to have a structure conferring to the material a high toughness limit in terms of wear resistance and endurance. The objective of this study is the thermochemical heat treatment of industrial steel blades made of AISI 02 types, intended for polymer crushing. The effects of nitrocarburizing (Tenifer) and gaseous carbonitriding processes on surface characteristics are considered. These surface treatments increase the usefulness of properties, that is, fatigue strength, wear and corrosion resistance of this microalloyed steel. The influence of treatment duration and the thickness of the layers on surface properties are investigated. The analysis and characterization are carried out using physical analysis [optical microscopy, scanning electron microscopy, X‐ray diffraction and glow discharge optical emission spectroscopy (GDOES) techniques] and mechanical measurements (microhardness, weight loss and residual stresses) of treated material. The results are intended to contribute in defining and optimizing the adequate choice of treatments for this type of steel in industrial conditions. Copyright © 2008 John Wiley & Sons, Ltd.     

Incorporating the Decision-maker's Preferences in the Goal-programming Model

Many algorithms have been developed for multiple-criteria decision-making problems. Goal programming (GP) is one of these algorithms. This model is a special extension of linear programming. Usually, it is not easy for the decision-maker to choose his aspiration levels a priori. Moreover, the incommensurability of the measurement units of the various objectives creates an aggregation problem. However, in the standard GP formulation, the decision-maker is not required to arbitrate among conflicting objectives. To deal with these difficulties, we explicitly introduce the structure of the decision-maker's preferences into the GP model in order to evaluate the impact of deviations from the decision-maker's aspirations levels. Easily and naturally, the idea of a generalized criterion, as introduced in the Promethee outranking method, will be used to build this structure of preferences.     

Quality control system design through the goal programming model and the satisfaction functions

The goal programming (GP) model has been utilized for designing a quality control system (QCS) where several features are simultaneously considered. In the context of the quality control, the parameters can be imprecise and expressed through intervals. The aim of this paper is to propose two formulations for designing a QCS based on the imprecise GP model. The concept of satisfaction functions will be utilized to integrate explicitly the decision-maker’s preference. The developed formulations are illustrated through an example of a paper factory.     

Scheduling batches in flowshop with limited buffers in the shampoo industry

In this paper we address the problem of planning a temporary storage area in a real production system. This temporary storage area is composed of parallel temporary storage units with distinct capacities. The storage operation of a job, also called a batch, has to answer time restrictions such as release dates, due dates, restricted family dependent setup times and time lags, and also a space constraint which is the capacity of the temporary storage unit. The goal is to schedule the batches on the storage units in order to minimize the total setup times and the maximum lateness. First, we model the problem on a single storage unit as a two-machine flowshop problem with a limited buffer capacity and we show that it is NP-hard. We also show that the particular case in which no lateness is allowed is solvable in polynomial time under special conditions on the buffer capacity, both for single or parallel temporary storage units. Next we provide three heuristics: a greedy algorithm, a hybrid heuristic based on Ant Colony Optimization and Simulated Annealing and finally a dedicated heuristic. The latter strongly exploits the structural properties shown in this paper. We provide experimental results which highlight the efficiency of the dedicated heuristic in comparison with the two other heuristics.     

Antibacterial, antifungal and cytotoxic activities of two flavonoids from Retama raetam flowers

We have investigated the antibacterial, antifungal and cytotoxic activities of two flavonoids isolated from Retama raetam flowers using the disc diffusion and micro-dilution broth methods. The cytotoxic activity was tested against Hep-2 cells using the MTT assay. The compounds licoflavone C (1) and derrone (2) were active against Pseudomonas aeruginosa and Escherichia coli (7.81-15.62 μg/mL) and showed important antifungal activity. Strong antifungal activity against Candida species (7.81 μg/mL) was for example found with compound 2. The tested compounds also showed strong cytotoxicity against Hep-2 cells. These two compounds may be interesting antimicrobial agents to be used against infectious diseases caused by many pathogens.     

H-spectral spaces

Let X be a T₀-space, we say that X is H-spectral if its T₀-compactification is spectral. This paper deal with topological properties of H-spectral spaces. In the case of T₁-spaces the T₀-compactification coincides with the Wallman compactification. We give necessary and sufficient condition on the T₁-space X in order to get its Wallman compactification spectral.     

Serial correlation estimation through the imprecise Goal Programming model

The Goal Programming (GP) model was used as a time-series analysis tool that incorporates a Serial Correlation where the dependent variable is considered as precise. This formulation does not take into consideration the decision-maker’s preferences. However, the dependent variable can be imprecise and its value can be expressed through an interval. The aim of this paper is to develop a new formulation of the GP model for regression with Serial Correlation where the dependent variable is imprecise. The proposed model will also integrate explicitly the decision-maker’s preferences. A numerical example was used to illustrate our model.