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

International Workshop on Discrete Event Systems, WODES

作者： Béatrice Bérard Olga Kouchnarenko John Mullins Mathieu Sassolas Sorbonne Université UPMC Univ. Paris Paris France FEMTO-ST Univ. Franche-Comté Besançon France Dept. of Computer & Software Eng École Polytechnique de Montréal Montreal Quebec Canada LACL Université Paris-Est Créteil France

Given a probabilistic transition system (PTS) A partially observed by an attacker, and an ω-regular predicate φ over the traces of A, measuring the disclosure of the secret φ in A means computing the probability that an attacker who observes a run of A can ascertain that its trace belongs to φ. We consider specifications given as Interval Markov Chains (IMCs), which are underspecified Markov chains where probabilities on edges are only required to belong to intervals. Scheduling an IMC S produces a concrete implementation as a PTS and we define the worst case disclosure of secret φ in S as the maximal disclosure of φ over all PTSs thus produced. We compute this value for a subclass of IMCs and we prove that simulation between specifications can only improve the opacity of implementations.

关键词： Markov processes Probabilistic logic Semantics Computational modeling Context Observers Automata

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Extracting representative API patterns of malware families using multiple sequence alignments

Extracting representative API patterns of malware families u...

引用

Research in Adaptive and Convergent Systems, RACS 2015

作者： Cho, In Kyeom 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

Nowadays malware developers use various techniques to avoid detection of antivirus software. For variants of malware, existing signature based detection method could be avoidable because those have some differences in static information like code or strings. Therefore, to detect and classify malware variants, a behavior based detection is required. This paper proposes a technique to extract a representative API pattern from API call sequences of a malware family using multiple sequence alignment (MSA) algorithm to measure similarities among malware variants. To extract API call sequences of malware, a sandbox tool was used. After that, the Clustal algorithm, a popular MSA algorithm used in the Bioinformatics field, was applied to malware API call sequences, and the representative API pattern was extracted from the results of MSA. Experiments to test the extracted API patterns that are used to classify malware variants were carried out, and we measured classification accuracy of the representative API pattern of each family. The experimental results show that our proposed method can be effective to classify malware families. © 2015 ACM.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Ensuring the Authenticity and Non-Misuse of Data Evidence in Digital Forensics

引用

Journal of Harbin Institute of Technology(New Series) 2015年第1期22卷 85-90页

作者： Jingsha He Gongzheng Liu Bin Zhao Xuejiao Wan Na Huang School of Software Engineering Beijing University of Technology Dept. of Computer Science Jining University State Key Laboratory of Digital Publishing Technology Peking University Founder Group Co.Ltd

In forensic investigations,it is vital that the authenticity of digital evidence should be ensured. In addition,technical means should be provided to ensure that digital evidence collected cannot be misused for the purpose of perjury. In this paper,we present a method to ensure both authenticity and non-misuse of data extracted from wireless mobile devices. In the method,the device ID and a timestamp become a part of the original data and the Hash function is used to bind the data together. Encryption is applied to the data,which includes the digital evidence,the device ID and the timestamp. Both symmetric and asymmetric encryption systems are employed in the proposed method where a random session key is used to encrypt the data while the public key of the forensic server is used to encrypt the session key to ensure security and efficiency. With the several security mechanisms that we show are supported or can be implemented in wireless mobile devices such as the Android,we can ensure the authenticity and non-misuse of data evidence in digital forensics.

关键词： digital forensics authenticity non-misuse digital

来源：评论

学校读者我要写书评

暂无评论

Interim design report

arXiv

引用

arXiv 2020年

作者： Abramowicz, H. Jovin, T. Agatonovic Alonso, O. Amjad, M.S. An, F. Andricek, L. Anduze, M. Anguiano, J. Antonov, E. Aoki, Y. Arteche, F. Attié, D. Büscher, V. Bach, O. Balagura, V. Baudot, J. Begunov, V. Behera, S. Behnke, T. Bellerive, A. Belver, D. Benhammou, Y. Berggren, M. Berriaud, C. Bertolone, G. Besançon, M. Besson, A. Beyer, J. Bezshyyko, O. Bhattacharya, D.S. Bhattacharya, P. Blazey, G. Bocharnikov, V. Boronat, M. Borysov, O. Bosley, R. Boudry, V. Boumediene, D. Bourgeois, C. Jelisavcic, I. Bozovic Breton, D. Brianne, E. Brient, J.-C. Briggl, K. Buesser, K. Callier, S. Alamillo, E. Calvo Carrillo, C. Catalán, A. Chadeeva, M. Chau, P. Chera, M. Chetverushkin, B. Chrzaszcz, M. Claus, G. Colas, P. Colledani, C. Combaret, C. Cornat, R. Corriveau, F. Danilov, M. de la Taille, C. Deguchi, Y. Desch, K. Dieguez, A. Diener, R. Dixit, M. Dong, M. Dorokhov, A. Dozière, G. Drutskoy, A. Dulucq, F. Dyshkant, A. Edy, E. Eigen, G. Einhaus, U. El Bitar, Z. Elkhalii, A. Emberger, L. Esperante, D. Eté, R. Fang, Y. Fedorchuk, O. Firlej, M. Fiutowski, T. Fleck, I. Fourches, N. Fouz, M.C. Francis, K. Fujii, K. Fujii, K. Fullana, E. Fusayasu, T. Fuster, J. Göttlicher, P. Gadow, K. Gaede, F. Gallas, A. Ganjour, S. García, I. Cabrera, H. García Garillot, G. Garutti, E. Gastaldi, F. Ghislain, P. Goffe, M. Gomis, P. Gong, W. Gonnin, A. Goswami, D. Goto, K. Graf, C. Gregor, I.-M. Grenier, G. Guillaumat, R. Habermehl, M. Hagge, L. Hartbrich, O. Hartjes, F. Henschel, H. Heuchel, D. Hidalgo, S. Himmi, A. Hu, T. Hu-Guo, C. Ianigro, J.-C.T. Idzik, M. Irles, A. Ishihara, H. Ishikawa, A. Jönsson, L. Jaaskelainen, K. Jeans, D. Jeglot, J. Kacarevic, G. Kachel, M. Kajiwara, S. Kalinowski, J. Kaminski, J. Kamiya, Y. Karl, R. Kato, Y. Kato, Y. Kawada, S.-I. Kawagoe, K. Khan, S.A. Kleinwort, C. Kluit, P. Kobayashi, M. Koffmane, C. Komamiya, S. Korpachev, S. Kotera, K. Krämer, U. Krüger, K. Kunath, J. Kurata, M. Kurca, T. AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland University of Bergen Institute for Physics and Technology Bergen Norway University of Birmingham School of Physics and Astronomy Edgbaston United Kingdom Budker Institute of Nuclear Physics Siberian Branch Russian Academy of Sciences Novosibirsk State University Novosibirsk Russia University of Bonn Physikalisches Institut Bonn Germany Bergische Universität Wuppertal Fakultät 4/ Physik Wuppertal Germany Carleton University Ottawa Canada Irfu CEA Université Paris Saclay Gif sur Yvette France CIEMAT - Centro de Investigaciones Energéticas Medioambientales y Tecnológicas Madrid Spain Aix Marseille Univ CNRS/IN2P3 CPPM Marseille France CSIC University of Cantabria Instituto de Física de Cantabria Santander Spain Deutsches Elektronen-Synchrotron Hamburg Germany Dhofar University Salalah Oman University of Hamburg Faculty of Mathematics Informatics and Natural Sciences Hamburg Germany Institute of High Energy Physics Austrian Academy of Science Wien Austria Halbeiterlabor der Max-Planck-Gesellschaft München Germany Keldysh Institute of Applied Mathematics Russian Academy of Sciences Moscow Russia University of Tokyo Tokyo Japan CSIC-University of Valencia Instituto de Física Corpuscular Paterna Spain Kraków Poland Institute of High Energy Physics Chinese Academy of Science Beijing China Indian Institute of Technology GuwahatiAssam India Barcelona Spain Institute of Physics of the Czech Academy of Sciences Prague 8 Czech Republic Institut Pluridisciplinaire Hubert Curien Strasbourg France Institut de Physique des deux infinis de Lyon Villeurbanne France Instituto Tecnológico de Aragòn Zaragoza Spain Iwate University Morioka Japan University of Kansas Department of Physics and Astronomy LawrenceKS United States High Energy Accelerator Research Organisation KEK TsukubaIbaraki Japan Kindai University Department of Physics Higashi Os

来源：评论

学校读者我要写书评

暂无评论

Relative localization of RFID tags using spatial-temporal phase profiling 12

Relative localization of RFID tags using spatial-temporal ph...

引用

12th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2015

作者： Shangguan, Longfei Yang, Zheng Liu, Alex X. Zhou, Zimu Liu, Yunhao Dept. of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong School of Software and TNList Tsinghua University China Dept. of Computer Science and Engineering Michigan State University East Lansing United States

ISBN: (纸本)9781931971218

Many object localization applications need the relative locations of a set of objects as oppose to their absolute locations. Although many schemes for object localization using Radio Frequency Identification (RFID) tags have been proposed, they mostly focus on absolute object localization and are not suitable for relative object localization because of large error margins and the special hardware that they require. In this paper, we propose an approach called Spatial-Temporal Phase Profiling (STPP) to RFID based relative object localization. The basic idea of STPP is that by moving a reader over a set of tags during which the reader continuously interrogating the tags, for each tag, the reader obtains a sequence of RF phase values, which we call a phase profile, from the tag's responses over time. By analyzing the spatial-temporal dynamics in the phase profiles, STPP can calculate the spatial ordering among the tags. In comparison with prior absolute object localization schemes, STPP requires neither dedicated infrastructure nor special hardware. We implemented STPP and evaluated its performance in two real-world applications: locating misplaced books in a library and determining baggage order in an airport. The experimental results show that STPP achieves about 84% ordering accuracy for misplaced books and 95% ordering accuracy for baggage handling. © 2015 by The USENIX Association. All Rights Reserved.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Privacy protection of medical imagery using reversible watermarking 6

Privacy protection of medical imagery using reversible water...

引用

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

作者： Lee, Hae-Yeoun Kim, Sunmyeng Dept. of Computer Software Engineering Kumoh National Institute of Technology 1 Yangho-dong Gumi-si Gyeongbuk Korea Republic of

ISBN: (纸本)9783662454015

This paper addresses a high capacity and quality reversible watermarking algorithm for medical imagery which is directly applicable in medical scanners or PACS systems. After the characteristics of medical imagery are analyzed, a reversible watermarking algorithm using difference histogram shifting is modified. The watermark that is private information is inserted into the original image by modifying the difference histogram of adjacent pixels. After the watermark is extracted from the watermarked image, the original image is perfectly restored. The inherent overflow and underflow issues are solved by applying an error compensation technique. In experiments using various medical imagery such as MRI, CT and X-Ray, the performance is analyzed in aspect of capacity, perceptual quality and the reconstruction rates. Results show that the algorithm performs well for medical imagery. © Springer-Verlag Berlin Heidelberg 2015.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

A new type of preference relations: Fuzzy preference relations with self-confidence

A new type of preference relations: Fuzzy preference relatio...

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： Wenqi Liu Yucheng Dong Francisco Chiclana Enrique Herrera-Viedma Francisco Javier Cabrerizo Business School Sichuan University Chengdu China Faculty of Technology De Montfort University Leicester United Kingdom Enrique Herrera-Viedma is with the DECSAI University of Granada Granada Spain Dept. Software Engineering and Computer Systems UNED Madrid Spain

ISBN: (纸本)9781509006274

Preference relations are very useful to express decision makers' preferences over alternatives in the process of decision-making. However, multiple self-confidence levels are not considered in existing preference relations. In this study, we propose a new type of preference relations: fuzzy preference relations with self-confidence. A linear programming model is proposed for estimating priority vectors of this new type of preference relations. Finally, two numerical examples are provided to demonstrate the linear programming model, and a comparative analysis is used to show the influence of self-confidence levels on the decision-making results.

关键词： Pragmatics Linear programming Stochastic processes Additives Numerical models Electronic mail Decision making

来源：评论

学校读者我要写书评

暂无评论

Performing Automated Experiments with EJsS Laboratories

引用

IFAC-PapersOnLine 2015年第29期48卷 134-139页

作者： Galan, Daniel Heradio, Ruben Torre, Luis De La Dormido, Sebastian Esquembre, Francisco Dept. of Computer Science and Automatic Control Universidad Nacional de Educación A Distancia Juan Del Rosal 16 MadridE-28040 Spain Dept. of Software Engineering and Computer Systems Universidad Nacional de Educación A Distancia Juan del Rosal 16 MadridE-28040 Spain Dept. of Mathematics Universidad de Murcia Campus de Espinardo MurciaE-30071 Spain

Existing software allows the development of high quality interactive applications that permit their implementation in laboratories, both virtual and remote. To perform an experiment, the user needs to know how these applications are implemented. In addition, when coding an experiment, the user has to manage the language in which the simulation was created and needs to handle fluently a simulation language just to perform experiments. In the academic field these simulations are used to create virtual and remote laboratories. The authors propose a tool to develop automated experiments for these laboratories. It is intended that the experiments use a powerful and simple language to improve students interaction with the laboratories. That is, avoid repetitive tasks using simple algorithms, data collection and analysis of results, among other features. A new environment for the development of experiments in the authoring tool Easy Java(script) Simulations (EjsS) is proposed. It permits the decoupling of the application design phase from the experiment design. It has been equipped with a language capable of encircling all the expected commands, such as creating events, launching simultaneous applications or modifying their variables. Set with a high level layer, the language allows less experienced users to create their own experiments without having any knowledge of how the application was made. These features will be explained throughout the paper and some physic and control examples of use, as a controller for a cylindrical and a circular tank or a motion controller for a remote robot, will be given to demonstrate the potential of this new environment. © 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Java programming language Application programs computer simulation languages Experiments Laboratories Technology transfer Easy Java(script) Simulations Experimentation Language Remote laboratories Simulations Virtual laboratories

来源：评论

学校读者我要写书评

暂无评论

Improving the OVO performance in Fuzzy Rule-Based Classification Systems by the genetic learning of the granularity level

Improving the OVO performance in Fuzzy Rule-Based Classifica...

引用

IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2015

作者： Villar, Pedro Fernandez, Alberto Montes, Rosana Sanchez, Ana Maria Herreraz, Francisco Department of Software Engineering University of Granada Spain Dept. of Computer Science University of Jaén Spain Department of Computer Science and Artificial Intelligence University of Granada Spain

ISBN: (纸本)9781467374286

This contribution proposes a genetic learning process for designing the knowledge base of Fuzzy Rule-Based classification Systems, that will be used as binary classifiers in a One-vs-One decomposition for multi-class problems. A Genetic Algorithm is designed to adapt the number of fuzzy labels per variable (granularity level) for each classifier in order to improve the accuracy rate of a multi-class classifier. The genetic learning process evolves granularity levels and needs a fuzzy rules generation method for generating the whole knowledge base of the Fuzzy System. Several data-sets from KEEL data-set repository are used in the experimental study and we compare our proposal with three related methods: the standard way to design Fuzzy Rule-Based Classification Systems using the fuzzy rules generation method chosen with and without One-vs-One decomposition, and our proposal of genetic granularity level learning without One-vs-One decomposition. © 2015 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：