New calibration method of the capacitance and frequency domain reflectometry (ECH2O EC-5) for soil water monitoring was developed by introducing the slope-intercept relationship derived from the relationship between t...
详细信息
New calibration method of the capacitance and frequency domain reflectometry (ECH2O EC-5) for soil water monitoring was developed by introducing the slope-intercept relationship derived from the relationship between the RAW data recorded by the Em50 datalogger and the thermogravimetrically measured volumetric water content of soil. Numerous soil samples taken from paddy-upland rotational fields in western Japan were used for precise soil-specific calibration experiments to determine the variables of slope-intercept relationship. By using these identified variables and an easily available dataset of the measured volumetric water content and the RAW data, the developed linear function predicted volumetric water content of soils. The developed linear function was validated with the reported literature data, the agricultural fields experiment, and the laboratory experiment. From those three validations, the developed linear function was evaluated to be practically available for laboratory and field researches. Also, it is implied that the developed linear function is extendable to dataloggers except for the Em50 and monitoring devices excluding the EC-5.
Because much interest in spatial database in cloud computing has been attracted, studies on preserving location data privacy in cloud computing have been actively done. However, since the existing spatial transformati...
详细信息
ISBN:
(纸本)9781479920815
Because much interest in spatial database in cloud computing has been attracted, studies on preserving location data privacy in cloud computing have been actively done. However, since the existing spatial transformation schemes are weak to proximity attack, they cannot preserve the privacy of users who enjoy location-based services from the cloud computing. Therefore, a transformation scheme for providing a safe service to users is required. So, we, in this paper, propose a new transformation scheme based on a line symmetric transformation (LST). The proposed scheme performs both LST-based data distribution and error injection transformation for preventing proximity attack effectively. Finally, we show from our performance analysis that the proposed scheme greatly reduces the success rate of the proximity attack while performing the spatial transformation in an efficient way.
The canonical representation of piecewise-linear (PWL) functions provides a global compact formulation of continuous PWL functions, which has significant advantages in the research and applications concerning nonlinea...
详细信息
The canonical representation of piecewise-linear (PWL) functions provides a global compact formulation of continuous PWL functions, which has significant advantages in the research and applications concerning nonlinear systems. This paper studies the generalization of the canonical representation from PWL functions to piecewise-smooth (PWS) functions. At first, a class of PWS functions, called the regular PWS function, is defined as a generalization of the continuous PWL function. An important example of the regular PWS functions is the continuous piecewise-polynomial function. The continuous PWL function with a PWL partition is also covered by the regular PWS function. Then, the canonical representation of the PWS function is defined and the existence conditions are discussed. The PWS generalization of the canonical representation is significant in applications where a PWS scheme can improve the performance of a PWL scheme in the approximation of a nonlinear function, i.e., in approximating the input/output relation of a nonlinear system or a mapping neural network or in nonlinear signal processing.
The Khrapchenko method of finding a lower bound for the complexity of binary formulas is extended to formulas in k-ary bases. The resulting extension makes it possible to evaluate the complexity of linear Boolean func...
详细信息
The Khrapchenko method of finding a lower bound for the complexity of binary formulas is extended to formulas in k-ary bases. The resulting extension makes it possible to evaluate the complexity of linear Boolean functions and a majority function of n variables when realized by formulas in the basis of all k-ary monotone functions and negation as Omega(n(g(k))), where g(k) = 1 + Theta(1/ln k). For a linear function, the complexity bound in this form is unimprovable. For k = 3, the sharper lower bound Omega(n(1.53)) is proved.
Cytogenetic aberrations have been reported in 45,000 human neoplasms. Structural balanced rearrangements are associated with distinct tumor subtypes with remarkable specificity and have been essential for identifying ...
详细信息
Cytogenetic aberrations have been reported in 45,000 human neoplasms. Structural balanced rearrangements are associated with distinct tumor subtypes with remarkable specificity and have been essential for identifying genes involved in tumorigenesis(1,2). All balanced rearrangements that have been characterized molecularly act by deregulating a gene in one of the breakpoints or by creating a fusion gene(3-6). Because most recurrent aberrations and rearranged genes have been found in hematological disorders, whereas numerous genomic imbalances have been identified in solid tumors(7,8), it has become generally accepted that there are pathogenetic differences between these neoplasms. We here show that in every tumor type, the numbers of recurrent balanced chromosome abnormalities, fusion genes and genes rearranged as a consequence of balanced aberrations are simply a function of the number of cases with an abnormal karyotype. Hence, there may not be any fundamental tissue-specific differences in the genetic mechanisms by which neoplasia is initiated.
The main result of the paper is as follows. Theorem. Suppose that G(z) is an entire function satisfying the following conditions: 1) the Taylor coefficients of the function G(z) are nonnegative;2) for some fixed C >...
详细信息
The main result of the paper is as follows. Theorem. Suppose that G(z) is an entire function satisfying the following conditions: 1) the Taylor coefficients of the function G(z) are nonnegative;2) for some fixed C > 0 and A > 0 and for \ Z \ > R-0, the following inequality holds: \ G(z)\ < exp(C \ z \/In-A\ z \) Further, suppose that for same fixed alpha > 0 the deviation D-N of the sequence x(n) = {alpha n}, n = 1,2,..., as N --> infinity has the estimate D-N = O(ln(B) N/N). Then if the function G(z) is not an identical constant and the inequality B + 1 < A holds, then the power series Sigma(n=0) infinity G(\alpha n \)z(n) converging in the disk \ z \ < 1 cannot be analytically continued to the region \ z \ > 1 across any are of the circle \ z \ =1.
We completely describe the set of bases over which the complexity of realization of the function x1 direct sum ... direct sum xn is of order n. For all bases not belonging to this set, we obtain the lower bound for th...
详细信息
We completely describe the set of bases over which the complexity of realization of the function x1 direct sum ... direct sum xn is of order n. For all bases not belonging to this set, we obtain the lower bound for the complexity of realization of the function x1 direct sum ... direct sum xn, which is of the form nc, where c gt;1 and c does not depend on n. Basing on this bound for complexity, we give a more simple proof of existence of an infinite (descending) sequence of Boolean bases.
We consider the problem of optimal search for locally feasible solutions of a linear function on the permutations where the linear function takes the values from the given interval. We describe a new method of solving...
详细信息
We consider the problem of optimal search for locally feasible solutions of a linear function on the permutations where the linear function takes the values from the given interval. We describe a new method of solving such problem by a targeted search of the permutations that provide locally feasible solutions with minimal search.
This study describes a comparison of how worked examples in selected textbooks from England and Shanghai presented possible learning trajectories towards understanding linear function. Six selected English textbooks a...
详细信息
This study describes a comparison of how worked examples in selected textbooks from England and Shanghai presented possible learning trajectories towards understanding linear function. Six selected English textbooks and one Shanghai compulsory textbook were analysed with regards to the understanding required for pure mathematics knowledge in linear function. Understanding was defined as being at five levels: Dependent Relationship, Connecting Representations, Local Properties Noticing, Object Analysis and Inventising. These levels were developed by examining the most prominent theories from the existing literature on understanding function. Findings suggested that the English textbooks constrained the structural aspect of understanding linear function due to a point-to-point view of function, while the Shanghai textbook which focussed on a variable view of function overemphasised the algebraic approach. The discussion explored the drawbacks to each approach and what teachers or textbook writers could do to balance these two approaches in order to facilitate students' understanding towards a structural view of linear function.
This study investigates how students in England and Shanghai understand linear function. Understanding is defined theoretically in terms of five hierarchical levels: Dependent Relationship;Connecting Representations;P...
详细信息
This study investigates how students in England and Shanghai understand linear function. Understanding is defined theoretically in terms of five hierarchical levels: Dependent Relationship;Connecting Representations;Property Noticing;Object Analysis;and Inventising. A pilot study instrument presented a set of problems to both cohorts, showing that the English cohort generally operated at the levels of Property Noticing and Object Analysis, whereas the Shanghai cohort reached the higher level of Inventising. The main study explored understanding levels and students' errors within each cohort in detail, in order to gain insights into reasons for apparent differences. The instrument used in the main study included two overlapping items, which were the same for both cohorts, while others were pitched at levels of understanding revealed in the pilot. Analysis of students' solutions revealed that the English students' errors were manifested in a lack of basic skills including dealing with negative numbers, while the Shanghai students showed weaknesses in their ability to use graphs. The discussion highlights different views of understanding as a possible background reason for the contrasts observed. Errors and apparent difficulties suggest implications for teaching linear function in each context.
暂无评论