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

International Conference on Advances in Computing, Communications and Informatics

作者： Remya R. K. Menon Gargi, S. Samili, S. Department of Computer Science and Applications Amrita School of Engineering Amrita Vishwa Vidyapeetham Amrita University

ISBN: (纸本)9781509020300

Language is the way of communication through words. This will help to get a better insight of the world. Natural Language Processing (NLP) mainly concentrate on expanding systems that allow computers to communicate with people using everyday language. One of the challenges inherent in NLP is teaching computers to recognize the way humans learn and use language. Word representations give rise to capture syntactic and semantic properties of words. So the main purpose of this work is to find out the set of words which have similar semantics by matching the context in which the words occur. In this work we explore a new method for learning word representations using sparse coding, a technique usually done on signals and images. We present an efficient sparse coding algorithm, Orthogonal Matching Pursuit to generate the sparse code. Based on the input given, sparse codes are generated for the input. The input term vectors are classified based on the sparse code by grouping the terms which have same sparse code into one class. K-Means algorithm is also used to classify the input terms vectors which have semantic similarities. Finally, this paper makes a comparison that gives the best representation from the sparse code and K-Means. The result shows an improved set of similar words using sparse code when compared to K-Means. This is because SVD is used as a part of dictionary learning which captures the latent relationship that exists between the words.

关键词： NLP Sparse Coding Dictionary Learning K-Means OMP K-SVD Terms PMI

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving anomaly detection across multi-domain for software defined networks 7th

Privacy-preserving anomaly detection across multi-domain for...

引用

7th International Conference on the Theory, Technologies and applications of Trusted Systems, INTRUST 2015

作者： Bian, Huishan Zhu, Liehuang Shen, Meng Wang, Mingzhong Xu, Chang Zhang, Qiongyu Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications School of Computer Science Beijing Institute of Technology Beijing China Nanjing China University of the Sunshine Coast Queensland Australia

ISBN: (纸本)9783319315492

Software Defined Network (SDN) separates control plane from data plane and provides programmability which adds rich function for anomaly detection. In this case, every organization can manage their own network and detect anomalous traffic data using SDN architecture. Moreover, detection of malicious traffic, such as DDoS attack, would be dealt with much higher accuracy if these organizations shared their data. Unfortunately, they are unwilling to do so due to privacy consideration. To address this contradiction, we propose an efficient and privacy-preserving collaborative anomaly detection scheme. We extend prior work on SDN-based anomaly detection method to guarantee accuracy and privacy at the same time. The implementation of our design on simulated data shows that it performs well for network-wide anomaly detection with little overhead. © Springer International Publishing Switzerland 2016.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

Harnessing the discriminatory strength of dictionaries

Harnessing the discriminatory strength of dictionaries

引用

International Conference on Advances in Computing, Communications and Informatics (ICACCI)

作者： Remya R K Menon Neethu V Kini G Athira Krishnan Department of Computer Science and Applications Amrita School of Engineering Amrita Vishwa Vidyapeetham Amritapuri Kollam

ISBN: (纸本)9781509020300

Over the past few years there are many developments in the area of classification in data mining. Classification is a supervised learning method, that maps data into predefined groups or classes. Nowadays classification techniques are extensively used in different applications. In this area most of the research works are done on text, image, signal etc. The main goal of this paper is to use a dictionary-based approach to learn, represent and classify documents. We consider dictionary as a collection of documents and each document in the dictionary is represented as a collection of vectors. An algorithm is also implemented to easily locate a class specific document in the dictionary and if it is not present, update the dictionary. The existing method is based on a dictionary learning algorithm which only improves the document representation based on Singular Value Decomposition (SVD) updation. Since SVD will not be helpful for discrimination of data, so our proposed algorithm is Linear Discriminant Analysis (LDA) for learning a discriminating dictionary. On applying the proposed algorithm on well known dataset, the overall results obtained shows 90% improvement in accuracy. The advantage is that it can be used for both representation as well as classification.

关键词： Dictionaries Algorithm design and analysis Classification algorithms Sparse matrices Matching pursuit algorithms Image coding Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

A novel PUF based on cell error rate distribution of STT-RAM 21

A novel PUF based on cell error rate distribution of STT-RAM

引用

21st Asia and South Pacific Design Automation Conference, ASP-DAC 2016

作者： Zhang, Xian Guangyu, Sun Zhang, Yaojun Chen, Yiran Li, Hai Wen, Wujie Di, Jia Center for Energy-Efficient Computing and Applications Peking University Beijing100871 China Collaborative Innovation Center of High Performance Computing NUDT Changsha410073 China Department of Electrical and Computer Engineering University of Pittsburgh PittsburghPA15261 United States Department of Electrical and Computer Engineering Florida International University MiamiFL33199 United States Computer Science and Computer Engineering University of Arkansas FayettevilleAR72701 United States

ISBN: (纸本)9781467395694

Physical Unclonable Functions (PUFs) have been widely proposed as security primitives to provide device identification and authentication. Recently, PUFs based on Non-volatile Memory (NVM) are widely proposed since the promise of NVMs' wide application. In addition, NVM-based PUFs are considered to be more immune to invasive attack and simulation attack than CMOS-based PUFs. However, the existing NVM-based PUF either shows the unreliability under environmental variations or need extra modifications to the IC manufacturing process. In this work, we propose err-PUF, a novel PUF design based on the cell error rate distribution of STT-RAM. Instead of using the distribution directly, we generate a stable fingerprint based on a novel concept called Error-rate Differential Pair (EDP) without modifications to the read/write circuits. Comprehensive results demonstrate that err-PUF can achieve sufficient reliability under environmental variations, which can significantly impact the cell error rates. Moreover, compared with existing approaches, err-PUF has a higher speed and lower power consumption with negligible overhead. © 2016 IEEE.

关键词： Hardware security

来源：评论

学校读者我要写书评

暂无评论

Mean-field theory for the Nagel-Schreckenberg model with overtaking strategy

引用

Journal of Physics: Conference Series 2018年第1期1113卷

作者： Zhu Su Weibing Deng Jihui Han Wei Li Xu Cai National Engineering Laboratory for Technology of Big Data Applications in Education Central China Normal University Wuhan P. R. China Complexity Science Center Institute of Particle Physics Central China Normal University Wuhan P. R. China School of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou P.R. China

Based on the Nagel-Schreckenberg (NS) model with periodic boundary conditions, a modified model considered overtaking strategy (NSOS) has been proposed [1, 2]. In this paper, we focus on the theoretical analysis of traffic flow for NSOS model by using mean-field method. In the special case of vmax = 1 where vehicles can not overtake preceding ones, the features of stationary state can be obtained exactly. However, in the case of vmax > 1 where overtaking happens, some approximative methods have to be took into account. The main results are that we find the reason why traffic flow is increased in the regime where densities exceed the maximum flow density, and the influence of traffic flow on the transition density is dominated by the braking probability p.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Arbitrary order 2D virtual elements for polygonal meshes: Part II, inelastic problem

arXiv

引用

arXiv 2017年

作者： Artioli, E. Beirão da Veiga, L. Lovadina, C. Sacco, E. Department of Civil Engineering and Computer Science University of Rome Tor Vergata Via del Politecnico 1 Rome00133 Italy Department of Mathematics and Applications University of Milan Bicocca Via Roberto Cozzi 55 Milan20125 Italy Department of Mathematics University of Milano Via Cesare Saldini 50 Milano20133 Italy Civil Engineering and Mechanical Engineering University of Cassino and Southern Lazio Via Di Biasio 43 Cassino03043 Italy

The present paper is the second part of a twofold work, whose first part is reported in [3], concerning a newly developed Virtual Element Method (VEM) for 2D continuum problems. The first part of the work proposed a study for linear elastic problem. The aim of this part is to explore the features of the VEM formulation when material nonlinearity is considered, showing that the accuracy and easiness of implementation discovered in the analysis inherent to the first part of the work are still retained. Three different nonlinear constitutive laws are considered in the VEM formulation. In particular, the generalized viscoplastic model, the classical Mises plasticity with isotropic/kinematic hardening and a shape memory alloy (SMA) constitutive law are implemented. The versatility with respect to all the considered nonlinear material constitutive laws is demonstrated through several numerical examples, also remarking that the proposed 2D VEM formulation can be straightforwardly implemented as in a standard nonlinear structural finite element method (FEM) framework. Copyright © 2017, The Authors. All rights reserved.

关键词： Plasticity

来源：评论

学校读者我要写书评

暂无评论

Application-layer clock synchronization for wearables using skin electric potentials induced by powerline radiation

arXiv

引用

arXiv 2017年

作者： Yan, Zhenyu Li, Yang Tan, Rui Huang, Jun School of Computer Science and Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Advanced Digital Sciences Center Illinois at Singapore Connexis North Tower 1 Fusionopolis Way #08-10 Singapore138632 Center for Energy Efficient Computing and Applications Peking University 5 Yiheyuan Road Haidian Beijing100871 China

Design of clock synchronization for networked nodes faces a fundamental trade-off between synchronization accuracy and universality for heterogeneous platforms, because a high synchronization accuracy generally requires platform-dependent hardware-level network packet timestamping. This paper presents TouchSync, a new indoor clock synchronization approach for wearables that achieves millisecond accuracy while preserving universality in that it uses standard system calls only, such as reading system clock, sampling sensors, and sending/receiving network messages. The design of TouchSync is driven by a key finding from our extensive measurements that the skin electric potentials (SEPs) induced by powerline radiation are salient, periodic, and synchronous on a same wearer and even across different wearers. TouchSync integrates the SEP signal into the universal principle of Network Time Protocol and solves an integer ambiguity problem by fusing the ambiguous results in multiple synchronization rounds to conclude an accurate clock offset between two synchronizing wearables. With our shared code, TouchSync can be readily integrated into any wearable applications. Extensive evaluation based on our Arduino and TinyOS implementations shows that TouchSync's synchronization errors are below 3 and 7 milliseconds on the same wearer and between two wearers 10 kilometers apart, respectively. Copyright © 2017, The Authors. All rights reserved.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Object verification in two views using Sparse representation 23

Object verification in two views using Sparse representation

引用

23rd International Conference on Pattern Recognition, ICPR 2016

作者： Hsu, Shih-Chung Chang, I-Cheng Huang, Chung-Lin Department of Electrical Engineering National Tsing-Hua University Hsin-Chu Taiwan Department of Computer Science and Information Dong-Hwa University Hua-Lien Taiwan Department of M-Commerce and Multimedia Applications Asia University Tai-Chung Taiwan

ISBN: (纸本)9781509048472

This paper proposes an object verification method by using sparse representation (SR) which has been applied for object representation and recognition. However, SR dictionary does not show sufficient compactness. Our method comprises three major modules. First, we train the sparse matrix by using boost K-Singular Value Decomposition (boost K-SVD) to obtain a sparse vector set. Second, we combine two training sparse vector sets of the same and different objects from two views to generate a positive/negative combined sparse vector set. Finally, a Support Vector Machine (SVM) classifier is applied for verification. Our contributions are (1) obtaining a sparser vector set using K-SVD, (2) demonstrating the SR matrix with better Restricted Isometry Property (RIP), and (3) applying the SR matrix to the object verification process with high accuracy. The experimental results prove that our method has higher accuracy than the other methods. © 2016 IEEE.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

SN 2018agk: A prototypical Type Ia Supernova with a smooth power-law rise in Kepler (K2)

arXiv

引用

arXiv 2021年

作者： Wang, Qinan Rest, Armin Zenati, Yossef Ridden-Harper, Ryan Dimitriadis, Georgios Narayan, Gautham Villar, V. Ashley Magee, Mark R. Foley, Ryan J. Shaya, Edward J. Garnavich, Peter Wang, Lifan Hu, Lei Bódi, Attila Armstrong, Patrick Auchettl, Katie Barclay, Thomas Barentsen, Geert Bognár, Zsófia Brimacombe, Joseph Bulger, Joanna Burke, Jamison Challis, Peter Chambers, Kenneth Coulter, David A. Csörnyei, Géza Cseh, Borbála Deckers, Maxime Dotson, Jessie L. Galbany, Lluís González-Gaitán, Santiago Gromadzki, Mariusz Gully-Santiago, Michael Hanyecz, Ottó Hedges, Christina Hiramatsu, Daichi Hosseinzadeh, Griffin Howell, D. Andrew Howell, Steve B. Huber, Mark E. Jha, Saurabh W. Jones, David O. Könyves-Tóth, Réka Kalup, Csilla Kilpatrick, Charles D. Kriskovics, Levente Li, Wenxiong Lowe, Thomas B. Margheim, Steven McCully, Curtis Mitra, Ayan Muñoz, Jose A. Nicholl, Matt Nordin, Jakob Pál, András Pan, Yen-Chen Piro, Anthony L. Rest, Sofia Rino-Silvestre, João Rojas-Bravo, César Sárneczky, Krisztián Siebert, Matthew R. Smartt, Stephen J. Smith, Ken Sódor, Ádám Stritzinger, Maximilian D. Szabó, Róbert Szakáts, Róbert Tucker, Brad E. Vinkó, József Wang, Xiaofeng Wheeler, J. Craig Young, David R. Zenteno, Alfredo Zhang, Kaicheng Zsidi, Gabriella Department of Physics and Astronomy The Johns Hopkins University BaltimoreMD21218 United States Space Telescope Science Institute BaltimoreMD21218 United States Israel Excellence Fellowship Department of Astronomy and Astrophysics University of California Santa CruzCA95064 United States School of Physics Trinity College Dublin The University of Dublin Dublin 2 Ireland Department of Astronomy University of Illinois 1002 W. Green St. Urbana-ChampaignIL61801 United States Center for Astrophysical Surveys National Center for Supercomputing Applications UrbanaIL61801 United States Department of Astronomy & Astrophysics The Pennsylvania State University University ParkPA16802 United States Institute for Computational & Data Sciences The Pennsylvania State University University ParkPA16802 United States Institute for Gravitation and the Cosmos The Pennsylvania State University University ParkPA16802 United States Astronomy Department University of Maryland College ParkMD20742 United States University of Notre Dame Notre DameIN46556 United States Mitchell Institute for Fundamental Physics Department of Physics and Astronomy Texas A&M University College StationTX77843 United States Purple Mountain Observatory Chinese Academy of Sciences 10 Yuanhua Road Nanjing210033 China Konkoly Observatory CSFK Konkoly-Thege M. ut 15-17 Budapest1121 Hungary MTA CSFK Lendület Near-Field Cosmology Research Group Konkoly Thege Miklós út 15-17 Budapest1121 Hungary Mt Stromlo Observatory The Research School of Astronomy and Astrophysics Australian National University ACT2601 Australia School of Physics The University of Melbourne VIC3010 Australia University of Maryland Baltimore County 1000 Hilltop Circle BaltimoreMD21250 United States Bay Area Environmental Research Institute P.O. Box 25 Moffett Field CA94035 United States Coral Towers Observatory Cairns Australia Institute for Astronomy University of Hawai'i 2680 Woodlawn Drive HonoluluHI96

We present the 30-min cadence Kepler/K2 light curve of the Type Ia supernova (SN Ia) SN 2018agk, covering approximately one week before explosion, the full rise phase and the decline until 40 days after peak. We additionally present ground-based observations in multiple bands within the same time range, including the 1-day cadence DECam observations within the first ~5 days after the first light. The Kepler early light curve is fully consistent with a single power-law rise, without evidence of any bump feature. We compare SN 2018agk with a sample of other SNe Ia without early excess flux from the literature. We find that SNe Ia without excess flux have slowly-evolving early colors in a narrow range (g - i ≈ -0.20±0.20 mag) within the first ~ 10 days. On the other hand, among SNe Ia detected with excess, SN 2017cbv and SN 2018oh tend to be bluer, while iPTF16abc's evolution is similar to normal SNe Ia without excess in g - i. We further compare the Kepler light curve of SN 2018agk with companion-interaction models, and rule out the existence of a typical non-degenerate companion undergoing Roche-lobe overflow at viewing angles smaller than 45°. © 2021, CC BY.

关键词： Supernovae

来源：评论

学校读者我要写书评

暂无评论

Improving constrained glider trajectories for ocean eddy border sampling within extended mission planning time

Improving constrained glider trajectories for ocean eddy bor...

引用

2016 IEEE Congress on Evolutionary Computation, CEC 2016

作者： Zamuda, Aleš Daniel Hernández Sosa, José Adler, Leonhard Faculty of Electrical Engineering and Computer Science University of Maribor Smetanova ul. 17 Maribor2000 Slovenia Institute of Intelligent Systems and Numerical Applications in Engineering University of Las Palmas de Gran Canaria Campus de Tafira Las Palmas de Gran Canaria35017 Spain

ISBN: (纸本)9781509006229

This paper extends the performance assessment of an underwater glider path planning approach recently proposed for constrained sub-mesoscale eddy border sampling conditions, for situations benefiting from extended mission planning time. The aim of addressing such situations is to improve the glider vehicle capabilities through improving its off-board controller, which computes an improved trajectory for the eddy sampling task, compared to the usual rather shorter planning time. The improvement in robustness for the controller for several scenarios in this global trajectory optimization is also analyzed, together with comparison to shorter planning time for this autonomous vehicle and environmental data sampling type. As shown through results, the approach is able to provide several useful and non-intuitive solutions, improving in helpful ways. The trajectories for sub-mesoscale eddy sampling are thereby improved, in a way that might be useful for possible machine controller pondering or auto-piloting at open sea, when piloting user feedback is not available or even amidst the consecutive interruptions of user-intensive planning instructions. Managing complexity under limited resources and designing vessel navigation schedule plan under uncertain conditions within such extended mission planning time, therefore improves the mission quality as well. By optimizing trajectories with differential evolution and then visualizing them, we provide human-machine interaction for rapid knowledge discovery, data mining, and presentation of possibly large space satellite captured data sets (Big Data) analysis and exploitation. © 2016 IEEE.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：