Parallel Running Research Articles

Scheduling Sequence Control Method Based on Sliding Window in Cyberspace Mimic Defense

Cyberspace Mimic Defense (CMD) is a proactive defense theory proposed in recent years to deal with vulnerability and backdoor threats that are common in information systems. Different from moving target defense (MTD), CMD can obtain foundation by verifying multiple results from isolated, heterogeneous, and parallel running spaces, thus initiating a more targeted defensive action, such as scheduling and structure transformation. However, scheduling sequence control is a severe problem in this process, which needs to select a series of scheduling time and take into account security, efficiency, and robustness for variable attack situations. Inspired by the traffic and congestion control mechanism in computer networks, this paper proposed a sliding window-based scheduling sequence control method. By setting driver events to trigger the window “sliding,” the control parameters update and adapt to the current state accordingly. Then, considering internal resource constraints and external attack situations, a two-factor driver on variable period and exception threshold with their corresponding calculations are specified. Evaluations show that this method can maintain good performance under different scenarios, which proves to be an effective solution for scheduling sequence control in CMD.

Application of Super-Computer Technologies in the Research and Improvement of Steps and Elements of the Flow Path of the Turbocompressors

This paper presents the results of the study of the spatial flow in the turbocompressors elements of computational fluid dynamics methods using the Ansys CFX software package on a multiprocessor computer system. Five objects of research are considered: 1) flow path of an intermediate stage of an average-flow centrifugal compressor; 2) flow path of the low-flow centrifugal compressor stage; 3) a natural gas centrifugal compressor stage; 4) vaned diffuser of the first stage of an industrial multistage centrifugal compressor; 5) adjustable inlet stator of the first stage of an industrial turbocompressors. Generally at manufacturing new centrifugal compressors, it is impossible to make a control measurement of the parameters of the working process inside the flow path elements. Computational fluid dynamics methods are widely used to overcome this difficulties. However verification and validation of CFD methods are necessary for accurate modeling of the workflow. All calculations were performed on one of the SPbPU clusters. Parameters of one cluster: AMD Opteron 280 4 cores. The calculations were carried out with parallel running of the processors: HP MPI Distributed Parallel and HP MPI Local Parallel for different objects.

Spatial versus angular resolution for tractography-assisted planning of deep brain stimulation.

Given the restricted total scanning time for clinical neuroimaging, it is unclear whether clinical diffusion MRI protocols would benefit more from higher spatial resolution or higher angular resolution. In this work, we investigated the relative benefit of improving spatial or angular resolution in diffusion MRI to separate two parallel running white matter tracts that are targets for deep brain stimulation: the anterior thalamic radiation and the supero-lateral branch of the medial forebrain bundle. Both these tracts are situated in the ventral anterior limb of the internal capsule, and recent studies suggest that targeting a specific tract could improve treatment efficacy. Therefore, we scanned 19 healthy volunteers at 3T and 7T according to three diffusion MRI protocols with respectively standard clinical settings, increased spatial resolution of 1.4mm, and increased angular resolution (64 additional gradient directions at b=2200s/mm2). We performed probabilistic tractography for all protocols and quantified the separability of both tracts. The higher spatial resolution protocol improved separability by 41% with respect to the clinical standard, presumably due to decreased partial voluming. The higher angular resolution protocol resulted in increased apparent tract volumes and overlap, which is disadvantageous for application in precise treatment planning. We thus recommend to increase the spatial resolution for deep brain stimulation planning to 1.4mm while maintaining angular resolution. This recommendation complements the general advice to aim for high angular resolution to resolve crossing fibers, confirming that the specific application and anatomical considerations are leading in clinical diffusion MRI protocol optimization.

Optimization design of hydraulic performance in vaned mixed-flow pump

Vaned mixed-flow pump is widely used in industrial and agricultural cases. Considering mixed-flow impeller and space guide-vanes, the impeller and guide-vane blade angles need optimization design. In order to conduct optimization, the global dynamic-criterion algorithm with the ability of parallel running, dynamic criterion and escaping from local-best trap was used in this case. Based on numerical simulation and experimental verification, the 18 parameters' combination was optimized using this algorithm to achieve higher-efficiency in a specific flow rate range around the design condition. The numerical results showed that the weighted efficiency increased from 87.32% to 89.26% and the head coefficient decreased from 0.720 to 0.693. The improved efficiency and reduced head under design requirement helps to reduce the shaft power and energy consumption. The optimized blade inlet angle matches the inlet angle and improves the uniformity of flow in the impeller. The impeller outlet angle matches the guide vane inlet angle. Therefore, the flow regime becomes smoother in the rotor stator interaction region. The experimental results verify that the optimized pump efficiency was 85.75%. The measured head coefficient was 0.643 which meets the design requirement. This study provides a successful work for the green design of impeller and guide-vane of mixed-flow pump.

A precise non-asymptotic complexity analysis of parallel hash functions without tree topology constraints

A recent work shows how we can optimize a tree based mode of operation for a hash function where the sizes of input message blocks and digest are the same, subject to the constraint that the involved tree structure has all its leaves at the same depth. In this work, we show that we can further optimize the running time of such a mode by using a tree having leaves at all its levels. We make the assumption that the input message block has a size a multiple of that of the digest and denote by d the ratio block size over digest size. The running time is evaluated in terms of number of operations performed by the hash function, i.e. the number of calls to its underlying function. It turns out that a digest can be computed in ⌈logd+1(l∕2)⌉+2 evaluations of the underlying function using ⌈l∕2⌉ processors, where l is the number of blocks of the message. Other results of interest are discussed, such as the optimization of the parallel running time for a tree of restricted height.

A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning

The Lax Logical Framework, LLFP, was introduced, by a team including the last two authors, to provide a conceptual framework for integrating different proof development tools, thus allowing for external evidence and for postponing, delegating, or factoring-out side conditions. In particular, LLFP allows for reducing the number of times a proof-irrelevant check is performed. In this paper we give a shallow, actually definitional, implementation of LLFP in Coq, i.e. we use Coq both as host framework and oracle for LLFP. This illuminates the principles underpinning the mechanism of Lock-types and also suggests how to possibly extend Coq with the features of LLFP. The derived proof editor is then put to use for developing case-studies on an emerging paradigm, both at logical and implementation level, which we call fast and loose reasoning following Danielsson et alii [6]. This paradigm trades off efficiency for correctness and amounts to postponing, or running in parallel, tedious or computationally demanding checks, until we are really sure that the intended goal can be achieved. Typical examples are branch-prediction in CPUs and optimistic concurrency control.

The Tsunami Scenario Database of the Indonesia Tsunami Early Warning System (InaTEWS): Evolution of the Coverage and the Involved Modeling Approaches

This study reports on recent developments of the Indonesia Tsunami Early Warning System (InaTEWS), specifically the tsunami modeling components used in the system. It is a dual system: firstly, InaTEWS operates a high-resolution scenario database pre-computed with the finite element model TsunAWI; running in parallel, the system also contains a supra real-time modeling component based on the GPU-parallelized linear long-wave model easyWave, capable of dealing with events outside the database coverage. The evolution of the tsunami scenario database over time is covered in the first sections also touching on the involved capacity building efforts. Starting with a coverage of just the Sunda Arc region, the database now includes scenarios for 15 fault zones. The study is augmented by an investigation of warning products used for early warning; the estimated wave height (EWH) and the estimated time of arrival (ETA). These parameters are determined by easyWave and TsunAWI with model specific approaches. Since the numerical setup of the two models is very different, the extent of variations in warning products is investigated for a number of scenarios, where both pure database scenarios and applications to real events are considered. Finally, the performance of the system in past tsunami events is reviewed to point out major system updates.

OMiCroN – Oblique Multipass Hierarchy Creation while Navigating

Rendering large point clouds ordinarily requires building a hierarchical data structure for accessing the points that best represent the object for a given viewing frustum and level-of-detail. The building of such data structures frequently represents a large portion of the cost of the rendering pipeline both in terms of time and space complexity, especially when rendering is done for inspection purposes only. This problem has been addressed in the past by incremental construction approaches, but these either result in low quality hierarchies or in longer construction times. In this work we present OMiCroN – Oblique Multipass Hierarchy Creation while Navigating – which is the first algorithm capable of immediately displaying partial renders of the geometry, provided the cloud is made available sorted in Morton order. OMiCroN is fast, being capable of building the entire data structure in memory spending an amount of time that is comparable to that of just reading the cloud from disk. Thus, there is no need for storing an expensive hierarchy, nor for delaying the rendering until the whole hierarchy is read from disk. In fact, a pipeline coupling OMiCroN with an incremental sorting algorithm running in parallel can start rendering as soon as the first sorted prefix is produced, making this setup very convenient for streamed viewing.

Offloading Computation for Efficient Energy in Mobile Cloud Computing

Mobile Cloud is giving offices of capacity and remote application facilitating. A few mobile applications are excessively computation concentrated so control utilization issue is basic issue in mobile gadgets. Offloading highlight in Mobile Cloud Computing (MCC) decreased power utilization issues of mobile gadgets. Existing examination works have either utilized fixed mobile gadget speed or does not consider mobile gadget speed in estimation of nearby execution energy. Speed of mobile gadget assumes a noteworthy job in assurance of neighborhood execution energy and it is influenced by parallel running applications and clock recurrence of mobile gadget. Since when there are applications running in parallel, execution speed of mobile isn't fixed. So as to counter these issues, this work misuses Exponential Weighted Mean Moving Average to foresee gadget speed as per load on mobile gadget. We have contrasted proposed work and two kinds of frameworks: Fixed CPU Speed framework where CPU speed of mobile gadget is fixed all through all offloading choices, and Oracle which accept to know definite speed of mobile gadget ahead of time. Assessment of all frameworks is conveyed by utilizing manufactured outstanding tasks at hand.

PLACENTAL ANGIOGENIC FACTORS EXPRESSION IN A MURINE MODEL OF DEXAMETHASONE-INDUCED INTRAUTERINE GROWTH RESTRICTION (IUGR). DOES MELATONIN PREVENT IUGR?

This work describes a general algorithm for a cooperative hyper-heuristics that enables the optimization of systems of nonlinear algebraic equations with algebraic constraints. The hyper-heuristics comprises the following agents: Genetic Algorithms, Simulated Annealing and Particle Swarm Optimization. Information exchanges take place effectively among them since the immediate incorporation of solution candidates speeds up the search. Algorithmic performance is illustrated with general test models, most of them corresponding to process systems that have currently been employed in PSE. When running in parallel, numerical results demonstrate that the collaborative hybrid structure with embedded intelligent learning contributes to improve results in terms of effectiveness and accuracy. The combination of several heuristic optimization approaches into a hyper-heuristics provides enhanced benefits over traditional strategies since this method helps to find proper comprehensive solutions, also contributing to achieve and accelerate convergence.

Binary optimization by momentum annealing.

One of the vital roles of computing is to solve large-scale combinatorial optimization problems in a short time. In recent years, methods have been proposed that map optimization problems to ones of searching for the ground state of an Ising model by using a stochastic process. Simulated annealing (SA) is a representative algorithm. However, it is inherently difficult to perform a parallel search. Here we propose an algorithm called momentum annealing (MA), which, unlike SA, updates all spins of fully connected Ising models simultaneously and can be implemented on GPUs that are widely used for scientific computing. MA running in parallel on GPUs is 250 times faster than SA running on a modern CPU at solving problems involving 100000 spin Ising models.

Analysis of Specific Operation of Circulating Water System in a Power Station

Affected by the continuous decline of the water level and the reform of the condenser, the actual operating conditions of a company’s circulating water pump seriously deviated from the design conditions. Especially in the double pump condition, only one pump can be maintained in normal operation, the other’s current is obviously low and the pump body vibrates greatly, and the double pump cannot be maintained in parallel operation. After several field tests and analysis, it was found that when the running head was between the two pump-inflection points of the parallel running, due to the difference in performance between the pump bodies, one of the circulating water pumps runs normally, while the other pump has a sudden current drop and an increase in pump vibration; at the same time, the two pumps have been running for more than ten years, the performance of the equipment is aging, and the head is insufficient, which is one of the main reasons.

Performance Evaluation of Parallel Bubble Sort Algorithm on Supercomputer IMAN1

Parallel sorting algorithms order a set of elements USING MULTIPLE processors in order to enhance the performance of sequential sorting algorithms. In general, the performance of sorting algorithms are EVALUATED IN term of algorithm growth rate according to the input size. In this paper, the running time, parallel speedup and parallel efficiency OF PARALLEL bubble sort is evaluated and measured. Message Passing Interface (MPI) IS USED for implementing the parallel version of bubble sort and IMAN1 supercomputer is used to conduct the results. The evaluation results show that parallel bubble sort has better running time as the number of processors increases. On other hand, regarding parallel efficiency, parallel bubble sort algorithm is more efficient to be applied OVER SMALL number of processors

Marriage, work, and the invention of family law in English legal thought

This article traces the emergence of family law as an autonomous legal domain within English scholarly legal thought. It provides a genealogy of conceptual and taxonomical change spanning a nearly two-hundred-year period via close readings of a range of legal texts beginning with Blackstone’s Commentaries. The article shows how the invention of English family law hinged on two interrelated shifts in legal thought. One movement involved the staged extrusion of productive work relations (in the narrow sense of work for pay) from the legal household and the re-characterization of those relations as market-based activities exterior to the family and situated within an increasingly freestanding law of master and servant. Running in parallel with that work-related movement was a new emphasis on the public importance of marriage and a corresponding elevation of the husband–wife relation to the forefront of domestic relations. This latter move involved an effort by scholars to distinguish the emerging law of contract (modelled on commercial relations and ideological notions of individual will) from household-based relations that were seen as not ‘properly’ contractual because of the existence of superadded conditions that did not derive from individual will. In particular, scholars began to reframe marriage in terms of status owing to these non-modifiable terms, though contract remained the legal device by which the status of marriage was created. In the early twentieth century, these processes resulted in the complete separation of work and family into the distinct legal domains of family law and employment law.

Dynamic heuristic acceleration of linearly approximated SARSA(lambda ): using ant colony optimization to learn heuristics dynamically

Heuristically accelerated reinforcement learning (HARL) is a new family of algorithms that combines the advantages of reinforcement learning (RL) with the advantages of heuristic algorithms. To achieve this, the action selection strategy of the standard RL algorithm is modified to take into account a heuristic running in parallel with the RL process. This paper presents two approximated HARL algorithms that make use of pheromone trails to improve the behaviour of linearly approximated SARSA(lambda ) by dynamically learning a heuristic function through the pheromone trails. The proposed dynamic algorithms are evaluated in comparison to linearly approximated SARSA(lambda ), and heuristically accelerated SARSA(lambda ) using a static heuristic in three benchmark scenarios: the mountain car, the mountain car 3D and the maze scenarios.

Virtual keyboard based on a brain-computer interface

This paper proposes a novel LabVIEW based algorithm regarding the implementation of an eye-blinks strength controlled virtual keyboard aimed to help people with neuromotor disabilities. The application can be considered a brain-computer interface which is useful for the assistance of patients suffering from Locked-In syndrome or amyotrophic lateral sclerosis. A precise, repeatable and easily detectable control signal could be the eye-blink strength. The LabVIEW based virtual keyboard provides the following features: detection and counting the voluntary eye-blinks, switch command, select command, highlight action running in parallel with the previously mentioned processes, enabling cancel, delete and space commands. The working principle underlying the implementation of the proposed virtual keyboard is Divide and Conquer paradigm. Thus, it is possible the switching task across the rows, half rows and keys (characters) in order to select a row, half row, respectively key associated to the character that should be introduced in the text box.

Embedding Constrained Model Predictive Control in a Continuous-Time Dynamic Feedback

This paper introduces a continuous-time constrained control strategy, which mimics the behavior of a traditional model predictive control scheme using dynamic feedback. The approach is based on the idea that the solution of the optimal control problem can be embedded in the internal states of a dynamic control law running in parallel to the system. Using input-to-state stability arguments, it is shown that if the controller dynamics are sufficiently fast with respect to the plant dynamics, the interconnection between the two systems is asymptotically stable. Additionally, it is shown that, by augmenting the proposed scheme with an add-on unit known as an explicit reference governor, it is possible to guarantee recursive feasibility and limit the residual of the optimal control problem, regardless of any changes in the desired set point. Numerical examples featuring aerospace applications demonstrate the effectiveness of the proposed scheme.

An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems

The set of all nondominated solutions for a multi-objective integer programming (MOIP) problem is finite if the feasible region is bounded, and it may contain unsupported solutions. Finding these sets is NP-hard for most MOIP problems and current methods are unable to scale with the number of objectives. We propose a deterministic exact parallel algorithm for solving MOIP problems with any number of objectives. The proposed algorithm generates the full set of nondominated solutions based on intelligent iterative decomposition of the objective space utilizing a particular scalarization scheme. The algorithm relies on a set of rules that exploits regional dominance relations among the decomposed partitions for pruning. These expediting rules are both used as part of a pre-solve step as well as judiciously employed throughout the parallel running threads. Using an extensive test-bed of MOIP instances with three, four, five, and six objectives, the performance of the proposed algorithm is evaluated and compared with leading benchmark algorithms for MOIPs. Results of the experimental study demonstrate the effectiveness of the proposed algorithm and the computational advantage of its parallelism.

SMITER: A field-line tracing environment for ITER

Built around the SMARDDA modules for magnetic field-line tracing [IEEE Tr. Plasma Sc. 42 (2014) 1932], the SMITER code package (SMARDDA for ITER) is a new graphical user interface (GUI) framework for power deposition mapping on tokamak plasma-facing components (PFC) in the full 3-D CAD geometry of the machine, taking as input a user-defined specification for parallel heat flux in the scrape-off layer (SOL) and a description of the equilibrium magnetic flux. The software package provides CAD model import and integration with the ITER Integrated Modelling and Analysis Suite (IMAS), parametric CAD components catalogue and modelling, CAD de-featuring for PFC surface extraction, meshing, visualization (using an integrated ParaView module), Python scripting and batch processing, storage in hierarchical data files, with several simulation cases in one study running in parallel and using message passing interface (MPI) for code speed-up. An integrated ParaView module can combine CAD geometry, magnetic field equilibrium, meshes and results for detailed setup analysis and a module is under development for full finite element computation of surface temperatures resulting from the power deposition patterns on 3-D PFCs. The code package has been developed for ITER, but can be deployed for similar modelling of any tokamak. This paper presents and discusses key features of this field-line tracing environment, demonstrates benchmarking against existing field-line tracing code and provides specific examples of power deposition mapping in ITER for different plasma configurations.

What factors promote or inhibit implementation of a new procedure for screening and treatment of malnutrition in community settings? A prospective process evaluation of the Implementing Nutrition Screening in Community Care for Older People (INSCCOPe) project (UK)

IntroductionMalnutrition remains underdetected, undertreated and often overlooked by those working with older people in primary care in the UK. A new procedure for screening and treatment of malnutrition is currently...