共查询到20条相似文献，搜索用时 31 毫秒
1.
John Dinsmore 《New Generation Computing》1991,9(1):39-68
A logic-based system of knowledge representation for natural language discourse has three primary advantages:
On the other hand, a standard logic-based system has the following disadvantages:
相似文献
| – | • It has adequate expressive power, |
| – | • it has a well-defined semantics, and |
| – | • it uses simple, sound, general rules of inference. |
| – | • It supports only an exceedingly complex mapping from surface discourse sentences to internal representations, and |
| – | • reasoning about the content of semantically complex discourses is difficult because of the incommodious complexity of the internalized formulas. |
2.
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:
Advantages of the device:
The optical scheme of devices contains a light source, the polarizer, the analyzer, the hologram with magneto-optic layers,
and constant magnet. The hologram is placed between the polarizer and the analyzer.
The text was submitted by the authors in English. 相似文献
| – | hard magnetic layer on basis Tb-Fe with perpendicular anisotropy |
| – | soft magnetic layers on a basis or permalloy. |
| – | non contact reading of the magnetic information |
| – | difficulty of recurrence of magnetic images formation technology. |
3.
Dipl.-Wirtsch.-Ing Michael Klafft Dr. rer. pol. Sarah Spiekermann 《WIRTSCHAFTSINFORMATIK》2006,48(1):36-45
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:
相似文献
| – | ⊎ Reverse auctions and bid invitation platforms generate high consumer surplus in the procurement of general and crafts services. |
| – | ⊎ The level of this consumer surplus is affected by the number of bidders. The duration of the auction and the starting price are less important. |
| – | ⊎ In the painting business prices are considerably lower than with traditional procurement channels. |
| – | ⊎ On bid invitation platforms, in most cases (> 55%) the bids with the lowest price are chosen. |
4.
Modulare hierarchische Modellierung als Grundlage der Software- und Systementwicklung 总被引：5，自引：4，他引：1
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
Dieser Baukasten der Modellierung muss wie bei allen anderen Ingenieursdisziplinen einer durchdachten, in sich stimmigen
logisch-mathematischen Theorie entsprechen. Die hier vorgestellte Theorie besteht aus einem Satz von Notationen und Theoremen,
die eine Basis für wissenschaftlich fundierte, werkzeugunterstützbare Methoden liefern und eine den Anwendungsdom?nen (Stichwort
Dom?nenspezifische Sprachen) pragmatisch angepasste Vorgehensweise bringt.
Für eine wissenschaftlich abgesicherte Methode steht weniger die syntaktische Form der Modellierungssprache als vielmehr die
Modellierungstheorie im Zentrum. Die Repr?sentation von Modellen durch textuelle oder grafische Beschreibungsmittel ist ohne
Zweifel eine wichtige Voraussetzung für den praktischen Einsatz von Modellierungstechniken, muss aber als komfortabler und
grunds?tzlich austauschbarer ,,Syntactic Sugar“ gesehen werden. 相似文献
| – | Schnittstellen, |
| – | Hierarchische Zerlegung, |
| – | Architekturen durch Komposition und Dekomposition, |
| – | Abstraktion durch Schichtenbildung, |
| – | Realisierung durch Zustandsmaschinen, |
| – | Verfeinerung von Hierarchie, Schnittstellen und Verhalten, |
| – | Wechsel der Abstraktionsebenen und |
| – | Integrierte Sicht auf die gesteuerten und steuernden Teilsysteme. |
5.
A. S. Garbuz 《Cybernetics and Systems Analysis》1997,33(4):581-588
Conclusion We have provided a theoretical and methodological justification of complete construction of a universal formalized language
of knowledge. We have proved the following:
Deceased.
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 154–162, July–August, 1997. 相似文献
| – | the base term classification ensures unambiguous and deep indexation of documents; |
| – | the fixed sentence syntax makes it possible to standardize information-retrieval languages and automatic translation between languages; |
| – | the fixed message semantics provides the following opportunities: measuring the semantic information; rating the intensification of intellectual effort; eliminating unjustified duplication of research and publication; providing the user with timely necessary information in a form suitable for direct processing and use; organizing a national cost-efficient communication technology; solving linguistic problems of artificial intelligence and informatization of society; creating a reliable structural foundation for the development of a common unambiguous language for the entire humanity. |
6.
Conclusions
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 158–170, May–June, 1999. 相似文献
| 1. | As is established from the analysis, the classical method of critical path in network planning of projects is not valid in the case where the evaluations of durations of works are fuzzy quantities. |
| 2. | The method of fuzzy critical path is based on computation of a fuzzy set of critical works, fuzzy set of critical paths, fuzzy reserve of execution of uncritical works, and analysis of the risk content of a project. |
| 3. | The realization of soft computations of the proposed method of fuzzy critical path makes it possible to find the characteristics of a project expressed in terms of fuzzy numbers and to compare and improve projects; it promotes control over projects on the basis of fuzzy data as is done in the classical method of network planning and control. |
7.
V. I. Sokolov G. V. Mishakov V. Ya. Panchenko M. Yu. Tsvetkov 《Optical Memory & Neural Networks》2007,16(2):67-74
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:
The technology for fabricating narrowband Bragg filters on the basis of single-mode polymer waveguides with laser-induced
submicron index gratings is presented in detail. The filters possess narrowband reflection/transmission spectra in the 1.5
μm telecom wavelength region of 0.2–2.7 nm width, nearly rectangular shape of the stopband, reflectivity R > 99% and negligible radiation losses. They can be used for multiplexing/demultiplexing optical signals in high-speed DWDM
fiber networks.
The text was submitted by the authors in English. 相似文献
| – | UV contact lithography permitting creation of single-mode polymer waveguides and waveguide arrays |
| – | submicron printing for fabricating corrugated waveguides and polymer phase masks |
| – | UV laser holography for writing refractive index gratings in polymer materials. |
8.
Alan Bundy 《AI & Society》2007,21(4):659-668
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
These points are knitted together by an analogy between AI and structural engineering: in particular, between building expert
systems and building bridges. 相似文献
| the nature of AI | |
| the potential social benefit of applied AI | |
| the importance of basic AI research | |
| the role of logic and the methodology of rational construction | |
| the interplay of applied and basic AI research, and | |
| the importance of funding basic AI. |
9.
Applications of structural optimization are often multidisciplinary in nature and require nontraditional problem formulations.In the optimization system that has been developed, flexibility in terms of system design and problem formulation have been important aspects. A mathematical programming approach has been adopted where function values and sensitivity information is required from each discipline involved. To be able to deal with the demands of ongoing projects, a number of extensions have been implemented in recent years.The system is today used within the Saab and ABB companies. Four recent applications are presented to illustrate how the extended capabilities have been used.
相似文献
| 1. | A train structure, optimized with respect to strength and dynamic properties. |
| 2. | A combined shape and thickness optimization of a force measurement sensor. |
| 3. | The shape optimization of an electric motor component with respect to both structural and magnetic properties. |
| 4. | Finally a composite wing study including structural and aeroelastic considerations. |
10.
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:
相似文献
| • | We show that the permutation group problems Coset Intersection, Double Coset Membership, Group Conjugacy are in PZK. Further, the complements of these problems also have perfect zero knowledge proofs (in the liberal sense). We also show that permutation group isomorphism for solvable groups is in PZK. As an ingredient of this protocol, we design a randomized algorithm for sampling short presentations of solvable permutation groups. |
| • | We show that the complement of all the above problems have concurrent zero knowledge proofs. |
| • | We prove that the above problems for black-box groups are in SZK. |
| • | Finally, we also show that some of the problems have SZK protocols with efficient provers in the sense of Micciancio and Vadhan (Lecture Notes in Comput. Sci. 2729, 282–298, 2003). |
11.
Sebastian Dörn 《Theory of Computing Systems》2009,45(3):613-628
We present quantum algorithms for the following matching problems in unweighted and weighted graphs with n vertices and m edges:
Our quantum algorithms are faster than the best known classical deterministic algorithms for the corresponding problems.
In particular, the second result solves an open question stated in a paper by Ambainis and Špalek (Proceedings of STACS’06,
pp. 172–183, 2006). 相似文献
| • | Finding a maximal matching in general graphs in time . |
| • | Finding a maximum matching in general graphs in time . |
| • | Finding a maximum weight matching in bipartite graphs in time , where N is the largest edge weight. |
12.
Marios Mavronicolas Vicky Papadopoulou Anna Philippou Paul Spirakis 《Algorithmica》2008,51(3):315-341
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:
A preliminary version of this work appeared in the Proceedings of the 16th Annual International Symposium on Algorithms and
Computation, X. Deng and D. Du, eds., Lecture Notes in Computer Science, vol. 3827, pp. 288–297, Springer, December 2005.
This work has been partially supported by the IST Program of the European Union under contract 001907 (
), and by research funds at University of Cyprus. 相似文献
| • | We obtain an algebraic characterization of (mixed) Nash equilibria. | ||||
| • | No (non-trivial) instance of the graph-theoretic game has a pure Nash equilibrium. This is an immediate consequence of some covering properties we prove for the supports of the players in all (mixed) Nash equilibria. | ||||
| • |
We coin a natural subclass of mixed Nash equilibria, which we call Matching Nash equilibria, for this graph-theoretic game. Matching Nash equilibria are defined by enriching the necessary covering properties we proved
with some additional conditions involving other structural parameters of graphs, such as Independent Sets.
|
13.
Tiziana Margaria 《International Journal on Software Tools for Technology Transfer (STTT)》2005,7(4):293-296
This special section is devoted to a selection of papers that originally appeared in two thematic sessions on high-level testing of complex systems at IDPT 2002 and 2003, the 6th and 7th World Conference on Integrated Design and Process Technology, which took place in Pasadena, CA in June 2002 and in Austin, TX in December 2003, respectively.This collection of papers spans a wide panoramic view on the development of testing and validation technology along several dimmensions. It touches on issues such as
All seven papers present methods, tools, and case studies that aim at using diverse formal techniques for testing complex systems. 相似文献
| – | Kinds of systems |
| – | Kinds of testing or validation |
| – | Practical difficulties (in the application area) |
| – | Technical difficulties, e.g., state explosion, heterogeneity, etc. |
| – | Particular approaches, i.e., methods tools and whether or not they are linked to other areas such as formal verification, simulation, abstract interpretation, etc. |
| – | Current state of advancement and uptake (conceptual, implemented, industrial product, etc.) |
14.
In this paper we consider the p-ary transitive reduction (TR
p
) problem where p>0 is an integer; for p=2 this problem arises in inferring a sparsest possible (biological) signal transduction network consistent with a set of
experimental observations with a goal to minimize false positive inferences even if risking false negatives. Special cases
of TR
p
have been investigated before in different contexts; the best previous results are as follows:
In this paper, our contributions are as follows:
R. Albert’s research was partly supported by a Sloan Research Fellowship in Science and Technology.
B. DasGupta’s research was partly supported by NSF grants DBI-0543365, IIS-0612044 and IIS-0346973.
E. Sontag’s research was partly supported by NSF grants EIA 0205116 and DMS-0504557. 相似文献
| (1) | The minimum equivalent digraph problem, that correspond to a special case of TR1 with no critical edges, is known to be MAX-SNP-hard, admits a polynomial time algorithm with an approximation ratio of 1.617+ε for any constant ε>0 (Chiu and Liu in Sci. Sin. 4:1396–1400, 1965) and can be solved in linear time for directed acyclic graphs (Aho et al. in SIAM J. Comput. 1(2):131–137, 1972). |
| (2) | A 2-approximation algorithm exists for TR1 (Frederickson and JàJà in SIAM J. Comput. 10(2):270–283, 1981; Khuller et al. in 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937–938, 1999). |
| • | We observe that TR p , for any integer p>0, can be solved in linear time for directed acyclic graphs using the ideas in Aho et al. (SIAM J. Comput. 1(2):131–137, 1972). |
| • | We provide a 1.78-approximation for TR1 that improves the 2-approximation mentioned in (2) above. |
| • | We provide a 2+o(1)-approximation for TR p on general graphs for any fixed prime p>1. |
15.
Nicholas Pippenger 《Theory of Computing Systems》1976,10(1):129-167
This paper explores the connections between two areas pioneered by Shannon: the transmission of information with a fidelity criterion, and the realization of Boolean functions by networks and formulae. We study three phenomena:
Our main result is a precise version of the following statement: 相似文献
| 1. | The effect of the relative number of O's and l's in a function's table on its complexity. |
| 2. | The effect of the number of unspecified entries in a partially specified function's table on its complexity. |
| 3. | The effect of the number of errors allowed in the realization of a function on its complexity. |
16.
This paper studies the allocation of discrete resources among multiple agents from a preference theory perspective. More specifically, the paper explores the process of decision making where:
相似文献
| (a) | information is obtained about the preference profiles of each agent |
| (b) | the information acquired is then used as a basis for finding a socially optimal resource allocation, and |
| (c) | the costs involved in acquiring information are considered as an integral part of the process. |
17.
The rectilinear polygon cover problem is one in which a certain class of features of a rectilinear polygon ofn vertices has to be covered with the minimum number of rectangles included in the polygon. In particular, we consider covering
the entire interior, the boundary, and the set of corners of the polygon. These problems have important applications in storing
images and in the manufacture of integrated circuits. Unfortunately, most of these problems are known to be NP-complete. Hence
it is necessary to develop efficient heuristics for these problems or to show that the design of efficient heuristics is impossible.
In this paper we show:
A preliminary version of this result appeared inProceedings of the Fourth Canadian Conference on Computational Geometry, 1992, pp. 229–235. This research was partially supported by NSF Grant CCR-9114545. 相似文献
| (a) | The corner cover problem is NP-complete. |
| (b) | The boundary and the corner cover problem can be approximated within a ratio of 4 of the optimum inO(n logn) andO(n 1.5) time, respectively. |
| (c) | No polynomial-time approximation scheme exists for the interior and the boundary cover problems, unless P=NP. |
18.
For an inverse-monotone boundary value problem with the nonlinear ODE –ɛu" + sinh(u)=1,ɛ>0, u(0)=u(1)=0, applications of
the following enclosure methods are presented and discussed:
Existence of a classical solution follows from literature and (independently) from the execution of (ii). Whereas (i) requires
the inverse-monotonicity of the problem, this is not so for (ii). For small ε, the unique solution of the BVP is strongly
repellent.
Dedicated to Professor William F. Ames on the occasion of his 70th birthday
Supported by grant SM 093 of Kuwait University 相似文献
| (i) | on the basis of a piecewise replacement of sinh(u) by polynomials, the construction of monotone sequences of upper and lower bounds foru; |
| (ii) | on the basis of Lohner’s enclosure algorithms for solutions of ODEs, simple and multiple shooting methods. |
19.
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:
The three problems are dealt with one at a time, but from a common perspective, i.e., the attempt to integrate the richness and variety of human subjectivity in social research. As to the relationship between psychoanalysis and social research, a special section is devoted to the implications of an integrated or convergent methodology on team-working in organisations.
相似文献
| – | The conflicting and ambiguous relationship between psychoanalysis and social research |
| – | The classical epistemological problem of the relationship between the subject and object of research within the perspective of action research |
| – | The problem arising from their experience, i.e., the risk of manipulation, and the way to deal with it from an epistemic perspective |
| F. GaribaldoEmail: |
20.
Alexis De Vos 《Open Systems & Information Dynamics》2006,13(2):179-195
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
A computation is a manipulation of an incoming message, i.e. a mapping in probability space:
During a reversible computation, no isentropic path in the probability space can be found. Therefore we have to conclude that
a computation cannot be represented by a message which merely follows a path in n-dimensional probability space. Rather, the point representing the mixing function travels along a path in an infinite-dimensional
Hilbert space.
In honour of prof. dr. Henrik Farkas (Department of Chemical Physics, Technical University of Budapest) an outstanding scientist
and most remarkable human being who unfortunately left us on 21 July 2005. 相似文献
| • | either in flat probability space, i.e. the unitary n-dimensional hypertriangle |
| • | or in Bhattacharyya’s spherical statistical space, i.e. the unitary n-dimensional hyperoctant. |
| • | either a reversible mapping, i.e. a symmetry operation (rotation or reflection) in n-dimen sional space |
| • | or an irreversible mapping, i.e. a projection operation from n-dimensional to lower-dimensional space. |