Search results for "generalization"
showing 10 items of 250 documents
A numerical simulation scheme for the albedo of city street canyons
1985
A numerical scheme is described for the calculation of effective albedo values of long city street canyons. The method is based on a generalization of the radiation model for inclined surfaces recently presented by Bruhl and Zdunkowski (1983). Calculated albedo values are compared with Aida's (1982) experimentally determined results. It is found that experiment and theory are in reasonable and in some cases in excellent agreement. Additional results obtained by varying the geometry of the street canyon as well as the surface reflectivities are shown to demonstrate the versatility of the calculation scheme.
Blending Planes and Canal Surfaces Using Dupin Cyclides
2011
We develop two different new algorithms of G1-blending between planes and canal surfaces using Dupin cyclides. It is a generalization of existing algorithms that blend revolution surfaces and planes using a plane called construction plane. Spatial constraints were necessary to do that. Our work consist in building three spheres to determine the Dupin cyclide of the blending. The first algorithm is based on one of the definitions of Dupin cyclides taking into account three spheres of the same family enveloping the cyclide. The second one uses only geometric properties of Dupin cyclide. The blending is fixed by a circle of curvature onto the canal surface. Thanks to this one, we can determine…
Clustering-based robust three-dimensional phase unwrapping algorithm
2010
Relatively recent techniques that produce phase volumes have motivated the study of three-dimensional (3D) unwrapping algorithms that inherently incorporate the third dimension into the process. We propose a novel 3D unwrapping algorithm that can be considered to be a generalization of the minimum spanning tree (MST) approach. The technique combines characteristics of some of the most robust existing methods: it uses a quality map to guide the unwrapping process, a region growing mechanism to progressively unwrap the signal, and also cut surfaces to avoid error propagation. The approach has been evaluated in the context of noncontact measurement of dynamic objects, suggesting a better perfo…
Analysis of the Russian and World Marker of Telemedicine and Biochipping: Features and Development Prospects
2019
The paper considers the telemedicine and biochipping market and studies the peculiarities of its development and problems in different countries. The purpose is to study the experience of telemedicine and biochipping in the world, and its features and prospects of development. The authors used methods of generalization, comparison, sampling, regression analysis, scientific articles and expert opinions to make a comparative analysis of the experience and results of the implementation of biochipping and telemedicine. The following conclusion was made: with the introduction of biochipping, the problem of a large number of long-term hospital and false ambulance calls will be solved, and the bod…
Incorporating hypothetical knowledge into the process of inductive synthesis
1996
The problem of inductive inference of functions from hypothetical knowledge is investigated in this paper. This type of inductive inference could be regarded as a generalization of synthesis from examples that can be directed not only by input/output examples but also by knowledge of, e. g., functional description's syntactic structure or assumptions about the process of function evaluation. We show that synthesis of this kind is possible by efficiently enumerating the hypothesis space and illustrate it with several examples.
Convex semi-infinite games
1986
This paper introduces a generalization of semi-infinite games. The pure strategies for player I involve choosing one function from an infinite family of convex functions, while the set of mixed strategies for player II is a closed convex setC inRn. The minimax theorem applies under a condition which limits the directions of recession ofC. Player II always has optimal strategies. These are shown to exist for player I also if a certain infinite system verifies the property of Farkas-Minkowski. The paper also studies certain conditions that guarantee the finiteness of the value of the game and the existence of optimal pure strategies for player I.
An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
1984
We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding toGale, Farkas, Gordan andMotzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.
Quantum dynamics of the intensity-dependent Tavis-Cummings model
1999
An exactly solvable generalization of the intensity-dependent Jaynes-Cummings model to the case of N0 atoms is introduced together with its solution. The quantum dynamics of the model including the squeezing properties of the su(1,1) Perelomov and Glauber coherent states is investigated. The cases of one and two atoms present in the cavity are analysed in detail. These two cases are compared in the situation when the atomic subsystem is initially prepared in the ground state, the Dicke state and the state of thermal equilibrium.
Solid ground makes solid understandings: does simple comparison paves the way for more complex comparisons ?
2021
In this experiment, we investigated the role of dimensional distinctiveness on the generalization of novel names for unfamiliar objects. In a comparison design, we manipulated the sequence of trials difficulty, starting either with more difficult trials or with easier trials. To achieve this, we manipulated the dimensional distinctiveness of the first comparison trials and of the, later, transfer trials. Results showed that high-distinctiveness (easy) stimuli increased children’s later performance in the low-distinctiveness (difficult) condition whereas low-distinctiveness early training led to no later improvement in easier trials. Last, a correct answer for the first trial in the first le…
CNN-Based Prostate Zonal Segmentation on T2-Weighted MR Images: A Cross-Dataset Study
2020
Prostate cancer is the most common cancer among US men. However, prostate imaging is still challenging despite the advances in multi-parametric magnetic resonance imaging (MRI), which provides both morphologic and functional information pertaining to the pathological regions. Along with whole prostate gland segmentation, distinguishing between the central gland (CG) and peripheral zone (PZ) can guide toward differential diagnosis, since the frequency and severity of tumors differ in these regions; however, their boundary is often weak and fuzzy. This work presents a preliminary study on deep learning to automatically delineate the CG and PZ, aiming at evaluating the generalization ability o…