We consider a function to minimize J : Ω → IR with Ω ⊂ IR. We make the following assumptions: J ∈ C2(Ω, IR) and is coercive. Its minimum Jm exists. Most deterministic minimization algorithms can be seen as discrete dynamical systems coming from a discretization of first or second order Cauchy problems. If one knows the infimum Jm, global optimization can be considered as Boundary Value Problem ...

An aneurysm is a balloon-like bulge in the wall of blood vessels, occurring in major arteries of the heart and brain. Biodegradable polymeric stent-assisted coiling is expected to be the ideal treatment of wide-neck complex aneurysms. This paper presents the development of methods to fabricate and optimally design biodegradable polymeric stents for aneurysms treatment. Firstly, a dispensing-bas...

The problem of having sufficient coverage is an essential issue in wireless sensor network (WSN). A high coverage rate delivers a higher quality of service. The aim of coverage problem is to ensure a minimum number of nodes (at least one sensor) with little redundant data cover every point inside the interest area. In this paper, we provided an algorithm for WSN coverage based on Zigzag Pattern...

Modern web applications are increasingly moving program code to the client in the form of JavaScript. With the growing adoption of HTML5APIs such as postMessage, client-side validation (CSV) vulnerabilities are consequently becoming increasingly important to address as well. However, while detecting and preventing attacks against web applications is a well-studied topic on the server, considera...

In this paper, we propose a deadlock-free wormhole routing scheme called the Zigzag routing for the panMesh, which generalizes the mesh topology. Accordingly, we prove that only two virtual channels are needed for deadlock-freeness on every physical channel by using the Zigzag routing.

A bottom-up approach toward stable and monodisperse segments of graphenes with a nitrogen-doped zigzag edge is introduced. Exemplified by the so far unprecedented dibenzo-9a-azaphenalene (DBAPhen) as the core unit, a versatile synthetic concept is introduced that leads to nitrogen-doped zigzag nanographenes and graphene nanoribbons.

The theory of zigzag persistence is a substantial extension of persistent homology, and its development has enabled the investigation of several unexplored avenues in the area of topological data analysis. In this paper, we discuss three applications of zigzag persistence: topological bootstrapping, parameter thresholding, and the comparison of witness complexes.

In the title compound, C(12)H(24)O(4), the dioxane ring adopts a chair conformation; the n-hexyl chain, which occupies an equatorial position, has an extended zigzag conformation. In the crystal, mol-ecules are connected by O-H⋯O hydrogen-bonds into a zigzag chain running along the b axis, giving rise to a herringbone pattern.

For any two binary vectors x = (x1, x2, . . . , xn) and y = (y1, y2, . . . , yn) in F2 , define the sets δ(x, y) = {i : xi 6= yi} and sup(x) = {i : xi 6= 0}. Denote the size of a set A with |A|. Then the Hamming distance between the binary vectors x and y is equal to d(x, y) = |δ(x, y)| and the Hamming weight of x is wt(x) = | sup(x)|. Instead of using the Hamming distance d(x, y) and norm wt(x...