Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time

Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free XML storage structures with as few scheme trees as possible. Redundancy-free XML structures guarantee both economy in storage space and the absence of update anomalies, and having the least number of scheme trees requires the fewest number of joins to navigate among the data elements. We know that the general problem is intractable. The problem may still be intractable even when the hypergraph is acyclic and each hyperedge is in Boyce–Codd normal form (BCNF). As we show here, however, given an acyclic hypergraph with each hyperedge in BCNF, a polynomial-time algorithm exists that generates a largest possible redundancy-free XML storage structure. Successively generating largest possible scheme trees from among hyperedges not already included in generated scheme trees constitutes a reasonable heuristic for finding the fewest possible scheme trees. For many practical cases, this heuristic finds the set of redundancy-free XML storage structures with the fewest number of scheme trees. In addition to a correctness proof and a complexity analysis showing that the algorithm is polynomial, we also give experimental results over randomly generated but appropriately constrained hypergraphs showing empirically that the algorithm is indeed polynomial.     

Using Visualization to Explore Original and Anonymized LBSN Data

We present GSUVis, a visualization tool designed to provide better understanding of location‐based social network (LBSN) data. LBSN data is one of the most important sources of information for transportation, marketing, health, and public safety. LBSN data consumers are interested in accessing and analysing data that is as complete and as accurate as possible. However, LBSN data contains sensitive information about individuals. Consequently, data anonymization is of critical importance if this data is to be made available to consumers. However, anonymization commonly reduces the utility of information available. Working with privacy experts, we designed GSUVis a visual analytic tool to help experts better understand the effects of anonymization techniques on LBSN data utility. One of GSUVis's primary goals is to make it possible for people to use LBSN data, without requiring them to gain deep knowledge about data anonymization. To inform the design of GSUVis, we interviewed privacy experts, and collected their tasks and system requirements. Based on this understanding, we designed and implemented GSUVis. It applies two anonymization algorithms for social and location trajectory data to a real‐world LBSN dataset and visualizes the data both before and after anonymization. Through feedback from domain experts, we reflect on the effectiveness of GSUVis and the impact of anonymization using visualization.     

Design and implementation of a same-user identification system in invoked reality space

The objective of this study is to solve the problem of user data not being precisely received from sensors because of sensing region limitations in invoked reality (IR) space, distortion of colors or patterns by lighting, and blocking or overlapping of a user by other users. The sensing scope range is thus expanded using multiple sensors in the IR space. Moreover, user feature data are accurately identified by user sensing. Specifically, multiple sensors are employed when not all of user data are sensed because they overlap with data of other users. In the proposed approach, all clients share the user feature data from multiple sensors. Accordingly, each client recognizes that the user is the same individual on the basis of the shared data. Furthermore, the identification accuracy is improved by identifying the user features based on colors and patterns that are less affected by lighting. Therefore, accurate identification of the user feature data is enabled, even under lighting changes. The proposed system was implemented based on system performance analysis standards. The practicality and system performance in identifying the same person using the proposed method were verified through an experiment.     

Vehicle Teleoperation Interfaces

Despite advances in autonomy, there will always be a need for human involvement in vehicle teleoperation. In particular, tasks such as exploration, reconnaissance and surveillance will continue to require human supervision, if not guidance and direct control. Thus, it is critical that the operator interface be as efficient and as capable as possible. In this paper, we provide an overview of vehicle teleoperation and present a summary of interfaces currently in use.     

A comparative analysis of video codecs for multihop wireless video sensor networks

Wireless video sensor networks (WVSNs) have drawn significant attention in recent years due to the advent of low-cost miniaturized cameras, which makes it feasible to realize large-scale WVSNs for a variety of applications including security surveillance, environmental tracking, and health monitoring. However, the conventional video coding paradigms are not suitable for WVSNs due to resource constraints such as limited computation power, battery energy, and network bandwidth. In this paper, we evaluated and analyzed the performance of video codecs based on emerging video coding paradigms such as distributed video coding and distributed compressive video sensing for multihop WVSNs. The main objective of this work was to provide an insight into the computational (encoding/decoding) complexity, energy consumption, node and network lifetime, processing and memory requirements, and the quality of reconstruction of these video codecs. Based on the findings, this paper also provides some guidelines for the selection of appropriate video codecs for a given WVSN application.     

Revealing performance heterogeneity through knowledge management maturity evaluation: A capability-based approach

The dynamic capabilities view (DCV) focuses on renewal of firms’ strategic knowledge resources so as to sustain competitive advantage within turbulent markets. Within the context of the DCV, the focus of knowledge management (KM) is to develop the KMC through deploying knowledge governance mechanisms that are conducive to facilitating knowledge processes so as to produce superior business performance over time. The essence of KM performance evaluation is to assess how well the KMC is configured with knowledge governance mechanisms and processes that enable a firm to achieve superior performance through matching its knowledge base with market needs. However, little research has been undertaken to evaluate KM performance from the DCV perspective. This study employed a survey study design and adopted hypothesis-testing approaches to develop a capability-based KM evaluation framework (CKMEF) that upholds the basic assertions of the DCV. Under the governance of the framework, a KM index (KMI) and a KM maturity model (KMMM) were derived not only to indicate the extent to which a firm’s KM implementations fulfill its strategic objectives, and to identify the evolutionary phase of its KMC, but also to bench-mark the KMC in the research population. The research design ensured that the evaluation framework and instruments have statistical significance and good generalizabilty to be applied in the research population, namely construction firms operating in the dynamic Hong Kong construction market. The study demonstrated the feasibility of quantitatively evaluating the development of the KMC and revealing the performance heterogeneity associated with the development.     

Leucaena (Leucaena leucocephala (Lam) de Wit) prunings as nitrogen source for maize (Zea mays L.)

The effectiveness ofLeucaena leucocephala (Lam.) de Wit, prunings as N source for maize (Zea mays L.) was evaluated in field and pot trials at Ibadan, southern Nigeria. An N deficient, sandy Apomu soil (Psammentic Usthorthent) was used. The prunings significantly increased N uptake of seedlings and N percentage in ear leaves of maize. High maize gain yield was obtained with application of 10 tons fresh prunings or a combination of 5 tons fresh prunings and N at 50 kg ha^–1. The prunings as N source, appeared to be more effective when incorporated in the soil than when applied as mulch. In the pot trial, prunings applied two weeks before planting was more effective than when applied at time of planting maize. Under screen house conditions, the apparent N recovery from prunings with early incorporation about equals that of fertilizer N.     

Efficient encoding of quasi-cyclic low-density parity-check codes

Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an important subclass of LDPC codes. These codes have encoding advantage over other types of LDPC codes. This paper addresses the issue of efficient encoding of QC-LDPC codes. Two methods are presented to find the generator matrices of QC-LDPC codes in systematic-circulant (SC) form from their parity-check matrices, given in circulant form. Based on the SC form of the generator matrix of a QC-LDPC code, various types of encoding circuits using simple shift registers are devised. It is shown that the encoding complexity of a QC-LDPC code is linearly proportional to the number of parity bits of the code for serial encoding, and to the length of the code for high-speed parallel encoding.     

电动旋转定位机设计与分析

介绍一种旋转定位机的工作原理，分析了定位机的分度精度和传动力矩计算，建立了完整的设计准则，为定位机的正确使用和设计开发提供了理论根据．     

Complex chain of momentum transfer of body segments in the baseball pitching motion

Abstract

Baseball pitching requires contributions from and interaction among all limb segments. Most previous investigators have concentrated on the throwing arm itself, but the center of mass (COM) and contribution of all segments in the pitching motion have not been studied. The purpose of this study was to investigate the momentum transfer of all body segments in the pitching motion. The kinematics pitching motion data were captured from three experienced pitchers (one is professional, two are amateurs). A ten‐segment body system was modeled in this study. The results showed that the lowest position of the COM during the pitching cycle occurred around the ball release time and the fastest velocity (2.81±0.18 m/sec) of the COM was in the late cocking phase. The trunk and thigh on the throwing side showed the largest linear momentum among all segments in the late cocking phase. The upper throwing arm and forearm had peak linear momentum in the acceleration phase. The trunk also had the largest angular momentum during the pitching cycle and reached the maximum rotational momentum (4.17±1.22 Kg‐m²/sec) in the late cocking phase and medial bending momentum (9.03±5.78 Kg‐m²/sec) at the end of the late cocking phase. From the time sequence of linear momentum changes, especially in the leading direction, the force transfer from the foot to the trunk then through the upper extremity during the pitching motion was identified. The largest change rate of angular momentum found in the trunk meant that the trunk contributed the largest torque in the pitching motion. Better coordination of the body segments in the pitching motion not only enhances performance but also avoids injury. The coordination of motion by athletes in the pitching motion provides a guideline for better coaching and training.