Fluorescence spectrometric study on the interactions of isoprocarb and sodium 2-isopropylphenate with bovine serum albumin

The binding interaction of the pesticide Isoprocarb and its degradation product, sodium 2-isopropylphenate, with bovine serum albumin (BSA) was studied by spectrofluorimetry under simulated physiological conditions. Both Isoprocarb and sodium 2-isopropylphenate quenched the intrinsic fluorescence of BSA. This quenching proceeded via a static mechanism. The thermodynamic parameters (ΔH°, ΔS° and ΔG°) obtained from the fluorescence data measured at two different temperatures showed that the binding of Isoprocarb to BSA involved hydrogen bonds and that of sodium 2-isopropylphenate to BSA involved hydrophobic and electrostatic interactions. Synchronous fluorescence spectroscopy of the interaction of BSA with either Isoprocarb or sodium 2-isopropylphenate showed that the molecular structure of the BSA was changed significantly, which is consistent with the known toxicity of the pesticide, i.e., the protein is denatured. The sodium 2-isopropylphenate, was estimated to be about 4–5 times more toxic than its parent, Isoprocarb. Synchronous fluorescence spectroscopy and the resolution of the three-way excitation–emission fluorescence spectra by the PARAFAC method extracted the relative concentration profiles of BSA, Isoprocab and sodium 2-isopropylphenate as a function of the added sodium 2-isopropylphenate. These profiles showed that the degradation product, sodium 2-isopropylphenate, displaced the pesticide in a competitive reaction with the BSA protein.

Discussions in space

In-place digital augmentation enhances the experience of physical spaces through digital technologies that are directly accessible within that space. This can take place in many forms and ways, e.g., through location-aware applications running on the individuals’ portable devices, such as smart phones, or through large static devices, such as public displays, which are located within the augmented space and accessible by everyone. The hypothesis of this study is that in-place digital augmentation, in the context of civic participation, where citizens collaboratively aim at making their community or city a better place, offers significant new benefits, because it allows access to services or information that are currently inaccessible to urban dwellers where and when they are needed: in place. This paper describes our work in progress deploying a public screen to promote civic issues in public, urban spaces, and to encourage public feedback and discourse via mobile phones.

Relentless patterns the immersive interior

What happens when patterns become all pervasive? When pattern contagiously corrupts and saturates adjacent objects, artefacts and surfaces; blurring internal and external environment and dissolving any single point of perspective or static conception of space. Mark Taylor ruminates on the possibilities of relentless patterning in interior space in both a historic and a contemporary context.

Walking and sitting in the Australian Antarctic Territory : mobility and imperial space

In 1995 and 1997, two major Australian expeditions travelled to Antarctica. They were the most heavily-reported Antarctican events of their two years: they were charged with the public production of Australian Antarctic spatiality. Both published exploration narratives: Don and Margie McIntyre’s Expedition Icebound generated an illustrated coffee-table book, Two Below Zero: A Year Alone in Antarctica, and the Spirit of Australia South Pole Expedition published its narrative as a video titled Walking on Ice: The History-Making Expedition to the South Pole. Yet, despite the fact that the two polar trips took place during the same period, their spatialities are markedly different. Walking on Ice is a mobile narrative of imperial exploration, while Two Below Zero is a static spatial story of colonial settlement. How polar mobility and relative immobility figure in Australia’s perceptions of, and claim to, nearly half of Antarctica is the focus of this chapter.

Characteristic analysis for multisampled digital implementation of fixed-switching-frequency closed-loop modulation of voltage-source inverter

In this paper, a fixed-switching-frequency closed-loop modulation of a voltage-source inverter (VSI), upon the digital implementation of the modulation process, is analyzed and characterized. The sampling frequency of the digital processor is considered as an integer multiple of the modulation switching frequency. An expression for the determination of the modulation design parameter is developed for smooth modulation at a fixed switching frequency. The variation of the sampling frequency, switching frequency, and modulation index has been analyzed for the determination of the switching condition under closed loop. It is shown that the switching condition determined based on the continuous-time analysis of the closed-loop modulation will ensure smooth modulation upon the digital implementation of the modulation process. However, the stability properties need to be tested prior to digital implementation as they get deteriorated at smaller sampling frequencies. The closed-loop modulation index needs to be considered maximum while determining the design parameters for smooth modulation. In particular, a detailed analysis has been carried out by varying the control gain in the sliding-mode control of a two-level VSI. The proposed analysis of the closed-loop modulation of the VSI has been verified for the operation of a distribution static compensator. The theoretical results are validated experimentally on both single- and three-phase systems.

Robot path planning in dynamic environments using a simulated annealing based approach

Mobile robots are widely used in many industrial fields. Research on path planning for mobile robots is one of the most important aspects in mobile robots research. Path planning for a mobile robot is to find a collision-free route, through the robot’s environment with obstacles, from a specified start location to a desired goal destination while satisfying certain optimization criteria. Most of the existing path planning methods, such as the visibility graph, the cell decomposition, and the potential field are designed with the focus on static environments, in which there are only stationary obstacles. However, in practical systems such as Marine Science Research, Robots in Mining Industry, and RoboCup games, robots usually face dynamic environments, in which both moving and stationary obstacles exist. Because of the complexity of the dynamic environments, research on path planning in the environments with dynamic obstacles is limited. Limited numbers of papers have been published in this area in comparison with hundreds of reports on path planning in stationary environments in the open literature. Recently, a genetic algorithm based approach has been introduced to plan the optimal path for a mobile robot in a dynamic environment with moving obstacles. However, with the increase of the number of the obstacles in the environment, and the changes of the moving speed and direction of the robot and obstacles, the size of the problem to be solved increases sharply. Consequently, the performance of the genetic algorithm based approach deteriorates significantly. This motivates the research of this work. This research develops and implements a simulated annealing algorithm based approach to find the optimal path for a mobile robot in a dynamic environment with moving obstacles. The simulated annealing algorithm is an optimization algorithm similar to the genetic algorithm in principle. However, our investigation and simulations have indicated that the simulated annealing algorithm based approach is simpler and easier to implement. Its performance is also shown to be superior to that of the genetic algorithm based approach in both online and offline processing times as well as in obtaining the optimal solution for path planning of the robot in the dynamic environment. The first step of many path planning methods is to search an initial feasible path for the robot. A commonly used method for searching the initial path is to randomly pick up some vertices of the obstacles in the search space. This is time consuming in both static and dynamic path planning, and has an important impact on the efficiency of the dynamic path planning. This research proposes a heuristic method to search the feasible initial path efficiently. Then, the heuristic method is incorporated into the proposed simulated annealing algorithm based approach for dynamic robot path planning. Simulation experiments have shown that with the incorporation of the heuristic method, the developed simulated annealing algorithm based approach requires much shorter processing time to get the optimal solutions in the dynamic path planning problem. Furthermore, the quality of the solution, as characterized by the length of the planned path, is also improved with the incorporated heuristic method in the simulated annealing based approach for both online and offline path planning.

The innovation deficit in public services : the curious problem of too much efficiency and not enough waste and failure

It has long been recognised that government and public sector services suffer an innovation deficit compared to private or market-based services. This paper argues that this can be explained as an unintended consequence of the concerted public sector drive toward the elimination of waste through efficiency, accountability and transparency. Yet in an evolving economy this can be a false efficiency, as it also eliminates the 'good waste' that is a necessary cost of experimentation. This results in a systematic trade0off in the public sector between the static efficiency of minimizing the misuse of public resources and the dynamic efficiency of experimentation. this is inherently biased against risk and uncertainty and therein, explains why governments find service innovation so difficult. In the drive to eliminate static inefficiencies, many political systems have susequently overshot and stifled policy innovation. I propose the 'Red Queen' solution of adaptive economic policy.

Population Monte Carlo Algorithm in High Dimensions

The population Monte Carlo algorithm is an iterative importance sampling scheme for solving static problems. We examine the population Monte Carlo algorithm in a simplified setting, a single step of the general algorithm, and study a fundamental problem that occurs in applying importance sampling to high-dimensional problem. The precision of the computed estimate from the simplified setting is measured by the asymptotic variance of estimate under conditions on the importance function. We demonstrate the exponential growth of the asymptotic variance with the dimension and show that the optimal covariance matrix for the importance function can be estimated in special cases.

Control and protection of a microgrid with converter interfaced micro sources

This paper describes protection and control of a microgrid with converter interfaced micro sources. The proposed protection and control scheme consider both grid connected and autonomous operation of the microgrid. A protection scheme, capable of detecting faults effectively in both grid connected and islanded operations is proposed. The main challenge of the protection, due to current limiting state of the converters is overcome by using admittance relays. The relays operate according to the inverse time characteristic based on measured admittance of the line. The proposed scheme isolates the fault from both sides, while downstream side of the microgrid operates in islanding condition. Moreover faults can be detected in autonomous operation. In grid connected mode distributed generators (DG) supply the rated power while in absence of the grid, DGs share the entire power requirement proportional to rating based on output voltage angle droop control. The protection scheme ensures minimum load shedding with isolating the faulted network and DG control provides a smooth islanding and resynchronization operation. The efficacy of coordinated control and protection scheme has been validated through simulation for various operating conditions.

Power sharing and stability enhancement of an autonomous microgrid with inertial and non-inertial DGs with DSTATCOM

This paper proposes a method of enhancing system stability with a distribution static compensator (DSTATCOM) in an autonomous microgrid with multiple distributed generators (DG). It is assumed that there are both inertial and non-inertial DGs connected to the microgrid. The inertial DG can be a synchronous machine of smaller rating while inertia less DGs (solar) are assumed as DC sources. The inertia less DGs are connected through Voltage Source Converter (VSC) to the microgrid. The VSCs are controlled by either state feedback or current feedback mode to achieve desired voltage-current or power outputs respectively. The power sharing among the DGs is achieved by drooping voltage angle. Once the reference for the output voltage magnitude and angle is calculated from the droop, state feedback controllers are used to track the reference. The angle reference for the synchronous machine is compared with the output voltage angle of the machine and the error is fed to a PI controller. The controller output is used to set the power reference of the synchronous machine. The rate of change in the angle in a synchronous machine is restricted by the machine inertia and to mimic this nature, the rate of change in the VSCs angles are restricted by a derivative feedback in the droop control. The connected distribution static compensator (DSTATCOM) provides ride through capability during power imbalance in the microgrid, especially when the stored energy of the inertial DG is not sufficient to maintain stability. The inclusion of the DSATCOM in such cases ensures the system stability. The efficacies of the controllers are established through extensive simulation studies using PSCAD.

Type Test Elimination using Typeflow Analysis

Programs written in languages of the Oberon family usually contain runtime tests on the dynamic type of variables. In some cases it may be desirable to reduce the number of such tests. Typeflow analysis is a static method of determining bounds on the types that objects may possess at runtime. We show that this analysis is able to reduce the number of tests in certain plausible circumstances. Furthermore, the same analysis is able to detect certain program errors at compile time, which would normally only be detected at program execution. This paper introduces the concepts of typeflow analysis and details its use in the reduction of runtime overhead in Oberon-2.

Luna Language Report

Luna is an object-oriented language. It does not, as do many other object-oriented languages, have a conventional procedural language as a base. It is strongly typed and modular. The elegance of Luna is that it is entirely reference based, there are no static objects. Luna is similar to Oberon in that inheritance and subtyping is based on type extension.

Dynamics deflection analysis of nanoelectromechanical switches based on carbon nanotubes

This paper aims to develop an effective numerical simulation technique for the dynamic deflection analysis of nanotubes-based nanoswitches. The nanoswitch is simplified to a continuum structure, and some key material parameters are extracted from typical molecular dynamics (MD). An advanced local meshless formulation is applied to obtain the discretized dynamic equations for the numerical solution. The developed numerical technique is firstly validated by the static deflection analyses of nanoswitches, and then, the fundamental dynamic properties of nanoswitches are analyzed. A parametric comparison with the results in the literature and from experiments shows that the developed modelling approach is accurate, efficient and effective.

Modeling corneal surfaces with rational functions for high-speed videokeratoscopy data compression

High-speed videokeratoscopy is an emerging technique that enables study of the corneal surface and tear-film dynamics. Unlike its static predecessor, this new technique results in a very large amount of digital data for which storage needs become significant. We aimed to design a compression technique that would use mathematical functions to parsimoniously fit corneal surface data with a minimum number of coefficients. Since the Zernike polynomial functions that have been traditionally used for modeling corneal surfaces may not necessarily correctly represent given corneal surface data in terms of its optical performance, we introduced the concept of Zernike polynomial-based rational functions. Modeling optimality criteria were employed in terms of both the rms surface error as well as the point spread function cross-correlation. The parameters of approximations were estimated using a nonlinear least-squares procedure based on the Levenberg-Marquardt algorithm. A large number of retrospective videokeratoscopic measurements were used to evaluate the performance of the proposed rational-function-based modeling approach. The results indicate that the rational functions almost always outperform the traditional Zernike polynomial approximations with the same number of coefficients.

Cascading appearance-based features for visual speaker verification

The cascading appearance-based (CAB) feature extraction technique has established itself as the state of the art in extracting dynamic visual speech features for speech recognition. In this paper, we will focus on investigating the effectiveness of this technique for the related speaker verification application. By investigating the speaker verification ability of each stage of the cascade we will demonstrate that the same steps taken to reduce static speaker and environmental information for the speech recognition application also provide similar improvements for speaker recognition. These results suggest that visual speaker recognition can improve considerable when conducted solely through a consideration of the dynamic speech information rather than the static appearance of the speaker's mouth region.