Academic literature on the topic 'Complexité des certificats'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Complexité des certificats.'
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 "Complexité des certificats"
1
Péchillon, E. "Les outils pour la rédaction des certificats de soins sans consentement." European Psychiatry 30, S2 (November 2015): S2. http://dx.doi.org/10.1016/j.eurpsy.2015.09.016.
Full textAbstract:
Depuis maintenant plus de quatre ans les psychiatres sont confrontés aux particularités d’application d’une nouvelle loi de soins sans consentement. En apparence elle succède à ses devancières de 1838 et 1990 alors qu’en réalité elle s’appuie sur des concepts juridiques nouveaux empruntés au droit constitutionnel ou au droit européen. La particularité du nouveau texte est de donner une place prépondérante au juge des libertés et de la détention (JLD). Chacun a pu constater des différences importantes d’appréciation de la nécessité des soins entre médecins et magistrats. Il en résulte un nombre non négligeable de mainlevée des soins par décision de justice. La session apporte les notions et concepts nécessaires pour que les psychiatres rédigent leurs certificats de telle sorte qu’ils soient bien compris par les magistrats. Une première communication présente les concepts à l’origine de la loi (constitution, convention européenne de sauvegarde des Droits de l’homme, recommandation 2004/10 du conseil de l’Europe…). La complexité de la loi conduit à la nécessité d’une interprétation de nombre de ses articles. La jurisprudence commence à donner des pistes de compréhension utiles. Ce sera l’objet de la deuxième intervention avant de réfléchir sur les aspects cliniques à faire figurer dans les certificats qui constituent le moyen privilégié de communication avec les JLD.
2
Ambainis, A., A. M. Childs, F. Le Gall, and S. Tani. "The quantum query complexity of certification." Quantum Information and Computation 10, no. 3&4 (March 2010): 181–89. http://dx.doi.org/10.26421/qic10.3-4-1.
Full textAbstract:
We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced \nand formula. We show that the query complexity is $\tilde\Theta(d^{(k+1)/2})$ for 0-certificates, and $\tilde\Theta(d^{k/2})$ for 1-certificates. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is $\tilde O(d^{(k+1)/2})$. Our lower bound relies on the fact that the quantum adversary method obeys a direct sum theorem.
3
Yan, Junzhi, Na Li, Bo Yang, Min Li, Li Su, and Shen He. "Decentralized Certificate Management for Network Function Virtualisation (NFV) Implementation in Telecommunication Networks." Wireless Communications and Mobile Computing 2021 (October 18, 2021): 1–10. http://dx.doi.org/10.1155/2021/6985492.
Full textAbstract:
The certificate management complexity and cost increase when PKI technology is leveraged into Network Function Virtualisation (NFV), a significant enabling technology for 5G networks. The expected security of PKI cannot be met due to the unavailability of the certificate revocation inquiry in the telecommunication operator’s core network. This paper analyses the issues and challenges during the NFV implementation and proposes a blockchain-based decentralized NFV certificate management mechanism. During instantiation, the Virtual Network Functions (VNF) instance generates certificates according to the certificate profile provided in the VNF package. The certificate management unit is responsible for the certificate enrolment, renewal, and revocation. The certificates submitted to the decentralized certificate management system by the instance will be recorded into the ledger after validation and consensus. The experiment and analysis show the transaction throughput, and the transaction delay is noncritical in practice, which could be fulfilled by the proposed mechanism. The certificate inquiry performance is critical, which can be facilitated by the decentralized deployment of inquiry nodes.
4
Aaronson, Scott. "Quantum certificate complexity." Journal of Computer and System Sciences 74, no. 3 (May 2008): 313–22. http://dx.doi.org/10.1016/j.jcss.2007.06.020.
Full text
5
Nieradko-Iwanicka, Barbara, and Janusz Iwanicki. "Musculoskeletal diseases as the basis for issuing disability certificates for children." Rheumatology 61, no. 2 (May 10, 2023): 97–103. http://dx.doi.org/10.5114/reum/163095.
Full textAbstract:
IntroductionThere are nearly 240 million children living with disabilities worldwide – 1 in 10 of all children. The Polish disability certification system is characterized by a significant level of complexity. At the same time the Social Insurance Institution (ZUS), Agricultural Social Insurance Fund (KRUS) and poviat/city disability adjudication teams, voivodeship disability adjudication teams/councils, the Ministry of Family and Social Policy supervising poviat and voivodeship teams/councils issue different certificates. The system is complemented by the appeals to the court which resolve complaints against the decisions of voivodship teams. Children are considered individuals under 16 years of age. They can get a disability certificate if necessary. The aim of the study was to investigate the characteristics of children obtaining a disability certificate due to diseases of the locomotor system in Lublin within the last 16 years.Material and methodsThe authors asked the Municipal Disability Adjudication Council in Lublin to provide data on the number of disability certificates issued for children up to 16 years of age in the years 2006–2021.The data used for the analysis come from the electronic system that collects and processes them according to the assumed patterns.ResultsIn the years 2006–2021 the Municipal Disability Adjudication Council in Lublin issued 9,929 disability certificates for children up to 16 years of age. The total number of certificates issued because of musculoskeletal disorders was 1,085 (mean 68/year). Majority of the recipients were 8–16 years old. There were 524 girls (mean 32.75/year) and 561 boys (mean 35.06/year).ConclusionsIn children musculoskeletal problems are in the third position after diseases of the respiratory tract and developmental disorders as the reason for obtaining a disability certificate in Lublin. Comparing this data with others, it can be concluded that the situation is similar to data from developed countries.
6
K.C, Amir, Harri Forsgren, Kaj Grahn, Timo Karvi, and Göran Pulkkis. "Security and Trust of Public Key Cryptography for HIP and HIP Multicast." International Journal of Dependable and Trustworthy Information Systems 2, no. 3 (July 2011): 17–35. http://dx.doi.org/10.4018/jdtis.2011070102.
Full textAbstract:
Host Identity Protocol (HIP) gives cryptographically verifiable identities to hosts. These identities are based on public key cryptography and consist of public and private keys. Public keys can be stored, together with corresponding IP addresses, in DNS servers. When entities are negotiating on a HIP connection, messages are signed with private keys and verified with public keys. Even if this system is quite secure, there is some vulnerability concerning the authenticity of public keys. The authors examine some possibilities to derive trust in public parameters. These are DNSSEC and public key certificates (PKI). Especially, the authors examine how to implement certificate handling and what is the time complexity of using and verifying certificates in the HIP Base Exchange. It turned out that certificates delayed the HIP Base Exchange only some milliseconds compared to the case where certificates are not used. In the latter part of our article the authors analyze four proposed HIP multicast models and how they could use certificates. There are differences in the models how many times the Base Exchange is performed and to what extent existing HIP specification standards must be modified.
7
He, Kun, Qian Li, and Xiaoming Sun. "A tighter relation between sensitivity complexity and certificate complexity." Theoretical Computer Science 762 (March 2019): 1–12. http://dx.doi.org/10.1016/j.tcs.2018.08.025.
Full text
8
Kim, Min-Ji. "A Study on the Legislative Improvements of Personal Information Protection of Domestic Violence Victims: Focusing on the restrictive system of issuing certificates under the Act on Registration of Family Relations." Korean Association Of Victimology 31, no. 2 (August 31, 2023): 33–66. http://dx.doi.org/10.36220/kjv.2023.31.2.33.
Full textAbstract:
According to the Inconsistency with the Constitution on the part relating to “request of the issuance of a family relation certificate and an identification certificate by lineal blood relatives among certificates prescribed in Article 15” in the main clause of Article 14 (1) of the Act on Registration of Family Relations, the Act on Registration of Family Relations was amended to limit the issuance of certificates and disclosure of information to be entered to persons designated by domestic violence victims and has been in effect since January 1, 2022. This amendment is important in that victims of domestic violence were given control of personal information under the Act on Registration of Family Relations.
However, limitations may point out in that the 2022 revised Family Relations Registration Act is not easy to understand due to its complexity and lacks protection of the interests of those subject to disclosure restrictions, not domestic violence offenders. Furthermore, further improvement is required considering the need to protect personal information in our current society, the increased risk of leakage due to strengthening access to personal information, and changes in public perception of families. Accordingly, in the short-term improvement direction, it was proposed to add immediate notification and periodic verification procedures, and to apply the system to protect personal information of crime victims other than domestic violence. A plan to reduce the scope of claimants for issuance of certificates was proposed as a mid- to long-term improvement direction.
Based on the improvement direction proposed, the 2022 revised Family Relations Registration Act will play a role as an effective system for actively guaranteeing personal information of domestic violence victims, suppress the misuse, abuse, and leakage of personal information and aim for the legitimate use of personal information. under the Act on Registration of Family Relations.
9
Hardhini, Euis, Wira Franciska, and Anriz Nazaruddin Halim. "PERLINDUNGAN HUKUM BAGI PEMILIK TANAH ATAS PEMBATALAN SERTIFIKAT OLEH PENGADILAN TATA USAHA NEGARA (PTUN) YANG BERASAL DARI TANAH ADAT TANPA ADANYA PELEPASAN HAK." SENTRI: Jurnal Riset Ilmiah 3, no. 1 (January 7, 2024): 8–15. http://dx.doi.org/10.55681/sentri.v3i1.2115.
Full textAbstract:
Landowners face serious challenges when their land titles are annulled by the Administrative Court (PTUN) rooted in customary lands. In the course of this law, the main focus is the right of ownership, the existence of landowners, and the influence of customary land. Without a clear waiver of rights, this legal complexity calls into question the existence and right of ownership of the landowner. In this context, a legal and ethical obligation arises to protect the rights of landowners, especially those from indigenous lands, answer the call of legal protection, and ensure justice and equality before the law. The method used in this research is normative juridical legal research, which was carried out as an effort to obtain the necessary data regarding the problem. The data used is primary data as supporting legal material for secondary data. Data analysis was carried out using qualitative analysis methods. The result of this study is that landowners are at risk of losing legal certainty and protection if their certificates are canceled by the Administrative Court, especially related to customary land without a clear waiver of rights. The cancellation requires the revocation of the certificate, resulting in the inability of the certificate holder to physically control the land and cause harm to all parties, according to the theory of the consequences of Soeroso law and the legal protection of landowners related to the cancellation of certificates by the court from customary land without waiver involving the settlement of land disputes. Generally, land disputes can be resolved through customary deliberations, led by Adat Para-Para, or through a court in the settlement of land cases.
10
Chang, Ya-Fen, and Chin-Chen Chang. "Schemes for Digital Gift Certificates with Low Computation Complexity." Informatica 16, no. 4 (January 1, 2005): 503–18. http://dx.doi.org/10.15388/informatica.2005.112.
Full textDissertations / Theses on the topic "Complexité des certificats"
1
Sunny, Anupa. "Complexity measures through the lens of two-player games and signatures of the hypercube." Electronic Thesis or Diss., Université Paris Cité, 2023. http://www.theses.fr/2023UNIP7070.
Full textAbstract:
Les mesures de complexité des fonctions booléennes capturent divers aspects de la difficulté du calcul d'une fonction et leur étude consiste à trouver des connexions entre différentes mesures de complexité. Dans la première partie de cette thèse, nous introduisons et étudions la complexité de jeux de certificats, une mesure de complexité basée sur la probabilité de gagner un jeu dans lequel deux joueurs reçoivent des entrées avec des valeurs de fonctions différentes et doivent produire un indice i pour lequel leurs entrées diffèrent, sans communiquer. Nous donnons des bornes supérieures et inférieures pour les stratégies à base de pièces privées, de pièces publiques, d'intrication partagée et de non-signalisation, et nous prouvons quelques résultats de séparations. D'une part, nous montrons que la complexité dans le cas des pièces publiques est majorée par les complexités de requête aléatoire et de certificat. D'autre part, nous montrons qu'elle est minorée par la complexité fractionnelle de certificat, ce qui en fait un bon candidat pour trouver des bornes inférieures fortes sur la complexité de requête aléatoire. La complexité dans le cas des pièces privées est minorée par la complexité de requête aléatoire à erreur nulle. Nous utilisons la non-signalisation, une notion d'information quantique, pour minorer par n la complexité de jeux de certificats quantiques de la fonction OR, dont la complexité de requête quantique est de Θ(√n), puis nous montrons que ce "goulot d'étranglement de non-signalisation" s'applique à toutes les fonctions à sensibilité, à sensibilité de bloc ou à sensibilité de bloc fractionnaire élevée. Nous considérons également la version mono-bit des jeux de certificats, où les entrées des deux joueurs sont restreints à une distance de Hamming de 1. Nous prouvons que la version mono-bit de la complexité de jeux de certificats avec aléa partagé est égale à la sensibilité à un facteur constant près, ce qui donne une nouvelle caractérisation de la sensibilité. D'autre part, la version mono-bit de la complexité de jeux de certificats avec aléa privé est égale à λ2, où λ est la sensibilité spectrale. Dans la deuxième partie de cette thèse, nous revisitons la célèbre preuve de la conjecture de la sensibilité par Hao Huang. En utilisant des techniques spectrales, Huang a prouvé que tout sous-graphe de l'hypercube Hn de dimension n induit sur plus de la moitié des sommets a un degré maximal d'au moins √n. Combiné avec des travaux antérieurs, ce résultat a complété une preuve de la conjecture de la sensibilité. Nous en donnons une preuve alternative en utilisant seulement la dépendance linéaire des vecteurs associés aux sommets de l'hypercube. Notre approche permet de mieux comprendre les propriétés structurelles du sous-graphe induit, en plus du plus grand degré. En particulier, nous prouvons que dans tout sous-graphe induit de Hn avec plus de la moitié du nombre de sommets, il existe deux sommets, l'un de parité impaire et l'autre de parité paire, chacun ayant au moins n sommets à une distance au plus égale à 2. Comme application, nous montrons que pour toute fonction booléenne f, le degré polynomial est majoré par le produit de la sensibilité 0 et de la sensibilité 1, s0(f)s1(f), une affirmation strictement plus forte qui implique le théorème de Huang. Nous obtenons également des relations structurelles pour les sous-graphes induits à distance 3. Un ingrédient clé de la preuve de Huang était des hypercubes signés avec la propriété que chaque cycle de longueur 4 est affecté d'un signe négatif. Nous examinons en détail cette signature et donnons une signature quasi-optimale qui utilise le nombre minimum de bords négatifs tout en garantissant que chaque cycle de longueur 4 est négatif. Ce problème s'avère être lié à l'un des problèmes d'Erdös sur le plus grand sous-graphe de l'hypercube exempt de 4-cyclesComplexity measures of Boolean functions capture various aspects of the hardness of computing a function and their study is about finding connections between different complexity measures. In the first part of this thesis, we introduce and study Certificate Game complexity, a measure of complexity based on the probability of winning a game in which two players are given inputs with different function values and are asked to output some index i where their inputs differ, in a zero-communication setting. We give upper and lower bounds for private coin, public coin, shared entanglement and non-signaling strategies, and give some separations. We show that complexity in the public coin model is bounded above by Randomised query and Certificate complexities. On the other hand, it is bounded below by fractional certificate complexity, making it a good candidate to prove strong lower bounds on randomised query complexity. Complexity in the private coin model is bounded below by zero-error randomised query complexity. The quantum measure highlights an interesting and surprising difference between classical and quantum query models. While public coin certificate game complexity is bounded above by randomised query complexity, quantum certificate game complexity can be quadratically larger than quantum query complexity. We use non-signaling, a notion from quantum information, to give a lower bound of n on the quantum certificate game complexity of the OR function, whose quantum query complexity is Θ(√n) and then go on to show that this "non-signaling bottleneck" applies to all functions with high sensitivity, block sensitivity or fractional block sensitivity. We also consider the single-bit version of certificate games, where the inputs of the two players are restricted to having Hamming distance 1. We prove that the single-bit version of certificate game complexity with shared randomness is equal to sensitivity up to constant factors, thus giving a new characterization of sensitivity. On the other hand, the single-bit version of certificate game complexity with private randomness is equal to λ2, where λ is the spectral sensitivity. In the second part of this thesis, we revisit the celebrated proof of the sensitivity conjecture by Hao Huang. Using spectral techniques, Huang proved that every subgraph of the hypercube Hn of dimension n induced on more than half the vertices has maximum degree at least √n. Combined with earlier work, this completed a proof of the sensitivity conjecture. We show an alternate proof of Huang's result using only linear dependency of vectors associated with the vertices of the hypercube. Our approach helps gain insight on more structural properties of the induced subgraph in addition to the largest degree. In particular, we prove that in any induced subgraph of Hn with more than half the number of vertices, there are two vertices, one of odd parity and the other of even parity, each with at least n vertices at distance at most 2. As an application, we show that for any Boolean function f, the polynomial degree is bounded above by the product of 0-sensitivity and 1-sensitivity, s0(f)s1(f), a strictly stronger statement which implies Huang's theorem. We also obtain structural relations for induced subgraphs at distance 3. A key implement in Huang's proof was signed hypercubes with the property that every cycle of length 4 is assigned a negative sign. We take a detailed look at this signature and give a nearly optimal signature that uses the minimum number of negative edges while ensuring that every 4-cycle is negative. This problem turns out to be related to one of Erdös' problems on the largest 4-cycle free subgraph of the hypercube
2
WEGLEAU, SERGE. "Le certificat medical pour coups et blessures volontaires : sa complexite." Lille 2, 1988. http://www.theses.fr/1988LIL2M129.
Full text
3
Tsagari, Dina. "The complexity of test washback an empirical study." Frankfurt, M. Berlin Bern Bruxelles New York, NY Oxford Wien Lang, 2007. http://d-nb.info/994779968/04.
Full text
4
Arkoudas, Konstantine. "Simplifying transformations for type-alpha certificates." 2001. http://hdl.handle.net/1721.1/6680.
Full textAbstract:
This paper presents an algorithm for simplifying NDL deductions. An array of simplifying transformations are rigorously defined. They are shown to be terminating, and to respect the formal semantis of the language. We also show that the transformations never increase the size or complexity of a deduction---in the worst case, they produce deductions of the same size and complexity as the original. We present several examples of proofs containing various types of "detours", and explain how our procedure eliminates them, resulting in smaller and cleaner deductions. All of the given transformations are fully implemented in SML-NJ. The complete code listing is presented, along with explanatory comments. Finally, although the transformations given here are defined for NDL, we point out that they can be applied to any type-alpha DPL that satisfies a few simple conditions.
5
Rothe, Jörg [Verfasser]. "Complexity of certificates, heuristics, and counting types, with applications to cryptography and circuit theory / von Jörg-Matthias Rothe." 1999. http://d-nb.info/982741014/34.
Full text
6
Alves, Andreia Ana da Rocha. "A complexidade do sistema fiscal e o seu impacto no exercício da atividade dos profissionais de contabilidade em Portugal." Master's thesis, 2021. http://hdl.handle.net/1822/73708.
Full textAbstract:
Relatório de estágio de mestrado em ContabilidadeEm Portugal, os Contabilistas Certificados são profissionais que no âmbito da sua atividade fornecem diversos serviços específicos aos seus clientes. Sendo profissionais que assessoram os contribuintes em questões fiscais, são eles que lidam diariamente com a excessiva complexidade do sistema fiscal português pelo que a sua visão relativamente a este tema é relevante. O objetivo principal do presente estudo é compreender as perceções dos Contabilistas Certificados sobre a complexidade fiscal e o seu impacto no exercício da sua atividade. Para dar cumprimento ao objetivo de investigação foi adotada uma abordagem qualitativa, exploratória e interpretativa, consistindo a recolha de dados na realização de entrevistas a uma amostra de Contabilistas Certificados portugueses. Relativamente à legislação, os detalhes, a ambiguidade e as alterações legislativas são os mais amplamente mencionados fatores de complexidade. No que diz respeito à estrutura do sistema, verifica-se complexidade aquando da promulgação da legislação, da orientação tributária, das inspeções tributárias, dos recursos fiscais e no processo administrativo de elaboração e apresentação de impostos. Ao longo do tempo, o sistema fiscal tem-se tornado mais complexo a nível estrutural e legislativo. Porém, do ponto de vista operacional, o sistema fiscal tem vindo a apresentar melhorias devido à automatização e informatização de áreas relativas às atividades de cumprimento fiscal. Foi possível constatar que os fatores de complexidade originam impactos no exercício da atividade destes profissionais. O planeamento fiscal torna-se mais difícil de concretizar, sendo mais conservador, há também um maior incumprimento fiscal involuntário, existem maiores custos psicológicos relacionados com a elaboração e apresentação de declarações fiscais e uma maior necessidade de atualizações fiscais com custos associados. O tempo gasto em atualizações fiscais afeta negativamente o exercício da atividade em outras áreas que necessitam de levar a cabo. A complexidade condiciona os serviços que os profissionais oferecem aos seus clientes, havendo alguma evidência de que a complexidade está associada a uma maior insatisfação no exercício da atividade.
In Portugal, Certified Accountants are professionals who, within the scope of their activity, provide various specific services to their clients. As professionals who advise taxpayers on tax issues, they deal with the excessive complexity of the Portuguese tax system on a daily basis and their views on this issue are relevant. The main objective of this study is to understand Certified Accountants' perceptions of fiscal complexity and its impact on the exercise of their activity. In order to fulfill the research objective, a qualitative, exploratory and interpretative approach was adopted, consisting of the collection of data through interviews with a sample of certified Portuguese accountants. Regarding legislation, details, ambiguity and legislative changes are the most widely mentioned factors of complexity. With regard to the system's structure, there is complexity at the time of enactment of legislation, tax guidance, tax inspections, tax resources and in the administrative process of drafting and submitting taxes. As time goes by, the tax system has become more complex on a structural and legislative level. However, from the operational point of view, the tax system has been showing improvements due to the automation and computerization of areas related to tax compliance by the Tax Administration. It was possible to see that the complexity factors have an impact on the exercise of these professionals' activities. Fiscal planning becomes more difficult to accomplish and more conservative, there is a higher involuntary fiscal default, there are higher psychological costs related to the elaboration and presentation of tax returns and a greater need for fiscal updates with associated costs. The time spent on fiscal updates negatively affects the exercise of the activity in other areas that need to be carried out. Complexity conditions the services that professionals offer to their clients, and there is some evidence that complexity is associated with a greater dissatisfaction in the exercise of the activity.
Book chapters on the topic "Complexité des certificats"
1
Hellerstein, Lisa. "Certificate Complexity and Exact Learning." In Encyclopedia of Algorithms, 286–90. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_66.
Full text
2
Hellerstein, Lisa. "Certificate Complexity and Exact Learning." In Encyclopedia of Algorithms, 1–5. Boston, MA: Springer US, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_66-2.
Full text
3
Hellerstein, Lisa. "Certificate Complexity and Exact Learning." In Encyclopedia of Algorithms, 131–34. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_66.
Full text
4
He, Kun, Qian Li, and Xiaoming Sun. "A Tighter Relation Between Sensitivity Complexity and Certificate Complexity." In Lecture Notes in Computer Science, 262–74. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62389-4_22.
Full text
5
Ambainis, Andris, Krišjānis Prūsis, and Jevgēnijs Vihrovs. "Sensitivity Versus Certificate Complexity of Boolean Functions." In Computer Science – Theory and Applications, 16–28. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-34171-2_2.
Full text
6
Berbecaru, Diana, Antonio Lioy, and Marius Marian. "On the Complexity of Public-Key Certificate Validation." In Lecture Notes in Computer Science, 183–203. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45439-x_13.
Full text
7
Morizumi, Hiroki. "Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions." In Advanced Information Systems Engineering, 104–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44602-7_9.
Full text
8
Ambainis, Andris, and Krišjānis Prūsis. "A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity." In Mathematical Foundations of Computer Science 2014, 33–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44465-8_4.
Full text
9
Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Đorđe Žikelić. "MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives." In Computer Aided Verification, 86–112. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37709-9_5.
Full textAbstract:
AbstractMarkov decision processes can be viewed as transformers of probability distributions. While this view is useful from a practical standpoint to reason about trajectories of distributions, basic reachability and safety problems are known to be computationally intractable (i.e., Skolem-hard) to solve in such models. Further, we show that even for simple examples of MDPs, strategies for safety objectives over distributions can require infinite memory and randomization.In light of this, we present a novel overapproximation approach to synthesize strategies in an MDP, such that a safety objective over the distributions is met. More precisely, we develop a new framework for template-based synthesis of certificates as affine distributional and inductive invariants for safety objectives in MDPs. We provide two algorithms within this framework. One can only synthesize memoryless strategies, but has relative completeness guarantees, while the other can synthesize general strategies. The runtime complexity of both algorithms is in PSPACE. We implement these algorithms and show that they can solve several non-trivial examples.
10
Chen, Xiaohong, Zhengyao Lin, Minh-Thai Trinh, and Grigore Roşu. "Towards a Trustworthy Semantics-Based Language Framework via Proof Generation." In Computer Aided Verification, 477–99. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_23.
Full textAbstract:
AbstractWe pursue the vision of an ideal language framework, where programming language designers only need to define the formal syntax and semantics of their languages, and all language tools are automatically generated by the framework. Due to the complexity of such a language framework, it is a big challenge to ensure its trustworthiness and to establish the correctness of the autogenerated language tools. In this paper, we propose an innovative approach based on proof generation. The key idea is to generate proof objects as correctness certificates for each individual task that the language tools conduct, on a case-by-case basis, and use a trustworthy proof checker to check the proof objects. This way, we avoid formally verifying the entire framework, which is practically impossible, and thus can make the language framework both practical and trustworthy. As a first step, we formalize program execution as mathematical proofs and generate their complete proof objects. The experimental result shows that the performance of our proof object generation and proof checking is very promising.
Conference papers on the topic "Complexité des certificats"
1
Wirz, Victor Hugo, and Pedro Nuno Moura. "An Introduction to the Complexity Class of Pure Nash Equilibrium." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/etc.2023.229527.
Full textAbstract:
Taxonomy of problems in Computer Science has been typically done with formulations as decision problems. This approach is inadequate for many search problems of interest when the structure of the instance in itself guarantees the existence of a positive certificate. In this paper, we provide an introduction to the class of problems PLS and its connections with finding Pure Nash Equilibrium in Congestion Games.
2
Ammon, Sabine, Alexandra Kljagin, Juliane Rettschlag, and Martina Vortel. "The Berlin ethics certificate: conceptualizing interdisciplinarity as a core building block of ethics in engineering education." In SEFI 50th Annual conference of The European Society for Engineering Education. Barcelona: Universitat Politècnica de Catalunya, 2022. http://dx.doi.org/10.5821/conference-9788412322262.1422.
Full textAbstract:
To address the need for more responsible research and innovation, there is a growing call to integrate ethics education across the science and engineering curriculum. Accordingly, ethics education must not be limited to the avoidance of scientific misconduct but rather be oriented toward addressing the complexity of planetary challenges and realizing social good. Designing curricula to accommodate the ambition of integrated ethics, however, remains a great institutional and epistemic challenge. In this paper, we introduce the Berlin Ethics Certificate (BEC) at the Technical University of Berlin, to demonstrate how this challenge can be addressed by using interdisciplinarity as a core building block of integrated ethics education. The BEC’s unique approach to ethics education enables the positioning of ethical issues in all study programs within the university by designing futureoriented interdisciplinary courses open to all students, be they from the humanities, natural or engineering sciences. The paper outlines the BEC’s conceptualization of interdisciplinarity, ultimately arguing that interdisciplinary ethics education must be built upon the epistemic practice of situating knowledge. Methodologically, we show how the BEC approaches integrated ethics education through three iterative steps: 1) situating disciplinary knowledge in relation to other forms of knowledge, values and experiences (by focusing on multidisciplinary learning experiences), 2) establishing a common epistemic practice of collaboration (by focusing on interdisciplinary learning experiences), and 3) actively engaging with non-academic stakeholders to create responsible technology and take ethical action beyond the university (by focusing on transdisciplinary learning experiences). Examples of how the BEC implements this methodology are shown, which may serve as suggestions of best practices in integrated ethics education.
3
Lyon, Tim S., and Lucía Gómez Álvarez. "Automating Reasoning with Standpoint Logic via Nested Sequents." In 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/kr.2022/26.
Full textAbstract:
Standpoint logic is a recently proposed formalism in the context of knowledge integration, which advocates a multi-perspective approach permitting reasoning with a selection of diverse and possibly conflicting standpoints rather than forcing their unification. In this paper, we introduce nested sequent calculi for propositional standpoint logics---proof systems that manipulate trees whose nodes are multisets of formulae---and show how to automate standpoint reasoning by means of non-deterministic proof-search algorithms. To obtain worst-case complexity-optimal proof-search, we introduce a novel technique in the context of nested sequents, referred to as "coloring," which consists of taking a formula as input, guessing a certain coloring of its subformulae, and then running proof-search in a nested sequent calculus on the colored input. Our technique lets us decide the validity of standpoint formulae in CoNP since proof-search only produces a partial proof relative to each permitted coloring of the input. We show how all partial proofs can be fused together to construct a complete proof when the input is valid, and how certain partial proofs can be transformed into a counter-model when the input is invalid. These "certificates" (i.e. proofs and counter-models) serve as explanations of the (in)validity of the input.
4
Higley, James B., David A. McLees, and Mohammad A. Zahraee. "A Case Study in Laboratory-Based Online Courses: Teaching CNC Programming." In ASME 2003 International Mechanical Engineering Congress and Exposition. ASMEDC, 2003. http://dx.doi.org/10.1115/imece2003-42204.
Full textAbstract:
Asynchronous web based instruction, more commonly known as online education or distance learning, has been available for some time. This technology has brought education within the reach of many who would otherwise be unable to attend live classes. Time schedules and distance no longer have a bearing on attending a course. Even group projects are manageable with email and discussion groups. Many courses convert quite well to the online format, and studies have shown that students can learn as much from online courses as from live courses. In many cases, multiple course certificate programs and even some complete degree programs are offered online. As inviting as online courses may be, they do have their limitations, especially classes with a laboratory component. A number of institutions have offered laboratory-based classes in an online format with varying degrees of complexity and success. In some cases, students travel to the institution a limited number of times for extensive laboratory experiences while other institutions use what might best be described as virtual reality based systems. This paper discusses Purdue University Calumet’s first laboratory-based online course, MFET 275, Computer Numerical Control Programming Application. A combination of technologies makes this course successful and effective. Development procedures for this course along with technology used, online pedagogy issues, and course assessment are covered in this paper. Suggestions for future course development complete the discussion.
5
Liebenberg, Marais, Claudia C. Magalha˜es, and David Eduardo G. P. Bueno. "On the Design of an Operator Training Simulator in a South African Pipeline Network." In 2008 7th International Pipeline Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/ipc2008-64527.
Full textAbstract:
Pipeline operating companies require skilled employees to operate their pipeline network with safety and meeting the customer’s nominations, seeking to reduce costs and preserve the environment. A useful pipeline operational functionality designed to train, qualify and certificate operators to perform those tasks successfully is the Operator Training Simulator (OTS). OTS reproduces operational scenarios without the necessity of being inside the control room, allowing the trainee to simulate daily operational routines such as pumps startup/shutdown, valves opening/closing, slack line prevention, leak identification and others. This work presents a detailed description of an Operator Training Simulator to be employed in a South African pipeline network, comprising around 2500km of pipes handling multi-products and crude oils. The designed OTS shall allow the trainee to have exactly the same environment the operator has at the control room, including machines, screens and functionalities like Leak Detection as well as Batch/Pig Tracking. Two modes of OTS operation are cited: an offline and an online one. The offline mode performs any simulation from a configured offline scenario. On the other hand, online mode allows the trainee to see actual real time data on a passive mode (without interfering with real operation). Besides, it can get a desirable real time scenario and continue from that point in an offline way, i.e. loading a start state scenario. Finally, it shall be presented and discussed the interaction between the OTS and the ability to reproduce local station operational sequences. The gain obtained with such interaction, as well as the consequent introduced complexity, is also commented.
6
Nita, Stefania loredana, and Marius iulian Mihailescu. "PROPOSING A SECURE FRAMEWORK FOR ELEARNING PLATFORMS USING ATTRIBUTE BASED ENCRYPTION." In eLSE 2017. Carol I National Defence University Publishing House, 2017. http://dx.doi.org/10.12753/2066-026x-17-102.
Full textAbstract:
Nowadays, technology grows fast and cloud computing and big data become important parts of the businesses. Cloud computing brings many advantages, such as flexibility, easy recovery, automatic software updates, availability – which allows users to work from everywhere. One of the most important characteristic is that cloud computing provides resources on demand, all we need is an internet connection. So, cloud computing is adopted by more and more companies due its benefits. An important aspect of the society is education. As the technology is expanding continuously, also the education needs to move in parallel. As a consequence, we can follow different courses online, on the eLearning platforms. There are many eLearning platforms, with different subjects of learning, some courses being provided by top universities, or top companies with certificate of completion after a final exam. Due to cloud computing benefits, eLearning platforms could be developed as services. Still, a sensitive subject regarding to cloud computing is its security. The cloud computing security is threatened from many points of view, because of its complexity. The security issues could occur at the communication level (because of shared infrastructure, virtualization, and configuration), architectural level (security challenges for data storage, web applications and APIs, access control), or contractual and legal level. The researchers are working continuously in order to provide strong security. For example, at the architectural level, could be used attribute based encryption or identity based encryption techniques. In this paper we propose a new framework for an eLearning environment, provided as a service, such that, it could be accessed from everywhere and on every type of device. We secure our framework using attribute based encryption scheme applied in cloud computing.
7
Zhang, Haitao, and Ke Li. "Predicting the Risk of Twist-Off for Rotary Shouldered Threaded Connections With a Statistical Approach." In ASME 2019 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/imece2019-11061.
Full textAbstract:
Abstract Fatigue is one of the most frequently encountered failure modes of rotary shouldered connections (RSC) used in drill strings. Once initiated, a fatigue crack tends to grow and ultimately lead to a twist-off, which is catastrophic and often results in lengthy non-producing time and expensive fishing operations. The complexity of the fatigue mechanism, the variabilities of material properties, and the nonlinear contact interactions of the pin and the box elements of an RSC pose a substantial challenge to accurately predicting the fatigue life of the RSC. This would require considerable conservatism to be exercised to prevent a twist-off, which causes premature retirement of drilling assets. Using a statistical approach to predict the risk of twist-off (ROTO) of each RSC on the drill string could be a more economically viable solution as it would enable quantified risk assessment and scientifically calculated tradeoffs between performance, cost, and risk of failures. In this study, a methodology for statistical prediction of the ROTO of rotary shouldered threaded connections was developed. First, static material properties, including yield strength, tensile strength, elongation, and reduction in area, were extracted from a wealth of available material certificates. Feature engineering was carried out to arrive at two independent properties, tensile strength and reduction in area. Fatigue properties were then generated with the retrieved static material data and earlier established correlations between static and fatigue properties. Afterwards, elasto-plastic finite element analyses were performed on RSCs made of the same material but with different properties to determine critical fatigue indicators, stress and strain states as respective functions of the tensile strength. Finally, Monte-Carlo simulations were conducted with respect to statistical distributions of the two independent material variables to predict the ROTO as a function of fatigue life. The predictions were found to be favorable agreement with the available full-scale fatigue test data of an API connection type.