Groups, graphs and mutually unbiased bases

A new characteristic free approach to constructing large sets of mutually unbiased bases in Hilbert space is developed. We associate with a seed set of bases a finite subgroup of which defines a strongly regular graph. Large sets of mutually unbiased bases are obtained as the cliques of the graph.

Identification of an integral plasma membrane pool of protein kinase C in mammalian tissues and cells

Protein kinase C (PKC) is a family of serine/threonine protein kinases that are pivotal in cellular regulation. Since its discovery in 1977, PKCs have been known as cytosolic and peripheral membrane proteins. However, there are reports that PKC can insert into phospholipids vesicles in vitro. Given the intimate relationship between the plasma membrane and the activation of PKC, it is important to determine whether such “membrane-inserted” form of PKC exists in mammalian cells or tissues. Here, we report the identification of an integral plasma membrane pool for all the 10 PKC isozymes in vivo by their ability to partition into the detergent-rich phase in Triton X-114 phase partitioning, and by their resistance to extractions with 0.2 M sodium carbonate (pH 11.5), 2 M urea and 2 M sodium chloride. The endogenous integral membrane pool of PKC in mouse fibroblasts is found to be acutely regulated by phorbol ester or diacylglycerol, suggesting that this pool of PKC may participate in cellular processes known to be regulated by PKC. At least for PKCα, the C2–V3 region at the regulatory domain of the kinase is responsible for membrane integration. Further exploration of the function of this novel integral plasma membrane pool of PKC will not only shed new light on molecular mechanisms underlying its cellular functions but also provide new strategies for pharmaceutical modulation of this important group of kinases.

Clock synchronization state graphs based on clock precision difference

Consistent and stable global states of clock synchronization are very important in distributed and parallel systems. This paper presents an innovative strategy and method to obtain stable global clock synchronization state graphs in asynchronous Internet environments. Our model will introduce the concept of clock precision difference as a means to evaluate running states of all clocks in this system and make this system  self-adaptive well. Finally, we introduce the concept of clock precision difference into global states analysis of clock synchronization and construct clock synchronization state graphs in order to evaluate distributed clock synchronization states. We also present detailed simulations of the strategy and mathematical analysis used on real Internet environments.

Integral terminal sliding mode cooperative control of multi-robot networks

This paper studies the integral terminal sliding mode cooperative control of multi-robot networks. Here, we first propose an integral terminal sliding mode surface for a class of first order systems. Then, we prove that finite time consensus tracking of multi-robot networks can be achieved on this integral terminal sliding mode surface. Simulation results are presented to validate the analysis.

Integral approach and numerical improvement to calculate the carbon concentration profiles in carburising process

In the present work, the carbon diffusion in steel, where the carbon diffusivity varies with the carbon content, was solved with the integral methods under the third boundary condition. The variation of carbon diffusivity in steel with the carbon content was described with two different functions ie. linear dependence and exponential dependence. The integral approximation for both cases was improved with the numerical computation to more accurately predict the carbon profiles. The integral solution is more accurate than the formulation based on the assumption of a constant diffusivity or those based on the assumption of a constant diffusivity and/or constant carbon content at part surface. It is also more easily used in practice than the numerical method to describe the carburising process and predict the carbon content at steel surface and carbon profiles in treated layer.

Intersection and partition graphs

This thesis reviews previous work done on both general partition graphs and existential partition graphs, which are a generalised form of general partition graphs, and extends some of the results.

Drawing to learn in science

Should science learners be challenged to draw more? Certainly making visualizations is integral to scientific thinking. Scientists do not use words only but rely on diagrams, graphs, videos, photographs, and other images to make discoveries, explain findings, and excite public interest. From the notebooks of Faraday and Maxwell (1) to current professional practices of chemists (2), scientists imagine new relations, test ideas, and elaborate knowledge through visual representations (3–5).

Automatic grain texture analysis using integral transforms

Tonewood for musical instruments is quarter-sawn and frequently quality-graded based on visual appearance, mechanical and acoustic properties. The assessment uses simple human (subjective) observation, and two ‘‘experts’’ can rate the same sample differently. This paper describes the application of integral transforms (Fourier and Radon) for automatic (objective) assessment of the visual appearance of 10 Sitka spruce (Picea sitchensis) sample images. This work considers surface classification on the basis of grain orientation, count, spacing, and evenness or uniformity.

Malware variant detection using similarity search over sets of control flow graphs

Static detection of polymorphic malware variants plays an important role to improve system security. Control flow has shown to be an effective characteristic that represents polymorphic malware instances. In our research, we propose a similarity search of malware using novel distance metrics of malware signatures. We describe a malware signature by the set of control flow graphs the malware contains. We propose two approaches and use the first to perform pre-filtering. Firstly, we use a distance metric based on the distance between feature vectors. The feature vector is a decomposition of the set of graphs into either fixed size k-sub graphs, or q-gram strings of the high-level source after decompilation. We also propose a more effective but less computationally efficient distance metric based on the minimum matching distance. The minimum matching distance uses the string edit distances between programs' decompiled flow graphs, and the linear sum assignment problem to construct a minimum sum weight matching between two sets of graphs. We implement the distance metrics in a complete malware variant detection system. The evaluation shows that our approach is highly effective in terms of a limited false positive rate and our system detects more malware variants when compared to the detection rates of other algorithms.

Integral approach and numerical improvement to calculate carbon concentration profiles in carburising

The carbon diffusion in steel, where the carbon diffusivity varies with the carbon content, was solved with the integral methods under the third boundary condition. The variation of carbon diffusivity in steel with the carbon content was described with two different functions, linear dependence and exponential dependence. The integral approximation for both cases was improved with the numerical computation to more accurately predict the carbon profiles. The integral solution is more accurate than the formulation based on the assumption of a constant diffusivity or those based on the assumption of a constant diffusivity and/or constant carbon content at part surface. It is also more easily used in practice than the numerical method to describe the carburising process and predict the carbon content at steel surface and carbon profiles in treated layer.