Open access and soft power: Chinese voices in international scholarship

Networked digital technologies and Open Access (OA) are transforming the processes and institutions of research, knowledge creation and dissemination globally: enabling new forms of collaboration, allowing researchers to be seen and heard in new ways and reshaping relationships between stakeholders across the global academic publishing system. This article draws on Joseph Nye’s concept of ‘Soft Power’ to explore the role that OA is playing in helping to reshape academic publishing in China. It focusses on two important areas of OA development: OA journals and national-level repositories. OA is being supported at the highest levels, and there is potential for it to play an important role in increasing the status and impact of Chinese scholarship. Investments in OA also have the potential to help China to re-position itself within international copyright discourses: moving beyond criticism for failure to enforce the rights of foreign copyright owners and progressing an agenda that places greater emphasis on equality of access to the resources needed to foster innovation. However, the potential for OA to help China to build and project its soft power is being limited by the legacies of the print era, as well as the challenges of efficiently governing the national research and innovation systems.

Application of artificial intelligence for the assessment of the status of power transformers

The Dissolved Gas Analysis (DGA) a non destructive test procedure, has been in vogue for a long time now, for assessing the status of power and related transformers in service. An early indication of likely internal faults that may exist in Transformers has been seen to be revealed, to a reasonable degree of accuracy by the DGA. The data acquisition and subsequent analysis needs an expert in the concerned area to accurately assess the condition of the equipment. Since the presence of the expert is not always guaranteed, it is incumbent on the part of the power utilities to requisition a well planned and reliable artificial expert system to replace, at least in part, an expert. This paper presents the application of Ordered Ant Mner (OAM) classifier for the prediction of involved fault. Secondly, the paper also attempts to estimate the remaining life of the power transformer as an extension to the elapsed life estimation method suggested in the literature.

Architecture of a polymorphic ASIC for interoperability across multi-mode H.264 decoders

Run-time interoperability between different applications based on H.264/AVC is an emerging need in networked infotainment, where media delivery must match the desired resolution and quality of the end terminals. In this paper, we describe the architecture and design of a polymorphic ASIC to support this. The H.264 decoding flow is partitioned into modules, such that the polymorphic ASIC meets the design goals of low-power, low-area, high flexibility, high throughput and fast interoperability between different profiles and levels of H.264. We demonstrate the idea with a multi-mode decoder that can decode baseline, main and high profile H.264 streams and can interoperate at run.time across these profiles. The decoder is capable of processing frame sizes of up to 1024 times 768 at 30 fps. The design synthesized with UMC 0.13 mum technology, occupies 250 k gates and runs at 100 MHz.

Energy–aware forwarding strategies for delay tolerant networking (DTN) routing protocols

This research addresses efficient use of the available energy in resource constrained mobile sensor nodes to prevent early depletion of the battery and maximize the packet delivery rate. This research contributes two energy-aware enhancement strategies to improve the network lifetime and delivery probability for energy constrained applications in the delay-tolerant networking environment.

Complexity of scheduling for minimum power on a GMAC

Two decision versions of a combinatorial power minimization problem for scheduling in a time-slotted Gaussian multiple-access channel (GMAC) are studied in this paper. If the number of slots per second is a variable, the problem is shown to be NP-complete. If the number of time-slots per second is fixed, an algorithm that terminates in O (Length (I)N+1) steps is provided.

Thermoelectric Power Under Strong Magnetic Field in Quantum Dots and Quantized Superlattices: Simplified Theory and Relative Comparison

In this paper, we study the thermoelectric power under strong magnetic field (TPSM) in quantum dots (QDs) of nonlinear optical, III-V, II-VI, GaP, Ge, Te, Graphite, PtSb2, zerogap, Lead Germanium Telluride, GaSb, stressed materials, Bismuth, IV-VI, II-V, Zinc and Cadmium diphosphides, Bi2Te3 and Antimony respectively. The TPSM in III-V, II-VI, IV-VI, HgTe/CdTe quantum well superlattices with graded interfaces and effective mass superlattices of the same materials together with the quantum dots of aforementioned superlattices have also been investigated in this context on the basis of respective carrier dispersion laws. It has been found that the TPSM for the said quantum dots oscillates with increasing thickness and decreases with increasing electron concentration in various manners and oscillates with film thickness, inverse quantizing magnetic field and impurity concentration for all types of superlattices with two entirely different signatures of quantization as appropriate in respective cases of the aforementioned quantized structures. The well known expression of the TPSM for wide-gap materials has been obtained as special case for our generalized analysis under certain limiting condition, and this compatibility is an indirect test of our generalized formalism. Besides, we have suggested the experimental method of determining the carrier contribution to elastic constants for nanostructured materials having arbitrary dispersion laws.

Simulation of Dust Loaded V-I Characteristics of a Commercial Thermal Power Plant Precipitator

A new approach based on finite difference method, is proposed for the simulation of electrical conditions in a dc energized wire-duct electrostatic precipitator with and without dust loading. Simulated voltage-curren characteristics with and without dust loading were compared with the measured characteristics for analyzing the performance of a precipitator. The simple finite difference method gives sufficiently accurate results with reduced mesh size. The results for dust free simulation were validated with published experimental data. Further measurements were conducted at a thermal power plant in India and the results compares well with the measured ones.

Jointly optimal power control and routing for a single cell, dense, ad hoc wireless network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (1/eta)(t), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterisation of the optimal operating point.

Estimation of remaining life of power transformers

Inadvertent failure of power transformers has serious consequences on the power system reliability, economics and the revenue accrual. Insulation is the weakest link in the power transformer prompting periodic inspection of the status of insulation at different points in time. A close Monitoring of the electrical, chemical and such other properties on insulation as are sensitive to the amount of time-dependent degradation becomes mandatory to judge the status of the equipment. Data-driven Diagnostic Testing and Condition Monitoring (DTCM) specific to power transformer is the aspect in focus. Authors develop a Monte Carlo approach for augmenting the rather scanty experimental data normally acquired using Proto-types of power transformers. Also described is a validation procedure for estimating the accuracy of the Model so developed.

Low power pipelined TCAM employing mismatch dependent power allocation technique

This paper presents design of a Low power 256x72 bit TCAM in 0.13um CMOS technology. In contrast to conventional Match line (ML) sensing scheme in which equal power is consumed irrespective of match or mismatch, the ML scheme employed in this design allocates less power to match decisions involving a large number of mismatched bits. Typically, the probability of mismatch is high so this scheme results in significant CAM power reduction. We propose to use this technique along with pipelining of search operation in which the MLs are broken into several segments. Since most words fail to match in first segment, the search operation for subsequent segments is discontinued, resulting in further reduction in power consumption. The above architecture provides 70% power reduction while performing search in 3ns.

Revocation and update of trust in autonomous delay tolerant networks

A Delay Tolerant Network (DTN) is a dynamic, fragmented, and ephemeral network formed by a large number of highly mobile nodes. DTNs are ephemeral networks with highly mobile autonomous nodes. This requires distributed and self-organised approaches to trust management. Revocation and replacement of security credentials under adversarial influence by preserving the trust on the entity is still an open problem. Existing methods are mostly limited to detection and removal of malicious nodes. This paper makes use of the mobility property to provide a distributed, self-organising, and scalable revocation and replacement scheme. The proposed scheme effectively utilises the Leverage of Common Friends (LCF) trust system concepts to revoke compromised security credentials, replace them with new ones, whilst preserving the trust on them. The level of achieved entity confidence is thereby preserved. Security and performance of the proposed scheme is evaluated using an experimental data set in comparison with other schemes based around the LCF concept. Our extensive experimental results show that the proposed scheme distributes replacement credentials up to 35% faster and spreads spoofed credentials of strong collaborating adversaries up to 50% slower without causing any significant increase on the communication and storage overheads, when compared to other LCF based schemes.

Hybrid algorithms for power system unit commitment

Four hybrid algorithms has been developed for the solution of the unit commitment problem. They use simulated annealing as one of the constituent techniques, and produce lower cost schedules; two of them have less overhead than other soft computing techniques. They are also more robust to the choice of parameters. A special technique avoids the generating of infeasible schedules, and thus reduces computation time.

Decentralised key management for delay tolerant networks

Public key authentication is the verification of the identity-public key binding, and is foundational to the security of any network. The contribution of this thesis has been to provide public key authentication for a decentralised and resource challenged network such as an autonomous Delay Tolerant Network (DTN). It has resulted in the development and evaluation of a combined co-localisation trust system and key distribution scheme evaluated on a realistic large geographic scale mobility model. The thesis also addresses the problem of unplanned key revocation and replacement without any central authority.

Average-Delay Optimal Policies for the Point-to-Point Channel

Average-delay optimal scheduflng of messages arriving to the transmitter of a point-to-point channel is considered in this paper. We consider a discrete time batch-arrival batch-service queueing model for the communication scheme, with service time that may be a function of batch size. The question of delay optimality is addressed within the semi-Markov decision-theoretic framework. Approximations to the average-delay optimal policy are obtained.