The Analytic Hierarchy Process as an aid to decision makers has gained in popularity over the years. Recently the procedure has been generalised into the Interval Analytic Hierarchy Process. Rather than select a precise ratio for the comparisons between the alternatives offered to the decision maker an interval is proposed. One popular strategy in examining this problem is to adopt a simulation...

We report here a new staining procedure which uses both the enzymatic dehydrogenation of 2-(p-iodophenyl)-3-p-(nitrophenyl)-5 phenyltetrazolium chloride to a pink intracellular formazan and the DNA-specific fluorochrome 4',6'-diamidino-2-phenylindole. Application of this staining procedure to cells concentrated on filters and then transferred to microscope slides by the filter-transfer-freeze t...

Graph isomorphism problem is to determine whether two given graphs are isomorphic. It is a particular type of a more general problem “the isomorphism of incidence system”. I propose some new invariants for heuristic search of graph isomorphism and demonstrate that they are really useful in practice by experiments. Keyword. graph isomorphism, graph invariant, graph spectrum , adjacency matrix, m...

It is known that the tiling technique can be used to give simple proofs of unde-cidability of various two-dimensional modal and temporal logics. However, up until now, the simplest two-dimensional temporal logic, the compass logic of Venema, has eluded such treatment. We present a new coding of an enumeration of the tiling plane which enables us to show that the compass logic is undecidable.

In this paper, a discrete state transition algorithm is introduced to solve a multiobjective single machine job shop scheduling problem. In the proposed approach, a non-dominated sort technique is used to select the best from a candidate state set, and a Pareto archived strategy is adopted to keep all the non-dominated solutions. Compared with the enumeration and other heuristics, experimental ...

summing the Boltzmann factor over all spin configurations {si}. The enumeration of all configurations cannot be done for d ≥ 3, and although possible in d = 2 is extremely hard there as well (a problem solved by Onsager). We will use an approximate solution technique known as mean field theory. Last term we solved the problem of noninteracting spins in a magnetic field described by the Hamilton...

This paper offers numerical evidence for a conjecture that primality proving may be done in (logN) operations by examining the growth rate of quantities known as pseudosquares and pseudocubes. In the process, a novel method of solving simultaneous congruences— doubly-focused enumeration— is examined. This technique, first described by D. J. Bernstein, allowed us to obtain record-setting sieve c...

Describes a decade of experience threat modeling products and services at Microsoft. Describes the current threat modeling methodology used in the Security Development Lifecycle. The methodology is a practical approach, usable by non-experts, centered on data flow diagrams and a threat enumeration technique of ‘STRIDE per element.’ The paper covers some lessons learned which are likely applicab...

A procedure was developed for immobilization of Listeria monocytogenes cells on metal hydroxides coupled with detection and enumeration using an automated optical system. The results of the immobilization procedure (<1 h) and detection during overnight incubation agreed with calculated plate counts, and this technique is simple and rapid and provides samples that are ready for confirmation of t...

Schützenberger’s theorem for the ordinary RSK correspondence naturally extends to Chen et. al’s correspondence for matchings and partitions. Thus the counting of bilaterally symmetric k-noncrossing partitions naturally arises as an analogue for involutions. In obtaining the analogous result for 3-noncrossing partitions, we use a different technique to develop a MAPLE package for 2-dimensional v...