Gotowa bibliografia na temat „Évaluation des logiciels”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Évaluation des logiciels”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Évaluation des logiciels"
Martí Ferriol, José Luis. "Herramientas informáticas disponibles para la automatización de la traducción audiovisual1 (“revoicing”)". Meta 54, nr 3 (16.10.2009): 622–30. http://dx.doi.org/10.7202/038319ar.
Pełny tekst źródłaBENKELTOUM, Nordine. "Évaluation de l'innovation des logiciels open source". Systèmes d'information & management 18, nr 3 (2013): 37. http://dx.doi.org/10.3917/sim.133.0037.
Pełny tekst źródłaMolano, L. C., A. Cuvelier i J. F. Muir. "Évaluation des logiciels de ventilation non invasive". Revue des Maladies Respiratoires 23, nr 4 (wrzesień 2006): 120. http://dx.doi.org/10.1016/s0761-8425(06)71690-4.
Pełny tekst źródłaBoissinot, Claudie, Pascale De Bandt i Denis Brossard. "Évaluation et comparaison des logiciels de traçabilité utilisés en stérilisation". Le Pharmacien Hospitalier 43, nr 175 (grudzień 2008): 201–9. http://dx.doi.org/10.1016/s0768-9179(08)74963-0.
Pełny tekst źródłaSchmidt, Colin. "Des automates intelligents ? Une évaluation des logiciels « prestataires de service »". Communication et langages 151, nr 1 (2007): 115–23. http://dx.doi.org/10.3406/colan.2007.4642.
Pełny tekst źródłaDeak, Alexander, i Carlo P. Marinello. "Utilisation des logiciels CAO-FAO pour prothèses complètes". SWISS DENTAL JOURNAL SSO – Science and Clinical Topics 125, nr 6 (15.06.2015): 721–28. http://dx.doi.org/10.61872/sdj-2015-06-06.
Pełny tekst źródłaDavies, Graham Michael, i Sally Staddon. "Description of programs (présentation, utilisation et évaluation de logiciels pour l'apprentissage des langues)". Recherche et pratiques pédagogiques en langues de spécialité - Cahiers de l'APLIUT 7, nr 2 (1987): 44–48. http://dx.doi.org/10.3406/apliu.1987.1930.
Pełny tekst źródłaPariente, A., J. Viot, R. Thiebaut, P. Perez i G. Chene. "P10-12 Évaluation de différents logiciels utilisables pour le calcul du nombre de sujets nécessaire". Revue d'Épidémiologie et de Santé Publique 52 (wrzesień 2004): 128. http://dx.doi.org/10.1016/s0398-7620(04)99342-x.
Pełny tekst źródłaSAUVANT, D., i J. L. PEYRAUD. "Calculs de ration et évaluation du risque d’acidose". INRAE Productions Animales 23, nr 4 (14.09.2010): 333–42. http://dx.doi.org/10.20870/productions-animales.2010.23.4.3312.
Pełny tekst źródłaBasso Boccabella, R., S. Dussaulx, Y. Germain, A. Hermitte-Gandolière i G. Rondelot. "Interface entre deux logiciels de prescriptions : états des lieux des difficultés rencontrées et évaluation des risques". Le Pharmacien Hospitalier et Clinicien 53, nr 2 (kwiecień 2018): 97–108. http://dx.doi.org/10.1016/j.phclin.2017.12.006.
Pełny tekst źródłaRozprawy doktorskie na temat "Évaluation des logiciels"
Pelet, Jacques. "Évaluation de l'intégrité des logiciels à caractère sécuritaire". Saint-Etienne, 1998. http://www.theses.fr/1998STET4026.
Pełny tekst źródłaHu, Olivier. "Contribution à l'évaluation des logiciels multimédias pédagogiques". Compiègne, 2001. http://www.theses.fr/2001COMP1350.
Pełny tekst źródłaMaurice, François. "Un modèle d'évaluation et d'amélioration d'entités logicielles basé sur l'utilisation de métriques". Toulouse 3, 1996. http://www.theses.fr/1996TOU30192.
Pełny tekst źródłaKanoun, Karama. "Croissance de la sûreté de fonctionnement des logiciels : caractérisation, modélisation, évaluation". Toulouse, INPT, 1989. http://www.theses.fr/1989INPT091H.
Pełny tekst źródłaHe, Peng. "Conception et évaluation des systèmes logiciels de classifications de paquets haute-performance". Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAA007/document.
Pełny tekst źródłaPacket classification consists of matching packet headers against a set of pre-defined rules, and performing the action(s) associated with the matched rule(s). As a key technology in the data-plane of network devices, packet classification has been widely deployed in many network applications and services, such as firewalling, load balancing, VPNs etc. Packet classification has been extensively studied in the past two decades. Traditional packet classification methods are usually based on specific hardware. With the development of data center networking, software-defined networking, and application-aware networking technology, packet classification methods based on multi/many processor platform are becoming a new research interest. In this dissertation, packet classification has been studied mainly in three aspects: algorithm design framework, rule-set features analysis and algorithm implementation and optimization. In the dissertation, we review multiple proposed algorithms and present a decision tree based algorithm design framework. The framework decomposes various existing packet classification algorithms into a combination of different types of “meta-methods”, revealing the connection between different algorithms. Based on this framework, we combine different “meta-methods” from different algorithms, and propose two new algorithms, HyperSplit-op and HiCuts-op. The experiment results show that HiCuts-op achieves 2~20x less memory size, and 10% less memory accesses than HiCuts, while HyperSplit-op achieves 2~200x less memory size, and 10%~30% less memory accesses than HyperSplit. We also explore the connections between the rule-set features and the performance of various algorithms. We find that the “coverage uniformity” of the rule-set has a significant impact on the classification speed, and the size of “orthogonal structure” rules usually determines the memory size of algorithms. Based on these two observations, we propose a memory consumption model and a quantified method for coverage uniformity. Using the two tools, we propose a new multi-decision tree algorithm, SmartSplit and an algorithm policy framework, AutoPC. Compared to EffiCuts algorithm, SmartSplit achieves around 2.9x speedup and up to 10x memory size reduction. For a given rule-set, AutoPC can automatically recommend a “right” algorithm for the rule-set. Compared to using a single algorithm on all the rulesets, AutoPC achieves in average 3.8 times faster. We also analyze the connection between prefix length and the update overhead for IP lookup algorithms. We observe that long prefixes will always result in more memory accesses using Tree Bitmap algorithm while short prefixes will always result in large update overhead in DIR-24-8. Through combining two algorithms, a hybrid algorithm, SplitLookup, is proposed to reduce the update overhead. Experimental results show that, the hybrid algorithm achieves 2 orders of magnitudes less in memory accesses when performing short prefixes updating, but its lookup speed with DIR-24-8 is close. In the dissertation, we implement and optimize multiple algorithms on the multi/many core platform. For IP lookup, we implement two typical algorithms: DIR-24-8 and Tree Bitmap, and present several optimization tricks for these two algorithms. For multi-dimensional packet classification, we have implemented HyperCuts/HiCuts and the variants of these two algorithms, such as Adaptive Binary Cuttings, EffiCuts, HiCuts-op and HyperSplit-op. The SplitLookup algorithm has achieved up to 40Gbps throughput on TILEPro64 many-core processor. The HiCuts-op and HyperSplit-op have achieved up to 10 to 20Gbps throughput on a single core of Intel processors. In general, our study reveals the connections between the algorithmic tricks and rule-set features. Results in this dissertation provide insight for new algorithm design and the guidelines for efficient algorithm implementation
Farenc, Christelle. "Ergoval : une méthode de structuration des règles ergonomiques permettant l'évaluation automatique d'interfaces graphiques". Toulouse 1, 1997. http://www.theses.fr/1997TOU10013.
Pełny tekst źródłaThe thesis introduces a new method for structuring ergonomic rules in order to evaluate graphical user interface. This method performed in collaboration with the SRTP (post office technical research unit) aims to be used by computer experts and to be integrated in an automatic user interface evaluation tool : ERGOVAL. In order to provide information to developers in a way they can handle it to modify the interface, ergonomic rules were reformulated to concern directly graphical objects of the user interface. Knowledge involved in the evaluation was structured in this way : * a representation of the UI in terms of the interaction objects of the norm CUA was built : this is the decomposition of graphical objects * all graphical objects concerned by the same set of ergonomic rules are grouped together into classes of objects : the typology of graphic objects. . The resulting typology consists in several levels of abstraction, the graphical objects being the leaves of this typology. The links of this typology are types of links which have hierarchical properties, i. E. Each type inherits attributes from the parent type and associated rules. A mock-up of the ERGOVAL tool was made to validate knowledge structuration and to define specifications of the final tool. In order to determine the scale application, the automatic and qualitative dimensions were studied especially the automatic retrieval of interface description and the number and level of ergonomic rules integrated in the mock-up. Consequently, the quality of an automatic evaluation and an evaluation of high level ergonomic rules were determined
Waeselynck, Hélène. "Vérification de logiciels critiques par le test statistique". Toulouse, INPT, 1993. http://www.theses.fr/1993INPT010H.
Pełny tekst źródłaBabau, Jean-Philippe. "Etude du comportement temporel des applications temps réel à contraintes strictes basée sur une analyse d'ordonnançabilité". Poitiers, 1996. http://www.theses.fr/1996POIT2305.
Pełny tekst źródłaCharlet, Célina. "Raffiner pour vérifier des systèmes paramétrés". Besançon, 2003. http://www.theses.fr/2003BESA2054.
Pełny tekst źródłaGuégain, Edouard. "Optimisation de logiciels par leur configuration". Electronic Thesis or Diss., Université de Lille (2022-....), 2023. http://www.theses.fr/2023ULILB020.
Pełny tekst źródłaThe field of software engineering evolves rapidly, exposing practitioners to an ever-increasing collection of tools, languages, frameworks, and paradigms.Each of these components can have its own, internal configuration.Thus, designing a new software system consist in selecting components from this collection, which is akin to creating a configuration.The criterion to configure such systems is too often the ease of development, which leads to oversized, power-hungry bloatware.This paradigm is not aligned with frugal or environmental concerns.Thus, this dissertation looks into the ability to leverage the configuration of a system to optimize its performance.A specific focus is made on energy consumption and the size of software systems.A prerequisite to optimizing a system is to understand its current performance.To gain insight into this subject, the configuration software JHipster was empirically analyzed.Exhaustively assessing the performances of configurations of JHipster, wrt several indicators, showed that different configurations have indeed different performances.Thus, relying on performance insight, it is possible to create high-performance configurations of JHipster.Furthermore, some performance indicators proved correlated across configurations.Therefore, the optimization goal can be simplified by ignoring redundant performance indicators.The process of creating optimized configurations of JHipster was performed manually, which is only possible in smaller configuration spaces.To tackle larger configuration spaces, an algorithm was created, defining how to assess the performance of each option, and then how to improve a given configuration using such performance data.However, optimizing a configuration by selecting high-performance options brought out limitations, as options can interact with each other:in some situations, pairing high-performance options may result in subpar performances.Similarly, low-performance options can prove unexpectedly efficient when paired together.Thus, the optimization algorithm has been designed to leverage such specific behaviors.Applying this algorithm to a large set of configurations showed that most of them can reach near-optimal performances, with only a limited set of modifications.However, performance constraints are not limited to a single performance indicator.Depending on the context, the energy consumption of a system may not be the single most impactful indicator to optimize.Thus, the optimization algorithm must be generalized to support several performance indicators.This generalized algorithm has been validated on a pair of performance indicators: the execution time and the size of the software.The main highlight of this validation is that half of all configurations can reach a local optimum by changing a single setting.Furthermore, by exhaustively applying the algorithm to the configuration space of a system, it was possible to follow how it navigates the configuration space to find optimal configurations.Analyzing this navigation highlighted current limitations in the algorithm, which can thus be further improved as future work.In its current state, the algorithm was published as an open-source tool under the name ICO
Książki na temat "Évaluation des logiciels"
Owston, Ronald Davis. Software evaluation: A criterion-based approach. Scarborough, Ont: Prentice-Hall Canada, 1987.
Znajdź pełny tekst źródłaSoftware metrics: A rigorous approach. London: Chapman & Hall, 1991.
Znajdź pełny tekst źródłaLawrence, Pfleeger Shari, red. Software metrics: A rigorous and practical approach. Wyd. 2. London: PWS Pub., 1997.
Znajdź pełny tekst źródłaSoftware metrics: A rigorous approach. London: International Thomson Computer Press, 1995.
Znajdź pełny tekst źródłaUsability of complex information systems: Evaluation of user interaction. Boca Raton: Taylor & Francis, 2011.
Znajdź pełny tekst źródłaCharette, Robert N. Software engineering risk analysis and management. New York: Intertext Publications, 1989.
Znajdź pełny tekst źródłaProgramme for International Student Assessment. i Organisation for Economic Co-operation and Development., red. PISA 2003 data analysis manual: SAS users. Paris, France: OECD, 2005.
Znajdź pełny tekst źródłaProgramme for International Student Assessment. i Organisation for Economic Co-operation and Development., red. PISA 2003 data analysis manual: SAS users. Paris, France: OECD, 2005.
Znajdź pełny tekst źródłaDill, David L. Computer Aided Verification: 6th International Conference, Cav '94, Stanford, California, Usa, June 21-23, 1994 : Proceedings (Lecture Notes in Computer Science). Springer, 1994.
Znajdź pełny tekst źródłaManage Software Testing. AUERBACH, 2008.
Znajdź pełny tekst źródłaCzęści książek na temat "Évaluation des logiciels"
"Annexe 3 : évaluation par compétences (avec le logiciel Sacoche)". W Mathématiques récréatives, 248. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2319-2-072.
Pełny tekst źródła"Annexe 3 : évaluation par compétences (avec le logiciel Sacoche)". W Mathématiques récréatives, 249–52. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2319-2-073.
Pełny tekst źródła"Annexe 3 : évaluation par compétences (avec le logiciel Sacoche)". W Mathématiques récréatives, 248. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2319-2.c072.
Pełny tekst źródła"Annexe 3 : évaluation par compétences (avec le logiciel Sacoche)". W Mathématiques récréatives, 249–52. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2319-2.c073.
Pełny tekst źródła