Cybervetting Perceptions of Job Seekers in Saudi Arabia

Organizations have leveraged the use of social media (SM) in recruitment and selection to reach a wider pool of job applicants. The purpose of this study is to understand the perceptions of job seekers in Saudi Arabia using the job seekers’ attitudes toward the cybervetting (ATC) scale. This research is a quantitative cross-sectional study in which an online questionnaire was distributed among the target population who were seeking jobs and using social media sites. The ATC was translated to Arabic language and back-translated to English language and administered to a sample of 160 job applicants. The results showed negative perceptions of social media use as a screening and selection tool. Moreover, respondents perceived cybervetting negatively on the three dimensions tested: justice perceptions, privacy invasion, and face validity. The findings of this study have practical implications for human resources managers about the use of social media as an employee selection tool

Finding the Anticover of a String

A k-anticover of a string x is a set of pairwise distinct factors of x of equal length k, such that every symbol of x is contained into an occurrence of at least one of those factors. The existence of a k-anticover can be seen as a notion of non-redundancy, which has application in computational biology, where they are associated with various non-regulatory mechanisms. In this paper we address the complexity of the problem of finding a k-anticover of a string x if it exists, showing that the decision problem is NP-complete on general strings for k-3. We also show that the problem admits a polynomial-time solution for k = 2. For unbounded k, we provide an exact exponential algorithm to find a k-anticover of a string of length n (or determine that none exists), which runs in O(min{3 n-k 3 , ( k(k+1) 2 ) n k+1 }) time using polynomial space. 2012 ACM Subject Classification Mathematics of computing ! Combinatorics on words

Enhancing Business Performance Of CV. Jati Makmur Pasuruan Using E-brochure Marketing Strategy

This report provides an analysis and evaluation of CV Jati Makmur in entering the new market. CV. Jati Makmur is a plywood industry operating more than 15 years in producing woodworking, aiming to grasp the International market for expansion. There are various analysis methods included in the observation. These methods of analysis include Segmenting, Targeting, and Positioning. To conquer the market share in China and Japan as well to increase economic competitiveness several recommended strategies in incorporated. This strategy involves pricing strategy distribution and promotion strategy. In addition, this report also observes the fact that the analysis contains some limitations as well as risks. These risks include external factors such as Government, Competition, and Technology that will affect the future development of CV. Jati Makmur. This report finds the prospects for CV. Jati Makmur in its current position is positive. The major area of weakness requires further investigation and remedial action by management

Calibration of Thermal Dissipation Probes for Date Palm (Phoenix dactylifera L.)

The quantification of water flow through the stem is vital for date palm (Phoenix dactylifera L.) to promote a good water stress management. The thermal dissipation probe (TDP) method developed by Granier is widely used to evaluate transpiration of forest trees; however, there are contradictory reports regarding its reliability. Considerable errors in estimated sap flux density, which might be due to a lack ofspecies-specific calibrations. The TDP method uses a mathematical model that is based on an empirical equation to estimate sap flux density, which is claimed to be applicable to all tree species, independently of wood structure and anatomy. At the laboratory, we compared the rate of water uptake by cut stems with sap flux estimates derived from the TDP method to assess the validity of the method.Our calibration results were considerably different compared to the Granier’s original equation. Moreover, sap flux density was overestimated by 18.2 ± 0.5% when the original calibration parameters of Granierare employed. However, using new calibration parameters improved the accuracy of sap flow measurements. Our results indicated that it is not appropriate to use a general equation for different species. Therefore, previous estimations of date palm’s water requirement through thermal dissipation probes should be revised

Calibration of Thermal Dissipation Probes for Date Palm (Phoenix dactylifera L.)

The quantification of water flow through the stem is vital for date palm (Phoenix dactylifera L.) to promote a good water stress management. The thermal dissipation probe (TDP) method developed by Granier is widely used to evaluate transpiration of forest trees; however, there are contradictory reports regarding its reliability. Considerable errors in estimated sap flux density, which might be due to a lack ofspecies-specific calibrations. The TDP method uses a mathematical model that is based on an empirical equation to estimate sap flux density, which is claimed to be applicable to all tree species, independently of wood structure and anatomy. At the laboratory, we compared the rate of water uptake by cut stems with sap flux estimates derived from the TDP method to assess the validity of the method.Our calibration results were considerably different compared to the Granier’s original equation. Moreover, sap flux density was overestimated by 18.2 ± 0.5% when the original calibration parameters of Granierare employed. However, using new calibration parameters improved the accuracy of sap flow measurements. Our results indicated that it is not appropriate to use a general equation for different species. Therefore, previous estimations of date palm’s water requirement through thermal dissipation probes should be revised

IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences

Background: An inverted repeat is a DNA sequence followed downstream by its reverse complement, potentially with a gap in the centre. Inverted repeats are found in both prokaryotic and eukaryotic genomes and they have been linked with countless possible functions. Many international consortia provide a comprehensive description of common genetic variation making alternative sequence representations, such as IUPAC encoding, necessary for leveraging the full potential of such broad variation datasets. Results: We present IUPACpal, an exact tool for efficient identification of inverted repeats in IUPAC-encoded DNA sequences allowing also for potential mismatches and gaps in the inverted repeats. Conclusion: Within the parameters that were tested, our experimental results show that IUPACpal compares favourably to a similar application packaged with EMBOSS. We show that IUPACpal identifies many previously unidentified inverted repeats when compared with EMBOSS, and that this is also performed with orders of magnitude improved speed.</p

Comparing Degenerate Strings

Uncertain sequences are compact representations of sets of similar strings. They highlight common segments by collapsing them, and explicitly represent varying segments by listing all possible options. A generalized degenerate string (GD string) is a type of uncertain sequence. Formally, a GD string S is a sequence of n sets of strings of total size N, where the ith set contains strings of the same length ki but this length can vary between different sets. We denote by W the sum of these lengths k0, k1,... , kn-1. Our main result is an (N + M)-time algorithm for deciding whether two GD strings of total sizes N and M, respectively, over an integer alphabet, have a non-empty intersection. This result is based on a combinatorial result of independent interest: although the intersection of two GD strings can be exponential in the total size of the two strings, it can be represented in linear space. We then apply our string comparison tool to devise a simple algorithm for computing all palindromes in S in (min{W, n2}N)-time. We complement this upper bound by showing a similar conditional lower bound for computing maximal palindromes in S. We also show that a result, which is essentially the same as our string comparison linear-time algorithm, can be obtained by employing an automata-based approach

Longest Common Prefixes with kk-Errors and Applications

Although real-world text datasets, such as DNA sequences, are far from being uniformly random, average-case string searching algorithms perform significantly better than worst-case ones in most applications of interest. In this paper, we study the problem of computing the longest prefix of each suffix of a given string of length $n$ over a constant-sized alphabet that occurs elsewhere in the string with $k$-errors. This problem has already been studied under the Hamming distance model. Our first result is an improvement upon the state-of-the-art average-case time complexity for non-constant $k$ and using only linear space under the Hamming distance model. Notably, we show that our technique can be extended to the edit distance model with the same time and space complexities. Specifically, our algorithms run in $\mathcal{O}(n \log^k n \log \log n)$ time on average using $\mathcal{O}(n)$ space. We show that our technique is applicable to several algorithmic problems in computational biology and elsewhere

Burnout among surgeons before and during the SARS-CoV-2 pandemic: an international survey

Background: SARS-CoV-2 pandemic has had many significant impacts within the surgical realm, and surgeons have been obligated to reconsider almost every aspect of daily clinical practice. Methods: This is a cross-sectional study reported in compliance with the CHERRIES guidelines and conducted through an online platform from June 14th to July 15th, 2020. The primary outcome was the burden of burnout during the pandemic indicated by the validated Shirom-Melamed Burnout Measure. Results: Nine hundred fifty-four surgeons completed the survey. The median length of practice was 10&nbsp;years; 78.2% included were male with a median age of 37&nbsp;years old, 39.5% were consultants, 68.9% were general surgeons, and 55.7% were affiliated with an academic institution. Overall, there was a significant increase in the mean burnout score during the pandemic; longer years of practice and older age were significantly associated with less burnout. There were significant reductions in the median number of outpatient visits, operated cases, on-call hours, emergency visits, and research work, so, 48.2% of respondents felt that the training resources were insufficient. The majority (81.3%) of respondents reported that their hospitals were included in the management of COVID-19, 66.5% felt their roles had been minimized; 41% were asked to assist in non-surgical medical practices, and 37.6% of respondents were included in COVID-19 management. Conclusions: There was a significant burnout among trainees. Almost all aspects of clinical and research activities were affected with a significant reduction in the volume of research, outpatient clinic visits, surgical procedures, on-call hours, and emergency cases hindering the training. Trial registration: The study was registered on clicaltrials.gov "NCT04433286" on 16/06/2020

Off-line and on-line algorithms for closed string factorization

A string X = X[1..n], n > 1, is said to be closed if it has a nonempty proper prefix that is also a suffix, but that otherwise occurs nowhere else in X; for n = 1, every X is closed. Closed strings were introduced by Fici in [1] as objects of combinatorial interest. Recently Badkobeh et al. [2] described a variety of algorithms to factor a given string into closed factors. In particular, they studied the Longest Closed Factorization (LCF) problem, which greedily computes the decomposition X = X1X2・・・Xk, where X1 is the longest closed prefix ofX, X2 the longest closed prefix ofX with prefixX1 removed, and so on. In this paper we present an O(log n) amortized per character algorithm to compute LCF on-line, where n is the length of the string. We also introduce the Minimum Closed Factorization (MCF) problem, which identifies the minimum number of closed factors that cover X. We first describe an off-line O(n log2 n)-time algorithm to compute MCF(X), then we present an on-line algorithm for the same problem. In fact, we show that MCF(X) can be computed in O(Llog n) time from MCF(X_), where X_ = X[1..n−1], and L is the largest integer such that the suffix X[n−L+1..n] is a substring of X_