We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured in many different metrics, and so allowing graphs with multivariate edges significantly increases modeling power. In this context the clustering problem becomes more challenging. Each edge/metric provides only partial information about the data; recovering full inform...

Impulsive X-ray Raman excitations of Lithium, Neon, and Sodium are calculated using the Multiconfiguration Time-Dependent Hartree-Fock method. Using linearly polarized laser pulses without chirp, we determine the optimum central frequency, intensity, and duration for maximum population transfer to valence excited states. We demonstrate the existence of two local optima or “sweet spots” for popu...

Line Edge Roughness (LER), caused by tolerances inherent to materials and tools used in lithography processes, is not a new phenomenon. Yet, the imperfections caused by LER have caused little worry over the years since the critical dimensions of MOSFETs were almost two orders of magnitude larger than the roughness. However, as the aggressive scaling of Si-MOSFETs continues to the sub-100 nm reg...

An unstructured-grid, Navier-Stokes flow solver is used to compute the transonic flow development over the SKF 1.1 supercritical aerofoil section, in clean configuration and equipped with either a trailing-edge flap or a leading-edge slat. A full differential Reynolds-stress turbulence model is employed, with wall-function near-wall boundary conditions, for the computations. Agreement between p...

The study presents two novel approaches for gust response analysis of elastic free aircraft configuration using computational fluid dynamics (CFD) tools. The direct approach involves full aeroelastic dynamic simulation within a CFD run. The hybrid approach involves computing rigid sharp-edge gust responses in a CFD run, evaluating the gust input forces due to arbitrary gust profiles via convolu...

A rainbow subgraph of an edge-coloured graph is a subgraph whose edges have distinct colours. The colour degree of a vertex v is the number of different colours on edges incident with v. Wang and Li conjectured that for k 4, every edge-coloured graph with minimum colour degree k contains a rainbow matching of size at least k/2 . A properly edge-coloured K4 has no such matching, which motivates ...

A rainbow subgraph of an edge-colored graph is a subgraph whose edges have distinct colors. The color degree of a vertex v is the number of different colors on edges incident with v. Wang and Li conjectured that for k ≥ 4, every edge-colored graph with minimum color degree k contains a rainbow matching of size at least dk/2e. A properly edge-colored K4 has no such matching, which motivates the ...

the topological indices, defined as the sum of contributions of all pairs of vertices (among which are the wiener, harary, hyper–wiener indices, degree distance, and many others), are expressed in terms of contributions of edges and pairs of edges.

The problem of edge waves as an example within classical water-wave theory is described by presenting an overview of some of the theories that have been offered for this phenomenon. The appropriate governing equations and boundary conditions are formulated, and then the important discoveries of Stokes and Ursell, concerning the travelling edge wave, are presented. (We do not address the corresp...

A systematic framework is given that accommodates existing max-min filter methods and suggests new ones. Putting the upper and lower envelopes UPP = MIN(MAX) and LOW = MAX(MIN) in the roles that MAX, MIN or original play in existing filters we can distinguish edges in ramp edges and texture (or noise) edges; all methods presented come in three versions: for edges, ramp edges and non-ramp ("text...