Development of ergonomic posture recognition technique based on 2D ordinary camera for construction hazard prevention through view-invariant features in 2D skeleton motion

Outdoor tasks operated by construction workers are physically demanding, requiring awkward postures leading to pain, injury, accident, or permanent disability. Ergonomic posture recognition (EPR) technique could be a novel solution for ergonomic hazard monitoring and assessment, yet non-intrusiveness and applicability in complex outdoor environment are always critical considerations for device selection in construction site. Thus, we choose RGB camera to capture skeleton motions, which is non-intrusive for workers compared with wearable sensors. It is also stable and widely used in an outdoor construction site considering various light conditions and complex working areas. This study aims to develop an ergonomic posture recognition technique based on 2D ordinary camera for construction hazard prevention through view-invariant features in 2D skeleton motion. Based on captured 2D skeleton motion samples in the test-run, view-invariant features as classifier inputs were extracted to ensure the learned classifier not sensitive to various camera viewpoints and distances to a worker. Three posture classifiers regarding human back, arms, and legs were employed to ensure three postures to be recognized simultaneously in one video frame. The average accuracies of three classifiers in 5-fold cross validation were as high as 95.0%, 96.5%, and 97.6%, respectively, and the overall accuracies tested by three new activities regarding ergonomic assessment scores captured from different camera heights and viewpoints were 89.2%, 88.3%, and 87.6%, respectively. The developed EPR-aided construction accident auto-prevention technique demonstrated robust accuracy to support on-site postural ergonomic assessment for construction workers’ safety and health assurance.     

Musculoskeletal symptoms among mobile hand-held device users and their relationship to device use: A preliminary study in a Canadian university population

The study aims were, in a population of university students, staff, and faculty (n = 140), to: 1) determine the distribution of seven measures of mobile device use; 2) determine the distribution of musculoskeletal symptoms of the upper extremity, upper back and neck; and 3) assess the relationship between device use and symptoms. 137 of 140 participants (98%) reported using a mobile device. Most participants (84%) reported pain in at least one body part. Right hand pain was most common at the base of the thumb. Significant associations found included time spent internet browsing and pain in the base of the right thumb (odds ratio 2.21, 95% confidence interval 1.02–4.78), and total time spent using a mobile device and pain in the right shoulder (2.55, 1.25–5.21) and neck (2.72, 1.24–5.96). Although this research is preliminary, the observed associations, together with the rising use of these devices, raise concern for heavy users.     

A key points-based blind watermarking approach for vector geo-spatial data

This paper presents a blind watermarking approach to protecting vector geo-spatial data from illegal use. By taking into account usability, invisibility, robustness, and blindness, the approach firstly determines three feature layers of the geo-spatial data and selects the key points from each layer as watermark embedding positions. Then it shuffles the watermark and embeds it in the least significant bits (LSBs) of the coordinates of the key points. A similar process for selecting the feature layers and the key points in the watermark embedding process is carried out to detect the watermark followed by obtaining the embedded watermark from the LSBs of the coordinates of the key points. Finally, the similarity degrees of three versions of the watermark from three feature layers are calculated to check if the data contains the watermark. Our experiments show that the method is rarely affected by data format change, random noise, similarity transformation of the data, and data editing.     

Succinct representation of dynamic trees

We study the problem of maintaining a dynamic ordered tree succinctly under updates of the following form: insertion or deletion of a leaf, insertion of a node on an edge (edge subdivision) or deletion of a node with only one child (the child becomes a child of its former grandparent). We allow satellite data of a fixed size to be associated to the nodes of the tree.We support update operations in constant amortized time and support access to satellite data and basic navigation operations in worst-case constant time; the basic navigation operations include parent, first/last-child, previous/next-child. These operations are moving from a node to its parent, leftmost/rightmost child, and its previous and next child respectively.We demonstrate that to efficiently support more extended operations, such as determining the i-th child of a node, rank of a child among its siblings, or size of the subtree rooted at a node, one requires a restrictive pattern for update strategy, for which we propose the finger-update model. In this model, updates are performed at the location of a finger that is only allowed to crawl on the tree between a child and a parent or between consecutive siblings. Under this model, we describe how the named extended operations are performed in worst-case constant time.Previous work on dynamic succinct trees (Munro et al., 2001 [17]; Raman and Rao, 2003 [19]) is mainly restricted to binary trees and achieves poly-logarithmic (Munro et al., 2001 [17]) or “poly-log-log” (Raman and Rao, 2003 [19]) update time under a more restricted model, where updates are performed in traversals starting at the root and ending at the root and queries can be answered when the traversal is completed. A previous result on ordinal trees achieves only sublinear amortized update time and “poly-log-log” query time (Gupta et al., 2007 [11]). More recently, the update time has been improved to O(logn/loglogn) while queries can be performed in O(logn/loglogn) time (Sadakane and Navarro, 2010 [20]).     

A Deformation Field for Euler–Bernoulli Beams with Applications to Flexible Multibody Dynamics

The deformation field commonly used for Euler–Bernoulli beamsin structural dynamics is investigated to determine its suitability foruse in flexible multibody dynamics. It is found that the traditionaldeformation field fails to produce an elastic rotation matrix that iscomplete to second-order in the deformation variables. A completesecond-order deformation field is proposed along with the equationsneeded to incorporate the beam model into a graph-theoretic formulationfor flexible multibody dynamics [1]. This beam modeland formulation have been implemented in a symbolic computer programcalled DynaFlex that can use Taylor, Chebyshev, or Legendrepolynomials as the basis functions in a Rayleigh–Ritz discretizationof the beam's deformation variables. To demonstrate the effects of the proposed second-order deformationfield on the response of a flexible multibody system,two examples are presented.     

Robust stability and H-infinity control for uncertain discrete-time Markovian jump singular systems

The robust stability and stabilization, and H-infinity control problems for discrete-time Markovian jump singular systems with parameter uncertainties are discussed. Based on the restricted system equivalent （r.s.e.） transformation and by introducing new state vectors, the singular system is transformed into a discrete-time Markovian jump standard linear system, and the linear matrix inequality （LMI） conditions for the discrete-time Markovian jump singular systems to be regular, causal, stochastically stable, and stochastically stable with 7- disturbance attenuation are obtained, respectively. With these conditions, the robust state feedback stochastic stabilization problem and H-infinity control problem are solved, and the LMI conditions are obtained. A numerical example illustrates the effectiveness of the method given in the oaoer.     

Quantum Complexity of Testing Group Commutativity

We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pak, who gave a randomized algorithm involving O(k) group operations. We construct a quite optimal quantum algorithm for this problem whose complexity is in . The algorithm uses and highlights the power of the quantization method of Szegedy. For the lower bound of , we give a reduction from a special case of Element Distinctness to our problem. Along the way, we prove the optimality of the algorithm of Pak for the randomized model.     

Bounds on the bisection width for random d -regular graphs

In this paper we provide an explicit way to compute asymptotically almost sure upper bounds on the bisection width of random d$d$-regular graphs, for any value of d$d$. The upper bounds are obtained from the analysis of the performance of a randomized greedy algorithm to find bisections of d$d$-regular graphs. We provide bounds for 5≤d≤12$5\le d\le 12$. We also give empirical values of the size of the bisection found by the algorithm for some small values of d$d$ and compare them with numerical approximations of our theoretical bounds. Our analysis also gives asymptotic lower bounds for the size of the maximum bisection.     

Quorum Systems Constructed from Combinatorial Designs

A quorum system is a set system in which any two subsets have nonempty intersection. Quorum systems have been extensively studied as a method of maintaining consistency in distributed systems. Important attributes of a quorum system include the load, balancing ratio, rank (i.e., quorum size), and availability. Many constructions have been presented in the literature for quorum systems in which these attributes take on optimal or otherwise favorable values. In this paper, we point out an elementary connection between quorum systems and the classical covering systems studied in combinatorial design theory. We look more closely at the quorum systems that are obtained from balanced incomplete block designs (BIBDs). We study the properties of these quorum systems and observe that they have load, balancing ratio, and rank that are all within a constant factor of being optimal. We also provide several observations about computing the failure polynomials of a quorum system (failure polynomials are used to measure availability). Asymptotic properties of failure polynomials have previously been analyzed for certain infinite families of quorum systems. We give an explicit formula for the failure polynomials for an easily constructed infinite class of quorum systems. We also develop two algorithms that are useful for computing failure polynomials for quorum systems and prove that computing failure polynomials is #P-hard. Computational results are presented for several “small” quorum systems obtained from BIBDs.