Fractional Derivatives Applied to Phase-Space Reconstructions

The concept and application of phase-space reconstructions are reviewed. Fractional derivatives are then proposed for the purpose of reconstructing dynamics from a single observed time history. A procedure is presented in which the fractional derivatives of time series data are obtained in the frequency domain. The method is applied to the Lorenz system. The ability of the method to unfold the data is assessed by the method of global false nearest neighbors. The reconstructed data is used to compute recurrences and correlation dimensions. The reconstruction is compared to the commonly used method of delays in order to assess the choice of reconstruction parameters, and also the quality of results.     

Robust Speed Control of a Low Damped Electromechanical System Based on CRONE Control: Application to a Four Mass Experimental Test Bench

Robust speed control of a low damped electromechanical system with backlash is studied, controlled load angular speed being not measured. The proposed control strategy combines a Luenberger observer (load angular speed and load torque disturbance estimations) and a robust CRONE controller. The observer provides estimation of the load angular speed and of the disturbance torque applied on the load. Through the computation of only three independent parameters (as many as a PID controller), the CRONE controller permits to ensure the robust speed control of the load in spite of plant parametric variations and speed observation errors. The proposed control strategy is applied to a four mass experimental test bench.     

Searching in trees

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

On Weak Solutions of an Integral Equation Driven by a p-Semimartingale of Special Type

We consider the integral equation driven by a standard Brownian motion and by a fractional Brownian motion. Sufficient conditions under which the equation has a weak solution are obtained.     

有机发光器件平板显示及彩色象元实现方案

有机发光器件（OLED）具有固体平板化的优点，用OLED制做平板显示器不仅重量轻和功耗低，而且能实现低成本的彩色大屏幕显示。本文从有机发光器件的原理出发，阐述了有机发光器件平板显示器的三色象元的一些实现方案和目前的发展状况，并对它们的基本结构及技术特点进行了比较。     

专用超大规模集成电路在LED显示系统中的应用

自1976年蒙特利尔奥运会采用了第一块黑白视频显示屏以来，各种大屏幕特别是LED显示屏得到了迅猛发展，在现代信息社会中更是随处可见。在这些显示系统中，应用了大量的不同种类的集成电路作为驱动芯片。本文叙述了运用于LED显示系统中的超大规模集成电路的强大功能。     

Order conditions for linearly implicit fractional step Runge Kutta methods

^{In this paper, we study the consistency of a variant of fractionalstep Runge–Kutta methods. These methods are designed tointegrate efficiently semi-linear multidimensional parabolicproblems by means of linearly implicit time integration processes.Such time discretization procedures are also related to a splittingof the space differential operator (or the spatial discretizationof it) as a sum of ‘simpler’ linear differentialoperators and a nonlinear term.}     

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem

We consider the generalization of the classical P||C_max problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.     

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.