Organic wavelength‐converting‐film‐based hybrid planar white light‐emitting diodes

Abstract— In this study, organic wavelength‐converting films (WCFs) applied to InGaN blue LED‐based hybrid planar WLED has been fabricated. The organic dye layer in the WCF was formed between the upper and bottom polymer sheets by using a simple roll‐laminating technique. Subsequently, the hybrid planar WLEDs have been fabricated based upon these films. The luminous efficiency of green WCF‐based hybrid planar WLEDs with a single blue LED chip was 34.6 lm/W and that of red‐WCF‐assisted green WCF‐based hybrid planar WLEDs was 27.3 lm/W under 20 mA. The use of WCF to fabricate hybrid planar WLEDs showed better stability than that of directly coating organic color‐convergence materials (CCMs) on the LED chips. It only decreased to about 10% of the initial wavelength‐converting intensity after 1 hour of continual operation at 20 mA.     

An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis

Clustering is a popular data analysis and data mining technique. A popular technique for clustering is based on k-means such that the data is partitioned into K clusters. However, the k-means algorithm highly depends on the initial state and converges to local optimum solution. This paper presents a new hybrid evolutionary algorithm to solve nonlinear partitional clustering problem. The proposed hybrid evolutionary algorithm is the combination of FAPSO (fuzzy adaptive particle swarm optimization), ACO (ant colony optimization) and k-means algorithms, called FAPSO-ACO–K, which can find better cluster partition. The performance of the proposed algorithm is evaluated through several benchmark data sets. The simulation results show that the performance of the proposed algorithm is better than other algorithms such as PSO, ACO, simulated annealing (SA), combination of PSO and SA (PSO–SA), combination of ACO and SA (ACO–SA), combination of PSO and ACO (PSO–ACO), genetic algorithm (GA), Tabu search (TS), honey bee mating optimization (HBMO) and k-means for partitional clustering problem.     

A hybrid data-fusion system using modal data and probabilistic neural network for damage detection

This paper addresses a novel hybrid data-fusion system for damage detection by integrating the data fusion technique, probabilistic neural network (PNN) models and measured modal data. The hybrid system proposed consists of three models, i.e. a feature-level fusion model, a decision-level fusion model and a single PNN classifier model without data fusion. Underlying this system is the idea that we can choose any of these models for damage detection under different circumstances, i.e. the feature-level model is preferable to other models when enormous data are made available through multi-sensors, whereas the confidence level for each of multi-sensors must be determined (as a prerequisite) before the adoption of the decision-level model, and lastly, the single model is applicable only when data collected is somehow limited as in the cases when few sensors have been installed or are known to be functioning properly. The hybrid system is suitable for damage detection and identification of a complex structure, especially when a huge volume of measured data, often with uncertainties, are involved, such as the data available from a large-scale structural health monitoring system. The numerical simulations conducted by applying the proposed system to detect both single- and multi-damage patterns of a 7-storey steel frame show that the hybrid data-fusion system cannot only reliably identify damage with different noise levels, but also have excellent anti-noise capability and robustness.     

一种人工鱼算法与捕鱼算法相结合的优化方法

在分析人工鱼群算法和捕鱼算法存在不足的基础上,提出了一种人工鱼群算法(AFSA)与采用捕鱼策略的优化算法(FSOA)相结合的混合算法。该算法在优化初期使用AFSA算法搜索局部最优域,而在优化后期则使用FSOA算法在优化前期所初步确定的局部最优域中搜索最优解。实验计算结果表明,该算法具有优化精度高、收敛速度快的特点。     

Stability analysis and time-varying walking control for an under-actuated planar biped robot

This paper presents two walking controllers for a planar biped robot with unactuated point feet. The control is based on the tracking of reference motions expressed as a function of time. First, the reference motions are adapted at each step in order to create a hybrid zero dynamic (HZD) system. Next, the stability of the walking gait under closed-loop control is evaluated with the linearization of the restricted Poincaré map of the HZD. When the controlled outputs are selected to be the actuated coordinates, most periodic walking gaits for this robot are unstable, that is, the eigenvalues of the linearized Poincaré map (ELPM) is larger than one. Therefore, two control strategies are explored to produce stable walking. The first strategy uses an event-based feedback controller to modify the ELPM and the second one is based on the choice of controlled outputs. The stability analysis show that, for the same robot and for the same reference trajectory, the stability of the walking (or ELPM) can be modified by some pertinent choices of controlled outputs. Moreover, by studying some walking characteristics of many stable cases, a necessary condition for stable walking is proposed. It is that the height of swing foot is nearly zero at the desired moment of impact. Based on this condition, the duration of the step is almost constant in presence of initial error, so a method for choosing controlled outputs for the second controller is given. By using this method, two stable domains for the controlled outputs selection are obtained.     

From embedded sensors to sensorial materials—The road to function scale integration

Ubiquitous computing is about to become part of our everyday lives by integrating hundreds of “invisible” to us computing devices in our environment, so that they can unobtrusively and constantly assist us. This will imply more and smaller “invisible” sensors, homogeneously distributed and at the same time densely packed in host materials, responding to various stimuli and immediately delivering information. In order to reach this aim, the embedded sensors should be integrated within the host material, heading towards sensorial materials. The first step is to omit all parts that are not needed for the sensorial task and to find new solutions for a gentle integration. This is what we call function scale integration. The paper discusses sensor embedding in the human hand as an example of integration in nature, new technological applications and main challenges associated with this approach.     

Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints

One of the common assumptions in the field of scheduling is that machines are always available in the planning horizon. This may not be true in realistic problems since machines might be busy processing some jobs left from previous production horizon, breakdowns or preventive maintenance activities. Another common assumption is the consideration of setup times as a part of processing times, while in some industries, such as printed circuit board and automobile manufacturing, not only setups are an important factor but also setup magnitude of a job depends on its immediately preceding job on the same machine, known as sequence-dependent setup times. In this paper, we consider hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints caused by preventive maintenance. The optimization criterion is the minimization of makespan. Since this problem is NP-hard in the strong sense, we propose three heuristics, based on SPT, LPT and Johnson rule and two metaheuristics based on genetic algorithm and simulated annealing. Computational experiments are performed to evaluate the efficiencies of the algorithms.     

A novel hybrid immune algorithm for global optimization in design and manufacturing

This paper presents a new hybrid optimization approach based on immune algorithm and hill climbing local search algorithm. The purpose of the present research is to develop a new optimization approach for solving design and manufacturing optimization problems. This research is the first application of immune algorithm to the optimization of machining parameters in the literature. In order to evaluate the proposed optimization approach, single objective test problem, multi-objective I-beam and machine-tool optimization problems taken from the literature are solved. Finally, the hybrid approach is applied to a case study for milling operations to show its effectiveness in machining operations. The results of the hybrid approach for the case study are compared with those of genetic algorithm, the feasible direction method and handbook recommendation.     

Genetic algorithm-based heuristics for an open shop scheduling problem with setup,processing, and removal times separated

This report proposes a solution to the open shop scheduling problem with the objective of minimizing total job tardiness in the system. Some practical processing restrictions, such as independent setup and dependent removal times, are taken into account as well. The addressed problem is first described as a 0–1 integer programming model, and is then solved optimally. Subsequently, some hybrid genetic-based heuristics are proposed to solve the problem in an acceptable computation time. To demonstrate the adaptability of these heuristics, some performance comparisons are made with solutions provided by running either a mathematical programming model or certain classic meta-heuristics such as genetic algorithm, simulated annealing, and tabu search in various manufacturing scenarios. The experimental results show that the hybrid genetic-based heuristics perform well, especially the DGA. However, these heuristics require some more additional computations but are still acceptable.     

A comparative runtime analysis of heuristic algorithms for satisfiability problems

The satisfiability problem is a basic core NP-complete problem. In recent years, a lot of heuristic algorithms have been developed to solve this problem, and many experiments have evaluated and compared the performance of different heuristic algorithms. However, rigorous theoretical analysis and comparison are rare. This paper analyzes and compares the expected runtime of three basic heuristic algorithms: RandomWalk, (1+1) EA, and hybrid algorithm. The runtime analysis of these heuristic algorithms on two 2-SAT instances shows that the expected runtime of these heuristic algorithms can be exponential time or polynomial time. Furthermore, these heuristic algorithms have their own advantages and disadvantages in solving different SAT instances. It also demonstrates that the expected runtime upper bound of RandomWalk on arbitrary k-SAT (k?3) is O(n(k−1)), and presents a k-SAT instance that has Θ(n(k−1)) expected runtime bound.