Macromolecular anchoring layers for polymer grafting: comparative study

Comparative study of efficiency of macromolecular anchoring layers in the grafting of end-functionalized polymers to a surface was conducted. Poly(glycidyl methacrylate) (PGMA) and epoxydized polybutadienes (EPB) were utilized as the primary anchoring films. Amount of the epoxy moieties introduced to the surface was varied via thickness of the modifying polymer layer or amount of epoxy groups in the polymer backbone. Comparison between the grafting of polystyrene and poly(ethylene glycol) to the various macromolecular anchoring layers indicated that grafting ability of a layer was mostly governed by thickness of the interpenetration zone between the two polymers (anchoring and being grafted). In case of low level of the interpenetration, only functional groups at the periphery of the primary polymer layer were available for the grafting. Then, amount of grafted polymer did not increase with total number of epoxy groups in the anchoring film. However, as the thickness of the interpenetration zone increased, higher amount of the functional groups become available for the grafting.     

Conformational transitions in poly(butyl methacrylate)

Summary Temperature dependence of viscosity data was investigated on poly(butyl methacrylate) fractions in dilute solution. A discontinuity in intrinsic viscosity was observed in the 25°C–35°C temperature range. Sharp changes of unperturbed dimensions were visualized from this behaviour. The phenomenon can be accounted for by assuming conformational changes of the chain in different solvents.     

Cooling rate effects on the structure and transformation behavior of Cu-Zn-Al shape memory alloys

Different fragments of a hot-rolled and homogenized Cu–Zn–Al shape memory alloy（SMA） were subjected to thermal cycling by means of a differential scanning calorimetric（DSC） device. During thermal cycling, heating was performed at the same constant rate of increasing temperature while cooling was carried out at different rates of decreasing temperature. For each cooling rate, the temperature decreased in the same thermal interval. During each cooling stage, an exothermic peak（maximum） was observed on the DSC thermogram. This peak was associated with forward martensitic transformation. The DSC thermograms were analyzed with PROTEUS software： the critical martensitic transformation start（Ms） and finish（Mf） temperatures were determined by means of integral and tangent methods, and the dissipated heat was evaluated by the area between the corresponding maximum plot and a sigmoid baseline. The effects of the increase in cooling rate, assessed from a calorimetric viewpoint, consisted in the augmentation of the exothermic peak and the delay of direct martensitic transformation. The latter had the tendency to move to lower critical transformation temperatures. The martensite plates changed in morphology by becoming more oriented and by an augmenting in surface relief, which corresponded with the increase in cooling rate as observed by scanning electron microscopy（SEM） and atomic force microscopy（AFM）.     

Statistical shape modelling for expression-invariant face analysis and recognition

Paper introduces a 3-D shape representation scheme for automatic face analysis and identification, and demonstrates its invariance to facial expression. The core of this scheme lies on the combination of statistical shape modelling and non-rigid deformation matching. While the former matches 3-D faces with facial expression, the latter provides a low-dimensional feature vector that controls the deformation of model for matching the shape of new input, thereby enabling robust identification of 3-D faces. The proposed scheme is also able to handle the pose variation without large part of missing data. To assist the establishment of dense point correspondences, a modified free-form-deformation based on B-spline warping is applied with the help of extracted landmarks. The hybrid iterative closest point method is introduced for matching the models and new data. The feasibility and effectiveness of the proposed method was investigated using standard publicly available Gavab and BU-3DFE datasets, which contain faces with expression and pose changes. The performance of the system was compared with that of nine benchmark approaches. The experimental results demonstrate that the proposed scheme provides a competitive solution for face recognition.     

Studies on a New Concept of 3D Data Integration about Reaches and Forces of a Disabled Person on a Wheelchair (CAD Methods in Car and Market Ergonomics)

The article presents a new concept of combining the three dimensions (3D) of a person's manipulation space. The data concern information about the reach of the arms and biomechanical data about limiting the load of a disabled person sitting in a wheelchair. Measurement data were acquired empirically, on original measuring station. The data included, respectively, arms' reach (static and dynamic) or, alternatively, measurements of limiting forces. The obtained data were processed into virtual 3D surfaces of arms' reach and forces. These surfaces provide the required graphic model of anthropotechnical and biomechanical data. Developed model was utilized to perform a virtual analysis of the accessibility of a disabled person to technical means: in a market sale space and in the ergonomic analysis into the space of a personal car. The presented method of 3D graphic modeling of anthropometrical and biomechanical data can be universally applied in ergonomic designing of work stations not only for disabled persons. © 2011 Wiley Periodicals, Inc.     

A fuzzy evolutionary framework for combining ensembles

We propose an evolutionary framework for the production of fuzzy rule bases where each rule executes an ensemble of predictors. The architecture, the rule base and the composition of the ensembles are evolved over time. To achieve this, we employ a context-free grammar within a hybrid genetic programming system using a multi-population model. As base predictors, multilayer perceptron neural networks and support vector machines are available. We apply the system to several function approximation and regression tasks and compare the results with recent research and state-of-the-art models. We conclude that the proposed architecture is competitive and has a number of very desirable features supporting automation of predictive model building and their adaptation over time. Finally, we suggest further potential research directions.     

Functional polysiloxanes

Summary Carboxyester- and carboxyamido-terminated polydimethylsiloxanes were obtained through the reaction of cyclic anhydrides (succinic, maleic and phthalic anhydride) with hydroxypropyl- and aminoalkyl-terminated polydimethylsiloxanes, respectively. The reactivity of the starting compounds and the influence of the reaction conditions on the characteristics of the final products are discussed.Part 1: Eur. Polym. J., in press     

The Character of Melting for Simple Molecules Deposited on Graphite

The microscopic character of melting for quasi–two dimensional N ₂ adlayers on graphite is examined for surface densities 0.2 1, where the upper limit corresponds to a complete monolayer. A Monte Carlo method, with the multiple histogram procedure, is employed to determine various thermodynamic quantities. Using the calculated specific heats and selected order parameters, determined at various surface densities, the mechanism for melting is shown to be vacancy mediated. The somewhat unusual behavior of the melting temperature versus density is shown to be entirely due to the vacancy concentration and their topology. Because this is determined by the free energy, our analysis should be general. Preliminary results for Xe on graphite supports this claim.     

Time Windows Based Dynamic Routing in Multi-AGV Systems

This paper presents a dynamic routing method for supervisory control of multiple automated guided vehicles (AGVs) that are traveling within a layout of a given warehouse. In dynamic routing a calculated path particularly depends on the number of currently active AGVs' missions and their priorities. In order to solve the shortest path problem dynamically, the proposed routing method uses time windows in a vector form. For each mission requested by the supervisor, predefined candidate paths are checked if they are feasible. The feasibility of a particular path is evaluated by insertion of appropriate time windows and by performing the windows overlapping tests. The use of time windows makes the algorithm apt for other scheduling and routing problems. Presented simulation results demonstrate efficiency of the proposed dynamic routing. The proposed method has been successfully implemented in the industrial environment in a form of a multiple AGV control system.     

Maximum throughput of multiple access channels in adversarial environments

We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is constrained by the injection rate and the number of packets that may be injected simultaneously; the latter we call burstiness. A protocol is stable when the number of packets in queues at the stations stays bounded. The maximum injection rate that a protocol can handle in a stable manner is called the throughput of the protocol. We consider adversaries of injection rate 1, that is, of one packet per round, to address the question if the maximum throughput 1 can be achieved, and if so then with what quality of service. We develop a protocol that achieves throughput 1 for any number of stations against leaky-bucket adversaries. The protocol has O(n²+\textburstiness){\mathcal{O}(n^2+\text{burstiness})} packets queued simultaneously at any time, where n is the number of stations; this upper bound is proved to be best possible. A protocol is called fair when each packet is eventually broadcast. We show that no protocol can be both stable and fair for a system of at least two stations against leaky-bucket adversaries. We study in detail small systems of exactly two and three stations against window adversaries to exhibit differences in quality of broadcast among classes of protocols. A protocol is said to have fair latency if the waiting time of packets is O(\textburstiness){\mathcal{O}(\text{burstiness})}. For two stations, we show that fair latency can be achieved by a full sensing protocol, while there is no stable acknowledgment based protocol. For three stations, we show that fair latency can be achieved by a general protocol, while no full sensing protocol can be stable. Finally, we show that protocols that either are fair or do not have the queue sizes affect the order of transmissions cannot be stable in systems of at least four stations against window adversaries.