AAU-Net: Attention-Based Asymmetric U-Net for Subject-Sensitive Hashing of Remote Sensing Images

The prerequisite for the use of remote sensing images is that their security must be guaranteed. As a special subset of perceptual hashing, subject-sensitive hashing overcomes the shortcomings of the existing perceptual hashing that cannot distinguish between “subject-related tampering” and “subject-unrelated tampering” of remote sensing images. However, the existing subject-sensitive hashing still has a large deficiency in robustness. In this paper, we propose a novel attention-based asymmetric U-Net (AAU-Net) for the subject-sensitive hashing of remote sensing (RS) images. Our AAU-Net demonstrates obvious asymmetric structure characteristics, which is important to improve the robustness of features by combining the attention mechanism and the characteristics of subject-sensitive hashing. On the basis of AAU-Net, a subject-sensitive hashing algorithm is developed to integrate the features of various bands of RS images. Our experimental results show that our AAU-Net-based subject-sensitive hashing algorithm is more robust than the existing deep learning models such as Attention U-Net and MUM-Net, and its tampering sensitivity remains at the same level as that of Attention U-Net and MUM-Net.

Randomness in classes of matroids

<p>This thesis is inspired by the observation that we have no good random model for matroids. That stands in contrast to graphs, which admit a number of elegant random models. As a result we have relatively little understanding of the properties of a "typical" matroid. Acknowledging the difficulty of the general case, we attempt to gain a grasp on randomness in some chosen classes of matroids. Firstly, we consider sparse paving matroids, which are conjectured to dominate the class of matroids (that is to say, asymptotically almost all matroids would be sparse paving). If this conjecture were true, then many results on properties of the random sparse paving matroid would also hold for the random matroid. Sparse paving matroids have limited richness of structure, making counting arguments in particular more feasible than for general matroids. This enables us to prove a number of asymptotic results, particularly with regards to minors. Secondly, we look at Graham-Sloane matroids, a special subset of sparse paving matroids with even more limited structure - in fact Graham-Sloane matroids on a labelled groundset can be randomly generated by a process as simple as independently including certain bases with probability 0.5. Notably, counting Graham-Sloane matroids has provided the best known lower bound on the total number of matroids, to log-log level. Despite the vast size of the class we are able to prove severe restrictions on what minors of Graham-Sloane matroids can look like. Finally we consider transversal matroids, which arise naturally in the context of other mathematical objects - in particular partial transversals of set systems and partial matchings in bipartite graphs. Although transversal matroids are not in one-to-one correspondence with bipartite graphs, we shall link the two closely enough to gain some useful results through exploiting the properties of random bipartite graphs. Returning to the theme of matroid minors, we prove that the class of transversal matroids of given rank is defined by finitely many excluded series-minors. Lastly we consider some other topics, including the axiomatisability of transversal matroids and related classes.</p>

Randomness in classes of matroids

<p>This thesis is inspired by the observation that we have no good random model for matroids. That stands in contrast to graphs, which admit a number of elegant random models. As a result we have relatively little understanding of the properties of a "typical" matroid. Acknowledging the difficulty of the general case, we attempt to gain a grasp on randomness in some chosen classes of matroids. Firstly, we consider sparse paving matroids, which are conjectured to dominate the class of matroids (that is to say, asymptotically almost all matroids would be sparse paving). If this conjecture were true, then many results on properties of the random sparse paving matroid would also hold for the random matroid. Sparse paving matroids have limited richness of structure, making counting arguments in particular more feasible than for general matroids. This enables us to prove a number of asymptotic results, particularly with regards to minors. Secondly, we look at Graham-Sloane matroids, a special subset of sparse paving matroids with even more limited structure - in fact Graham-Sloane matroids on a labelled groundset can be randomly generated by a process as simple as independently including certain bases with probability 0.5. Notably, counting Graham-Sloane matroids has provided the best known lower bound on the total number of matroids, to log-log level. Despite the vast size of the class we are able to prove severe restrictions on what minors of Graham-Sloane matroids can look like. Finally we consider transversal matroids, which arise naturally in the context of other mathematical objects - in particular partial transversals of set systems and partial matchings in bipartite graphs. Although transversal matroids are not in one-to-one correspondence with bipartite graphs, we shall link the two closely enough to gain some useful results through exploiting the properties of random bipartite graphs. Returning to the theme of matroid minors, we prove that the class of transversal matroids of given rank is defined by finitely many excluded series-minors. Lastly we consider some other topics, including the axiomatisability of transversal matroids and related classes.</p>

"Fandom's Pornographic Subset"

This article draws on content analysis method research (n = 78) that looks at a specific subset of fan fiction: anonymous kink meme communities where mostly women request and write erotic or pornographic fan texts. Reporting on an online survey, this article discusses what kind of role kink meme communities play in the lives of the respondents, how kink meme stories are situated in the larger framework of pornography, and how the respondents view the stories that incorporate unsettling or taboo subjects, such as sexual abuse of children, rape, or incest. This article views kink meme communities as a special subset of fan fic- tion, and in the article kink meme writing is compared to other forms of female- centric erotica or pornography. The article outlines how kink meme communities, like many other female-centric online communities, can function as places where women and gender minorities can write erotic material that better resonates with them and discuss and explore their sexualities and sexual preferences. Kink meme communities are also shown to utilise queer female writing practices in how they discuss and broaden the cultural view on female sexuality and women’s enjoyment of pornographic material. In addition to this, kink memes are also shown to function as literary communities where some fans can practise their writing.

Desire as Belief

What is it to want something? Or, as philosophers might ask, what is a desire? This book defends ‘desire-as-belief’, the view that desires are just a special subset of our beliefs: normative beliefs. This view entitles us to accept orthodox models of human motivation and rationality that explain those things with reference to desire, but nonetheless to also make room for our normative beliefs to play a role in those domains. And this view tells us to diverge from the orthodox view on which desires themselves can never be right or wrong. Rather, according to desire-as-belief, our desires can themselves be assessed for their accuracy, and they are wrong when they misrepresent normative features of the world. Hume says that it is not contrary to reason to prefer the destruction of the whole world to the scratching of your finger, but he is wrong: it is foolish to prefer the destruction of the whole world to the scratching of your finger, and this is foolish because this preference misrepresents the relative worth of these things.

Anaesthetic management of maxillofacial surgeries: A cross-sectional survey to analyze current trend of practices

Anaesthetic management of maxillo-facial surgeries considered as special subset of surgery where the airway management needs proper attention. Most of the time it varies depending on the resources and skill availability. We tried to evaluate the current trend of practices in managing maxilla-facial surgeries among various practicing anaesthesiologists. This is a retrospective questionnaire based survey conducted among practicing anaesthesiologists to determine the trend of practices and institutional protocols followed for maxillo-facial surgeries. A set of questionnaires prepared to ask about the preferred mode of securing airway, frequency of facing complications and plan for extubation and post-operative management. Total of 86 responses were collected which were analyzed. A total of 91% evaluated the airway with history and physical examination. Fiberoptic broncoscope available in 46% of cases, 51% cases video laryngoscope was preferred as gadget. Naso-tracheal is the commonest route for securing the airway which was preferred by 53% respondents. Only 38% respondents were in favor of extubation of the patients inside the operation theatres after surgery for patients without head injury. In patients with head injury 90% responders believed either a delayed extubation in the ICU or elective ventilation for some hours before extubation is a better option. Most of the anaesthesiologists (61%) preferred shifting the patients to the ICU for post-operative care. Theanaestheticmanagement ofmaxillo-facial surgeries need special attention. It necessitates proper pre-operative evaluation, shared decision making with the surgeons, timely decision of extubation and post-operative care are keys to successfully manage the airway.

High Levels of TRIM5a Are Associated with Xenophagy in HIV-1-Infected Long-Term Nonprogressors

Autophagy is a lysosomal-dependent degradative mechanism essential in maintaining cellular homeostasis, but it is also considered an ancient form of innate eukaryotic fighting against invading microorganisms. Mounting evidence has shown that HIV-1 is a critical target of autophagy that plays a role in HIV-1 replication and disease progression. In a special subset of HIV-1-infected patients that spontaneously and durably maintain extremely low viral replication, namely, long-term nonprogressors (LTNP), the resistance to HIV-1-induced pathogenesis is accompanied, in vivo, by a significant increase in the autophagic activity in peripheral blood mononuclear cells. Recently, a new player in the battle of autophagy against HIV-1 has been identified, namely, tripartite motif protein 5α (TRIM5α). In vitro data demonstrated that TRIM5α directly recognizes HIV-1 and targets it for autophagic destruction, thus protecting cells against HIV-1 infection. In this paper, we analyzed the involvement of this factor in the control of HIV-1 infection through autophagy, in vivo, in LTNP. The results obtained showed significantly higher levels of TRIM5α expression in cells from LTNP with respect to HIV-1-infected normal progressor patients. Interestingly, the colocalization of TRIM5α and HIV-1 proteins in autophagic vacuoles in LTNP cells suggested the participation of TRIM5α in the autophagy containment of HIV-1 in LTNP. Altogether, our results point to a protective role of TRIM5α in the successful control of the chronic viral infection in HIV-1-controllers through the autophagy mechanism. In our opinion, these findings could be relevant in fighting against HIV-1 disease, because autophagy inducers might be employed in combination with antiretroviral drugs.

A Weakness Measure for GR(1) Formulae

When dealing with unrealizable specifications in reactive synthesis, finding the weakest environment assumptions that ensure realizability is often considered a desirable property. However, little effort has been dedicated to defining or evaluating the notion of weakness of assumptions formally. The question of whether one assumption is weaker than another is commonly interpreted by considering the implication relationship between the two or, equivalently, their language inclusion. This interpretation fails to provide any insight into the weakness of the assumptions when implication (or language inclusion) does not hold. To our knowledge, the only measure that is capable of comparing two formulae in this case is entropy, but even it cannot distinguish the weakness of assumptions expressed as fairness properties. In this paper, we propose a refined measure of weakness based on combining entropy with Hausdorff dimension, a concept that captures the notion of size of the $$\omega $$ ω -language satisfying a linear temporal logic formula. We focus on a special subset of linear temporal logic formulae which is of particular interest in reactive synthesis, called GR(1). We identify the conditions under which this measure is guaranteed to distinguish between weaker and stronger GR(1) formulae, and propose a refined measure to cover cases when two formulae are strictly ordered by implication but have the same entropy and Hausdorff dimension. We prove the consistency between our weakness measure and logical implication, that is, if one formula implies another, the latter is weaker than the former according to our measure. We evaluate our proposed weakness measure in two contexts. The first is in computing GR(1) assumption refinements where our weakness measure is used as a heuristic to drive the refinement search towards weaker solutions. The second is in the context of quantitative model checking where it is used to measure the size of the language of a model violating a linear temporal logic formula.

Tinea Pseudoimbricata caused by Trichophyton rubrum

Tinea pseudoimbricata, a special subset of tinea incognito, is a cutaneous fungal infection with unusual tinea imbricata-like lesions caused by dermatophytes other than Trichophyton concentricum. Here we present a case of tinea pseudoimbricata. An 80-year-old woman presented with mildly pruritic, scaly, annular, erythematous plaques with inner small, annular, polycyclic, or arcuate plaques on the left abdomen and back for 1 month. The lesions enlarged after the application of topical corticosteroids about 2 months previously. A potassium hydroxide test performed on her lesions was positive. Fungal culture, light microscopic findings, and T. rubrum-specific real-time polymerase chain reaction confirmed the presence of T. rubrum. Thus, we diagnosed tinea pseudoimbricata caused by T. rubrum and treated successfully with oral and topical terbinafine.

Enhanced Recommendation System for E-commerce Applications

Recommendation algorithms play a quintessential role in development of E-commerce recommendation system, Where in Collaborative filtering algorithm is a major contributor for most recommendation systems since they are a flavor of KNN algorithm specifically tailored for E-commerce Web Applications, the main advantages of using CF algorithms are they are efficient in capturing collective experiences and behavior of e-commerce customers in real time, But it is noted that , this results in the phenomenon of Mathew effect, Wherein only popular products are listed into the recommendation list and lesser popular items tend to become even more scarce. Hence this results in products which are already familiar to users being discovered redundantly, thus potential discovery of niche and new items in the e-commerce application is compromised. To address this issue , this paper throws light on user behavior on the online shopping platform , accordingly a novel selectivity based collaborative filtering algorithm is proposed with innovator products that can recommend niche items but less popular products to users by introducing the concept of collaborative filtering with consumer influencing capability. Specifically, innovator products are a special subset of products which are less popular/ have received less traction from users but are genuinely of higher quality, therefore, these aforementioned products can be captured in the recommendation list via innovator-recognition table, achieving the balance between popularity and practicability for the user