Last changes in Poland have made that in the hi-tech industry the main role started to play the small-specialized enterprises, leaded by the people who has a good contacts in Universities. They are interested in the sophisticated technology and want to cooperate with the University. The mechatronic product - the family of computer controlled infusion pumps are the important part of the intensive care room equipment in every hospital. The designed family of pumps gives the possibility to program infusion rate in most frequently used units, allows to record in memory own dosing procedures, could automatically load and recognize the syringe etc. They are nearly the top product similar to the ones offered by the best manufactures as B. Brown, or Fresenius.
These two aspects: characteristic of the pumps family and the technology transfer are the main foals of the paper. and Obsahuje seznam literatury
This paper deals with the global position control problem of robot manipulators in joint space, a new family of control schemes consisting of a suitable combination of hyperbolic functions is presented. The proposed control family includes a large class of bounded hyperbolic-type control schemes to drive both position error and derivative action terms plus gravity compensation. To ensure global asymptotic stability of closed-loop system equilibrium point, we propose an energy-shaping based strict Lyapunov function. To verify the efficiency of the proposed control algorithm, an experimental comparative analysis between the well known unbounded linear PD control and three hyperbolic-type control schemes of the proposed family on a three degrees of freedom direct-drive robot manipulator is analysed.
We investigate the category $\text{mod}\Lambda $ of finite length modules over the ring $\Lambda =A\otimes _k\Sigma $, where $\Sigma $ is a V-ring, i.e. a ring for which every simple module is injective, $k$ a subfield of its centre and $A$ an elementary $k$-algebra. Each simple module $E_j$ gives rise to a quasiprogenerator $P_j=A\otimes E_j$. By a result of K. Fuller, $P_j$ induces a category equivalence from which we deduce that $\text{mod}\Lambda \simeq \coprod _jbad hbox P_j$. As a consequence we can (1) construct for each elementary $k$-algebra $A$ over a finite field $k$ a nonartinian noetherian ring $\Lambda $ such that $\text{mod}A\simeq \text{mod}\Lambda $, (2) find twisted versions $\Lambda $ of algebras of wild representation type such that $\Lambda $ itself is of finite or tame representation type (in mod), (3) describe for certain rings $\Lambda $ the minimal almost split morphisms in $\text{mod} \Lambda $ and observe that almost all of these maps are not almost split in $\text{Mod}\Lambda $.
In this paper, we demonstrate the computational consequences of making a simple assumption on production cost structures in capacitated lot-size problems. Our results indicate that our cost assumption of increased productivity over time has dramatic effects on the problem sizes which are solvable. Our experiments indicate that problems with more than 1000 products in more than 1000 time periods may be solved within reasonable time. The Lagrangian decomposition algorithm we use does of course not guarantee optimality, but our results indicate surprisingly narrow gaps for such large-scale cases - in most cases significantly outperforming CPLEX. We also demonstrate that general CLSP's can benefit greatly from applying our proposed heuristic.
The paper presents a simple method to check a positiveness of symmetric multivariate polynomials on the unit multi-circle. The method is based on the sampling polynomials using the fast Fourier transform. The algorithm is described and its possible applications are proposed. One of the aims of the paper is to show that presented algorithm is significantly faster than commonly used method based on the semi-definite programming expression.