Annotation taken, in the perspective of criminal and constitutional law, as well as in criminology, to the decision of the portuguese constitutional court, of January 13, 2011 – with respect to the problems of “consent” and “medical act”

1 – Summary of the decision taken by the Portuguese Constitutional Court, of January 13, 2011; 2 – Complete text of the decision of the Portuguese Constitutional Court, of January 13, 2011, Judge Maria João ANTUNES (Reporter), Judge Carlos Pamplona de OLIVEIRA, Judge José Borges SOEIRO, Judge Gil GALVÃO, Judge Rui Manuel Moura RAMOS (President) –in terms of the tribunalconstitucional.pt, August 1, 2011; 3 – Brief annotation to the problem of the “medical act”; 3.1 – Plus some conclusions on the brief annotation to the problem of the “medical act”; 3.2 – Brief annotation to the problem of “consent”– continuation of the previous comments; 4 – Conclusions. It must never be forgotten that “consent” does not stand as the only cause of exclusion of unlawfulness.

Improving fECG signal acquisition in the evaluation of fetal well-being

The ability to monitor fetal heart rate is vital during late pregnancy and labor in order to evaluate fetal well-being. Current monitoring practice is essentially based on external cardiotocography and, less frequently, during labor, invasive fetal scalp electrocardiography. Many current and envisaged applications could benefi t from simpler devices using a 3-lead ECG confi guration. We are designing a maternity support belt with an embedded wireless 3-lead ECG sensor, and have investigated the infl uence of the ground electrode position on signal quality. Data from over 100 pregnant women was collected with the ground electrode placed in 3 locations in order to determine optimum electrode placement and belt form factor.

Estimating Local Part Thickness in Midplane Meshes for Finite Element Analysis

Within the development of motor vehicles, crash safety (e.g. occupant protection, pedestrian protection, low speed damageability), is one of the most important attributes. In order to be able to fulfill the increased requirements in the framework of shorter cycle times and rising pressure to reduce costs, car manufacturers keep intensifying the use of virtual development tools such as those in the domain of Computer Aided Engineering (CAE). For crash simulations, the explicit finite element method (FEM) is applied. The accuracy of the simulation process is highly dependent on the accuracy of the simulation model, including the midplane mesh. One of the roughest approximations typically made is the actual part thickness which, in reality, can vary locally. However, almost always a constant thickness value is defined throughout the entire part due to complexity reasons. On the other hand, for precise fracture analysis within FEM, the correct thickness consideration is one key enabler. Thus, availability of per element thickness information, which does not exist explicitly in the FEM model, can significantly contribute to an improved crash simulation quality, especially regarding fracture prediction. Even though the thickness is not explicitly available from the FEM model, it can be inferred from the original CAD geometric model through geometric calculations. This paper proposes and compares two thickness estimation algorithms based on ray tracing and nearest neighbour 3D range searches. A systematic quantitative analysis of the accuracy of both algorithms is presented, as well as a thorough identification of particular geometric arrangements under which their accuracy can be compared. These results enable the identification of each technique’s weaknesses and hint towards a new, integrated, approach to the problem that linearly combines the estimates produced by each algorithm.

Program slicing by calculation

Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, usually oriented towards the imperative or object paradigms, are based on some sort of graph structure representing program dependencies. Slicing techniques amount, therefore, to (sophisticated) graph transversal algorithms. This paper proposes a completely different approach to the slicing problem for functional programs. Instead of extracting program information to build an underlying dependencies’ structure, we resort to standard program calculation strategies, based on the so-called Bird-Meertens formalism. The slicing criterion is specified either as a projection or a hiding function which, once composed with the original program, leads to the identification of the intended slice. Going through a number of examples, the paper suggests this approach may be an interesting, even if not completely general, alternative to slicing functional programs

Slicing functional programs by calculation

Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, usually targeting either the imperative or the object oriented paradigms, are based on some sort of graph structure representing program dependencies. Slicing techniques amount, therefore, to (sophisticated) graph transversal algorithms. This paper proposes a completely different approach to the slicing problem for functional programs. Instead of extracting program information to build an underlying dependencies’ structure, we resort to standard program calculation strategies, based on the so-called Bird- Meertens formalism. The slicing criterion is specified either as a projection or a hiding function which, once composed with the original program, leads to the identification of the intended slice. Going through a number of examples, the paper suggests this approach may be an interesting, even if not completely general alternative to slicing functional programs

Eigenvalue computations in the context of data-sparse approximations of integral operators

In this work, we consider the numerical solution of a large eigenvalue problem resulting from a finite rank discretization of an integral operator. We are interested in computing a few eigenpairs, with an iterative method, so a matrix representation that allows for fast matrix-vector products is required. Hierarchical matrices are appropriate for this setting, and also provide cheap LU decompositions required in the spectral transformation technique. We illustrate the use of freely available software tools to address the problem, in particular SLEPc for the eigensolvers and HLib for the construction of H-matrices. The numerical tests are performed using an astrophysics application. Results show the benefits of the data-sparse representation compared to standard storage schemes, in terms of computational cost as well as memory requirements.

Error bounds for low-rank approximations of the first exponential integral kernel

A hierarchical matrix is an efficient data-sparse representation of a matrix, especially useful for large dimensional problems. It consists of low-rank subblocks leading to low memory requirements as well as inexpensive computational costs. In this work, we discuss the use of the hierarchical matrix technique in the numerical solution of a large scale eigenvalue problem arising from a finite rank discretization of an integral operator. The operator is of convolution type, it is defined through the first exponential-integral function and, hence, it is weakly singular. We develop analytical expressions for the approximate degenerate kernels and deduce error upper bounds for these approximations. Some computational results illustrating the efficiency and robustness of the approach are presented.

Dashboard services for pragmatics-based interoperability in cloud and ubiquitous manufacturing

The real Cloud and Ubiquitous Manufacturing systems require effectiveness and permanent availability of resources, their capacity and scalability. One of the most important problems for applications management over cloud based platforms, which are expected to support efficient scalability and resources coordination following SaaS implementation model, is their interoperability. Even application dashboards need to easily incorporate those new applications, their interoperability still remains a big problem to override. So, the possibility to expand these dashboards with efficiently integrated communicational cloud based services (cloudlets) represents a relevant added value as well as contributes to solving the interoperability problem. Following the architecture for integration of enriched existing cloud services, as instances of manufacturing resources, this paper: a) proposes a cloud based web platform to support dashboard integrating communicational services, and b) describe an experimentation to sustain the theory that the effective and efficient interoperability, especially in dynamic environments, could be achieved only with human intervention.