Strategic environmental assessment in Romania: between benefits and constraints

This paper offers an overall picture of the importance of Strategic Environmental Assessment (SEA) in Romania and its opportunities and constraints. The role, scope and effectiveness of SEA in Romania are presented in two good practice examples and examined in order to highlight the strengths and weaknesses of the procedure at national and local scale. In practice, the number of SEA procedures is very high due to the legislation in force, and it is increasingly effective in decision-making about programmes and plans. SEA can be viewed as a great opportunity for the implementation of sustainable development in practice. It also continues to be an important procedural and decisional instrument for management and monitoring of socioeconomic development, spatial planning and environmental protection in Romania.     

(DNA) computing by carving

 Inspired by the experiments reported recently in the emerging area of DNA computing, we consider a somewhat unusual type of a computation strategy: generate a (large) set of candidate solutions of a problem, then remove the non-solutions such that what remains is the set of solutions. We call this a computation by carving. This leads both to a speculation with possible important consequences and to interesting theoretical computer science (formal language) questions. The speculation is that in this way we can “compute” non-recursively enumerable languages, because the family of recursively enumerable languages is not closed under complementation. The formal language theory questions concern sequences of languages with certain regularities, needed as languages to be extracted from the total language of candidate solutions of a problem. Specifically, we consider sequences of languages obtained by starting from a given regular language and iteratively applying to it a given finite state sequential transducer (a gsm). Computing by carving with respect to such a sequence of languages can identify all context-sensitive languages and can also lead to non-recursively enumerable languages (but not all recursively enumerable languages can be obtained in this way). In practical circumstances, the carving process should be finite, hence, in general, approximations of the desired language are obtained. We also briefly discuss this aspect.     

Small networks of polarized splicing processors are universal

In this paper, we consider the computational power of a new variant of networks of splicing processors in which each processor as well as the data navigating throughout the network are now considered to be polarized. While the polarization of every processor is predefined (negative, neutral, positive), the polarization of data is dynamically computed by means of a valuation mapping. Consequently, the protocol of communication is naturally defined by means of this polarization. We show that networks of polarized splicing processors (NPSP) of size 2 are computationally complete, which immediately settles the question of designing computationally complete NPSPs of minimal size. With two more nodes we can simulate every nondeterministic Turing machine without increasing the time complexity. Particularly, we prove that NPSP of size 4 can accept all languages in NP in polynomial time. Furthermore, another computational model that is universal, namely the 2-tag system, can be simulated by NPSP of size 3 preserving the time complexity. All these results can be obtained with NPSPs with valuations in the set \(\{-1,0,1\}\) as well. We finally show that Turing machines can simulate a variant of NPSPs and discuss the time complexity of this simulation.     

Optimization of Pocket Geometry for Friction Reduction in Piston–Liner Contacts

It has recently been shown that rectangular surface pockets are effective in reducing friction in a piston–liner type contact, providing that they are oriented with their long axis transverse to the sliding direction so that entrained features fit completely within the contact area (Vl?descu, et al., Tribology International, 82, 28–42, 2015; Vl?descu, et al., Tribology International, 115, 140–153, 2017). The aim of the current study was to identify the optimal geometric parameters of theses rectangular features. To do this, a friction rig that simulated a piston–liner contact under highly controlled conditions was used to test a series of textured specimens with pockets of different depth, breadth and density. Each of these geometric parameters was varied and tested independently, while keeping the other two constant. Experimental conditions were set in order to place the contact in different lubrication regimes.

Results were analyzed to determine a set of criteria for the optimum pocket geometry; however, this was shown to change depending on the test conditions and should therefore be adjusted depending on the position along the stroke. Specifically, at low speed when the contact is operating under boundary lubrication, pockets should be deep, wide, and densely spaced. This confirms recent findings, which suggested that, in this regime, pocket volume is often a more critical parameter than depth, width, or spacing individually. Conversely, under mixed lubrication toward the transition to the full film regime, pockets should be narrow and sparsely spaced. These results also explain the difficulties encountered in several previous studies that attempted to define a single optimum pocket geometry.

Finally, the impact of pocket position relative to reversal was assessed for various lubrication conditions. This revealed how pockets should be placed close to, but not directly at, top and bottom dead center to provide a beneficial squeeze film, which is present at reversal.     

Assume,guarantee or repair: a regular framework for non regular properties

We present Assume-Guarantee-Repair (AGR)—a novel framework which verifies that a program satisfies a set of properties and also repairs the program in case the verification fails. We consider communicating programs—these are simple C-like programs, extended with synchronous actions over communication channels. Our method, which consists of a learning-based approach to assume–guarantee reasoning, performs verification and repair simultaneously: in every iteration, AGR either makes another step towards proving that the (current) system satisfies the required properties, or alters the system in a way that brings it closer to satisfying the properties. To handle infinite-state systems we build finite abstractions, for which we check the satisfaction of complex properties that contain first-order constraints, using both syntactic and semantic-aware methods. We implemented AGR and evaluated it on various communication protocols. Our experiments present compact proofs of correctness and quick repairs.

     

Malware clustering using suffix trees

Clustering is an important problem in malware research, as the number of malicious samples that appear every day makes manual analysis impractical. Although these samples belong to a limited number of malware families, it is difficult to categorize them automatically as obfuscation is involved. By extracting relevant features we can apply clustering algorithms, then only analyze a couple of representatives from each cluster. However, classic clustering algorithms that compute the similarity between each pair of samples are slow when a large collection is involved. In this paper, the features will be strings of operation codes extracted from the binary code of each sample. With a modified suffix tree data structure we can find long enough substrings that correspond to portions of a program’s code. These substrings must be filtered against a database of known substrings so that common library code will be ignored. The items that have common substrings above a certain threshold will be grouped into the same cluster. Our algorithm was tested with data extracted from real-world malware and constructed quality clusters.     

Investigations on Sweet Cherry Phenolic Degradation During Thermal Treatment Based on Fluorescence Spectroscopy and Inactivation Kinetics

Five anthocyanins were detected in the sweet cherry extract as follows: cyanidin 3-rutinoside, cyanidin 3-glucoside, peonidin 3-rutinoside, peonidin 3-glucoside, and pelargonidin 3-rutinoside, whereas the cyanidin 3-rutinoside was found to be in the highest amount. The effect of thermal treatment on the degradation of the polyphenolic compounds in sweet cherry extract was investigated in the range of 70–120 °C by means of fluorescence spectroscopy and spectrophotometric techniques. The fluorescence spectra were dominated by emission bands with maximum ranging from 356 nm at 25 °C to 350 nm at 110 °C. The heating of sweet cherry extract resulted in structural changes that led to a significant decrease in fluorescence intensity when increasing temperature. Degradation rate constants were estimated using a fractional conversion kinetic model. The activation energy values revealed a higher-temperature dependence of antioxidant activity, followed by anthocyanins, total polyphenols, and total flavonoids.