Miracle-dz/UniFAR-FTUs huggingface dataset:
Intra node parallelization of MPI programs with OpenMP

The availability of multiprocessors and high performance networks ooer the opportunity to construct CLUMPs (Cluster of Multiprocessors) and use them as parallel computing platforms. The main distinctive feature of the CLUMP architecture over the usual parallel computers is its hybrid memory model (message passing between the nodes and shared memory inside the nodes). Some of the primary issues to address for the CLUMP are: 1) to be able to execute the existing programs with few modiications 2) to provide some programming models coherent with the performance hierarchy of the data movements inside the CLUMP 3) to limit the eeort of the programmer while ensuring the portability of the codes on a wide variety of CLUMP conngurations. We investigate an approach based on the MPI and OpenMP standards. The approach consists in the intra-node parallelization of the MPI programs with an OpenMP directive based parallel compiler. The paper presents a detailed study of the approach in the context of the biprocessor PC CLUMPs. It provides three contributions. First, it evaluates the ability of bipro-cessor PCs to eeectively provide a speed up over single processor PCs in the context of shared memory parallel programs. Second, it investigates the method to transform MPI parallel programs in order to execute them on a CLUMP. Third, it presents the performance evaluation of this method applied on the NAS parallel benchmarks executed on a cluster of biprocessor PCs.
Policy-enabled Handoos across Heterogeneous Wireless Networks

1 Abstract \Access is the killer app" 3] is the vision of the Daedalus project at U.C. Berkeley. Being able to be connected seamlessly anytime anywhere to the best network still remains an unfulllled goal. Often, even determining the \best" network is a challenging task because of the widespread deployment of overlapping wireless networks. In this report, we describe a policy-enabled handoo system that allows users to express policies on what is the \best" wireless system at any moment, and make tradeoos among network characteristics and dynamics such as cost, performance and power consumption. We designed a performance reporting scheme estimating current network conditions, which serves as input to the policy speciication. A primary goal of this work is to make it possible to balance the bandwidth load across networks with comparable performance. We identiied the problem of handoo instability that may be caused by handoo synchronization, i.e., the scenario of many mobile hosts making the same handoo decision at essentially the same time. We use ran-domization to break such synchronizations. Given the current \best" network, our system also determines whether the handoo is worthwhile based on the handoo overhead and potential network usage duration. 2 Introduction Katz, et al. 8], has viewed today's collection of infrared, radio wireless LAN, cellular and satellite networks as an overlaid structure of room-size, building
Unicast routing on VANETs

Greedy routing in VANETs requires some geographical informations, such as the source location and the destination location. The first one could be obtained using some localization devices like GPS receiver. However, the second one is provided by a location service. This later has a high overhead especially if it is implemented over V2V (vehicle to vehicle) communications. Many location services are well known as HLS, RLS, GLS. This paper is interested in reducing this overhead by using some Road Side Units (RSU) already deployed along the roads. We propose here a location service called "improved Reactive Location Service (iRLS)", which is an extension of the RLS service. The major difference is that RLS assumes only V2V communications and iRLS takes profit of a wireless backbone based on RSUs to catch the destination's position. This allows to reduce the overhead instead of flooding requests and also makes the communication faster since we will not have to wait to the request to reach the destination before receiving the response and then starting sending data. In our proposal, the closest RSU will reply with the actual location. In order to show the contribution of our approach, we have conducted some simulations that prove that iRLS outperforms any geographic protocol by using the V2I communications in terms of end-to-end delay which is one of the most important parameter. We considered also the ratio of packet received correctly by the destination vehicle (PDR), our protocol improves significantly this second parameter, and ensures more than 20% of packets received correctly.
On-line collision detection of n-robot industrial manipulators using advanced collision map

This work addresses collision detection between n-robot industrial manipulators which are controlled using point-to-point commands in on-line mode. The robots are sharing the same workspace and have no prior knowledge of the commands which will be sent after start up the system. We have proposed an advanced collision map concept for detecting the collisions between only two robot manipulators. In this work, the advanced collision map method is generalized to detect the collisions between the whole body of n-robot and representing them as collision areas on single 2D-space map. To realize a collision-free trajectory of the robots, time scheduling of command execution time is successful to be applied to avoid collision areas on the map. The method is tested on an openGL-based simulator for demonstrating the effectiveness of the method.
Reliability and validity of the Chinese version of Trait Anger Scale in college students

Objective:To test the reliability and validity of the Chinese version of Spielberger' s Trait Anger Scale(TAS) in college students.Method: By convenience sampling,653 college students were selected and completed the forecasting version of TAS.Then 1866 college students were selected by stratified cluster sampling,and completed the formal Chinese version of TAS,Aggression Questionnaire,hostility subscale of SCL-90 and extroverted irritability subscale of Irritability,Depression and Anxiety Scale to test criterion validity.One hundred and eighty five students among them were retested with the TAS after 4 weeks to test test-retest reliability.Correlation analysis,exploratory factor analysis,confirmatory factor analysis were used for data processing.Results: The internal consistency reliability of the Chinese version of TAS was 0.80,and the test-retest reliability was 0.83. The correlation coefficient between items and total were higher than 0.30(0.43-0.72). The exploratory factor analysis extracted two factors(the eigenvalues were 3.724 and 1.424),confirmatory factor analysis revealed the structure of two-dimensional scale(χ2/df=7.02,RMSEA=0.06,RMR=0.02,NFI=0.97,CFI=0.97,IFI=0.97,GFI=0.98,AGFI=0.97,RFI=0.95). Chinese version of TAS maintained good criterion-related validity,and the correlation coefficients to criterions were 0.59,0.56,0.60 and 0.42,respectively.Conclusion: The Chinese version of TAS suggested good reliability and validity,and could be used for trait anger assessment in Chinese college students.
Indoor Tracking Using Crowdsourced Maps

Using crowdsourced visual and inertial sensor data for indoor mapping has attracted much attention in recent years. Nevertheless, the opportunities and challenges of indoor tracking using crowdsourced maps have not been fully explored. In this work, we aim at tackling the challenges due to incomplete obstacle information in crowdsourced indoor maps, especially at the initialization stage of crowdsourcing. We propose a novel solution for particle-filtering-based indoor tracking, using the crowdsourced maps derived from image-based 3D point clouds. Our solution enhances particle filtering with density-based collision detection and history-based particle regeneration. Evaluation with real user traces demonstrates that our solution outperforms the state-of-the-art. In particular, it reduces the average distance error of indoor tracking by 47% when using crowdsourced 3D point clouds.
Intelligent Digital Photo Management System Using Ontology and SWRL

The number of digital photos in the personal computer is exploding. Existing photo annotation and management systems suffer from some problems (some among them are quite serious), which discussed at the beginning of the full paper. Aiming at these problems, this paper proposed a solution based on ontology. First of all, the Family Album ontology is built to organize the domain knowledge and provide formal, explicit and conceptual annotation. Then we annotate preliminary semantic information for digital photos by automated extraction of semantic concepts from file titles, photo description texts, EXIF metadata and visual features of images etc. Furthermore, the SWRL (Semantic Web Rule Language) rules are written and executed to extend previous semantic annotations and support knowledge inference. Finally, an Onto Album prototype system is developed for verifying the validity of the proposed approach. Experimental results show that the proposed approach is very effective and promising.
How Can We Build a Good Project Configured Supply Chains

Project configured supply chains, or networks are becoming increasingly prevalent in a number of industries. Construction is one of them. Supplies and products in construction consists of material and immaterial, knowledge, elements. The paper argues however that in a knowledge economy, those two elements are increasingly intertwined and competition and markets will increasingly be constituted by the knowledge element.Creating value for the customers and the enterprises becomes dependent of the ability to organise and coordinate in the supply networks. This includes the issue of quality. The approach taken here is study the emergence of failures occurring in the supply chain, and thereby understanding its quality aspects better.The paper presents case study work done in Chinese construction. The method was to observe work at the construction site and interviewing actors following backwards upstream the supply chain to the origin of the failure. The building project followed generated 160 failures over a three month observation period. These were compiled and analysed. The economic consequences are calculated to be 8% of the production costs. The analysis of relations in the supply chain both shows relations to materials and knowledge aspect of the supply network and these to aspectspsila interaction. Most of the failures was generated in relation to knowledge processes and then occasionally transform into the material process.The paper proposes initiatives to strengthen partnerships in supply chains and especially at engineer to order production. The contradiction between the permanent enterprise organisation potentially capable of handling purchasing and the role of the project manager is discussed as a contradiction to overcome.
Algorithms for Scoring Coreference Chains

Scoring the performance of a system is an extremely important aspect of coreference algorithm performance. The score for a particular run is the single strongest measure of how well the system is performing and it can strongly determine directions for further improvements. In this paper, we present several di(cid:11)erent scoring algorithms and detail their respective strengths and weaknesses for varying classes of processing. We also demonstrate that tasks like information extraction have very di(cid:11)erent needs from information retrieval in terms of how to score the performance of coreference annotation.
Statistical Noise Analysis in SENSE Parallel MRI

A complete first and second order statistical characterization of noise in SENSE reconstructed data is proposed. SENSE acquisitions have usually been modeled as Rician distributed, since the data reconstruction takes place into the spatial domain, where Gaussian noise is assumed. However, this model just holds for the first order statistics and obviates other effects induced by coils correlations and the reconstruction interpolation. Those effects are properly taken into account in this study, in order to fully justify a final SENSE noise model. As a result, some interesting features of the reconstructed image arise: (1) There is a strong correlation between adjacent lines. (2) The resulting distribution is non-stationary and therefore the variance of noise will vary from point to point across the image. Closed equations for the calculation of the variance of noise and the correlation coefficient between lines are proposed. The proposed model is totally compatible with g-factor formulations.
A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits

We introduce a structural parameter of a graph, the longest directed path length (LDPL), and express the boundary of the difficulty of the problems along this parameter. The parallel complexity of the lexicographically first maximal independent set (LFMIS) problem gradually increases as the value of LDPL grows; the LFMIS problem on a graph of LDPL O(logkn) can be solved in O(logkn) time in parallel; and the problem is P-complete on a graph of LDPL Θ(n∊). Computing the LDPL itself is in NC2. This is important in the sense that a "measure" is valid only if measuring the complexity of a problem is easier than solving it. On the other hand, we also show the limits of the measure. We reduce the LFMIS problem to a kind of the lexicographically first maximal subgraph (LFMS) problems on a graph of LDPL 1. This implies that, even on a graph of LDPL 1, the LFMS problem is P-complete. Finally we discuss the probability that a random graph has LDPL l and show that a random graph of which each edge exists with probability p has LDPL Θ(np) with high probability. This implies the limit of the LDPL on the average case, because the LFMIS problem on a random graph can be efficiently solved in parallel.
A modified approach for Removal of High density Salt and Pepper Noise in Color Images

This paper proposed a simple edge preserved denoising algorithm to remove high density salt and pepper noise in digital color images. The proposal has three steps: noisy pixel detection, replacement of noisy pixels and edge preservation using Kuwahara filter. The noisy pixel is replaced by trimmed median value when some of the elements with value 0’s and 255’s are present in the selected window. If all the pixel values in the selected window are 0’s and 255’s then the noisy pixel is replaced by mean value of all the elements present in that selected window. The color images are denoised by extracting the R, G and B planes from the noisy image, denoised separately and are merged together to form the color image, rather than converting to gray for denoising and then reconstructing from the denoised gray image. The proposed algorithm will yields visually pleasing images in terms of qualitative and quantitative evaluation compared to other standard algorithms. Keyword -Color image de-noising, salt and pepper noise, Kuwahara filter.
Lambda gpP-DnaB Helicase Sequestration and gpP-RpoB Associated Effects: On Screens for Auxotrophs, Selection for RifR, Toxicity, Mutagenicity, Plasmid Curing

The bacteriophage lambda replication initiation protein P exhibits a toxic effect on its Escherichia coli (E. coli) host, likely due to the formation of a dead-end P-DnaB complex, sequestering the replicative DnaB helicase from further activity. Intracellular expression of P triggers SOS-independent cellular filamentation and rapidly cures resident ColE1 plasmids. The toxicity of P is suppressed by alleles of P or dnaB. We asked whether P buildup within a cell can influence E. coli replication fidelity. The influence of P expression from a defective prophage, or when cloned and expressed from a plasmid was examined by screening for auxotrophic mutants, or by selection for rifampicin resistant (RifR) cells acquiring mutations within the rpoB gene encoding the β-subunit of RNA polymerase (RNAP), nine of which proved unique. Using fluctuation assays, we show that the intracellular expression of P evokes a mutator effect. Most of the RifR mutants remained PS and localized to the Rif binding pocket in RNAP, but a subset acquired a PR phenotype, lost sensitivity to ColE1 plasmid curing, and localized outside of the pocket. One PR mutation was identical to rpo*Q148P, which alleviates the UV-sensitivity of ruv strains defective in the migration and resolution of Holliday junctions and destabilizes stalled RNAP elongation complexes. The results suggest that P-DnaB sequestration is mutagenic and supports an earlier observation that P can interact with RNAP.
On the relationships of faults for Boolean specification based testing

Various methods of generating test cases based on Boolean specifications have previously been proposed. These methods are fault-based in the sense that test cases are aimed at detecting particular types of faults. Empirical results suggest that these methods are good at detecting particular types of faults. However, there is no information on the ability of these test cases in detecting other types of faults. The paper summarizes the relationships of faults in a Boolean expression in the form of a hierarchy. A test case that detects the faults at the lower level of the hierarchy will always detect the faults at the upper level of the hierarchy. The hierarchy helps us to better understand the relationships of faults in a Boolean expression, and hence to select fault-detecting test cases in a more systematic and efficient manner.
Practical Application of Theory-Driven Intervention to Extension Programming

For education to be effective, educators need to understand pertinent theories concerning behavior change and to apply them in programming. The study reported here sought to determine if the Theory of Planned Behavior (TPB) could be used to design, implement, and evaluate a brief educational session. Results show a significant increase in participants' intentions in six areas and should be encouraging to educators who need to show impact but do not always have the advantage of delivering and evaluating a series of programming. The study serves as a model for educators to show impact despite a low intervention dose.
A Wide-Band Digital Phase-Locked Looop

A high speed digital phase-locked loop (DPLL) is designed using 0.18. m CMOS process, using a 3.3V power supply. It operates in the frequency range 55MHz — 1.43GHz. A (PFD) phase frequency detector has a zero dead-zone by including delay elements in the Reset path. The current source used in the charge pump makes it insensitive to supply variations and provides ripple-free control voltage for the VCO (voltage controlled oscillator), which provides low jitter and no overshoot in locking transients. A high damping factor of 1.65 is used to keep the PLL stable. Simulation results using CADENCE tools are provided to verify the desired performance.
An Approach to Product Roadmapping in Small Software Product Businesses

Success in software product business requires the release of new products and product upgrades with the right amount of features and quality within an open market window. For this, a systematic approach for managing the contents, timing and roles of future product releases as well as the product architecture is needed. In practice, such an approach is often missing, especially in small companies, due to inexperience, unclear priorities, time-tomarket pressures, or the lack of suitable process infrastructure. In this paper, we present an approach based on product roadmapping that can aid such companies in their product planning. We also discuss initial experiences from using the approach in three small software companies. The product roadmap expresses the release and development schedules, composition of individual releases, changes to the underlying technology, services requiring attention from product development and the planned resource usage.
Detection of re-compression, transcoding and frame-deletion for digital video authentication

In the wake of widespread surfeit of inexpensive and user-friendly digital multimedia alteration software, digital images and videos have lost the unparalleled position they once occupied as `authoritative testament of occurrence of events'. The inherent susceptibility of digital content to malevolent manipulations renders it vulnerable to our skepticism. Establishment of authenticity of digital content is of utmost importance in situations where reliability on fraudulent evidence could have serious consequences. With the intent of tackling a few of the several challenges of the video forensics domain, in this paper we propose a potent DCT coefficient analysis-based forensic technique for reliable detection of re-compression and transcoding in digital videos. This scheme facilitates visually perceptible differentiation between singly-compressed and re-compressed video frames while circumventing the need for undertaking any complicated peak periodicity analysis procedures that are normally associated with traditional DCT-based studies. We also present a unique optical-flow analysis scheme, where, instead of inspecting inconsistencies caused by frame-removal in the entire optical flow sequences of a given video, we focus entirely on the brightness gradient component of this flow. The experiments in this regard substantiate the forensic capabilities of this component and proffer observations conducive to the detection and localization of frame-removal in digital videos. Subjective and quantitative experimentation on a comprehensive dataset under a wide range of experimental set-ups validate the efficacy and resilience of the proposed techniques.
Novel Technique for Wideband Digital Predistortion of Power Amplifiers With an Under-Sampling ADC

Most conventional wideband digital predistortion (DPD) techniques require the use of a very high-speed analog-to- digital converter (ADC) in the feedback path. This paper proposes a novel technique, termed under-sampling restoration digital predistortion (USR-DPD), to linearize wideband power amplifiers (PAs) with ADCs that operate at sampling rates much lower than required by Nyquist limits for the predistorted band (under-sampling ADCs). The USR processing is implemented in an iterative way to restore full-band PA output information from the under-sampled output signal, allowing memory DPD models to be successfully extracted. The USR-DPD can operate in two modes: without and with a band-limiting filter in the feedback path. In comparison with conventional DPD techniques, the requirement for ADC sampling frequency can be significantly reduced using the USR-DPD approach. Experimental tests were realized for two PAs with numerous signals (10-, 20-, 40-, and 60-MHz long-term evolution signals) using different ADC sampling frequencies. The DPD with the under-sampling ADC could achieve comparable performances to its counterpart with a full-rate ADC, while using 3-5 times lower sampling frequency, and around -50-dBc adjacent channel power ratios were achieved.