We are proudly a Ukrainian website. Our country was attacked by Russian Armed Forces on Feb. 24, 2022.
You can support the Ukrainian Army by following the link: https://u24.gov.ua/.
Even the smallest donation is hugely appreciated!
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Triviallöv".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Talmaciu, Mihai, e Elena Nechita. "On Polar, Trivially Perfect Graphs". International Journal of Computers Communications & Control 5, n.º 5 (1 de dezembro de 2010): 939. http://dx.doi.org/10.15837/ijccc.2010.5.2257.
<p>During the last decades, different types of decompositions have been processed in the field of graph theory. In various problems, for example in the construction of recognition algorithms, frequently appears the so-called weakly decomposition of graphs.<br />Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. Recognizing a polar graph is known to be NP-complete. For this class of graphs, polynomial algorithms for the maximum stable set problem are unknown and algorithms for the dominating set problem are also NP-complete.<br />In this paper we characterize the polar graphs using the weakly decomposition, give a polynomial time algorithm for recognizing graphs that are both trivially perfect and polar, and directly calculate the domination number. For the stability number and clique number, we give polynomial time algorithms. </p>
3
Kochetkov, Yu Yu. "On non-trivially decomposable types". Russian Mathematical Surveys 52, n.º 4 (31 de agosto de 1997): 836–37. http://dx.doi.org/10.1070/rm1997v052n04abeh002070.
Al-harbi, Bashayer, Wafa M. Fakieh e Mohammed Mosa Al-shomrani. "On Non-trivially Associated Tensor Categories". European Journal of Pure and Applied Mathematics 11, n.º 4 (24 de outubro de 2018): 1027–45. http://dx.doi.org/10.29020/nybg.ejpam.v11i4.3322.
The purpose of this article is to provide mathematical formulas for some operationson the objects of a non-trivially associated tensor category constructed from a factorization of a group into a subgroup and a set of left coset representatives. A detailed example is provided.
5
Kwan, Matthew, Benny Sudakov e Pedro Vieira. "Non-trivially intersecting multi-part families". Journal of Combinatorial Theory, Series A 156 (maio de 2018): 44–60. http://dx.doi.org/10.1016/j.jcta.2017.12.001.
Gandal, G. R., e R. Mary Jeya Jothi. "Some classes of Trivially Perfect Graphs". Journal of Physics: Conference Series 1770, n.º 1 (1 de março de 2021): 012074. http://dx.doi.org/10.1088/1742-6596/1770/1/012074.
Al-Shamrani, M. "A Wide Non-Trivially Associated Tensor Category". Journal of King Abdulaziz University-Science 20, n.º 1 (2008): 3–20. http://dx.doi.org/10.4197/sci.20-1.1.
Rubio-Montiel, Christian. "A new characterization of trivially perfect graphs". Electronic Journal of Graph Theory and Applications 3, n.º 1 (1 de abril de 2015): 22–26. http://dx.doi.org/10.5614/ejgta.2015.3.1.3.
Bayer, Daniel, Van Bang Le e H. N. de Ridder. "Probe threshold and probe trivially perfect graphs". Theoretical Computer Science 410, n.º 47-49 (novembro de 2009): 4812–22. http://dx.doi.org/10.1016/j.tcs.2009.06.029.
Drange, Pål Grønås, e Michał Pilipczuk. "A Polynomial Kernel for Trivially Perfect Editing". Algorithmica 80, n.º 12 (28 de dezembro de 2017): 3481–524. http://dx.doi.org/10.1007/s00453-017-0401-6.
Teses / dissertações sobre o assunto "Triviallöv":
1
Kraft, Veronica. "Grön infrastruktur och naturvärden i tätortsnära skog : Analys och åtgärdsförslag för Hallaholm i Åtvidaberg". Thesis, Linnéuniversitetet, Institutionen för biologi och miljö (BOM), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-105125.
Trenden för biologisk mångfald i världen är negativ och skogslevande arter är inget undantag. I denna studie undersöks den tätortsnära, kommunägda skogen Hallaholm i Åtvidaberg, Östergötland. Studien fastställer vilka naturtyper som finns i skogens olika delar och delområdena bedöms utifrån förekomst av de rödlistade arterna ekticka och tallticka samt av fasta strukturer som död ved, lavbeväxta träd, vedsvampar och hålträd. Därtill görs en bedömning av vilken betydelse områdets olika naturtyper har för regionens gröna infrastruktur. Naturtyperna är huvudsakligen ädellöv, triviallöv, tall, gran och gräsmark och studien visar att de högsta naturvärdena och även största betydelsen för grön infrastruktur finns bland ädellöv, triviallöv och gräsmark, till viss del även bland tall och de lägsta värdena finns bland gran. Fem förekomster av tallticka och tre fynd av ekticka är funna. Grundat på resultaten och den inhämtade kunskapen om Hallaholm föreslås åtgärder för att främja den biologiska mångfalden och områdets betydelse för närboendes rekreation. The global trend for biological diversity is negative and that goes also for species living in the forest. This study is investigating the urban forest Hallaholm in Åtvidaberg, Östergötland, which is owned by the municipality. The study concludes the different habitat types which are present in different parts of the forest. The parts are assessed based on the presence of Fomitiporia robusta, Porodaedalea pini and of structures such as dead trees, lichen on trees, poroid fungi and hollow trees. There is also an assessment of the importance of the different habitat types for the green infrastructure in the region. The habitat types are mainly deciduous and broad-leaved deciduous forest, pine, spruce and grassland. This study shows that the highest ecological values and the greatest importance for green infrastructure is found among deciduous forest, broad-leaved deciduous forest and grassland, also partly among pine and the lowest values are found among spruce. New records of Fomitiporia robusta and Porodaedalea pini were noted. Measures on how to increase the biological diversity and the importance of the forest for recreational activities are suggested based on the results and on the collected knowledge of the forest.
2
Al-Shomrani, Mohammed Mosa. "Braided Hopf algebras and non-trivially associated tensor categories". Thesis, Swansea University, 2003. https://cronfa.swan.ac.uk/Record/cronfa42794.
The rigid non-trivially associated tensor category C is constructed from left coset representatives M of a subgroup G of a finite group X. There is also a braided category D made from C by a double construction. In this thesis we consider some basic useful facts about D, including the fact that it is a modular category (modulo a matrix being invertible). Also we give a definition of the character of an object in this category as an element of a braided Hopf algebra in the category. The definition is shown to be adjoint invariant and multiplicative. A detailed example is given. Next we show an equivalence of categories between the non-trivially associated double D and the trivially associated category of representations of the double of the group D(X). Moreover, we show that the braiding for D extends to a partially defined braiding on C, and also we look at an algebra A ∈ C, using this j)artial braiding. Finally, ideas for further research are included.
Livros sobre o assunto "Triviallöv":
1
McCleary, Richard, David McDowall e Bradley J. Bartos. Intervention Modeling. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190661557.003.0005.
The general AutoRegressive Integrated Moving Average (ARIMA) model can be written as the sum of noise and exogenous components. If an exogenous impact is trivially small, the noise component can be identified with the conventional modeling strategy. If the impact is nontrivial or unknown, the sample AutoCorrelation Function (ACF) will be distorted in unknown ways. Although this problem can be solved most simply when the outcome of interest time series is long and well-behaved, these time series are unfortunately uncommon. The preferred alternative requires that the structure of the intervention is known, allowing the noise function to be identified from the residualized time series. Although few substantive theories specify the “true” structure of the intervention, most specify the dichotomous onset and duration of an impact. Chapter 5 describes this strategy for building an ARIMA intervention model and demonstrates its application to example interventions with abrupt and permanent, gradually accruing, gradually decaying, and complex impacts.
2
Schliesser, Eric. The Sympathetic Process and Judgments of Propriety. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190690120.003.0005.
This chapter describes Adam Smith’s views on sympathy and sympathetic judgment(s). It shows that the sympathetic process presupposes and crucially depends on counterfactual, causal reasoning. In particular the chapter argue for four related claims. The first is that according to Smith the sympathetic process depends on a type of causal reasoning that goes well beyond the kind of simulationist theory standardly attributed to him. The second is that the Smithian imagination in the sympathetic process works by way of counterfactual reasoning and that even the feelings we ought to feel as a consequence of the sympathetic process need not be actual, but counterfactual. The third is that Smithian agents are non-trivially understood as belonging to the causal order of nature. This chapter illustrates this third point through an extended digression on Smith’s views on moral luck (the piacular). Fourth, Smithian judgments of propriety are intrinsically judgments about the proportionality of causal relations.
Capítulos de livros sobre o assunto "Triviallöv":
1
Hung, Ling-Ju, Ton Kloks e Chuan Min Lee. "Trivially-Perfect Width". In Lecture Notes in Computer Science, 301–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10217-2_30.
Drange, Pål Grønås, e Michał Pilipczuk. "A Polynomial Kernel for Trivially Perfect Editing". In Algorithms - ESA 2015, 424–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48350-3_36.
Stangl, Rebecca. "Neo-Aristotelian Suberogation". In Neither Heroes nor Saints, 37–58. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780197508459.003.0003.
This chapter develops and defends the following account of neo-Aristotelian suberogation: an action is suberogatory iff it fails to hit the target of a relevant virtue, but is not overall vicious. This account implies that all true instances of suberogation are only trivially bad. Thus, pace influential defenders of suberogation, there are no instances of truly villainous suberogation. This chapter argues that this implication counts in favor of the account insofar as the supposed cases of villainous suberogation offered by those who defend its existence are, unlike those offered in defense of trivial suberogation, wholly unconvincing. So the account correctly identifies just those actions that are suberogatory as suberogatory, and gives a plausible explanation of their suberogatory status.
7
Berto, Francesco, Mark Jago, Rohan French, Graham Priest e David Ripley. "Counterpossible Conditionals". In Impossible Worlds, 267–90. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780198812791.003.0012.
Vacuism is the view that all counterpossibles are trivially true. There are reasons to think it incorrect. An impossible worlds semantics for counterfactuals is offered, which makes room for non-trivial counterpossibles. One principle which pins down its application is the Strangeness of Impossibility condition: for any given possible world, any impossible worlds is further away from it than any possible world is. A number of Williamson’s objections to the non-vacuist approach are discussed and it is argued that they can be overcome. The question of whether counterfactuals in general should permit the substitution of rigidly coreferential terms is then raised. Having defended non-vacusim against Williamson’s objections, a range of arguments in its favour are considered.
8
Warren, Jared. "From Logic to Mathematics". In Shadows of Syntax, 197–208. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780190086152.003.0008.
Part II (chapters 3-7) of the book developed and defended an inferentialist/conventionalist theory of logic. In this, the opening chapter of part III, it is explained why the extension of part II’s approach from logic to mathematics faces significant philosophical challenges. The first major challenge concerns the ontological commitments of mathematics. It is received wisdom in philosophy that existence claims cannot be analytic or trivially true, making it difficult to see how a conventionalist account of mathematics could possibly be viable. The second major challenge concerns mathematical truth. Unlike (first-order) logical truth, mathematical truth, even in basic arithmetic, is computationally rich. There are serious challenges for conventionalists in trying to capture our intuition that mathematical truth is fully determinate, in light of this feature.
9
Moore, A. W. "Ineffability and Nonsense". In Language, World, and Limits, 244–60. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780198823643.003.0018.
Criteria of ineffability are presented which, it is claimed, preclude the possibility of truths that are ineffable, but not the possibility of other things that are ineffable—not even the possibility of other things that are non-trivially ineffable. Specifically, they do not preclude the possibility of states of understanding that are ineffable. This, it is argued, allows for a reappraisal of the dispute between those who adopt a traditional reading of Wittgenstein’s Tractatus and those who adopt the new reading recently championed by Cora Diamond, James Conant, and others. By maintaining that what the nonsense in the Tractatus is supposed to convey is ineffable understanding, rather than ineffable truth, we can do considerable justice to each of these readings. We can also do considerable justice to the Tractatus.
10
Turner, Kenneth J. "Policy-Based Management for Call Control". In Encyclopedia of Multimedia Technology and Networking, Second Edition, 1171–77. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-014-1.ch159.
This article discusses the use of policies to control calls—whether in traditional telephony or in its more modern versions such as mobile telephony or Internet telephony. Call control is as old as telephony. It allows subscribers and the network to manage calls. Trivially, users initiate calls by dialing and terminate calls by hanging up. However, modern telephony offers many more options for managing calls. For example, they may be forwarded if the user is busy or away. Conference calls may be set up. Voicemail and answering services can be used to take messages. The solutions in conventional telephony are, however, relatively limited. This article investigates the relevance to call control of the kinds of policies used to manage computerized and networked systems. As will be seen, policy-based management of call control offers a much more flexible approach.
Trabalhos de conferências sobre o assunto "Triviallöv":
1
Wang, Yanlin, e Bruno C. d. S. Oliveira. "The expression problem, trivially!" In Modularity '16: 15th International Conference on Modularity. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2889443.2889448.
Talmaciu, Mihai, Elena Nechita, Barna Laszlo Iantovics, Enachescu Calin e Florin Gheorghe Filip. "An Algorithm for the Bisection Problem on Trivially Perfect Graphs". In BICS 2008: Proceedings of the 1st International Conference on Bio-Inspired Computational Methods Used for Difficult Problems Solving: Development of Intelligent and Complex Systems. AIP, 2009. http://dx.doi.org/10.1063/1.3130633.
Guan, Yue, Leiting Dong e Satya N. Atluri. "A New Meshless “Fragile Points Method (FPM)” Based on a Galerkin Weak-Form for 2D Flexoelectric Analysis". In ASME 2020 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/imece2020-24527.
Abstract A meshless Fragile Points Method (FPM) is presented for analyzing 2D flexoelectric problems. Local, simple, polynomial and discontinuous trial and test functions are generated with the help of a local meshless differential quadrature approximation of the first three derivatives. Interior Penalty Numerical Fluxes are employed to ensure the consistency of the method. Based on a Galerkin weak-form formulation, the present FPM leads to symmetric and sparse matrices, and avoids the difficulties of numerical integration in the previous meshfree methods. Numerical examples including isotropic and anisotropic materials with flexoelectric and piezoelectric effects are provided as validations. The present method is much simpler than the Finite Element Method, or the Element-Free Galerkin (EFG) and Meshless Local Petrov-Galerkin (MLPG) methods, and the numerical integration of the weak form is trivially simple.
4
Zellmann, Stefan, Martin Aumüller e Ulrich Lang. "Image-Based Remote Real-Time Volume Rendering: Decoupling Rendering From View Point Updates". In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70811.
Remote rendering is employed when the visualization task is too challenging for the hardware used to display a dataset or when it is too time consuming to transfer the complete dataset. Volume visualization with its dataset sizes growing with the 3rd power of their spatial resolution is such a task. Since remote rendering introduces additional sources of latency, its applicability to virtual environments is limited because of the required low delays from user action to displayed image. We counter these latencies with image-based rendering techniques: color image data along with additional depth information is warped, while new data has not been completely received. Using these approximate images, it is possible to decouple the cheap display phase from rendering. While depth values are trivially deduced for polygons, we contribute heuristics for volumetric datasets with varying transparency.
5
Monteiro, Juarez, Roger Granada, Rafael C. Pinto e Rodrigo C. Barros. "Beating Bomberman with Artificial Intelligence". In XV Encontro Nacional de Inteligência Artificial e Computacional. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/eniac.2018.4430.
Artificial Intelligence (AI) seeks to bring intelligent behavior for machines by using specific techniques. These techniques can be employed in order to solve tasks, such as planning paths or controlling intelligent agents. Some tasks that use AI techniques are not trivially testable, since it can handle a high number of variables depending on their complexity. As digital games can provide a wide range of variables, they become an efficient and economical means for testing artificial intelligence techniques. In this paper, we propose a combination of a behavior tree and a Pathfinding algorithm to solve a maze-based problem using the digital game Bomberman of the Nintendo Entertainment System (NES) platform. We perform an analysis of the AI techniques in order to verify the feasibility of future experiments in similar complex environments. Our experiments show that our intelligent agent can be successfully implemented using the proposed approach.
6
Fogle, Martin A., e J. Kirk Wu. "A Relative Coordinate Formulation for Variational Solid Modeling". In ASME 1990 Design Technical Conferences. American Society of Mechanical Engineers, 1990. http://dx.doi.org/10.1115/detc1990-0102.
Abstract A minimal formulation using relative coordinates is presented for variational solid modeling. Computational methods developed for the kinematic modeling of mechanical systems are used to derive a minimal problem formulation. First, the concept of arbitrary coordinates is introduced to reduce the dimension of the constraint vector. Next, the variational problem is divided into two sub-problems. This is done by modeling the problem as a graph, which is then analyzed to identify open loops and decoupled loops. The third method used to reduce the size of the variational problem is to transform the sub-problems from a Cartesian coordinate formulation to a relative coordinate formulation. Once identified, the open loop sub-problem is solved trivially. Finally, the decoupled loop sub-problem is solved by optimization techniques which minimize the total constraint violation. Compared to the traditional approach, the relative coordinate method has a much smaller formulation, is highly convergent, and is able to evaluate under constrained geometry.
7
Garcia-Barcos, Javier, e Ruben Martinez-Cantin. "Fully Distributed Bayesian Optimization with Stochastic Policies". In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/327.
Bayesian optimization has become a popular method for applications, like the design of computer experiments or hyperparameter tuning of expensive models, where sample efficiency is mandatory. These situations or high-throughput computing, where distributed and scalable architectures are a necessity. However, Bayesian optimization is mostly sequential. Even parallel variants require certain computations between samples, limiting the parallelization bandwidth. Thompson sampling has been previously applied for distributed Bayesian optimization. But, when compared with other acquisition functions in the sequential setting, Thompson sampling is known to perform suboptimally. In this paper, we present a new method for fully distributed Bayesian optimization, which can be combined with any acquisition function. Our approach considers Bayesian optimization as a partially observable Markov decision process. In this context, stochastic policies, such as the Boltzmann policy, have some interesting properties which can also be studied for Bayesian optimization. Furthermore, the Boltzmann policy trivially allows a distributed Bayesian optimization implementation with high level of parallelism and scalability. We present results in several benchmarks and applications that shows the performance of our method.
8
Agarwal, Mukul. "Near-Optimal Mixing Allocation for Traded Products and Prices". In ASME 2014 12th Biennial Conference on Engineering Systems Design and Analysis. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/esda2014-20566.
Modern flour mills continuously mix up to 80 intermediate flour streams into 3–6 final streams, whereby each intermediate stream can be allocated to only one final stream. All streams are characterized by several intensive properties and a yield. The decision for mixing allocation involves maximizing the total sale value of all final streams, such that each of them corresponds, with respect to its property ranges, to a flour that can be sold on the trade market. The decision must thereby respect any constraints on the allocation variable and on the yields of the final streams. In this work, a tool is developed that automatically performs the discrete optimization for the allocation problem and outputs the best mixing decision for the given situation. Using heuristics-based optimization, the tool respects all constraints, selects the most lucrative combination from all possible traded flours, and determines the allocation of each intermediate stream to one of the selected traded flours. The optimization method can accommodate nonlinear mixing rules. The tool can trivially be extended to other mixing allocation problems, e.g., to select input streams with minimal total cost to mix to a single output stream with specified property and yield ranges.
9
Bouzit, Djamel, e Christophe Pierre. "Localization of Vibration in Disordered Multi-Span Beams With Damping". In ASME 1993 Design Technical Conferences. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/detc1993-0166.
Abstract The combined effects of disorder and structural damping on the dynamics of a multi-span beam with slight randomness in the spacing between supports are investigated. A wave transfer matrix approach is chosen to calculate the free and forced harmonic responses of this nearly periodic structure. It is shown that both harmonic waves and normal modes of vibration that extend throughout the ordered, undamped beam become spatially attenuated if either small damping or small disorder is present in the system. The physical mechanism which causes this attenuation, however, is one of energy dissipation in the case of damping but one of energy confinement in the case of disorder. The corresponding rates of spatial exponential decay are estimated by applying statistical perturbation methods. It is found that the effects of damping and disorder simply superpose for a multi-span beam with strong interspan coupling, but interact less trivially in the weak coupling case. Furthermore, the effect of disorder is found to be small relative to that of damping in the case of strong interspan coupling, but of comparable magnitude for weak coupling between spans. The adequacy of the statistical analysis to predict accurately localization in finite disordered beams with boundary conditions is also examined.
10
Jain, Arjit, Pranay Reddy Samala, Preethi Jyothi, Deepak Mittal e Maneesh Singh. "Perturb, Predict & Paraphrase: Semi-Supervised Learning using Noisy Student for Image Captioning". In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/105.
Recent semi-supervised learning (SSL) methods are predominantly focused on multi-class classification tasks. Classification tasks allow for easy mixing of class labels during augmentation which does not trivially extend to structured outputs such as word sequences that appear in tasks like image captioning. Noisy Student Training is a recent SSL paradigm proposed for image classification that is an extension of self-training and teacher-student learning. In this work, we provide an in-depth analysis of the noisy student SSL framework for the task of image captioning and derive state-of-the-art results. The original algorithm relies on computationally expensive data augmentation steps that involve perturbing the raw images and computing features for each perturbed image. We show that, even in the absence of raw image augmentation, the use of simple model and feature perturbations to the input images for the student model are beneficial to SSL training. We also show how a paraphrase generator could be effectively used for label augmentation to improve the quality of pseudo labels and significantly improve performance. Our final results in the limited labeled data setting (1% of the MS-COCO labeled data) outperform previous state-of-the-art approaches by 2.5 on BLEU4 and 11.5 on CIDEr scores.
