Search

Abstract: The paper describes a system for executable papers for publishers enabling them to reuse content and to generate further advances of science and engineering. The executable algorithmic descriptions within a paper are presented in natural language sentences and basic code, thereby making long term compatibility absolute. Authors are required to use publicly numerical libraries on the Internet or references to publications with executable papers. As used by authors the system automatically creates a web of algorithmic knowledge on the Internet. Novelty of new algorithms in publications can be evaluated by automated tools available to authors, reviewers and readers of scientific papers published. [Copyright &y& Elsevier]

Abstract: Adessowiki is a collaborative platform for scientific programming and document writing. It is a wiki environment that carries simultaneously documentation, programming code and results of its execution without any software con- figuration such as compilers, libraries and special tools at the client side. This combination of a collaborative wiki environment, central server and execution of code at rendering time enables the use of Adessowiki as an executable paper platform, since it fulfills the need to disseminate, validate, and archive research data. [Copyright &y& Elsevier]

• Hand and finger determination will expedite identification on isolated fingerprints. • Determining the hand in fingerprints with a two or one-delta pattern is possible. • Hand determination from isolated fingerprints is possible. The individuality and permanence of fingerprints make of them a very useful feature in the identification of individuals. There are now automated computer programmes that allow a quick comparison between a fingermark and a database. However, in order to assess the strength of evidence in fingerprint identification, complementary information on the frequencies of the different morphological features of the dermopapillary ridges is required. This idea is used in this work as a starting point to evaluate the frequencies of the parameters used in the determination of the hand and finger in a large sample of 2600 fingerprints taken from 134 male and 127 female Spanish population. Based on these fingerprints, the frequencies of different categories of the following parameters were obtained: type of pattern, slope of the apex ridge, subtype of two-delta pattern, ridge tracing, major angle, major ridge count, bisector, rotation of the central ridge, assimilation to loops and slant. Moreover, the results have shown that these characters are useful for the determination of the hand in whorls (two-delta pattern) and loops (one-delta pattern), but not for the determination of the finger. The most useful and classificatory parameter when determining the hand of origin of a two-delta fingerprint is the slope of the apex ridge, and for the one-delta pattern, knowing the location of the delta allows the correct estimation of the hand of a fingerprint in more than 93% of the cases. The data presented in this paper are novel and can be used by latent print examiners to improve the statistical basis of their decisions in reaching conclusions. [ABSTRACT FROM AUTHOR]

With the sustainable development being a consensus in human society, assessment of healthy development index in urban cities (HDI-UC) has been a hot concern in academia. Existing research works had proposed some assessment models from the perspective of sociology. However, these approaches can just assess HDI-UC values of current year and past years, as they relied on complete index systems. They failed to possess the ability to directly assess HDI-UC values in future years. To bridge such gap, this paper proposes a smart assessment and forecasting framework for HDI-UC. On the one hand, an assessment model proposed in a previous study is introduced as the basic model. On the other hand, the Gaussian process regression is utilized to model the evolving HDI-UC sequence, so that HDI-UC values in future years can be directly forecasted according to historical ones. A case study is conducted on real-world statistical data collected from some regions of China to illustrate assessment process of the framework. Besides, another group of experiments are also carried out to evaluate forecasting performance. The simulation results show that prediction error of SAF-HDI is around 5 %, which is within an acceptable range. • Smart assessment and forecasting framework for index of cities • A machine learning method for rapid forecasting • Simulative analysis via computer programming [ABSTRACT FROM AUTHOR]

In the complex field of radiotherapy (RT), ensuring patient safety is paramount. Recognizing the critical need for disseminating knowledge on potential failure modes (FMs) in RT, our study introduces i-SART (intelligent Safety Assistant in RT), a web application empowered by AI, aiming to promote proactive risk management and patient safety awareness. The objective of this work is to describe i-SART's development and deployment strategy and discuss its potential implications. The i-SART design is based on the Failure Modes and Effects Analysis methodology (FMEA) and the AAPM TG100, whilst integrating AI techniques to engage RT professionals in an interactive learning process. I-SART is built upon a database populated with potential FMs in the RT process and associated techniques, including MR-guided Adaptive RT, extracted from 10 papers and safety reports. The application, developed using Python 3.9 and the Django REST framework, features two user roles: administrator and user. Secure information transfer was ensured through JSON Web Token authentication. MySQL relational database was chosen for persistent user and FM information storage. The user interface of i-SART was created using Vue.js, an interpreted computer programming language-based framework. An AI-driven chatbot facilitates discussions about FMs and safety measures. Experiments with AI techniques such as Markov Chains and Generative Adversarial Networks were conducted to generate synthetic FMs. This is a collaborative effort between two European Universities. The application collects data and organizes a database of potential FMs and their attributes (causes, effects, severity and mitigation strategies) in RT procedures. Initially, 728 FMs were collected which were then reduced to 419 after the removal of duplicates and ambiguities. The application provides users with functionalities for searching, filtering, and sorting FMs, as well as contributing new FMs for continuous database growth. The AI-driven chatbot is anticipated to enhance user engagement and knowledge dissemination. The experiments with AI techniques for synthetic FMs resulted in limited outcomes due to the small training dataset. I-SART's effectiveness will soon be evaluated by users and stakeholders. I-SART is a promising conversational tool for enhancing patient safety in RT through proactive risk management. Future work involves expanding the database and exploring integration with other risk management methodologies. We anticipate i-SART to drive further research in integrating AI techniques in RT risk management and providing a substantial dataset for machine learning applications, FMs predictions and synthetic FMs generation. [ABSTRACT FROM AUTHOR]

This paper presents a simple methodology for determining the optimal design of an elastic funicular arch under point loads and selfweight for maximum in-plane buckling capacity. This class of optimization problem has hitherto not been investigated. The cross-section of the arch is assumed to be geometrically similar and constant through its entire length. The arch is assumed to be inextensible. The supporting points of the arch may be either pinned or fixed. The methodology for determining the optimal arch shape involves first finding the funicular shape of the arch under point loads and selfweight. Next, the arch is modelled by the Hencky bar chain model (HBM) for the buckling analysis. The HBM is adopted because it eliminates the requirement for formulating the governing equation for buckling and it is a straightforward model to comprehend and implement in a computer code. Each funicular arch shape is specified by a horizontal force value, and it has to be optimally selected to maximise the buckling capacity of the arch. As it is a single parameter optimization problem, the Golden Section search was used to determine the optimal horizontal force, and hence the optimal funicular arch shape. The methodology is illustrated by solving two example problems: (1) an arch under a point load and selfweight and (2) a symmetric arch under two equal point loads and selfweight. By solving the self-buckling problem of a catenary arch, the maximum spanning capacity of the catenary arch can be obtained as shown herein. • Paper outlines a method for designing elastic funicular arches to optimize buckling capacity. • Arch supportings can be pinned or fixed, offering design flexibility. • Method finds funicular arch shape under seflweight and point loads for analysis. • Paper uses Hencky bar chain model for buckling analysis, simplifying governing equations. • Method demonstrates with two examples: an arch under point load and selfweight, and a symmetric arch under two equal point loads and selfweight. [ABSTRACT FROM AUTHOR]

In computer programming, a pure function is a function that has no side-effects. Pure actions, which are assimilated to pure functions, play an important role within the SARL agent-programming language. Indeed, several constructs of the language, e.g. the guard conditions of the event handlers, cannot contain calls to unpure actions. In many existing languages, the purity of the action is declared by the developer, who could put a marker on the action in some languages, or simply implicit. The contribution of this paper is an algorithm to automatically determine if an action is pure in order to allow the SARL compiler to mark the actions as pure for the developer. The proposed algorithm is successfully implemented in the SARL compiler. [ABSTRACT FROM AUTHOR]

This paper examines the results in case of breaking wave groups reported in Sriram et al. (2015) against a wave breaking model called Tian–Barthelemy model (Seiffert and Ducrozet, 2017). In this paper, Tian–Barthelemy model is extended to incorporate (Schäffer, 1996) corrections to linear wave making signals for generating focused wave groups and implemented in an open source computer code for high order spectral (HOS) method based numerical wave tank (NWT) viz., HOS-NWT. The developed model is then studied in the context of wave breaking in dispersively focused intermediate water wave groups with particular focus on multiple wave breaking events. The adapted model performs well in conformity with experimental observations in Sriram et al. (2015). A range of kinematic thresholds are studied with this model to calibrate the right threshold for the model against the experiments. We find strong evidence of a non-breaking wave group in intermediate depths crossing the kinematic threshold of 0.85 (stated in Seiffert and Ducrozet (2017)), implying that this threshold is not universal for intermediate depths. It is also shown that the model does not interfere with the spurious free wave suppression. However, various dynamic and kinematical aspects of this study reveal that suppression of spurious free wave makes the short waves dominant in the lead up to breaking. Hence, the model detects numerous threshold exceedences implying plausibly more wave breaking instances. It is also shown that this model in general violates the spectral signature of breaking in a dispersively focused wave. • Tian–Barthelemy wave breaking model extended to second order wavemaking in HOS. • The model preserves suppression of spurious free waves with Schäffer correction. • Onset of wave breaking parameter studied in context of multiple wave breaking. • Extended model is calibrated for intermediate depth water wave groups. • The onset parameter shows considerable scatter in intermediate water depths. [ABSTRACT FROM AUTHOR]

In this paper we describe and show the results of a novel activity on the validation of numerical codes for the low frequency electromagnetic analysis of ITER components. The aim of the activity is to propose a set of problems focused on induced currents in nonlinear materials and on hysteresis behaviours. For this purpose, already existing benchmark problems are considered and new ones are developed for specific investigations. The TEAM (Testing Electromagnetic Analysis Methods) problems 10 and 32 from the COMPUMAG society have been tested, together with an ad hoc problem proposed by one of the authors. Four computer codes (EleFAnT3D, ANSYS EMAG, ANSYS Maxwell, COMSOL Multiphysics) have been used and results obtained have been compared. Globally a good agreement among results obtained with the numerical codes and also with experimental data has been found, but some small deviation and peculiarities have been observed which are discussed in the paper. [ABSTRACT FROM AUTHOR]

• The paper corrects discrepancies in the difference equations of the previously suggested model of theta-burst stimulation. • The corrected stages are consistently calibrated to experimental data to serve for quantitative analysis. • This work improves the model accuracy in various conditions and secures the model that underlies a rich body of research. Calcium dependency is presently an essential assumption in modelling the neuromodulatory effects of transcranial magnetic stimulation. Y.Z. Huang et al. developed the first neuromodulation model to explain the bidirectional effects of theta-burst stimulation (TBS) based on the postsynaptic intracellular calcium concentration elevation. However, we discover that the published computer code is not consistent with the model formulation, neither do the parameters and derived plots consequently match the formulations. Here we intend to fix the computer code and re-calibrate the model. We corrected the affected difference equations and re-calibrated the revised model with experimental data using non-convex optimisation based on a L 2 penalty. The revised model outperforms the initial model in characterising the relative motor-evoked potential levels of TBS-induced after-effects in various conditions. We corrected the inconsistencies in the previous model and computer code and provided a complete calibration to support the research that is based on it. This work improves the accuracy and secures the scope of the model, which is necessary to retain a rich body of research resulting from the model. Furthermore, this model provides both a quantitative model for several parameters of TBS and a basic model foundation for future refinement. [ABSTRACT FROM AUTHOR]

Electron-loss (EL) and electron-capture (EC) cross sections of neutral and low-charged heavy Sr q + , Ba q + and Nd q + ions with charges q = 0, 1 and 2 in collisions with He atoms are predicted in the energy range E = 50 eV/u–10 GeV/u. Experimental data on EL and EC cross sections of these particles colliding with He atoms are practically absent. At relatively low energies E = 8–30 keV, EL cross sections σ 12 of Sr 1 + , Ba 1 + and Nd 1 + ions are predicted from new experimental equilibrium charge-state fractions F 1 and F 2 and calculated EC cross sections. Predicted value for Ba 1 + ions, σ 12 = 6. 8 ⋅ 1 0 − 18 cm 2 , is in a good agreement with the one available experimental point σ 12 exp = 5. 7 ⋅ 1 0 − 18 cm 2 at E = 20 keV (Fedorenko, 1954). Calculations of EL and EC cross sections are performed by available computer codes shortly described in the paper. Theoretically estimated neutral-atom fractions F 0 are found much smaller than the measured F 1 , F 2 , and F 3 charge-state fractions. [ABSTRACT FROM AUTHOR]

• Nonlinear, finite deformation, and finite element framework for electrostrictive DEs. • Using one of the most complete constitutive models for electrostrictive DEs. • Enhancing the performance of DEAs. • Lowering the operating voltage of DEAs. • Illustrating the fields of the dielectric permittivity tensor over the deformed DEAs. In this paper, we have developed a numerical framework to investigate the effects of the electrostriction phenomenon on the deformations of three-dimensional dielectric elastomer actuators with complex geometries and inhomogeneous displacement fields at finite strains. The finite element method has been used to solve the governing equations. In this investigation, we adopt one of the most complete constitutive equations with regard to the electrostrictive behavior of dielectric elastomers which is capable of analyzing general three-dimensional states of deformation. The terms emerging in the tangent stiffness matrix as a result of the electrostrictive model are fully derived in this study. The implementation of the finite element modeling is conducted via an in-house computer code. Three three-dimensional actuators, namely a bending actuator, a buckling actuator, and a torsional actuator are selected to demonstrate the capabilities of the numerical framework. In conclusion, we have proved that the electrostriction phenomenon is effective in terms of improving the performance of dielectric elastomer actuators and in lowering their operating voltage. Moreover, the relationship of the diagonal entries of the permittivity tensor and the left Cauchy-Green tensor have been depicted on the deformed bodies of the actuators. [ABSTRACT FROM AUTHOR]

• A novel direct sensitivity analysis method based on the forward recursive formulation for flexible multibody systems is developed. • A computational scheme is presented to improve the efficiency of sensitivity analysis by using the approximate tangent stiffness matrix. • The validity and efficiency of the presented method are verified by numerical examples. Sensitivity analysis plays a significant role in the dynamic optimization of flexible multibody systems. The forward recursive formulation (FRF) is widely used for the dynamic modeling of multibody systems. However, it has not yet been extended to sensitivity analysis. In this paper, a new direct differentiation method is developed based on FRF for flexible multibody systems sensitivity analysis. The recursive nature of FRF allows for the Jacobian derivatives to be derived recursively, with detailed matrix expressions provided to facilitate implementation in computer code. The validity and correctness of the presented direct sensitivity analysis method based on FRF are verified by numerical examples. Besides, a modified staggered direct scheme is presented to improve the efficiency of the sensitivity analysis. In this scheme, different update strategies are adopted by different components of the tangent stiffness matrix for the implicit integrator, which balances the iteration performance and the additional computational cost. The presented scheme is compared with two conventional schemes through three examples. It demonstrates that the presented scheme can significantly improve the computational efficiency of the sensitivity analysis, particularly for complex problems, when the appropriate update strategies are employed. [ABSTRACT FROM AUTHOR]

Over the last half century, the main application of Brain–Computer Interfaces (BCIs) has been controlling wheelchairs and neuroprostheses, or generating text or commands for people with restricted mobility. There has been very limited attention in the field to applications for computer-aided design (CAD), especially in the built environment, despite the potential of BCIs to provide a new form of environmental interaction. This paper introduces Neuron, a BCI tool that enables designers with little experience in neuroscience or computer programming to: (1) gain access to neurological data, along with established metrics relevant to design; (2) create BCI interaction prototypes, both with digital on-screen objects and physical devices; and (3) evaluate designs based on neurological information and record measurements for further analysis. After detailing the BCI tool's development, the article showcases its capabilities through two case studies within the architectural design and built environment, followed by an evaluation of the tool's performance and a discussion of its implications, limitations, and areas for future improvement. • A BCI software tool was developed for EEG data acquisition, signal processing, feature extraction, and visualization. • NEURON enables brain-controlled generative design process • NEURON enables BCI prototyping for intelligence control system with visual programming • NEURON provides an accessible platform for integrating BCI into design, promoting interdisciplinary research and practical applications [ABSTRACT FROM AUTHOR]

The paper presents a new simple modeling approach for studying the monotonic response of RC beam-column joints externally strengthened by Fiber Reinforced Polymer (FRP) materials. The approach assumes a parallel combination of the behavior of the joint in the unstrengthened configuration and the contribution of strengthening system. To achieve this, the common scissor model, where the behavior of joint shear panel is modeled through a rotational spring, is here modified by introducing an additional spring, arranged parallel to the concrete spring, to account for the contribution of strengthening system. Regarding the behavior of the additional spring, the authors proposed a multilinear simplified constitutive law by appropriately combining analytical models available from the literature with specific guidelines provided by Italian technical standards. The proposed model, implemented in the computer code OpenSees and validated against experimental case studies from the literature, demonstrates its strong capability to capture the contribution of the strengthening system on both the strength and ductility of joints. • A new numerical model for the study FRP-strengthened RC joints is proposed. • The proposed model is based on the so-called scissor model. • A simplified constitutive law for the spring reproducing FRP is proposed. • A comparison between numerical and experimental results is carried out. [ABSTRACT FROM AUTHOR]

Abstract This paper presents seven concurrent hash table implementations in Haskell, ranging from low-level synchronization mechanisms to high-level ones such as transactional memories. The hash tables were compared using different initial sizes, load factors, data types and hash functions. We also present a case study on implementing a color palette algorithm using the hash tables. The result of the comparison between the algorithms shows that the implementation using the STM Haskell transactional memory library and fine-grain synchronization provides the best performance and good scalability, followed by the implementation using lock striping and MVars. Highlights • The paper describes seven concurrent hash table implementations in Haskell. • Different abstractions were used: MVars, compare and swap, and transactional memory. • Detailed performance comparison of the hash tables is presented. • STM Haskell with fine-grain synchronization shows the best performance in overall. [ABSTRACT FROM AUTHOR]

Highlights • An uncertain resource allocation-targets setting approach is proposed. • Uncertainties of resources and targets are modeled using type-II & type I fuzzy sets. • Fuzzy De-Novo programming for resource allocation and target setting is developed. • A real case of the natural gas supply chain is analyzed. Abstract Developing effective approaches to design optimal resources of system based on the concepts of benchmark in DEA and optimal design in De-Novo programming is one of the important managerial decision making problems. In this paper, a decision support system is developed for allocation of resources and setting the targets across a set of entities in an equitable manner in presence of uncertainty. The proposed approach has two main modules. First, the most suitable system is designed using De-Novo programming. De-Novo programming. De-Novo programming is used to optimally determine the inputs (i.e., resources) and outputs (i.e., targets) of DMUs in network DEA rather than optimizing existing DMUs. Then, the optimal values of resources are allocated and optimal values of the targets are set in a complex network structure. Furthermore, in real-world problems budget of resources and targets are usually mixed with uncertainties, so in this paper, two concept of fuzzy and interval type-II fuzzy resources and target are developed for resource allocation and target setting. Finally numerical example based on real case of natural gas supply chain is also used to evaluate the applicability and efficacy of the proposed models. Graphical abstract Image, graphical abstract [ABSTRACT FROM AUTHOR]

Many of the existing management platforms such as pervasive computing systems implement policies that depend on dynamic operational environment changes. Existing formal approaches for automatically enforcing access control policies are primarily expressed in conventional logic programming, also known as monotonic logics, e.g., First Order Logic (FOL). The major issue with monotonic logics is that they are not devised to invalidate initial believes in the light of further observations. This limitation makes these traditional logical approaches less suitable for modeling and analyzing context-aware access control policies, where exceptional policies are introduced incrementally and adaptively during runtime. The inability to invalidate initial policies when an exception needs to be enforced might result in inconsistencies and violations that need to be resolved manually by human entities. To address the problems with conventional logical approaches and more importantly prevent such inconsistencies, this paper presents a non-monotonic logic-based reasoning scheme for modeling and analyzing adaptive access control policies. In the proposed formalism, unavailable context data and incomplete access control policies can be explicitly expressed. To do so, the paper distinguishes three kinds of policies: default, context-dependent and exception policies. The proposed formalism is based on Answer Set Programming (ASP), a non-monotonic logic programming language that allows elegant representation of unavailability of context data in adaptive systems. We devise non-monotonic policy inference rules such that, when exception policies are defined, they take precedence over default and context-dependent policies automatically. The results of two case studies are reported to demonstrate the feasibility of the proposed policy representation scheme compared to the Organizational-Based Access Control (OrBAC) model. [ABSTRACT FROM AUTHOR]

Highlights • This paper discusses the generation of depletion of radioisotopes in the nuclear reactor. • This is basically the problem of solving nonlinear Bateman equations. • In this paper, Klopfenstien-Shampine numerical differentiation formula are used for solving these Bateman equations. • This method does not have the limitations of partitioning of the fission products, linearizing the decay chains or linearizing the Bateman equations. Abstract Pressure tube type heavy water reactors (PT-HWRs) with Natural Uranium (NU) fuel, similar to conventional CANDU (CAN ada D euterium U ranium) reactor of small and large sizes are operated successfully worldwide. Various nations have their nuclear program based on a closed fuel cycle. Therefore it is important to know the exact concentration, decay heat, radio-toxicity and radioactivity of all isotopes produced over the fuel cycle. To this end, a computer code is being developed with advanced capabilities on MATLAB-14 platform using Klopfenstien-Shampine family of Numerical Differentiation Formula (KS family of NDFs). In this paper, efforts are taken to highlight on the develop of an indigenous computer code IGDC: I sotopic G eneration and D epletion C ode" to perform the fuel cycle studies for fuel irradiated in 220 MWe class PT-HWRs. [ABSTRACT FROM AUTHOR]

In order to make use of the advantages of optical computing and promote the application and popularization of Ternary Optical Computer (TOC), this paper proposes a new computing-data model, presents the corresponding computing-data file in detail, and gives the implementation method of programming application with the model files. It tries to set up a bridge between users and TOC. Experimental results show that the model presented in this paper is correct and the implementation method is feasible. The model can better simplify TOC’s application process, and allow users to apply TOC to carry out various computational applications without needing to understand any details of optical implementation. [ABSTRACT FROM AUTHOR]

Abstract Many metrics have been proposed to measure coupling—the degree of association between modules in a system. They have often been described in different ways, hindering comparison and research. Their definitions are often incomplete regarding language features in some languages, meaning that different tool developers may implement the same metric differently. This complicates comparing results from studies that use different tools. This paper therefore aims to define coupling metrics consistently and unambiguously. The paper describes a model of coupling that uses the reification of the concept of dependency as its fundamental unit. Based on this model, it defines a framework for defining coupling metrics. It shows how to define several well-known coupling metrics in the framework, and how defining different metrics based on the same model facilitates direct comparisons. It discusses how the framework resolves issues due to incomplete metric definitions, such as different language features. This formal framework is sufficiently simple that it can be implemented in such a way as to provide multiple metrics. [ABSTRACT FROM AUTHOR]

Highlights • More than 150 papers dealing with applications of GP in water resource engineering were reviewed. • Fundamentals of GP variants were provided and compared with each other. • Selection ways of GP parameters were discussed. • Future scope of studies were demonstrated. Abstract The state-of-the-art genetic programming (GP) method is an evolutionary algorithm for automatic generation of computer programs. In recent decades, GP has been frequently applied on various kind of engineering problems and undergone speedy advancements. A number of studies have demonstrated the advantage of GP to solve many practical problems associated with water resources engineering (WRE). GP has a unique feature of introducing explicit models for nonlinear processes in the WRE, which can provide new insight into the understanding of the process. Considering continuous growth of GP and its importance to both water industry and academia, this paper presents a comprehensive review on the recent progress and applications of GP in the WRE fields. Our review commences with brief explanations on the fundamentals of classic GP and its advanced variants (including multigene GP, linear GP, gene expression programming, and grammar-based GP), which have been proven to be useful and frequently used in the WRE. The representative papers having wide range of applications are clustered in three domains of hydrological, hydraulic, and hydroclimatological studies, and outlined or discussed at each domain. Finally, this paper was concluded with discussions of the optimum selection of GP parameters and likely future research directions in the WRE are suggested. [ABSTRACT FROM AUTHOR]

The concept behind agrivoltaics, the use of photovoltaics (PV) with agriculture to simultaneously produce electric power and food, was first introduced by Goetzberger and Zastrow (1982) (GZ), who developed models for shading effects of fixed, opaque, monofacial PV panels on beam and diffuse solar radiation reaching the ground. This article has been cited by many since 2000. However, since then nearly all authors of related papers that cited GZ have not adopted the GZ models. Instead, ray-tracing and other methods have been used in custom computer codes. The reasons might be rooted in limitations of GZ assumptions or the need for algorithms to accommodate individual experiments and systems. Another may be lack of a complete expression for a key angle in the shadowing problem and an integral expression for diffuse solar fraction that produces suspicious results in GZ. In this work we provide a simpler, complete, and validated model for the diffuse solar fraction, add insight into the interactions between a panel and its neighbors, and the number of PV panels needed through shadowing to reach an asymptotic value. By normalizing the problem, plots of diffuse and beam solar fractions are enabled that form the basis of simple tools useful for first-order estimates in design. A design case study is presented against which results of the current work are favorably compared. [Display omitted] • Diffuse & beam solar fractions for stationary photovoltaic (PV) array considered • A complete and validated model for diffuse solar fraction at ground presented • Interactions with PV panel and neighbors show 20 neighboring PVs needed in model • Diffuse solar fraction is practically independent of PV panel support height • Polynomials of diffuse solar fraction depends only on panel height/spacing and panel slope • Normalization enables simple design tool plots for diffuse and beam solar fractions [ABSTRACT FROM AUTHOR]

This paper presents a practical solution for identifying tenant data interference defects when migrating single-tenant legacy code to multi-tenant components or multi-tenant microservices. The paper explains the concepts of multi-tenant components and microservices, elaborates a formal definition of the multi-tenancy data interference problem based on information flow control theory, and presents a practical method to identify potential defects by analysing the code statically. The method has been implemented as a prototype developer support tool for PHP code. The implemented support tool prototype demonstrates the method's effectiveness for supporting the transformation of single-tenant legacy source code into multi-tenant components or microservices. It could also be used to confirm that multi-tenant components or microservices are free of data interference defects. The prototype implementation has been validated in a case study with code from the open-source enterprise application SugarCRM. Results indicate that the developed approach significantly increases the efficiency of multi-tenancy transformation in larger code bases by pointing out potential defects. [ABSTRACT FROM AUTHOR]

Background: Experiments have been conducted in many domains of software engineering (SE). Objective: This paper presents a metamodel, the Codex metamodel, containing standard concepts found in any coding experiment. We classify coding experiments as any SE experiment where participants have to carry out coding activities (construct, test, debug, and forth). Method: The paper presents results of an exploratory study that proposes a metamodel for the domain of coding experiments. Besides, we present how our metamodel specifies a real coding experiment. Results: Our metamodel for coding experiments was modeled with few elements, and it can precisely describe all coding activities. Conclusions: Our metamodel facilitates the development of a tool to support executing a coding experiment. [ABSTRACT FROM AUTHOR]

Sparse coding is based on the concept of having a large dictionary of candidate basis vectors. Any given vector is expressed as a sparse linear combination of the dictionary vectors. It has been developed in the signal processing field, and has many applications in data compression and image processing. In this paper we propose applying sparse coding to the time series forecasting field. Specifically, the paper investigates different dictionary based local learning techniques for building predictive models for the time series forecasting problem. The proposed methodology is based on a local learning framework whereby the query point is embedded and coded in terms of a sparse combination of the training dictionary atoms (vectors). Then this embedding is used for estimating the target value of the query point, by applying the same embedding to the target vectors of the dictionary training atoms. We present an experimental study of several sparse coding algorithms. Experiments are performed on the large monthly time series benchmark from the M3 competition, and these experiments showed that the sparse methods Lasso and Elastic-Net presented the best results among the sparse coding algorithms. Moreover, they outperformed the K -nearest neighbor (KNN) regression and most of the compared machine learning and statistical forecasting techniques, especially for higher horizons. [ABSTRACT FROM AUTHOR]

Abstracts This paper proposes an analytical method based on conformal geometrical algebra to implement and unify type synthesis of one translational and two rotational (1T2R) parallel mechanisms and two rotational and one translational (2R1T) parallel mechanisms. Firstly, conformal geometrical algebra is introduced in this paper to describe finite motions and carry out type synthesis of parallel mechanisms in an algebraic way. Secondly, the finite motions of 1T2R and 2R1T parallel mechanisms are described and their relations are explored, and this results in unifying the type synthesis of these two types of parallel mechanisms in the same procedure. Then, a parametric and algebraic generation method is proposed to obtain available limbs and axes layout of joints with these limbs. Finally, the assembly conditions among available limbs are given to synthesize systematically 2R1T parallel mechanisms with non-overconstrained or overconstrained property, as well as 1T2R parallel mechanisms with the same properties. This method proposed in this paper is valid in carrying out finite motion representation and type synthesis of parallel mechanisms in an algebraic and analytical way, and then is beneficial to an automatic manner using computer programming languages. Furthermore, the method may solve type synthesis of special parallel mechanisms, such as parallel mechanisms with varied output rotational axes. [ABSTRACT FROM AUTHOR]

A physical system is determined by a finite set of initial conditions and "laws" represented by equations. The system is computable if we can solve the equations in all instances using a "finite body of mathematical knowledge". In this case, if the laws of the system can be coded into a computer program, then given the initial conditions of the system, one can compute the system's evolution. Are there incomputable physical systems? This question has been theoretically studied in the last 30–40 years. In this paper, we experimentally show for the first time the strong incomputability of a quantum experiment, namely the outputs of a quantum random number generator. Moreover, the experimental results are robust and statistically significant. [ABSTRACT FROM AUTHOR]

• AP1000-like reactor studied with MELCOR2.1. • Steady-state and Design Basis Accident studied. • Nominal and 10% blocked steam generator tubes steady-states predicted accurately. • Double ended DVI-LOCA accident predicted comparable to the US DCD and UK PCSR. • Twelve cases studied with various models for ADS-4, steam generator and hot-leg. The paper presents the outcomes of the deterministic safety studies for a Pressurized Water Reactor based on the AP1000 design. The model was developed with MELCOR computer code using public references and qualified using data for nominal steady-state and double-ended Direct Vessel Injection line break accident. Emphasis was placed on thermal–hydraulic phenomena and modeling of the passive safety features. Different plant model variants were studied, including two models for the Automatic Depressurization System, two models for steam generators, and three models for hot-legs. Safety injections were investigated with a focus on the passive core cooling system, which is crucial during a Loss of Coolant Accident. Simulation results agree very well with available steady-state data. The model predicts expected plant behavior during a design basis accident, and results are not substantially different from predictions with system codes presented in the public reports. It shows that the developed model can be used in severe accident studies. [ABSTRACT FROM AUTHOR]

Most students struggle when learning to program. In this paper we examine two instructional tasks that can be used to introduce programming: tell-and-practice (the typical pedagogical routine of describing some code or function then having students write code to practice what they have learned) and prediction (where students are given code and asked to make predictions about the output before they are told how the code works). Participants were 121 college students with no coding experience. Participants were randomly assigned to one of two parallel training tasks: predict, or tell-and-practice. Participants in the predict condition showed greater learning and better non-cognitive outcomes than those in the tell-and-practice condition. These findings raise a number of questions about the relationship between programming tasks and students' experiences and outcomes in the early stages of learning programming. They also suggest some pedagogical changes to consider, especially in early introductions to programming. • Demonstrate potential effectiveness of using prediction tasks to teach programming. • Novices benefit from predicting code output before learning how the code works. • Students learning from prediction tasks scored higher on the learning assessment. • They also had more positive emotional responses to R and error messages. • They considered the learning activity to be less costly than control group. [ABSTRACT FROM AUTHOR]

This paper addresses software citation by analyzing how R and its packages are cited in a sample of PLoS papers. A codebook is developed to support a content analysis of the full-text papers. Our results indicate that the software R and its packages are inconsistently cited, as is the case with other scientific software. The inconsistency derives partly from the variety of citation standards currently used for software, and partly from fact that these standards are not well followed by authors on multiple levels. This work sheds light on the future development of software citation standards, especially given the present landscape of conflicting citation practices. Moreover, our approach furnishes a possible blueprint for dealing with the granularity of software entities in scientific citation: we consider citations of the core R software environment, of specific R packages, and of individual functions. [ABSTRACT FROM AUTHOR]

In all engineering discipline in universities, introductory programming is an essential part of the curriculum. However, many students find great difficulty with the learning of programming without instructor assistance and it becomes a barrier to their further studies of computer science and other disciplines. Intelligent Programming Tutors (IPTs) assist students to overcome difficulties in solving programming exercises, when they don't know how to proceed or they unable to find an error in their current state. Such a student may benefit from hints, guiding her toward a more complete and/or more correct version and allowing her to continue working on her own (Aleven et al., 2016). However, traditional IPTs take much time to create the expert knowledge because in computer programming tasks, the space of possible solutions is too large (Piech et al., 2015b). New development methods have emerged in recent years, which provide hints without an expert model. These techniques are based on data-driven approaches and/or program repair techniques and provide hints in the form of edits (such as inserting or deleting a piece of code). Students can apply these hints in their current state to change it into a more correct and/or more complete state. This paper aims to provide a best understanding of these new techniques and presents a comparative study between different approaches of automatic hint generation by presenting the forces and weaknesses of each approach. [ABSTRACT FROM AUTHOR]

Typed models of connector/component composition specify interfaces describing ports of components and connectors. Typing ensures that these ports are plugged together appropriately, so that data can flow out of each output port and into an input port. These interfaces typically consider the direction of data flow and the type of values flowing. Components, connectors, and systems are often parameterised in such a way that the parameters affect the interfaces. Typing such connector families is challenging. This paper takes a first step towards addressing this problem by presenting a calculus of connector families with integer and boolean parameters. The calculus is based on monoidal categories, with a dependent type system that describes the parameterised interfaces of these connectors. We use families of Reo connectors as running examples, and show how this calculus can be applied to Petri Nets and to BIP systems. The paper focuses on the structure of connectors— well-connectedness —and less on their behaviour, making it easily applicable to a wide range of coordination and component-based models. A type-checking algorithm based on constraints is used to analyse connector families, supported by a proof-of-concept implementation. [ABSTRACT FROM AUTHOR]

We present a novel programming concept called temporal constrained objects for modeling of dynamic systems. It is an extension of the paradigm of constrained objects which provides a principled approach to modeling complex engineering systems based upon two main principles: a compositional specification of the structure of the system, using objects, and a declarative specification of its behavior, using constraints. A novel feature of temporal constrained objects is the series variable , the sequence of whose values is determined by constraints that include metric temporal operators . The emergent behavior of a dynamic system is determined through a process of time-based simulation and constraint satisfaction at each step. Each class definition for a temporal constrained object is translated into a Prolog rule with constraint-solving capability. In order to improve the performance for long simulations, a partial evaluation technique is adopted for optimized code generation. This paper describes the syntax of a language called TCOB along with several examples, our objective being to demonstrate the benefits of the programming paradigm. TCOB has been implemented and all examples presented in this paper were tested using this implementation. An overview of the translation as well as partial execution and its performance improvements are presented in the paper. [ABSTRACT FROM AUTHOR]