The increase in societal awareness towards environmental issues has accrued the responsibility of goods producers, which at present came to encompass the entire product life cycle. Recently, the efficient design and operation of supply chains with return flows have, in particular, become a major challenge for many companies, given the high number of factors involved and their intricate interactions. In this paper, a multi-period and multi-product network model for the simultaneous design and planning of supply chains with reverse flows is proposed. A graph approach based on the conventional concepts of nodes and arcs is employed to model the network, where it is assumed that any network node is a transformation point of inbound into outbound flows, which in the limit may not differ, and that related arcs describe products flows along the chain. In here the formulation of time adopts a management perspective, i.e., the strategic design of the supply chain is dealt simultaneously with the tactical planning of its operation, which covers supply, production, storage and distribution. An example based on a Portuguese industry case is studied in order to validate both the applicability and adequacy of the model to real world problems.

n/a

n/a

In 1968, Israel Gohberg and Naum Krupnik discovered that local spectra of singular integral operators with piecewise continuous coefficients on Lebesgue spaces \(L^p(\Gamma)\) over Lyapunov curves have the shape of circular arcs. About 25 years later, Albrecht Böttcher and Yuri Karlovich realized that these circular arcs metamorphose to so-called logarithmic leaves with a median separating point when Lyapunov curves metamorphose to arbitrary Carleson curves. We show that this result remains valid in a more general setting of variable Lebesgue spaces \(L^{p(\cdot)}(\Gamma)\) where \(p:\Gamma\to(1,\infty)\) satisfies the Dini-Lipschitz condition. One of the main ingredients of the proof is a new condition for the boundedness of the Cauchy singular integral operator on variable Lebesgue spaces with weights related to oscillations of Carleson curves.

Some performance issues of transactional memory are caused by unnecessary abort situations where non serializable and yet non conflicting transactions are scheduled to execute concurrently. Smartly relaxing the isolation properties of transactions may overcome these issues and attain considerable performance improvements. However, it is known that relaxing isolation restrictions may lead to runtime anomalies. In some situations, like database management systems, developers may choose that compromise, hence avoiding anomalies explicitly. Memory transactions protect the state of the program, therefore execution anomalies may have more severe consequences in the semantics of programs. So, the compromise between a relaxed isolation strategy and enforcing the necessary program correctness is harder to setup. The solution we devise is to statically analyse programs to detect the kind of anomalies that emerge under snapshot isolation. Our approach allows a compiler to either warn the developer about the possible snapshot isolation anomalies in a given program, or possibly inform automatic correctness strategies to ensure Serializability.

Programs containing concurrency anomalies will most probably exhibit harmful erroneous and unpredictable behaviors. To ensure program correctness, the sources of those anomalies must be located and corrected. Concurrency anomalies in Transactional Memory (TM) programs should also be diagnosed and fixed. In this paper we propose a framework to deal with two different categories of concurrency anomalies in TM. First, we will address low-level TM anomalies, also called dataraces, which arise from executing programs in weak isolation. Secondly, we will address high-level TM anomalies, also called high-level dataraces, bringing the programmers attention to pairs of transactions that the programmer has misspecified, and should have been combined into a single transaction. Our framework was validated against a set of programs with well known anomalies and demonstrated high accuracy and effectiveness, thus contributing for improving the correctness of TM programs

Spreadsheets are notoriously error-prone. To help avoid the introduction of errors when changing spreadsheets, models that capture the structure and inter-dependencies of spreadsheets at a conceptual level have been proposed. Thus, spreadsheet evolution can be made safe within the confines of a model. As in any other model/instance setting, evolution may not only require changes at the instance level but also at the model level. When model changes are required, the safety of instance evolution can not be guarded by the model alone. Coupled transformation of models and instances are supported by the 2LT platform and have been applied for transformation of algebraic datatypes, XML schemas, and relational database models. We have extended 2LT to spreadsheet evolution. We have designed an appropriate representation of spreadsheet models, including the fundamental notions of formulæ, references, and blocks of cells. For these models and their instances, we have designed coupled transformation rules that cover specific spreadsheet evolution steps, such as extraction of a block of cells into a separate sheet or insertion of columns in all occurrences of a repeated block of cells. Each model-level transformation rule is coupled with instance level migration rules from the source to the target model and vice versa. These coupled rules can be composed to create compound transformations at the model level that induce compound transformations at the instance level. With this approach, spreadsheet evolution can be made safe, even when model changes are involved.

n/a

n/a

The two-photon decay of heavy, helium-like ions is investigated based on second-order perturbation theory and Dirac’s relativistic equation. Special attention has been paid to the angular emission of the two photons (i.e., how the angular correlation function depends on the shell structure of the ions in their initial and final states). Moreover, the effects from the (electric and magnetic) nondipole terms in the expansion of the electron-photon interaction are discussed. Detailed calculations have been carried out for the two-photon decay of the 1s2s1S0, 1s2s3S1, and 1s2p3P0 states of helium-like Xe52+, Au77+, and U90+ ions.

The two-photon decay of heavy, helium-like ions is investigated based on second-order perturbation theory and Dirac’s relativistic equation. Special attention has been paid to the angular emission of the two photons (i.e., how the angular correlation function depends on the shell structure of the ions in their initial and final states). Moreover, the effects from the (electric and magnetic) nondipole terms in the expansion of the electron-photon interaction are discussed. Detailed calculations have been carried out for the two-photon decay of the 1s2s1S0, 1s2s3S1, and 1s2p3P0 states of helium-like Xe52+, Au77+, and U90+ ions.

n/a

n/a

n/a

n/a

n/a

Ionization energies of benzyl azide (BA), C6H5CH2N3, its methyl derivatives, 2-, 3- and 4-methyl benzyl azide and (1-azidoethyl)benzene (2-, 3- and 4-MBA and 1-AEB), (CH3)C6H4CH2 N3, have been calculated with several basis sets, with M¯ller-Plesset and Hartree-Fock methods. The data are compared to the ionizations energies obtained from HeI photoelectron spectroscopy (UVPES) experiments, in order to support the correct assignment of the bands. The nature and character of the molecular orbitals are also discussed.

Ionization energies of benzyl azide (BA), C6H5CH2N3, its methyl derivatives, 2-, 3- and 4-methyl benzyl azide and (1-azidoethyl)benzene (2-, 3- and 4-MBA and 1-AEB), (CH3)C6H4CH2 N3, have been calculated with several basis sets, with M¯ller-Plesset and Hartree-Fock methods. The data are compared to the ionizations energies obtained from HeI photoelectron spectroscopy (UVPES) experiments, in order to support the correct assignment of the bands. The nature and character of the molecular orbitals are also discussed.

Transactional Memory allows programmers to reduce the number of synchronization errors introduced in concurrent programs, but does not ensures its complete elimination. This paper proposes a pattern matching based approach to the static detection of atomicity violation, based on a path-sensitive symbolic execution method to model four anomalies that may affect Transactional Memory programs. The proposed technique may be used to to bring to programmer’s attention pairs of transactions that the programmer has mis-specified, and should have been combined into a single transaction. The algorithm first traverses the AST tree, removing all the non-transactional blocks and generating a trace tree in the path sensitive manner for each thread. The trace tree is a Trie like data structure, where each path from root to a leaf is a list of transactions. For each pair of threads, erroneous patterns involving two consecutive transactions are then checked in the trace tree. Results allow to conclude that the proposed technique, although triggering a moderate number of false positives, can be successfully applied to Java programs, correctly identifying the vast majority of the relevant erroneous patterns.

n/a

n/a