Formation of Cu Nanodots on Diamond Surface to Improve Heat Transfer in Cu/D Composites

Diamond‐dispersed copper matrix (Cu/D) composite materials with different interfacial configurations are fabricated through powder metallurgy and their thermal performances are evaluated. An innovative solution to chemically bond copper (Cu) to diamond (D) has been investigated and compared to the traditional Cu/D bonding process involving carbide‐forming additives such as boron (B) or chromium (Cr). The proposed solution consists of coating diamond reinforcements with Cu particles through a gas–solid nucleation and growth process. The Cu particle‐coating acts as a chemical bonding agent at the Cu–D interface during hot pressing, leading to cohesive and thermally conductive Cu/D composites with no carbide‐forming additives. Investigation of the microstructure of the Cu/D materials through scanning electron microscopy, transmission electron microscopy, and atomic force microscopy analyses is coupled with thermal performance evaluations through thermal diffusivity, dilatometry, and thermal cycling. Cu/D composites fabricated with 40 vol% of Cu‐coated diamonds exhibit a thermal conductivity of 475 W m^?1 K^?1 and a thermal expansion coefficient of 12 × 10^?6 °C^?1. These promising thermal performances are superior to that of B‐carbide‐bonded Cu/D composites and similar to that of Cr‐carbide‐bonded Cu/D composites fabricated in this study. Moreover, the Cu/D composites fabricated with Cu‐coated diamonds exhibit higher thermal cycling resistance than carbide‐bonded materials, which are affected by the brittleness of the carbide interphase upon repeated heating and cooling cycles. The as‐developed materials can be applicable as heat spreaders for thermal management of power electronic packages. The copper‐carbon chemical bonding solution proposed in this article may also be found interesting to other areas of electronic packaging, such as brazing solders, direct bonded copper substrates, and polymer coatings.

     

Root-restricted Kleenean rotations

We generalize the Kleene theorem to the case where nonassociative products are used. For this purpose, we apply rotations restricted to the root of binary trees.     

Dealing with midair collisions in dense collective aerial systems

The idea of creating collective aerial systems is appealing because several rather simple flying vehicles could join forces to cover a large area in little time in applications such as monitoring, mapping, search and rescue, or airborne communication relays. In most of these scenarios, a fleet of cooperating vehicles is dispatched to a confined airspace area and requested to fly close to a nominal altitude. Moreover, depending on the task each vehicle is assigned to, individual flight trajectories in this essentially two‐dimensional space may interfere, resulting in disastrous collisions. This paper begins by introducing a probabilistic model to predict the rate of midair collisions that would occur if nothing is done to prevent them. In a second step, a control strategy for midair collision avoidance is proposed, which is interesting because it requires only local communication and information about flight altitudes. The proposed strategy is systematically analyzed in theory and simulation as well as in experiments with five physical aerial vehicles. A significant reduction in collision rates can be achieved. Statistically, values close to zero are possible when the swarm's density is below an application‐dependent threshold. Such low collision rates warrant an acceptable level of confidence in collision‐free operation of a physical swarm. © 2011 Wiley Periodicals, Inc.     

Simulation of rotating stall in a whole stage of an axial compressor

Aerodynamic instabilities that naturally occur in compression systems, such as surge and rotating stall, largely reduce the life duration and performance of system components. The prediction of the compressor operating range is thus a key parameter for the design of gas turbines. This paper investigates the ability of an unsteady flow solver to simulate the rotating stall phenomenon in the full annulus of an axial compressor stage. A comparison with experimental data indicates that the simulation correctly estimates the stability limit. However the rotating stall flow patterns are different. While measurements show only one full span rotating stall cell (40 Hz), the simulation shows first a part span stall with 10 cells (790 Hz) that evolves then towards a full span stall with three cells (170 Hz). A spectral analysis based on numerical results underlines the role of rotor-stator interactions in the development of rotating stall. The effects of downstream volumes and inlet distortions are also discussed, showing the necessity to consider the whole geometry to correctly predict the rotating stall frequency.     

Digital Steiner sets and Matheron semi-groups

There are various ways to define digital convexity in Zⁿ$Z^n$. The proposed approach focuses on structuring elements (and not the sets under study), whose digital versions should allow to construct hierarchies of operators satisfying Matheron semi-groups law _γλγμ=_γmax(λ,_μ)${\gamma }_{\lambda }{\gamma }_{\mu }={\gamma }_{\max (\lambda \text{,}\mu )}$, where λ$\lambda$ is a size factor. In Rⁿ$R^n$ the convenient class is the Steiner one. Its elements are Minkowski sums of segments. We prove that it admits a digital equivalent when the segments of Zⁿ$Z^n$ are Bezout. The conditions under which the Steiner sets are convex in Zⁿ$Z^n$, and are connected, are established. The approach is then extended to structuring elements that vary according to the law of perspective, and also to anamorphoses, so that the digital Steiner class and its properties can extend to digital spaces as a sphere or a torus.     

Marking student programs using graph similarity

We present a novel approach to the automated marking of student programming assignments. Our technique quantifies the structural similarity between unmarked student submissions and marked solutions, and is the basis by which we assign marks. This is accomplished through an efficient novel graph similarity measure (AssignSim). Our experiments show good correlation of assigned marks with that of a human marker.     

Regaining cut admissibility in deduction modulo using abstract completion

Deduction modulo is a way to combine computation and deduction in proofs, by applying the inference rules of a deductive system (e.g. natural deduction or sequent calculus) modulo some congruence that we assume here to be presented by a set of rewrite rules. Using deduction modulo is equivalent to proving in a theory corresponding to the rewrite rules, and leads to proofs that are often shorter and more readable. However, cuts may be not admissible anymore.We define a new system, the unfolding sequent calculus, and prove its equivalence with the sequent calculus modulo, especially w.r.t. cut-free proofs. It permits to show that it is even undecidable to know if cuts can be eliminated in the sequent calculus modulo a given rewrite system.Then, to recover the cut admissibility, we propose a procedure to complete the rewrite system such that the sequent calculus modulo the resulting system admits cuts. This is done by generalizing the Knuth–Bendix completion in a non-trivial way, using the framework of abstract canonical systems.These results enlighten the entanglement between computation and deduction, and the power of abstract completion procedures. They also provide an effective way to obtain systems admitting cuts, therefore extending the applicability of deduction modulo in automated theorem proving.     

Optimization of quality and operational costs through improved scheduling of harvest operations

The agriculture sector still lacks the tools and models to enhance the utilization of different resources. This paper addresses the vineyard harvesting problem in developing countries, with the objective of optimizing the wine quality and minimizing the operational costs. Heuristics were introduced to better assign the harvesting days to the different grape blocks that exist in the vineyard's field. The quality of the grapes was a key target as it can transform production from a pinnacle wine to a bulk one. We solved several numerical examples for verification and demonstrative purposes and found that our proposed approach finds solutions that significantly reduce the harvesting costs in the vineyard and considerably outperform Branch and Bound algorithm especially for large problems.