Academic literature on the topic 'Secure classification'

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

Select a source type:

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

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 "Secure classification"

1

Pearson, Jane L., Deborah A. Cohn, Philip A. Cowan, and Carolyn Pape Cowan. "Earned- and continuous-security in adult attachment: Relation to depressive symptomatology and parenting style." Development and Psychopathology 6, no. 2 (1994): 359–73. http://dx.doi.org/10.1017/s0954579400004636.

Full text
Abstract:
AbstractThe secure working model classification of adult attachment, as derived from Main and Goldwyn's (in press) Adult Attachment Interview scoring system, was considered in terms of earned-security and continuous-security. Earned-security was a classification given to adults who described difficult, early relationships with parents, but who also had current secure working models as indicated by high coherency scores; continuous-security referred to a classification in which individuals described secure early attachment relationship with parents and current secure working models. Working models of attachment were classified as earned-secure, continuous-secure, or insecure in a sample of 40 parents of preschool children. Comparisons among the classifications were conducted on a measure of depressive symptoms and two sets of ratings of observed parenting styles. Adults with earned-secure classifications had comparable depressive symptomatology to insecures, with 30% of the insecures, 40% of the earned-secures, and only 10% of the continuous-secures having scores exceeding the clinical cut-off. The rate of depressive symptomatology in the earned-secure group suggests that reconstructions of past difficulties may remain emotional liabilities despite a current secure working model. With regard to parenting styles with their preschoolers, the behavior of earned-secure parents was comparable to that of the continuous-secures. This refinement in conceptualizing secure working models suggests ways for understanding variation in pathways to competent parenting as well as a possible perspective on how adults' adverse early experiences may continue to place them and their children at risk.
APA, Harvard, Vancouver, ISO, and other styles
2

Hareesha, K. S., and M. Sumana. "Secure Two Party Privacy Preserving Classification Using Encryption." International Journal of Information and Electronics Engineering 6, no. 2 (2016): 67–71. http://dx.doi.org/10.18178/ijiee.2016.6.2.597.

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

Baars, Thijs, and Marco Spruit. "Designing a Secure Cloud Architecture." International Journal of Information Security and Privacy 6, no. 1 (January 2012): 14–32. http://dx.doi.org/10.4018/jisp.2012010102.

Full text
Abstract:
Security issues are paramount when considering adoption of any cloud technology. This article proposes the Secure Cloud Architecture (SeCA) model on the basis of data classifications which defines a properly secure cloud architecture by testing the cloud environment on eight attributes. The SeCA model is developed using a literature review and a Delphi study with seventeen experts, consisting of three rounds. The authors integrate the CI3A—an extension on the CIA-triad—to create a basic framework for testing the classification inputted. The data classification is then tested on regional, geo-spatial, delivery, deployment, governance and compliance, network, premise and encryption attributes. After this testing has been executed, a specification for a secure cloud architecture is outputted.
APA, Harvard, Vancouver, ISO, and other styles
4

T., Tamanna, and Rajeev Kumar. "Secure Cloud Model using Classification and Cryptography." International Journal of Computer Applications 159, no. 6 (February 15, 2017): 8–13. http://dx.doi.org/10.5120/ijca2017912953.

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

Usharani, A. V., and Girija Attigeri. "Secure EMR Classification and Deduplication Using MapReduce." IEEE Access 10 (2022): 34404–14. http://dx.doi.org/10.1109/access.2022.3161439.

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

Wiseman, Simon R. "Classification services in the SWORD secure DBMS." Computers & Security 14, no. 4 (January 1995): 307–21. http://dx.doi.org/10.1016/0167-4048(95)00004-r.

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

Salehi, Mahmood, and Azzedine Boukerche. "Secure opportunistic routing protocols: methods, models, and classification." Wireless Networks 25, no. 2 (September 11, 2017): 559–71. http://dx.doi.org/10.1007/s11276-017-1575-1.

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

., S. Narayanan. "CLASSIFICATION OF SECURE ENCRYPTED RELATIONALDATA IN CLOUD COMPUTING." International Journal of Research in Engineering and Technology 05, no. 03 (March 25, 2016): 159–66. http://dx.doi.org/10.15623/ijret.2016.0503034.

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

S L Swapna and V Saravanan. "Jaccard Index Cat Gradient Boosting Classification for Secured Big Data Communication." Applied Science and Engineering Journal for Advanced Research 1, no. 5 (September 30, 2022): 1–14. http://dx.doi.org/10.54741/asejar.1.5.1.

Full text
Abstract:
Big data is observed as a novel field dealing with datasets that are too complex in providing indispensable services for daily chores and also discovering hidden patterns. Network security has become a major issue due to big data analytics, which offers unlimited research potential. More specifically, secure data communication without a third party is a major concern. Also, as large, heterogeneous, and complex data sets emerge, existing security mechanisms cannot provide or address network threats quickly or accurately. Therefore, along with the decrease in time, accuracy and error rate are other research concerns. Accordingly, an accurate and timely big data-based secure method called Jaccard Index Cat Gradient Boosting Classification-based Secured Data Communication (JICGBC-SDC) using the Internet of Things is presented. Firstly, for each cloud user, user registration is performed by acquiring information from various sensors. Second, information is collected from the registered cloud users by means of the Jaccard Index Cat Gradient Boosting Classifier algorithm. Such a proposed algorithm imposes a lower error rate and minimizes classification time, ensuring the most reliable and secured data communication between cloud users. To ensure secure data communication, weak learners' results are combined to form a strong classifier. The proposed method is implemented in Java and tested on the CloudSim simulator for classification accuracy, classification time, and error rate. The experimental results reveal the JICGBC-SDC method increases the performance of secured data communication for error rate by 77%, classification time by 79% and classification accuracy by 25% as compared to the state-of-the-art work.
APA, Harvard, Vancouver, ISO, and other styles
10

B, Murugeshwari, Jayakumar C, and Sarukesi K. "Secure Multi Party Computation Technique for Classification Rule Sharing." International Journal of Computer Applications 55, no. 7 (October 20, 2012): 1–10. http://dx.doi.org/10.5120/8764-2683.

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

Dissertations / Theses on the topic "Secure classification"

1

Neubert, Janek. "Secure WebServer." Thesis, Universitätsbibliothek Chemnitz, 2004. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200400894.

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

Jaziri, Rakia. "Modèles de mélanges topologiques pour la classification de données structurées en séquences." Paris 13, 2013. http://scbd-sto.univ-paris13.fr/secure/edgalilee_th_2013_jaziri.pdf.

Full text
Abstract:
Ces dernières années ont vu le développement des techniques de fouille de données séquentielles dans de nombreux domaines d’applications dans le but d’analyser des données temporelles, volumineuses et complexes. Dans le cadre de cette thèse, nous nous intéressons aux problèmes de classification et de structuration de données séquentielles, que nous proposons d’étudier à travers trois approches principales. Dans la première, il s’agit de mettre en oeuvre une nouvelle approche de classification topographique probabiliste dédiée aux données séquentielles, nous l’appellerons PrSOMS. Cette approche consiste à adapter la carte topographique déterministe à des séquences tout en s’appuyant sur les modèles de Markov cachés. On aboutit ainsi à une approche qui bénéficie du pouvoir de visualisation des SOM et de celui de structuration (modélisation) de séquences des HMM. Dans la deuxième, nous proposons une extension hiérarchique de l’approche PrSOMS. Cette approche permet de tirer partie de l’aspect complexe des données au sein du processus de classification. Nous avons constaté que le modèle obtenu ”H-PrSOMS” assure une bonne interprétabilité des classes construites. Dans la troisième, nous proposons une autre approche statistique topologique MGTM-TT, qui repose sur le même paradigme que celui des HMM. Il s’agit d’une modélisation générative topographique à densité d’observations mélanges, qui s’apparente à une extension hiérarchique du modèle GTM temporel. Ces propositions ont ensuite été appliquées à des données de test et à des données réelles issues de l’INA (Institut National de l’Audiovisuel). Dans le cas de l’INA, Ces approches consistent à proposer dans un premier temps une classification plus fine des segments audiovisuels diffusés. Puis, elles cherchent à définir une typologie des enchainements des segments (diffusion multiple d’un même programme, un programme entre deux inter-programme) afin de prévoir de manière statistique les caractéristiques des segments diffusés. La méthodologie globale offre ainsi un outil pour la classification et la structuration des données séquentielles
Recent years have seen the development of data mining techniques in various application areas, with the purpose of analyzing sequential, large and complex data. In this work, the problem of clustering, visualization and structuring data is tackled by a three-stage proposal. The first proposal present a generative approach to learn a new probabilistic Self-Organizing Map (PrSOMS) for non independent and non identically distributed data sets. Our model defines a low dimensional manifold allowing friendly visualizations. To yield the topology preserving maps, our model exhibits the SOM like learning behavior with the advantages of probabilistic models. This new paradigm uses HMM (Hidden Markov Models) formalism and introduces relationships between the states. This allows us to take advantage of all the known classical views associated to topographic map. The second proposal concerns a hierarchical extension of the approach PrSOMS. This approach deals the complex aspect of the data in the classification process. We find that the resulting model ”H-PrSOMS” provides a good interpretability of classes built. The third proposal concerns an alternative approach statistical topological MGTM-TT, which is based on the same paradigm than HMM. It is a generative topographic modeling observation density mixtures, which is similar to a hierarchical extension of time GTM model. These proposals have then been applied to test data and real data from the INA (National Audiovisual Institute). This work is to provide a first step, a finer classification of audiovisual broadcast segments. In a second step, we sought to define a typology of the chaining of segments (multiple scattering of the same program, one of two inter-program) to provide statistically the characteristics of broadcast segments. The overall framework provides a tool for the classification and structuring of audiovisual programs
APA, Harvard, Vancouver, ISO, and other styles
3

Zabel, Martin, Thomas B. Preußer, Peter Reichel, and Rainer G. Spallek. "SHAP-Secure Hardware Agent Platform." Universitätsbibliothek Chemnitz, 2007. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200701011.

Full text
Abstract:
This paper presents a novel implementation of an embedded Java microarchitecture for secure, realtime, and multi-threaded applications. Together with the support of modern features of object-oriented languages, such as exception handling, automatic garbage collection and interface types, a general-purpose platform is established which also fits for the agent concept. Especially, considering real-time issues, new techniques have been implemented in our Java microarchitecture, such as an integrated stack and thread management for fast context switching, concurrent garbage collection for real-time threads and autonomous control flows through preemptive round-robin scheduling.
APA, Harvard, Vancouver, ISO, and other styles
4

Bathe, Shivraj Gajanan. "Secure Communication in a Multi-OS-Environment." Master's thesis, Universitätsbibliothek Chemnitz, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-196760.

Full text
Abstract:
Current trend in automotive industry is moving towards adopting the multicore microcontrollers in Electronic Control Units (ECUs). Multicore microcontrollers give an opportunity to run a number of separated and dedicated operating systems on a single ECU. When two heterogeneous operating systems run in parallel on a multicore environment, the inter OS communication between these operating systems become the key factor in the overall performance. The inter OS communication based on shared memory is studied in this thesis work. In a setup where two operating systems namely EB Autocore OS which is based on AUTomotive Open System Architecture standard and Android are considered. Android being the gateway to the internet and due to its open nature and the increased connectivity features of a connected car, many attack surfaces are introduced to the system. As safety and security go hand in hand, the security aspects of the communication channel are taken into account. A portable prototype for multi OS communication based on shared memory communication with security considerations is developed as a plugin for EB tresos Studio.
APA, Harvard, Vancouver, ISO, and other styles
5

Pfennig, Stefan, and Elke Franz. "Comparison of Different Secure Network Coding Paradigms Concerning Transmission Efficiency." Technische Universität Dresden, 2013. https://tud.qucosa.de/id/qucosa%3A28134.

Full text
Abstract:
Preventing the success of active attacks is of essential importance for network coding since even the infiltration of one single corrupted data packet can jam large parts of the network. The existing approaches for network coding schemes preventing such pollution attacks can be divided into two categories: utilize cryptographic approaches or utilize redundancy similar to error correction coding. Within this paper, we compared both paradigms concerning efficiency of data transmission under various circumstances. Particularly, we considered an attacker of a certain strength as well as the influence of the generation size. The results are helpful for selecting a suitable approach for network coding taking into account both security against pollution attacks and efficiency.
APA, Harvard, Vancouver, ISO, and other styles
6

Franz, Elke, Stefan Pfennig, and André Fischer. "Communication Overhead of Network Coding Schemes Secure against Pollution Attacks." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-89807.

Full text
Abstract:
Network coding is a promising approach for increasing performance of multicast data transmission and reducing energy costs. Of course, it is essential to consider security aspects to ensure a reliable data transmission. Particularly, pollution attacks may have serious impacts in network coding since a single attacker can jam large parts of the network. Therefore, various approaches have been introduced to secure network coding against this type of attack. However, introducing security increases costs. Even though there are some performance analysis of secure schemes, to our knowledge there are no details whether these schemes are worthwhile to replace routing under the facet of efficiency. Thus, we discuss in this report parameters to assess the efficiency of secure network coding schemes. Using three network graphs, we evaluate parameters focusing on communication overhead for selected schemes. Our results show that there are still benefits in comparison to routing depending on the network topology.
APA, Harvard, Vancouver, ISO, and other styles
7

Sleem, Lama. "Design and implementation of lightweight and secure cryptographic algorithms for embedded devices." Thesis, Bourgogne Franche-Comté, 2020. http://www.theses.fr/2020UBFCD018.

Full text
Abstract:
Nous vivons actuellement dans une ère avec sans cesse de nouveaux appareils technologiques (smartphone, réseaux de capteurs sans fil, aux caméras haute résolution, etc). En partant des médias sociaux, en passant par des caméras de surveillance très puissantes, et sans oublier la surveillance de la santé en temps réel, on constate qu'une grande quantité de données est stockée dans le cloud et les serveurs. Cela représente un grand défi de stockage et de transmission, en particulier dans les plates-formes aux ressources limitées qui sont caractérisées par : (a) des capacités de calcul limitées, (b) une source d'énergie limitées et (c) des infrastructures ouvertes qui transmettent des données sur des réseaux sans fil peu fiables. Dans cette thèse, nous nous concentrons sur l'amélioration de la sécurité des contenus multimédia transmis sur des plates-formes à capacité de calcul limitée, tout en préservant un niveau de sécurité élevé. Dans la première partie, nous avons étudié les réseaux ad hoc véhiculaire. Nous avons proposé un état de l'art qui permet de résumer la plupart des travaux récents et d'explorer presque tous les aspects de ce domaine en illustrant les différents aspects que possède cette plateforme. Ensuite, afin de proposer une nouvelle solution de sécurité et de valider sa robustesse et le niveau de caractère aléatoire d'une image chiffrée, nous avons proposé un test simple et efficace. Celui-ci est basé sur des outils pour tester statistiquement le caractère aléatoire de nombres pseudo aléatoires, TestU01 et Practrand. Après avoir effectué ces tests sur des algorithmes de chiffrement bien connus, certaines failles ont été exposées et une nouvelle proposition visant à améliorer le système de chiffrement ultra-léger Speck est proposée. La principale contribution de ce travail est d'obtenir une meilleure version par rapport à Speck. Dans cette nouvelle proposition, appelée Speck-R, nous utilisons seulement 7 itérations contrairement à Speck qui en utilise 26 et nous réduisons le temps d'exécution d'au moins 50%. Tout d'abord, nous validons que Speck-R répond aux tests de statistiques pour mesurer l'aléatoire, proposés précédemment. De plus, nous avons rajouté un système de clé dynamique qui procure plus de sécurité contre les attaques liées à la clé. Speck-R a été implémenté sur différentes cartes de type arduino et dans tous les cas, Speck-R était plus rapide que Speck. Ensuite, afin de prouver que ce chiffrement peut être utilisé pour sécuriser les images, en particulier dans les réseaux VANETS/IoV, plusieurs tests ont été effectués et les résultats montrent que Speck-R possède effectivement le haut niveau de sécurité souhaité. Des expérimentations valident notre proposition du point de vue de la sécurité et de la performance et démontrent la robustesse du système proposé face aux types d'attaques les plus connus
Living in an era where new devices are astonishing considering their high capabilities, new visions and terms have emerged. Moving to smart phones, Wireless Sensor Networks, high-resolution cameras, pads and much more, has mandated the need to rethink the technological strategy that is used today. Starting from social media, where apparently everything is being exposed, moving to highly powerful surveillance cameras, in addition to real time health monitoring, it can be seen that a high amount of data is being stored in the Cloud and servers. This introduced a great challenge for their storage and transmission especially in the limited resourced platforms that are characterized by: (a) limited computing capabilities, (b) limited energy and source of power and (c) open infrastructures that transmit data over wireless unreliable networks. One of the extensively studied platforms is the Vehicular Ad-hoc Networks which tends to have many limitations concerning the security field. In this dissertation, we focus on improving the security of transmitted multimedia contents in different limited platforms, while preserving a high security level. Limitations of these platforms are taken into consideration while enhancing the execution time of the secure cipher. Additionally, if the proposed cipher is to be used for images, the intrinsic voluminous and complex nature of the managed images is also taken into account. In the first part, we surveyed one of the limited platforms that is interesting for many researchers, which is the Vehicular Ad-hoc Networks. In order to pave the way for researchers to find new efficient security solutions, it is important to have one reference that can sum most of the recent works. It almost investigates every aspect in this field shedding the light over different aspects this platform possesses. Then, in order to propose any new security solution and validate its robustness and the level of randomness of the ciphered image, a simple and efficient test is proposed. This test proposes using the randomness tools, TestU01 and Practrand, in order to assure a high level of randomness. After running these tests on well known ciphers, some flaws were exposed. Proceeding to the next part, a novel proposal for enhancing the well-known ultra lightweight cipher scheme, Speck, is proposed. The main contribution of this work is to obtain a better version compared to Speck. In this proposal, 26 rounds in Speck were reduced to 7 rounds in Speck-R while enhancing the execution time by at least 50%. First, we validate that Speck-R meets the randomness tests that are previously proposed. Additionally, a dynamic substitution layer adds more security against key related attacks and highly fortifies the cipher. Speck-R was implemented on different limited arduino chips and in all cases, Speck-R was ahead of Speck. Then, in order to prove that this cipher can be used for securing images, especially in VANETS/IoV, where images can be extensively re/transmitted, several tests were exerted and results showed that Speck-R indeed possesses the high level of security desired in any trusted cipher. Extensive experiments validate our proposal from both security and performance point of views and demonstrate the robustness of the proposed scheme against the most-known types of attacks
APA, Harvard, Vancouver, ISO, and other styles
8

Pfennig, Stefan, and Elke Franz. "Secure Network Coding: Dependency of Efficiency on Network Topology." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-128456.

Full text
Abstract:
Network Coding is a new possibility to transmit data through a network. By combining different packets instead of simply forwarding, network coding offers the opportunity to reach the Min-Cut/Max-Flow capacity in multicast data transmissions. However, the basic schemes are vulnerable to so-called pollution attacks, where an attacker can jam large parts of the transmission by infiltrating only one bogus message. In the literature we found several approaches which aim at handling this kind of attack with different amounts of overhead. Though, the cost for a specific secure network coding scheme highly depends on the underlying network. The goal of this paper is on the one hand to describe which network parameters influence the efficiency of a certain scheme and on the other hand to provide concrete suggestions for selecting the most efficient secure network coding scheme considering a given network. We will illustrate that there does not exist “the best” secure network scheme concerning efficiency, but all selected schemes are more or less suited under certain network topologies.
APA, Harvard, Vancouver, ISO, and other styles
9

Ho, Zuleita K. M., and Eduard Jorswieck. "Secure degrees of freedom on widely linear instantaneous relay-assisted interference channel." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-128420.

Full text
Abstract:
The number of secure data streams a relay-assisted interference channel can support has been an intriguing problem. The problem is not solved even for a fundamental scenario with a single antenna at each transmitter, receiver and relay. In this paper, we study the achievable secure degrees of freedom of instantaneous relay-assisted interference channels with real and complex coefficients. The study of secure degrees of freedom with complex coefficients is not a trivial multiuser extension of the scenarios with real channel coefficients as in the case for the degrees of freedom, due to secrecy constraints. We tackle this challenge by jointly designing the improper transmit signals and widely-linear relay processing strategies.
APA, Harvard, Vancouver, ISO, and other styles
10

Riedel, Ursula, Frank Richter, Uwe Huebner, Jan Wunderlich, Holger Trapp, Matthias Clauss, Karsten Baensch, et al. "Mitteilungen des URZ 1/2/1996." Universitätsbibliothek Chemnitz, 1996. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199600134.

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

Books on the topic "Secure classification"

1

Documentos clasificados de la policía secreta de Carías (1937-1944). Tegucigalpa: Instituto Hondureño de Antropología e Historia, 2009.

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

Ben-Israel, Isaac. Philosophie du renseignement: Logique et morale de l'espionnage. Paris: Éditions de l'éclat, 2004.

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

Harcourt, Edward, ed. Attachment and Character. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192898128.001.0001.

Full text
Abstract:
There are many exciting points of contact between the questions pursued by attachment theory and those first raised by Aristotle’s ethics, and which continue to preoccupy moral philosophers today. For the first time this volume brings experts from ethics and from attachment theory together to explore them, in order to show philosophers working in moral psychology or in ‘virtue ethics’ that they both have more to learn from, and more to teach, developmental psychology in the attachment paradigm than has been thought to date. Attachment theory is a theory of psychological development. The characteristics attachment theory is a developmental theory of are evaluatively inflected: to be securely attached to a parent is to have a kind of attachment that makes for a good intimate relationship. But obviously the classification of human character in terms of the virtues and vices is evaluatively inflected too. This collection of chapters explores the latest empirical findings on the relationship between attachment and the vices and virtues, and the relative importance of attachment status as against other determinants of prosocial behaviour. It also probes the concept of the prosocial itself, and the connections between prosocial behaviour, virtue, and the quality of the social environment; explores whether what we know about these connections casts light on whether there are even such things as stable character traits; and whether attachment theory, in locating the origins of virtue in secure attachment, and attachment dispositions in human evolutionary history, gives support to ethical naturalism, in any of the many meanings of that expression.
APA, Harvard, Vancouver, ISO, and other styles
4

De Baets, Antoon. Censorship and History since 1945. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199225996.003.0004.

Full text
Abstract:
This chapter discusses the classification of types of censorship as they have developed since 1945. Censorship of history has been practiced in all modes, genres, fields, categories, and periods of history, and in all countries. To begin with, it ranges over all modes of the historiographical operation. Pre-censorship, often invisible to the public, attempts to regulate research: archives are cleansed or kept secret, and manuscripts are rewritten without authorial consent. Meanwhile, post-censorship means that publications are banned, their authorship is deleted or changed without authorial consent, that lectures are boycotted, or the content of teaching courses is improperly interfered with. The importance of the censorship of history clearly varies according to whether a given political regime is dictatorial, democratic, or transitory between both. The chapter also analyzes the relationships between censorship and epistemology, truth and ethics.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Secure classification"

1

Bergström, Erik, and Rose-Mharie Åhlfeldt. "Information Classification Issues." In Secure IT Systems, 27–41. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11599-3_2.

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

Aktas, Kursat, and Sevil Sen. "UpDroid: Updated Android Malware and Its Familial Classification." In Secure IT Systems, 352–68. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03638-6_22.

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

Alishahi, Mina, Daan Gast, and Sam Vermeiren. "Local Differential Privacy for Private Construction of Classification Algorithms." In Secure IT Systems, 58–79. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-22295-5_4.

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

Malik, Hafiz, Farhan Baqai, Ashfaq Khokhar, and Rashid Ansari. "Secure Data-Hiding in Multimedia Using NMF." In Multimedia Content Representation, Classification and Security, 265–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11848035_36.

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

Sakib, Sadman, Mostafa M. Fouda, and Zubair Md Fadlullah. "Harnessing Artificial Intelligence for Secure ECG Analytics at the Edge for Cardiac Arrhythmia Classification." In Secure Edge Computing, 137–53. Boca Raton: CRC Press, 2021. http://dx.doi.org/10.1201/9781003028635-11.

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

El Bouny, Lahcen, Mohammed Khalil, and Abdellah Adib. "ECG Beat Classification Based on Stationary Wavelet Transform." In Mobile, Secure, and Programmable Networking, 110–23. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22885-9_11.

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

Gabber, E., M. Jakobsson, Y. Matias, and A. Mayer. "Curbing junk e-mail via secure classification." In Financial Cryptography, 198–213. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055484.

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

Wang, Fen, Xiaoxuan Li, Xiaotao Huang, and Ling Kang. "Improved Document Feature Selection with Categorical Parameter for Text Classification." In Mobile, Secure, and Programmable Networking, 86–98. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-50463-6_8.

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

Reddy, B. Praeep Kumar, and Ayantika Chatterjee. "Encrypted Classification Using Secure K-Nearest Neighbour Computation." In Security, Privacy, and Applied Cryptography Engineering, 176–94. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-35869-3_13.

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

Riyad, Mouad, Mohammed Khalil, and Abdellah Adib. "Cross-Subject EEG Signal Classification with Deep Neural Networks Applied to Motor Imagery." In Mobile, Secure, and Programmable Networking, 124–39. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22885-9_12.

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

Conference papers on the topic "Secure classification"

1

Gupta, Anand, Manik Singhal, Akash Gangil, and Abhishek Mishra. "SDC: Secure deletion classification." In 2011 International Conference on Recent Trends in Information Technology (ICRTIT). IEEE, 2011. http://dx.doi.org/10.1109/icrtit.2011.5972299.

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

Berian, Alex, Kory Staab, Gregory Ditzler, Tamal Bose, and Ravi Tandon. "Adversarial Filters for Secure Modulation Classification." In 2021 55th Asilomar Conference on Signals, Systems, and Computers. IEEE, 2021. http://dx.doi.org/10.1109/ieeeconf53345.2021.9723329.

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

Fatayer, Tamer S., and Mohammed N. Azara. "IoT Secure Communication using ANN Classification Algorithms." In 2019 International Conference on Promising Electronic Technologies (ICPET). IEEE, 2019. http://dx.doi.org/10.1109/icpet.2019.00033.

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

Maru, Siddharth, and Timothy X. Brown. "Packet classification in co-mingled traffic streams." In 2009 5th IEEE Workshop on Secure Network Protocols (NPSec). IEEE, 2009. http://dx.doi.org/10.1109/npsec.2009.5342251.

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

Lee, Shan-Hsin, Shen-Chieh Lan, Hsiu-Chuan Huang, Chia-Wei Hsu, Yung-Shiu Chen, and Shiuhpyng Shieh. "EC-Model: An Evolvable Malware Classification Model." In 2021 IEEE Conference on Dependable and Secure Computing (DSC). IEEE, 2021. http://dx.doi.org/10.1109/dsc49826.2021.9346248.

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

Vaidya, Jaideep, and Bhakti Tulpule. "Enabling Better Medical Image Classification Through Secure Collaboration." In 2007 IEEE International Conference on Image Processing. IEEE, 2007. http://dx.doi.org/10.1109/icip.2007.4380054.

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

Yang, Ziqi. "Fidelity: Towards Measuring the Trustworthiness of Neural Network Classification." In 2019 IEEE Conference on Dependable and Secure Computing (DSC). IEEE, 2019. http://dx.doi.org/10.1109/dsc47296.2019.8937572.

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

Peixoto, Catarina, Hugo Peixoto, José Machado, António Abelha, and Manuel F. Santos. "Iron Value Classification in Patients Undergoing Continuous Ambulatory Peritoneal Dialysis using Data Mining." In Special Session on Healthy and Secure People. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0006820802850290.

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

Sharma, Seema, and Deepti Mehrotra. "Comparative Analysis of Multi-label Classification Algorithms." In 2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC). IEEE, 2018. http://dx.doi.org/10.1109/icsccc.2018.8703285.

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

Arora, Mamta, Sanjeev Dhawan, and Kulvinder Singh. "Deep Neural Network for Transformation Zone Classification." In 2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC). IEEE, 2018. http://dx.doi.org/10.1109/icsccc.2018.8703327.

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

Reports on the topic "Secure classification"

1

Edwards, Mervyn, Matthias Seidl, and Alix Edwards. GB LSAV Approval Scheme: Non-ADS requirements D7.1. TRL, June 2022. http://dx.doi.org/10.58446/dxiy5599.

Full text
Abstract:
The UK government are committed to bringing forward legislation to allow the safe and secure deployment of self-driving vehicles. As part of the CAVPASS programme, TRL was commissioned to propose approaches to vehicle classification, and suitable technical requirements for aspects not related to the Automated Driving System (ADS). These included crashworthiness, occupant protection, protection of vulnerable Road Users (VRUs), and the lighting, braking and steering systems. The focus of this study was on Low-Speed Automated Vehicles (LSAVs). It involved selection and adaptation of existing pre- and post-deployment regulation to enable it to be applied to LSAVs. A main part was the adaptation of the technical regulations for M- and N-category vehicles, laid down in Great Britain’s Road Vehicles (Approval) Regulations 2020 (SI 2020 No. 818), which implements retained Regulation (EU) 2018/858. The study proposed the introduction of two new vehicle categories (for LSAVs with and without occupants, respectively) to allow approval of designs not compatible with the M- and N-category definitions, such as passenger shuttles with six seats and space for standing passengers, or goods vehicles without any seats. Technical clarifications for regulations were developed relating to references to the driver or driver’s seat, controls, warnings and tell-tales and relating to bi-directional vehicles in general. The study further found that a general permission to carry standing passengers in light vehicles could present unreasonable risks to occupants in braking maneuvers or collisions, but that it could be safe in some Operational Design Domains (ODDs). A concept was proposed which offers manufacturers a choice between two Crashworthiness Approval Levels (CALs). The less demanding CAL allows standing passengers but restricts the subsequent ODD of the vehicles. In summary, the study proposed a novel approach to link approval regulations to the vehicle’s ODD and a set of technical requirements for non-ADS-related aspects of passenger- and goods-carrying LSAVs, which could help enable the approval of new vehicle concepts.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography