Tuning of emission by effect of local symmetry in BaLaLiWO6:Dy3+/Eu3+ for WLEDs

The luminescence center energy transfer, crystal field strength, and covalency are limited by the crystal structure of the host and subsequently affect the luminescence efficiency, color, and intensity. Here, we report an excellent red phosphor BaLaLiWO₆:0.40Eu³⁺ and the dependence between symmetry and luminous performance. A model for changing symmetry is drawn by analyzing the Coulomb potential and structure for the application of a double-perovskite phosphor BLLWO: Dy³⁺, Eu³⁺ in white light LEDs. The addition of Dy³⁺/Eu³⁺ makes the W-O bond formed by the B-site and oxygen ion longer and the Li-O bond shorter, and the difference between the eight octahedral around the A-site is reduced, increasing the symmetry of the A-site. Local symmetry was successfully modulated by changing the Eu³⁺ concentration to control the Y/B ratio of Dy³⁺ and the R/O ratio of Eu³⁺ and smoothly achieved (0.382, 0.373) warm white light color coordinate. The phosphor has excellent thermal stability and still has 92.3% intensity at 475 K. The above results show that the wavelength composition of the luminescence is tunable by changing the symmetry of the environment in which the doped ions are located. It applies to single hosts for the regulation of white light emission.     

Patterns in environmental priorities revealed through government open data portals

The ways in which environmental priorities are framed are varied and influenced by political forces. One technological advance--the proliferation of government open data portals (ODPs)--has the potential to improve governance through facilitating access to data. Yet it is also known that the data hosted on ODPs may simply reflect the goals and interests of multiple levels of political power. In this article, I use traditional statistical correlation and regression techniques along with newer natural language processing and machine learning algorithms to analyze the corpus of datasets hosted on government ODPs (total: 49,066) to extract patterns that relate scales of governance and political liberalism/conservatism to the priorities and meaning attached to environmental issues. I find that state-level and municipal-level ODPs host different categories of environmental datasets, with municipal-level ODPs generally hosting more datasets pertaining to services and amenities and state-level ODPs hosting more datasets pertaining to resource protection and extraction. Stronger trends were observed for the influences of political conservatism/liberalism among state-level ODPs than for municipal-level ODPs.     

Impact of shape representation schemes used in discrete element modelling of particle packing

In different computer models, shape is represented using different methodologies, to varying degrees of precision. This paper examines two approaches to shape representation, and their effects on accuracy in the context of cylindrical particle packing. Two discrete element method (DEM) based software packages are used. A X-ray CT scan of a packed bed provides the experimental measurements for comparison. Eight sphere-composite representations of the same cylindrical pellet were tested. Two of these gave results that quantitatively follow experimental measurements. A range of factors that in theory could affect accuracy of the simulation results are examined, including edge roundedness, surface roughness and restitutional behaviour as a function of sphere-composite representations. The conclusion is that, for packing at least, matching the object's overall shape and dimensions is not enough. Only when a high enough resolution is applied to corners and edges, could the sphere-composite approach possibly match the experimental data quantitatively.     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

Studying local liquid velocity in liquid–solid packed bed using the newly developed X-ray DIR technique

Combination of X-ray Digital Industrial Radiography (DIR) and Particle Tracking Velocimetry (PTV) techniques for local liquid velocity measurement (V_LL) has been newly developed and successfully applied for trickle bed reactor (TBR). The technique was validated against newly developed fiber optical probe technique. This work attempts to highlight the applicability of this newly developed technique on a liquid–solid packed bed reactor. In this work, liquid was represented by water and solids were represented by EPS beads. The EPS beads were chosen because of its low density property. Three superficial liquid velocities (V_SL) were applied to the system. The experiment was replicated four times. The digital industrial radiography (DIR) consists of a complementary metal oxide semiconductor (CMOS) digital detector and X-ray source. Results of this work suggest that the technique has been successfully applied and comparable with previous work that has been done in the literature. It also suggests that there will be a maximum measurable interstitial liquid velocity when it travel inside the packed bed. The measured V_LL can have a maximum range that is between 4 and 4.7 times that of its V_SL. For V_SL=0.42±±2%, the V_LL-Max is in between 1.7 cm/s and 1.9 cm/s, V_SL=0.84±±2%, the V_LL-Max is in between 3.6 cm/s and 4.0 cm/s, and for V_SL=1.11±±2%, the V_LL-Max is in between 4.3 cm/s and 4.8 cm/s.     

Inverted pendulum stabilization: Characterization of codimension-three triple zero bifurcation via multiple delayed proportional gains

The paper considers the problem of stabilization of systems possessing a multiple zero eigenvalue at the origin. The controller that we propose, uses multiple delayed measurements instead of derivative terms. Doing so, we increase the performances of the closed loop in presence of system uncertainties and/or noisy measurements. The problem formulation and the analysis is presented through a classical engineering problem which is the stabilization of an inverted pendulum on a cart moving horizontally. On one hand, we perform a nonlinear analysis of the center dynamics described by a three dimensional system of ordinary differential equations with a codimension-three triple zero bifurcation. On the other hand, we present the complementary stability analysis of the corresponding linear time invariant system with two delays describing the behavior around the equilibrium. The aim of this analysis is to characterize the possible local bifurcations. Finally, the proposed control scheme is numerically illustrated and discussed.     

A call admission and rate control scheme for multimedia support over IEEE 802.11 wireless LANs

Quality of service (QoS) support for multimedia services in the IEEE 802.11 wireless LAN is an important issue for such WLANs to become a viable wireless access to the Internet. In this paper, we endeavor to propose a practical scheme to achieve this goal without changing the channel access mechanism. To this end, a novel call admission and rate control (CARC) scheme is proposed. The key idea of this scheme is to regulate the arriving traffic of the WLAN such that the network can work at an optimal point. We first show that the channel busyness ratio is a good indicator of the network status in the sense that it is easy to obtain and can accurately and timely represent channel utilization. Then we propose two algorithms based on the channel busyness ratio. The call admission control algorithm is used to regulate the admission of real-time or streaming traffic and the rate control algorithm to control the transmission rate of best effort traffic. As a result, the real-time or streaming traffic is supported with statistical QoS guarantees and the best effort traffic can fully utilize the residual channel capacity left by the real-time and streaming traffic. In addition, the rate control algorithm itself provides a solution that could be used above the media access mechanism to approach the maximal theoretical channel utilization. A comprehensive simulation study in ns-2 has verified the performance of our proposed CARC scheme, showing that the original 802.11 DCF protocol can statically support strict QoS requirements, such as those required by voice over IP or streaming video, and at the same time, achieve a high channel utilization. Hongqiang Zhai received the B.E. and M.E. degrees in electrical engineering from Tsinghua University, Beijing, China, in July 1999 and January 2002 respectively. He worked as a research intern in Bell Labs Research China from June 2001 to December 2001, and in Microsoft Research Asia from January 2002 to July 2002. Currently he is pursuing the PhD degree in the Department of Electrical and Computer Engineering, University of Florida. He is a student member of IEEE. Xiang Chen received the B.E. and M.E. degrees in electrical engineering from Shanghai Jiao Tong University, Shanghai, China, in 1997 and 2000, respectively, and the Ph.D. degree in electrical and computer engineering from the University of Florida, Gainesville, in 2005. He is currently a Senior Research Engineer at Motorola Labs, Arlington Heights, IL. His research interests include resource management, medium access control, and quality of service (QoS) in wireless networks. He is a Member of Tau Beta Pi and a student member of IEEE. Yuguang Fang received a Ph.D degree in Systems and Control Engineering from Case Western Reserve University in January 1994, and a Ph.D degree in Electrical Engineering from Boston University in May 1997. From June 1997 to July 1998, he was a Visiting Assistant Professor in Department of Electrical Engineering at the University of Texas at Dallas. From July 1998 to May 2000, he was an Assistant Professor in the Department of Electrical and Computer Engineering at New Jersey Institute of Technology. In May 2000, he joined the Department of Electrical and Computer Engineering at University of Florida where he got the early promotion with tenure in August 2003 and has been an Associate Professor since then. He has published over one hundred (100) papers in refereed professional journals and conferences. He received the National Science Foundation Faculty Early Career Award in 2001 and the Office of Naval Research Young Investigator Award in 2002. He is currently serving as an Editor for many journals including IEEE Transactions on Communications, IEEE Transactions on Wireless Communications, IEEE Transactions on Mobile Computing, and ACM Wireless Networks. He is also actively participating in conference organization such as the Program Vice-Chair for IEEE INFOCOM’2005, Program Co-Chair for the Global Internet and Next Generation Networks Symposium in IEEE Globecom’2004 and the Program Vice Chair for 2000 IEEE Wireless Communications and Networking Conference (WCNC’2000).