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

2014 Conference on Research in Adaptive and Convergent Systems, RACS 2014

作者： Kang, Byeongho Kim, TaeGuen Kang, BooJoong Im, Eul Gyu Ryu, Minsoo Department of Computer and Software Hanyang University Seoul Korea Republic of Institute of Electronics Communications and Information Technology Queen's University of Belfast Belfast United Kingdom Division of Computer Science and Engineering Hanyang University Seoul Korea Republic of

ISBN: (纸本)9781450330602

Dynamic Taint Analysis (DTA) is an approach used for software testing and vulnerability analysis. The vanilla DTA method is widely used, but its simple taint propagation does not consider any control dependency. Therefore, vanilla DTA generally suffers from the under-tainting caused by control dependency. The under-tainting can be problematic when analyzers try to check vulnerabilities of software. In this paper, we propose Dynamic Taint Analysis with Selective Control Dependency (TASEL), to mitigate the under-tainting problem caused by control dependency. Our technique detects control-dependent data which have possibilities to change the program's control flows. We implemented TASEL using Intel Pin, and applied it for the commodity programs such as Microsoft Notepad. Experimental results show our proposed method successfully resolves the under-tainting problem, without causing the over-tainting problem. © 2014 ACM.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

Distributed Adaptive Two-stage Kalman Filter for Target Tracking in the Presence of Unknown Dynamic Bias 33

Distributed Adaptive Two-stage Kalman Filter for Target Trac...

引用

第三十三届中国控制会议

作者： ZHANG Cui JIA Yingmin DU Junping ZHANG Jun The Seventh Research Division and the Department of Systems and Control Beihang University (BUAA) Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and TechnologyBeijing University of Posts and Telecommunications School of Electronic and Information Engineering Beihang University (BUAA)

ISBN: (纸本)9781479947249

This paper is concerned with the problem of tracking target with multiple sensors in the presence of unknown dynamic bias. A suboptimal adaptive two-stage Kalman filter(ATKF) is designed with two reduce-order filters to estimate the target state and the dynamic bias in parallel when the bias model information is incomplete. Moreover, a distributed adaptive two-stage Kalman filter(DATKF) is developed for multi-sensor system based on the ATKF. The effectiveness of the ATKF and the DATKF are illustrated by the Monte Carlo simulation results.

关键词： Dynamic Bias,Adaptive Two-stage Kalman Filter,Distributed Fusion,Multi-sensor System

来源：评论

学校读者我要写书评

暂无评论

New Kinematic Notation and Automatic Generation of Symbolic Dynamics Equations for Space Robots 33

New Kinematic Notation and Automatic Generation of Symbolic ...

引用

第三十三届中国控制会议

作者： ZHANG Hui JIA Yingmin DU Junping ZHANG Jun The Seventh Research Division and the Department of Systems and Control Beihang University (BUAA) Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and TechnologyBeijing University of Posts and Telecommunications School of Electronic and Information Engineering Beihang University (BUAA)

ISBN: (纸本)9781479947249

To verify and evaluate the performance of a space robot controller,kinematics and dynamics of the system have to be formed beforehand for computer *** paper is devoted to develop a new kinematic notation for space robots and to come up with an open source of Matlab subroutines for the propose of obtaining the proper dynamics equations of space robots in symbolic forms *** the new kinematic notation,we will present the general form and two special *** is then demonstrated through an example the advantages such as flexible assignment of frames on space robots,being able to describe multi-DOF joint and achieve a consistent description for multi-arm space *** the second part,we adopt the Lagrangian Formulation for forming the procedures to automatically generate the dynamics equations of space robots in symbolic *** example is then provided to demonstrate the effectiveness of closed-loop simulation adopting the obtained symbolic equations.

关键词： Space Robots,Kinematics,Dynamics,Symbolic Dynamics Equations,Lagrangian

来源：评论

学校读者我要写书评

暂无评论

Survey of dynamic taint analysis

Survey of dynamic taint analysis

引用

IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)

作者： Junhyoung Kim TaeGuen Kim Eul Gyu Im Department of Computer and Software Hanyang University Seoul Korea Division of Computer Science and Engineering Hanyang University Seoul Korea

ISBN: (纸本)9781479947331

Dynamic taint analysis (DTA) is to analyze execution paths that an attacker may use to exploit a system. Dynamic taint analysis is a method to analyze executable files by tracing information flow without source code. DTA marks certain inputs to program as tainted, and then propagates values operated with tainted inputs. Due to the increased popularity of dynamic taint analysis, there have been a few recent research approaches to provide a generalized tainting infrastructure. In this paper, we introduce some approaches of dynamic taint analysis, and analyze their approaches. Lam and Chiueh's approach proposed a method that instruments code to perform taint marking and propagation. DYTAN considers three dimensions: taint source, propagation policies, taint sink. These dimensions make DYTAN to be more general framework for dynamic taint analysis. DTA++ proposes an idea to vanilla dynamic taint analysis that propagates additional taints along with targeted control dependencies. Control dependency causes results of taint analysis to have decreased accuracies. To improve accuracies, DTA++ showed that data transformation containing implicit flows should propagate properly to avoid under-tainting.

关键词： software Instruments Performance analysis Accuracy Testing computer security

来源：评论

学校读者我要写书评

暂无评论

Metadata based combined approach for effective collaborative recommendation 14

Metadata based combined approach for effective collaborative...

引用

2014 Conference on Research in Adaptive and Convergent Systems, RACS 2014

作者： Kim, Kyung Soo Lee, Jun Yeop Choi, Yong Suk Department of Electronics and Computer Engineering Hanyang University 133-791 Haengdang-dong Seongdong-gu Seoul Korea Republic of Department of Computer and Software Hanyang University 133-791 Haengdang-dong Seongdong-gu Seoul Korea Republic of Division of Computer Science and Engineering Hanyang University 133-791 Haengdang-dong Seongdong-gu Seoul Korea Republic of

ISBN: (纸本)9781450330602

In this paper, we propose content-metadata based combined approach to effective collaborative recommendation. Our approach combines user-item rating scores and/or trust network information with content-metadata compensatively for boosting collaborative recommendation. In experiment, we identified that our approach could considerably improve recommendation performance when compared to existing collaborative recommendation methods. © 2014 ACM.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Weighted Combination of Q&A Retrieval Models Based on Part-of-Speech of Question Word

Weighted Combination of Q&A Retrieval Models Based on Part-o...

引用

International Conference on Information science and Applications (ICISA)

作者： Doo soo Chang Yong suk Choi Dept. of Computer and Software Hanyang University Seoul Korea Division of Computer Science and Engineering Hanyang University Seoul Korea

Question and answer archives have become useful information resources with increase of community based question and answer service. For effective question and answering system, it is important to find semantically similar questions and retrieve its answer from the archive for user's question. In this paper, we propose a weighted combination of retrieval models for question and answer archives. In contrast to well-known translation based language model, the proposed model reflects significance of each word in user's question by giving variant weight to the word depending on its part-of-speech. In experiment, our model improves performance considerably when compared to conventional ones.

关键词： Information retrieval Probability Computational modeling Estimation Research and development Educational institutions Smoothing methods

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in Multiobjective Genetic Algorithms for Manufacturing Scheduling Problems 8

引用

8th International Conference on Management science and engineering Management, ICMSEM 2014

作者： Gen, Mitsuo Zhang, Wenqiang Lin, Lin Jo, Jungbok Fuzzy Logic Systems Institute Lizuka Japan College of Information Science and Engineering Henan University of Technology Zhengzhou450000 China School of Software Technology Dalian University of Technology Dalian116000 China Division of Computer and Information Engineering Dongseo University Busan Korea Republic of

ISBN: (纸本)9783642551215

Manufacturing scheduling is one of the important and complex combinatorial optimization problems in manufacturing system, where it can have a major impact on the productivity of a production process. Moreover, most of scheduling problems fall into the class of NP-hard combinatorial problems. In this paper, we concern with the design of multiobjective genetic algorithms (MOGAs) to solve a variety of manufacturing scheduling problems. In particularly, the fitness assignment mechanism and evolutionary representations as well as the hybrid evolutionary operations are introduced. Also, several applications of EAs to the different types of manufacturing scheduling problems are illustrated. Through a variety of numerical experiments, the effectiveness of these hybrid genetic algorithms (HGAs) in the widely applications of manufacturing scheduling problems are demonstrated. This paper also summarizes a classification of scheduling problems and the design way of GAs for the different types of manufacturing scheduling problems in which we apply GAs to a multiobjective flexible job-shop scheduling problem (MoFJSP;operation sequencing with resources assignment) and multiobjective assembly line balancing models (MoALB;shipments grouping and assignment). It is useful to guide how to investigate an effective GA for the practical manufacturing scheduling problems. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Manufacture

来源：评论

学校读者我要写书评

暂无评论

I-CaN-MaMa: Integrated campus network monitoring and management

I-CaN-MaMa: Integrated campus network monitoring and managem...

引用

IEEE/IFIP Network Operations and Management Symposium: Management in a software Defined World, NOMS 2014

作者： Zhao, Shuai Leftwich, Kelsey Owens, Matthew Magrone, Frank Schonemann II, James Anderson, Brian Medhi, Deep Computer Science and Electrical Engineering Department University of Missouri-Kansas City United States Campus Information Services Division University of Missouri-Kansas City United States EAGLE Software Inc. Kansas City MO United States

ISBN: (纸本)9781479909131

A campus network provides a number of services to its stakeholders. Due to the complexity of having many services, it is often difficult to pinpoint an issue quickly. The currently available tools for monitoring a campus network are often designed for a specific piece of the network. On the other hand, systems administrators running a campus network with data centers and supporting a number of internal and external applications face several challenges with the current set of tools for monitoring and management. To fill this void, we propose the I-CaN-MaMa (Integrated Campus Network Monitoring and Management) framework. Our approach takes an integrated view that was developed in consultations with issues faced by systems administrators. We present the key components in this framework and through a brief study, we show the utility of our approach. © 2014 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Searching SNP combinations related to evolutionary information of human populations on HapMap data

Searching SNP combinations related to evolutionary informati...

引用

10th International Symposium on Bioinformatics Research and Applications, ISBRA 2014

作者： Ding, Xiaojun Gu, Haihua Zhang, Zhen Li, Min Wu, Fangxiang School of Information Science and Engineering Central South University Changsha 410083 China School of Computer and Software Nanjing College of Information Technology Nanjing 210023 China Division of Biomedical Engineering University of Saskatchewan Saskatoon SK S7N 5A9 Canada

ISBN: (纸本)9783319081700

The International HapMap Project is a partnership of scientists and funding agencies from different countries to develop a public resource that will help researchers find genes associated with human disease and response to pharmaceuticals. The project has collected large amounts of SNP(single- nucleotide polymorphism) data of individuals of different human populations. Many researchers have revealed evolution information from the SNP data. But how to find all the SNPs related to human evolution is still a hard work. At most time, these SNPs work together which leads to the differences between different human populations. The number of SNP combinations is very large, thus it is impossible to check all the combinations. In this paper, a novel algorithm is proposed to find the SNP combinatorial patterns whose frequencies are quite different in two different populations. The numbers of the multi-SNP combinations are regarded as the differences between each paired human populations, then a hierarchical clustering algorithm is used to construct the evolution trees for human populations. The trees from 4 chromosomes are consistent and the result can be validated by other literatures, which indicates that evolutionary information is well mined. The multi-SNP combinations found by our method can be studied further in many aspects. © 2014 Springer International Publishing Switzerland.

关键词： Population statistics

来源：评论

学校读者我要写书评

暂无评论

Finding high-redshift strong lenses in DES using convolutional neural networks

arXiv

引用

arXiv 2018年

作者： Jacobs, C. Collett, T. Glazebrook, K. McCarthy, C. Qin, A.K. Abbott, T.M.C. Abdalla, F.B. Annis, J. Avila, S. Bechtol, K. Bertin, E. Brooks, D. Buckley-Geer, E. Burke, D.L. Carnero Rosell, A. Carrasco Kind, M. Carretero, J. da Costa, L.N. Davis, C. de Vicente, J. Desai, S. Diehl, H.T. Doel, P. Eifler, T.F. Flaugher, B. Frieman, J. García-Bellido, J. Gaztanaga, E. Gerdes, D.W. Goldstein, D.A. Gruen, D. Gruendl, R.A. Gschwend, J. Gutierrez, G. Hartley, W.G. Hollowood, D.L. Honscheid, K. Hoyle, B. James, D.J. Kuehn, K. Kuropatkin, N. Lahav, O. Li, T.S. Lima, M. Lin, H. Maia, M.A.G. Martini, P. Miller, C.J. Miquel, R. Nord, B. Plazas, A.A. Sanchez, E. Scarpine, V. Schubnell, M. Serrano, S. Sevilla-Noarbe, I. Smith, M. Soares-Santos, M. Sobreira, F. Suchyta, E. Swanson, M.E.C. Tarle, G. Vikram, V. Walker, A.R. Zhang, Y. Zuntz, J. Centre for Astrophysics & Supercomputing Swinburne University of Technology Victoria3122 Australia Institute of Cosmology & Gravitation University of Portsmouth PortsmouthPO1 3FX United Kingdom School of Software and Electrical Engineering Swinburne University of Technology P.O. Box 218 HawthornVIC3122 Australia Cerro Tololo Inter-American Observatory National Optical Astronomy Observatory Casilla 603 La Serena Chile Department of Physics & Astronomy University College London Gower Street LondonWC1E 6BT United Kingdom Department of Physics and Electronics Rhodes University PO Box 94 Grahamstown6140 South Africa Fermi National Accelerator Laboratory P. O. Box 500 BataviaIL60510 United States LSST 933 North Cherry Avenue TucsonAZ85721 United States CNRS UMR 7095 Institut d’Astrophysique de Paris ParisF-75014 France Sorbonne Universités UPMC Univ Paris 06 UMR 7095 Institut d’Astrophysique de Paris ParisF-75014 France Kavli Institute for Particle Astrophysics & Cosmology Stanford University P. O. Box 2450 StanfordCA94305 United States SLAC National Accelerator Laboratory Menlo ParkCA94025 United States Laboratório Interinstitucional de e-Astronomia - LIneA Rua Gal. José Cristino 77 Rio de Janeiro RJ20921-400 Brazil Observatório Nacional Rua Gal. José Cristino 77 Rio de Janeiro RJ20921-400 Brazil Department of Astronomy University of Illinois at Urbana-Champaign 1002 W. Green Street UrbanaIL61801 United States National Center for Supercomputing Applications 1205 West Clark St. UrbanaIL61801 United States Barcelona Institute of Science and Technology Campus UAB Bellaterra [Barcelona08193 Spain Madrid Spain Department of Physics IIT Hyderabad KandiTelangana502285 India Department of Astronomy/Steward Observatory 933 North Cherry Avenue TucsonAZ85721-0065 United States Jet Propulsion Laboratory California Institute of Technology 4800 Oak Grove Dr. PasadenaCA91109 United States Kavli Institute for Cosmological Physics

We search Dark Energy Survey (DES) Year 3 imaging data for galaxy-galaxy strong gravitational lenses using convolutional neural networks. We generate 250,000 simulated lenses at redshifts > 0.8 from which we create a data set for training the neural networks with realistic seeing, sky and shot noise. Using the simulations as a guide, we build a catalogue of 1.1 million DES sources with 1.8 19, g_mag > 20 and i_mag > 18.2. We train two ensembles of neural networks on training sets consisting of simulated lenses, simulated non-lenses, and real sources. We use the neural networks to score images of each of the sources in our catalogue with a value from 0 to 1, and select those with scores greater than a chosen threshold for visual inspection, resulting in a candidate set of 7,301 galaxies. During visual inspection we rate 84 as "probably" or "definitely" lenses. Four of these are previously known lenses or lens candidates. We inspect a further 9,428 candidates with a different score threshold, and identify four new candidates. We present 84 new strong lens candidates, selected after a few hours of visual inspection by astronomers. This catalogue contains a comparable number of high-redshift lenses to that predicted by simulations. Based on simulations we estimate our sample to contain most discoverable lenses in this imaging and at this redshift range. Copyright © 2018, The Authors. All rights reserved.

关键词： Lenses

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：