Einloggen

Thematische Bibliographien / PARTIAL COMPLETION / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: PARTIAL COMPLETION.

Zeitschriftenartikel zum Thema „PARTIAL COMPLETION“

Autor: Grafiati

Veröffentlicht am 11. September 2023

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "PARTIAL COMPLETION" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

HU, YING, PETER IMKELLER und MATTHIAS MÜLLER. „PARTIAL EQUILIBRIUM AND MARKET COMPLETION“. International Journal of Theoretical and Applied Finance 08, Nr. 04 (Juni 2005): 483–508. http://dx.doi.org/10.1142/s0219024905003098.

Der volle Inhalt der Quelle

Annotation:

We consider financial markets with agents exposed to an external source of risk which cannot be hedged through investments on the capital market alone. The sources of risk we think of may be weather and climate. Therefore we face a typical example of an incomplete financial market. We design a model of a market on which the external risk becomes tradable. In a first step we complete the market by introducing an extra security which valuates the external risk through a process parameter describing its market price. If this parameter is fixed, risk has a price and every agent can maximize the expected exponential utility with individual risk aversion obtained from his risk exposure on the one hand and his investment into the financial market consisting of an exogenous set of stocks and the insurance asset on the other hand. In the second step, the market price of risk parameter has to be determined by a partial equilibrium condition which just expresses the fact that in equilibrium the market is cleared of the second security. This choice of market price of risk is performed in the framework of nonlinear backwards stochastic differential equations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Johnson, Charles R., und Leiba Rodman. „Completion of Toeplitz Partial Contractions“. SIAM Journal on Matrix Analysis and Applications 9, Nr. 2 (April 1988): 159–67. http://dx.doi.org/10.1137/0609013.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Sun, Yongqiang, Kai Lin und Chaojun Lu. „Partial completion of equational theories“. Journal of Computer Science and Technology 15, Nr. 6 (November 2000): 552–59. http://dx.doi.org/10.1007/bf02948837.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

French, Zack, und James B. Hart. „The predicate completion of a partial information system“. Mathematica Slovaca 68, Nr. 2 (25.04.2018): 253–70. http://dx.doi.org/10.1515/ms-2017-0098.

Der volle Inhalt der Quelle

Annotation:

Abstract Originally, partial information systems were introduced as a means of providing a representation of the Smyth powerdomain in terms of order convex substructures of an information-based structure. For every partial information system 𝕊, there is a new partial information system that is natrually induced by the principal lowersets of the consistency predicate for 𝕊. In this paper, we show that this new system serves as a completion of the parent system 𝕊 in two ways. First, we demonstrate that the induced system relates to the parent system 𝕊 in much the same way as the ideal completion of the consistency predicate for 𝕊 relates to the consistency predicate itself. Second, we explore the relationship between this induced system and the notion of D-completions for posets. In particular, we show that this induced system has a “semi-universal” property in the category of partial information systems coupled with the preorder analog of Scott-continuous maps that is induced by the universal property of the D-completion of the principal lowersets of the consistency predicate for the parent system 𝕊.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Perelman, Daniel, Sumit Gulwani, Thomas Ball und Dan Grossman. „Type-directed completion of partial expressions“. ACM SIGPLAN Notices 47, Nr. 6 (06.08.2012): 275–86. http://dx.doi.org/10.1145/2345156.2254098.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Xiao, Mang, Guangyao Li, Yunlan Tan, Lei Peng, Yangjian Lv und Li Xie. „Image Completion Based on Partial Region“. International Journal of Signal Processing, Image Processing and Pattern Recognition 7, Nr. 4 (31.08.2014): 335–44. http://dx.doi.org/10.14257/ijsip.2014.7.4.32.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Lee, Wan-Gon, Batselem Jagvaral, Ji-Hun Hong, Hyun-Young Choi und Young-Tack Park. „Partial Embedding Approach for Knowledge Completion“. Journal of KIISE 45, Nr. 11 (30.11.2018): 1168–75. http://dx.doi.org/10.5626/jok.2018.45.11.1168.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Kurowicka, D., und R. M. Cooke. „Completion problem with partial correlation vines“. Linear Algebra and its Applications 418, Nr. 1 (Oktober 2006): 188–200. http://dx.doi.org/10.1016/j.laa.2006.01.031.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Johnson, Charles R., und Leiba Rodman. „Completion of partial matrices to contractions“. Journal of Functional Analysis 69, Nr. 2 (November 1986): 260–67. http://dx.doi.org/10.1016/0022-1236(86)90091-1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Kuhl, Jaromy, und Tristan Denley. „Constrained completion of partial latin squares“. Discrete Mathematics 312, Nr. 6 (März 2012): 1251–56. http://dx.doi.org/10.1016/j.disc.2011.10.025.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Dung, Nguyen Van. „On the completion of partial metric spaces“. Quaestiones Mathematicae 40, Nr. 5 (11.04.2017): 589–97. http://dx.doi.org/10.2989/16073606.2017.1303004.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Yi, Kefu, Hongwei Hu, Yang Yu und Wei Hao. „Regularized matrix completion with partial side information“. Neurocomputing 383 (März 2020): 151–64. http://dx.doi.org/10.1016/j.neucom.2019.12.021.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Hou, Jinchuan. „Completion of operator partial matrices to projections“. Linear Algebra and its Applications 246 (Oktober 1996): 71–82. http://dx.doi.org/10.1016/0024-3795(94)00336-x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Andrén, Lina J., Carl Johan Casselgren und Klas Markström. „Restricted completion of sparse partial Latin squares“. Combinatorics, Probability and Computing 28, Nr. 5 (20.02.2019): 675–95. http://dx.doi.org/10.1017/s096354831800055x.

Der volle Inhalt der Quelle

Annotation:

AbstractAnn×npartial Latin squarePis calledα-dense if each row and column has at mostαnnon-empty cells and each symbol occurs at mostαntimes inP. Ann×narrayAwhere each cell contains a subset of {1,…,n} is a (βn,βn, βn)-array if each symbol occurs at mostβntimes in each row and column and each cell contains a set of size at mostβn. Combining the notions of completing partial Latin squares and avoiding arrays, we prove that there are constantsα,β> 0 such that, for every positive integern, ifPis anα-densen×npartial Latin square,Ais ann×n (βn, βn, βn)-array, and no cell ofPcontains a symbol that appears in the corresponding cell ofA, then there is a completion ofPthat avoidsA; that is, there is a Latin squareLthat agrees withPon every non-empty cell ofP, and, for eachi,jsatisfying 1 ≤i,j≤n, the symbol in position (i,j) inLdoes not appear in the corresponding cell ofA.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Li, Lei, Minghe Xue, Zan Zhang, Huanhuan Chen und Xindong Wu. „Certainty-based Preference Completion“. Data Intelligence 4, Nr. 1 (2022): 112–33. http://dx.doi.org/10.1162/dint_a_00115.

Der volle Inhalt der Quelle

Annotation:

Abstract As from time to time it is impractical to ask agents to provide linear orders over all alternatives, for these partial rankings it is necessary to conduct preference completion. Specifically, the personalized preference of each agent over all the alternatives can be estimated with partial rankings from neighboring agents over subsets of alternatives. However, since the agents' rankings are nondeterministic, where they may provide rankings with noise, it is necessary and important to conduct the certainty-based preference completion. Hence, in this paper firstly, for alternative pairs with the obtained ranking set, a bijection has been built from the ranking space to the preference space, and the certainty and conflict of alternative pairs have been evaluated with a well-built statistical measurement Probability-Certainty Density Function on subjective probability, respectively. Then, a certainty-based voting algorithm based on certainty and conflict has been taken to conduct the certainty-based preference completion. Moreover, the properties of the proposed certainty and conflict have been studied empirically, and the proposed approach on certainty-based preference completion for partial rankings has been experimentally validated compared to state-of-arts approaches with several datasets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Hawthorn-Embree, Meredith L., Emily P. Taylor, Christopher H. Skinner, John Parkhurst und Meagan L. Nalls. „REPLICATING AND EXTENDING RESEARCH ON THE PARTIAL ASSIGNMENT COMPLETION EFFECT: IS SUNK COST RELATED TO PARTIAL ASSIGNMENT COMPLETION STRENGTH?“ Psychology in the Schools 51, Nr. 3 (23.01.2014): 316–27. http://dx.doi.org/10.1002/pits.21750.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Jordán, C., J. R. Torregrosa und A. Urbano. „Controllability completion problems of partial upper triangular matrices∗“. Linear and Multilinear Algebra 47, Nr. 1 (März 2000): 57–75. http://dx.doi.org/10.1080/03081080008818632.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Curto, Raúl E., Sang Hoon Lee und Jasang Yoon. „Completion of Hankel partial contractions of extremal type“. Journal of Mathematical Physics 53, Nr. 12 (Dezember 2012): 123526. http://dx.doi.org/10.1063/1.4769992.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Polat, Norbert. „Netlike partial cubes, V: Completion and netlike classes“. Discrete Mathematics 309, Nr. 13 (Juli 2009): 4362–76. http://dx.doi.org/10.1016/j.disc.2009.01.019.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Hoehnke, Hans-J�rgen. „A Birkhoff theorem for partial algebras via completion“. Applied Categorical Structures 4, Nr. 4 (Dezember 1996): 371–86. http://dx.doi.org/10.1007/bf00122685.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

HWANG, IN SUNG, und AN HYUN KIM. „A HYPONORMAL TOEPLITZ COMPLETION PROBLEM“. Glasgow Mathematical Journal 56, Nr. 1 (25.02.2013): 1–8. http://dx.doi.org/10.1017/s0017089512000857.

Der volle Inhalt der Quelle

Annotation:

AbstractIn this paper we consider the following ‘Toeplitz completion’ problem: Complete the unspecified analytic Toeplitz entries of the partial block Toeplitz matrix $ \begin{linenomath} A:=\begin{bmatrix} T_{\overline\psi_1}& ?\\[4pt] \T_{\overline\psi_2} \end{bmatrix} \end{linenomath} $ to make A hyponormal, where ψi∈H∞ is a non-constant rational function for i=1,2.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Tang, Hanlin, Martin Schrimpf, William Lotter, Charlotte Moerman, Ana Paredes, Josue Ortega Caro, Walter Hardesty, David Cox und Gabriel Kreiman. „Recurrent computations for visual pattern completion“. Proceedings of the National Academy of Sciences 115, Nr. 35 (13.08.2018): 8835–40. http://dx.doi.org/10.1073/pnas.1719397115.

Der volle Inhalt der Quelle

Annotation:

Making inferences from partial information constitutes a critical aspect of cognition. During visual perception, pattern completion enables recognition of poorly visible or occluded objects. We combined psychophysics, physiology, and computational models to test the hypothesis that pattern completion is implemented by recurrent computations and present three pieces of evidence that are consistent with this hypothesis. First, subjects robustly recognized objects even when they were rendered <15% visible, but recognition was largely impaired when processing was interrupted by backward masking. Second, invasive physiological responses along the human ventral cortex exhibited visually selective responses to partially visible objects that were delayed compared with whole objects, suggesting the need for additional computations. These physiological delays were correlated with the effects of backward masking. Third, state-of-the-art feed-forward computational architectures were not robust to partial visibility. However, recognition performance was recovered when the model was augmented with attractor-based recurrent connectivity. The recurrent model was able to predict which images of heavily occluded objects were easier or harder for humans to recognize, could capture the effect of introducing a backward mask on recognition behavior, and was consistent with the physiological delays along the human ventral visual stream. These results provide a strong argument of plausibility for the role of recurrent computations in making visual inferences from partial information.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Amaglobeli, M. G. „Exponential MR-groups: faithful R-completion“. Доклады Академии наук 486, Nr. 2 (27.05.2019): 147–50. http://dx.doi.org/10.31857/s0869-56524862147-150.

Der volle Inhalt der Quelle

Annotation:

The paper is devoted to partial exponential MR-groups which are embeddable to their tensor MR-completions. The free MR-groups and free MR-products are described with usual group-theoretical free contructions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

KIM, IN HYOUN, SEONGUK YOO und JASANG YOON. „COMPLETION OF HANKEL PARTIAL CONTRACTIONS OF NON-EXTREMAL TYPE“. Journal of the Korean Mathematical Society 52, Nr. 5 (01.09.2015): 1003–21. http://dx.doi.org/10.4134/jkms.2015.52.5.1003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Palmer, Stephen E., Joseph L. Brooks und Kevin S. Lai. „The Occlusion Illusion: Partial Modal Completion or Apparent Distance?“ Perception 36, Nr. 5 (Mai 2007): 650–69. http://dx.doi.org/10.1068/p5694.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Choi, Man-Duen, Jinchuan Hou und Peter Rosenthal. „Completion of operator partial matrices to square-zero contractions“. Linear Algebra and its Applications 256 (April 1997): 1–30. http://dx.doi.org/10.1016/s0024-3795(96)00774-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Bakonyi, Mih�ly. „Completion of operator partial matrices associated with chordal graphs“. Integral Equations and Operator Theory 15, Nr. 2 (März 1992): 173–85. http://dx.doi.org/10.1007/bf01204236.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Wang, Xin, Guangcan Liu, Wayne Zhang und Qingshan Liu. „Selecting Optimal Completion to Partial Matrix via Self-Validation“. IEEE Signal Processing Letters 27 (2020): 1265–69. http://dx.doi.org/10.1109/lsp.2020.3008043.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Hoffmann, Anders N. „The gains from partial completion of the single market“. Review of World Economics 136, Nr. 4 (Dezember 2000): 601–30. http://dx.doi.org/10.1007/bf02707645.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Syahrudi, Syahrudi, und R. Yoga Wijayahadi. „Completion Total Thyroidectomy in Occult Thyroid Cancer Patients after Partial Thyroidectomy“. Folia Medica Indonesiana 57, Nr. 1 (14.04.2021): 11. http://dx.doi.org/10.20473/fmi.v57i1.26328.

Der volle Inhalt der Quelle

Annotation:

Thyroid cancer is one of the commonest cancer while the incidence of occult thyroid cancer is only 0,05%. Completion total thyroidectomy as one of the treatment choice for thyroid cancer which initially diagnosed preoperatively as benign thyroid mass, remains controversial. The aim of this study is to understand the effectiveness of completion total thyroidectomy after partial thyroidectomy, by analyzing from: proportion of malignant contralateral thyroid tissue, post operative complications, and recurrence of cancer. This retrospective study collected medical record datan between 2011 and 2016. Total sample were 16 patients (15 females, 1 male). There was no significant difference on contralateral thyroid tissue malignancy proportion between completion total thyroidectomy and without total thyroidectomy (p=0,375). It was found 3 surgical complications (50%) from 6 patients with completion total thyroidectomy and 3 complications (30%) from 10 patients without completion total thyroidectomy. The complications were temporary injury of recurrent laryngeal nerve (p=0,511), seroma (p=0,375), and hypoparathyroidism (p=0,375). No recurrence event after 4 years follow up amount both groups. In conclusion, there is no advantage in completion total thyroidectomy analized from proportion of malignant contralateral thyroid tissue, post operative complication and recurrence in 4 years-follow up.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

GORALČÍK, P., und V. KOUBEK. „ON COMPLETING PARTIAL GROUPOIDS TO SEMIGROUPS“. International Journal of Algebra and Computation 16, Nr. 03 (Juni 2006): 551–62. http://dx.doi.org/10.1142/s0218196706003086.

Der volle Inhalt der Quelle

Annotation:

Let [Formula: see text] be a class of semigroups containing all finite commutative bands, and let p(x) be a real polynomial. The [Formula: see text]-completion problem asks whether for a given partial groupoid G there exists a semigroup [Formula: see text] such that G ⊆ S, every product for (a, b) ∈ G2 defined in G coincides with that for (a, b) in S, and |S| ≤ p(|G|). We prove the problem to be ℕℙ-hard in general and ℕℙ-complete if the membership problem for [Formula: see text] is in ℙ.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Sarma, Bhaba, und Kalyan Sinha. „The P_0^+-matrix completion problem“. Electronic Journal of Linear Algebra 29 (20.09.2015): 120–43. http://dx.doi.org/10.13001/1081-3810.2997.

Der volle Inhalt der Quelle

Annotation:

A real n by n matrix B is a P_0^+ -matrix if for each k in {1, 2, . . . , n} every k by k principal minor of B is nonnegative, and at least one k by k principal minor is positive. A digraph D is said to have P_0^+-completion if every partial P_0^+-matrix specifying D can be completed to a P_0^+ -matrix. In this paper, we study the P_0^+-completion problem, give necessary conditions for a digraph to have P_0^+-completion, and single out those digraphs of order at most four that have P_0^+-completion.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Bonizzoni, Paola, Gianluca Della Vedova, Riccardo Dondi und Lorenzo Mariani. „Experimental analysis of a new algorithm for partial haplotype completion“. International Journal of Bioinformatics Research and Applications 1, Nr. 4 (2005): 461. http://dx.doi.org/10.1504/ijbra.2005.008448.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Zhan, Xingzhi. „Completion of a partial integral matrix to a unimodular matrix“. Linear Algebra and its Applications 414, Nr. 1 (April 2006): 373–77. http://dx.doi.org/10.1016/j.laa.2005.10.013.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Le Guiban, Kaourintin, Arpad Rimmel, Marc-Antoine Weisser und Joanna Tomasik. „Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability“. Theoretical Computer Science 715 (März 2018): 1–20. http://dx.doi.org/10.1016/j.tcs.2018.01.014.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Jordán, C., J. R. Torregrosa und A. M. Urbano. „r-Numbers completion problems of partial upper canonical form I“. Applied Mathematics Letters 15, Nr. 6 (August 2002): 685–91. http://dx.doi.org/10.1016/s0893-9659(02)00028-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Jordán, C., J. R. Torregrosa und A. M. Urbano. „r-Numbers completion problems of partial upper canonical form II“. Applied Mathematics Letters 15, Nr. 7 (Oktober 2002): 885–91. http://dx.doi.org/10.1016/s0893-9659(02)00058-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Gurvits, Leonid, Leiba Rodman und Tamir Shalom. „Controllability and completion of partial upper triangular matrices over rings“. Linear Algebra and its Applications 172 (Juli 1992): 135–49. http://dx.doi.org/10.1016/0024-3795(92)90023-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Xia, Y., W. Liu, Z. Luo, Y. Xu und U. Stilla. „COMPLETION OF SPARSE AND PARTIAL POINT CLOUDS OF VEHICLES USING A NOVEL END-TO-END NETWORK“. ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences V-2-2020 (03.08.2020): 933–40. http://dx.doi.org/10.5194/isprs-annals-v-2-2020-933-2020.

Der volle Inhalt der Quelle

Annotation:

Abstract. Completing the 3D shape of vehicles from real scan data, which aims to estimate the complete geometry of vehicles from partial inputs, acts as a role in the field of remote sensing and autonomous driving. With the recent popularity of deep learning, plenty of data-driven methods have been proposed. However, most of them usually require additional information as prior knowledge for the input, for example, semantic labels and symmetry assumptions. In this paper, we design a novel and end-to-end network, termed as S2U-Net, to achieve the completion of 3D shapes of vehicles from the partial and sparse point clouds. Our network includes two modules of the encoder and the generator. The encoder is designed to extract the global feature of the incomplete and sparse point cloud while the generator is designed to produce fine-grained and dense completion. Specially, we adopt an upsampling strategy to output a more uniform point cloud. Experimental results in the KITTI dataset illustrate our method achieves better performance than the state-of-arts in terms of distribution uniformity and completion quality. Specifically, we improve the translation accuracy by 50.8% and rotation accuracy by 40.6% evaluating completed results with a point cloud registration task.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Heidhues, Paul, und Philipp Strack. „Identifying Present Bias from the Timing of Choices“. American Economic Review 111, Nr. 8 (01.08.2021): 2594–622. http://dx.doi.org/10.1257/aer.20191258.

Der volle Inhalt der Quelle

Annotation:

A (partially naïve) quasi-hyperbolic discounter repeatedly chooses whether to complete a task. Her net benefits of task completion are drawn independently between periods from a time-invariant distribution. We show that the probability of completing the task conditional on not having done so earlier increases towards the deadline. Conversely, we establish nonidentifiability by proving that for any time-preference parameters and any dataset with such (weakly increasing) task-completion probabilities, there exists a stationary payoff distribution that rationalizes the agent’s behavior if she is either sophisticated or fully naïve. Additionally, we provide sharp partial identification for the case of observable continuation values. (JEL C14, D11, D15, D90, D91)

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Walker, Robin, und Jason B. Mattingley. „Pathological completion: The blind leading the mind?“ Behavioral and Brain Sciences 21, Nr. 6 (Dezember 1998): 778–79. http://dx.doi.org/10.1017/s0140525x98561754.

Der volle Inhalt der Quelle

Annotation:

The taxonomy proposed by Pessoa et al. should be extended to include “pathological” completion phenomena in patients with unilateral brain damage. Patients with visual field defects (hemianopias) may “complete” whole figures, while patients with parietal lobe damage may “complete” partial figures. We argue that the former may be consistent with the brain “filling-in” information, and the latter may be consistent with the brain ignoring the absence of information.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Ponmudi, M. S., und A. Ramesh Kumar. „THE $Q_{N^{1}_{0}}$-MATRIX COMPLETION PROBLEM FOR DIGRAPHS 5x5 MATRICES“. Advances in Mathematics: Scientific Journal 11, Nr. 4 (12.04.2022): 321–34. http://dx.doi.org/10.37418/amsj.11.4.3.

Der volle Inhalt der Quelle

Annotation:

An $n\times n$ matrix is called a $Q_{N^{1}_{0}}$ matrix if for every $k=\lbrace 1,2,3,\ldots ,n \rbrace $ the sum of all $ k \times k $ principal minors is non-positive. A digraph $D$ is said to have $Q_{N^{1}_{0}}$-completion if every partial $Q_{N^{1}_{0}}$-matrix specifying $D$ can be completed to a $Q_{N^{1}_{0}}$-matrix. In this paper $Q_{N^{1}_{0}}$-matrix completion problem is considered. It is shown that partial non-positive $Q_{N^{1}_{0}}$ -matrices representing all digraphs of order $5$ with $q = 0$ to $7$ have $Q_{N^{1}_{0}}$ completion.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Mukohyama, Shinji, und Ryo Namba. „Partial UV completion of P(X) from a curved field space“. Journal of Cosmology and Astroparticle Physics 2021, Nr. 02 (01.02.2021): 001. http://dx.doi.org/10.1088/1475-7516/2021/02/001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Ancarani, L. U., und M. C. Chidichimo. „Partial wave completion technique for scattering amplitudes in Coulomb dipole excitation“. Journal of Physics B: Atomic, Molecular and Optical Physics 37, Nr. 21 (27.10.2004): 4339–67. http://dx.doi.org/10.1088/0953-4075/37/21/009.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Dobrinja, C., M. Pastoricchio, M. Troian, F. Da Canal, S. Bernardi, B. Fabris und N. de Manzini. „Partial thyroidectomy for papillary thyroid microcarcinoma: Is completion total thyroidectomy indicated?“ International Journal of Surgery 41 (Mai 2017): S34—S39. http://dx.doi.org/10.1016/j.ijsu.2017.02.012.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Donatini, G., M. Castagnet, T. Desurmont, N. Rudolph, D. Othman und J. L. Kraimps. „Partial Thyroidectomy for Papillary Thyroid Microcarcinoma: Is Completion Total Thyroidectomy Indicated?“ World Journal of Surgery 40, Nr. 3 (06.11.2015): 510–15. http://dx.doi.org/10.1007/s00268-015-3327-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Abobaker, Ekhwaiter, Abadelhalim Elsanoose, Faisal Khan, Mohammad Azizur Rahman, Amer Aborig und Khalid Noah. „Quantifying the partial penetration skin factor for evaluating the completion efficiency of vertical oil wells“. Journal of Petroleum Exploration and Production Technology 11, Nr. 7 (Juli 2021): 3031–43. http://dx.doi.org/10.1007/s13202-021-01229-8.

Der volle Inhalt der Quelle

Annotation:

AbstractAn oil well's productivity is generally considered the standard measure of the well's performance. However, productivity depends on several factors, including fluid characteristics, formation damage, the reservoir's formation, and the kind of completion the well undergoes. How a partial completion can affect a well's performance will be investigated in detail in this study, as nearly every vertical well is only partially completed as a result of gas cap or water coning issues. Partially penetrated wells typically experience a larger pressure drop of fluid flow caused by restricted regions, thus increasing the skin factor. A major challenge for engineers when developing completion designs or optimizing skin factor variables is devising and testing suitable partial penetration skin and comparing completion options. Several researchers have studied and calculated a partial penetration skin factor, but some of their results tend to be inaccurate and cause excessive errors. The present work proposes experimental work and a numerical simulation model for accurate estimation of the pseudo-skin factor for partially penetrated wells. The work developed a simple correlation for predicting the partial penetration skin factor for perforated vertical wells. The work also compared the results from available models that are widely accepted by the industry as a basis for gauging the accuracy of the new correlation in estimating the skin factor. Compared to other approaches, the novel correlation performs well by providing estimates for the partial penetration skin factor that are relatively close to those obtained by the tested models. This work's main contribution is the presentation of a novel correlation that simplifies the estimation of the partial penetration skin factor in partially completed vertical wells.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Burkhard, H.-D. „Case completion and similarity in case-based reasoning“. Computer Science and Information Systems 1, Nr. 2 (2004): 27–55. http://dx.doi.org/10.2298/csis0402027b.

Der volle Inhalt der Quelle

Annotation:

Case Completion investigates cases for complex problem solving tasks using Case-Based Reasoning. Such tasks consist of several steps, and related cases should support each intermediate decision. Related cases are of a constraint like style and need the handling of partial matching for retrieval. Related similarity measures are investigated, and the implementation by Case Retrieval Nets is proposed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Liu, Minghua, Lu Sheng, Sheng Yang, Jing Shao und Shi-Min Hu. „Morphing and Sampling Network for Dense Point Cloud Completion“. Proceedings of the AAAI Conference on Artificial Intelligence 34, Nr. 07 (03.04.2020): 11596–603. http://dx.doi.org/10.1609/aaai.v34i07.6827.

Der volle Inhalt der Quelle

Annotation:

3D point cloud completion, the task of inferring the complete geometric shape from a partial point cloud, has been attracting attention in the community. For acquiring high-fidelity dense point clouds and avoiding uneven distribution, blurred details, or structural loss of existing methods' results, we propose a novel approach to complete the partial point cloud in two stages. Specifically, in the first stage, the approach predicts a complete but coarse-grained point cloud with a collection of parametric surface elements. Then, in the second stage, it merges the coarse-grained prediction with the input point cloud by a novel sampling algorithm. Our method utilizes a joint loss function to guide the distribution of the points. Extensive experiments verify the effectiveness of our method and demonstrate that it outperforms the existing methods in both the Earth Mover's Distance (EMD) and the Chamfer Distance (CD).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Liu, Xinpu, Yanxin Ma, Ke Xu, Ling Wang und Jianwei Wan. „KASiam: Keypoints-Aligned Siamese Network for the Completion of Partial TLS Point Clouds“. Remote Sensing 14, Nr. 15 (28.07.2022): 3617. http://dx.doi.org/10.3390/rs14153617.

Der volle Inhalt der Quelle

Annotation:

Completing point clouds from partial terrestrial laser scannings (TLS) is a fundamental step for many 3D visual applications, such as remote sensing, digital city and autonomous driving. However, existing methods mainly followed an ordinary auto-encoder architecture with only partial point clouds as inputs, and adopted K-Nearest Neighbors (KNN) operations to extract local geometric features, which takes insufficient advantage of input point clouds and has limited ability to extract features from long-range geometric relationships, respectively. In this paper, we propose a keypoints-aligned siamese (KASiam) network for the completion of partial TLS point clouds. The network follows a novel siamese auto-encoder architecture, to learn prior geometric information of complete shapes by aligning keypoints of complete-partial pairs during the stage of training. Moreover, we propose two essential blocks cross-attention perception (CAP) and self-attention augment (SAA), which replace KNN operations with attention mechanisms and are able to establish long-range geometric relationships among points by selecting neighborhoods adaptively at the global level. Experiments are conducted on widely used benchmarks and several TLS data, which demonstrate that our method outperforms other state-of-the-art methods by a 4.72% reduction of the average Chamfer Distance of categories in PCN dataset at least, and can generate finer shapes of point clouds on partial TLS data.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!