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

4th International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2013

作者： Hsieh, Ting-An Li, Kuan-Ching Huang, Kuo-Chan Hsu, Kuo-Hsun Hsu, Ching-Hsien Lai, Kuan-Chou Depart. of Computer Science National Taichung University Taichung Taiwan Depart. of Computer Science and Information Engineering Providence University Taichung Taiwan Depart. of Computer Science Information Engineering Chung Hua University Hsinchu Taiwan

ISBN: (纸本)9783642406744

In a social network, individuals often simultaneously belong to multiple social communities;therefore, the detection of relationships among individuals is very important. However, most of community detection methods only apply a single relationship in dynamic social networks with multi-relationships among individuals. Therefore, this study proposes a CNET Hierarchical Division Algorithm (CHDA) to detect communities efficiently. Experimental results show that the proposed CHDA could detect communities with more precise recognition, regarding their characterization. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

A secure destination-sequenced distance-vector routing protocol for ad hoc networks

引用

Journal of Networks 2010年第8期5卷 942-948页

作者： Wang, Jyu-Wei Chen, Hsing-Chung Lin, Yi-Ping Depart. of Photonics and Communication Engineering Asia University No.500 Lioufong Rd. Wufong Township Taichung County 413 Taiwan Depart. of Computer Science and Information Technology Asia University Taichung Taiwan

This paper presents a secure destination- sequenced distance-vector (SDSDV) routing protocol for mobile ad hoc wireless networks. The proposed protocol is based on the regular DSDV protocol. Within SDSDV, each node maintains two one-way hash chains about each node in the network. Two additional fields, which we call AL (alteration) field and AC (accumulation) field, are added to each entry of the update packets to carry the hash values. With proper use of the elements of the hash chains, the sequence number and the metric values on a route can be protected from being arbitrarily tampered. In comparison with the secure efficient ad hoc distance vector (SEAD) protocol previously proposed in the literature provides only a non-decreasing protection on the metrics, SDSDV can provide complete protection. © 2010 Academy Publisher.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

Adaptive reversible data hiding based on histogram

Adaptive reversible data hiding based on histogram

引用

2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10

作者： Kuo, Wen-Chung Lai, Po-Yu Wuu, Lih-Chyau Depart. of Computer Science and Information Engineering National Formosa University Yunlin 640 Taiwan Depart. of Computer Science and Information Engineering National YunLin University of Science and Technology Yunlin 640 Taiwan

ISBN: (纸本)9781424481354

Due to the development of internet rapidly, the secure transmission of information has become more and more importance. Until now, there are many scholars study in the topic of data hiding. Specially, the reversible data hiding scheme catch the researcher's attention. No matter how the researchers use the different technology to embed the secret information, they always try to increase the hide space within the permission quality of the cover image. However, the hiding positions are subject to the highest point by using the NSAS-scheme or HKC-scheme. To overcome this shortcoming, a reversible data hiding based on adaptive hiding location will be proposed in this paper. According to the experimental results, we can prove that our proposed scheme still not only keeps high embedding capacity and stego-image quality but also maintain the better security. © 2010 IEEE.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

How Robust is the Optimal Software Rejuvenation Timing? 31

How Robust is the Optimal Software Rejuvenation Timing?

引用

31st IEEE International Symposium on Software Reliability engineering Workshops, ISSREW 2020

作者： Zheng, Junjun Okamura, Hiroyuki Dohi, Tadashi Ritsumeikan University Depart. of Information Science and Engineering Kusatsu Japan Hiroshima University Depart. of Information Engineering Higashi-Hiroshima Japan

ISBN: (纸本)9781728198705

Robustness is usually relevant for characterizing the dependence between the values of model parameters and system behavior, and can be understood as stability of system behavior under changes in model parameters. In this paper, we consider a simple software rejuvenation model and its optimal rejuvenation timing, which maximizes the steady-state availability of the system. The main contribution of this work is to provide a new perspective on the optimal software rejuvenation timing, that is, the robustness of the optimal rejuvenation timing against input factors. In particular, the degree of robustness is quantified by the first derivatives of the optimal rejuvenation timing with respect to the model parameters. The robustnesses of both optimal rejuvenation timing and system availability with the optimal rejuvenation timing are considered. A numerical example with Weibull distributed failure time is devoted to clarifying how robust the optimal rejuvenation timing is, and determine the most sensitive model parameter. As a result, the optimal rejuvenation timing seems to be more robust to the parameters regarding failure time distribution, compared with the other parameters. © 2020 IEEE.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Re-estimation of LPC coefficients in the sense of L∞ criterion 6

Re-estimation of LPC coefficients in the sense of L∞ criter...

引用

6th International Conference on Spoken Language Processing, ICSLP 2000

作者： Sen, Zhang Shirai, Katsuhiko Depart. of Information and Computer Science School of Science and Engineering Waseda University Tokyo Japan

ISBN: (纸本)7801501144

Now the generally used approaches such as auto-correlation method and covariance method for estimating LPC coefficients are to solve a set of linear equations by using of Levinson-Durbin recursion or lattice formulations, but the LPC coefficients computed are best only in the sense of L2 criterion[1]. For speech processing, L∞ criterion is a more suitable measure metric. The idea of our approach is: from the initial values of LPC coefficients, the residual errors could be reduced step by step by using Least Squares process iteratively until the LPC coefficients are approximately best in the sense of L∞ criterion. Furthermore, this approach could be applied to other problems for estimating some parameters.

关键词： Speech processing

来源：评论

学校读者我要写书评

暂无评论

T-S fuzzy control for a class of networked control system

T-S fuzzy control for a class of networked control system

引用

2012 International Conference on Fuzzy Theory and Its Applications, iFUZZY 2012

作者： Chen, Ti-Hung Kung, Chung-Chun Lin, Chi-Jheng Depart. of Computer Information and Network Engineering Lunghwa University of Science and Technology Taoyuan County Taiwan Depart. of Electrical Engineering Tatung University Taipei Taiwan

ISBN: (纸本)9781467320573

In this paper, we will propose the T-S fuzzy controller design for a class of networked control system (NCS) with the network transmission delay and the data packet dropout. In the NCS, the controlled plant is approximated to the Takagi-Sugeno fuzzy model (T-S fuzzy model). Then, we propose the fuzzy controller design based on the T-S fuzzy model, to inhibit the effect of the network transmission delay and the data packet dropout, and to guarantee the stability of the overall system. Next, we analyze the stability and the robustness of the overall system by the Lyapunov-Krasovskii function and the Lyapunov stability theorem, and obtain the Lyapunov stability criterion. After that, the Lyapunov stability criterion would be presented in the linear matrix inequality format to solve the control problem more efficiently by using the Schur complements. Finally, the computer simulations are given to demonstrate the validity and the performance of the proposed control strategy. © 2012 IEEE.

关键词： Fuzzy control

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Approach for Art Market

Machine Learning Approach for Art Market

引用

2019 IEEE MIT Undergraduate Research Technology Conference, URTC 2019

作者： Zhang, Runjia Huang, Zhizhen Liu, Xiao-Yang Columbia University Depart. of Electrical Engineering New York United States Fordham University Depart. of Computer and Information Science New York United States

ISBN: (纸本)9781728158181

Topics related to art are often considered obscure and hard to explain, yet scientific approach to art can provide us with new insights qualitatively and quantitatively. However, art and science study so different subjects that people are afraid that grounding explanatory power in science may result in depreciating in art itself. In this paper, we propose a novel approach that enables us to provide art historical narrative with statistical explanatory power fueled with linear and non-linear regressions. By studying the artists' performance with newly constructed index based on their intrinsic values, we use the hedonic ordinary least squares (OLS) method to allocate the weights to influencing factors and interpret them. Moreover, we will show which non-linear regression picks the artistic trend the best. © 2019 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Noise Reduction of Temperature Data Using Jacobi and Gauss-Seidel Iterations

Noise Reduction of Temperature Data Using Jacobi and Gauss-S...

引用

2024 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2024

作者： Tseng, Chien-Cheng Lee, Su-Ling Depart. of Computer and Communication Engineering National Kaohsiung University of Sci. and Tech Kaohsiung Taiwan Depart. of Computer Science and Information Engineering Chang Jung Christian University Tainan Taiwan

ISBN: (纸本)9798350389210

When a sensor network is used to collect temperature data, the data may be corrupted by unwanted noise. Therefore, it is desirable to develop a graph signal processing (GSP) method to reduce noise when the sensor network is represented as a graph model. Traditionally, a smoothness-based method has been used to address this problem, assuming that temperature data is smooth over the network while noise exhibits high variation. This method requires solving a linear system using matrix inversion, which is impractical for large networks. In this article, we present the Jacobi and Gauss-Seidel iterations to solve the linear system of the smoothness-based method. These iterations generate a sequence of approximate solutions that only involve matrix-vector multiplication of the sparse matrix. We derive the convergence conditions of these iterative methods to ensure that a solution can be obtained. Finally, we use temperature data collected by sensor network in Taiwan to study the convergence speed of the iterations. We also demonstrate the signal-to-noise ratio (SNR) improvement of the proposed method to show its effectiveness in noise reduction. © 2024 IEEE.

关键词： Noise abatement

来源：评论

学校读者我要写书评

暂无评论

A Steepest Descent Method for Time Estimation of Heat Diffusion Over Graph

A Steepest Descent Method for Time Estimation of Heat Diffus...

引用

2024 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2024

ISBN: (纸本)9798350389210

Heat diffusion over a graph extends the classical heat diffusion problem into the realm of graph theory, where a graph consists of nodes connected by edges. This concept is widely used in various fields, such as network theory, computer science, and data analysis, to model and study the spread of heat through complex networks. Understanding heat diffusion over a graph provides powerful insights into the dynamic processes occurring within networks, offering a robust framework for analyzing and solving complex problems across various domains. In this paper, the heat diffusion process is treated as a graph signal governed by a discrete heat equation. When a noisy graph signal of heat diffusion is measured, the challenge is to estimate the diffusion time from the noisy measurement signal. To tackle this issue, a steepest descent method is proposed to estimate the diffusion time by minimizing the error function between the model signal and the measured signal. The matrix exponential used to compute model signal is calculated by using polynomial graph filter method for reducing the computation complexity. Experiments conducted on complex networks in the USA, with single-point, double-point, and triple-point heat sources, demonstrate the effectiveness of the proposed method. © 2024 IEEE.

关键词： Steepest descent method

来源：评论

学校读者我要写书评

暂无评论

A fusion method for low-illumination color image enhancement on CIELUV space 8

A fusion method for low-illumination color image enhancement...

引用

8th IEEE Global Conference on Consumer Electronics, GCCE 2019

作者： Lee, Su-Ling Tseng, Chien-Cheng Chang-Jung Christian University Depart. of Computer Science and Information Engineering Tainan Taiwan National Kaohsiung University of Sci. and Tech. Depart. of Computer and Communication Engineering Kaohsiung Taiwan

ISBN: (纸本)9781728135755

In this paper, a fusion method for low-illumination color image enhancement on CIELUV space is presented. First, the input color image on RGB space is converted into the one on CIELUV space. Then, three color image enhancement methods are employed to enhance the low-illumination image individually including chroma-based method, homomorphic filtering method, and power-law transformation (PLT) method. Next, a Gaussian weighting fusion method is applied to combine three individual enhanced images to obtain the final enhanced image. Finally, low-illumination images are used to evaluate the enhanced quality of the proposed method and make comparison with conventional method. © 2019 IEEE.

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：