Modifications to the technic of cesarean section after Stark

BACKGROUND: As the operating births (caesarean section) increase, many surgical equipes have been compelled to revise operating techniques in order to reduce fetus extraction times and the whole expense of operation without renouncing, at the same time to beauty advantages. With Stark technique, that we have modified, we have obtained all these aims, improving at the same time patients' postoperative course as well succeeding to extract the fetus in about five minutes. In the '70 Cohen explained the utility of a transiliac incision allowing the access to abdominal cavity with rectus muscles unsticking in an area in which these muscles should present a less adhesiveness. METHODS: Since 1988 Stark has used Cohen's technique changing however uterus closing times, peritoneal membranes and abdominal walls. Our technique is different since we performed the incision according to Pfannestiel. RESULTS: The times are considerably reduced to 4.8 minutes for fetus extraction and in postoperative time the complications are drastically reduced too (infection, pain, hematoma, adhesions). CONCLUSIONS: Therefore we can surely say that this kind of technique can be used with success in all gynaecological surgery, in extrauterine pregnancies and adnexial tumefactions (not malignant). Personal opinion is that spinal anesthesia is the best analgesic technique.     

Glass Fiber Reinforced Polymer Pultruded Members: Constitutive Model and Stability Analysis

The increasingly widespread use of fiber-reinforced polymers as an alternative to conventional materials makes it necessary to formulate theoretical models which adequately evaluate the influence of the anisotropy of such composites on the structural behavior. While the cross section shapes adopted for compressed members are generally the same as in steel structures, the anisotropy which characterizes these polymers may reduce the critical loading threshold due to local buckling phenomena. A procedure to study the buckling of glass fiber reinforced polymer pultruded members by means of an homogenization approach is proposed here. A two-stage buckling model permits the determination of both global and local critical loads as explicit functions of the member geometry and its material behavior. These functions may be used for optimization of the shape of the above-mentioned members. Besides the model shows its reliability as it fits the results of experimental testson members with different slenderness ratios.     

Scalable fine-grained behavioral clustering of HTTP-based malware

A large number of today’s botnets leverage the HTTP protocol to communicate with their botmasters or perpetrate malicious activities. In this paper, we present a new scalable system for network-level behavioral clustering of HTTP-based malware that aims to efficiently group newly collected malware samples into malware family clusters. The end goal is to obtain malware clusters that can aid the automatic generation of high quality network signatures, which can in turn be used to detect botnet command-and-control (C&C) and other malware-generated communications at the network perimeter.We achieve scalability in our clustering system by simplifying the multi-step clustering process proposed in [31], and by leveraging incremental clustering algorithms that run efficiently on very large datasets. At the same time, we show that scalability is achieved while retaining a good trade-off between detection rate and false positives for the signatures derived from the obtained malware clusters. We implemented a proof-of-concept version of our new scalable malware clustering system and performed experiments with about 65,000 distinct malware samples. Results from our evaluation confirm the effectiveness of the proposed system and show that, compared to [31], our approach can reduce processing times from several hours to a few minutes, and scales well to large datasets containing tens of thousands of distinct malware samples.     

Human–computer interaction in evolutionary visual software analytics

Software evolution is made up of changes carried out during software maintenance. Such accumulation of changes produces substantial modifications in software projects and therefore vast amounts of relevant facts that are useful for the understanding and comprehension of the software project for making additional changes. In this scenario, evolutionary visual software analytics is aimed to support software maintenance, with the active participation of users, through the understanding and comprehension of software evolution by means of visual analytics and human computer interaction. It is a complex process that takes into account the mining of evolutionary data, the subsequent analysis of the mining process results for producing evolution facts, the use of visualizations supported by interaction techniques and the active participation of users. Hence, this paper explains the evolutionary visual software analytics process, describes a framework proposal and validates such proposal through the definition and implementation of an architecture.     

A GRASP metaheuristic for microarray data analysis

The Weighted Gene Regulatory Network (WGRN) problem consists in pruning a regulatory network obtained from DNA microarray gene expression data, in order to identify a reduced set of candidate elements which can explain the expression of all other genes. Since the problem appears to be particularly hard for general-purpose solvers, we develop a Greedy Randomized Adaptive Search Procedure (GRASP) and refine it with three alternative Path Relinking procedures. For comparison purposes, we also develop a Tabu Search algorithm with a self-adapting tabu tenure. The experimental results show that GRASP performs better than Tabu Search and that Path Relinking significantly contributes to its effectiveness.     

A formal approach for checking security properties in SecSpaces

SecSpaces is a Linda-like coordination model whose aim is to provide a support for secure coordination in Open System applications. Substantially it provides a methodology to restrict the access to the objects stored in the shared dataspace. In this paper we introduce a formal language for representing systems interacting via SecSpaces primitives and its operational semantics. Moreover in this context we consider a notion of observational equivalence, namely testing equivalence. In order to evaluate the adequacy of the model for limiting the access to the shared dataspace, we present some examples of interaction protocols that can be used to obtain some security properties (e.g., authentication or privacy of a datum).     

Task allocation and trajectory planning for multiple agents in the presence of obstacle and connectivity constraints with mixed‐integer linear programming

This article addresses the problem of maneuvering multiple agents that must visit a number of target sets, while enforcing connectivity constraints and avoiding obstacle as well as interagent collisions. The tool to cope with the problem is a formulation of model predictive control including binary decision variables. In this regard, two mixed‐integer linear programming formulations are presented, considering a trade‐off between optimality and scalability between them. Simulation results are also shown to illustrate the main features of the proposed approaches.