RF MEMS continuous reversible variable inductor based on a microfluidic network

In this work, RF MEMS continuous reversible variable inductor has been fabricated by using microelectronic technology and lamination process. We review, evaluate and compare this variable inductor with other work. The proposed inductor is a dual circular coil and has an inductance of few nH. The fundamental idea is to place a liquid droplet between the metal turns of a coil in order to modify the capacitive/resistive coupling between metal tracks and hence to change the stored magnetic energy. The SU-8 resin was used to realize the microfluidic channels and Au as metallic tracks. To prove the reversibility of the inductor, two cases were studied: filling and emptying of channels. The tuning range of the inductance is approximately 107 % at 1.6 GHz, making these devices very suitable as building blocks in many RF applications.     

Determination of water activities and osmotic and activity coefficients of the system NaCl–BaCl2–H2O at 298.15 K

The water activities of the mixed aqueous electrolyte NaCl–BaCl₂(aq) are measured at total molalities from 0.25 mol kg⁻¹ to about saturation for different ionic strength fractions (y) of NaCl with y=0.33,0.50,0.67. The results allow the deduction of osmotic coefficients. The experimental results are compared with the predictions of the Zdanovskii, Stokes, and Robinson (ZSR), Kusik and Meissner (KM), Robinson and Stokes (RS), Lietzke and Stoughton (LSII), Reilly, Wood, and Robinson (RWR), and Pitzer models. From these measurements, the Pitzer mixing ionic parameters are determined and used to predict the solute activity coefficients in the mixture. The excess Gibbs energy is also determined.     

Efficient and dynamic scaling of fog nodes for IoT devices

It is predicted by the year 2020, more than 50 billion devices will be connected to the Internet. Traditionally, cloud computing has been used as the preferred platform for aggregating, processing, and analyzing IoT traffic. However, the cloud may not be the preferred platform for IoT devices in terms of responsiveness and immediate processing and analysis of IoT data and requests. For this reason, fog or edge computing has emerged to overcome such problems, whereby fog nodes are placed in close proximity to IoT devices. Fog nodes are primarily responsible of the local aggregation, processing, and analysis of IoT workload, thereby resulting in significant notable performance and responsiveness. One of the open issues and challenges in the area of fog computing is efficient scalability in which a minimal number of fog nodes are allocated based on the IoT workload and such that the SLA and QoS parameters are satisfied. To address this problem, we present a queuing mathematical and analytical model to study and analyze the performance of fog computing system. Our mathematical model determines under any offered IoT workload the number of fog nodes needed so that the QoS parameters are satisfied. From the model, we derived formulas for key performance metrics which include system response time, system loss rate, system throughput, CPU utilization, and the mean number of messages request. Our analytical model is cross-validated using discrete event simulator simulations.     

A pure geometric theory of gravity and a material distribution

A field theory is constructed in the context of parameterized absolute parallelism geometry. The theory is shown to be a pure gravity one. It is capable of describing the gravitational field and a material distribution in terms of the geometric structure of the geometry used (the parallelization vector fields). Three tools are used to attribute physical properties to the geometric objects admitted by the theory. Poisson and Laplace equations are obtained in the linearized version of the theory. The spherically symmetric solution of the theory, in free space, is found to coincide with the Schwarzschild exterior solution of general relativity. The theory respects the weak equivalence principle in free space only. Gravity and the material distribution are not minimally coupled.     

Disassembly Sequencing Using Tabu Search

End-of-life disassembly has developed into a major research area within the sustainability paradigm, resulting in the emergence of several algorithms and structures proposing heuristics techniques such as Genetic Algorithm (GA), Ant Colony Optimization (ACO) and Neural Networks (NN). The performance of the proposed methodologies heavily depends on the accuracy and the flexibility of the algorithms to accommodate several factors such as preserving the precedence relationships during disassembly while obtaining near- optimal and optimal solutions. This paper improves a previously proposed Genetic Algorithm model for disassembly sequencing by utilizing a faster metaheuristic algorithm, Tabu search, to obtain the optimal solution. The objectives of the proposed algorithm are to minimize (1) the traveled distance by the robotic arm, (2) the number of disassembly method changes, and (3) the number of robotic arm travels by combining the identical-material components together and hence eliminating unnecessary disassembly operations. In addition to improving the quality of optimum sequence generation, a comprehensive statistical analysis comparing the previous Genetic Algorithm and the proposed Tabu Search Algorithm is also included     

Adaptive sorting: an information theoretic perspective

We present two algorithms that are near optimal with respect to the number of inversions present in the input. One of the algorithms is a variation of insertion sort, and the other is a variation of merge sort. The number of comparisons performed by our algorithms, on an input sequence of length n that has I inversions, is at most . Moreover, both algorithms have implementations that run in time . All previously published algorithms require at least comparisons for some c > 1. M. L. Fredman was supported in part by NSF grant CCR-9732689.     

Two-tier relaxed heaps

We introduce a data structure which provides efficient heap operations with respect to the number of element comparisons performed. Let n denote the size of the heap being manipulated. Our data structure guarantees the worst-case cost of O(1) for finding the minimum, inserting an element, extracting an (unspecified) element, and replacing an element with a smaller element; and the worst-case cost of O(lg n) with at most lg n + 3 lg lg n + O(1) element comparisons for deleting an element. We thereby improve the comparison complexity of heap operations known for run-relaxed heaps and other worst-case efficient heaps. Furthermore, our data structure supports melding of two heaps of size m and n at the worst-case cost of O(min {lg m, lg n}). A preliminary version of this paper [8] was presented at the 17th International Symposium on Algorithms and Computation held in Kolkata in December 2006. Partially supported by the Danish Natural Science Research Council under contracts 21-02-0501 (project Practical data structures and algorithms) and 272-05-0272 (project Generic programming—algorithms and tools).     

Managing the five tensions of IT-enabled decision support in turbulent and high-velocity environments

This chapter examines issues concerned with supporting managers and organizations with information and communication technologies as they decide and act in turbulent and high-velocity environments. In particular, the chapter identifies five key tensions in this context: (1) the tension between the need for quick decisions and the need for analytical decision processes; (2) the tension involving managerial need for action and the need for the safest execution of decisions that may be bold and risky; (3) the tension around empowering middle managers and management teams at various organizational levels in the midst of powerful and impatient top executives; (4) the tension between programmed, quick-action learning loops and the increased requirement for emergence and improvisation; and (5) the tension between expending effort to eliminate the digital divide with other organizations versus finding expedient ways to communicate through heterogeneous digital infrastructures. Each of the tensions, and how it can be managed, is illustrated through a case example. The chapter ends by suggesting that the management of these critical tensions needs to be fused into the day-to-day fabric of management practices for decision support processes. This article is part of the “Handbook on Decision Support Systems” edited by Frada Burstein and Clyde W. Holsapple (2008) Springer.