检索结果-内蒙古大学图书馆

A Single-Pass Triclustering algorithm

AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS 2015年第1期49卷 27-41页

作者： Gnatyshak, D. V. Natl Res Univ Higher Sch Econ Sci & Educ Lab Intelligent Syst & Struct Anal Moscow Russia

As the popularity of the field of big data continues to rise, the problem of the development of efficient algorithms with low time complexity and that ability to be parallelized is more and more frequently posed. This work is aimed at the development of an efficient single-pass algorithm for the triclustering of binary data that is suitable for use in the field of big data. As a result, a single-pass serial online OAC triclustering algorithm (triclustering of object-attribute-condition) was obtained. This algorithm not only has a very low complexity in time and memory, but it also can be effectively parallelized.

关键词： formal concept analysis data analysis clustering triclustering big data linear algorithm single-pass algorithm

来源：评论

学校读者我要写书评

暂无评论

A linear algorithm for Finding the k-Broadcast Center of a Tree

引用

NETWORKS 2009年第3期53卷 287-292页

作者： Harutyunyan, Hovhannes A. Liestman, Arthur L. Shao, Bin Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada Concordia Univ Dept Comp Sci Montreal PQ H3G 1M8 Canada Microsoft Corp Redmond WA 98052 USA

The term k-broadcast indicates the process of disseminating a message from one vertex to all vertices of a graph in such a way that in each time unit, an informed vertex can send the message to up to k of its neighbors. The k-broadcast center of a graph is the set of vertices that can initiate a minimum time k-broadcast within the graph. We present a linear algorithm to determine the k-broadcast center of a given tree. From this, we obtain a linear time algorithm for finding the k-broadcast time of any vertex of the tree and, thus, the k-broadcast time of the tree itself. (C) 2008 Wiley Periodicals, Inc. NETWORKS, Vol. 53(3), 287-292 2009

关键词： broadcasting k-broadcasting center graph linear algorithm

来源：评论

学校读者我要写书评

暂无评论

IMU Self-Calibration Using Factorization

引用

IEEE TRANSACTIONS ON ROBOTICS 2013年第2期29卷 493-507页

作者： Hwangbo, Myung Kim, Jun-Sik Kanade, Takeo Carnegie Mellon Univ Inst Robot Pittsburgh PA 15215 USA Korea Inst Sci & Technol Seoul 139791 South Korea

This paper presents a convenient self-calibration method for an inertial measurement unit (IMU) using matrix factorization. Using limited information about applied loads (accelerations or angular rates) available from natural references, the proposed method can linearly solve all the parameters of an IMU in any configuration of its inertial components. Our factorization-based calibration method exploits the bilinear form of an IMU measurement, which is the product of intrinsic calibration parameters and exerted loads. For a redundant IMU, we prove that partial knowledge of the loads, such as magnitude, can produce a linear solution space for a proper decomposition of the measurement. Theoretical analysis on this linear space reveals that a 1-D null space should be considered when load magnitudes are all equal (e. g., gravity loads). Degenerate load distributions are also geometrically identified to avoid singular measurement collection. Since a triad IMU has a lower number of sensor components than a 4-D parameter space, we propose an iterative factorization in which only initial bias is required. A wide convergence region of the bias can provide an automatic setting of the initial bias as the mean of the measurements. Performance of the proposed method is evaluated with respect to various noise levels and constraint types. Self-calibration capability is demonstrated using natural references, which are gravity for accelerometers and image stream from an attached camera for gyroscopes. Calibration results are globally optimal and identical to those of nonlinear optimization.

关键词： Calibration and identification factorization method linear algorithm redundant and triad inertial measurement unit (IMU) self-calibration

来源：评论

学校读者我要写书评

暂无评论

Experimental Research on Heat Power Measuring Method Using Cylindraceous Gardon Sensor

Experimental Research on Heat Power Measuring Method Using C...

引用

IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM)

作者： Li, Miao Li, Yun-Ze Wang, Jin Li, Yunhua Beihang Univ Sch Automat Sci & Elect Engn Beijing 100191 Peoples R China

ISBN: (纸本)9781467325769

The non-contacting measuring method for heat power using Cylindraceous Gardon type Sensor is proposed in this paper to meet the requirements of heat power measurement of heat source in cylindrical shape. A experimental testing device has been constructed. A series of experiments were carried out, and the relationships of output temperature difference, heat driven voltage, and input heat power are provided using both least square method linear fitting and neural network fitting. The MATLAB software is used in the numerical investigation of the experimental results. The conclusion indicates that the Cylindraceous Gardon type sensor device could meet the demand of measure accuracy, and is feasible and practicable.

关键词： Gardon type heat power measurement least square method neural network linear algorithm

来源：评论

学校读者我要写书评

暂无评论

Building Multi-Marker algorithms for Disease Prediction-The Role of Correlations Among Markers

引用

BIOMARKER INSIGHTS 2011年第6期6卷 83-93页

作者： Pinsky, Paul F. Zhu, Claire S. Natl Canc Inst Canc Prevent Div Early Detect Res Grp Bethesda MD 20852 USA

A widely held viewpoint in the field of predictive biomarkers for disease holds that no single marker can provide high enough discrimination and that a panel of markers, combined in some type of algorithm, will be needed. Motivated by a recent study where 27 additional markers for ovarian cancer, many of which had good predictive value alone, failed to substantially increase the predictive ability of the primary marker of CA125, we explore the effect of additional markers on the area under the ROC curve (AUC). We develop a statistical model based on the multivariate normal distribution and linear algorithms and use it to explore how the magnitude and direction of statistical correlation among the markers (in diseased and in non-diseased) is critical in determining the added predictive value of additional markers. We show mathematically and empirically that if the additional marker(s) is negatively correlated with the primary marker, then it will always be able to provide increased AUC when combined with the primary marker (as compared to that obtained with the primary marker alone), even if it has little predictive ability on its own. In contrast, if the additional marker(s) is positively correlated with the primary marker, then it is unlikely to substantially increase the AUC when combined with the primary marker, even when it has good predictive ability on its own. Thus, univariate analyses alone may not be the best approach in choosing which markers to combine in a predictive panel of markers;patterns of statistical correlation should be considered in ranking top-performing biomarkers.

关键词： correlation ROC AUC biomarkers multivariate normal distribution linear algorithm

来源：评论

学校读者我要写书评

暂无评论

A linear algorithm for tracing magnet position and orientation by using three-axis magnetic sensors

引用

IEEE TRANSACTIONS ON MAGNETICS 2007年第12期43卷 4096-4101页

作者： Hu, Chao Meng, Max Q. -H. Mandal, Mrinal Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 2V4 Canada Chinese Univ Hong Kong Dept Elect Engn Shatin Hong Kong Peoples R China Shenzhen Inst Adv Technol Inst Adv Integrat Technol Shenzhen 518067 Peoples R China

For medical diagnoses and treatments, it is often desirable to wirelessly trace an object that moves inside the human body. A magnetic tracing technique suggested for such applications uses a small magnet as the excitation source, which does not require the power supply and connection wire. It provides good tracing accuracy and can be easily implemented. As the magnet moves, it establishes around the human body a static magnetic field, whose intensity is related to the magnet's 3-D position and 2-D orientation parameters. With magnetic sensors, these magnetic intensities can be detected in some predetermined spatial points, and the position and orientation parameters can be computed. Typically, a nonlinear optimization algorithm is applied to such a problem, but a linear algorithm is preferable for faster, more reliable computation, and lower complexity. In this paper, we propose a linear algorithm to determine the 5-D magnet's position and orientation parameters. With the data from five (or more) three-axis magnetic sensors, this algorithm results in a solution by the matrix and algebra computations. We applied this linear algorithm on the real localization system, and the results of simulations and real experiments show that satisfactory tracing accuracy can be achieved by using a sensor array with enough three-axis magnetic sensors.

关键词： linear algorithm magnet's position and orientation magnetic tracing

来源：评论

学校读者我要写书评

暂无评论

Recognizing Cartesian products in linear time

引用

DISCRETE MATHEMATICS 2007年第3-5期307卷 472-483页

作者： Imrich, Wilfried Peterin, Iztok Montanuni Leoben Chair Appl Math A-8700 Leoben Austria Univ Maribor Fac Elect Engn & Comp Sci SLO-2000 Maribor Slovenia

We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammer et al. [Cartesian graph factorization at logarithmic cost per edge, Comput. Complexity 2 (1992) 331-349], who compute the prime factors in O(m log n) time, where m denotes the number of vertices of G and n the number of edges. Our algorithm is conceptually simpler. It gains its efficiency by the introduction of edge-labellings. (c) 2006 Elsevier B.V. All rights reserved.

关键词： Cartesian product graphs linear algorithm decomposition

来源：评论

学校读者我要写书评

暂无评论

Every toroidal graph without adjacent triangles is (4,1)*-choosable

引用

DISCRETE APPLIED MATHEMATICS 2007年第1期155卷 74-78页

作者： Xu, Baogang Zhang, Haihui Nanjing Normal Univ Sch Math & Comp Sci Nanjing 210097 Peoples R China Huaiyin Teachers Coll Dept Math Huaian 223001 Peoples R China

In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph without adjacent triangles is (4,1)*-choosable. This result is best possible in the sense that K-7 is a non-(3,1)*-choosable toroidal graph. A linear time algorithm for producing such a coloring is presented also. (c) 2006 Elsevier B.V. All rights reserved.

关键词： triangle choosability toroidal graph linear algorithm

来源：评论

学校读者我要写书评

暂无评论

Symmetrical components estimation through maximum likelihood algorithm and adaptive filtering

引用

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 2007年第6期56卷 2386-2394页

作者： Kusljevic, Miodrag D. Termoelektro Enel AD Belgrade 11060 Serbia

An algorithm that is suitable for the computation of symmetrical components is presented in this paper. The structure of the algorithm consists of four decupled linear modules: the first for adaptive filtering of input signals, the second for frequency estimation, the third for symmetrical components estimation, and the fourth for the amplitudes of the component estimation. Filters are used to minimize the noise effect and to eliminate the presence of harmonics. A simple method for online designing of digital filters of sinusoidal signals is used in this paper. This method uses closed forms for calculation of filter coefficients and requires modest computations. The symmetrical components estimation through adaptive transformation matrix of phase shifters used in this paper makes it possible to get instantaneous symmetrical components independently on the frequency variation with modest-computation requirements. The technique used in this paper provides accurate frequency estimates with the maximum error of 0.002 Hz and symmetrical components estimation with the max- imum error of 0.03% for SNR = 60 dB in about 25 ms. The algorithm is not sensitive to power-system frequency changes and to the harmonic distortion of the input signals. To demonstrate the performance of the developed algorithm, computer-simulated data records have been processed. It has been found that the proposed algorithm is suitable for real-time applications.

关键词： adaptive filters finite-impulse-response filters frequency estimation linear algorithm maximum likelihood estimation phase shifters recursive estimation symmetrical components

来源：评论

学校读者我要写书评

暂无评论

A linear Time algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs

引用

Acta Mathematicae Applicatae Sinica 2004年第4期20卷 579-588页

作者： Shao-qiangZhang Guo-junLi Shu-guangLi CollegeofComputerandInformationEngineering TianjinNormalUniversityTianjin300074China InstituteofSoftware CASBeijing100080China//SchoolofMathematicsandSystemSciencesShandongUniversityJinan250100China DepartmentofMathematicsandInformationScience YantaiUniversityYantai264005China

A feedback vertex set is a subset of vertices in a graph, whose deletion from the graph makes the resulting graph acyclic. In this paper, we study the minimum-weight feedback vertex set problem in series-parallel grap... 详细信息

关键词： Series-parallel graph feedback vertex set linear algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：