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

IEEE/ACM International Workshop on Emotional Awareness in Software engineering (SEmotion)

作者： Grant Williams Anas Mahmoud Division of Computer Science and Engineering Louisiana Sate University Baton Rouge LA Div. of Comput. Sci. & Eng. Louisiana Sate Univ. Baton Rouge LA USA

ISBN: (纸本)9781538627945

Twitter enables software developers to track users' reactions to newly released systems. Such information, oftenexpressed in the form of raw emotions, can be leveraged to enablea more informed software release process. However, automaticallycapturing and interpreting multi-dimensional structures ofhuman emotions expressed in Twitter messages is not a trivialtask. Challenges stem from the scale of the data available, its inherently sparse nature, and the high percentage of domainspecificwords. Motivated by these observations, in this paperwe present a preliminary study aimed at detecting, classifying, and interpreting emotions in software users' tweets. A datasetof 1000 tweets sampled from a broad range of software systems' Twitter feeds is used to conduct our analysis. Our results showthat supervised text classifiers (Naive Bayes and Support vectorMachines) are more accurate than general-purpose sentimentanalysis techniques in detecting general and specific emotionsexpressed in software-relevant Tweets.

关键词： Twitter Software Feeds Games Mood Sentiment analysis Data collection

来源：评论

学校读者我要写书评

暂无评论

Panspermia of GeoData in support systems for design & execution of operational procedures 3

Panspermia of GeoData in support systems for design & execut...

引用

3rd International Conference on Mathematics and computers in sciences and in Industry, MCSI 2016

作者： Tsavdaridis, George Koukoutsis, Elias Karadimas, Nikolaos V. Div. of Communication Electronic and Information Engineering School of Electrical and Computer Engineering National Technical University of Athens Athens Greece Department of Informatics Mathematics and Engineering Sciences Hellenic Army Academy Vari Greece

ISBN: (纸本)9781509009732

In the present paper, the desired Data/Info that the operational officers need is examined, both during the design phase and during the execution of operational missions. This information has been developed and organized by several military and civilian authorities and organizations at national and international level, but there are severe problems in acquiring external collections of Data/Info. In addition, the observatories of information and repositories of data have collapsed by their large volume. The most significant note is the fact that the desired Data/Info is directly or indirectly georeferenced, very high volume, complex, div.rsified, with internal correlations and therefore requires special handling. Operational officers' duty is supported by useful and powerful tools such as Geographical information Systems, which resolve complex geographical problems in order to take accurate and timely decisions. Nowadays, organizing of Support Systems for designing, monitoring and controlling of operational procedures follow ad hoc heuristic methodologies and forms of internal architectures, which are not able to handle large volume of data core (information), to achieve upgrading, thematic augmentation or shift and do not present the required desirable inner interoperability. The complexity of these Systems does not, also, permit the increasing or modification of the range of the data core (information) functions. There are many technical difficulties in organizing large sets of Data/Info in a single (even composite) information System. It is imperative, by a systematic and orthological way to construct suitable organized georeferenced data cores (and programs) in order to support the operational procedures for a significant number of different missions. It is possible a general, common and adaptable core program to be constructed based on the aforementioned core data. ©2016 IEEE.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

P-193: High Force Sensing Accuracy in Piezoelectric Based Interactive Displays by Artificial Neural Networks

引用

SID Symposium Digest of Technical Papers 2018年第1期49卷

作者： Shuo Gao Jifang Duan Zhicheng Wei Arokia Nathan School of Instrument Science and Opto-Electronics Engineering Beihang University Beijing China Department of Electronic and Electrical Engineering University College London London U.K. College of Information Technology Hebei Normal University Shijiazhuang China Electrical Engineering Div. Department of Engineering University of Cambridge Cambridge U.K.

Over panel stress non-uniformity strongly limits the detection accuracy of piezo based force sensing in interactive displays. In this work, nested artificial neural networks based technique is presented to address the issue of stress non-uniformity. High detection accuracy in terms of touch position and force amplitude is demonstrated by the proposed technique.

关键词： interactive display piezoelectric touch panel force sensing artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Machine learning clustering technique applied to powder X-ray diffraction patterns to distinguish alloy substitutions

arXiv

引用

arXiv 2018年

作者： Utimula, Keishu Hunkao, Rutchapon Yano, Masao Kimoto, Hiroyuki Hongo, Kenta Kawaguchi, Shogo Suwanna, Sujin Maezono, Ryo School of Materials Science JAIST Asahidai 1-1 Nomi Ishikawa923-1292 Japan Optical and Quantum Physics Laboratory Department of Physics faculty of Science Mahidol University Bangkok10400 Thailand Advanced Material Engineering Div. Toyota Motor Corporation Toyota-cho 1 Toyota Aichi471-8572 Japan Research Center for Advanced Computing Infrastructure JAIST Asahidai 1-1 Nomi Ishikawa923-1292 Japan Center for Materials Research by Information Integration Research and Services Division of Materials Data and Integrated System National Institute for Materials Science Tsukuba305-0047 Japan PRESTO JST Kawaguchi Saitama332-0012 Japan Sayo-gun Hyogo679-5148 Japan Asahidai 1-1 Nomi Ishikawa923-1292 Japan Computational Engineering Applications Unit RIKEN 2-1 Hirosawa Wako Saitama351-0198 Japan

We applied the clustering technique using DTW (dynamic time wrapping) analysis to XRD (X-ray diffraction) spectrum patterns in order to identify the microscopic structures of substituents introduced in the main phase of magnetic alloys. The clustering is found to perform well to identify the concentrations of the substituents with successful rates (∼90%). The sufficient performance is attributed to the nature of DTW processing to filter out irrelevant informations such as the peak intensities (due to the incontrollability of diffraction conditions in polycrystalline samples) and the uniform shift of peak positions (due to the thermal expansions of lattices). The established framework is applicable not limited to the system treated in this work but widely to the systems to be tuned their properties by atomic substitutions within a phase. The framework has larger potential to predict wider properties from observed XRD patterns in a way that it can provide such properties evaluated from predicted microscopic local structure, such as magnetic moments, optical spectrum etc.). Copyright © 2018, The Authors. All rights reserved.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

A congestion degree index based bandwidth estimation method using pair packet delay 6

A congestion degree index based bandwidth estimation method ...

引用

6th FTRA International Conference on computer science and its Applications, CSA 2014

作者： Park, Jong-Seon Park, Byoung-Yeon Kim, Seung-Hae Cho, Gi-Hwan Div. of Computer Science and Engineering Chonbuk University Jeonju Korea Republic of Korea Institute of Science and Technology Information Korea Republic of

ISBN: (纸本)9783662454015

In the end to end data transfer protocols, it is a big issue to maximize the transmission rate in order to occupy available bandwidth without packet loss. UDT(UDP based Data Transfer) estimates the available bandwidth based on the pair packet algorithm on the receiver side, and controls the next sending rate with considering the estimated value. However, for a congested network, the estimated value has a tendency to be much greater than the actual bandwidth, and fluctuated in time, so it results in in high loss probability. In this paper, we propose a congestion degree index based bandwidth estimation method using pair packet delay. Experimental results show that the proposed method reliably occupies the available bandwidth with stable bandwidth estimation. The packet loss probability is greatly reduced compared with that of UDT. © Springer-Verlag Berlin Heidelberg 2015.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Design and construction of sinknet for KREONET attack detection 6

Design and construction of sinknet for KREONET attack detect...

引用

6th FTRA International Conference on computer science and its Applications, CSA 2014

作者： Cho, Jinoh Kim, Seunghae Cho, Hyunhun Cho, Gihwan Korea Institute of Science and Technology Information Korea Republic of Div. of Computer Science and Engineering Chonbuk University Jeonju Korea Republic of

ISBN: (纸本)9783662454015

This study attempted to design and construct a scheme to get information on the type and method of recent attacks. When performing specific attacks, the way attackers mostly use IP spoofing, they use IP address barely used to make it their own IP address. This kind of IP spoofing-based attack packet collection & analysis system is called ‘Sinknet’ in this study. This study aims to analyze attacks on the Internet by type after investigating current attack type, method and victim through the design and construction the Sinknet. © Springer-Verlag Berlin Heidelberg 2015.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Write-Avoiding Algorithms

Write-Avoiding Algorithms

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Erin Carson James Demmel Laura Grigori Nicholas Knight Penporn Koanantakool Oded Schwartz Harsha Vardhan Simhadri Courant Institute of Mathematical Sciences New York University Dept. of Mathematics and Computer Science Div. Univ. of California Berkeley INRIA Paris-Rocquencourt Alpines and Courant Institute of UPMC - Univ Paris 6 Laboratoire Jacques-Louis Lions France Computer Science Div. Univ. of California Berkeley School of Engineering and Computer Science Hebrew Univ. of Jerusalem Israel Computational Research Div. Lawrence Berkeley National Lab.

ISBN: (纸本)9781509021413

Communication, i.e., moving data between levels of a memory hierarchy or between processors over a network, is much more expensive (in time or energy) than arithmetic. There has thus been a recent focus on designing algorithms that minimize communication and, when possible, attain lower bounds on the total number of reads and writes. However, most previous work does not distinguish between the costs of reads and writes. Writes can be much more expensive than reads in some current and emerging storage devices such as nonvolatile memories. This motivates us to ask whether there are lower bounds on the number of writes that certain algorithms must perform, and whether these bounds are asymptotically smaller than bounds on the sum of reads and writes together. When these smaller lower bounds exist, we then ask when they are attainable, we call such algorithms "write-avoiding" (WA), to distinguish them from "communication-avoiding" (CA) algorithms, which only minimize the sum of reads and writes. We identify a number of cases in linear algebra and direct N-body methods where known CA algorithms are also WA (some are and some aren't). We also identify classes of algorithms, including Strassen's matrix multiplication, Cooley-Tukey FFT, and cache oblivious algorithms for classical linear algebra, where a WA algorithm cannot exist: the number of writes is unavoidably within a constant factor of the total number of reads and writes. We explore the interaction of WA algorithms with cache replacement policies and argue that the Least Recently Used policy works well with the WA algorithms in this paper. We provide empirical hardware counter measurements from Intel's Nehalem-EX microarchitecture to validate our theory. In the parallel case, for classical linear algebra, we show that it is impossible to attain lower bounds both on interprocessor communication and on writes to local memory, but either one is attainable by itself. Finally, we discuss WA algorithms for sparse iterati

关键词： Nonvolatile memory Schedules Linear algebra Algorithm design and analysis Load modeling Hardware Program processors

来源：评论

学校读者我要写书评

暂无评论

Panspermia of GeoData in Support Systems for Design and Execution of Operational Procedures

Panspermia of GeoData in Support Systems for Design and Exec...

引用

International Conference on Mathematics and computers in sciences and in Industry (MCSI)

作者： George Tsavdaridis Elias Koukoutsis Nikolaos V. Karadimas Div. of Communication Electronic and Information Engineering School of Electrical and Computer Engineering National Technical University of Athens Athens Greece Lecturer of Informatics Mathematics and Engineering Sciences Hellenic Army Academy Vari Greece

ISBN: (纸本)9781509009749

关键词： Roads Organizations information systems Monitoring Interoperability Complexity theory computers

来源：评论

学校读者我要写书评

暂无评论

Model Error Modeling and Stochastic Embedding

引用

IFAC-PapersOnLine 2015年第28期48卷 75-79页

作者： Ljung, Lennart Goodwin, Graham C. Agüero, Juan C. Chen, Tianshi Div. of Automatic Control Linköping University Sweden School of Electrical Engineering and Computer Science The University of Newcastle CallaghanNSW 2308 Australia

To estimate a model of useful complexity for control design, at the same time as having a good insight into its reliability is a central issue in system identification, in particular for identification for control. Basically one can think of a (simpler) design model and a (more complex and exible) error model. These concepts are discussed in terms of model error modeling and stochastic embedding in a framework that allows the error model to vary over time. It is then of interest to estimate a probabilistic description of this error model. This can be accomplished by estimating parameters that describe the pdf of the errors. In this contribution explicit expressions for the likelihood function for these parameters are derived by marginalization over the error model, in case this is a linear regression. © 2015

关键词： Stochastic models Errors Stochastic systems Design modeling Empirical Bayes Error quantification Estimating parameters Identification for control Likelihood functions Model errors Probabilistic descriptions

来源：评论

学校读者我要写书评

暂无评论

Structural information based malicious app similarity calculation and clustering

Structural information based malicious app similarity calcul...

引用

Research in Adaptive and Convergent Systems, RACS 2015

作者： Kim, Junhyoung Kim, Tae Guen Im, Eul Gyu Dept. of Computer and Software Hanyang University Seoul Korea Republic of Div. of Computer Science and Engineering Hanyang University Seoul Korea Republic of

ISBN: (纸本)9781450337380

Depending on expansion of supply of smartphone, development of mobile application is more active using various mobile platform. As a result of malicious applications, but also targeting the mobile it is rapidly increasing. In this paper, method of Android malware similarity and clustering. First, there is a need for a process for extracting the control flow graph in an Android application. By extract the control flow graph, we form structural information of methods in Android application called'4-tuple'. After we create the structural information extracted from the control flow graph it is necessary to compare the matching process. Matching process we propose has two steps, 'initial matching' and 'second matching'. Initial matching step is the process of matching the'4-tuple' information but not exactly same with each other only a single in Android application. Second matching step is process of matching in the same way as the initial matching target method that calling its method and method that is invoked. Finally, it measure the ratio of the total number of method in Android application and matched method after initial matching and second matching. Finally, it measure the ratio of the total number of method in Android application and matched method after initial matching and second matching. We proceeds clustering using the above process. Based on previous studies, we used the DBSCAN algorithm for clustering. It was 65.8% average using the structural information of the result of the clustering. © 2015 ACM.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：