Miracle-dz/UniFAR-FTUs huggingface dataset:
Variability Analysis of Requirements: Considering Behavioral Differences and Reflecting Stakeholders’ Perspectives

Adoption of Software Product Line Engineering (SPLE) to support systematic reuse of software-related artifacts within product families is challenging, time-consuming and error-prone. Analyzing the variability of existing artifacts needs to reflect different perspectives and preferences of stakeholders in order to facilitate decisions in SPLE adoption. Considering that requirements drive many development methods and activities, we introduce an approach to analyze variability of behaviors as presented in functional requirements. The approach, called semantic and ontological variability analysis (SOVA), uses ontological and semantic considerations to automatically analyze differences between initial states (preconditions), external events (triggers) that act on the system, and final states (post-conditions) of behaviors. The approach generates feature diagrams typically used in SPLE to model variability. Those diagrams are organized according to perspective profiles, reflecting the needs and preferences of the potential stakeholders for given tasks. We conducted an empirical study to examine the usefulness of the approach by comparing it to an existing tool which is mainly based on a latent semantic analysis measurement. SOVA appears to create outputs that are more comprehensible in significantly shorter times. These results demonstrate SOVA's potential to allow for flexible, behavior-oriented variability analysis.
Metadata Provenance in Europeana and the Semantic Web

This thesis gives an overview on various ways and best-practices to handle metadata provenance in the SemanticWeb, including the employment of linked data principles, reification, OAI-ORE, and named graphs. It reflects the work of the W3C Provenance Working Group, the W3C RDF Working Group and the DCMI Metadata Provenance Task Group, with a special emphasis on a mapping between Dublin Core and the upcoming PROV model. Based on these foundations, a proposal for the Europeana Data Model is developed.
Parallel Cyclic Convolution Based on Recursive Formulations of Block Pseudocirculant Matrices

In this paper, we show how novel recursive formulations of block pseudocirculant matrices lead to a new class of parallel cyclic convolution algorithms that exhibit a high degree of regularity and modularity and are suitable for parallel or pipelined implementation into today's very large scale integration (VLSI) circuits, multifield-programmable gate arrays (multi-FPGAs) systems, and multiprocessor architectures. In addition to the architectural advantages, the proposed formulations offer a comparable number of parallel subsections, and a reduction in the number of pre/postprocessing vector operations, for the same range of decimation rates proposed by the most efficient alternative algorithm. The proposed algorithms do not impose any of the traditional constraints, such as the demand that the convolution length be factorable into mutually prime factors. The use of recursion results in the definition of two new mathematical constructs, which are intrinsic to these novel architectures, the higher order block pseudocirculant or superblock pseudocirculant matrix and the block pseudocyclic shift operator that leads to unfolded data-flow graphs of cyclic shifts.
A Group Key Management Protocol Based on Weight-Balanced 2-3 Tree for Wireless Sensor Networks

Multicast in Wireless Sensor Networks (WSNs) is an attractive mechanism for delivering data to multiple receivers as it saves bandwidth. To guarantee the security of multicast, the group key is used to encrypt and decrypt the packages. However, providing key management services in WSNs is complicated because sensor nodes possess limited resources of computing, storage and communication. To address the balance between security and limited resources, a multicast group key management protocol based on the weight-balanced 2-3 tree is proposed to generate, distribute, and update the group key securely and efficiently. The decentralized group key management method is employed. A weight-balanced 2-3 key tree is formed in every subgroup. Instead of using the conventional symmetric and non-symmetric encryption algorithms, the Maximum Distance Separable (MDS) code technique is used to distribute the multicast key dynamically. During the key updating, a series of adjustment rules are summarized to keep the tree weight-balanced, where pseudo-nodes as leaves are added to reduce the computation and communication complexity. Compared with some other group key management protocols, our scheme shows higher superiority on security and performance.
Ring finger protein20 regulates hepatic lipid metabolism through protein kinase A-dependent sterol regulatory element binding protein1c degradation

Sterol regulatory element binding protein1c (SREBP1c) is a key transcription factor for de novo lipogenesis during the postprandial state. During nutritional deprivation, hepatic SREBP1c is rapidly suppressed by fasting signals to prevent lipogenic pathways. However, the molecular mechanisms that control SREBP1c turnover in response to fasting status are not thoroughly understood. To elucidate which factors are involved in the inactivation of SREBP1c, we attempted to identify SREBP1c‐interacting proteins by mass spectrometry analysis. Since we observed that ring finger protein20 (RNF20) ubiquitin ligase was identified as one of SREBP1c‐interacting proteins, we hypothesized that fasting signaling would promote SREBP1c degradation in an RNF20‐dependent manner. In this work, we demonstrate that RNF20 physically interacts with SREBP1c, leading to degradation of SREBP1c via ubiquitination. In accordance with these findings, RNF20 represses the transcriptional activity of SREBP1c and turns off the expression of lipogenic genes that are targets of SREBP1c. In contrast, knockdown of RNF20 stimulates the expression of SREBP1c and lipogenic genes and induces lipogenic activity in primary hepatocytes. Furthermore, activation of protein kinase A (PKA) with glucagon or forskolin enhances the expression of RNF20 and potentiates the ubiquitination of SREBP1c via RNF20. In wild‐type and db/db mice, adenoviral overexpression of RNF20 markedly suppresses FASN promoter activity and reduces the level of hepatic triglycerides, accompanied by a decrease in the hepatic lipogenic program. Here, we reveal that RNF20‐induced SREBP1c ubiquitination down‐regulates hepatic lipogenic activity upon PKA activation. Conclusion: RNF20 acts as a negative regulator of hepatic fatty acid metabolism through degradation of SREBP1c upon PKA activation. Knowledge regarding this process enhances our understanding of how SREBP1c is able to turn off hepatic lipid metabolism during nutritional deprivation. (Hepatology 2014;60:844–857)
A Genetic Variant in miR-196a2 Increased Digestive System Cancer Risks: A Meta-Analysis of 15 Case-Control Studies

Background MicroRNAs (miRNAs) negatively regulate the gene expression and act as tumor suppressors or oncogenes in oncogenesis. The association between single nucleotide polymorphism (SNP) in miR-196a2 rs11614913 and the susceptibility of digestive system cancers was inconsistent in previous studies. Methodology/Principal Findings An updated meta-analysis based on 15 independent case-control studies consisting of 4999 cancer patients and 7606 controls was performed to address this association. It was found that miR-196a2 polymorphism significantly elevated the risks of digestive system cancers (CT vs. TT, OR = 1.25, 95% CI = 1.07–1.45; CC vs. TT, OR = 1.38, 95% CI = 1.13–1.67; CC/CT vs. TT, OR = 1.29, 95% CI = 1.10–1.50; CC vs. CT/TT, OR = 1.14, 95% CI = 1.01–1.30; C vs. T, OR = 1.15, 95% CI = 1.05–1.26). We also found that variant in miR-196a2 increased the susceptibility of colorectal cancer (CRC) (CT vs. TT, OR = 1.23, 95% CI = 1.04–1.44; CC vs. TT, OR = 1.32, 95% CI = 1.08–1.61; CC/CT vs. TT, OR = 1.25, 95% CI = 1.07–1.46; C vs. T, OR = 1.15, 95% CI = 1.05–1.28), while the association in recessive model (CC vs. CT/TT, OR = 1.16, 95% CI = 0.98–1.38) showed a marginal significance. Additionally, significant association between miR-196a2 polymorphism and increased risk of hepatocellular cancer (HCC) was detected. By stratifying tumors on the basis of site of origin, source of controls, ethnicity and allele frequency in controls, elevated cancer risks were observed. Conclusion/Significance Our findings suggest the significant association between miR-196a2 polymorphism and increased susceptibility of digestive system cancers, especially of CRC, HCC and Asians. Besides, C allele may contribute to increased digestive cancer risks.
Timed Petri nets and preliminary performance evaluation

It is shown that the behavior of a certain class of timed Petri nets can be represented by a finite labeled directed graph in which the labels describe times and probabilities of transitions between vertices of the graph. Further analysis of such a graph can be done by techniques known for Markov chains. The method is applied to evaluation of some performance indices for two simple processor architectures. The timed Petri nets modeling the processors are shown and the resulting performance indices are compared. Some other architectures are discussed shortly.
Semantic indexing and computational aesthetics: interactions, bridgesand boundaries

Semantic Indexing and Computational Aesthetics are two closely related fields. For some aspects they are similar, complementary for others, and sometimes completely disjoint. Semantic Indexing is about automatically identifying content in natural images, namely recognizing objects and scenes. Computational Aesthetics provides a set of techniques to automatically assign a beauty degree to a given image. In our work, we enrich both types of visual analysis by exploring the synergy of those two fields. We investigate the role of Semantic Indexing techniques for Computational Aesthetics Frameworks, and, vice versa, the importance of Aesthetic features for Semantic Indexing prediction. We show the benefits and the limits of this synergy, and propose some improvements in this direction.
A Case for a Collaborative Computing Tool for Image Processing

One of the challenging tasks in designing a superior image compression system is encouraging collaboration between the image processing researchers, system designers, and field users. To facilitate information sharing between these key players, a software package that allows the user to prototype various image compression algorithms was designed. This tool allows the users to analyze the compression results both quantitatively and qualitatively, and automatically documents the results. An overview of how the user interacts with the program and technical details of the image compression algorithms implemented are provided. Building upon the software prototyping system, several methods are examined to transition to a final realtime hardware compression system. One method is to build a set of wavelet filter banks based upon proven FIR technology. The second method is to build an experimental processor optimized for vector and matrix calculations. This processor allows for a quick transition from software to hardware since most of the compression algorithms use matrix mathematics.
Comprehending Complex Concepts

Abstract Recent theories of concepts have raised the issue of how people combine simple concepts (like engine and repair ) to form complex concepts (like engine repair ). This article approaches this issue by asking how people comprehend modified noun phrases of this sort. One explanation of how complex concepts are understood (the feature weighting model) provides a simple mechanism in which the primary feature of the modifying concept is made more salient in the modified concept. nother explanation focuses on how world knowledge directs the combination process. The two explanations are compared in their ability to account for the interpretation of various kinds of noun phrases. Two experiments are reported which evaluate the feature weighting model's predictions for adjective-noun phrases. These contrasts suggest that the combination process does require reference to world knowledge. The consequences of accepting such an account are discussed.
Fine-grained classification of side-effect free methods in real-world Java code and applications to software security

Previous researchers have argued that method purity (absence of side-effects) in object-oriented languages allows code to be more easily reasoned about, with beneficial effects for software security. However, many different forms of purity have been proposed, which poses a challenge for verifying this idea empirically. Furthermore, previous purity analyses of code have provided only coarse-grained results. We propose a finer-grained classification of levels of method purity, and analyse a portion of real-world code to determine the prevalence of different levels.
Hyperbolic character of the angular moment equations of radiative transfer and numerical methods

We study the mathematical character of the angular moment equations of radiative transfer in spherical symmetry and conclude that the system is hyperbolic for general forms of the closure relation found in the literature. Hyperbolicity and causality preservation lead to mathematical conditions allowing us to establish a useful characterization of the closure relations. We apply numerical methods specifically designed to solve hyperbolic systems of conservation laws (the so-called Godunov-type methods) to calculate numerical solutions of the radiation transport equations in a static background. The feasibility of the method in all regimes, from diffusion to free-streaming, is demonstrated by a number of numerical tests, and the effect of the choice of the closure relation on the results is discussed.
Understanding Biparental Sex Through the Absence of Triparental Sex

In the spirit of Fisher (1930), we propose that a theory of sex must, for reasonable parameter values, be capable of predicting that sexually produced ospring have only two parents, not three or more. As an example of the power of this approach, it is shown that the range of mutation rates that support the mutational deterministic (MD) hypothesis may, in fact, be small enough to cast doubt on it as a primary explanation of the ubiquity of biparental sex.
A High-Tech Twist on Abuse: Technology, Intimate Partner Stalking, and Advocacy

Technology, Intimate Partner Stalking, and Advocacy Cindy Southworth, Safety Net Project at the National Network to End Domestic Violence Fund Shawndell Dawson, Safety Net Project at the National Network to End Domestic Violence Fund Cynthia Fraser, Safety Net Project at the National Network to End Domestic Violence Fund Sarah Tucker, Safety Net Project at the National Network to End Domestic Violence Fund authors commissioned by
A System for High-Resolution Topology Optimization

A key requirement in 3D fabrication is to generate objects with individual exterior shapes and their interior being optimized to application-specific force constraints and low material consumption. Accomplishing this task is challenging on desktop computers, due to the extreme model resolutions that are required to accurately predict the physical shape properties, requiring memory and computational capacities going beyond what is currently available. Moreover, fabrication-specific constraints need to be considered to enable printability. To address these challenges, we present a scalable system for generating 3D objects using topology optimization, which allows to efficiently evolve the topology of high-resolution solids towards printable and light-weight-high-resistance structures. To achieve this, the system is equipped with a high-performance GPU solver which can efficiently handle models comprising several millions of elements. A minimum thickness constraint is built into the optimization process to automatically enforce printability of the resulting shapes. We further shed light on the question how to incorporate geometric shape constraints, such as symmetry and pattern repetition, in the optimization process. We analyze the performance of the system and demonstrate its potential by a variety of different shapes such as interior structures within closed surfaces, exposed support structures, and surface models.
The ATP-activated Hexameric Helicase of Bacteriophage T4 (gp41) Forms a Stable Primosome with a Single Subunit of T4-coded Primase (gp61)*

We have examined the formation of the primosome subassembly of the bacteriophage T4-coded DNA replication (elongation) complex from its helicase, primase, and DNA components. Previously, we had shown that the T4 helicase (gp41) exists in solution in a stable monomer ⇆ dimer equilibrium at physiological protein (and salt) concentrations and forms a hexamer upon activation by ATP (or GTP) binding (Dong, F., Gogol, E. P., and von Hippel, P. H. (1995) J. Biol. Chem. 270, 7462-7473). Here we report that the T4 primase (gp61) is a monomer in solution under the same conditions, and that the ATP-activated helicase binds to a single gp61 primase molecule on appropriate DNA templates to reconstitute a stable primosome. We show that: (i) the gp41 helicase alone does not form a stable complex with DNA templates, although this helicase by itself can carry out moderately processive ATP-driven translocation along single-stranded DNA (Young, M. C., Schultz, D. E., Ring, D., and von Hippel, P. H. (1994) J. Mol. Biol. 235, 1447-1458); (ii) the primase alone does form a stable complex with DNA; (iii) the helicase can bind to the primase-DNA complex in the presence of ATP or GTP to form a stable ternary complex; (iv) this complex consists of six helicase subunits and one primase subunit; and (v) the reconstituted primosome is stable for at least 10 to 20 min after NTP cleavage and dissociation of the hydrolysis products. These results strongly suggest that the functional T4 DNA replication primosome consists of an integrated 6:1 helicase-primase complex bound to DNA, and that the ATP-activated helicase hexamer remains intact throughout the processive DNA replication process.
Desirable Attributes in the Ideal Partner: Can they Vary According to Gender and Place of Residence?

Comprehending the choice of romantic partner is important in order to minimize possible problems stemming from confl ictive loving relationships. This study aimed to identify to what extent the preference for desirable attributes in an ideal partner vary according to the respondent’s gender and place of residence. A total of 3,124 people from capital cities (n = 1,583) or towns (n = 1,541) of the nine states of the Brazilian Northeast region participated in the study, with a mean age of 23.6 years (sd = 6.72) and 63.6% female. They answered the Desirable Attributes of the Ideal Partner Scale and demographic questions. Results (Manova) indicated differences in the desirable attributes in an ideal partner according to gender: the men gave greater importance to the athletic dimension, while the women scored higher in the accomplished dimension. An effect was also observed related to the place of residence, with the men living in towns presenting a higher mean score in the traditional dimension, whereas the women residing in this locality gave more importance to the athletic dimension. In conclusion, the place of residence and, above all, the gender were important in explaining the variations in preferences for attributes in an ideal partner, in agreement with the literature.
Applying Maintainability Oriented Software Metrics to Cabin Software of a Commercial Airliner

Airplane manufacturers are under an increasing pressure to integrate new hardware into the cabin of their planes. Clearly, this comes along with a need for changing and extending the attached software platforms as well. Anecdotally, these systems have often been criticized as hard to maintain. However, in practice there exists no scientifically sound analysis of their maintainability so far. As a first step towards such an analysis, we present the results of applying common software metrics on the cabin software of a current commercial passenger airplane in this paper and discuss their implications for its maintainability.
Mining Models for Automated Quality Assessment of Learning Objects

The present paper presents the results of an alternative approach for automatically evaluating quality inside learning object repositories that considers lower-level measures of the resources as possible indicators of quality. It is known that current repositories face a difficult situation, as their amount of resources tends to increase more rapidly than the number of evaluations provided by the community of users and experts. Alternative approaches for automatically assessing quality can relieve human-work and provide temporary quality information before more time and consuming evaluation is performed. We propose a methodology to automatically generate quality information about learning resources inside repositories with Artificial Neural Networks models. For that, we considered 34 low-level measures as possible indicators of quality and we used available evaluative metadata inside two world recognized repositories (MERLOT and Connexions) as baseline information for the establishment of classes of quality. The preliminary findings point out the feasibility of such an approach and can be used as a starting point in the process of automatically generating internal quality information about learning objects inside repositories.
Design optimization of GIS spacer based on improved particle swarm optimization

A novel particle swarm optimization (PSO) based on chaos searching has been proposed and introduced to optimize the electrical apparatus. The improved PSO algorithm has both advantage of simplify for implement of original particle swarm optimization and advantage of fast convergence, easy to escape local minima for chaos optimization algorithm. The validity and feasibility of improved PSO algorithm have been verified by deliberately designed Rastrigin function and optimized 500 kV GIS spacer. The more uniform electric field distribution is obtained by optimized the structure of spacer. The improved optimization has also provided a new method for the design of complex apparatus structure.
Live and incremental whole-system migration of virtual machines using block-bitmap

In this paper, we describe a whole-system live migration scheme, which transfers the whole system run-time state, including CPU state, memory data, and local disk storage, of the virtual machine (VM). To minimize the downtime caused by migrating large disk storage data and keep data integrity and consistency, we propose a three-phase migration (TPM) algorithm. To facilitate the migration back to initial source machine, we use an incremental migration (IM) algorithm to reduce the amount of the data to be migrated. Block-bitmap is used to track all the write accesses to the local disk storage during the migration. Synchronization of the local disk storage in the migration is performed according to the block-bitmap. Experiments show that our algorithms work well even when I/O-intensive workloads are running in the migrated VM. The downtime of the migration is around 100 milliseconds, close to shared-storage migration. Total migration time is greatly reduced using IM. The block-bitmap based synchronization mechanism is simple and effective. Performance overhead of recording all the writes on migrated VM is very low.