Miracle-dz/UniFAR-FTUs huggingface dataset:
Doing Scrum Rather Than Being Agile: A Case Study on Actual Nearshoring Practices

Previous research in the field of Agile Distributed Software Development often focused on the a synchronicity of working hours due to different time zones, as if this was the only risk when developing software in non-co-located environments. This case study reflects a near shoring setting in which this primary impediment does not exist and investigates a broader range of risks now standing out more clearly. We observed two Polish Scrum teams working for a German company, which has been successfully applying Agile Methods for over four years. We present the actual process and practices of the external teams and contrast them to the intended way of proceeding. Main result: Agile near shoring is feasible and may produce high satisfaction amongst Product Owners, but this satisfaction might be delusive if process deviations due to misunderstandings of what Agile development means go unnoticed.
Supporting incremental programming with ghosts

Best practices in programming typically imply coding using classes and interfaces that are not (fully) defined yet. However, integrated development environments (IDEs) do not support such incremental programming seamlessly. Instead, they get in the way by reporting ineffective error messages. Ignoring these messages altogether prevents the programmer from getting useful feedback regarding actual inconsistencies and type errors. But attending to these error messages repeatedly breaks the programming workflow. In order to smoothly support incremental programming, we propose to extend IDEs with support of undefined entities, called Ghosts. Ghosts are implicitly reified in the IDE through their usages. Programmers can explicitly identify ghosts, get appropriate type feedback, interact with them, and bust them when ready, yielding actual code.
Sequential Allocation with Minimal Switching

AbstractThis paper describes algorithms for the design of sequen-tial experiments where extensive switching is undesirable.Given an objective function to minimize by sampling be-tweenBernoullipopulations,twodifferentmodelsare consid-ered. The constraint model optimizes the tradeoff of the max-imum number of switches vs. the objective function, whilethe cost model optimizes the tradeoff for the expected num-ber of switches. For each model, an algorithm is developedwhich produces the optimal sequential experiment.The algorithms are quite general, and give users ﬂexibil-ity in incorporating practical considerations in the design ofexperiments. To show the usability of these algorithms, theyare applied to a bandit problem and an estimation problem. Itis observed that the expected number of switches grows ap-proximately as the square root of the sample size, for samplesizes up to a few hundred. It is also observed that one candramatically reduce the number of switches without substan-tially affecting the expected value of the objective function.Thus one need sacriﬁce only a small amount of statistical ob-jective in order to achieve signiﬁcant gains in practicalit y.Keywords: adaptive sampling, switching costs, constraints,bandit, estimation, dynamic programming, optimal tradeoffs
Machine Learning for Automated Polyp Detection in Computed Tomography Colonography

This chapter presents a comprehensive scheme for automated detection of colorectal polyps in computed tomography colonography (CTC) with particular emphasis on robust learning algorithms that differentiate polyps from non-polyp shapes. The authors’ automated CTC scheme introduces two orientation independent features which encode the shape characteristics that aid in classification of polyps and non-polyps with high accuracy, low false positive rate, and low computations making the scheme suitable for colorectal cancer screening initiatives. Experiments using state-of-the-art machine learning algorithms viz., lazy learning, support vector machines, and naïve Bayes classifiers reveal the robustness of the two features in detecting polyps at 100% sensitivity for polyps with diameter greater than 10 mm while attaining total low false positive rates, respectively, of 3.05, 3.47 and 0.71 per CTC dataset at specificities above 99% when tested on 58 CTC datasets. The results were validated using colonoscopy reports provided by expert radiologists. Abhilash Alexander Miranda Université Libre de Bruxelles, Belgium Olivier Caelen Université Libre de Bruxelles, Belgium Gianluca Bontempi Université Libre de Bruxelles, Belgium Machine Learning for Automated Polyp Detection in Computed Tomography Colonography DOI: 10.4018/978-1-60960-818-7.ch4. 7
Small size high isolation Wilkinson power splitter for 60 GHz wireless sensor network applications

This paper shows a very compact Wilkinson power splitter for high integrated millimeter wave systems. The approach, to reduce the component's size, is based on the lumped component transformation for the lines. The simulation on the splitter structure shows a very wide band with 0.5 dB of maximum insertion loss and only 0.07 dB of maximum output amplitude imbalance. The input return loss is better than −21 dB within the whole band of interest (57 – 67 GHz) the output return loss is better than −21.5 dB for the same band. The isolation between the two outputs is better than −20 dB. The occupied area for the entire structure is around 0.0055mm2
Optimality analysis of Th1/Th2 immune responses during microparasite-macroparasite co-infection, with epidemiological feedbacks

SUMMARY Individuals are typically co-infected by a diverse community of microparasites (e.g. viruses or protozoa) and macroparasites (e.g. helminths). Vertebrates respond to these parasites differently, typically mounting T helper type 1 (Th1) responses against microparasites and Th2 responses against macroparasites. These two responses may be antagonistic such that hosts face a ‘decision’ of how to allocate potentially limiting resources. Such decisions at the individual host level will influence parasite abundance at the population level which, in turn, will feed back upon the individual level. We take a first step towards a complete theoretical framework by placing an analysis of optimal immune responses under microparasite-macroparasite co-infection within an epidemiological framework. We show that the optimal immune allocation is quantitatively sensitive to the shape of the trade-off curve and qualitatively sensitive to life-history traits of the host, microparasite and macroparasite. This model represents an important first step in placing optimality models of the immune response to co-infection into an epidemiological framework. Ultimately, however, a more complete framework is needed to bring together the optimal strategy at the individual level and the population-level consequences of those responses, before we can truly understand the evolution of host immune responses under parasite co-infection.
Evaluation of Simulation Strategy on Single-Player Monte-Carlo Tree Search and its Discussion for a Practical Scheduling Problem

Monte-Carlo Tree Search (MCTS) is a best-first search where the pseudorandom simulations guide the solution of problem. Recent improvements on MCTS have produced strong computer Go pro- gram, which has a large search space, and the suc- cess is a hot topic for selecting the best move. So far, most of reports about MCTS have been on two- player game, and MCTS has been applied rarely in one-player games. MCTS does not need an admis- sible heuristic, so the application of MCTS for one- player games might be an interesting alternative. Ad- ditionally, one-player games changed its situation by player's decision like puzzles are describable as net- work diagrams like PERT with the representation of interdependences between each operation. Therefore if MCTS for one-player games is developed as a meta- heuristic algorithm, we would use this for not only many practical problems, but also combinatorial op- timization problems. This paper investigated the ap- plication of Single Player MCTS (SP-MCTS) intro- duced by Schadd et al. to a puzzle game called Bubble Breaker. Next this paper showed the effectiveness of new simulation strategies on SP-MCTS by numerical experiments, and found the differences between the search methods and their parameters. Based on the results, this paper discussed the application potential- ity of SP-MCTS for a practical scheduling problem.
Adding data abstraction to Fortran software

The Fortran Abstract Data (FAD) system was designed to facilitate the structured reuse of Fortran-callable software. FAD uses data abstraction to implement information hiding. It lets the implementer of a data type explicitly control how instances of that type are used, while itself utilizing Fortran's separate compilation and the vast collection of available Fortran libraries. The principle and methods of information hiding are discussed. The use of FAD, which is designed for situations where the user of an abstract data type is distinct from the implementer of the abstract data type, is described. Some related work is examined. <<ETX>>
CatchIt, a Development Environment for Transparent Usability Testing

No existing tool addresses both the development and evaluation process for interactive systems. Current evaluation tools support either the predictive or the experimental approaches to usability testing, and automated tools that make possible experimental evaluation impose a tricky manual instrumentation of the existing code. In this paper we describe CatchIt, a development and usability testing environment, to respond to these limitations using work domain descriptions as the central foundation. Within CatchIt, work domain descriptions define a reference model that serves two complementary purposes: the model can be used as reusable code from which a new application can be built or it can be used as a standard against which new applications can be tested. Evaluation, whether it be predictive or experimental, consists of the automated detection of deviations of the new application from the norm defined by the reference model. The reference model evolves over time based on the accumulation of past experience. As such, it supports traceability and evolutivity of the corresponding work domain.
Platform-Based Design of a Low-Energy, Hybrid Reconfigurable Fabric for Wireless Protocol Processing

As modern communication systems increase in complexity, platform-based design methodology is a viable solution for the challenges of complex system design. Platform-based design advocates system design at a high level, shortening design time through reuse of well-characterized modules. Application and architectural explorations are key processes within this methodology. This project describes the early stages of applying platform-based design to the design of a protocol processor for the PicoNode, a flexible, ultra-low energy radio node. The application space is explored to identify the characteristics of the key functions, and the existing implementation strategies are evaluated to support these characteristics. Based on these studies, we propose a reconfigurable, hybrid architecture combining the key properties of field-programmable gate arrays and programmable logic devices for processing low-level PicoRadio protocols. An implementation of a hybrid block in the new architecture is presented, and architectural models are derived for estimating performance. In comparison with alternative reconfigurable architectures, the results show that this architecture can be an effective, low-energy solution for low-level, wireless protocol processing.
The invasiveness of Solidago canadensis in the Sanctuary «Prilepsky» (Belarus)

Protected Areas provide a valuable source of information on the effects of invasive alien species on biodiversity and ecosystem functioning as well as the dynamics of invasions. Solidago canadensis is an extremely aggressive alien species. It is included into the world’s 100 most invasive plant species. Our study aimed to monitor the invasiveness of S. canadensis in the Sanctuary «Prilepsky» in Minsk district. The article contains a brief description of the introduction of Solidago canadensis in Europe and more detailed in Belarus. The parameters characterising its invasiveness (average shoot length, foliage projective cover, average number of vegetative shoots, average number of generative shoots of S. canadensis and the average number of associated species per study plot) have been measured in three plant communities of the Sanctuary «Prilepsky» (Minsk district, Belarus) in 2016 and 2018. We noted that the invasiveness of S. canadensis is linked to the amount of sunlight received by ecotope. The proposed control measures include the afforestation of the open parts of the Sanctuary «Prilepsky» using native tree species, multiple mowings, and destroying the plants directly at the areas of most concern by volunteers.
Earwigs and Humans

There are several differing methodologies in mobile robotics and their implications for the field of artificial intelligence as a whole. In the mid 1980s Rodney Brooks initiated a novel idea in robotics that most intelligent behaviour is not centrally controlled, contrary to the popular view at the time. In this essay, we shall review some of the background and criticisms to Brooks’ behaviour-based theory of mobile robotics. It is proposed that an accurate model of intelligent behaviour should encompass both lower-level behaviour-based activity and higher-level concepts in control. The development of styles used in designing and implementing robots have in some ways mirrored those popular in the AI field as a whole. Most of the work in the 1960s and 1970s concentrated around processing of inputs, building a symbolic world model and using a planner to decide the next course of action. One of the most famous examples of this is the SHAKEY system, which used the STRIPS planner (Nilsson, 1984). In the 1980s AI moved on from ‘traditional’ models using the symbolic ideas inherited from philosophy, proposing alternative theories such as connectionism and neural networks. Around the same time, Brooks (1985) proposed a novel control system for mobile robotics, called the subsumption architecture. He saw that as the requirements of robotics applications became more complex, the problems of handling multiple sensors providing noisy data and conflicting goals multiplied to create an intractable computational problem. Brooks’ idea of the mobile robot was to create a completely autonomous intelligent system. The design goals of the system were:
A multi-objective evolutionary algorithm based on membrane systems

In this paper, a novel algorithm based on membrane systems theory is proposed for solving multi-objective optimization problems. The proposed algorithm is composed mainly by some elements, such as symbol-objects, multi-sets, regions, rules and so on, which are inspired by the structure and functioning of the living cell. In the inner regions of membrane systems, a symbol-object represents a candidate solution of the multi-objective optimization problem. Thereafter, some symbol-objects may construct a multi-set which is sent into the appointed region by the specific rule. In addition, some evolution rules are employed to evolve the multi-set in the inner region of elementary. Moreover, the diversity of the proposed algorithm is improved by the maintaining strategy and the rules of division and dissolution. Comparative study shows that the proposed method performs better in four performance metrics when solving these benchmark problems compared with three the state-of-art algorithms. Sensitivity analysis indicates that it could quickly obtain the approximate Pareto front and satisfy the requirement of diversity of Pareto front. So, it is feasible and effective to solve multi-objective optimization problems.
Ischemic preconditioning modulates the expression of several genes, leading to the overproduction of IL‐1Ra, iNOS, and Bcl‐2 in a human model of liver ischemia‐reperfusion

Ischemia triggers an inflammatory response that precipitates cell death during reperfusion. Several studies have shown that tissues are protected by ischemic preconditioning (IP) consisting of 10 min of ischemia followed by 10 min of reperfusion just before ischemia. The molecular basis of this protective effect is poorly understood. We used cDNA arrays (20K) to compare global gene expression in liver biopsies from living human liver donors who underwent IP (n=7) or not (n=7) just before liver devascularization. Microarray data were analyzed using paired t test with a type I error rate fixed at α = 2.5 106 (Bonferroni correction). We found that 60 genes were differentially expressed (36 over‐ and 24 underexpressed in preconditioning group). After IP, the most significantly overexpressed gene was IL‐1Ra. This was confirmed by immunoblotting. Differentially expressed were genes involved in apoptosis (NOD2, ephrin‐A1, and calpain) and in the carbohydrate metabolism. A significant increase in the amount of the anti‐apoptotic protein Bcl‐2 in preconditioned livers but no change in the cleavage of procaspase‐3, ‐8, and ‐9 was observed. We also observed an increase in the amount in the inducible nitric oxide synthase. Therefore, the benefits of IP may be associated with the overproduction of IL‐1Ra, Bcl‐2, and NO countering the proinflammatory and proapoptotic effects generated during ischemia‐reperfusion. AlainBarrier NataliaOlaya FranckChiappini FrançoisRoser OlivierScatton CédricArtus BrigitteFranc SandrineDudoit AntoineFlahault BrigitteDebuire DanielAzoulay AntoinetteLemoine Ischemic preconditioning modulates the expression of several genes, leading to the overproduction of IL‐1Ra, iNOS, and Bcl‐2 in a human model of liver ischemia‐reperfusion. FASEB J. 19, 1617–1626 (2005)
An infinitesimal characterization of nonlinear contracting interference functions

Contractive interference functions are a subclass of the standard interference functions used in the design and analysis of distributed power control algorithms for wireless networks. Their peculiarity is that for the resulting positive system the existence and global asymptotic stability of a unique positive equilibrium point is guaranteed. In this paper we give an infinitesimal characterization of nonlinear contractive interference functions in terms of the spectral radius of the Jacobian linearization at any point in the positive orthant. The condition we obtain, that the spectral radius is always less than 1, extends to the nonlinear case an equivalent property of linear interference functions, and leads to a Jacobian characterization similar to the one commonly used in contraction analysis of nonlinear systems.
Pathologic Etiologies of Late and Very Late Stent Thrombosis following First-Generation Drug-Eluting Stent Placement

Several randomized and observational studies have reported steady increase in cumulative incidence of late and very late ST (LST/VLST) following first-generation drug-eluting stents (DES: sirolimus-(SES) and paclitaxel-(PES)) up to 5 years. Pathologic studies have identified uncovered struts as the primary substrate responsible for LST/VLST following DES, where delayed arterial healing is associated with stent struts penetrating into the necrotic core, long/overlapping stents, and bifurcation stenting especially in flow divider region. Grade V stent fracture also induces LST/VLST and restenosis. Hypersensitivity reaction is exclusive to SES as an etiology of LST/VLST, whereas malapposition secondary to excessive fibrin deposition is associated with PES. Uncovered struts can be identified in SES and PES with duration of implant beyond 12 months, particularly in stents placed for “off-label” indications. Neoatherosclerosis is another important contributing factor for VLST in DES and bare metal stents (BMS); however, DES shows rapid and more frequent development of neoatherosclerosis than BMS. Future pathologic studies should address the long-term safety of newer generation DES including zotarolimus- and everolimus-eluting stents in terms of the improvement in reendothelialization, decreased inflammation and fibrin deposition as well as a lower incidence of stent fracture-related adverse events, and reduced neoatherosclerosis, which likely contribute to the decreased risk of LST/VLST and better patient outcomes.
Constraint-based Optimizations of Executable UML Models

This paper describes an ongoing research aimed on the creation and implementation of a set of transformations of executable UML (Unified Modeling Language) models that would improve the execution performance while preserving the behavior. Additional information useful for transformations can be extracted from the constraints embedded in the model. The article contains an example of informal description of a transformation, a scheme of modeling environment extension implementing such transformations, and a review of related tools.
Simulation resource recommendation system based on collaborative filtering

The present simulation resource management systems are full of all kinds of simulation resources; it is inefficient to get the needed simulation resource with the traditional search methods. To solve this problem, the recommendation system based on collaborative filtering is applied to the simulation resource management system, which can recommend the most relative simulation resource to the user according to user's previous preference. After analyzing the necessity of combining the recommendation system with the simulation resource system, the simulation resource recommendation system is designed and realized. The realization includes three main procedures: collecting user preferences, finding neighbor users, recommending simulation resources. The recommendation system collects users' grading on used simulation resources as user preferences, and uses the Pearson correlation to calculate the similarity between users and then finds out the neighbor users; then it bases on the neighbor users to predict the user's grade of the resource and then gets the recommended resources. The test result shows that the recommended resources have strong similarity with the user' previous preference. The recommendation system improves the efficiency of the resource obtaining and the use frequency of the recommended resource.
Efficient sidelobe suppression by matching beams in two polynomial technique

In the literature a technique for sidelobe suppression is presented that utilizes product of two polynomials. In this paper, a method is presented for efficient sidelobe suppression by proper selection of sidelobe region. For this purpose, it is proposed to observe the radiation pattern of the first polynomial to find out the position of right and left nulls adjacent to the main beam. The region outside these nulls is proposed to be utilized for sidelobe region while finding the weights of second polynomial that is meant for sidelobe suppression. This will provide maximum overlap of main beams of the two polynomials and suppress sidelobes efficiently. Simulation results confirm the validity of the proposed method.
Improving Random Walk Performance

Random walk simulation is employed in many experimental algorithmic applications. Efficient execution on modern computer architectures demands that the random walk be implemented to exploit data locality for improving the cache performance. In this research, we demonstrate how different one-dimensional data reordering functionals can be used as a preprocessing step for speeding the random walk runtime. Index Terms—data reordering, random walk, irregular memory access, cache performance. F