Optoelectronic device for reading of hidden magnetic information from the holograms

The model of the device of reading (visualization) of the hidden magnetic information from the holograms combined with magneto-optical layer is presented in the article. Ways of magnetic images formation on the protected documentation and their reading by magneto-optical methods are proposed. The reading head with the help of magneto-optical meridional Kerr effect allows to observe visually of “effect of blinking” from the hologram with the hidden magnetic layer. During the work the mathematical analysis magneto-optical Kerr or Faraday effects was carried out. The hidden magnetic image based on:

Reverse procurement and auctions for consumers

Web-based bid invitation platforms and reverse auctions are increasingly used by consumers for the procurement of goods and services. An empirical examination shows that with B-2-C these procurement methods generate considerable benefits for the consumer:

Computing in Finite Time

If a message can have n different values and all values are equally probable, then the entropy of the message is log(n). In the present paper, we discuss the expectation value of the entropy, for an arbitrary probability distribution. We introduce a mixture of all possible probability distributions. We assume that the mixing function is uniform

AI Bridges and Dreams

This paper is a modified version of my acceptance lecture for the 1986 SPL-Insight Award. It turned into something of a personal credo -describing my view of

Proposal for a universal formalized language of knowledge

Conclusion  We have provided a theoretical and methodological justification of complete construction of a universal formalized language of knowledge. We have proved the following:

Quantum Algorithms for Matching Problems

We present quantum algorithms for the following matching problems in unweighted and weighted graphs with n vertices and m edges:

Routes to polymer-based photonics

The advances in polymer materials and technologies for telecom applications are reported. The polymers include new highly halogenated acrylates, which possess absorption losses less than 0.25 dB/cm and refractive indices ranging from 1.3 to 1.5 in the 1.5 μm wavelength region. The halogenated liquid monomers are highly intermixable, photocurable under UV exposure and exhibit high contrast in polymerization. The polymer technologies developed at the Institute on Laser and Information Technologies of the Russian Academy of Sciences (ILIT RAS) include:

Some reflections on the epistemological fundaments of an Italian action-research experience

In this paper the authors, starting from the experience described and commented on in earlier work by Mancini and Sbordone, deal with the three main epistemological problems that the research group they participated in had to face:

Hardness Hypotheses, Derandomization, and Circuit Complexity

We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences:

SZK Proofs for Black-Box Group Problems

In this paper we classify several algorithmic problems in group theory in the complexity classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to this, these problems were known to be in . As , we have a tighter upper bound for these problems. Specifically:

Modulare hierarchische Modellierung als Grundlage der Software- und Systementwicklung

Zusammenfassung  Die Entwicklung komplexer eingebetteter Softwaresysteme, wie sie heute beispielsweise in Telekommunikationssystemen, Fahr- oder Flugzeugen oder mit der Steuersoftware von Automatisierungssystemen im Einsatz sind, erfordert ein strukturiertes, modulares Vorgehen und angemessene Techniken zur pr?zisen Beschreibung von Anforderungen, der Architektur des Systems mit ihren Komponenten, der Schnittstellen zur Systemumgebung und zwischen den internen Komponenten, der Wechselwirkung zwischen gesteuertem und steuerndem Teilsystem und schlie?lich der Implementierung. Mit dem frühzeitigen und durchg?ngigen Einsatz geeigneter Modelle (Stichwort UML (,,Unified Modeling Language“) und MDA (,,Model Driven Architecture“)) werden gro?e Hoffnungen verbunden, die Entwicklungsaufgaben beherrschbarer zu gestalten. Dieser Artikel beschreibt die theoretischen Grundlagen für ein konsequent modellbasiertes Vorgehen in Form eines zusammengeh?rigen, homogenen und dennoch modularen Baukastens von Modellen, der hierfür zwingend erforderlich ist. Besondere Schwerpunkte liegen hierbei auf den Themen

BPP has subexponential time simulations unlessEXPTIME has publishable proofs

We show thatBPP can be simulated in subexponential time for infinitely many input lengths unless exponential time

Sampling Search-Engine Results

We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approximate algorithms for several applications, such as:

A Network Game with Attackers and a Defender

Consider an information network with threats called attackers; each attacker uses a probability distribution to choose a node of the network to damage. Opponent to the attackers is a protector entity called defender; the defender scans and cleans from attacks some part of the network (in particular, a link), which it chooses independently using its own probability distribution. Each attacker wishes to maximize the probability of escaping its cleaning by the defender; towards a conflicting objective, the defender aims at maximizing the expected number of attackers it catches. We model this network security scenario as a non-cooperative strategic game on graphs. We are interested in its associated Nash equilibria, where no network entity can unilaterally increase its local objective. We obtain the following results:

Multimedia Quality as a Function of Bandwidth,Packet Loss,and Latency

Two experiments examined the judged quality of videoconferencing as a function of three measures of IP network performance: bandwidth, latency, and packet loss. The experiments were realized in a laboratory using a network emulator and a commercial videoconferencing system. Experiment 1 used a fractional factorial design and all three parameters:

Towards communityware

This paper summarizes our recent activities to support people to communicate with each other using public computer network systems. Unlike conventional teleconferencing systems, which are mainly for business meetings, we focus on informal communication in open orgnizations. So far, three different systems have been developed and actually tested.

A Note on Multiflows and Treewidth

We consider multicommodity flow problems in capacitated graphs where the treewidth of the underlying graph is bounded by r. The parameter r is allowed to be a function of the input size. An instance of the problem consists of a capacitated graph and a collection of terminal pairs. Each terminal pair has a non-negative demand that is to be routed between the nodes in the pair. A class of optimization problems is obtained when the goal is to route a maximum number of the pairs in the graph subject to the capacity constraints on the edges. Depending on whether routings are fractional, integral or unsplittable, three different versions are obtained; these are commonly referred to respectively as maximum MCF, EDP (the demands are further constrained to be one) and UFP. We obtain the following results in such graphs.

Stratified Self-Calibration and Metric Reconstruction for Zooming/Refocusing Circular Motion Sequences

Self-calibration for imaging sensors is essential to many computer vision applications. In this paper, a new stratified self-calibration and metric reconstruction method is proposed for zooming/refocusing cameras under circular motion. With the assumption of known rotation angles, the circular motion constraints are first formulated. By enforcing the constraints gradually, metric reconstruction is retrieved up to a two-parameter ambiguity. The closed form expression of the absolute conic w.r.t. the two parameters is deduced. The ambiguity is then resolved with the square pixel assumption of the camera. The advantages of this method are mainly as follows: