Scalar conservation laws: Initial and boundary value problems revisited and saturated solutions

We revisit the classical theory of multidimensional scalar conservation laws. We reformulate the notion of the classical Kruzkov entropy solutions and study some new properties as well as the well-posedness of the initial value problem with inhomogeneous fluxes and general initial data. We also consider Dirichlet boundary value problems. We put forward a new and transparent definition for solutions and give a simple proof for their well-posedness in domains with smooth boundaries. Finally, we introduce the notion of saturated solutions and show that it is well-posed.     

Equity portfolio construction and selection using multiobjective mathematical programming

A multi-objective mixed integer programming model for equity portfolio construction and selection is developed in this study, in order to generate the Pareto optimal portfolios, using a novel version of the well known ε-constraint method. Subsequently, an interactive filtering process is also proposed to assist the decision maker in making his/her final choice among the Pareto solutions. The proposed methodology is tested through an application in the Athens Stock Exchange.     

Corresponding-states laws for protein solutions

The solvent around protein molecules in solutions is structured and this structuring introduces a repulsion in the intermolecular interaction potential at intermediate separations. We use Monte Carlo simulations with isotropic, pair-additive systems interacting with such potentials. We test if the liquid-liquid and liquid-solid phase lines in model protein solutions can be predicted from universal curves and a pair of experimentally determined parameters, as done for atomic and colloid materials using several laws of corresponding states. As predictors, we test three properties at the critical point for liquid-liquid separation: temperature, as in the original van der Waals law, the second virial coefficient, and a modified second virial coefficient, all paired with the critical volume fraction. We find that the van der Waals law is best obeyed and appears more general than its original formulation: A single universal curve describes all tested nonconformal isotropic pair-additive systems. Published experimental data for the liquid-liquid equilibrium for several proteins at various conditions follow a single van der Waals curve. For the solid-liquid equilibrium, we find that no single system property serves as its predictor. We go beyond corresponding-states correlations and put forth semiempirical laws, which allow prediction of the critical temperature and volume fraction solely based on the range of attraction of the intermolecular interaction potential.     

Secure message transmission in mobile ad hoc networks

The vision of nomadic computing with its ubiquitous access has stimulated much interest in the mobile ad hoc networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. In the open, collaborative MANET environment, practically any node can maliciously or selfishly disrupt and deny communication of other nodes. In this paper, we propose the secure message transmission (SMT) protocol to safeguard the data transmission against arbitrary malicious behavior of network nodes. SMT is a lightweight, yet very effective, protocol that can operate solely in an end-to-end manner. It exploits the redundancy of multi-path routing and adapts its operation to remain efficient and effective even in highly adverse environments. SMT is capable of delivering up to 83% more data messages than a protocol that does not secure the data transmission. Moreover, SMT achieves up to 65% lower end-to-end delays and up to 80% lower delay variability, compared with an alternative single-path protocol––a secure data forwarding protocol, which we term secure single path (SSP) protocol. Thus, SMT is better suited to support quality of service for real-time communications in the ad hoc networking environment. The security of data transmission is achieved without restrictive assumptions on the network nodes’ trust and network membership, without the use of intrusion detection schemes, and at the expense of moderate multi-path transmission overhead only.     

Antioxidant behaviour of 2′‐hydroxy‐chalcones: a study of their electrochemical properties

The electrochemical behaviour of 13 chalcone analogues was systematically studied by means of cyclic voltammetry and chronoamperometry at a glassy carbon (GC), gold and platinum working electrodes using two different supporting electrolyte/solvent combinations. It was found that chalcone analogues can be easily oxidized at both GC and gold working electrodes, but not at a platinum electrode. Principal component analysis was further employed to reveal similarities/dissimilarities between oxidation potentials, chronoamperometric signals and ability of the compounds to scavenge the reactive oxygen species H₂O₂. The study reveals the inverse proportional relationship between the scavenging ability of H₂O₂, expressed as IC₅₀, and chronoamperometric signal at 800 mV using gold as working electrode. Copyright © 2012 John Wiley & Sons, Ltd.     

Clustering‐based scheduling: A new class of scheduling algorithms for single‐hop lightwave networks

In wavelength division multiplexing (WDM) star networks, the construction of the transmission schedule is a key issue, which essentially affects the network performance. Up to now, classic scheduling techniques consider the nodes' requests in a sequential service order. However, these approaches are static and do not take into account the individual traffic pattern of each node. Owing to this major drawback, they suffer from low performance, especially when operating under asymmetric traffic. In this paper, a new class of scheduling algorithms for WDM star networks, which is based on the use of clustering techniques, is introduced. According to the proposed Clustering‐Based Scheduling Algorithm (CBSA), the network's nodes are organized into clusters, based on the number of their requests per channel. Then, their transmission priority is defined beginning from the nodes belonging to clusters with higher demands and ending to the nodes of clusters with fewer requests. The main objective of the proposed scheme is to minimize the length of the schedule by rearranging the nodes' service order. Furthermore, the proposed CBSA scheme adopts a prediction mechanism to minimize the computational complexity of the scheduling algorithm. Extensive simulation results are presented, which clearly indicate that the proposed approach leads to a significantly higher throughput‐delay performance when compared with conventional scheduling algorithms. We believe that the proposed clustering‐based approach can be the base of a new generation of high‐performance scheduling algorithms for WDM star networks. Copyright © 2008 John Wiley & Sons, Ltd.     

A Management Framework for Ambient Systems Operating in Wireless B3G Environments

As the wireless world is rapidly evolving towards the “Beyond the 3rd Generation” (B3G) era, communication infrastructures need to tackle external conditions that are continuously changing, and thus become less predictable in terms of quality of service (QoS) provision. On the contrary, the B3G era, through the coexistence and complementary use of a multitude of Radio Access Technologies (RATs), offers additional capabilities for providing users with advanced levels of convenience and flexibility for living and working. Those advances in communications and networking technology are making it possible to devise ‘ambient’ systems, i.e. systems that realize the vision of an all-encompassing multimedia networking environment, which is aware of the users’ presence and context, and is sensitive, adaptive, and responsive to their needs, habits, gestures and emotions. All above pose significant challenges regarding the intelligent management of heterogeneous wireless infrastructures. In the light of the above, this paper presents such an advanced management framework, as an enabling technology for designing and developing ambient, wireless systems in B3G environments. The paper focuses on the main components of the proposed framework, as well as on their functionality and interactions. Additionally, indicative simulation results showcase the efficiency of the proposed framework.     

Versatile gold-polymer nanointerfaces probed by GISAXS

An increasing trend toward integration of polymers in microelectronics and organic electronics has recently boosted research focusing in metal-polymer interfaces. These two materials differ vastly, with the former forming dense, crystalline, cohesive structures and the latter forming open structures bound together by weak van der Waals forces. As a result, there is dire need to assess their surface features (e.g., roughness) and correlate them with corresponding growth parameters, as metal-polymer interfaces are mainly determined by the preparation process. Here, we report a laboratory-based grazing-incidence small-angle x-ray scattering (GISAXS) study on distinct gold-polymer interfaces fabricated with different growth mechanisms, utilizing in-plane and oblique sputter geometries. GISAXS provided an improved analytic scheme for the buried surface in free-standing 2D gold-polymer nanosheets (with 19% porosity) revealing their fractal structure (Porod slope: ?1.71). Two quantitative approaches (Height-Height Correlation and Power Spectral Density functions) were used to describe rough surfaces characterized by Atomic Force Microscopy (AFM) in consort with GISAXS data; different correlation length dependencies on growth time were revealed for gold rough surfaces grown on bare and polymerized Si. The results are considered pertinent to interfacial nanoscience and engineering, enabling statistical data collection from large surface areas, in a fast and nondestructive manner.     

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems

Mathematical Programming - This paper analyzes block-coordinate proximal gradient methods for minimizing the sum of a separable smooth function and a (nonseparable) nonsmooth function, both of...