Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Congenital hemangiopericytoma of the skin (1997)
    Oxford, UK : Blackwell Publishing Ltd
    International journal of dermatology 36 (1997), S. 0 
    Details
    ISSN: 1365-4632
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Medicine
    Notes: A 5-month-old white boy had a pinhead red spot on his left malleolar region since birth. His mother noted progressive growth and, when he was first examined, the lesion measured 30x25x20 mm in size, had a pyramidal shape, covered by erythematous and smooth skin, with teleangiectasia. The tumor was soft on paipation and movable over the deeper structures (Fig. 1a). X-ray examination revealed no bone abnormalities at that time.Just before the programmed incisional biopsy, the patient had a febrile episode due to upper respiratory tract viral infection during which the tumor became ulcerated, bleeding and painful (Fig. 1b). As the bleeding was constant the lesion was surgically excised, at which time the whole gelatinous mass was easily detached from the aponeurotic structures (Fig. 1c). The tumor measured 36x31 x30 mm and had a whitish, smooth cut surface crossed by small blood vessels.Histopathologic examination revealed a tumor mass extending from the mid dermis to the subcutaneous fat and composed of tightly packed fusiform cells in close opposition with lined vascular channels (Fig. 2a). There were atypical areas and mitotic figures were frequently seen. A reticulin preparation showed a dense network surrounding vessels and pericytes. The vessels branched in a staghorn configuration (Fig. 2b). The immunoperoxidase technique with monoclonal antibody anti-Factor VIII was positive in the endothelial cells surrounded by tumor cells (Fig. 2c).Seven months after surgery the patient returned with a painful subcutaneous mass on the upper third of his left leg that was adherent to the tibial bone. X-ray examination disclosed osteolytic lesions at the tibial base and destruction of the peroneal head (Fig. 3).The patient was submitted to radiotherapy, amputation of the left lower limb in the middle portion of the thigh and chemotherapy. He is clinically well 3 years after treatment.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1365-4362.1997.tb01152.x
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A Combinatorial Optimization Technique for the Sequential Decomposition of Erosions and Dilations (2000)
    Springer
    Journal of mathematical imaging and vision 13 (2000), S. 17-33 
    Details
    ISSN: 1573-7683
    Keywords: structuring element ; decomposition ; Minkowski addition ; erosion ; dilation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents a general algorithm for the automatic proof that an erosion (respectively, dilation) has a sequential decomposition or not. If the decomposition exists, an optimum decomposition is presented. The algorithm is based on a branch and bound search, with pruning strategies and bounds based on algebraic and geometrical properties deduced formally. This technique generalizes classical results as Zhuang and Haralick, Xu, and Park and Chin, with equivalent or improved performance. Finally, theoretical analysis of the proposed algorithm and experimental results are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008373522375
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Many Birds Fly, Some Don't (1999)
    Springer
    Artificial intelligence review 13 (1999), S. 185-200 
    Details
    ISSN: 1573-7462
    Keywords: belief revision ; commonsense reasoning ; partial set inclusion ; qualification problem ; nonmonotonic reasoning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Ever since the publication of “Programs With Common Sense” by McCarthy, the problem of qualification has been a source of intense research and debate. While it is undoubtful that now the common sense research community knows a lot about default reasoning, non-monotonic logics, belief revision, multiple extensions, among related topics, it is undeniable that the problem of qualification remains unsolved. In the present paper, the problem of qualification is reframed and a different approach to it is presented. It is here suggested that a more powerful instrument for quantification (instead of the universal quantifier) can circumvent some of the problems raised by the traditional approaches. From a commonsensical point of view, sentences like men are mortal, elephants are grey, and birds fly suggest a kind of “partial set inclusion” to which decreasing grades of epistemic entrenchment of a certain agent can be associated. In order to illustrate the capabilities of the proposed approach, an exercise of belief revision, involving a mythical australian bird, named Tweety, which happens to be a flying ostrich, is presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1006500215741
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Planning in a commonsense framework (1990)
    Springer
    Artificial intelligence review 4 (1990), S. 279-294 
    Details
    ISSN: 1573-7462
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The ability to make plans is a necessary condition for general intelligent behaviour. To plant everyday activities, an agent has to be capable of representing and reasoning about change. However, as it is impossible exhaustively to represent conditions for performing actions and their corresponding effects, artificial systems have to reason without complete knowledge. On the other hand, the fact that in the macroscopic world most characteristics of things persist over time has to be introduced in the formalization of change, to avoid stating explicitly what characteristics of the world are unaffected by every action. These are the main difficulties in planning in a commonsense framework, as far as formalization aspects are concerned. However there are others, of a more pragmatic nature (e.g. managing search). As a motivation, an example of formalization is given together with a brief explantion of the most known approaches to commonsense reasoning: circumscription, default theories and autoepistemic logic.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00168959
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Endemism centres, refugia and botanical collection density in Brazilian Amazonia (1990)
    [s.l.] : Nature Publishing Group
    Nature 345 (1990), S. 714-716 
    Details
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1038/345714a0
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    A conjugated polymer-based voltage-regulator deviceThe authors thank CNPq. CAPES. PADCT, and FAPERGS for financial support. (1997)
    Weinheim : Wiley-Blackwell
    Advanced Materials 9 (1997), S. 972-974 
    Details
    ISSN: 0935-9648
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Physics
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/adma.19970091209
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Some integer programs arising in the design of main frame computers (1993)
    Springer
    Mathematical methods of operations research 38 (1993), S. 77-100 
    Details
    ISSN: 1432-5217
    Keywords: clustering problem ; design of main frame computers ; graph partitioning problem ; hypergraph partitioning problem ; integer programming ; mathematical modelling ; multiple knapsack problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper we describe and discuss a problem that arises in the (global) design of a main frame computer. The task is to assign certain functional units to a given number of so called multi chip modules or printed circuit boards taking into account many technical constraints and minimizing a complex objective function. We describe the real world problem. A thorough mathematical modelling of all aspects of this problem results in a rather complicated integer program that seems to be hopelessly difficult — at least for the present state of integer programming technology. We introduce several relaxations of the general model, which are alsoNP-hard, but seem to be more easily accessible. The mathematical relations between the relaxations and the exact formulation of the problem are discussed as well.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01416008
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    facet.materialart.
    Unknown
    Facets for the Multiple Knapsack Problem. (1993)
    Details
    Publication Date: 2014-02-26
    Description: In this paper we consider the multiple knapsack problem which is defined as follows: given a set $N$ of items with weights $f_i$, $i \in N$, a set $M$ of knapsacks with capacities $F_k$, $k \in M$, and a profit function $c_{ik}, i \in N, k \in M$; find an assignment of a subset of the set of items to the set of knapsacks that yields maximum profit (or minimum cost). With every instance of this problem we associate a polyhedron whose vertices are in one to one correspondence to the feasible solutions of the instance. This polytope is the subject of our investigations. In particular, we present several new classes of inequalities and work out necessary and sufficient conditions under which the corresponding inequality defines a facet. Some of these conditions involve only properties of certain knapsack constraints, and hence, apply to the generalized assignment polytope as well. The results presented here serve as the theoretical basis for solving practical problems. The algorithmic side of our study, i.e., separation algorithms, implementation details and computational experience with a branch and cut algorithm are discussed in the companion paper SC 93-07.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 9
    facet.materialart.
    Unknown
    Some Integer Programs Arising in the Design of Main Frame Computers. (1993)
    Details
    Publication Date: 2020-11-13
    Description: In this paper we describe and discuss a problem that arises in the (global) design of a main frame computer. The task is to assign certain functional units to a given number of so called multi chip modules or printed circuit boards taking into account many technical constraints and minimizing a complex objective function. We describe the real world problem. A thorough mathematical modelling of all aspects of this problem results in a rather complicated integer program that seems to be hopelessly difficult -- at least for the present state of integer programming technology. We introduce several relaxations of the general model, which are also $NP$-hard, but seem to be more easily accessible. The mathematical relations between the relaxations and the exact formulation of the problem are discussed as well.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 10
    facet.materialart.
    Unknown
    Matrix Decomposition by Branch-and-Cut (1997)
    Details
    Publication Date: 2020-03-09
    Description: In this paper we investigate whether matrices arising from linear or integer programming problems can be decomposed into so-called {\em bordered block diagonal form}. More precisely, given some matrix $A$, we try to assign as many rows as possible to some number of blocks of limited size such that no two rows assigned to different blocks intersect in a common column. Bordered block diagonal form is desirable because it can guide and speed up the solution process for linear and integer programming problems. We show that various matrices from the %LP- and MIP-libraries \Netlib{} and MIPLIB can indeed be decomposed into this form by computing optimal decompositions or decompositions with proven quality. These computations are done with a branch-and-cut algorithm based on polyhedral investigations of the matrix decomposition problem.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...