Copper Immobilization on Fe3O4@Agar: An Efficient Superparamagnetic Nanocatalyst for Green Ullmann-Type Cross-Coupling Reaction of Primary and Secondary Amines with Aryl Iodide Derivatives

Journal of Inorganic and Organometallic Polymers and Materials - Immobility of copper on magnetic nanoparticles was performed using surface rectification of Fe3O4 with Agar. The magnetic...     

Unsupervised image-set clustering using an information theoretic framework.

In this paper, we combine discrete and continuous image models with information-theoretic-based criteria for unsupervised hierarchical image-set clustering. The continuous image modeling is based on mixture of Gaussian densities. The unsupervised image-set clustering is based on a generalized version of a recently introduced information-theoretic principle, the information bottleneck principle. Images are clustered such that the mutual information between the clusters and the image content is maximally preserved. Experimental results demonstrate the performance of the proposed framework for image clustering on a large image set. Information theoretic tools are used to evaluate cluster quality. Particular emphasis is placed on the application of the clustering for efficient image search and retrieval.     

Memory organization of action events and its relationship to memory performance.

Previous research yielded inconsistent results regarding the memory organization of self-performed actions. The authors propose that task performance changes the very basis of memory organization. Enactment during study and test (Experiment 1) yielded stronger enactive clustering (based on motor-movement similarities), whereas verbal encoding yielded stronger conceptual clustering (based on semantic-episodic similarities). Enactment enhanced memory quantity and memory accuracy. Both measures increased with enactive clustering under self-performance instructions but with conceptual clustering under verbal instructions. Enactment only during study (Experiment 2) or only during testing (Experiment 3) also enhanced enactive clustering. It is proposed that different conditions affect the relative salience of different types of memory organization and their relative contribution to recall. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Optimizing the Runoff Estimation with HEC-HMS Model Using Spatial Evapotranspiration by the SEBS Model

Most of the commonly used hydrological models do not account for the actual evapotranspiration (ETa) as a key contributor to water loss in semi-arid/arid regions. In this study, the HEC-HMS (Hydrologic Engineering Center Hydrologic Modeling System) model was calibrated, modified, and its performance in simulating runoff resulting from short-duration rainfall events was evaluated. The model modifications included integrating spatially distributed ETa, calculated using the surface energy balance system (SEBS), into the model. Evaluating the model’s performance in simulating runoff showed that the default HEC-HMS model underestimated the runoff with root mean squared error (RMSE) of 0.14 m³/s (R²?=?0.92) while incorporating SEBS ETa into the model reduced RMSE to 0.01 m³/s (R²?=?0.99). The integration of HECHMS and SEBS resulted in smaller and more realistic latent heat flux estimates translated into a lower water loss rate and a higher magnitude of runoff simulated by the HECHMS model. The difference between runoff simulations using the default and modified model translated into an average of 95,000 m³ runoff per rainfall event (equal to seasonal water requirement of ten-hectare winter wheat) that could be planned and triggered for agricultural purposes, flood harvesting, and groundwater recharge in the region. The effect of ETa on the simulated runoff volume is expected to be more pronounced during high evaporative demand periods, longer rainfall events, and larger catchments. The outcome of this study signifies the importance of implementing accurate estimates of evapotranspiration into a hydrological model.

     

Leakage mitigation in NW FET using negative Schottky junction drain and its process variation analysis

Journal of Computational Electronics - In this work, a Schottky junction on the drain side employing low workfunction (WF) metal is proposed as a method to suppress the OFF-state leakage in...     

Parametric study on smoothed particle hydrodynamics for accurate determination of drag coefficient for a circular cylinder

Simulations of two-dimensional (2D) flow past a circular cylinder with the smoothed particle hydrodynamics (SPH) method were conducted in order to accurately determine the drag coefficient. The fluid was modeled as a viscous liquid with weak compressibility. Boundary conditions, such as a no-slip solid wall, inflow and outflow, and periodic boundaries, were employed to resemble the physical problem. A sensitivity analysis, which has been rarely addressed in previous studies, was conducted on several SPH parameters. Hence, the effects of distinct parameters, such as the kernel choices and the domain dimensions, were investigated with the goal of obtaining highly accurate results. A range of Reynolds numbers (1–500) was simulated, and the results were compared with existing experimental data. It was observed that the domain dimensions and the resolution of SPH particles, in comparison to the obstacle size, affected the obtained drag coefficient significantly. Other parameters, such as the background pressure, influenced the transient condition, but did not influence the steady state at which the drag coefficient was determined.     

Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game

This work considers non-terminating scheduling problems in which a system of multiple resources serves clients having variable needs. The system has m identical resources and n clients; in each time slot each resource may serve at most one client; in each such slot t each client γ has a rate, a real number ρ _γ (t), that specifies his needs in this slot. The rates satisfy the restriction ∑ _γ ρ _γ (t)≤m for any slot t. Except of this restriction, the rates can vary in arbitrary fashion. (This contrasts most prior works in this area in which the rates of the clients are constant.) The schedule is required to be smooth as follows: a schedule is Δ -smooth if for all time intervals I the absolute difference between the amount of service received by each client γ to his nominal needs of ∑ _t∈I ρ _γ (t) is less than Δ. Our objective are online schedulers that produce Δ-smooth schedules where Δ is a small constant which is independent of m and n. Our paper constructs such schedulers; these are the first online Δ-smooth schedulers, with a constant Δ, for clients with arbitrarily variable rates in a single or multiple resource system. Furthermore, the paper also considers a non-concurrent environment in which there is an additional restriction that each client is served at most once in each time slot; it presents the first online smooth schedulers for variable rates under this restriction. The above non-concurrent restriction is crucial in some applications (e.g., CPU scheduling). It has been pointed out that this restriction “adds a surprising amount of difficulty” to the scheduling problem. However, this observation was never formalized and, of course, was never proved. Our paper formalizes and proves some aspects of this observation. Another contribution of this paper is the introduction of a complete information, two player game called the analog-digital confinement game. In such a game pebbles are located on the real line; the two players, the analog player and the digital player, take alternating turns and each one, in his turn, moves some of the pebbles; the digital player moves the pebbles backwards by discrete distances while the analog player moves the pebbles forward by analog distances; the aim of the analog player is to cause one pebble (or more) to escape a pre-defined real interval while the aim of the digital player is to confine the pebbles into the interval. We demonstrate that this game is a convenient framework to study the general question of how to approximate an analog process by a digital one. All the above scheduling results are established via this game. In this derivation, the pebbles represent the clients, the analog player generates the needs of the clients and the digital player generates the schedule. Dedicated to the memory of Professor Shimon Even for his inspiration and encouragement     

Controller synthesis with guaranteed closed-loop phase constraints

In this paper, we present an analysis and synthesis approach for guaranteeing that the phase of a single-input, single-output closed-loop transfer function is contained in the interval [−α,α] for a given α>0 at all frequencies. Specifically, we first derive a sufficient condition involving a frequency domain inequality for guaranteeing a given phase constraint. Next, we use the Kalman–Yakubovich–Popov theorem to derive an equivalent time domain condition. In the case where , we show that frequency and time domain sufficient conditions specialize to the positivity theorem. Furthermore, using linear matrix inequalities, we develop a controller synthesis approach for guaranteeing a phase constraint on the closed-loop transfer function. Finally, we extend this synthesis approach to address mixed gain and phase constraints on the closed-loop transfer function.     

He’s homotopy perturbation method: A strongly promising method for solving non-linear systems of the mixed Volterra–Fredholm integral equations

In this paper, He’s homotopy perturbation method is applied to solve non-linear systems of mixed Volterra–Fredholm integral equations. Two examples are presented to illustrate the ability of the method. Also comparisons are made between the Adomian decomposition method and the homotopy perturbation method. The results reveal that He’s homotopy perturbation method is very effective and simple and in these examples leads to the exact solutions.     

Distributed topology control algorithm based on one- and two-hop neighbors’ information for ad hoc networks

In this paper, we present a topology control algorithm for ad hoc networks. By considering the weight of the links, each node orders its one-hop neighbors in an ordered list and then the ordered lists are exchanged between the neighbors. This information enables the nodes to compute their transmission radius on the basis of its one- and two-hop neighbors’ information. We demonstrate that compared to the best known algorithms, the degree and transmission radius of the nodes in the topology produced by the proposed algorithm are smaller. In addition to Euclidean graphs, the algorithm works correctly on general weighted graphs. Also an extension of our algorithm is proposed which adapts its topology to network changes. Finally, we use the four metrics, node degree, transmission radius, the power stretch factor and, packet loss ratio to measure the performance improvements of the presented algorithms through simulations.