On regional nonlinear H-filtering

The structure of the nonlinear H^∞-filter in the neighborhood of the estimated trajectory is investigated and a bound on the size of the neighborhood that allows this structure is determined, both for finite and infinite horizons. Riccati inequalities that depend on the estimated trajectory are derived for finding the filter gain matrix and an algorithm for calculating the bound on the size of the above neighborhood is presented. Explicit formulas are obtained in the infinite horizon case for the minimum achievable disturbance attenuation level, the size of the neighborhood, and the corresponding filter gain.     

Alternative measures of pesticide use

tRNA (m5U54)-methyltransferase (RUMT) catalyzes the S-adenosylmethionine-dependent methylation of uridine-54 in the T psi C-loop of all transfer RNAs in E. coli to form the 54-ribosylthymine residue. However, in all tRNA structures, residue 54 is completely buried and the question arises as to how RUMT gains access to the methylation site. A 17-mer RNA hairpin consisting of nucleotides 49-65 of the T psi-loop is a substrate for RUMT. Homonuclear NMR methods in conjunction with restrained molecular dynamics (MD) methods were used to determine the solution structure of the 17-mer T-arm fragment. The loop of the hairpin exhibits enhanced flexibility which renders the conventional NMR average structure less useful compared to the more commonly found situation where a molecule exists in predominantly one major conformation. However, when resorting to softer refinement methods such as MD with time-averaged restraints, the conflicting restraints in the loop can be satisfied much better. The dynamic structure of the T-arm is represented as an ensemble of 10 time-clusters. In all of these, U54 is completely exposed. The flexibility of the T psi-loop in solution in conjunction with extensive binding studies of RUMT with the T psi C-loop and tRNA suggest that the specificity of the RUMT/ tRNA recognition is associated with tRNA tertiary structure elements. For the methylation, RUMT would simply have to break the tertiary interactions between the D- and T-loops, leading to a melting of the T-arm structure and making U54 available for methylation.     

Crude-oil price volatility and agricultural employment in the USA

This study begins by asking whether fluctuations in the price of crude oil have affected agricultural employment in the USA. After reviewing previous assessments of the issue, the existence of an empirical relationship between agricultural employment and crude-oil price volatility is established using Granger causality. Subsequently, the nature of the relationship is estimated with the results suggesting that at least three full years are required before the measurable impacts of a percentage change in the real price of crude oil on the change in agricultural employment are exhausted. Finally, the structural stability of the functional relationship between the change in agricultural employment and the volatility of the price of crude oil, the percentage changes in expected net farm income, realized technological innovation, and the wage rate are examined.     

Multicriteria Global Minimum Cuts

We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs associated with it. These costs are measured in separate, non-interchangeable, units. In the AND-version of the problem, purchasing an edge requires the payment of all the k costs associated with it. In the OR-version, an edge can be purchased by paying any one of the k costs associated with it. Given k bounds b₁,b₂,. . . ,b_k, the basic multicriteria decision problem is whether there exists a cut C of the graph that can be purchased using a budget of b_i units of the ith criterion, for 1 ≤ i ≤ k. We show that the AND-version of the multicriteria global minimum cut problem is polynomial for any fixed number k of criteria. The OR-version of the problem, on the other hand, is NP-hard even for k = 2, but can be solved in pseudo-polynomial time for any fixed number k of criteria. It also admits an FPTAS. Further extensions, some applications, and multicriteria versions of two other optimization problems are also discussed.     

Intrusion detection for mobile devices using the knowledge-based, temporal abstraction method

In this paper, a new approach for detecting previously unencountered malware targeting mobile device is proposed. In the proposed approach, time-stamped security data is continuously monitored within the target mobile device (i.e., smartphones, PDAs) and then processed by the knowledge-based temporal abstraction (KBTA) methodology. Using KBTA, continuously measured data (e.g., the number of sent SMSs) and events (e.g., software installation) are integrated with a mobile device security domain knowledge-base (i.e., an ontology for abstracting meaningful patterns from raw, time-oriented security data), to create higher level, time-oriented concepts and patterns, also known as temporal abstractions. Automatically-generated temporal abstractions are then monitored to detect suspicious temporal patterns and to issue an alert. These patterns are compatible with a set of predefined classes of malware as defined by a security expert (or the owner) employing a set of time and value constraints. The goal is to identify malicious behavior that other defensive technologies (e.g., antivirus or firewall) failed to detect. Since the abstraction derivation process is complex, the KBTA method was adapted for mobile devices that are limited in resources (i.e., CPU, memory, battery). To evaluate the proposed modified KBTA method a lightweight host-based intrusion detection system (HIDS), combined with central management capabilities for Android-based mobile phones, was developed. Evaluation results demonstrated the effectiveness of the new approach in detecting malicious applications on mobile devices (detection rate above 94% in most scenarios) and the feasibility of running such a system on mobile devices (CPU consumption was 3% on average).     

A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths

We present an -time algorithm for the All Pairs Shortest Paths (APSP) problem for directed graphs with real edge lengths. This slightly improves previous algorithms for the problem obtained by Fredman, Dobosiewicz, Han, and Takaoka.     

Shallow circuits and concise formulae for multiple addition and multiplication

A theory is developed for the construction of carry-save networks with minimal delay, using a given collection of carry-save adders each of which may receive inputs and produce outputs using several different representation standards.The construction of some new carry-save adders is described. Using these carry-save adders optimally, as prescribed by the above theory, we get {, , }-circuits of depth 3.48 log₂ n and {, , }-circuits of depth 4.95 log₂ n for the carry-save addition ofn numbers of arbitrary length. As a consequence we get multiplication circuits of the same depth. These circuits put out two numbers whose sum is the result of the multiplication. If a single output number is required then the depth of the multiplication circuits increases respectively to 4.48 log₂ n and 5.95 log₂ n.We also get {, , }-formulae of sizeO (n ^3.13) and {, }-formulae of sizeO (n ^4.57) for all the output bits of a carry-save addition ofn numbers. As a consequence we get formulae of the same size for the majority function and many other symmetric Boolean functions.     

Some prospective applications of silicon electrodeposition from molten fluorides to solar cell fabrication

Electrodeposition of both epitaxial and polycrystalline continuous films of dense, coherent, and well-adherent silicon coatings was achieved from molten fluorides. A dissolving Si anode and an operating temperature of about 750 C were utilized. Silicon electrocrystallization epitaxy (ECE) produced films with the (111) orientation on Si substrates of the same orientation. The unintentionally doped films were of p-type character with a resistivity in the range 0.05 - 0.10 Ω-cm. Polycrystalline Si films were similarly electroplated onto various polycrystalline metal substrates. Uniform coherent, and well-adherent coatings with grain diameters as large as 40 – 50 μm were obtained. The useful rate of electrodeposition of Si could be significantly increased by the application of an alternating square wave pulse (ASWP)₂technique. Cathodic current pulses as high as 300 mA/cm² (growth rate of about 5 μm/min) were demonstrated. The cathodic current efficiencies, for all modes of growth, were about 70 – 100%. The effects of the various operating parameters, and some prospective applications to the fabrication of solar cells, are discussed. This was paper A-6 in the 18th Annual Electronic Materials Conference, Salt Lake City, June 23–25, 1976.     

Market power and the deregulation of special access service by the Federal Communications Commission

In 1999, the Federal Communications Commission adopted an order granting complete deregulation of the rates for special access service for specific metropolitan statistical areas based on an objective showing that there was potential competition in that market. This was done in an environment where the local exchange carriers (LECs) subject to price caps were earning a rate of return in excess of 22% with the rate of return on an upward trend. By 2002, the average rate of return across all price cap LECs topped 35%. The questions investigated in this article are whether the price cap LECs have market power in supplying special access service and whether they have taken advantage of this. The data clearly show that this is the case. Given the prevailing situation, there is a clear need to revisit the pricing flexibility order. First, the product market for special access service needs to be more carefully examined and, second, the metrics used to define the potential for competition need to be revamped.     

Spider Silk-CBD-Cellulose Nanocrystal Composites: Mechanism of Assembly

The fabrication of cellulose-spider silk bio-nanocomposites comprised of cellulose nanocrystals (CNCs) and recombinant spider silk protein fused to a cellulose binding domain (CBD) is described. Silk-CBD successfully binds cellulose, and unlike recombinant silk alone, silk-CBD self-assembles into microfibrils even in the absence of CNCs. Silk-CBD-CNC composite sponges and films show changes in internal structure and CNC alignment related to the addition of silk-CBD. The silk-CBD sponges exhibit improved thermal and structural characteristics in comparison to control recombinant spider silk sponges. The glass transition temperature (Tg) of the silk-CBD sponge was higher than the control silk sponge and similar to native dragline spider silk fibers. Gel filtration analysis, dynamic light scattering (DLS), small angle X-ray scattering (SAXS) and cryo-transmission electron microscopy (TEM) indicated that silk-CBD, but not the recombinant silk control, formed a nematic liquid crystalline phase similar to that observed in native spider silk during the silk spinning process. Silk-CBD microfibrils spontaneously formed in solution upon ultrasonication. We suggest a model for silk-CBD assembly that implicates CBD in the central role of driving the dimerization of spider silk monomers, a process essential to the molecular assembly of spider-silk nanofibers and silk-CNC composites.