An experimental investigation on the nature of reverse current of silicon power pn-junctions

At this time, little importance is given to the surface component of reverse leakage current of silicon pn-junctions although reliability issues reveal device blocking weakness when performing at high voltage and temperature. Junctions which have almost the same perimeter but different area have been realized and their reverse current has been measured at room temperature and high temperature both for standard recovery and fast recovery (gold-doped or electron irradiated) pn-junctions. It is shown that for standard recovery junctions the surface component of the reverse current is the primary component from room temperature up to above 150/spl deg/C and has influence on reaching high permissible working voltages. For gold-doped or electron irradiated junctions, the bulk component is dominant at high junction temperature, but it is shown that a comparatively negligible surface component can impose lower reverse working voltages or lower junction operation temperature. The surface component may be a cause of limitation on the operation of power silicon diodes at high reverse voltage above 175-200/spl deg/C junction temperature.     

Turbulent Details Simulation for SPH Fluids via Vorticity Refinement

A major issue in smoothed particle hydrodynamics (SPH) approaches is the numerical dissipation during the projection process, especially under coarse discretizations. High‐frequency details, such as turbulence and vortices, are smoothed out, leading to unrealistic results. To address this issue, we introduce a vorticity refinement (VR) solver for SPH fluids with negligible computational overhead. In this method, the numerical dissipation of the vorticity field is recovered by the difference between the theoretical and the actual vorticity, so as to enhance turbulence details. Instead of solving the Biot‐Savart integrals, a stream function, which is easier and more efficient to solve, is used to relate the vorticity field to the velocity field. We obtain turbulence effects of different intensity levels by changing an adjustable parameter. Since the vorticity field is enhanced according to the curl field, our method can not only amplify existing vortices, but also capture additional turbulence. Our VR solver is straightforward to implement and can be easily integrated into existing SPH methods.     

A new approach to predict ulcerative colitis activity through standard clinical–biological parameters using a robust neural network model

Neural Computing and Applications - Colonoscopy is the “gold” standard for evaluating disease activity in ulcerative colitis (UC). An important area of research is finding a...     

Novel (Phenothiazinyl)Vinyl-Pyridinium Dyes and Their Potential Applications as Cellular Staining Agents

We report here the synthesis and structural characterization of novel cationic (phenothiazinyl)vinyl-pyridinium (PVP) dyes, together with optical (absorption/emission) properties and their potential applicability as fluorescent labels. Convective heating, ultrasound irradiation and mechanochemical synthesis were considered as alternative synthetic methodologies proficient for overcoming drawbacks such as long reaction time, nonsatisfactory yields or solvent requirements in the synthesis of novel dye (E)-1-(3-chloropropyl)-4-(2-(10-methyl-10H-phenothiazin-3-yl)vinyl)pyridin-1-ium bromide 3d and its N-alkyl-2-methylpyridinium precursor 1c. The trans geometry of the newly synthesized (E)-4-(2-(7-bromo-10-ethyl-10H-phenothiazin-3-yl)vinyl)-1-methylpyridin-1-ium iodide 3b and (E)-1-methyl-4-(2-(10-methyl-10H-phenothiazin-3-yl)vinyl)pyridin-1-ium tetrafluoroborate 3a′ was confirmed by single crystal X-ray diffraction. A negative solvatochromism of the dyes in polar solvents was highlighted by UV-Vis spectroscopy and explanatory insights were supported by molecular modeling which suggested a better stabilization of the lowest unoccupied molecular orbitals (LUMO). The photostability of the dye 3b was investigated by irradiation at 365 nm in different solvents, while the steady-state and time-resolved fluorescence properties of dye 3b and 3a′ in solid state were evaluated under one-photon excitation at 485 nm. The in vitro cytotoxicity of the new PVP dyes on B16-F10 melanoma cells was evaluated by WST-1 assay, while their intracellular localization was assessed by epi-fluorescence conventional microscopy imaging as well as one- and two-photon excited confocal fluorescence lifetime imaging microscopy (FLIM). PVP dyes displayed low cytotoxicity, good internalization inside melanoma cells and intense fluorescence emission inside the B16-F10 murine melanoma cells, making them suitable staining agents for imaging applications.     

Predictive control architecture for real-time image moments based servoing of robot manipulators

This paper presents a real-time architecture for visual servoing of robot manipulators using nonlinear based predictive control. In order to increase the robustness of the control algorithm, image moments were chosen to be the visual features which describe the objects from the image. A visual predictive architecture is designed to solve tasks addressed to robot manipulators with an eye-in-hand configuration. An implementation of the proposed architecture is done so that the capabilities of a 6 d.o.f robot manipulator are extended. The results of different experiments conducted with two types of image moments based controllers (proportional and predictive with reference trajectory) are presented and discussed.     

SLA-based operations of massively multiplayer online games in clouds

Successful massively multiplayer online games (MMOGs) have today millions of registered users and hundreds of thousands of active concurrent players. To be able to guarantee quality of service (QoS) to a highly variable number of concurrent users, game operators statically over-provision a large infrastructure capable of sustaining the game peak load, even though a large portion of the resources is unused most of the time. To address this problem, we introduce in this work a new MMOG ecosystem for hosting and provisioning of MMOGs which effectively splits the traditional monolithic MMOG companies into three main service providers: game providers, game operators, and resource providers. Their interaction is regulated through comprehensive service level agreements (SLA) that establish the price, terms of operation, and compensation for service violations. In our model, game operators efficiently provision resources for MMOGs from multiple cloud providers, based on dynamic load forecasts, and ensure proper game operation that maintains the required QoS to all clients under varying resource availability. Game providers manage multiple distributed MMOGs for which they lease services under strict operational SLAs from game operators to satisfy all client requests. These three self-standing, smaller, more agile service providers enable access to the MMOG market for the small and medium enterprises, and to the current commercial cloud providers. We evaluate, through simulations based on real-life MMOG traces and commercial cloud SLAs, the impact of resource availability on the QoS offered to the MMOG clients. We find that our model can mitigate the negative effects of resource failures within four minutes and that MMOG server consolidation can accentuate the negative effects of failures in a resource-scarce environment. We further investigate different methods of ranking MMOG operational offers with either single or multiple (competing) MMOG providers. Our results show that compensations for SLA faults in the offer selection process can lead up to 11–16 % gain in the game providers’ income. We also demonstrate that adequate ranking of offers can lead to MMOG operational cost reductions from 20 up to 60 %.     

Extreme simplification and rendering of point sets using algebraic multigrid

We present a novel approach for extreme simplification of point set models, in the context of real-time rendering. Point sets are often rendered using simple point primitives, such as oriented discs. However, this requires using many primitives to render even moderately simple shapes. Often, one wishes to render a simplified model using only a few primitives, thus trading accuracy for simplicity. For this goal, we propose a more complex primitive, called a splat, that is able to approximate larger and more complex surface areas than oriented discs. We construct our primitive by decomposing the model into quasi-flat regions, using an efficient algebraic multigrid algorithm. Next, we encode these regions into splats implemented as planar support polygons textured with color and transparency information and render the splats using a special blending algorithm. Our approach combines the advantages of mesh-less point-based techniques with traditional polygon-based techniques. We demonstrate our method on various models.     

A search space “cartography” for guiding graph coloring heuristics

We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, we introduce the following clustering hypothesis: the high quality solutions are not randomly scattered in the search space, but rather grouped in clusters within spheres of specific diameter. We first provide intuitive evidence for this hypothesis by presenting a projection of a large set of local minima in the 3D space. An experimental confirmation is also presented: we introduce two algorithms that exploit the hypothesis by guiding an underlying Tabu Search (TS) process. The first algorithm (TS-Div) uses a learning process to guide the basic TS process toward as-yet-unvisited spheres. The second algorithm (TS-Int) makes deep investigations within a bounded region by organizing it as a tree-like structure of connected spheres. We experimentally demonstrate that if such a region contains a global optimum, TS-Int does not fail in eventually finding it. This pair of algorithms significantly outperforms the underlying basic TS algorithm; it can even improve some of the best-known solutions ever reported in the literature (e.g. for dsjc1000.9).