Оценка времени на прогнозирование технического состояния средств аппаратного контроля

Предлагается метод повышения достоверности функционирования ЭВМ АСУ в условиях воздействия мощных электромагнитных помех (МЭМП), приводятся оценки допустимого времени на прогнозирование технического состояния средств аппаратного контроля (АК) после воздействия мощных электромагнитных помех

An algorithm for a super-stable roommates problem

In this paper, we describe an efficient algorithm that decides if a stable matching exists for a generalized stable roommates problem, where, instead of linear preferences, agents have partial preference orders on potential partners. Furthermore, we may forbid certain partnerships, that is, we are looking for a matching such that none of the matched pairs is forbidden, and yet, no blocking pair (forbidden or not) exists. To solve the above problem, we generalize the first algorithm for the ordinary stable roommates problem

The stable marriage problem with master preference lists

We study variants of the classical stable marriage problem in which the preferences of the men or the women, or both, are derived from a master preference list. This models real-world matching problems in which participants are ranked according to some objective criteria. The master list(s) may be strictly ordered, or may include ties, and the lists of individuals may involve ties and may include all, or just some, of the members of the opposite sex. In fact, ties are almost inevitable in the master list if the ranking is done on the basis of a scoring scheme with a relatively small range of distinct values. We show that many of the interesting variants of stable marriage that are NP-hard remain so under very severe restrictions involving the presence of master lists, but a number of special cases can be solved in polynomial time. Under this master list model, versions of the stable marriage problem that are already solvable in polynomial time typically yield to faster and/or simpler algorithms, giving rise to simple new structural characterisations of the solutions in these cases

Hard variants of stable marriage

The Stable Marriage Problem and its many variants have been widely studied in the literature (Gusfield and Irving, The Stable Marriage Problem: Structure and Algorithms, MIT Press, Cambridge, MA, 1989; Roth and Sotomayor, Two-sided matching: a study in game-theoretic modeling and analysis, Econometric Society Monographs, vol. 18, Cambridge University Press, Cambridge, 1990; Knuth, Stable Marriage and its Relation to Other Combinatorial Problems, CRM Proceedings and Lecture Notes, vol. 10, American Mathematical Society, Providence, RI, 1997), partly because of the inherent appeal of the problem, partly because of the elegance of the associated structures and algorithms, and partly because of important practical applications, such as the National Resident Matching Program (Roth, J. Political Economy 92(6) (1984) 991) and similar large-scale matching schemes. Here, we present the first comprehensive study of variants of the problem in which the preference lists of the participants are not necessarily complete and not necessarily totally ordered. We show that, under surprisingly restrictive assumptions, a number of these variants are hard, and hard to approximate. The key observation is that, in contrast to the case where preference lists are complete or strictly ordered (or both), a given problem instance may admit stable matchings of different sizes. In this setting, examples of problems that are hard are: finding a stable matching of maximum or minimum size, determining whether a given pair is stable––even if the indifference takes the form of ties on one side only, the ties are at the tails of lists, there is at most one tie per list, and each tie is of length 2; and finding, or approximating, both an `egalitarian' and a `minimum regret' stable matching. However, we give a 2-approximation algorithm for the problems of finding a stable matching of maximum or minimum size. We also discuss the significant implications of our results for practical matching schemes

The College Admissions problem with lower and common quotas

We study two generalised stable matching problems motivated by the current matching scheme used in the higher education sector in Hungary. The first problem is an extension of the College Admissions problem in which the colleges have lower quotas as well as the normal upper quotas. Here, we show that a stable matching may not exist and we prove that the problem of determining whether one does is NP-complete in general. The second problem is a different extension in which, as usual, individual colleges have upper quotas, but, in addition, certain bounded subsets of colleges have common quotas smaller than the sum of their individual quotas. Again, we show that a stable matching may not exist and the related decision problem is NP-complete. On the other hand, we prove that, when the bounded sets form a nested set system, a stable matching can be found by generalising, in non-trivial ways, both the applicant-oriented and college-oriented versions of the classical Gale–Shapley algorithm. Finally, we present an alternative view of this nested case using the concept of choice functions, and with the aid of a matroid model we establish some interesting structural results for this case

Two algorithms for the student-project allocation problem

We study the Student-Project Allocation problem (SPA), a generalisation of the classical Hospitals / Residents problem (HR). An instance of SPA involves a set of students, projects and lecturers. Each project is offered by a unique lecturer, and both projects and lecturers have capacity constraints. Students have preferences over projects, whilst lecturers have preferences over students. We present two optimal linear-time algorithms for allocating students to projects, subject to the preference and capacity constraints. In particular, each algorithm finds a stable matching of students to projects. Here, the concept of stability generalises the stability definition in the HR context. The stable matching produced by the first algorithm is simultaneously best-possible for all students, whilst the one produced by the second algorithm is simultaneously best-possible for all lecturers. We also prove some structural results concerning the set of stable matchings in a given instance of SPA. The SPA problem model that we consider is very general and has applications to a range of different contexts besides student-project allocation

Strong Color Field Baryonic Remnants in Nucleus-Nucleus Collisions at 200A GeV

The effects of strong color electric fields (SCF) on the baryon production at RHIC are studied in the framework of HIJING/B\=B (v2.0) model. The particle species dependence of nuclear modification factors (NMF) are analyzed for Au+Au collisions at 200A GeV. A doubling of the string tension leading to a modification of the strangeness suppression according to Schwinger mechanism is shown to provide an alternate explanation to coalescence models for the interpretation of the observed baryon and meson production at moderate $p_T$ and results in a predicted enhancement in the (multi)strange (anti)hyperon production.Comment: 6 pages, Latex(Revtex), 4 figures;Added new references, one figure, text slightly modified. final version accepted for publication in Pnys. Rev. C (october,05

Anhydrous Calcium Oxalate Polymorphism: A Combined Computational and Synchrotron X-ray Diffraction Study

Four possible models for anhydrous calcium oxalate (COA) polymorphs have been investigated through ab initio quantum mechanical methods. Their structural properties, infrared and Raman spectra, and thermodynamic stability in the range of 0–800 K have been analyzed and compared. Along with the known β-COA structure, two models turn out to be possible candidates for the α- and γ-polymorphs that were observed during dehydration of weddellite (calcium oxalate dihydrate, COD) by Walter-Lévy and Laniepce ( C. R. Acad. Sci. Paris 1964, 259, 4685). While the calculated vibrational frequencies show that the four COA models correspond to minimum energy structures, β-COA is the thermodynamically favored phase over the range of temperatures examined in the present study. Despite the fact that computed vibrational spectra and X-ray diffraction (XRD) patterns of these polymorphs exhibit some different features, a definitive assignment of the structures based on computational results is not possible due to the lack of accurate experimental data. In an effort to improve comparative experimental data, the structural evolution of whewellite (calcium oxalate monohydrate, COM) has been probed using time-resolved synchrotron X-ray diffraction, in order to correlate the calculated structures to the observed structures. The evolution has been shown to go through at least four phases identified as COM, α-COA (corresponding to one of the models proposed by computation), β-COA, and CaCO3. The reactions are predominantly two-phase reactions, and at 140 °C evidence of three-phase coexistence has been noted between COM, α-COA, and β-COA. The time-resolved XRD data allow estimation of the kinetics of the reactions; these indicate second-order reactions between COM and α-COA and zeroth-order reactions between α-COA and β-COA

Does the quark cluster model predict any isospin two dibaryon resonance?

We analyze the possible existence of a resonance in the $J^P=0^-$ channel with isospin two by means of nucleon-$\Delta$ interactions based on the constituent quark model. We solve the bound state and the scattering problem using two different potentials, a local and a non-local one. The non-local potential results to be the more attractive, although not enough to generate the experimentally predicted resonance.Comment: 9 pages in Latex (revtex), 2 eps figures available under reques