Search results for: Wanting Zhou
132 Zhou Enlai’s Impact to the Foreign Folicy of China
Authors: Nazira B. Boldurukova
Abstract:
The main aim of this article is to give the information about life and social and diplomatic work of Zhou Enlai, to prove his identity in his impact to the history of the world; to show his place in the organization of internal and foreign policy and in the peaceful international relationships of China with other countries.
Keywords: China, foreign policy of China, identity, politician, diplomacy, Zhou Enlai.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2947131 A Soft Error Rates Evaluation Method of Combinational Logic Circuit Based on Linear Energy Transfers
Authors: Man Li, Wanting Zhou, Lei Li
Abstract:
Communication stability is the primary concern of communication satellites. Communication satellites are easily affected by particle radiation to generate single event effects (SEE), which leads to soft errors (SE) of combinational logic circuit. The existing research on soft error rates (SER) of combined logic circuit is mostly based on the assumption that the logic gates being bombarded have the same pulse width. However, in the actual radiation environment, the pulse widths of the logic gates being bombarded are different due to different linear energy transfers (LET). In order to improve the accuracy of SER evaluation model, this paper proposes a soft error rates evaluation method based on LET. In this paper, we analyze the influence of LET on the pulse width of combinational logic and establish the pulse width model based on LET. Based on this model, the error rate of test circuit ISCAS’85 is calculated. Experimental results show that this model can be used for SER evaluation.
Keywords: Communication satellite, pulse width, soft error rates, linear energy transfer, LET.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 360130 Security Design of Root of Trust Based on RISC-V
Authors: Kang Huang, Wanting Zhou, Shiwei Yuan, Lei Li
Abstract:
Since information technology develops rapidly, the security issue has become an increasingly critical for computer system. In particular, as cloud computing and the Internet of Things (IoT) continue to gain widespread adoption, computer systems need to new security threats and attacks. The Root of Trust (RoT) is the foundation for providing basic trusted computing, which is used to verify the security and trustworthiness of other components. Designing a reliable RoT and guaranteeing its own security are essential for improving the overall security and credibility of computer systems. In this paper, we discuss the implementation of self-security technology based on the RISC-V RoT at the hardware level. To effectively safeguard the security of the RoT, researches on security safeguard technology on the RoT have been studied. At first, a lightweight and secure boot framework is proposed as a secure mechanism. Secondly, two kinds of memory protection mechanism are built to against memory attacks. Moreover, hardware implementation of proposed method has been also investigated. A series of experiments and tests have been carried on to verify to effectiveness of the proposed method. The experimental results demonstrated that the proposed approach is effective in verifying the integrity of the RoT’s own boot rom, user instructions, and data, ensuring authenticity and enabling the secure boot of the RoT’s own system. Additionally, our approach provides memory protection against certain types of memory attacks, such as cache leaks and tampering, and ensures the security of root-of-trust sensitive information, including keys.
Keywords: Root of Trust, secure boot, memory protection, hardware security.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 25129 A Design of Elliptic Curve Cryptography Processor Based on SM2 over GF(p)
Authors: Shiji Hu, Lei Li, Wanting Zhou, Daohong Yang
Abstract:
The data encryption is the foundation of today’s communication. On this basis, to improve the speed of data encryption and decryption is always an important goal for high-speed applications. This paper proposed an elliptic curve crypto processor architecture based on SM2 prime field. Regarding hardware implementation, we optimized the algorithms in different stages of the structure. For modulo operation on finite field, we proposed an optimized improvement of the Karatsuba-Ofman multiplication algorithm and shortened the critical path through the pipeline structure in the algorithm implementation. Based on SM2 recommended prime field, a fast modular reduction algorithm is used to reduce 512-bit data obtained from the multiplication unit. The radix-4 extended Euclidean algorithm was used to realize the conversion between the affine coordinate system and the Jacobi projective coordinate system. In the parallel scheduling point operations on elliptic curves, we proposed a three-level parallel structure of point addition and point double based on the Jacobian projective coordinate system. Combined with the scalar multiplication algorithm, we added mutual pre-operation to the point addition and double point operation to improve the efficiency of the scalar point multiplication. The proposed ECC hardware architecture was verified and implemented on Xilinx Virtex-7 and ZYNQ-7 platforms, and each 256-bit scalar multiplication operation took 0.275ms. The performance for handling scalar multiplication is 32 times that of CPU (dual-core ARM Cortex-A9).
Keywords: Elliptic curve cryptosystems, SM2, modular multiplication, point multiplication.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 223128 Acceleration-Based Motion Model for Visual SLAM
Authors: Daohong Yang, Xiang Zhang, Wanting Zhou, Lei Li
Abstract:
Visual Simultaneous Localization and Mapping (VSLAM) is a technology that gathers information about the surrounding environment to ascertain its own position and create a map. It is widely used in computer vision, robotics, and various other fields. Many visual SLAM systems, such as OBSLAM3, utilize a constant velocity motion model. The utilization of this model facilitates the determination of the initial pose of the current frame, thereby enhancing the efficiency and precision of feature matching. However, it is often difficult to satisfy the constant velocity motion model in actual situations. This can result in a significant deviation between the obtained initial pose and the true value, leading to errors in nonlinear optimization results. Therefore, this paper proposes a motion model based on acceleration that can be applied to most SLAM systems. To provide a more accurate description of the camera pose acceleration, we separate the pose transformation matrix into its rotation matrix and translation vector components. The rotation matrix is now represented by a rotation vector. We assume that, over a short period, the changes in rotating angular velocity and translation vector remain constant. Based on this assumption, the initial pose of the current frame is estimated. In addition, the error of the constant velocity model is analyzed theoretically. Finally, we apply our proposed approach to the ORBSLAM3 system and evaluate two sets of sequences from the TUM datasets. The results show that our proposed method has a more accurate initial pose estimation, resulting in an improvement of 6.61% and 6.46% in the accuracy of the ORBSLAM3 system on the two test sequences, respectively.
Keywords: Error estimation, constant acceleration motion model, pose estimation, visual SLAM.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 216127 Monitoring and Analysis of Bridge Crossing Ground Fissures
Authors: Zhiqing Zhang, Xiangong Zhou, Zihan Zhou
Abstract:
Ground fissures can be seen in some cities all over the world. As a special urban geological disaster, ground fissures in Xi'an have caused great harm to infrastructure. Chang'an Road Interchange in Xi'an City is a bridge across ground fissures. The damage to Chang'an Road interchange is the most serious and typical. To study the influence of ground fissures on the bridge, we established a bridge monitoring system. The main monitoring items include elevation monitoring, structural displacement monitoring, etc. The monitoring results show that the typical failure is mainly reflected in the bridge deck damage caused by horizontal tension and vertical dislocation. For the construction of urban interchange spanning ground fissures, the interchange should be divided reasonably, a simple support structure with less restriction should be adopted, and the monitoring of supports should be strengthened to prevent the occurrence of beam falling.
Keywords: Bridge monitoring, ground fissures, typical disease, structural displacement.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 616126 A Robust Visual SLAM for Indoor Dynamic Environment
Authors: Xiang Zhang, Daohong Yang, Ziyuan Wu, Lei Li, Wanting Zhou
Abstract:
Visual Simultaneous Localization and Mapping (VSLAM) uses cameras to gather information in unknown environments to achieve simultaneous localization and mapping of the environment. This technology has a wide range of applications in autonomous driving, virtual reality, and other related fields. Currently, the research advancements related to VSLAM can maintain high accuracy in static environments. But in dynamic environments, the presence of moving objects in the scene can reduce the stability of the VSLAM system, leading to inaccurate localization and mapping, or even system failure. In this paper, a robust VSLAM method was proposed to effectively address the challenges in dynamic environments. We proposed a dynamic region removal scheme based on a semantic segmentation neural network and geometric constraints. Firstly, a semantic segmentation neural network is used to extract the prior active motion region, prior static region, and prior passive motion region in the environment. Then, the lightweight frame tracking module initializes the transform pose between the previous frame and the current frame on the prior static region. A motion consistency detection module based on multi-view geometry and scene flow is used to divide the environment into static regions and dynamic regions. Thus, the dynamic object region was successfully eliminated. Finally, only the static region is used for tracking thread. Our research is based on the ORBSLAM3 system, which is one of the most effective VSLAM systems available. We evaluated our method on the TUM RGB-D benchmark and the results demonstrate that the proposed VSLAM method improves the accuracy of the original ORBSLAM3 by 70%˜98.5% under a high dynamic environment.
Keywords: Dynamic scene, dynamic visual SLAM, semantic segmentation, scene flow, VSLAM.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 148125 Phase-Averaged Analysis of Three-Dimensional Vorticity in the Wake of Two Yawed Side-By-Side Circular Cylinders
Authors: T. Zhou, S. F. Mohd. Razali, Y. Zhou, H. Wang, L. Cheng
Abstract:
Thewake flow behind two yawed side-by-sidecircular cylinders is investigated using athree-dimensional vorticity probe. Four yaw angles (α), namely, 0°, 15°, 30° and 45° and twocylinder spacing ratios T* of 1.7 and 3.0 were tested. For T* = 3.0, there exist two vortex streets and the cylinders behave as independent and isolated ones. The maximum contour value of the coherent streamwise vorticity ~* ωx is only about 10% of that of the spanwise vorticity ~* ωz . With the increase of α, ~* ωx increases whereas ~* ωz decreases. At α = 45°, ~* ωx is about 67% of ~* ωz .For T* = 1.7, only a single peak is detected in the energy spectrum. The spanwise vorticity contours have an organized pattern only at α = 0°. The maximum coherent vorticity contours of ~* ω x and ~* ωz for T* = 1.7 are about 30% and 7% of those for T* = 3.0.The independence principle (IP)in terms of Strouhal numbers is applicable in both wakes when α< 40°.
Keywords: Circular cylinder wake, vorticity, vortex shedding.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1785124 A Web Oriented Watermarking Protocol
Authors: Franco Frattolillo, Salvatore D'Onofrio
Abstract:
This paper presents a watermarking protocol able to solve the well-known “customer-s right problem" and “unbinding problem". In particular, the protocol has been purposely designed to be adopted in a web context, where users wanting to buy digital contents are usually neither provided with digital certificates issued by certification authorities (CAs) nor able to autonomously perform specific security actions. Furthermore, the protocol enables users to keep their identities unexposed during web transactions as well as allows guilty buyers, i.e. who are responsible distributors of illegal replicas, to be unambiguously identified. Finally, the protocol has been designed so that web content providers (CPs) can exploit copyright protection services supplied by web service providers (SPs) in a security context. Thus, CPs can take advantage of complex services without having to directly implement them.Keywords: Copyright protection, digital rights management, watermarkingprotocols.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1500123 A Sufficient Condition for Graphs to Have Hamiltonian [a, b]-Factors
Authors: Sizhong Zhou
Abstract:
Let a and b be nonnegative integers with 2 ≤ a < b, and let G be a Hamiltonian graph of order n with n ≥ (a+b−4)(a+b−2) b−2 . An [a, b]-factor F of G is called a Hamiltonian [a, b]-factor if F contains a Hamiltonian cycle. In this paper, it is proved that G has a Hamiltonian [a, b]-factor if |NG(X)| > (a−1)n+|X|−1 a+b−3 for every nonempty independent subset X of V (G) and δ(G) > (a−1)n+a+b−4 a+b−3 .
Keywords: graph, minimum degree, neighborhood, [a, b]-factor, Hamiltonian [a, b]-factor.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1224122 Hamiltonian Factors in Hamiltonian Graphs
Authors: Sizhong Zhou, Bingyuan Pu
Abstract:
Let G be a Hamiltonian graph. A factor F of G is called a Hamiltonian factor if F contains a Hamiltonian cycle. In this paper, two sufficient conditions are given, which are two neighborhood conditions for a Hamiltonian graph G to have a Hamiltonian factor.Keywords: graph, neighborhood, factor, Hamiltonian factor.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1164121 [a, b]-Factors Excluding Some Specified Edges In Graphs
Authors: Sizhong Zhou, Bingyuan Pu
Abstract:
Let G be a graph of order n, and let a, b and m be positive integers with 1 ≤ a<b. An [a, b]-factor of G is defined as a spanning subgraph F of G such that a ≤ dF (x) ≤ b for each x ∈ V (G). In this paper, it is proved that if n ≥ (a+b−1+√(a+b+1)m−2)2−1 b and δ(G) > n + a + b − 2 √bn+ 1, then for any subgraph H of G with m edges, G has an [a, b]-factor F such that E(H)∩ E(F) = ∅. This result is an extension of thatof Egawa [2].
Keywords: graph, minimum degree, [a, b]-factor.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1089120 Transformerless AC-DC Converter
Authors: Saisundar. S., I Made Darmayuda, Zhou Jun, Krishna Mainali, Simon Ng Sheung Yan, Eran Ofek
Abstract:
This paper compares the recent transformerless ACDC power converter architectures and provides an assessment of each. A prototype of one of the transformerless AC-DC converter architecture is also presented depicting the feasibility of a small form factor, power supply design. In this paper component selection guidelines to achieve high efficiency AC-DC power conversion are also discussed.Keywords: AC-DC converter, digitally controlled, switched mode power supply, transformerless.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 5772119 Adsorption of Acetone Vapors by SBA-16 and MCM-48 Synthesized from Rice Husk Ash
Authors: Wanting Zeng, Hsunling Bai
Abstract:
Silica was extracted from agriculture waste rice husk ash (RHA) and was used as the silica source for synthesis of RMCM-48 and RSBA-16. An alkali fusion process was utilized to separate silicate supernatant and the sediment effectively. The CTAB/Si and F127/Si molar ratio was employed to control the structure properties of the obtained RMCM-48 and RSBA-16 materials. The N2 adsorption-desorption results showed the micro-mesoporous RSBA-16 possessed high specific surface areas (662-1001 m2/g). All the obtained RSBA-16 materials were applied as the adsorbents for acetone adsorption. And the breakthrough tests clearly revealed that the RSBA-16(0.004) materials could achieve the highest acetone adsorption capacity of 181 mg/g under 1000 ppmv acetone vapor concentration at 25oC, which was also superior to ZSM-5 (71mg/g) and MCM-41 (157mg/g) under same test conditions. This can help to reduce the solid waste and the high adsorption performance of the obtained materials could consider as potential adsorbents for acetone adsorption.
Keywords: Acetone, adsorption, micro-mesoporous material, rice husk ash (RHA), RSBA-16.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2070118 A Convenient Part Library Based On SolidWorks Platform
Authors: Wei Liu, Xionghui Zhou, Qiang Niu, Yunhao Ni
Abstract:
3D part library is an ideal approach to reuse the existing design and thus facilitates the modeling process, which will enhance the efficiency. In this paper, we implemented the thought on the SolidWorks platform. The system supports the functions of type and parameter selection, 3D template driving and part assembly. Finally, BOM is exported in Excel format. Experiment shows that our method can satisfy the requirement of die and mold designers.
Keywords: Intelligent, SolidWorks, automatic assembly, part library.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2134117 Intellectual Capital Research through Corporate Social Responsibility: (Re) Constructing the Agenda
Authors: Camelia Iuliana Lungu, Chirața Caraiani, Cornelia Dascălu
Abstract:
The business strategy of any company wanting to be competitive on the market should be designed around the concept of intangibles, with an increasingly decisive role in knowledge transfer of the biggest corporations. Advancing the research in these areas, this study integrates the two approaches, emphasizing the relationships between the components of intellectual capital and corporate social responsibility. The three dimensions of intellectual capital in terms of sustainability requirements are debated. The paper introduces the concept of sustainable intellectual capital and debates it within an assessment model designed on the base of key performance indicators. The results refer to the assessment of possible ways for including the information on intellectual capital and corporate responsibility within the corporate strategy. The conclusions enhance the need for companies to be ready to support the integration of this type of information the knowledge transfer process, in order to develop competitive advantage on the market.Keywords: Corporate social responsibility, corporate strategy, intellectual capital, sustainability
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2665116 Study on Rural Landscape Design Method under the Background of the Population Diversification
Authors: Z. Zhou, Q. Chen, S. Wu
Abstract:
Population diversification phenomena becomes quite common in villages located in China’s developed coastal area. Based on the analysis of the traditional rural society and its landscape characteristics, and in consideration of diversified landscape requirements due to the population diversification, with dual ideas of heritage and innovation, methods for rural landscape design were explored by taking Duxuao Village in Zhejiang Province of China as an example.
Keywords: Rural landscape, Population diversification, Landscape design.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2236115 A Comprehensive Analysis for Widespread use of Electric Vehicles
Authors: Yu Zhou, Zhaoyang Dong, Xiaomei Zhao
Abstract:
This paper mainly investigates the environmental and economic impacts of worldwide use of electric vehicles. It can be concluded that governments have good reason to promote the use of electric vehicles. First, the global vehicles population is evaluated with the help of grey forecasting model and the amount of oil saving is estimated through approximate calculation. After that, based on the game theory, the amount and types of electricity generation needed by electronic vehicles are established. Finally, some conclusions on the government-s attitudes are drawn.Keywords: electronic vehicles, grey prediction, game theory
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1641114 Low Power Digital System for Reconfigurable Neural Recording System
Authors: Peng Li, Jun Zhou, Xin Liu, Chee Keong Ho, Xiaodan Zou, Minkyu Je
Abstract:
A digital system is proposed for low power 100- channel neural recording system in this paper, which consists of 100 amplifiers, 100 analog-to-digital converters (ADC), digital controller and baseband, transceiver for data link and RF command link. The proposed system is designed in a 0.18 μm CMOS process and 65 nm CMOS process.Keywords: multiplex, neural recording, synchronization, transceiver
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1642113 Notes on Fractional k-Covered Graphs
Authors: Sizhong Zhou, Yang Xu
Abstract:
A graph G is fractional k-covered if for each edge e of G, there exists a fractional k-factor h, such that h(e) = 1. If k = 2, then a fractional k-covered graph is called a fractional 2-covered graph. The binding number bind(G) is defined as follows, bind(G) = min{|NG(X)| |X| : ├ÿ = X Ôèå V (G),NG(X) = V (G)}. In this paper, it is proved that G is fractional 2-covered if δ(G) ≥ 4 and bind(G) > 5 3 .Keywords: graph, binding number, fractional k-factor, fractional k-covered graph.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1165112 On Fractional (k,m)-Deleted Graphs with Constrains Conditions
Authors: Sizhong Zhou, Hongxia Liu
Abstract:
Let G be a graph of order n, and let k 2 and m 0 be two integers. Let h : E(G) [0, 1] be a function. If e∋x h(e) = k holds for each x V (G), then we call G[Fh] a fractional k-factor of G with indicator function h where Fh = {e E(G) : h(e) > 0}. A graph G is called a fractional (k,m)-deleted graph if there exists a fractional k-factor G[Fh] of G with indicator function h such that h(e) = 0 for any e E(H), where H is any subgraph of G with m edges. In this paper, it is proved that G is a fractional (k,m)-deleted graph if (G) k + m + m k+1 , n 4k2 + 2k − 6 + (4k 2 +6k−2)m−2 k−1 and max{dG(x), dG(y)} n 2 for any vertices x and y of G with dG(x, y) = 2. Furthermore, it is shown that the result in this paper is best possible in some sense.
Keywords: Graph, degree condition, fractional k-factor, fractional (k, m)-deleted graph.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1191111 Single Spectrum End Point Predict of BOF with SVM
Authors: Ling-fei Xu, Qi Zhao, Yan-ru Chen, Mu-chun Zhou, Meng Zhang, Shi-xue Xu
Abstract:
SVM ( Support Vector Machine ) is a new method in the artificial neural network ( ANN ). In the steel making, how to use computer to predict the end point of BOF accuracy is a great problem. A lot of method and theory have been claimed, but most of the results is not satisfied. Now the hot topic in the BOF end point predicting is to use optical way the predict the end point in the BOF. And we found that there exist some regular in the characteristic curve of the flame from the mouse of pudding. And we can use SVM to predict end point of the BOF, just single spectrum intensity should be required as the input parameter. Moreover, its compatibility for the input space is better than the BP network.
Keywords: SVM, predict, BOF, single spectrum intensity.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1339110 A Neighborhood Condition for Fractional k-deleted Graphs
Authors: Sizhong Zhou, Hongxia Liu
Abstract:
Abstract–Let k ≥ 3 be an integer, and let G be a graph of order n with n ≥ 9k +3- 42(k - 1)2 + 2. Then a spanning subgraph F of G is called a k-factor if dF (x) = k for each x ∈ V (G). A fractional k-factor is a way of assigning weights to the edges of a graph G (with all weights between 0 and 1) such that for each vertex the sum of the weights of the edges incident with that vertex is k. A graph G is a fractional k-deleted graph if there exists a fractional k-factor after deleting any edge of G. In this paper, it is proved that G is a fractional k-deleted graph if G satisfies δ(G) ≥ k + 1 and |NG(x) ∪ NG(y)| ≥ 1 2 (n + k - 2) for each pair of nonadjacent vertices x, y of G.
Keywords: Graph, minimum degree, neighborhood union, fractional k-factor, fractional k-deleted graph.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1053109 A Schur Method for Solving Projected Continuous-Time Sylvester Equations
Authors: Yiqin Lin, Liang Bao, Qinghua Wu, Liping Zhou
Abstract:
In this paper, we propose a direct method based on the real Schur factorization for solving the projected Sylvester equation with relatively small size. The algebraic formula of the solution of the projected continuous-time Sylvester equation is presented. The computational cost of the direct method is estimated. Numerical experiments show that this direct method has high accuracy.Keywords: Projected Sylvester equation, Schur factorization, Spectral projection, Direct method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1809108 A New Algorithm for Determining the Leading Coefficient of in the Parabolic Equation
Authors: Shiping Zhou, Minggen Cui
Abstract:
This paper investigates the inverse problem of determining the unknown time-dependent leading coefficient in the parabolic equation using the usual conditions of the direct problem and an additional condition. An algorithm is developed for solving numerically the inverse problem using the technique of space decomposition in a reproducing kernel space. The leading coefficients can be solved by a lower triangular linear system. Numerical experiments are presented to show the efficiency of the proposed methods.Keywords: parabolic equations, coefficient inverse problem, reproducing kernel.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1572107 A Robust Audio Fingerprinting Algorithm in MP3 Compressed Domain
Authors: Ruili Zhou, Yuesheng Zhu
Abstract:
In this paper, a new robust audio fingerprinting algorithm in MP3 compressed domain is proposed with high robustness to time scale modification (TSM). Instead of simply employing short-term information of the MP3 stream, the new algorithm extracts the long-term features in MP3 compressed domain by using the modulation frequency analysis. Our experiment has demonstrated that the proposed method can achieve a hit rate of above 95% in audio retrieval and resist the attack of 20% TSM. It has lower bit error rate (BER) performance compared to the other algorithms. The proposed algorithm can also be used in other compressed domains, such as AAC.Keywords: Audio Fingerprinting, MP3, Modulation Frequency, TSM
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2186106 Productivity and Performance of Barangays: The Case of the Heritage City of Vigan, Philippines
Authors: Edelyn Alicar-Cadorna
Abstract:
This study assessed the productivity and performance of the barangays in the Heritage City of Vigan in terms of the barangays- resource requirements, management of resources, produced goods and services, and outcomes of service delivery. The descriptive research design was used in the study employing the input-process-output-outcomes model. Findings of this study showed that the barangays were strong in terms of resource requirements which enabled them to produce goods and services. The barangays were also strong in terms of management of resources in development planning. They also showed great potential along fiscal administration, and had a moderately high capability in organization and management. However, the barangays appeared to be most wanting in the area of barangay legislation, but they were strong in community mobilization and they had strong linkages with POs, NGOs and educational institutions. In the delivery of social services, the barangays favored the maintenance of day care centers. However, the barangays seem to be weak in the delivery of economic services. They fared well along providing protective services such as in establishing a Barangay Disaster Coordinating Council and organizing a group of Barangay Tanod. In terms of environmental services, the barangays performed garbage collection and disposal; however, garbage still found their way in the streets in some barangays. The services delivered had effected an improved status of the barangays. However, the barangays are still facing some problems.
Keywords: Barangays, Performance and Productivity.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13467105 Approximation Incremental Training Algorithm Based on a Changeable Training Set
Authors: Yi-Fan Zhu, Wei Zhang, Xuan Zhou, Qun Li, Yong-Lin Lei
Abstract:
The quick training algorithms and accurate solution procedure for incremental learning aim at improving the efficiency of training of SVR, whereas there are some disadvantages for them, i.e. the nonconvergence of the formers for changeable training set and the inefficiency of the latter for a massive dataset. In order to handle the problems, a new training algorithm for a changeable training set, named Approximation Incremental Training Algorithm (AITA), was proposed. This paper explored the reason of nonconvergence theoretically and discussed the realization of AITA, and finally demonstrated the benefits of AITA both on precision and efficiency.Keywords: support vector regression, incremental learning, changeable training set, quick training algorithm, accurate solutionprocedure
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1470104 Unsupervised Image Segmentation Based on Fuzzy Connectedness with Sale Space Theory
Authors: Yuanjie Zheng, Jie Yang, Yue Zhou
Abstract:
In this paper, we propose an approach of unsupervised segmentation with fuzzy connectedness. Valid seeds are first specified by an unsupervised method based on scale space theory. A region is then extracted for each seed with a relative object extraction method of fuzzy connectedness. Afterwards, regions are merged according to the values between them of an introduced measure. Some theorems and propositions are also provided to show the reasonableness of the measure for doing mergence. Experiment results on a synthetic image, a color image and a large amount of MR images of our method are reported.Keywords: Image segmentation, unsupervised imagesegmentation, fuzzy connectedness, scale space.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1330103 Delay-range-Dependent Exponential Synchronization of Lur-e Systems with Markovian Switching
Authors: Xia Zhou, Shouming Zhong
Abstract:
The problem of delay-range-dependent exponential synchronization is investigated for Lur-e master-slave systems with delay feedback control and Markovian switching. Using Lyapunov- Krasovskii functional and nonsingular M-matrix method, novel delayrange- dependent exponential synchronization in mean square criterions are established. The systems discussed in this paper is advanced system, and takes all the features of interval systems, Itˆo equations, Markovian switching, time-varying delay, as well as the environmental noise, into account. Finally, an example is given to show the validity of the main result.
Keywords: Synchronization, delay-range-dependent, Markov chain, generalized Itō's formula, brownian motion, M-matrix.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1556