Готові списки джерел за темами / Assumption-Based

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Assumption-Based"

Автор: Grafiati

Опубліковано: 11 березня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Assumption-Based".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Assumption-Based"

Woods, E. A. "Assumption Based Modeling." IFAC Proceedings Volumes 26, no. 2 (July 1993): 33–38. http://dx.doi.org/10.1016/s1474-6670(17)48421-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

de Kleer, Johan. "An assumption-based TMS." Artificial Intelligence 28, no. 2 (March 1986): 127–62. http://dx.doi.org/10.1016/0004-3702(86)90080-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kohlas, J., B. Anrig, R. Haenni, and P. A. Monney. "Model-based diagnostics and probabilistic assumption-based reasoning." Artificial Intelligence 104, no. 1-2 (September 1998): 71–106. http://dx.doi.org/10.1016/s0004-3702(98)00060-5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hao, Zhonghua, Shiwei Ma, Hui Chen, and Jingjing Liu. "Dataset Denoising Based on Manifold Assumption." Mathematical Problems in Engineering 2021 (January 18, 2021): 1–14. http://dx.doi.org/10.1155/2021/6432929.

Повний текст джерела

Анотація:

Learning the knowledge hidden in the manifold-geometric distribution of the dataset is essential for many machine learning algorithms. However, geometric distribution is usually corrupted by noise, especially in the high-dimensional dataset. In this paper, we propose a denoising method to capture the “true” geometric structure of a high-dimensional nonrigid point cloud dataset by a variational approach. Firstly, we improve the Tikhonov model by adding a local structure term to make variational diffusion on the tangent space of the manifold. Then, we define the discrete Laplacian operator by graph theory and get an optimal solution by the Euler–Lagrange equation. Experiments show that our method could remove noise effectively on both synthetic scatter point cloud dataset and real image dataset. Furthermore, as a preprocessing step, our method could improve the robustness of manifold learning and increase the accuracy rate in the classification problem.

Стилі APA, Harvard, Vancouver, ISO та ін.

Toni, Francesca. "A tutorial on assumption-based argumentation." Argument & Computation 5, no. 1 (January 2, 2014): 89–117. http://dx.doi.org/10.1080/19462166.2013.869878.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Heyninck, Jesse, and Ofer Arieli. "Simple contrapositive assumption-based argumentation frameworks." International Journal of Approximate Reasoning 121 (June 2020): 103–24. http://dx.doi.org/10.1016/j.ijar.2020.02.011.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Craven, Robert, and Francesca Toni. "Argument graphs and assumption-based argumentation." Artificial Intelligence 233 (April 2016): 1–59. http://dx.doi.org/10.1016/j.artint.2015.12.004.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

He, Jinrong, Lixin Ding, Lei Jiang, Zhaokui Li, and Qinghui Hu. "Intrinsic dimensionality estimation based on manifold assumption." Journal of Visual Communication and Image Representation 25, no. 5 (July 2014): 740–47. http://dx.doi.org/10.1016/j.jvcir.2014.01.006.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Schulz, Claudia, and Francesca Toni. "Labellings for assumption-based and abstract argumentation." International Journal of Approximate Reasoning 84 (May 2017): 110–49. http://dx.doi.org/10.1016/j.ijar.2017.02.005.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Brim, Luboš, Karen Yorav, and Jitka Žídková. "Assumption-based distribution of CTL model checking." International Journal on Software Tools for Technology Transfer 7, no. 1 (December 14, 2004): 61–73. http://dx.doi.org/10.1007/s10009-004-0163-8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Assumption-Based"

Fan, Xiuyi. "Assumption-based argumentation dialogues." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/10560.

Повний текст джерела

Анотація:

Formal argumentation based dialogue models have attracted some research interests recently. Within this line of research, we propose a formal model for argumentation-based dialogues between agents, using assumption-based argumentation (ABA). Thus, the dialogues amount to conducting an argumentation process in ABA. The model is given in terms of ABA-specific utterances, debate trees and forests implicitly built during and drawn from dialogues, legal-move functions (amounting to protocols) and outcome functions. Moreover, we investigate the strategic behaviour of agents in dialogues, using strategy-move functions. We instantiate our dialogue model in a range of dialogue types studied in the literature, including information-seeking, inquiry, persuasion, conflict resolution, and discovery. Finally, we prove (1) a formal connection between dialogues and well-known argumentation semantics, and (2) soundness and completeness results for our dialogue models and dialogue strategies used in different dialogue types.

Стилі APA, Harvard, Vancouver, ISO та ін.

Hamlet, I. M. "Assumption based temporal reasoning in medicine." Thesis, University of Sussex, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.235351.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cyras, Kristijonas. "ABA+ : assumption-based argumentation with preferences." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/58340.

Повний текст джерела

Анотація:

This thesis focuses on using (computational) argumentation theory to model common-sense reasoning with preferences. Common-sense reasoning entails dealing with incomplete, uncertain and conflicting information. Argumentation as a branch of Artificial Intelligence (AI) provides means to reason with such information in a formal way. An important aspect of commonsense reasoning is reasoning with preference information. As such, dealing with preferences is an important phenomenon in argumentation. Through our research, we aim to contribute to the understanding of preference information treatment in argumentation and common-sense reasoning, as well as AI at large. Our objective is to equip a well established structured argumentation formalism - Assumption-Based Argumentation (ABA) - with a new preference handling mechanism. To this end, we propose an extension of ABA, called ABA+, where preferences are accounted for by reversing attacks. This yields a novel way of dealing with preference information in structured argumentation. We also advance a new property concerning contraposition of rules, called Weak Contraposition, applicable to ABA+, and, potentially, to generic approaches to rule-based reasoning with preferences. We argue that ABA+ (with and without Weak Contraposition) exhibits various desirable formal properties concerning argumentation and/or preference handling. We analyse ABA+ in the context of other formalisms of argumentation with preferences and contend advantages of ABA+.

Стилі APA, Harvard, Vancouver, ISO та ін.

Dugdale, Julie Anne. "Cooperative problem-solving using assumption-based truth maintenance." Thesis, University of Buckingham, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.601371.

Повний текст джерела

Анотація:

Classical expert systems have been criticised for ignoring the problem-solving ability of the user. The ramifications of this are more than just a reduced problem-solving capability. By excluding the knowledge of the user, the knowledge-base of the system is incomplete as it is infeasible to capture all the relevant factors. Furthermore, users become alienated as they do not have the opportunity to "adapt the situation according to their skills. In many cases the conclusions of the expert system are rejected, or the user's responsibility is abrogated, because the user cannot influence the decision. In response to these criticisms a new type of system is emerging - the Cooperative Problem-solving System. Such systems provide a dynamic interactive environment in which the user and the system work together to derive a solution. A cooperative approach is appropriate in two situations. The first situation is when a problem can be broken down into sub-problems which can then be assigned to the various participants. The second situation is when the relative merits of independently derived solutions need to be investigated by participants in order to arrive at a solution that is mutually acceptable. This thesis is concerned with cooperation which falls into the latter category. The cooperative system developed in this work is the first to study cooperation in this respect. The domain chosen to implement the cooperative problem-solving system is investment management. The process of investment management described in this work is based upon the approach used by the Product Operations division of International Computers Limited (ICL). Investment management is ideal because of the nature of the reasoning used and the type of cooperative interaction that takes place. Until now, the application of such a system to investment management has not been explored. Previous methods for analysing cooperation focus on the identification and assignment of individual tasks to the various agents. These methods are therefore inappropriate to the interpretation of cooperation used in this work. The functions necessary to provide a cooperative environment have been identified by developing a new approach to analysing cooperation. Central to this approach are the transcripts obtained from management meetings. This data was supplemented by devising a case-study and running simulated meetings. Seven functions that a cooperative problem-solving system should provide were identified from the transcripts: information provision, problem-solving, explanation, user-modelling, constraint recognition, problem-modelling, and confirmation. The individual identification of these functions is not new. The novelty in this work stems from the collective use of the functions for cooperation.

Стилі APA, Harvard, Vancouver, ISO та ін.

Drummond, Mark Edwin. "Plan nets : a formal representation of action and belief for 'automatic planning systems'." Thesis, University of Edinburgh, 1986. http://hdl.handle.net/1842/19705.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Waldvogel, Mark Carleton University Dissertation Computer Science. "Metaplanning using time-relation constraints and assumption-based reasoning." Ottawa, 1986.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bayer, S. G. M. "Practical zero-knowledge protocols based on the discrete logarithm assumption." Thesis, University College London (University of London), 2014. http://discovery.ucl.ac.uk/1416402/.

Повний текст джерела

Анотація:

Zero-knowledge proofs were introduced by Goldwasser, Micali, and Rackoff. A zero-knowledge proof allows a prover to demonstrate knowledge of some information, for example that they know an element which is a member of a list or which is not a member of a list, without disclosing any further information about that element. Existing constructions of zero-knowledge proofs which can be applied to all languages in NP are impractical due to their communication and computational complexity. However, it has been known since Guillou and Quisquater's identification protocol from 1988 and Schnorr's identification protocol from 1991 that practical zero-knowledge protocols for specific problems exist. Because of this, a lot of work was undertaken over the recent decades to find practical zero-knowledge proofs for various other specific problems, and in recent years many protocols were published which have improved communication and computational complexity. Nevertheless, to find more problems which have an efficient and practical zero-knowledge proof system and which can be used as building blocks for other protocols is an ongoing challenge of modern cryptography. This work addresses the challenge, and constructs zero-knowledge arguments with sublinear communication complexity, and achievable computational demands. The security of our protocols is only based on the discrete logarithm assumption. Polynomial evaluation arguments are proposed for univariate polynomials, for multivariate polynomials, and for a batch of univariate polynomials. Furthermore, the polynomial evaluation argument is applied to construct practical membership and non-membership arguments. Finally, an efficient method for proving the correctness of a shuffle is proposed. The proposed protocols have been tested against current state of the art versions in order to verify their practicality in terms of run-time and communication cost. We observe that the performance of our protocols is fast enough to be practical for medium range parameters. Furthermore, all our verifiers have a better asymptotic behavior than earlier verifiers independent of the parameter range, and in real life settings our provers perform better than provers of existing protocols. The analysis of the results shows that the communication cost of our protocols is very small; therefore, our new protocols compare very favorably to the current state of the art.

Стилі APA, Harvard, Vancouver, ISO та ін.

Tian, Chun. "Assumption-Based Runtime Verification of Finite- and Infinite-State Systems." Doctoral thesis, Università degli studi di Trento, 2022. https://hdl.handle.net/11572/357167.

Повний текст джерела

Анотація:

Runtime Verification (RV) is usually considered as a lightweight automatic verification technique for the dynamic analysis of systems, where a monitor observes executions produced by a system and analyzes its executions against a formal specification. If the monitor were synthesized, in addition to the monitoring specification, also from extra assumptions on the system behavior (typically described by a model as transition systems), then it may output more precise verdicts or even be predictive, meanwhile it may no longer be lightweight, since monitoring under assumptions has the same computation complexity with model checking. When suitable assumptions come into play, the monitor may also support partial observability, where non-observable variables in the specification can be inferred from observables, either present or historical ones. Furthermore, the monitors are resettable, i.e. being able to evaluate the specification at non-initial time of the executions while keeping memories of the input history. This helps in breaking the monotonicity of monitors, which, after reaching conclusive verdicts, can still change its future outputs by resetting its reference time. The combination of the above three characteristics (assumptions, partial observability and resets) in the monitor synthesis is called the Assumption-Based Runtime Verification, or ABRV. In this thesis, we give the formalism of the ABRV approach and a group of monitoring algorithms based on specifications expressed in Linear Temporal Logic with both future and past operators, involving Boolean and possibly other types of variables. When all involved variables have finite domain, the monitors can be synthesized as finite-state machines implemented by Binary Decision Diagrams. With infinite-domain variables, the infinite-state monitors are based on satisfiability modulo theories, first-order quantifier elimination and various model checking techniques. In particular, Bounded Model Checking is modified to do its work incrementally for efficiently obtaining inconclusive verdicts, before IC3-based model checkers get involved. All the monitoring algorithms in this thesis are implemented in a tool called NuRV. NuRV support online and offline monitoring, and can also generate standalone monitor code in various programming languages. In particular, monitors can be synthesized as SMV models, whose behavior correctness and some other properties can be further verified by model checking.

Стилі APA, Harvard, Vancouver, ISO та ін.

Liu, Huizeng. "Ocean color atmospheric correction based on black pixel assumption over turbid waters." HKBU Institutional Repository, 2019. https://repository.hkbu.edu.hk/etd_oa/623.

Повний текст джерела

Анотація:

Accurate retrieval of water-leaving reflectance from satellite-sensed signal is decisive for ocean color applications, because water-leaving radiance only account for less than 10% of satellite-sensed radiance. The standard atmospheric correction algorithm relies on black pixel assumption, which assumes negligible water-radiance reflectance at the near-infrared (NIR) bands. The standard NIR-based algorithm generally works well for waters where the NIR water-leaving radiance is negligible or can be properly accounted for. However, the black pixel assumption does not hold over turbid waters, which results in biased retrievals of remote sensing reflectance (Rrs). Therefore, this study aimed to improve atmospheric correction over turbid waters. Based on Sentinel-3, two ways to cope with nonzero NIR water-leaving reflectance were explored. First, this study proposed to use artificial neural networks to estimate and correct NIR water-leaving reflectance at TOA (ANN-NIR algorithm). The rationale of it is that hydrosol optical properties are much simpler at NIR spectral region, where pure water absorptions are the dominant factor. The proposed algorithm outperformed the standard NIR-based algorithm over highly turbid waters. Considering results demonstrated in this study, ANN-NIR algorithm should be useful for ocean color sensors with less than two SWIR bands. Second, this study adapted the SWIR-based algorithm for atmospheric correction of Sentinel-3 OLCI by coupling with the two SWIR bands of SLSTR. Three SWIR band combinations were tested: 1020 and 1613, 1020 and 2256, and 1613 and 2256 nm. The SWIR-based algorithm obviously performed better than NIR-based algorithm over highly turbid waters, while the NIR-based is still preferred for clear to moderately turbid waters. The SWIR band of 1020 nm combined with either SWIR band of 1613 or 2256 nm is recommended for the SWIR-based algorithm except for extremely turbid waters, because the band of 1020 nm has better radiometric performance. Over extremely turbid waters, the band combination of 1613 and 2256 nm should be used, since the water-leaving reflectance is still non-negligible at the band of 1020 nm over these waters. Considering atmospheric correction performance obtained by the NIR- and SWIR-based algorithms, the NIR-based and SWIR-based algorithm are practically applied over clear and turbid waters, respectively. This study revisited the effectiveness of the turbidity index for the current NIR-SWIR switching scheme. The turbidity index calculated from aerosol reflectance varies from 0.7 to 2.2, which is not close to one as expected. In addition to water-leaving reflectance, its value also depends on the spectral shape of aerosol reflectance, which varies with aerosol size distributions, aerosol optical thickness, relative humidity and observing geometries. To address this problem, this study proposed a framework to determine switching threshold for the NIR-SWIR algorithm. An Rrs threshold was determined for each MODIS land band centered at 469, 555, 645 and 859 nm, respectively. Their thresholds are 0.009, 0.016, 0.009 and 0.0006 sr-1, respectively. However, Rrs(469) tends to select SWIR-based algorithm wrongly for clear waters, while NIR-SWIR switching based on Rrs(859) tends to produce patchy patterns. By contrast, NIR-SWIR switching based on Rrs(555) with a threshold of 0.016 sr-1 and Rrs(645) with a threshold of 0.009 sr-1 produced reasonable results. Considering the contrasted estuarine and coastal waters, combined applications of NIR- and SWIR-based algorithm with the switching scheme should be useful for these waters. This study will contribute to better ocean color atmospheric corrections over turbid waters. Atmospheric correction algorithms based on black pixel assumption have been implemented and tested in this study, while combined applications of NIR-based and SWIR-based algorithms are recommended over contrasted transitional waters. However, further studies would still be required to further improve and validate atmospheric correction algorithms over turbid waters.

Стилі APA, Harvard, Vancouver, ISO та ін.

Schulz, Claudia. "Developments in abstract and assumption-based argumentation and their application in logic programming." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/56062.

Повний текст джерела

Анотація:

Logic Programming (LP) and Argumentation are two paradigms for knowledge representation and reasoning under incomplete information. Even though the two paradigms share common features, they constitute mostly separate areas of research. In this thesis, we present novel developments in Argumentation, in particular in Assumption-Based Argumentation (ABA) and Abstract Argumentation (AA), and show how they can 1) extend the understanding of the relationship between the two paradigms and 2) provide solutions to problematic reasoning outcomes in LP. More precisely, we introduce assumption labellings as a novel way to express the semantics of ABA and prove a more straightforward relationship with LP semantics than found in previous work. Building upon these correspondence results, we apply methods for argument construction and conflict detection from ABA, and for conflict resolution from AA, to construct justifications of unexpected or unexplained LP solutions under the answer set semantics. We furthermore characterise reasons for the non-existence of stable semantics in AA and apply these findings to characterise different scenarios in which the computation of meaningful solutions in LP under the answer set semantics fails.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Assumption-Based"

Dewar, James A. Assumption-based planning for Army 21. Santa Monica, CA: Rand, 1992.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

1960-, Isaacson Jeffrey A., Leed Maren, United States Army, and Arroyo Center, eds. Assumption-based planning and Force XXI. Santa Monica, CA: Rand, 1997.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dicke, Ralf. Strategische Unternehmensplanung mit Hilfe eines Assumption-based-truth-maintenance-Systems (ATMS): Formalisierung eines Kontingenzansatzes in Pra dikatenlogik und Anpassungsplanung nach dem Net-change-Prinzip. Wiesbaden: Dt. Univ.-Verl., 2007.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Assumption-Based Planning. Cambridge University Press, 2002.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Blokdyk, Gerardus. Assumption Based Planning a Complete Guide - 2020 Edition. Emereo Pty Limited, 2020.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dewar, James A. Assumption-based Planning: A Tool for Reducing Avoidable Surprises. Cambridge University Press, 2002.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dewar, James A. Assumption-Based Planning: A Tool for Reducing Avoidable Surprises. Cambridge University Press, 2009.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Assumption-based planning: A planning tool for very uncertain times. Santa Monica, CA: Rand, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dewar, J. A. Assumption-Based Planning: A Planning Tool for Very Uncertain Times. RAND Corporation, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Strategische Unternehmensplanung mit Hilfe eines Assumption-based-Truth-Maintenance-Systems (ATMS). Wiesbaden: DUV, 2007. http://dx.doi.org/10.1007/978-3-8350-9389-8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Assumption-Based"

Dung, Phan Minh, Robert A. Kowalski, and Francesca Toni. "Assumption-Based Argumentation." In Argumentation in Artificial Intelligence, 199–218. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-98197-0_10.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kohlas, Jürg, and Paul-André Monney. "Probabilistic Assumption-Based Reasoning." In Lecture Notes in Economics and Mathematical Systems, 82–135. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-662-01674-9_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dressler, Oskar. "Assumption-based Truth Maintenance." In Begründungsverwaltung, 63–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-642-73385-7_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Heyninck, Jesse, and Ofer Arieli. "Simple Contrapositive Assumption-Based Frameworks." In Logic Programming and Nonmonotonic Reasoning, 75–88. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-20528-7_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hung, Nguyen Duy. "Computing Probabilistic Assumption-Based Argumentation." In PRICAI 2016: Trends in Artificial Intelligence, 152–66. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-42911-3_13.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hickey, Randy, and Fahiem Bacchus. "Speeding Up Assumption-Based SAT." In Lecture Notes in Computer Science, 164–82. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-24258-9_11.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Anrig, B., R. Haenni, J. Kohlas, and N. Lehmann. "Assumption-based modeling using ABEL." In Qualitative and Quantitative Practical Reasoning, 171–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0035621.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liu, Weiru. "Assumption-Based Truth Maintenance Systems." In Propositional, Probabilistic and Evidential Reasoning, 183–95. Heidelberg: Physica-Verlag HD, 2001. http://dx.doi.org/10.1007/978-3-7908-1811-6_8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Geller, Felix, and Michael Veksler. "Assumption-Based Pruning in Conditional CSP." In Principles and Practice of Constraint Programming - CP 2005, 241–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564751_20.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fan, Xiuyi, and Francesca Toni. "Decision Making with Assumption-Based Argumentation." In Theory and Applications of Formal Argumentation, 127–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54373-9_9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Assumption-Based"

Lv, Jixin, Yukinori Kobayashi, Yohei Hoshino, and Takanori Emaru. "Slope detection based on orthogonal assumption." In 2012 IEEE/SICE International Symposium on System Integration (SII 2012). IEEE, 2012. http://dx.doi.org/10.1109/sii.2012.6427271.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Sá, Samy, and João Alcântara. "Interpretations and models for assumption-based argumentation." In SAC '19: The 34th ACM/SIGAPP Symposium on Applied Computing. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3297280.3297392.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wei, Pengfei, and Yiping Ke. "Knowledge Transfer based on Multiple Manifolds Assumption." In CIKM '19: The 28th ACM International Conference on Information and Knowledge Management. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3357384.3357953.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

duy Hung, Nguyen. "Probabilistic assumption-based argumentation with DST evidence." In 2017 Joint 17th World Congress of International Fuzzy Systems Association and 9th International Conference on Soft Computing and Intelligent Systems (IFSA-SCIS). IEEE, 2017. http://dx.doi.org/10.1109/ifsa-scis.2017.8023355.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wada, Shin-ichi, and Yoshiyuki Koseki. "An assumption-based localization technique for switching system." In the second international conference. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/66617.66618.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Deng, Ruiling, Gang Zeng, Rui Gan, and Hongbin Zha. "Image-based building reconstruction with Manhattan-world assumption." In 2011 First Asian Conference on Pattern Recognition (ACPR 2011). IEEE, 2011. http://dx.doi.org/10.1109/acpr.2011.6892193.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wen Yang and Hongyi Zhang. "Blind source separation based on K-SCA assumption." In 2010 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccsit.2010.5564818.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cramer, Ronald, and Victor Shoup. "Signature schemes based on the strong RSA assumption." In the 6th ACM conference. New York, New York, USA: ACM Press, 1999. http://dx.doi.org/10.1145/319709.319716.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

He, Zifen, and Yinhui Zhang. "Dynamic Scenario Segmentation based on Target Assumption Sort." In 2015 International Conference on Intelligent Systems Research and Mechatronics Engineering. Paris, France: Atlantis Press, 2015. http://dx.doi.org/10.2991/isrme-15.2015.283.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Nguyen, M. T. T., C. L. D. A. Mai, and N. M. Kwok. "Estimating image illuminant color based on gray world assumption." In 2011 4th International Congress on Image and Signal Processing (CISP). IEEE, 2011. http://dx.doi.org/10.1109/cisp.2011.6100321.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Assumption-Based"

Mosher, Alan M., Brian F. Waters, and Robert C. Johnson. Assumption Based Campaign Planning. Fort Belvoir, VA: Defense Technical Information Center, May 2002. http://dx.doi.org/10.21236/ada403827.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, Stefan Borgwardt, and Marcel Lippmann. Temporal Conjunctive Queries in Expressive DLs with Non-simple Roles. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.222.

Повний текст джерела

Анотація:

In Ontology-Based Data Access (OBDA), user queries are evaluated over a set of facts under the open world assumption, while taking into account background knowledge given in the form of a Description Logic (DL) ontology. Motivated by situation awareness applications, temporal conjunctive queries (TCQs) have recently been proposed as a useful extension of traditional OBDA to support the processing of temporal information. This paper extends the existing complexity analysis of TCQ entailment to very expressive DLs underlying the OWL 2 standard, and in contrast to previous work also allows for queries containing transitive roles.

Стилі APA, Harvard, Vancouver, ISO та ін.

Borgwardt, Stefan, and Veronika Thost. Temporal Query Answering in DL-Lite with Negation. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.221.

Повний текст джерела

Анотація:

Ontology-based query answering augments classical query answering in databases by adopting the open-world assumption and by including domain knowledge provided by an ontology. We investigate temporal query answering w.r.t. ontologies formulated in DL-Lite, a family of description logics that captures the conceptual features of relational databases and was tailored for efficient query answering. We consider a recently proposed temporal query language that combines conjunctive queries with the operators of propositional linear temporal logic (LTL). In particular, we consider negation in the ontology and query language, and study both data and combined complexity of query entailment.

Стилі APA, Harvard, Vancouver, ISO та ін.

Thost, Veronika, Jan Holste, and Özgür Özçep. On Implementing Temporal Query Answering in DL-Lite. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.218.

Повний текст джерела

Анотація:

Ontology-based data access augments classical query answering over fact bases by adopting the open-world assumption and by including domain knowledge provided by an ontology. We implemented temporal query answering w.r.t. ontologies formulated in the Description Logic DL-Lite. Focusing on temporal conjunctive queries (TCQs), which combine conjunctive queries via the operators of propositional linear temporal logic, we regard three approaches for answering them: an iterative algorithm that considers all data available; a window-based algorithm; and a rewriting approach, which translates the TCQs to be answered into SQL queries. Since the relevant ontological knowledge is already encoded into the latter queries, they can be answered by a standard database system. Our evaluation especially shows that implementations of both the iterative and the window-based algorithm answer TCQs within a few milliseconds, and that the former achieves a constant performance, even if data is growing over time.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ahwireng-Obeng, Asabea Shirley, and Frederick Ahwireng-Obeng. Private Philanthropic Cross-Border Flows and Sustainable Development in Africa. Centre on African Philanthropy and Social Investment, August 2011. http://dx.doi.org/10.47019/2021.ra1.

Повний текст джерела

Анотація:

The paper examines the simultaneous impact of private philanthropic cross-border funding from international foundations on the economic, social, and environmental dimensions of sustainable development in Africa. The vector error correction model (VECM) was used, and contrary to expectations drawn from past studies, funding from this source improves economic growth, advances human development, and enhances environmental quality. Causality test results also disconfirmed the assumption that interactions among the three dimensions were positive and complementary in the long term. The environment variable was found to be noncomplementary. Based on these unique results, theoretical propositions are made with an underlying mechanism of action. Practical and policy implications, limitations, and directions for future research are discussed.

Стилі APA, Harvard, Vancouver, ISO та ін.

Loignon, Andrew, and Stephanie Wormington. Psychologically Safe for Some, but Not All? The Downsides of Assuming Shared Psychological Safety among Senior Leadership Teams. Center for Creative Leadership, 2022. http://dx.doi.org/10.35613/ccl.2022.2048.

Повний текст джерела

Анотація:

"In this Research Insights paper, we challenge the assumption that team members perceive similar levels of psychological safety and consider how different patterns of psychological safety matter for team effectiveness. Based on data from 278 intact senior leadership teams, our results provide three key insights: More than half (62%) of senior leadership teams in our sample demonstrated significant variability around their team’s psychological safety. We identified six prototypical patterns of psychological safety among teams, with only one representing a shared view of psychological safety. Other patterns represented dissenting views of greater or less psychological safety. Patterns of psychological safety matter for team effectiveness. Teams whose members report greater agreement around psychological safety exhibit some of the highest levels of performance and lowest levels of interpersonal conflict. Based on these findings, we consider important implications for how leaders can cultivate psychological safety in their teams."

Стилі APA, Harvard, Vancouver, ISO та ін.

Escobar Hernández, José Carlos. Working paper PUEAA No. 15. Teaching Spanish to Japanese students: The students’ profile, their needs and their learning style. Universidad Nacional Autónoma de México, Programa Universitario de Estudios sobre Asia y África, 2022. http://dx.doi.org/10.22201/pueaa.013r.2022.

Повний текст джерела

Анотація:

This paper focuses on the Japanese students’ learning process when they study Spanish as a second language. First, it mentions some students’ profile characteristic and their interests in learning a new language. Second, it describes the learning language system in Japan, the students’ behavior in the language classes, and which activities they prefer to do in class. In addition, it describes different kinds of learning methods that could be applied depending on the students’ interests and cultural differences. Finally, the author considers that teaching Spanish to Japanese students raises several issues that have to be attended in order to achieve success. Since learning a language implies hard work and effort, teachers must try different methods and approaches relying upon scientific evidence based on one fundamental assumption: people learn by doing things themselves.

Стилі APA, Harvard, Vancouver, ISO та ін.

Borgwardt, Stefan, and Veronika Thost. Temporal Query Answering in EL. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.214.

Повний текст джерела

Анотація:

Context-aware systems use data about their environment for adaptation at runtime, e.g., for optimization of power consumption or user experience. Ontology-based data access (OBDA) can be used to support the interpretation of the usually large amounts of data. OBDA augments query answering in databases by dropping the closed-world assumption (i.e., the data is not assumed to be complete any more) and by including domain knowledge provided by an ontology. We focus on a recently proposed temporalized query language that allows to combine conjunctive queries with the operators of the well-known propositional temporal logic LTL. In particular, we investigate temporalized OBDA w.r.t. ontologies in the DL EL, which allows for efficient reasoning and has been successfully applied in practice. We study both data and combined complexity of the query entailment problem.

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, Stefan Borgwardt, and Marcel Lippmann. On the Complexity of Temporal Query Answering. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.191.

Повний текст джерела

Анотація:

Ontology-based data access (OBDA) generalizes query answering in databases towards deduction since (i) the fact base is not assumed to contain complete knowledge (i.e., there is no closed world assumption), and (ii) the interpretation of the predicates occurring in the queries is constrained by axioms of an ontology. OBDA has been investigated in detail for the case where the ontology is expressed by an appropriate Description Logic (DL) and the queries are conjunctive queries. Motivated by situation awareness applications, we investigate an extension of OBDA to the temporal case. As query language we consider an extension of the well-known propositional temporal logic LTL where conjunctive queries can occur in place of propositional variables, and as ontology language we use the prototypical expressive DL ALC. For the resulting instance of temporalized OBDA, we investigate both data complexity and combined complexity of the query entailment problem.

Стилі APA, Harvard, Vancouver, ISO та ін.

Visaria, Leela, and Pravin Visaria. Prospective population growth and policy options for India, 1991–2101. Population Council, 1996. http://dx.doi.org/10.31899/rh1996.1023.

Повний текст джерела

Анотація:

India, the second most populous country in the world, experienced an accelerated decline in fertility during the 1980s. As a result, India’s total fertility rate (TFR) in 1993, 3.5 births per woman, is below the level presumed in the population projections of the United Nations and the World Bank. This favorable development has occurred as India is attempting to reorient its family planning program to focus on the reproductive health of women and the health and welfare of children. The method-specific targets for contraceptive acceptors assigned to every grassroots health worker were abandoned in April 1996. Against this backdrop, this paper seeks to analyze the components of future population growth in India based on a series of hypothetical projections using alternative assumptions about the future decline in fertility. Only one assumption is made about the pace of mortality decline. The likely consequences of the prospective population growth and the policy options for accelerating fertility decline are also discussed.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!