Relevant bibliographies by topics / Ranking verification

Academic literature on the topic 'Ranking verification'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Ranking verification.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Ranking verification"

1

Encrenaz, Emmanuelle, and Alain Finkel. "Automatic Verification of Counter Systems With Ranking Function." Electronic Notes in Theoretical Computer Science 239 (July 2009): 85–103. http://dx.doi.org/10.1016/j.entcs.2009.05.032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Stepanyuk, O. I., and V. P. Novosad. "Verification of final ranking which received because of the expert evaluation." Scientific Messenger of LNU of Veterinary Medicine and Biotechnologies 21, no. 93 (November 16, 2019): 96–101. http://dx.doi.org/10.32718/nvlvet-e9319.

Full text
Abstract:
In the modern dynamic information society, situations that are characterized by complexity, multifactoriality, uncertainty, and non-formalization occur very often. Under such conditions, the adoption of effective management decisions is impossible without interaction with the expert environment. This applies to a wide range of human activities, including economic issues. The article is devoted to one of the key stages of expert evaluation – the analysis of members of expert commissions’ judgments and drawing up final conclusions. The author aims to get closer to solving one of the key problems characteristic to this stage, namely: truth verification problems, reliability confirmation for final conclusions obtained as a result of generalization of expert groups’ work. Most often, the experts are asked to compare certain objects according to certain criteria, to identify the best and the worst among them. It is clear that expert judgments are rarely unanimous. Therefore, it is important to apply scientific approaches to constructing final ranking, that is, the final location of objects in order of increase or decrease of a certain quality or usability. The mathematical modeling of activity of an expert group conducted by the author of the article made it possible to identify cases where, depending on the applied techniques, the final rankings obtained on the basis of the judgments of the same experts may differ (sometimes even substantially). This again emphasizes the need to verify the final rankings. The advantages and disadvantages of applying quantitative and qualitative methods in expert-analytical activity are also considered. The scientific novelty of the conducted research is to improve the methodological approaches that will allow to improve the consistency of expert judgments, and to develop recommendations for the complex application of separate methods for constructing total ranking. The article is intended for scientists and practitioners who are interested in contemporary sociological and management approaches to solving economic problems. Also, the article may be useful for specialists and programmers who work in the field of development of artificial intelligence.
APA, Harvard, Vancouver, ISO, and other styles
3

Zmyślony, Piotr, and Natalia Piechota. "The World’s Tourist Metropolis in International Cities’ Rankings – Statistical Multicriterial Ranking Analysis." Folia Turistica 38 (March 31, 2016): 57–80. http://dx.doi.org/10.5604/01.3001.0008.9384.

Full text
Abstract:
Purpose. (1) Measuring the economic and tourist potential of metropolitan areas recognized as world/global cities; (2) determining the intensity of the relationship between tourism potential and economic potential of these cities; (3) proposing a classification of the world’s tourist cities. Method. Multicriterial ranking method based on secondary sources in the form of cities’ rankings characterized by their tourist and economic potential; measuring the relationship between their tourism and economic potential using the Pearson correlation coefficient. Findings. The study revealed the ranking of 22 world’s tourist cities, led by London, Paris and New York. The strong association between the tourist and economic potential of the cities was confirmed. Research and conclusion limitations. The quality of the sources, limited objectivity of the source selection and the ranking method used; the generalized nature of the results. Practical implications. Practical verification of the descriptive concept of world tourism cities proposed by R. Maitland and P. Newman [2009]; proposing the authors’ method of measuring the degree of internationalization of city tourism function. Originality. The paper proposes a ranking of the world’s tourist cities and analyses the tourism potential of cities in the context of their economic competitiveness. Type of paper. Theoretical/empirical study.
APA, Harvard, Vancouver, ISO, and other styles
4

BALABAN, ITTAI, AMIR PNUELI, and LENORE D. ZUCK. "MODULAR RANKING ABSTRACTION." International Journal of Foundations of Computer Science 18, no. 01 (February 2007): 5–44. http://dx.doi.org/10.1142/s0129054107004553.

Full text
Abstract:
Predicate abstraction has become one of the most successful methodologies for proving safety properties of programs. Recently, several abstraction methodologies have been proposed for proving liveness properties. This paper studies "ranking abstraction" where a program is augmented by a non-constraining progress monitor based on a set of ranking functions, and further abstracted by predicate-abstraction, to allow for automatic verification of progress properties. Unlike many liveness methodologies, the augmentation does not require a complete ranking function that is expected to decrease with each helpful step. Rather, adequate user-provided inputs are component rankings from which a complete ranking function may be automatically formed. The premise of the paper is an analogy between the methods of ranking abstraction and predicate abstraction, one ingredient of which is refinement: When predicate abstraction fails, one can refine it. When ranking abstraction fails, one must determine whether the predicate abstraction, or the ranking abstraction, needs be refined. The paper presents strategies for determining which case is at hand, and methods for performing the apporpriate refinements. The other part of the analogy is that of automatically deriving deductive proof constructs: Predicate abstraction is often used to derive program invariants for proving safety properties as a boolean combination of the given predicates. Deductive proof of progress properties requires well-founded ranking functions in addition to invariants. We show how the constructs necessary for a deductive proof of an arbitrary LTL formula can be automatically extracted from a successful application of the ranking abstraction method.
APA, Harvard, Vancouver, ISO, and other styles
5

Khubaev, G., K. Shcherbakova, and E. Petrenko. "Iterative Object Ranking Verification Method: Programming Implementation, Fields of Application." Bulletin of Science and Practice 7, no. 5 (May 15, 2021): 344–55. http://dx.doi.org/10.33619/2414-2948/66/34.

Full text
Abstract:
This paper provides an overview of the originality and advantages of the Iterative Object Ranking Verification method, analyzes an example of the Python programming implementation, describes possible fields to apply the method.
APA, Harvard, Vancouver, ISO, and other styles
6

Gilleland, Eric, Johan Lindström, and Finn Lindgren. "Analyzing the Image Warp Forecast Verification Method on Precipitation Fields from the ICP." Weather and Forecasting 25, no. 4 (August 1, 2010): 1249–62. http://dx.doi.org/10.1175/2010waf2222365.1.

Full text
Abstract:
Abstract Image warping for spatial forecast verification is applied to the test cases employed by the Spatial Forecast Verification Intercomparison Project (ICP), which includes both real and contrived cases. A larger set of cases is also used to investigate aggregating results for summarizing forecast performance over a long record of forecasts. The technique handles the geometric and perturbed cases with nearly exact precision, as would be expected. A statistic, dubbed here the IWS for image warp statistic, is proposed for ranking multiple forecasts and tested on the perturbed cases. IWS rankings for perturbed and real test cases are found to be sensible and physically interpretable. A powerful result of this study is that the image warp can be employed using a relatively sparse, preset regular grid without having to first identify features.
APA, Harvard, Vancouver, ISO, and other styles
7

Raden, Martin, Fabio Gutmann, Michael Uhl, and Rolf Backofen. "CopomuS—Ranking Compensatory Mutations to Guide RNA-RNA Interaction Verification Experiments." International Journal of Molecular Sciences 21, no. 11 (May 28, 2020): 3852. http://dx.doi.org/10.3390/ijms21113852.

Full text
Abstract:
In silico RNA-RNA interaction prediction is widely applied to identify putative interaction partners and to assess interaction details in base pair resolution. To verify specific interactions, in vitro evidence can be obtained via compensatory mutation experiments. Unfortunately, the selection of compensatory mutations is non-trivial and typically based on subjective ad hoc decisions. To support the decision process, we introduce our COmPensatOry MUtation Selector CopomuS. CopomuS evaluates the effects of mutations on RNA-RNA interaction formation using a set of objective criteria, and outputs a reliable ranking of compensatory mutation candidates. For RNA-RNA interaction assessment, the state-of-the-art IntaRNA prediction tool is applied. We investigate characteristics of successfully verified RNA-RNA interactions from the literature, which guided the design of CopomuS. Finally, we evaluate its performance based on experimentally validated compensatory mutations of prokaryotic sRNAs and their target mRNAs. CopomuS predictions highly agree with known results, making it a valuable tool to support the design of verification experiments for RNA-RNA interactions. It is part of the IntaRNA package and available as stand-alone webserver for ad hoc application.
APA, Harvard, Vancouver, ISO, and other styles
8

Lai, Songxuan, Lianwen Jin, Luojun Lin, Yecheng Zhu, and Huiyun Mao. "SynSig2Vec: Learning Representations from Synthetic Dynamic Signatures for Real-World Verification." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 01 (April 3, 2020): 735–42. http://dx.doi.org/10.1609/aaai.v34i01.5416.

Full text
Abstract:
An open research problem in automatic signature verification is the skilled forgery attacks. However, the skilled forgeries are very difficult to acquire for representation learning. To tackle this issue, this paper proposes to learn dynamic signature representations through ranking synthesized signatures. First, a neuromotor inspired signature synthesis method is proposed to synthesize signatures with different distortion levels for any template signature. Then, given the templates, we construct a lightweight one-dimensional convolutional network to learn to rank the synthesized samples, and directly optimize the average precision of the ranking to exploit relative and fine-grained signature similarities. Finally, after training, fixed-length representations can be extracted from dynamic signatures of variable lengths for verification. One highlight of our method is that it requires neither skilled nor random forgeries for training, yet it surpasses the state-of-the-art by a large margin on two public benchmarks.
APA, Harvard, Vancouver, ISO, and other styles
9

Ji, Yingchun, Yi Zhang, Ivan Korolija, and Julie Futcher. "Design summer year weather – outdoor warmth ranking metrics and their numerical verification." Building Services Engineering Research and Technology 37, no. 6 (July 28, 2016): 639–63. http://dx.doi.org/10.1177/0143624416648179.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Takisaka, Toru, Yuichiro Oyabu, Natsuki Urabe, and Ichiro Hasuo. "Ranking and Repulsing Supermartingales for Reachability in Randomized Programs." ACM Transactions on Programming Languages and Systems 43, no. 2 (July 2021): 1–46. http://dx.doi.org/10.1145/3450967.

Full text
Abstract:
Computing reachability probabilities is a fundamental problem in the analysis of randomized programs. This article aims at a comprehensive and comparative account of various martingale-based methods for over- and under-approximating reachability probabilities. Based on the existing works that stretch across different communities (formal verification, control theory, etc.), we offer a unifying account. In particular, we emphasize the role of order-theoretic fixed points—a classic topic in computer science—in the analysis of randomized programs. This leads us to two new martingale-based techniques, too. We also make an experimental comparison using our implementation of template-based synthesis algorithms for those martingales.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Ranking verification"

1

Garritsen, Christy. "The impact of DNA parentage verification on EBV estimation and sire ranking in South African Angora goats." Diss., University of Pretoria, 2013. http://hdl.handle.net/2263/79236.

Full text
Abstract:
South Africa is the world’s largest mohair-producing country, contributing over 50% of the world’s mohair, and therefore genetic improvement of Angora goats in South Africa is imperative in order to maintain this position in the market and the quality of the mohair clip. Pedigree integrity is vital for the success of any breeding programme. DNA parentage testing has become a useful tool in amending inaccuracies in on-farm records of various species. Previous studies have determined that errors in pedigree records may have a negative effect of up to 15% on genetic improvement in livestock. In the current study the extent of incorrect paternity records was quantified in 381 South African Angora goats using a panel of 12 microsatellite markers selected for parentage verification. 14.3% of the on-farm records were missing or incorrect. The microsatellite marker panel had a CPE of 99.6%, PIC of 0.700 and average HE of 0.738. Estimated Breeding Values for fleece traits (fibre diameter and fleece weight) and body weights (birth weight, weaning weight, eight month weight, yearling weight and 16 month weight) were estimated for 21 sires using ASREML, firstly using the breeder’s recorded pedigree and secondly using the DNA marker-verified pedigree. Sires were ranked according to EBVs for each trait. The sires ranked lowest in the breeder’s records for fibre diameter, birth weight and weaning weight were moved to the top three ranks in the DNA verified pedigree. The ranking for fleece weight was not as severely affected. The significant change in sire ranking after DNA pedigree verification confirms the importance of pedigree integrity for selection accuracy in the South African Angora goat industry.
Dissertation (MSc)--University of Pretoria, 2013.
Animal and Wildlife Science
MSc
Unrestricted
APA, Harvard, Vancouver, ISO, and other styles
2

Urban, Caterina. "Static analysis by abstract interpretation of functional temporal properties of programs." Thesis, Paris, Ecole normale supérieure, 2015. http://www.theses.fr/2015ENSU0017/document.

Full text
Abstract:
L’objectif général de cette thèse est le développement de méthodes mathématiques correctes et efficaces en pratique pour prouver automatiquement la correction de logiciels. Plus précisément, cette thèse est fondée sur la théorie de l’interprétation abstraite, un cadre mathématique puissant pour l’approximation du comportement des programmes. En particulier, cette thèse se concentre sur la preuve des propriétés de vivacité des programmes, qui représentent des conditions qui doivent être réalisés ultimement ou de manière répétée pendant l’exécution du programme. La terminaison des programmes est la propriété de vivacité la plus fréquemment considérée. Cette thèse conçoit des nouvelles approximations, afin de déduire automatiquement des conditions suffisantes pour la terminaison des programmes et synthétiser des fonctions de rang définies par morceaux, qui fournissent des bornes supérieures sur le temps d’attente avant la terminaison. Les approximations sont paramétriques dans le choix entre l’expressivité et le coût des approximations sous-jacentes, qui maintiennent des informations sur l’ensemble des valeurs possibles des variables du programme ainsi que les relations numériques possibles entre elles. Cette thèse développe également un cadre d’interprétation abstraite pour prouver des propriétés de vivacité, qui vient comme une généralisation du cadre proposé pour la terminaison. En particulier, le cadre est dédié à des propriétés de vivacité exprimées dans la logique temporelle, qui sont utilisées pour s’assurer qu’un événement souhaitable se produit une fois ou une infinité de fois au cours de l’exécution du programme. Comme pour la terminaison,des fonctions de rang définies par morceaux sont utilisées pour déduire des préconditions suffisantes pour ces propriétés, et fournir des bornes supérieures sur le temps d’attente avant un événement souhaitable. Les résultats présentés dans cette thèse ont été mis en œuvre dans un prototype d’analyseur. Les résultats expérimentaux montrent qu’il donne de bons résultats sur une grande variété de programmes, il est compétitif avec l’état de l’art, et il est capable d’analyser des programmes qui sont hors de la portée des méthodes existantes
The overall aim of this thesis is the development of mathematically sound and practically efficient methods for automatically proving the correctness of computer software. More specifically, this thesis is grounded in the theory of abstract interpretation, a powerful mathematical framework for approximating the behavior of programs. In particular, this thesis focuses on provingprogram liveness properties, which represent requirements that must be eventually or repeatedly realized during program execution. Program termination is the most prominent liveness property. This thesis designs new program approximations, in order to automatically infer sufficient preconditions for program termination and synthesize so called piecewisedefined ranking functions, which provide upper bounds on the waiting time before termination. The approximations are parametric in the choice between the expressivity and the cost of the underlying approximations, which maintain information about the set of possible values of the program variables along with the possible numerical relationships between them. This thesis also contributes an abstract interpretation framework for proving liveness properties, which comes as a generalization of the framework proposedfor termination. In particular, the framework is dedicated to liveness properties expressed in temporal logic, which are used to ensure that some desirable event happens once or infinitely many times during program execution. As for program termination, piecewise-defined ranking functions are used to infer sufficient preconditions for these properties, and to provide upper boundson the waiting time before a desirable event. The results presented in this thesis have been implemented into a prototype analyzer. Experimental results show that it performs well on a wide variety of benchmarks, it is competitive with the state of the art, and is able to analyze programs that are out of the reach of existing methods
APA, Harvard, Vancouver, ISO, and other styles
3

Lin, Connie Amy, and 林景惠. "photoCAPTCHA for Image Label Ranking and Verification." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/15233846403446710065.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

LAN, YUN-CHIEH, and 藍允婕. "Preference Ranking of Online Game Characteristic Classification and Recommendation Service Verification." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/74234493248362709657.

Full text
Abstract:
碩士
輔仁大學
國際經營管理碩士學位學程
102
According to the research on Taiwanese Internet users by Market Intelligence & Consulting Institute (MIC) in 2013, the population of smart mobile device, the amount of users playing games on mobile phone is largely increasing and the habits of playing games are also changed. Not only computer online games, but smart phone applications for entertainment are much more diverse. Moreover, it’s kind of decision problem that how to choose a suitable game product for user in so many kinds of production. Therefore, the research is to develop an ideal games’ recommendation system based on users’ preference e ranking technology. The approach uses a partial user ranking algorithm to takes most users’ preferences as features to estimate the possible preference of similar users. The purpose is to explore the players can be recommended based on the other users’ priorities, as well as the combination of game types which can be the potential business trends in the future. We could know potential marketing information and makes users choose the game using a Data Mining analytical methodology and users’ questionnaire. Furthermore, this study is to contribute a research implication for the electronic game industry, and the results could also be reference of game developments of online game type combination.
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Yanzhi. "Efficient and robust image ranking for object retrieval." Thesis, 2013. http://hdl.handle.net/2440/90334.

Full text
Abstract:
This thesis focuses on efficient and effective object retrieval from an unlabelled collection of images. The goal of object retrieval is to, given a query image depicting an object, return the dataset images containing that same object, quickly and accurately. Due to its simplicity and efficiency, it is common to use a “Bag-of-Words” (BoW) model in which each image is represented as a weighted vector of quantised features, known as visual words. Although the BoW retrieval system is efficient, the extraction and quantisation of local image features introduces errors into the retrieval results. We build our retrieval system on the BoW model, proposing three kinds of method to improve the retrieval accuracy: i) refinement of BoW image representation; ii) refinement of image similarity; iii) retrieval result re-ranking. Firstly, a visual thesaurus structure is proposed to discover the spatial relatedness of visual words. Based on these, a spatial expansion method is able to enrich the original query with those spatially related visual words (enriched by a general thesaurus) and spatially related foreground words (enriched by an object-based thesaurus). Therefore, the BoW image representation is improved. The second contribution improves the standard image similarity used in the BoW retrieval system such that the similarity between query/dataset images is better described. We do this by a cross-word image matching scheme, such that matching features mapped to different visual words are able to contribute to the similarity score. Thirdly, we also aim at efficient result re-ranking methods to improve the initial retrieval results. We present two re-ranking methods in this thesis. A context based re-ranking method is based on the analysis of correlated subsets of image dataset, called “contexts”. Images that share contexts are weakly correlated to each other, and should therefore mutually influence each other’s ranking. The initial ranking scores are refined by this contextual information. We also present a ranking verification method that is able to extract a set of reliable query relevant images from the retrieved results and thus can be applied in a number of object retrieval applications. Note that neither method needs to recover low level feature information or prior knowledge from the dataset. Instead, they utilize ranking information during run time. We also revisit the definition of the object retrieval problem and propose a group-query method, in which the query is a collection of images depicting the same object instead of a single query image used in the traditional “query-by-example” methods.
Thesis (Ph.D.) -- University of Adelaide, School of Computer Science, 2013
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Ranking verification"

1

Office, General Accounting. Welfare eligibility: Deficit Reduction Act income verification issues : fact sheet for the ranking minority member, Subcommittee on Oversight of Government Management, Committee on Governmental Affairs, United States Senate. Washington, D.C: The Office, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Office, General Accounting. Welfare eligibility: Deficit Reduction Act income verification issues : fact sheet for the ranking minority member, Subcommittee on Oversight of Government Management, Committee on Governmental Affairs, United States Senate. Washington, D.C: The Office, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Office, General Accounting. Welfare eligibility: Deficit Reduction Act income verification issues : fact sheet for the ranking minority member, Subcommittee on Oversight of Government Management, Committee on Governmental Affairs, United States Senate. Washington, D.C: The Office, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dennis, Faber, Vermunt Niels, Kilborn Jason, Richter Tomáš, and Tirado Ignacio, eds. Ranking and Priority of Creditors. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198727293.001.0001.

Full text
Abstract:
This book addresses one of the critical issues of any insolvency by providing analysis of the law and practice in relation to creditor claims. As with the two previous volumes in the series, the book provides a comparative view by setting out the relevant law and practice in nineteen jurisdictions, drawing out the divergences and common features of domestic insolvency laws from a broad spectrum of countries. Areas covered include submission of claims, verification and admission of claims, ranking of insolvency and administration claims, treatment of non-enforceable claims, and voting and participation rights. Quality, uniformity, and the high level of detail of National Reports are the key benefits of this book.
APA, Harvard, Vancouver, ISO, and other styles
5

Ignacio, Tirado. 17 National Report for Spain. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198727293.003.0017.

Full text
Abstract:
This chapter discusses the law on creditor claims in Spain. Spain’s current insolvency regulatory regime resulted from the reorganization and modernization that took place with the passing of the 2003 Insolvency Law (Ley Concursal). The ranking of claims under the Insolvency Law coexists with a ranking of claims for execution in individual proceedings, regulated in the Civil Code. The Spanish system has been generally respectful of the pre-insolvency entitlements of secured creditors; provides priority for post-commencement financing; and includes different tiers of priorities for certain categories of creditors. The remainder of the chapter deals with insolvency claims, administration claims, and non-enforceable claims in turn. Each section covers: the definition and scope of the claim; rules for submission, verification, and satisfaction or admission of claims; ranking of claims; and voting and other participation rights in insolvency proceedings.
APA, Harvard, Vancouver, ISO, and other styles
6

Tomáš, Richter. 7 National Report for the Czech Republic. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198727293.003.0007.

Full text
Abstract:
This chapter discusses the law on creditor claims in the Czech Republic. The Czech Insolvency Act appears to deal with creditors’ claims in a fairly standard manner, making pre-insolvency claims subject to the process of claims submission and verification, and dealing with claims arising during the proceedings as administration claims. But the Insolvency Act actually confers upon creditors the power to decide on numerous of issues in the course of particular proceedings, eg, whether the debtor should be liquidated or reorganized. Many of the difficulties surrounding the Act’s rules on the submission and verification of claims are thus related to the question of who gets to decide on the course of the insolvency proceedings. The chapter then examines insolvency claims, administration claims, and non-enforceable claims in turn. Each section covers: the definition and scope of the claim; rules for submission, verification, and satisfaction or admission of claims; ranking of claims; and voting and other participation rights in insolvency proceedings.
APA, Harvard, Vancouver, ISO, and other styles
7

Alexander, Trukhtanov. 14 National Report for the Russian Federation. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198727293.003.0014.

Full text
Abstract:
This chapter discusses the law on creditor claims in Russia. Russia’s principal bankruptcy law is the Federal Insolvency (Bankruptcy) Law 2002. The law sets out a comprehensive regime of submission, priority, and ranking of claims. It is almost entirely mandatory and leaves very little to be governed by pre-insolvency contractual arrangements. Its policies are generally favourable to creditors and are aimed at achieving pari passu distribution, including restriction of administration claims and giving unsecured creditors access to part of the proceeds of sale of security assets. The remainder of the chapter is concerned with insolvency claims, administration claims, and non-enforceable claims in turn. Each section covers: the definition and scope of the claim; rules for submission, verification, and satisfaction or admission of claims; ranking of claims; and voting and other participation rights in insolvency proceedings.
APA, Harvard, Vancouver, ISO, and other styles
8

Hamish, Anderson, Cooke Charlotte, and Gullifer Louise. 8 National Report for England. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198727293.003.0008.

Full text
Abstract:
This chapter discusses the law on creditor claims in England. The English courts have recently considered the ranking and priority of creditors on a number of occasions. The differing classes of claims found in the judgment of Lord Neuberger PSC in Re Nortel GmbH best explain how the distinction between ‘insolvency claims’, ‘administration claims’, and ‘non-enforceable claims’ is reflected in the applicable English rules. With the exception of expenses and shareholders’ claims, all the claims listed by Lord Neuberger are ‘insolvency claims’ because they are all creditors’ claims which are referable to pre-proceeding obligations. The remainder of the chapter deals with insolvency claims, administration claims, and non-enforceable claims in turn. Each section describes: the definition and scope of the claim; rules for submission, verification, and satisfaction or admission of claims; ranking of claims; and voting and other participation rights in insolvency proceedings.
APA, Harvard, Vancouver, ISO, and other styles
9

Annina H, Persson, and Karlsson-Tuula Marie. 18 National Report for Sweden. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198727293.003.0018.

Full text
Abstract:
This chapter discusses the law on creditor claims in Sweden. The ranking of claims in bankruptcy and distraint in Sweden is regulated by the Priority Rights Act 1970 (PRA). The PRA was drawn up in cooperation with all other Nordic countries, except Iceland. The primary aim of the PRA is to regulate the order in which claims shall be paid during distraint and in bankruptcy. It does not include any provisions regarding priority between different rights of use or between acquisitions of property, or regarding the relationship between claims and rights. Instead, these provisions can be found in other pieces of legislation. The remainder of the chapter deals with insolvency claims, administration claims, and non-enforceable claims in turn. Each section covers the definition and scope of the claim; rules for submission, verification, and satisfaction or admission of claims; ranking of claims; and voting and other participation rights in insolvency proceedings.
APA, Harvard, Vancouver, ISO, and other styles
10

Dennis, Faber, and Vermunt Niels. 12 National Report for the Netherlands. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198727293.003.0012.

Full text
Abstract:
This chapter discusses the law on creditor claims in the Netherlands. It deals with insolvency claims, administration claims, and non-enforceable claims in turn. Each section covers: the definition and scope of the claim; rules for submission, verification, and satisfaction or admission of claims; ranking of claims; and voting and other participation rights in insolvency proceedings. In essence, holders of insolvency claims (‘insolvency creditors’) are entitled to the liquidation proceeds of the debtor’s insolvency estate after the full discharge of the administration claims. Insolvency creditors (except secured creditors) can only pursue payment by submitting their claims for admission in the proceedings. Administration claims have to be satisfied in priority to insolvency claims and need not be submitted in the claims verification procedure. Holders of such claims (‘administration creditors’) can take recourse against assets comprised in the insolvency estate. Holders of non-enforceable claims can only seek recourse after the insolvency proceedings are terminated (provided that the debtor continues to exist).
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Ranking verification"

1

Bradley, Aaron R., Zohar Manna, and Henny B. Sipma. "Linear Ranking with Reachability." In Computer Aided Verification, 491–504. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11513988_48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ben-Amram, Amir M., and Samir Genaim. "On Multiphase-Linear Ranking Functions." In Computer Aided Verification, 601–20. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-63390-9_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ben-Amram, Amir M. "Size-Change Termination, Monotonicity Constraints and Ranking Functions." In Computer Aided Verification, 109–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02658-4_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ben-Amram, Amir M., and Samir Genaim. "Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions." In Computer Aided Verification, 304–21. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21668-3_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kura, Satoshi, Hiroshi Unno, and Ichiro Hasuo. "Decision Tree Learning in CEGIS-Based Termination Analysis." In Computer Aided Verification, 75–98. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_4.

Full text
Abstract:
AbstractWe present a novel decision tree-based synthesis algorithm of ranking functions for verifying program termination. Our algorithm is integrated into the workflow of CounterExample Guided Inductive Synthesis (CEGIS). CEGIS is an iterative learning model where, at each iteration, (1) a synthesizer synthesizes a candidate solution from the current examples, and (2) a validator accepts the candidate solution if it is correct, or rejects it providing counterexamples as part of the next examples. Our main novelty is in the design of a synthesizer: building on top of a usual decision tree learning algorithm, our algorithm detects cycles in a set of example transitions and uses them for refining decision trees. We have implemented the proposed method and obtained promising experimental results on existing benchmark sets of (non-)termination verification problems that require synthesis of piecewise-defined lexicographic affine ranking functions.
APA, Harvard, Vancouver, ISO, and other styles
6

Ben-David, Shoham, and Orna Kupferman. "A Framework for Ranking Vacuity Results." In Automated Technology for Verification and Analysis, 148–62. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-02444-8_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Heizmann, Matthias, Jochen Hoenicke, Jan Leike, and Andreas Podelski. "Linear Ranking for Linear Lasso Programs." In Automated Technology for Verification and Analysis, 365–80. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-02444-8_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Abate, Alessandro, Mirco Giacobbe, and Diptarko Roy. "Learning Probabilistic Termination Proofs." In Computer Aided Verification, 3–26. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_1.

Full text
Abstract:
AbstractWe present the first machine learning approach to the termination analysis of probabilistic programs. Ranking supermartingales (RSMs) prove that probabilistic programs halt, in expectation, within a finite number of steps. While previously RSMs were directly synthesised from source code, our method learns them from sampled execution traces. We introduce the neural ranking supermartingale: we let a neural network fit an RSM over execution traces and then we verify it over the source code using satisfiability modulo theories (SMT); if the latter step produces a counterexample, we generate from it new sample traces and repeat learning in a counterexample-guided inductive synthesis loop, until the SMT solver confirms the validity of the RSM. The result is thus a sound witness of probabilistic termination. Our learning strategy is agnostic to the source code and its verification counterpart supports the widest range of probabilistic single-loop programs that any existing tool can handle to date. We demonstrate the efficacy of our method over a range of benchmarks that include linear and polynomial programs with discrete, continuous, state-dependent, multi-variate, hierarchical distributions, and distributions with undefined moments.
APA, Harvard, Vancouver, ISO, and other styles
9

Pnueli, Amir. "Ranking Abstraction as a Companion to Predicate Abstraction." In Automated Technology for Verification and Analysis, 1. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11562948_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Takisaka, Toru, Yuichiro Oyabu, Natsuki Urabe, and Ichiro Hasuo. "Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs." In Automated Technology for Verification and Analysis, 476–93. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01090-4_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Ranking verification"

1

Shen, Haihao, Jianhong Fang, and Jianjun Zhao. "EFindBugs: Effective Error Ranking for FindBugs." In 2011 IEEE Fourth International Conference on Software Testing, Verification and Validation (ICST 2011). IEEE, 2011. http://dx.doi.org/10.1109/icst.2011.51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Brighente, A., F. Formaggio, G. Ruvoletto, and S. Tomasin. "Ranking-Based Attacks to In-Region Location Verification Systems." In 2019 IEEE International Workshop on Information Forensics and Security (WIFS). IEEE, 2019. http://dx.doi.org/10.1109/wifs47025.2019.9035088.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Taniguchi, Motoki, Tomoki Taniguchi, Takumi Takahashi, Yasuhide Miura, and Tomoko Ohkuma. "Integrating Entity Linking and Evidence Ranking for Fact Extraction and Verification." In Proceedings of the First Workshop on Fact Extraction and VERification (FEVER). Stroudsburg, PA, USA: Association for Computational Linguistics, 2018. http://dx.doi.org/10.18653/v1/w18-5520.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Madrid, Nicolas, and Pavel Rusnok. "Verification of Top-K Algorithm for a Family of Non-monotonic Ranking Functions." In 2015 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, 2015. http://dx.doi.org/10.1109/smc.2015.462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mars, David Ebri, Hanwei Wu, Haopeng Li, and Markus Flierl. "Joint Geometric Verification and Ranking Using Multi-view Vocabulary Trees for Mobile 3D Visual Search." In 2015 Data Compression Conference (DCC). IEEE, 2015. http://dx.doi.org/10.1109/dcc.2015.82.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Levon, Beata, Remigijus Šalna, and Linas Juknevičius. "Analysis of the different techniques for calculation of bearing capacity of flexural reinforced concrete deep beams." In The 13th international scientific conference “Modern Building Materials, Structures and Techniques”. Vilnius Gediminas Technical University, 2019. http://dx.doi.org/10.3846/mbmst.2019.158.

Full text
Abstract:
The paper deals with the singularities of the design of deep beams without shear reinforcement according to different design codes, namely, STR 2.05.05:2005, EC2, EC2-SMM and ACI-318. The comparative analysis of calculation models, experimental verification, accuracy of models and the ranking of models according to the Modified Demerit Points Classification (MDP) method are presented. The results shown that despite the systematic error of the STR 2.05.05:2005 method is closest to 1 if compared to the other methods, it is classified as dangerous one according to the MDP ranking.
APA, Harvard, Vancouver, ISO, and other styles
7

Jeong, Yoonjae, and Hoon-Young Cho. "Detecting Mismatch Between Text Script and Voice-Over Using Utterance Verification Based on Phoneme Recognition Ranking." In ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2020. http://dx.doi.org/10.1109/icassp40776.2020.9053190.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zarubin, Ilya, and Aleksandr Filinskikh. "A Mathematical Model for Ranking High-Level User Interface Regression Tests." In 31th International Conference on Computer Graphics and Vision. Keldysh Institute of Applied Mathematics, 2021. http://dx.doi.org/10.20948/graphicon-2021-3027-1131-1138.

Full text
Abstract:
A mathematical model has been developed for ranking high-level verification scenarios (manual tests) when forming a pool of regression tests. The model takes into account the significance of selection methods based on the analysis of previous runs of regression tests, the opinion of the expert group, the specifics of the changes made in the current release, and also has the ability to use an arbitrary number of additional test selection methods. The model can be used to analyze historical data of regression test runs using neural networks in order to identify the most effective approaches to selecting tests for regression testing. The model can be implemented in a software package that interacts with various testing management systems in order to significantly accelerate the formation of a pool of regression tests with a different approach to selection, which can be used by a test engineer of average qualification and without a deep understanding of the features and architecture of the information system being developed.
APA, Harvard, Vancouver, ISO, and other styles
9

Komatani, Kazunori, Satoshi Ikeda, Yuichiro Fukubayashi, Tetsuya Ogata, and Hiroshi G. Okuno. "Ranking help message candidates based on robust grammar verification results and utterance history in spoken dialogue systems." In the SIGDIAL 2009 Conference. Morristown, NJ, USA: Association for Computational Linguistics, 2009. http://dx.doi.org/10.3115/1708376.1708422.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Loganathan, Ganesh Babu, Sundar Singh Sivam Sundarlingam Paramasivam, Durai Kumaran, Krishnaswamy Saravanan, and Raj Rajendran. "Experimental Study on Verification of Alloy ASTM A510 High-Speed Micro Turning by Parameters Validation through Ranking Algorithm." In International Conference on Advances in Design, Materials, Manufacturing and Surface Engineering for Mobility. 400 Commonwealth Drive, Warrendale, PA, United States: SAE International, 2019. http://dx.doi.org/10.4271/2019-28-0071.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Ranking verification' for particular source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography