Miracle-dz/UniFAR-FTUs huggingface dataset:
Integrating and extending competing intention models to understand the entrepreneurial intention of senior university students

PurposeThe growing interest in the development of entrepreneurial intention (EI) that has increased the importance of theories that explain and anticipate the tendency among individuals to start a new business. However, most of these theories focus on the relationship between entrepreneurs perceptions and their intention and ignore the cognitive and psychological characteristics that might configure their perceptions. Therefore, the purpose of this paper is to integrate the theory of planned behaviour (TPB) with the entrepreneurial event model (EEM) and to extend the combined model to include the personality characteristics of an entrepreneur that might shape the perceptions and intentions.Design/methodology/approachThis study uses a sample of 688 senior university students (Emirati nationals, 91.2 per cent and expatriates, 8.8 per cent) and employs positivist research with a quantitative approach, adopting a survey strategy through questionnaires and structural equation modelling.FindingsThe results demonstrate the relevance and robustness of the suggested combined and extended model in the prediction of intention on the part of senior university students to become entrepreneurs (explained variance=73.3 per cent) based on survey data (2017;n= 688). Originality/valueThe main contribution of this paper lies not only in the integration of the TPB and the EEM, but also in extending the two theories on which it is based through adding entrepreneurial personality characteristics and an explanation of the mechanism through which entrepreneurial perceptions and EI develop.
Exploiting locality for irregular scientific codes

Irregular scientific codes experience poor cache performance due to their irregular memory access patterns. In this paper, we present two new locality improving techniques for irregular scientific codes. Our techniques exploit geometric structures hidden in data access patterns and computation structures. Our new data reordering (GPART) finds the graph structure within data accesses and applies hierarchical clustering. Quality partitions are constructed quickly by clustering multiple neighbor nodes with priority on nodes with high degree and repeating a few passes. Overhead is kept low by clustering multiple nodes in each pass and considering only edges between partitions. Our new computation reordering (Z-SORT) treats the values of index arrays as coordinates and reorders corresponding computations in Z-curve order. Applied to dense inputs, Z-SORT achieves performance close to data reordering combined with other computation reordering but without the overhead involved in data reordering. Experiments on irregular scientific codes for a variety of meshes show locality optimization techniques are effective for both sequential and parallelized codes, improving performance by 60-87 percent. GPART achieved within 1-2 percent of the performance of more sophisticated partitioning algorithms, but with one third of the overhead. Z-SORT also yields the performance improvement of 64 percent for dense inputs, which is comparable with data reordering combined with computation reordering
A Proposal of QoS-aware Power Saving Scheme for SDN-based Networks

The amount of Internet traffic is increasing rapidly day by day due to increase in Internet users and communication devices such as smart phones. In order to handle network traffic, network devices such as routers and switches are being added steadily causing significant power consumption by the network. Internet traffic at a particular place/country fluctuates in different time of a day and different day of a week. However, network devices are configured to operate fully whether they are idle or fully utilized. Many researchers have proposed schemes to reduce power consumption by network devices by putting their links or devices themselves to sleep when their utilization is less than a certain threshold. However, the schemes do not consider the types and QoS of traffic when putting the devices or links to sleep. It has been noted that lower the rate of a link, the lesser it consumes energy. In this paper, instead of putting devices or links to sleep, we reduce the rate of links in order to save energy as well as satisfy the QoS of the traffic. We distinguish two types of traffic Real-Time and non-Real-Time. We maintain the shortest path delivery (QoS) for Real-Time traffic and reroute non-Real-Time traffic if needed to reduce the rate of a link. The simulation results have shown that we can reduce the power consumption by network devices and at the same time maintain the QoS of the traffic.
ALTERNATING PROJECTIONS ON LOW-DIMENSIONAL MANIFOLDS

Let B 0 be a point in some space, which in the applications we have in mind could be a signal or image. We consider sequences (B k) ∞ k=0 of points obtained by projecting back and forth between two manifolds M 1 and M 2 ,a n dg i v ec o n d i t i o n sg u a r a n t e e i n gt h a tt h es e q u e n c ec o n v e r g et oal i m i tB∞ ∈ M 1 ∩ M 2 . O u rm o t i v a t i o ni s the study of algorithms based on finding the limit of such sequences, which have proven useful in a number of areas, [3]. The intersection is typically a set with desirable properties, but for which there is no efficient method of finding the closest point Bopt in M 1 ∩ M 2 . W ep r o v en o to n l yt h a tt h es e q u e n c eo fa l t e r n a t i n gp r o j e c t i o n sc o n v e r g e s ,b u t that the limit point is fairly close to Bopt,i nam a n n e rr e l a t i v et ot h ed i s t a n c eï¿¿B 0 − Boptï¿¿,t h e r e b ys i g n i fi c a n t l y improving earlier results in the field. A concrete example with applications to frequency estimation of signals is also presented. 1. Introduction. Let K be a finite dimensional Hilbert space over R and let M 1 , M 2 ⊂ K be manifolds. Suppose that for any B ∈ K the closest point on M j , j = 1 or j = 2, is well defined and lets denote it by π j (B). A problem of great practical interest is how to find the closest point in M 1 ∩ M 2 , which we denote by π(B). It is a classical result by von Neumann that if M 1 and M 2 are affine linear manifolds, then the sequence of alternating projections
Analyzing an UWB Bandpass Filter for High Power Applications Using Rectangular Coaxial Cables with Square Inner Conductors

Using the finite element method (FEM) in two dimensions and the CST MICROWAVE STUDIO® (CST MWS) Transient Solver, the electromagnetic (EM) analysis and the design of a novel compact ultra wideband (UWB) bandpass filter using rectangular coaxial cables with square inner conductors, convenient for high power applications, are presented. The design of the UWB BP filter is based on the use of impedance steps and coupled-line sections. The center frequency around 6.85 GHz was selected, the bandwidth is between 3-10 GHz, the insertion-loss amounts to around 0.35 dB and the return loss is found higher than 10 dB in a large frequency range (4-9.5) GHz. The simulated results of stopband performances are better than 15 dB for a frequency range up to 11 GHz. For the selected center frequency and on a substrate with a dielectric constant of 2.03, the rectangular coaxial cables BPF with square inner conductors is only 6.7 × 8.9 × 33.4 mm in size.
On entropy measures for dynamic network topologies: limits to MANET

What are the fundamental limits on the communications potential of wireless networks? We contend that quantifying topological dynamics resulting from node movement enables one to: find the minimum overhead required by the network to maintain connectivity and, calculate the communication potential of the network. A mobility metric is proposed for the unbiased comparison of networks. This is an entropy measure based on the uncertainty of change in the topology of the network, and is referred to as topological uncertainty. Topological uncertainty determines the minimum overhead required by the network to correctly identify the topology and hence, provide node connectivity. We use topological uncertainty to derive fundamental bounds on the maximum bit rate available within a mobile ad-hoc networking environment. Our work demonstrates the potential of entropy measures to describe the complexities of node connectivity within wireless networks
Mobile malware detection in sandbox with live event feeding and log pattern analysis

In recent years, the use of smart devices is becoming increasingly popular. All kinds of mobile applications are emerging. In addition to the official market, there are also many ways to allow users to download the mobile app. As unidentified instances of malware grow day by day, off-the-shelf malware detection methods identify malicious programs mainly with extracted signatures of codes, which only can effectively identify already known malwares, but not new malwares in initial spread. If no samples of these malwares are reported and the virus code library is not patched, users won't be alerted to the malwares. Therefore, this paper proposed a new detection method by live log analysis. A sandbox is conducted to mimic human operations and monitor responses from APPs. Feeding these manual events can excite deactivated malwares and improve the accuracy of log analysis, even though these malware are unknown yet. This study takes recent malwares and benign programs to conduct experiments, and then verifies the effectiveness of the proposed method comparing with those in other papers. The experimental results show that the proposed method outperforms in both hit rate and pass rate.
Common stochastic trends, cycles and sectoral fluctuations: a study of output in the UK ✼

Two alternative methodologies are compared for identifying common trends and cycles in a set of variables. One, following Harvey, uses an unobserved components structural time series model. The other, following Vahid and Engle, is based on a multivariate BeveridgeNelson decomposition. Both approaches are applied to a four sector model of output in the UK over the period 1970Q1-1993Q2, producing different trends and cycles. The cycles from the unobserved components model correspond more closely to a reference cycle for aggregate output.
Conjoint Modeling of Temporal Dependencies in Event Streams

Many real world applications depend on modeling the temporal dynamics of streams of diverse events, many of which are rare. We introduce a novel model class, Conjoint Piecewise-Constant Conditional Intensity Models, and a learning algorithm that together yield a data-driven approach to parameter sharing with the aim of better modeling such event streams. We empirically demonstrate that our approach yields more accurate models of two real world data sets: search query logs and data center system logs.
AUTOMATIC EXUDATES DETECTION FROM NON-DILATED DIABETIC RETINOPATHY RETINAL IMAGE USING FUZZY C-MEANS CLUSTERING

Exudates are the primary signs of diabetic retinopathy which are mainly cause of blindness. It could be prevented with an early screening process. Pupil dilation is required in the normal screening process but this affects patients’ vision. Automatic computerized screening should facilitate screening process, reduce inspection time and increase accuracy. In this paper we proposed an automatic method to detect exudates from low-contrast digital images of retinopathy patients with non-dilated pupils using a Fuzzy C-Means (FCM) clustering technique. Intensity, standard deviation on intensity, hue and a number of edge pixels, were selected as main features to supply to FCM method. The number of cluster optimization was based on sensitivity and specificity which were calculated by comparison of the detected results and hand-drawn groundtruths from expert ophthalmologists. From the result, it is found that the proposed method detected exudates successfully with high accuracy of 92.18 % and 91.52 % for sensitivity and specificity respectively.
Opening up to agile games development

In fast-paced busIness envIronments like computer games, agile would seem to be the appropriate style of software development. However, our study of three computer game studios revealed that game development does not deploy agile methods as such, but rather it shares some of agile's practices and values. We were intrigued by how agility was triggered in game development; triggers undocumented by proponents of agile methods. this article distils our findings into guidelines for nurturing and enhancing agility in creative software organizations. Game development is both inspirational and unpredictable. a game's features may never be fully known at the outset of a project, but emerge as the developers continually play-test it. this is because a commercial game must be fun, entertaining and compelling; 10 qualities that are only really assessable when a game is compiled and played. agile methods would suggest that game developers write a test script. this is perhaps more feasible when building commercial task-oriented software, but a computer game has an added aesthetic dimension to it; not just in terms of the look and feel, but the game-play too, i.e. the rules and level of difficulty of the game. In this respect, a game also needs to be tested intuitively by the developers; it may functionally run, but is it fun? As far as Agile developers are concerned , the issue is mostly about having working code. 6 In Agile methods such as XP, 2 testing is part of a programmer's everyday life. 2 In XP, testing takes place within the context of a small cycle or iteration alongside other activities such as analysis and design. Iterative development is believed to be largely responsible for enabling agility, as the team can react expeditiously to changes in the environment. 1 Such flexible practices are infused with Agile values of simplicity , communication, feedback, and courage, 6 and demand developers who can " hang out on the edge. " 5 In this article we present new findings on agility in game development, and what triggers it, based on a study of three computer games studios. three computer Games studios We conducted studies at CGS (Singa-pore), Miko (Singapore) and Goo (Lon-don). All are well known game studios, and Goo is one of the world's largest developers of mobile games. CGS has developed mobile phone and PC games in association with studios in Europe, where their games are also widely distributed, and …
Thermostabilization of Proteins by Diglycerol Phosphate, a New Compatible Solute from the HyperthermophileArchaeoglobus fulgidus

ABSTRACT Diglycerol phosphate accumulates under salt stress in the archaeonArchaeoglobus fulgidus (L. O. Martins, R. Huber, H. Huber, K. O. Stetter, M. S. da Costa, and H. Santos, Appl. Environ. Microbiol. 63:896–902, 1997). This solute was purified after extraction from the cell biomass. In addition, the optically active and the optically inactive (racemic) forms of the compound were synthesized, and the ability of the solute to act as a protecting agent against heating was tested on several proteins derived from mesophilic or hyperthermophilic sources. Diglycerol phosphate exerted a considerable stabilizing effect against heat inactivation of rabbit muscle lactate dehydrogenase, baker's yeast alcohol dehydrogenase, andThermococcus litoralis glutamate dehydrogenase. Highly homologous and structurally well-characterized rubredoxins fromDesulfovibrio gigas, Desulfovibrio desulfuricans (ATCC 27774), and Clostridium pasteurianum were also examined for their thermal stabilities in the presence or absence of diglycerol phosphate, glycerol, and inorganic phosphate. These proteins showed different intrinsic thermostabilities, with half-lives in the range of 30 to 100 min. Diglycerol phosphate exerted a strong protecting effect, with approximately a fourfold increase in the half-lives for the loss of the visible spectra of D. gigas and C. pasteurianumrubredoxins. In contrast, the stability of D. desulfuricansrubredoxin was not affected. These different behaviors are discussed in the light of the known structural features of rubredoxins. The data show that diglycerol phosphate is a potentially useful protein stabilizer in biotechnological applications.
Nonlinear observer and sliding mode control design for dynamic positioning of a surface vessel

In this paper, dynamic positioning of large surface vessel in harbor area using multiple autonomous tugboats is investigated. There are two objectives in this paper. First, a nonlinear observer is applied to estimate low frequency position and velocity of ship from noisy measurements. Furthermore, the nonlinear observer is also used to estimate the bias states of slow frequency disturbances due to wind, wave and current and filter out the wave frequency components. Second, sliding mode controller for slow speed trajectory tracking is proposed. The resulting sliding mode control law guarantees desirable performance of ship considered in environmental disturbances. The proposed approach has been simulated with a supply vessel model and found to work well.
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy

We derive here the Friedland–Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in r-regular bipartite graphs. It is shown that some of these bounds are asymptotically sharp. We improve the known lower bound for the three-dimensional monomer–dimer entropy.
sociaL suppoRt ModeRates the ReLationship BetWeen stRessoRs and task peRfoRMance thRough seLf-efficacy

This study examined the relationship between social support and objective task performance in a field setting. a sample of 197 participants, mean age 23.13 years (Sd 3.56) completed measures of stressors, social support, and self-efficacy prior to performance. moderated hierarchical regression analysis revealed significant (p < .05) main effects for stressors (R 2 = .12) and social support ( ∆R 2 = .14) in relation to performance, in the hypothesized directions. a significant interaction (∆R 2 = .06) suggested that social support moderated (buffered) the relationship between stressors and task performance. moderated mediation analysis demonstrated that social support was associated with increases in self-efficacy, and selfefficacy was associated with enhanced performance, but that this effect was only salient at moderate to high levels of stressors.
Multi-robot map alignment in visual SLAM

This paper focusses on the study of the Map Alignment problem in a multirobot SLAM context. Given a team of robots, we consider the situation in which each robot is building its own local map independently. These maps are landmark-based and three-dimensional. The local maps built by the different robots will have different reference systems. At some point, it may be interesting to express all maps in the same reference system. In that way, the maps can be fused into a unique global one. This is known as the map fusion problem and can be tackled by dividing the problem into two subproblems: map alignment and map merging. In this paper, we concentrate on the map alignment problem which consist on computing the transformation between the local maps so that we have one reference system. We therefore evaluate a set of aligning methods. These methods establish correspondences between each pair of maps and compute an initial estimate of the alignment. Finally, we apply the least squares minimization to obtain a more accurate solution. We also concentrate on the case in which we want to align more than two local maps. In this case, the alignment must be globally consistent. For the experiments, real data are used. Each robot extracts distinctive 3D points from the environment with a stereo camera. Then, the robots use these observations as landmarks to build their maps while simultaneously localize themselves. The SLAMproblem is solved using the FastSLAM algorithm. The movements of the robots occur only in 2D plane, so although the maps are 3D landmark-based, the alignment takes place only in 2D.
A New Approach to Homeostatic Regulation: Towards a Unified View of Physiological and Ecological Concepts

Stoichiometric homeostasis is the ability of an organism to keep its body chemical composition constant, despite varying inputs. Stoichiometric homeostasis therefore constrains the metabolic needs of consumers which in turn often feed on resources not matching these requirements. In a broader context, homeostasis also relates to the capacity of an organism to maintain other biological parameters (e.g. body temperature) at a constant level over ambient environmental variations. Unfortunately, there are discrepancies in the literature and ecological and physiological definitions of homeostasis are disparate and partly contradictory. Here, we address this matter by reviewing the existing knowledge considering two distinct groups, regulators and conformers and, based on examples of thermo- and osmoregulation, we propose a new approach to stoichiometric homeostasis, unifying ecological and physiological concepts. We suggest a simple and precise graphical way to identify regulators and conformers: for any given biological parameter (e.g. nutrient stoichiometry, temperature), a sigmoidal relation between internal and external conditions can be observed for conformers while an inverse sigmoidal response is characteristic of regulators. This new definition and method, based on well-studied physiological mechanisms, unifies ecological and physiological approaches and is a useful tool for understanding how organisms are affected by and affect their environment.
A Parallel Incompressible Flow Solver Package with a Parallel Multigrid Elliptic Kernel

A parallel time-dependent incompressible flow solver and a parallel multigrid elliptic kernel are described. The flow solver is based on a second-order projection method applied to a staggered finite-difference grid. The multigrid algorithms implemented in the elliptic kernel, which is needed by the flow solver, are V-cycle and full V-cycle schemes. A grid-partition strategy is used in the parallel implementations of both the flow solver and the multigrid elliptic kernel on all fine and coarse grids. Numerical experiments and parallel performance tests show the parallel solver package is numerically stable, physically robust and computationally efficient. Both the multigrid elliptic kernel and the flow solver scale very well to a large number of processors on the Intel Paragon and the Cray T3D for computations with moderate granularity. The solver package has been carefully designed and coded so that it can be easily adapted to solving a variety of interesting two and three-dimensional flow problems. The solver package is portable to parallel systems that support MPI, PVM and Intel NX for interprocessor communications.
A 1.2V 15.6mW 81GHz 2:1 Static CML Frequency Divider with a Band-Pass Load in a 90nm SOI CMOS Technology

A 2:1 static frequency divider using a bandpass load was fabricated in a digital 90 nm SOI CMOS technology. The divider exhibits a maximum operating frequency of 81 GHz at 1.2 V, and a core power of 15.6 mW. The divider can operate down to 0.5 V at a maximum operating frequency of 75.6 GHz with a core power of 2.75 mW.
Split Private and Shared L2 Cache Architecture for Snooping-based CMP

Cache access latency and efficient usage of on-chip capacity are critical factors that affect the performance of the chip multiprocessor (CMP) architecture. In this paper, we propose a SPS2 cache architecture and cache coherence protocol for snooping-based CMP, in which each processor has both private and shared L2 cache to balance latency and capacity. Our protocol is expressed in a new state graph form, through which we prove our protocol by formal verification method. Simulation experiments shows that the SPS2 structure outperforms private L2 and shared L2 structure.