Thematische Bibliographien / Rule based updates

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Rule based updates“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 20. Februar 2023

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

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Rule based updates" bekannt.

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

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

Zeitschriftenartikel zum Thema "Rule based updates"

Erwig, Martin, und Delin Ren. „A rule-based language for programming software updates“. ACM SIGPLAN Notices 37, Nr. 12 (Dezember 2002): 88–97. http://dx.doi.org/10.1145/636517.636530.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Salah, Ramzi, Muaadh Mukred, Lailatul Qadri binti Zakaria, Rashad Ahmed und Hasan Sari. „A New Rule-Based Approach for Classical Arabic in Natural Language Processing“. Journal of Mathematics 2022 (21.01.2022): 1–20. http://dx.doi.org/10.1155/2022/7164254.

Der volle Inhalt der Quelle

Annotation:

Named entity recognition (NER) is fundamental in several natural language processing applications. It involves finding and categorizing text into predefined categories such as a person's name, location, and so on. One of the most famous approaches to identify named entity is the rule-based approach. This paper introduces a rule-based NER method that can be used to examine Classical Arabic documents. The proposed method relied on triggers words, patterns, gazetteers, rules, and blacklists generated by the linguistic information about entities named in Arabic. The method operates in three stages, operational stage, preprocessing stage, and processing the rule application stage. The proposed approach was evaluated, and the results indicate that this approach achieved a 90.2% rate of precision, an 89.3% level of recall, and an F-measure of 89.5%. This new approach was introduced to overcome the challenges related to coverage in rule-based NER systems, especially when dealing with Classical Arabic texts. It improved their performance and allowed for automated rule updates. The grammar rules, gazetteers, blacklist, patterns, and trigger words were all integrated into the rule-based system in this way.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

SLOTA, MARTIN, und JOÃO LEITE. „The rise and fall of semantic rule updates based onSE-models“. Theory and Practice of Logic Programming 14, Nr. 6 (07.08.2013): 869–907. http://dx.doi.org/10.1017/s1471068413000100.

Der volle Inhalt der Quelle

Annotation:

AbstractLogic programs under the stable model semantics, or answer-set programs, provide an expressive rule-based knowledge representation framework, featuring a formal, declarative and well-understood semantics. However, handling the evolution of rule bases is still a largely open problem. The Alchourrón, Gärdenfors and Makinson (AGM) framework for belief change was shown to give inappropriate results when directly applied to logic programs under a non-monotonic semantics such as the stable models. The approaches to address this issue, developed so far, proposed update semantics based on manipulating the syntactic structure of programs and rules.More recently, AGM revision has been successfully applied to a significantly more expressive semantic characterisation of logic programs based onSE-models. This is an important step, as it changes the focus from the evolution of a syntactic representation of a rule base to the evolution of its semantic content.In this paper, we borrow results from the area of belief update to tackle the problem of updating (instead of revising) answer-set programs. We prove a representation theorem which makes it possible to constructively define any operator satisfying a set of postulates derived from Katsuno and Mendelzon's postulates for belief update. We define a specific operator based on this theorem, examine its computational complexity and compare the behaviour of this operator with syntactic rule update semantics from the literature. Perhaps surprisingly, we uncover a serious drawback of all rule update operators based on Katsuno and Mendelzon's approach to update and onSE-models.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yuan, Peiyan, Xiaoxiao Pang, Ping Liu und En Zhang. „FollowMe: One Social Importance-Based Collaborative Scheme in MONs“. Future Internet 11, Nr. 4 (17.04.2019): 98. http://dx.doi.org/10.3390/fi11040098.

Der volle Inhalt der Quelle

Annotation:

The performance of mobile opportunistic networks mainly relies on collaboration among nodes. Thus far, researchers have ignored the influence of node sociality on the incentive process, leading to poor network performance. Considering the fact that followers always imitate the behavior of superstars, this paper proposes FollowMe, which integrates the social importance of nodes with evolutionary game theory to improve the collaborative behavior of nodes. First, we use the prisoner’s dilemma model to establish the matrix of game gains between nodes. Second, we introduce the signal reference as a game rule between nodes. The number of nodes choosing different strategies in a game round is used to calculate the cumulative income of the node in combination with the probability formula. Finally, the Fermi function is used to determine whether the node updates the strategy. The simulation results show that, compared with the random update rule, the proposed strategy is more capable of promoting cooperative behavior between nodes to improve the delivery rate of data packets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zheng, Hongdi, Junfeng Wang, Jianping Zhang und Ruirui Li. „IRTS: An Intelligent and Reliable Transmission Scheme for Screen Updates Delivery in DaaS“. ACM Transactions on Multimedia Computing, Communications, and Applications 17, Nr. 3 (22.07.2021): 1–24. http://dx.doi.org/10.1145/3440035.

Der volle Inhalt der Quelle

Annotation:

Desktop-as-a-service (DaaS) has been recognized as an elastic and economical solution that enables users to access personal desktops from anywhere at any time. During the interaction process of DaaS, users rely on screen updates to perceive execution results remotely, and thus the reliability and timeliness of screen updates transmission have a great influence on users’ quality of experience (QoE). However, the efficient transmission of screen updates in DaaS is facing severe challenges: most transmission schemes applied in DaaS determine sending strategies in terms of pre-set rules, lacking the intelligence to utilize bandwidth rationally and fit new network scenarios. Meanwhile, they tend to focus on reliability or timeliness and perform unsatisfactorily in ensuring reliability and timeliness simultaneously, leading to lower transmission efficiency of screen updates and users’ QoE when network conditions turn unfavorable. In this article, an intelligent and reliable end-to-end transmission scheme (IRTS) is proposed to cope with the preceding issues. IRTS draws support from reinforcement learning by adopting SARSA, an online learning method based on the temporal difference update rule, to grasp the optimal mapping between network states and sending actions, which extricates IRTS from the reliance on pre-set rules and augments its adaptability to different network conditions. Moreover, IRTS guarantees reliability and timeliness via an adaptive loss recovery method, which intends to recover lost screen updates data automatically with fountain code while controlling the number of redundant packets generated. Extensive performance evaluations are conducted, and numerical results show that IRTS outperforms the reference schemes in display quality, end-to-end delay/delay jitter, and fairness when transferring screen updates under various network conditions, proving that IRTS can enhance the transmission efficiency of screen updates and users’ QoE in DaaS.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Thill, Marc, Christian Jackisch, Wolfgang Janni, Volkmar Müller, Ute-Susann Albert, Ingo Bauerfeind, Jens Blohmer et al. „AGO Recommendations for the Diagnosis and Treatment of Patients with Locally Advanced and Metastatic Breast Cancer: Update 2019“. Breast Care 14, Nr. 4 (2019): 247–55. http://dx.doi.org/10.1159/000500999.

Der volle Inhalt der Quelle

Annotation:

Every year the Breast Committee of the Arbeitsgemeinschaft Gynäkologische Onkologie (German Gynecological Oncology Group, AGO), a group of gynecological oncologists specialized in breast cancer and interdisciplinary members specialized in pathology, radiologic diagnostics, medical oncology, and radiation oncology, prepares and updates evidence-based recommendations for the diagnosis and treatment of patients with early and metastatic breast cancer. Every update is performed according to a documented rule-fixed algorithm, by thoroughly reviewing and scoring the recent publications for their scientific validity and clinical relevance. This current publication presents the 2019 update on the recommendations for metastatic breast cancer.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Li, Guangquan, Ting Wang, Qi Chen, Peng Shao, Naixue Xiong und Athanasios Vasilakos. „A Survey on Particle Swarm Optimization for Association Rule Mining“. Electronics 11, Nr. 19 (24.09.2022): 3044. http://dx.doi.org/10.3390/electronics11193044.

Der volle Inhalt der Quelle

Annotation:

Association rule mining (ARM) is one of the core techniques of data mining to discover potentially valuable association relationships from mixed datasets. In the current research, various heuristic algorithms have been introduced into ARM to address the high computation time of traditional ARM. Although a more detailed review of the heuristic algorithms based on ARM is available, this paper differs from the existing reviews in that we expected it to provide a more comprehensive and multi-faceted survey of emerging research, which could provide a reference for researchers in the field to help them understand the state-of-the-art PSO-based ARM algorithms. In this paper, we review the existing research results. Heuristic algorithms for ARM were divided into three main groups, including biologically inspired, physically inspired, and other algorithms. Additionally, different types of ARM and their evaluation metrics are described in this paper, and the current status of the improvement in PSO algorithms is discussed in stages, including swarm initialization, algorithm parameter optimization, optimal particle update, and velocity and position updates. Furthermore, we discuss the applications of PSO-based ARM algorithms and propose further research directions by exploring the existing problems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

BOYLE, P. A., L. DEL DEBBIO, R. J. HUDSPITH, N. GARRON, E. KERRANE, K. MALTMAN und J. M. ZANOTTI. „LATTICE INPUT ON THE INCLUSIVE τ DECAY Vus PUZZLE“. International Journal of Modern Physics: Conference Series 35 (Januar 2014): 1460441. http://dx.doi.org/10.1142/s2010194514604414.

Der volle Inhalt der Quelle

Annotation:

Recent analyses of flavor-breaking hadronic-τ-decay-based sum rules produce values of |Vus| ~ 3σ low compared to 3-family unitarity expectations. An unresolved systematic issue is the significant variation in |Vus| produced by different prescriptions for treating the slowly converging D = 2 OPE series. We investigate the reliability of these prescriptions using lattice data for various flavor-breaking correlators and show the fixed-scale prescription is clearly preferred. Preliminary updates of the conventional τ-based, and related mixed τ-electroproduction-data-based, sum rule analyses incorporating B-factory results for low-multiplicity strange τ decay mode distributions are then performed. Use of the preferred FOPT D = 2 OPE prescription is shown to significantly reduce the discrepancy between 3-family unitarity expectations and the sum rule results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Giacomini, Raffaella, Vasiliki Skreta und Javier Turen. „Heterogeneity, Inattention, and Bayesian Updates“. American Economic Journal: Macroeconomics 12, Nr. 1 (01.01.2020): 282–309. http://dx.doi.org/10.1257/mac.20180235.

Der volle Inhalt der Quelle

Annotation:

We formulate a theory of expectations updating that fits the dynamics of accuracy and disagreement in a new survey of professional forecasters. We document new stylized facts, including the puzzling persistence of disagreement as uncertainty resolves. Our theory explains these facts by allowing for different channels of heterogeneity. Agents produce an initial forecast based on heterogeneous priors and are heterogeneously “inattentive.” Updaters use Bayes’ rule and interpret public information using possibly heterogeneous models. Structural estimation of our theory supports the conclusion that in normal times heterogeneous priors and inattention are enough to generate persistent disagreement, but not during the crisis. (JEL C53, D81, D83, D84, E31, E37)

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rajab, Sharifa. „Rule Base Simplification and Constrained Learning for Interpretability in TSK Neuro-Fuzzy Modelling“. International Journal of Fuzzy System Applications 9, Nr. 2 (April 2020): 31–58. http://dx.doi.org/10.4018/ijfsa.2020040102.

Der volle Inhalt der Quelle

Annotation:

Neuro-fuzzy systems based on a fuzzy model proposed by Takagi, Sugeno and Kang known as the TSK fuzzy model provide a powerful method for modelling uncertain and highly complex non-linear systems. The initial fuzzy rule base in TSK neuro-fuzzy systems is usually obtained using data driven approaches. This process induces redundancy into the system by adding redundant fuzzy rules and fuzzy sets. This increases complexity which adversely affects generalization capability and transparency of the fuzzy model being designed. In this article, the authors explore the potential of TSK fuzzy modelling in developing comparatively interpretable neuro-fuzzy systems with better generalization capability in terms of higher approximation accuracy. The approach is based on three phases, the first phase deals with automatic data driven rule base induction followed by rule base simplification phase. Rule base simplification uses similarity analysis to remove similar fuzzy sets and resulting redundant fuzzy rules from the rule base, thereby simplifying the neuro-fuzzy model. During the third phase, the parameters of membership functions are fine-tuned using a constrained hybrid learning technique. The learning process is constrained which prevents unchecked updates to the parameters so that a highly complex rule base does not emerge at the end of model optimization phase. An empirical investigation of this methodology is done by application of this approach to two well-known non-linear benchmark forecasting problems and a real-world stock price forecasting problem. The results indicate that rule base simplification using a similarity analysis effectively removes redundancy from the system which improves interpretability. The removal of redundancy also increased the generalization capability of the system measured in terms of increased forecasting accuracy. For all the three forecasting problems the proposed neuro-fuzzy system demonstrated better accuracy-interpretability tradeoff as compared to two well-known TSK neuro-fuzzy models for function approximation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Rule based updates"

Lakkaraju, Sai Kiran, University of Western Sydney, of Science Technology and Environment College und School of Computing and Information Technology. „A SLDNF based formalization for updates and abduction“. THESIS_CSTE_CIT_Lakkaraju_S.xml, 2001. http://handle.uws.edu.au:8081/1959.7/381.

Der volle Inhalt der Quelle

Annotation:

Knowledge representation and inference are the backbone of artificial intelligence, and logic programming is one of the most widely used knowledge representation tools. Logic programming with deduction/induction/abduction as the reasoning technique is serving numerous fields of artificial intelligence. In dynamic domains where there are constant changes in knowledge, updating the knowledge base is crucial to keep it stable. This thesis investigates the issues in updating the knowledge base. Two types of logic program based updates are considered, simple fact based updates where the knowledge base is updated by a simple fact, and rule based updates where the knowledge base is updated by a rule. A SLDNF based procedural approach is proposed to implement such updates. This thesis also investigates the issues involved in simple fact based and rule based abduction, and it is observed that updates are closely related to abduction. A SLDNF based procedural approach to perform simple fact/rule based updates and abduction is proposed as a result of this study
Master of Science (Hons)

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lakkaraju, Sai Kiran. „A SLDNF formalization for updates and abduction /“. View thesis View thesis, 2001. http://library.uws.edu.au/adt-NUWS/public/adt-NUWS20030507.112018/index.html.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.Sc. (Hons.)) -- University of Western Sydney, 2001.
"A thesis submitted for the degree of Master of Science (Honours) - Computing and Information Technology at University of Western Sydney" Bibliography : leaves 93-98.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Скорик, Олександр Олександрович, Олександр Олександрович Скорик und O. O. Skorik. „Оптимізація амортизаційної політики підприємств машинобудівної галузі“. Thesis, Тернопільський національний технічний університет ім. Івана Пулюя, 2012. http://elartu.tntu.edu.ua/handle/123456789/1806.

Der volle Inhalt der Quelle

Annotation:

Робота виконана на кафедрі менеджменту підприємницької діяльності Тернопільського національного технічного університету імені Івана Пулюя МОНмолодьспорту України.Захист відбувся «28» травня 2012 р. о 11 год. на засіданні спеціалізованої вченої ради К58.052.05 в Тернопільському національному технічному університету імені Івана Пулюя за адресою: 46001, м. Тернопіль, вул.. Білогірська, 2 (корпус № 10, зал засідань). З дисертацією можна ознайомитися в бібліотеці Тернопільського національного технічного університету імені Івана Пулюя за адресою: 46001, м. Тернопіль, вул. Руська, 56.
У дисертації досліджуються теоретичні, методичні та практичні аспекти оптимізації амортизаційної політики підприємств машинобудівної галузі. Досліджено сутність та основний зміст амортизації основного капіталу підприємства, визначено особливості проведення амортизаційної політики як інструменту реалізації інвестиційних цілей підприємства та визначено склад її основних елементів. Проведено дослідження особливостей становлення амортизаційної політики національної економіки, виявлено основні напрямки її реформування та оцінено перспективи удосконалення. Здійснено порівняльний аналіз зарубіжного досвіду формування амортизаційної політики розвинутих країн із реаліями вітчизняної економіки. Проаналізовано стан та перспективи розвитку машинобудівної промисловості України, оцінено потенційні можливості та інвестиційну привабливість вітчизняних товаровиробників. Удосконалено механізм проведення амортизаційної політики підприємств на основі впровадження моделювання процесів багатоваріантної амортизації та її оптимізації шляхом коригування термінів використання об’єктів основних засобів і диференціації норм нарахування зносу. Обґрунтовано необхідність та економічну доцільність розподілу функцій управлінського та облікового персоналу підприємства у здійсненні амортизаційної політики для узгодженості інформаційних потоків та комплексності управління процесами оновлення виробничого потенціалу.
В диссертации исследуются теоретические, методические и практические аспекты оптимизации амортизационной политики предприятий машиностроительной отрасли. Выявлено, что основные исследования ведутся в плоскости традиционного видения сущности и методологии амортизационного процесса, а именно сконцентрированы на налоговых или бухгалтерских аспектах данной проблемы. Исследована сущность и основное содержание амортизации основного капитала предприятия, определены особенности проведения амортизационной политики как инструмента реализации инвестиционных целей предприятия и определен состав ее основных элементов. Проведено исследование особенностей становления амортизационной политики национальной экономики, выявлены основные направления ее реформирования и оценены перспективы совершенствования. Осуществлен сравнительный анализ зарубежного опыта формирования амортизационной политики развитых стран с реалиями отечественной экономики. Проанализировано состояние и перспективы развития машиностроительной промышленности Украины, оценено потенциальные возможности и инвестиционную привлекательность отечественных товаропроизводителей. Результаты проведенных расчетов указывают на неверный выбор стратегических ориентиров амортизационной политики выбранных машиностроительных предприятий. Учитывая тот факт, что большинство расходов, связанных с воспроизводством основного капитала, удовлетворяются за счет отчислений, можно утверждать, что сформированный таким образом амортизационный фонд выполняет в достаточной мере свою основную функцию - выступает источником накопления денежных средств для обновления технической базы производства. Усовершенствован механизм проведения амортизационной политики предприятий на основе внедрения моделирования процессов многовариантной амортизации и оптимизации путем корректировки сроков использования объектов основных средств и дифференциации норм начисления износа. Предложен алгоритм оптимизации амортизационной политики предприятий машиностроения, построенный на основе жизненного цикла существования объектов основных средств. Это дает возможность аккумулировать полученные в отчетном периоде амортизационные поступления за счет дифференциации норм амортизации, как по отдельным группам основных фондов, так и во временном промежутке начисления их износа и обеспечить эффективное управление денежными средствами предприятия из фонда капитальных инвестиций в условиях ограниченности внешних финансовых ресурсов. Применение оптимизационной процедуры амортизационного процесса позволит обеспечить четкую направленность операционной деятельности предприятия - скорость возврата вложенных средств или уменьшения уровня валовых расходов. Обоснована необходимость и экономическую целесообразность распределения функций управленческого и учетного персонала предприятия в осуществлении амортизационной политики для согласованности информационных потоков и комплексности. Установлено, что в основе построения амортизационной политики предприятия лежит принцип сбалансированности информационных потоков и принцип распределения обязанностей между функциональными службами предприятия. В частности, современные подходы к построению хозяйственной деятельности предоставляют широкие права и возможности владельцам и менеджерам предприятий строить амортизационные процессы с различными вариантами схем и выбирать для каждой конкретной ситуации свой, наиболее целесообразный подход осуществления амортизации, который соответствует целям деятельности и развития данного предприятия.
The theoretical, methodical and practical aspects of depreciation policy of enterprises in machine-building industry are investigated in the thesis. The essence and the main contents of depreciation of the fixed assets in the enterprise are investigated. The features of the depreciation policy are defined as the instrument of realization of the investment objectives in the enterprise. The composition of the main elements of the depreciation policy is defined. The research of the peculiarities in establishment of depreciation policy of the national economy is held and the main directions of its reformation are revealed. The perspectives for perfection are estimated. The comparative analysis of foreign experience in depreciation policy formation in the developed countries in connection with realities of the domestic economy is done. The state and perspectives of machine-building industry in Ukraine are analyzed. The potential possibilities and investment attractiveness of domestic producers are estimated. The mechanism of realization of depreciation policy of enterprises is improved according to the implementation of modeling the processes of multiversion depreciation and its optimization due to adjusting the terms in using the objects of the fixed assets and the differentiation of the norms of depreciation calculation. The necessity and economic feasibility in distribution of the functions of management and accounting of company staff are justified in carrying out the depreciation policy for coordinating information flow and complex managing the process of updating the production potential.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lakkaraju, Sai K. „A SLDNF based formalization for updates and abduction“. Thesis, 2001. http://handle.uws.edu.au:8081/1959.7/381.

Der volle Inhalt der Quelle

Annotation:

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Rule based updates"

Gorman, Michael. The concise AACR2: Based on the AACR2 revision, 2004 update. Chicago: American Library Association, 2004.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Office, General Accounting. Military bases: Update on the status of bases closed in 1988, 1991, and 1993 : report to the Chairman, Subcommittee on National Security, International Affairs, and Criminal Justice, Committee on Government Reform and Oversight, House of Representatives. Washington, D.C: The Office, 1996.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hiatt, Robert M. Library of Congress Rule Interpretations - 2002 Cumulation: 1989 Base Text With All Updates Through 2002 Interfiled (Library of Congress Rule Interpretation). 2. Aufl. LIBRARY OF CONGRESS, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sime, Stuart. A Practical Approach to Civil Procedure. Oxford University Press, 2017. http://dx.doi.org/10.1093/he/9780198787570.001.0001.

Der volle Inhalt der Quelle

Annotation:

A Practical Approach to Civil Procedure guides the reader through the procedural requirements employed in the civil courts. The volume provides an overview of the key statutory provisions, rules, practice directions, and case law which govern the various stages of a civil litigation claim. Providing practical guidance, the text charts the progress of a typical civil litigation claim, from funding litigation and issuing and serving proceedings, through to trial, enforcement, and appeal. Full coverage of alternative dispute resolution is also included. Relevant sample documentation is featured throughout and introduces the forms and documents which will be encountered in practice, while key points summaries featured at the end of chapters highlight the essential points covered. This edition has been revised to incorporate rule changes up to the Civil Procedure (Amendment No 4) Rules 2014 and the 71st Update. Changes incorporated into the new edition include the replacement of county courts based on districts with a single County Court; the modernization of the rules relating to enforcing judgments against goods; fixed costs in most fast track personal injury claims; changes to the rules on costs budgeting; and the post-Jackson approach to non-compliance with court orders and directions encapsulated in the landmark case of Mitchell v News Group Newspapers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sime, Stuart. A Practical Approach to Civil Procedure. Oxford University Press, 2016. http://dx.doi.org/10.1093/he/9780198747673.001.0001.

Der volle Inhalt der Quelle

Annotation:

A Practical Approach to Civil Procedureguides the reader through the procedural requirements employed in the civil courts. The volume provides an overview of the key statutory provisions, rules, practice directions, and case law which govern the various stages of a civil litigation claim. Providing practical guidance, the text charts the progress of a typical civil litigation claim, from funding litigation and issuing and serving proceedings, through to trial, enforcement, and appeal. Full coverage of alternative dispute resolution is also included. Relevant sample documentation is featured throughout and introduces the forms and documents which will be encountered in practice, while key points summaries featured at the end of chapters highlight the essential points covered. This edition has been revised to incorporate rule changes up to the Civil Procedure (Amendment No 4) Rules 2014 and the 71st Update. Changes incorporated into the new edition include the replacement of county courts based on districts with a single County Court; the modernization of the rules relating to enforcing judgments against goods; fixed costs in most fast track personal injury claims; changes to the rules on costs budgeting; and the post-Jackson approach to non-compliance with court orders and directions encapsulated in the landmark case ofMitchell v News Group Newspapers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Steinberg, David. Burma/Myanmar. Oxford University Press, 2013. http://dx.doi.org/10.1093/wentk/9780199981687.001.0001.

Der volle Inhalt der Quelle

Annotation:

It is unlikely that any country in Asia in recent years has undergone such internal policy shifts in so short a time as Myanmar. Until recently, the former British colony had one of the most secretive, corrupt, and repressive regimes on the planet, a country where Nobel Peace Prize laureate Aung San Suu Kyi was held in continual house arrest and human rights were denied to nearly all. Yet events in Myanmar since the elections of November 2010 have profoundly altered the internal mood of the society, and have surprised even Burmese and seasoned foreign observers of the Myanmar scene. The pessimism that pervaded the society prior to the elections, and the results of that voting that prompted many foreign observers to call them a “sham” or “fraud,” gradually gave way to the realization that for reasons, variously interpreted, positive change was in the air. Taking into account the dramatic changes the country has seen in the past two years-including the establishment of a human rights commission, the release of political prisoners, and reforms in health and education-David I. Steinberg offers an updated second edition of Burma/Myanmar: What Everyone Needs to Know. More than ever, the history, culture, and internal politics of this country are crucial to understanding the breaking headlines emerging from it today and placing them in a broader context. Geographically strategic, Burma/Myanmar lies between the growing powers of China and India, and has a thousand-year history as an important realm in the region-yet it is mostly unknown to Westerners. Burma/Myanmar is a place of contradictions: a picturesque land with mountain jungles and monsoon plains, it is one of the world's largest producers of heroin. Though it has extensive natural resources including oil, gas, teak, metals, and minerals, it is one of the poorest countries in the world. And despite a half-century of military-dominated rule, change is beginning to work its way through the beleaguered nation, as it moves to a more pluralistic administrative system reflecting its pluralistic cultural, multi-ethnic base. Authoritative and balanced, Burma/Myanmar is an essential book on a country in the throes of historic change.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ślusarski, Marek. Metody i modele oceny jakości danych przestrzennych. Publishing House of the University of Agriculture in Krakow, 2017. http://dx.doi.org/10.15576/978-83-66602-30-4.

Der volle Inhalt der Quelle

Annotation:

The quality of data collected in official spatial databases is crucial in making strategic decisions as well as in the implementation of planning and design works. Awareness of the level of the quality of these data is also important for individual users of official spatial data. The author presents methods and models of description and evaluation of the quality of spatial data collected in public registers. Data describing the space in the highest degree of detail, which are collected in three databases: land and buildings registry (EGiB), geodetic registry of the land infrastructure network (GESUT) and in database of topographic objects (BDOT500) were analyzed. The results of the research concerned selected aspects of activities in terms of the spatial data quality. These activities include: the assessment of the accuracy of data collected in official spatial databases; determination of the uncertainty of the area of registry parcels, analysis of the risk of damage to the underground infrastructure network due to the quality of spatial data, construction of the quality model of data collected in official databases and visualization of the phenomenon of uncertainty in spatial data. The evaluation of the accuracy of data collected in official, large-scale spatial databases was based on a representative sample of data. The test sample was a set of deviations of coordinates with three variables dX, dY and Dl – deviations from the X and Y coordinates and the length of the point offset vector of the test sample in relation to its position recognized as a faultless. The compatibility of empirical data accuracy distributions with models (theoretical distributions of random variables) was investigated and also the accuracy of the spatial data has been assessed by means of the methods resistant to the outliers. In the process of determination of the accuracy of spatial data collected in public registers, the author’s solution was used – resistant method of the relative frequency. Weight functions, which modify (to varying degree) the sizes of the vectors Dl – the lengths of the points offset vector of the test sample in relation to their position recognized as a faultless were proposed. From the scope of the uncertainty of estimation of the area of registry parcels the impact of the errors of the geodetic network points was determined (points of reference and of the higher class networks) and the effect of the correlation between the coordinates of the same point on the accuracy of the determined plot area. The scope of the correction was determined (in EGiB database) of the plots area, calculated on the basis of re-measurements, performed using equivalent techniques (in terms of accuracy). The analysis of the risk of damage to the underground infrastructure network due to the low quality of spatial data is another research topic presented in the paper. Three main factors have been identified that influence the value of this risk: incompleteness of spatial data sets and insufficient accuracy of determination of the horizontal and vertical position of underground infrastructure. A method for estimation of the project risk has been developed (quantitative and qualitative) and the author’s risk estimation technique, based on the idea of fuzzy logic was proposed. Maps (2D and 3D) of the risk of damage to the underground infrastructure network were developed in the form of large-scale thematic maps, presenting the design risk in qualitative and quantitative form. The data quality model is a set of rules used to describe the quality of these data sets. The model that has been proposed defines a standardized approach for assessing and reporting the quality of EGiB, GESUT and BDOT500 spatial data bases. Quantitative and qualitative rules (automatic, office and field) of data sets control were defined. The minimum sample size and the number of eligible nonconformities in random samples were determined. The data quality elements were described using the following descriptors: range, measure, result, and type and unit of value. Data quality studies were performed according to the users needs. The values of impact weights were determined by the hierarchical analytical process method (AHP). The harmonization of conceptual models of EGiB, GESUT and BDOT500 databases with BDOT10k database was analysed too. It was found that the downloading and supplying of the information in BDOT10k creation and update processes from the analyzed registers are limited. An effective approach to providing spatial data sets users with information concerning data uncertainty are cartographic visualization techniques. Based on the author’s own experience and research works on the quality of official spatial database data examination, the set of methods for visualization of the uncertainty of data bases EGiB, GESUT and BDOT500 was defined. This set includes visualization techniques designed to present three types of uncertainty: location, attribute values and time. Uncertainty of the position was defined (for surface, line, and point objects) using several (three to five) visual variables. Uncertainty of attribute values and time uncertainty, describing (for example) completeness or timeliness of sets, are presented by means of three graphical variables. The research problems presented in the paper are of cognitive and application importance. They indicate on the possibility of effective evaluation of the quality of spatial data collected in public registers and may be an important element of the expert system.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Rule based updates"

Bai, Yun, und Yan Zhang. „On the Computational Aspect of Rule Based Database Updates“. In Engineering of Intelligent Systems, 71–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45517-5_9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hassan, Rola, Hanan Faruqui, Reem Alquraa, Ayman Eissa, Fatma Alshaiki und Mohamed Cheikh. „Classification Criteria and Clinical Practice Guidelines for Rheumatic Diseases“. In Skills in Rheumatology, 521–66. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-8323-0_25.

Der volle Inhalt der Quelle

Annotation:

AbstractRheumatic diseases have many classification criteria and management guidelines that are continuously being updated in order to improve the quality of healthcare provision. With these ever-evolving criteria and guidelines, practicing clinicians need an easy way to get to the core of these updates and to retain them in an easy and memorable way. Classification criteria are meant to differentiate between similar diseases and also to confirm or rule out a certain disease based on inclusion and exclusion criteria. The diagnosis of rheumatic diseases can be challenging since many clinical signs and symptoms as well as many laboratory markers are not specific and can be positive in many diseases.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nair, Sreeja S., Gustavo Petri und Marc Shapiro. „Proving the Safety of Highly-Available Distributed Objects“. In Programming Languages and Systems, 544–71. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_20.

Der volle Inhalt der Quelle

Annotation:

AbstractTo provide high availability in distributed systems, object replicas allow concurrent updates. Although replicas eventually converge, they may diverge temporarily, for instance when the network fails. This makes it difficult for the developer to reason about the object’s properties, and in particular, to prove invariants over its state. For the subclass of state-based distributed systems, we propose a proof methodology for establishing that a given object maintains a given invariant, taking into account any concurrency control. Our approach allows reasoning about individual operations separately. We demonstrate that our rules are sound, and we illustrate their use with some representative examples. We automate the rule using Boogie, an SMT-based tool.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Grundmann, Thilo, Michael Fiegert und Wolfram Burgard. „Rule Set Based Joint State Update“. In Springer Tracts in Advanced Robotics, 301–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25116-0_20.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Porres, Ivan. „Model Refactorings as Rule-Based Update Transformations“. In Lecture Notes in Computer Science, 159–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45221-8_16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lakkaraju, Sai Kiran, und Yan Zhang. „A Procedural Approach for Rule Based Update“. In Advanced Topics in Artificial Intelligence, 467–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46695-9_40.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fernandes, C. M., C. F. Lima, J. L. J. Laredo, A. C. Rosa und J. J. Merelo. „An Ant-Based Rule for UMDA’s Update Strategy“. In Advances in Artificial Life. Darwin Meets von Neumann, 391–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21314-4_49.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nakashima, Tomoharu, Takeshi Sumitani und Andrzej Bargiela. „Incremental Update of Fuzzy Rule-Based Classifiers for Dynamic Problems“. In Computer and Information Science 2012, 209–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30454-5_15.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pavani, Sri-Kaushik, Federico M. Sukno, Constantine Butakoff, Xavier Planes und Alejandro F. Frangi. „A Confidence-Based Update Rule for Self-updating Human Face Recognition Systems“. In Advances in Biometrics, 151–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01793-3_16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhang, Yan. „Constraints, causal rules and minimal change in model-based update“. In Lecture Notes in Computer Science, 609–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63614-5_59.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Rule based updates"

Erwig, Martin, und Deling Ren. „A rule-based language for programming software updates“. In the 2002 ACM SIGPLAN workshop. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/570186.570193.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tsumoto, Shusaku, und Shoji Hirano. „Incremental rule induction based on updates of statistical indices“. In 2014 IEEE 13th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC). IEEE, 2014. http://dx.doi.org/10.1109/icci-cc.2014.6921491.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yilmaz, Fatma. „A Review of the PSA Model Truncation Convergence Issues at Some ENS Plants“. In 14th International Conference on Nuclear Engineering. ASMEDC, 2006. http://dx.doi.org/10.1115/icone14-89624.

Der volle Inhalt der Quelle

Annotation:

This study provides the insights gained from the Probabilistic Safety Assessment (PSA) model update of several Entergy Nuclear South (ENS) plants with respect to truncation convergence based on the limited guidance on the issue in the industry. The industry rule of thumb, the ASME and NRC guidance and requirements on the subject have been reviewed. The recent model updates performed at some of the ENS plants (River Bend, ANO 1 and 2) considered these criteria. Based on the current criteria used in the industry for truncation convergence, the recent PSA model update results for the River Bend Station (RBS) and ANO-1 are not converging even at a low truncation limit of 1E−11/reactor-year (yr). Many improvements were introduced in the recent model updates and convergence was expected at higher truncation values. This paper discusses the issues identified that are related to the convergence of the PSA results at low truncation limits.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bridges, Robert, John Crocker, Claude DesRochers und Desmond Upcraft. „Classification of Icebreakers – Updates to Requirements“. In SNAME 10th International Conference and Exhibition on Performance of Ships and Structures in Ice. SNAME, 2012. http://dx.doi.org/10.5957/icetech-2012-123.

Der volle Inhalt der Quelle

Annotation:

Lloyd’s Register (LR) is currently developing requirements for icebreakers. In support of this activity, a series of work programs have been undertaken to ensure alignment with current and future industry application. The work programs includes a re-evaluation of the classed fleet; a series of interactive workshops with icebreaker Captains representing a variety of ice covered sea areas of operation; and ship structural nonlinear finite element (FE) analyses. The objectives of these tasks were to validate current classifications requirements for ice going ships and compare as a basis a number of previous successful icebreaker designs with actual operations. Representative structural configurations (based upon actual icebreakers) were selected for detailed hull structural assessment and this was supplemented with detailed descriptions of the operations of the ships, provided by icebreaker Masters. This paper presents some of the results from the work programs of which elements are incorporated into the update to Lloyd's Register’s rule requirements for icebreakers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xin, Yao, Wenjun Li, Yi Wang und Song Yao. „An FPGA-based High-Throughput Packet Classification Architecture Supporting Dynamic Updates for Large-Scale Rule Sets“. In IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 2021. http://dx.doi.org/10.1109/infocomwkshps51825.2021.9484440.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zha, Daochen, Kwei-Herng Lai, Kaixiong Zhou und Xia Hu. „Experience Replay Optimization“. 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/589.

Der volle Inhalt der Quelle

Annotation:

Experience replay enables reinforcement learning agents to memorize and reuse past experiences, just as humans replay memories for the situation at hand. Contemporary off-policy algorithms either replay past experiences uniformly or utilize a rule-based replay strategy, which may be sub-optimal. In this work, we consider learning a replay policy to optimize the cumulative reward. Replay learning is challenging because the replay memory is noisy and large, and the cumulative reward is unstable. To address these issues, we propose a novel experience replay optimization (ERO) framework which alternately updates two policies: the agent policy, and the replay policy. The agent is updated to maximize the cumulative reward based on the replayed data, while the replay policy is updated to provide the agent with the most useful experiences. The conducted experiments on various continuous control tasks demonstrate the effectiveness of ERO, empirically showing promise in experience replay learning to improve the performance of off-policy reinforcement learning algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xiao, Rong, Qiang Yu, Rui Yan und Huajin Tang. „Fast and Accurate Classification with a Multi-Spike Learning Algorithm for Spiking Neurons“. 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/200.

Der volle Inhalt der Quelle

Annotation:

The formulation of efficient supervised learning algorithms for spiking neurons is complicated and remains challenging. Most existing learning methods with the precisely firing times of spikes often result in relatively low efficiency and poor robustness to noise. To address these limitations, we propose a simple and effective multi-spike learning rule to train neurons to match their output spike number with a desired one. The proposed method will quickly find a local maximum value (directly related to the embedded feature) as the relevant signal for synaptic updates based on membrane potential trace of a neuron, and constructs an error function defined as the difference between the local maximum membrane potential and the firing threshold. With the presented rule, a single neuron can be trained to learn multi-category tasks, and can successfully mitigate the impact of the input noise and discover embedded features. Experimental results show the proposed algorithm has higher precision, lower computation cost, and better noise robustness than current state-of-the-art learning methods under a wide range of learning tasks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chen, Cheng-Hung, Ken W. Bosworth und Marco P. Schoen. „Investigation of Particle Swarm Optimization Dynamics“. In ASME 2007 International Mechanical Engineering Congress and Exposition. ASMEDC, 2007. http://dx.doi.org/10.1115/imece2007-41343.

Der volle Inhalt der Quelle

Annotation:

In this work, a set of operators for a Particle Swarm (PS) based optimization algorithm is investigated for the purpose of finding optimal values for some of the classical benchmark problems. Particle swarm algorithms are implemented as mathematical operators inspired by the social behaviors of bird flocks and fish schools. In addition, particle swarm algorithms utilize a small number of relatively uncomplicated rules in response to complex behaviors, such that they are computationally inexpensive in terms of memory requirements and processing time. In particle swarm algorithms, particles in a continuous variable space are linked with neighbors, therefore the updated velocity means of particles influences the simulation results. The paper presents a statistical investigation on the velocity update rule for continuous variable PS algorithm. In particular, the probability density function influencing the particle velocity update is investigated along with the components used to construct the updated velocity vector of each particle within a flock. The simulation results of several numerical benchmark examples indicate that small amount of negative velocity is necessary to obtain good optimal values near global optimality.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Horan, Paul. „Second-order neural network classifier with on-line learning capabilities“. In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1991. http://dx.doi.org/10.1364/oam.1991.tuk1.

Der volle Inhalt der Quelle

Annotation:

Higher-order neural networks allow a priori implementation of geometric invariances with the concomitant reduction in training complexity.1 The symmetries inherent in a second-order translation-invariant classifier can be exploited in an elegant optical implementation.2 An optical system based on a commercially available liquid crystal display, operating in transmission under external computer control, and with on-line learning capabilities has been constructed. The binary inputs are displayed as a series of black/white bars. A second pass through the same pattern arranged at right angles produces all the terms of the vector cross-product with itself. A third pass institutes the weight multiplication. The summed light totals are monitored with photodiodes. During the training phase the weight updates are determined by the measured light output at each iteration. Because of device limitations the learning rule must be adapted to produce a finite range of weighing values.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bezensek, Bostjan, Yuri Tkach, John Sharples und Harry Coules. „Proposed Updates to the Buried-to-Surface Flaw Recharacterization Rules in Annex E of BS 7910“. In ASME 2019 38th International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/omae2019-96327.

Der volle Inhalt der Quelle

Annotation:

Abstract BS 7910 “Guide to Methods for Assessing the Acceptability of Flaws in Metallic Structures” [1] is undergoing revision for the next edition. Updates are proposed for the Annex E flaw recharacterization guidance. The changes aim to make Annex E more applicable to real structures and to improve the synergy between the subcritical crack growth such as by fatigue and fracture of an embedded flaw. Several studies were done by WEE/37 fracture panel focusing on brittle and ductile material behaviour to support the proposed changes. These studies are summarised in the paper. The main modifications in the proposed updated Ann ex E are in: • Removal of use of Annex E for brittle fracture. • Updated guidance on recharacterized surface flaw length for ductile fracture. • Optional guidance on use of geometry-based criterion for embedded flaw break-through under ductile conditions. • Alignment of fatigue crack growth in Section 8 with the flaw break-through in Annex E.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Rule based updates"

Arctur, David K., Emaan Anwar, Sharma Chakravarthy, Maria Cobb und Miyi Chung. Implementation of a Rule-Based Framework for Managing Updates in an Object-Oriented VPF Database,. Fort Belvoir, VA: Defense Technical Information Center, November 1995. http://dx.doi.org/10.21236/ada308276.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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