Miracle-dz/UniFAR-FTUs huggingface dataset:
An Extensible Intra Access Control Policy Conflict Detection Algorithm

Access control policy is a set of rules, which control and constraint the communication and access between all kinds of entities. Policy conflict is one of the outstanding issues related to policy management. Nevertheless current access control policy conflict detection algorithms are completely dependent on policy specification and the applications, which make these algorithms non-reusable and non-extensible. To resolve this problem, we separate the algorithm from concrete policy specification and apply a group of matrixes to define the relationship between all access control rules and all kinds of access control policy conflicts. Finally we develop an extensible intra-access control policy conflict detection algorithm that is independent of application domain to which the policies relate. The experimental result shows that the algorithm offers similar detection efficiency comparable to conventional detection algorithm.
Hierarchical Fault Simulation in Digital Systems

A new method for hierarchical fault simulation based on multi-level Decision Diagrams (DD) is proposed. We suppose that a register transfer level (RTL) information along with gate-level descriptions for blocks of the RTL structure are available. Decision diagrams (DDs) are exploited as a uniform model for describing circuits at these representation levels. The approach proposed allows to reduce time expenses in the comparison to traditional gate-level fault simulation approach. This is reflected in the experimental results.
Silicon carbide power semiconductors — new opportunities for high efficiency

After a hype and a consolidation phase regarding the potential of silicon carbide based components in power electronics (mostly diodes and switches), we are observing a solid penetration of these components in modern solutions even for power ratings of several kW. Benefits of these new power devices are now more clearly identified and applications were depicted where the use of these new components, in particular Schottky barrier diodes available from Infineon and Cree, can be a technical and commercial access. For a further market penetration, new generations of diodes as well as powerful switching devices are released recently resp. ready to commercialization. Especially upcoming markets for high voltage power devices offering not only high power densities, but energy saving as well push these developments. Supported by the improvements in base material quality and size, SiC power devices are believed to be on the hop to a next important step regarding its propagation in a broader range of applications. The paper will sketch these recent developments and will show how the improved performance can provide new perspectives in conventional systems as well as new solutions.
Introduction to Coalgebra: Towards Mathematics of States and Observation

The area of coalgebra has emerged within theoretical computer science with a unifying claim: to be the mathematics of computational dynamics. It combines ideas from the theory of dynamical systems and from the theory of state-based computation. Although still in its infancy, it is an active area of research that generates wide interest. Written by one of the founders of the field, this book acts as the first mature and accessible introduction to coalgebra. It provides clear mathematical explanations, with many examples and exercises involving deterministic and non-deterministic automata, transition systems, streams, Markov chains and weighted automata. The theory is expressed in the language of category theory, which provides the right abstraction to make the similarity and duality between algebra and coalgebra explicit, and which the reader is introduced to in a hands-on manner. The book will be useful to mathematicians and (theoretical) computer scientists and will also be of interest to mathematical physicists, biologists and economists.
Controlled privacy in mobile cloud

Mobile devices face restrictions due to limitation of resources like life of battery, capacity of memory, power of processor and communication bandwidth specially during mobility and handover. Mobile based cloud computing is getting greater plea amid mobile users to lessen limitations of resource in mobile devices. The extensive espousal of programmable smart mobile handsets and communicating or exchanging data to Internet remaining in public domain leads to newer privacy and security challenges across enterprises. Smartphones and Tablets are not only storing users' private data but also the private data of the involvers - be it friends, family members, customers, vendors or any other individual. Denial of services, data leakage, account confiscation, exposure to insecure application program interface, isolation of virtual machine, mischievous attacks from insider, losing the key used in encryption give rise to several added threats related to privacy and security. We have attempted to compute a number of threats pertaining to privacy and security and commend best practices and endorsements to counter and prevent occurrence.
On the existence of three-dimensional hydrostatic and magnetostatic equilibria of self-gravitating fluid bodies

We develop an analytical spectral method to solve the equations of equilibrium for a self-gravitating, magnetized fluid body, under the only hypotheses that (i) the equation of state is isothermal, (ii) the configuration is scale-free and (iii) the body is electrically neutral. All physical variables are represented as series of scalar and vector spherical harmonics of degree l and order m, and the equilibrium equations are reduced to a set of coupled quadratic algebraic equations for the expansion coefficients of the density and the magnetic vector potential. The method is general, and allows us to recover previously known hydrostatic and magnetostatic solutions possessing axial symmetry. A linear perturbation analysis of the equations in spectral form shows that these basic axisymmetric states, considered as a continuous sequence with the relative amount of magnetic support as control parameter, have in general no neighbouring non-axisymmetric equilibria. This result lends credence to a conjecture originally made by H. Grad, and extends early results obtained by E. Parker to the case of self-gravitating magnetized bodies. The only allowed bifurcations of this sequence of axisymmetric equilibria are represented by distortions with dipole-like angular dependence (l = 1) which can be continued into the non-linear regime. These new configurations are either (i) azimuthally asymmetric (m = ±1) or (ii) azimuthally symmetric but without reflection symmetry with respect to the equatorial plane (m = 0). It is likely that these configurations are not physically acceptable solutions for isolated systems, but represent instead the manifestation of a general gauge freedom of self-similar isothermal systems. To the extent that interstellar clouds can be represented as isolated magnetostatic equilibria, the results of this study suggest that the observed triaxial shapes of molecular cloud cores can be interpreted in terms of weakly damped Alfven oscillations about an equilibrium state.
Tumour necrosis factor and lymphotoxin A polymorphisms and lung function in smokers

Genetic variants in the tumour necrosis factor (TNF) gene have been investigated in chronic obstructive pulmonary disease (COPD). However, there are many instances of nonreplication of these associations due to insufficient power or other factors. In this study, a large number of subjects were examined to elucidate whether genetic variations of TNF and/or lymphotoxin A (LTA), which is clustered with TNF, are associated with variations in lung function among smokers. The present authors designed two nested case–control studies in the National Heart, Lung, and Blood Institute Lung Health Study (LHS), which enrolled 5,887 smokers. The first design included continuous smokers who had the fastest (n = 279) and the slowest (n = 304) decline of lung function during the 5-yr follow-up period, and the second included the subjects who had the lowest (n = 533) and the highest (n = 532) post-bronchodilator % predicted forced expiratory volume in one second at the start of the LHS. Within the TNF and LTA region, 10 tagging single-nucleotide polymorphisms were selected and genotyped. Unlike the previous associations between TNF-308 and COPD in Asians, the current study found no association between either of the two phenotypes and the LTA and TNF polymorphisms. In conclusion, these results support the findings of previous studies in late-onset chronic obstructive pulmonary disease in Caucasian populations.
Organic Nitrates and Nitrate Resistance in Diabetes: The Role of Vascular Dysfunction and Oxidative Stress with Emphasis on Antioxidant Properties of Pentaerithrityl Tetranitrate

Organic nitrates represent a class of drugs which are clinically used for treatment of ischemic symptoms of angina as well as for congestive heart failure based on the idea to overcome the impaired NO bioavailability by “NO” replacement therapy. The present paper is focused on parallels between diabetes mellitus and nitrate tolerance, and aims to discuss the mechanisms underlying nitrate resistance in the setting of diabetes. Since oxidative stress was identified as an important factor in the development of tolerance to organic nitrates, but also represents a hallmark of diabetic complications, this may represent a common principle for both disorders where therapeutic intervention should start. This paper examines the evidence supporting the hypothesis that pentaerithrityl tetranitrate may represent a nitrate for treatment of ischemia in diabetic patients. This evidence is based on the considerations of parallels between diabetes mellitus and nitrate tolerance as well as on preliminary data from experimental diabetes studies.
GET_HOMOLOGUES, a Versatile Software Package for Scalable and Robust Microbial Pangenome Analysis

ABSTRACT GET_HOMOLOGUES is an open-source software package that builds on popular orthology-calling approaches making highly customizable and detailed pangenome analyses of microorganisms accessible to nonbioinformaticians. It can cluster homologous gene families using the bidirectional best-hit, COGtriangles, or OrthoMCL clustering algorithms. Clustering stringency can be adjusted by scanning the domain composition of proteins using the HMMER3 package, by imposing desired pairwise alignment coverage cutoffs, or by selecting only syntenic genes. The resulting homologous gene families can be made even more robust by computing consensus clusters from those generated by any combination of the clustering algorithms and filtering criteria. Auxiliary scripts make the construction, interrogation, and graphical display of core genome and pangenome sets easy to perform. Exponential and binomial mixture models can be fitted to the data to estimate theoretical core genome and pangenome sizes, and high-quality graphics can be generated. Furthermore, pangenome trees can be easily computed and basic comparative genomics performed to identify lineage-specific genes or gene family expansions. The software is designed to take advantage of modern multiprocessor personal computers as well as computer clusters to parallelize time-consuming tasks. To demonstrate some of these capabilities, we survey a set of 50 Streptococcus genomes annotated in the Orthologous Matrix (OMA) browser as a benchmark case. The package can be downloaded at http://www.eead. csic.es/compbio/soft/gethoms.php and http://maya.ccg. unam.mx/soft/gethoms.php.
Prototype hierarchy based clustering for the categorization and navigation of web collections

This paper presents a novel prototype hierarchy based clustering (PHC) framework for the organization of web collections. It solves simultaneously the problem of categorizing web collections and interpreting the clustering results for navigation. By utilizing prototype hierarchies and the underlying topic structures of the collections, PHC is modeled as a multi-criterion optimization problem based on minimizing the hierarchy evolution, maximizing category cohesiveness and inter-hierarchy structural and semantic resemblance. The flexible design of metrics enables PHC to be a general framework for applications in various domains. In the experiments on categorizing 4 collections of distinct domains, PHC achieves 30% improvement in ¼F1 over the state-of-the-art techniques. Further experiments provide insights on performance variations with abstract and concrete domains, completeness of the prototype hierarchy, and effects of different combinations of optimization criteria.
Fast systematic encoding of quasi-cyclic codes using the Chinese remainder theorem

Quasi-cyclic (QC) codes are a wide class of error-correcting codes possessing nice theoretical properties and having many practical applications. This paper provides a new approach to the problem of efficient encoding of QC codes based on the Chinese remainder theorem (CRT). We present a fast systematic CRT-based encoding algorithm that has superior asymptotic complexity than the previous methods based on shift registers. We also consider the encoding problem for QC low-density parity-check (LDPC) codes. In the special case when the parity part of a sparse parity-check QC matrix has a QC generalized inverse we propose a systematic CRT-based encoding algorithm that can exploit the parity-check matrix sparseness. We also give necessary and sufficient conditions when a QC matrix over an arbitrary field has a QC generalized inverse of the same circulant size.
The Role of Arg13 in Protein Phosphatase M tPphA from Thermosynechococcus elongatus

A highly conserved arginine residue is close to the catalytic center of PPM/PP2C-type protein phosphatases. Different crystal structures of PPM/PP2C homologues revealed that the guanidinium side chain of this arginine residue can adopt variable conformations and may bind ligands, suggesting an important role of this residue during catalysis. In this paper, we randomly mutated Arginine 13 of tPphA, a PPM/PP2C-type phosphatase from Thermosynechococcus elongatus, and obtained 18 different amino acid variants. The generated variants were tested towards p-nitrophenyl phosphate and various phosphopeptides. Towards p-nitrophenyl phosphate as substrate, twelve variants showed 3–7 times higher K m values than wild-type tPphA and four variants (R13D, R13F, R13L, and R13W) completely lost activity. Strikingly, these variants were still able to dephosphorylate phosphopeptides, although with strongly reduced activity. The specific inability of some Arg-13 variants to hydrolyze p-nitrophenyl phosphate highlights the importance of additional substrate interactions apart from the substrate phosphate for catalysis. The properties of the R13 variants indicate that this residue assists in substrate binding.
A fast relighting engine for interactive cinematic lighting design

We present new techniques for interactive cinematic lighting design of complex scenes that use procedural shaders. Deep-framebuffers are used to store the geometric and optical information of the visible surfaces of an image. The geometric information is represented as collections of oriented points, and the optical information is represented as bi-directional reflection distribution functions, or BRDFs. The BRDFs are generated by procedurally defined surface texturing functions that spatially vary the surfaces' appearances. The deep-framebuffer information is rendered using a multi-pass algorithm built on the OpenGL graphics pipeline. In order to handle both physically-correct as well as non-realistic reflection models used in the film industry, we factor the BRDF into independent components that map onto both the lighting and texturing units of the graphics hardware. A similar factorization is used to control the lighting distribution. Using these techniques, lighting calculations can be evaluated 2500 times faster than previous methods. This allows lighting changes to be rendered at rates of 20Hz in static environments that contain millions of objects of with dozens of unique procedurally defined surface properties and scores of lights.
Organization Restrained Negotiation Behavior in CGF

Due to the uncertainty of battlefield environment, the coherence of organizational behavior is often blocked by the conflicting beliefs among team members. Yet there are few conflicts resolving mechanisms embedded in existing models of CGF. Aiming at human behavior representing (HBR) preciseness requested by combat simulation, a negotiation based conflicts resolving method is presented. Distinct from most existing theories, the negotiation behavior among CGF entities is cooperative. In addition, the communication and decision making behaviors of CGF entities are often restrained by the organization frame. Thus, the organization restrained negotiation behavior is preliminarily analyzed. Finally, a simple example is given. The results show that the method is available and efficient.
Fitness Landscapes and the Origin of Species

The origin of species has fascinated both biologists and the general public since the publication of Darwin's Origin of Species in 1859. Significant progress in understanding the process was achieved in the "modern synthesis," when Theodosius Dobzhansky, Ernst Mayr, and others reconciled Mendelian genetics with Darwin's natural selection. Although evolutionary biologists have developed significant new theory and data about speciation in the years since the modern synthesis, this book represents the first systematic attempt to summarize and generalize what mathematical models tell us about the dynamics of speciation. Fitness Landscapes and the Origin of Species presents both an overview of the forty years of previous theoretical research and the author's new results. Sergey Gavrilets uses a unified framework based on the notion of fitness landscapes introduced by Sewall Wright in 1932, generalizing this notion to explore the consequences of the huge dimensionality of fitness landscapes that correspond to biological systems. In contrast to previous theoretical work, which was based largely on numerical simulations, Gavrilets develops simple mathematical models that allow for analytical investigation and clear interpretation in biological terms. Covering controversial topics, including sympatric speciation and the effects of sexual conflict on speciation, this book builds for the first time a general, quantitative theory for the origin of species.
Flexible Wireless Trust Through Ontology-Based Mapping and Its Attendant Semantic Limitations

Trusted interaction in a wireless environment is highly challenging as possibly interacting mobile entities are not known to each other at design or deployment time. This paper proposes an architecture, and considers the inherent semantic limitations, for intelligent trust establishment and dynamic authentication and authorization between mobile entities previously unknown to each other, utilizing ontology-based mapping at a common certificate authority server. The proposed solution can assist with mapping of attributes on which to base trust decisions, in a range of instances but there are also inherent semantic limitations discussed later in the paper.
Investigation on the directivity of ultrasonic scattering field using dynamic photoelastic technique

A dynamic photoelastic imaging system is presented and employed to study the directivity of ultrasonic scattering field. Focusing on the cylindrical cavity, photoelastic photograph displays the scattering field, and the directivity patterns of different distances can be plotted by the gray level per pixel. Compared with the simulation results by finite element method (FEM), dynamic photoelastic technique shows more reliable directivity patterns which are in close proximity to the practical scattering field.
Adapting learning parameter transition in the Generalized Learning Vector Quantization family of classifiers

Many methods of hyperspectral data classification require the adjustment of learning parameters for their success. To this end, one may fix the learning parameters, offer a functional-based parameter decay, or use a step-wise decrement of the learning parameters after a fixed number of training steps. Each of the three methods described rely on the expertise of user and do not necessarily lend themselves well to time-sensitive solutions. Classification methods based on the optimization of a cost function offer a clear advantage as this cost function can be used to adapt the learning schedule of the learning machine thus speeding convergence. We demonstrate this concept applied to variants of Sato & Yamada's Generalized Learning Vector Quantization and transition to the next set of learn rates at the appropriate time in the learning process. Experiments show that, by monitoring the stationarity of the cost function, one can automatically transition to the next learning parameter set significantly decreasing training times.
Autoreferat Do Rozprawy " Security against Space-restricted Physical Attacks "

Streszczenie Rozprawa doktorska wprowadza nowy, zdefiniowany przez autora model oblicze´n krypto-graficznych, nazwany SBA–modelem. Charakterystyczne cechy tego modelu to ograniczona pami˛ e´c, wycieki oraz u˙ zycie losowej wyroczni. W rozprawie badane s ˛ a trzy schematy kryp-tograficzne: Jednorazowe funkcje pseudolosowe, Schemat ewolucji klucza oraz Funkcje jednora-zowe (ang. One-time computable pseudorandom function, Key-evolution schemes oraz One-time programs). Pokazujemy istnienie ww. schematów w SBA–modelu. Wyniki z roprawy zostały zaprezentowane w nast˛ epuj ˛ acych pracach: [11, 14, 15]. 1 Wprowadzenie Praca dotyczy problemów kryptograficznych w modelu z wyciekami informacji oraz aktywnym prze-ciwnikiem. Zaczniemy od wyja´snie´n intuicyjnych. Wszystkie wyniki w tej pracy dotykaj ˛ a ogólnego schematu: istnieje długi ci ˛ ag bitów R (w zamia-rze tajny), z którego potrafimy co´s obliczy´c (powiedzmy f (R)), a chcemy aby pozostało to sekretem. W trakcie eksperymentu pojawi si˛ e przeciwnik, który czego´s o R si˛ e dowie, ale prawie zawsze oka˙ ze si˛ e ta wiedza zbyt mała, aby wnioskowa´c co´s na temat f (R). We współczesnej kryptografii istnieje trend konstruowania protokołów odpornych na podobnych przeciwników. Zwykle albo zakładamy i˙ z przeciwnik jest pasywny, co oznacza, ˙ ze nie wpływa na R w trakcie wykonania oblicze´n przez uczciwego u˙ zytkownika, a jedynie wybiera funkcj˛ e g i poznaje g(R) 1. Oczywi´scie g nie mo˙ ze by´c dowolne, bo wówczas gdy g = f , to przeciwnik poznaje cały sekret od razu. Ta uwaga sugeruje, ˙ ze rozs ˛ adne jest przyj˛ ecie zało˙ zenia, ˙ ze g musi by´c wybrane z jakiej´s (mo˙ zliwie szerokiej) klasy, do której nie nale˙ zy f. Przykładem jest zało˙ zenie, ˙ ze zbiór warto´sci g jest istotnie mniejszy ni˙ z f , tzn. Inne zało˙ zenie to tak zwany przeciwnik aktywny 2 , który mo˙ ze zło´sliwie podmienia´c R na wybrane R czy wr˛ ecz zmienia´c algorytm liczenia funkcji z f na wybrane f. W tej pracy podj˛ eta jest próba poł ˛ aczenia tych dwóch paradygmatów. To znaczy opisany ni˙ zej model zakłada, ˙ ze istnieje aktywny wirus (A small), który dodatkowo mo˙ ze spowodowa´c wybrany wyciek. Przy pewnych ograniczeniach pokazujemy, ˙ ze skonstruowane schematy wci ˛ a˙ z pozostaj ˛ a bezpieczne. Ten model nazywamy SBA–modelem. 3 Jest to poj˛ ecie nowe, wprowadzone przez autora rozprawy. 1 Popularnie mówi ˛ ac: przeciwnik powoduje wyciek g. 2 Popularnie mówi ˛ ac: przeciwnik jest wirusem. 3 Skrót SBA pochodzi od Small and Big Adversary.