Facile synthesis methodology and characterization studies of silica-decorated hybridized anisotropic nanotubes and nanosheets

Carbonaceous nanomaterials and their derivatives have been inspired tremendous enthusiasm in the scientific community. They have been excogitated as the encouraging attributes and the qualified dispersed phase to develop multi-functional composites. Particularly, graphene and carbon nanotube (anisotropic fillers) have gained substantial research interest owing to their promising characteristics. This highlights an innovative technique to synthesize hybridized nanotube and nanosheet. Initially, parent materials have been synthesized: The pristine CNT has been modified by acid mixture solution, and reduced graphene oxide has been prepared by chemical reduction method. Henceforth, the self-assembly in situ sol–gel technique has been endorsed here. The synthesized nanohybrids have been characterized by different spectroscopic techniques: FTIR, Raman, UV, and XPS to confirm the attachment of multifunctionalities; meanwhile, the composition and stability have been investigated from XRD and TGA plots. The magnitude of surface charge and particle size distribution have been evaluated for the parent and hybridized products; further, morphology of all the samples has been authenticated from FESEM and TEM.     

UVB-induced photodamage to phycobilisomes of Synechococcus sp. PCC 7942

The effect of UVB irradiation on the phycobilisomes (PBSs) of Synechococcus sp. PCC 7942 cells was studied. The sucrose density-gradient-isolated PBSs from in vivo UVB-treated (280–320 nm) cells showed a strong decrease in β-phycocyanin (βPC) and -phycocyanin (PC) polypeptides. In addition to a decrease in the linker polypeptides LCM 75 (linker connecting the core to the thylakoid membranes), LR 33 (linker in the rod structure), LRC 31.5 (linker connecting the rod to the core) and LRC 29. In vitro UVB treatment of gradient-isolated intact PBSs for 1 h had no effect on any of the constituent polypeptides, and only after 2 h was a degradation of LCM 75 and LR 33 and a decrease in βPC evident. Further investigation of phycobiliproteins (4 h of UVB irradiation) using polyclonal antibody directed against purified whole PBSs revealed that, in vivo, there was a gradual decline in the levels of LCM 75, LR 33, LRC 31.5, LRC 29, βPC and PC.     

Complete tree subset difference broadcast encryption scheme and its analysis

The subset difference (SD) method proposed by Naor, Naor and Lotspiech is the most popular broadcast encryption (BE) scheme. It is suitable for real-time applications like Pay-TV and has been suggested for use by the AACS standard for digital rights management in Blu-Ray and HD-DVD discs. The SD method assumes the number of users to be a power of two. We propose the complete tree subset difference (CTSD) method that allows the system to support an arbitrary number of users. In particular, it subsumes the SD method and all results proved for the CTSD method also hold for the SD method. Recurrences are obtained for the CTSD scheme to count the number, N(n, r, h), of possible ways r users in the system of n users can be revoked to result in a transmission overhead or header length of h. The recurrences lead to a polynomial time dynamic programming algorithm for computing N(n, r, h). Further, they provide bounds on the maximum possible header length. A probabilistic analysis is performed to obtain an O(r log n) time algorithm to compute the expected header length in the CTSD scheme. Further, for the SD scheme we obtain an explicit limiting upper bound on the expected header length.     

Geometric modeling and validation of twist drills with a generic point profile

Traditionally, twist drills with a few specific point geometry, such as planar, conical, cylindrical, ellipsoidal or hyperboloidal, have been designed and adapted for specific applications. Using CAD, the point geometry can be given a generic definition which will enhance the freedom to design drills with different point profiles and optimize them for multiple objectives. Such a definition can also be used for several downstream applications. This paper presents a methodology to model the twist drills with generic point geometry using NURBS. To begin with, a detailed basic model for a fluted twist drill with sectional geometry made up of arcs and straight lines has been presented in terms of bi-parametric surface patches. The coordinates of cutting lips and chisel edge of the drill have been obtained as solution to a surface-curve intersection problem using optimization algorithm. Subsequently, the model has been generalized by employing NURBS to represent the curves whereby the cutting edges and angles can be altered simply by changing the control points or their respective weights. Using this methodology, the generic definitions of the conventional angles on the drill point have been derived and presented. The proposed model has been illustrated in MATLAB environment and validated experimentally for a conical and an arbitrary point geometry. The experiments show a good conformity with the theoretical evaluations.     

Quadrature Based Optimal Iterative Methods with Applications in High-Precision Computing

We present a simple yet effective and applicable scheme, based on quadrature, for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve a maximum convergence order of $2^n$. Through quadrature, we develop optimal iterative methods of orders four and eight. The scheme can further be applied to develop iterative methods of even higher orders. Computational results demonstrate that the developed methods are efficient as compared with many well known methods.     

A branch-and-cut method for 0-1 mixed convex programming

We generalize the disjunctive approach of Balas, Ceria, and Cornuéjols [2] and devevlop a branch-and-cut method for solving 0-1 convex programming problems. We show that cuts can be generated by solving a single convex program. We show how to construct regions similar to those of Sherali and Adams [20] and Lovász and Schrijver [12] for the convex case. Finally, we give some preliminary computational results for our method. Received January 16, 1996 / Revised version received April 23, 1999?Published online June 28, 1999     

A note on bi-criteria transportation problems

The present note reveals a drawback in an algorithm ofAneja/Nair [1979] for the determination of efficient solutions in a bi-criteria transportation problem with an additional time objective function and develops a modified procedure that overcomes this weakness.

---

Zusammenfassung In der vorliegenden Arbeit wird ein Fehlschluß im Algorithmus vonAneja/Nair [1979] zum Auffinden aller effizienten Lösungen eines Transportproblems mit zwei Summen- und einer Engpaßzielfunktion aufgezeigt. Ferner wird ein Verfahren angegeben, in dem diese Unstimmigkeiten nicht mehr auftreten.

     

On the F-fundamental group scheme

Let X be a smooth projective variety defined over a perfect field k of positive characteristic, and let FX be the absolute Frobenius morphism of X. For any vector bundle E→X, and any polynomial g with non-negative integer coefficients, define the vector bundle using the powers of FX and the direct sum operation. We construct a neutral Tannakian category using the vector bundles with the property that there are two distinct polynomials f and g with non-negative integer coefficients such that . We also investigate the group scheme defined by this neutral Tannakian category.