Explicit reference modeling methodology in parametric CAD system

Today parametric associative CAD systems must help companies to create more efficient virtual development processes. While dealing with complex parts (e.g. the number of surfaces of the solid) no CAD modeling methodology is existing. Based on the analysis of industrial designers' practices as well as student practices on CAD, we identified key factors that lead to better performance. Our objective in this article is to propose a practical method for complex parts modeling in parametric CAD system. An illustration of the performances and the results obtained by this method are presented comparing the traditional method with the proposed one while using an academic case and then an industrial case.     

Over-production of 5-enolpyruvylshikimate-3-phosphate synthase in Escherichia coli: use of the T7 promoter

5-Enolpyruvylshikimate-3-phosphate (EPSP) synthase, the productof the Escherichia coli aroA gene, has been overproduced inE.coli BL21(DE3) under the control of the T7 gene 10 promoterand ribosome binding site, to a level of {small tilde}50% oftotal cell protein. EPSP synthase is the primary target of thepost-emergence herbicide, glyphosate, commonly known as Roundup^TM.A simple two step purification is described, which results in99% pure homogeneous protein (as determined by PAGE). The integrityof the protein has been compared with previously characterizedprotein from .E.coli AB2829(pKD501) by determination of itskinetic parameters, N-terminal protein and DNA sequences, aminoacid analysis and ¹³C-NMR spectroscopy. This new overproducingstrain readily provides the gram quantities of highly pure proteinrequired for NMR studies of the active site and the developmentof novel time-resolved solid-state NMR techniques currentlyunderway in this laboratory.     

Investigation of Flow Patterns in Continuous‐flow Stirred Vessels by Laser Doppler Velocimetry

The flow structure of a continuous‐flow reactor stirred by a Rushton turbine was investigated by laser Doppler velocimetry for two different mean residence time‐mixing time ratios. Velocity measurements were obtained for two inlet locations, corresponding to the incoming liquid stream being fed co‐currently or counter‐currently to the flow discharged by the turbine. In all investigated configurations and for all operating conditions, it was found that the flow disruption caused by the incoming liquid stream was observable mainly in the first vessel quarter, which followed the feed‐tube plane. From comparison of the velocities encountered in the various planes in the continuous‐flow reactor to the velocities of the batch reactor, it was also concluded that it may be possible to intensify the usage of the turbine‐stirred vessel by decreasing the characteristic times ratio, without considerable flow by‐pass and/or short‐circuiting problems.     

Verification of randomized consensus algorithms under round-rigid adversaries

International Journal on Software Tools for Technology Transfer - Randomized fault-tolerant distributed algorithms pose a number of challenges for automated verification: (i) parameterization in...     

Synthesis methods of array antenna excitation laws

Standard numerical optimization methods become very computational time consuming when dealing with synthesis of array antenna excitation laws, especially when number of elements exceeds a few tenths. Array antenna designer needs a fast and efficient synthesis tool, since the design phase implies several reoptimizations within the definition phase, in order to satisfy tradeoffs on antagonistic requirements : performances, size, cost,… We propose the use of an efficient, from the computational time point of view, and secured, from the convergence point of view, synthesis method illustrated by two examples. The optimized solution satisfies a sta-tionarity condition, which leads to steady solutions in frequency but also with regard to errors (manufacturing, …). Based on analytical calculus performed before any numerical resolution and together with the use of fast Fourier transform algorithms, this method leads to reduced optimization times (in the order of a minute) for arrays of some tenths up to some hundred feeds, computations being performed on a pc. Two theoretical applications are presented and for each of them a computed example is also shown; moreover possible extensions are considered.     

JUDGES: A descriptive group decision support system for the ranking of items

A set of tools for group decision support are presented. Decision problems involving several decision makers, here-after called judges, that have to rank several alternatives, are considered. The toolbox is called JUDGES. It includes the four following procedures:

• - a hierarchical representation of the judges allows to display the existing conflicts between groups of judges,

• - enhanced box-plots representations of the alternatives are generated in order to detect those that are responsible for the major conflicts,

• - specific advice is issued to each judge in order to reach more easily a consensus,

• - a general framework for a pairwise group preference structure is proposed, and can be used to finalise the decision.

These procedures are embedded in an interactive software, implemented on micro-computer, which currently simulates the use on a network. Actual network implementation is foreseen in the near future. Several applications are presented and future developments are discussed.

Breast micro-opacities of lead origin mimicking microcalcifications

After a surgical excision of focal mammary "microcalcification" we noticed that in fact they represented fine lead deposits (mean diameter: 100 microns) resulting from an attempted suicide (22 long rifle) 10 years previously. The leaded nature of these foreign microbodies was demonstrated by a micro-analysis by energy dispersion on histological slides.     

Improving the spatio-temporal distribution of surface solar radiation data by merging ground and satellite measurements

Appropriate information on solar resources is very important for a variety of technological areas, such as: agriculture, meteorology, forestry engineering, water resources and in particular in the designing and sizing of solar energy systems. However, the availability of observed solar radiation measurements has proven to be spatially and temporally inadequate for many applications. In this paper we propose to merge the global solar radiation measurements from the Royal Meteorological Institute of Belgium solar measurements network with the operationally derived surface incoming global short-wave radiation products from Meteosat Second Generation satellites imageries to improve the spatio-temporal resolution of the surface global solar radiation data over Belgium. We evaluate several merging methods with various degrees of complexity (from mean field bias correction to geostatistical merging techniques) together with interpolated ground measurements and satellite-derived values only. The performance of the different methods is assessed by leave-one-out cross-validation.     

Coupled-task scheduling on a single machine subject to a fixed-job-sequence

This paper investigates single-machine coupled-task scheduling where each job has two tasks separated by an exact delay. The objective of this study is to schedule the tasks to minimize the makespan subject to a given job sequence. We introduce several intriguing properties of the fixed-job-sequence problem under study. While the complexity status of the studied problem remains open, an O(n²) algorithm is proposed to construct a feasible schedule attaining the minimum makespan for a given permutation of 2n tasks abiding by the fixed-job-sequence constraint. We investigate several polynomially solvable cases of the fixed-job-sequence problem and present a complexity graph of the problem.     

A two-machine flowshop problem with processing time-dependent buffer constraints—An application in multimedia presentations

To have a quality multimedia presentation through networks, its presentation lag needs to be controlled. One way to reduce the lag is to prefetch the media objects before their due dates. This paper explores techniques for optimizing the object sequence in a prefetch-enabled TV-like presentation. An optimal solution is the one with which the presentation lag is minimized. We formulate the problem into a two-machine flowshop scheduling problem with a single chain precedence constraint and a player-side buffer constraint. The player-side buffer is “processing time-dependent” and distinguished from the conventional item-based intermediate buffer constraints discussed in previous flowshop studies. We prove the problem to be strongly NP-hard. A branch and bound algorithm equipped with four lower bounds and an NEH-based upper bound is developed. The simulation results show that the average gaps between the overall lower bounds and the NEH-based upper bound are less than 3% for problems with a large buffer size, and less than 13% for problems with a small buffer size and high density of precedence constraints. For applications where the media objects are delivered through extremely busy servers with which only very restricted CPU resources can be allocated for computation, the CDS-based algorithm provides better sequences than the NEH-based algorithm.