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

The current state of art in program obfuscations: definitions of obfuscation security

PROGRAMMING AND computer SOFTWARE 2015年第6期41卷 361-372页

作者： Varnovskiy, N. P. Zakharov, V. A. Kuzyurin, N. N. Shokurov, A. V. Moscow MV Lomonosov State Univ Informat Secur Inst Moscow 119234 Russia Natl Res Univ Higher Sch Econ Moscow 101000 Russia Russian Acad Sci Inst Syst Programming Moscow 109004 Russia

Program obfuscation is a semantic-preserving transformation aimed at bringing a program into a form that impedes understanding of its algorithm and data structures or prevents extracting certain valuable information from the text of the program. Since obfuscation may find wide use in computer security, information hiding and cryptography, security requirements to program obfuscators have become a major focus of interest in the theory of software obfuscation starting from the pioneering works in this field. In this paper we give a survey of various definitions of obfuscation security and basic results that establish possibility or impossibility of secure program obfuscation under certain cryptographic assumptions.

关键词： computer software computer security computer programming CRYPTOGRAPHY computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Classification of multilevel converters with a modular reduced structure: implementing a prominent 31-level 5 kVA class B converter

引用

IET POWER ELECTRONICS 2015年第1期8卷 20-32页

作者： Mojibian, Mohammad Jafar Bina, Mohammad Tavakoli KN Toosi Univ Technol Elect Fac Tehran Iran

Multilevel converters are capable of generating AC voltages with low-total harmonic distortion, applicable to power system applications such as penetration of renewable sources in an active network. These types of topologies may require large number of switches and power supplies, having complex structures along with complicated control algorithms. Recently, a branch of multilevel converters is emerged, in which their 'reduced structure' topologies use lower number of devices compared to the available topologies. This study concentrates on classification of the branched 'multilevel converters' with a 'reduced structure' (MCRS) that lowers the number of semiconductor switches as well as their gate-drivers. Then, these classified structures are compared in terms of their number of power supplies and switches, the number of gate-drivers, breaking voltages of the switches and so on. This will pave the way for the introduction of a structure named B2 in the defined class B among the available MCRS topologies with the lowest number of power electronic devices;this structure is obtained by modifying the structure A2 in the defined class A. Moreover, design and simulation of a 31-level converter is analysed under optimal number of DC sources for all named structures. A laboratory prototype was implemented that verifies operation and performance of the suggested structure B2.

关键词： complex structure multistage converter multilayers Electric Power Source Switches Class B MCRS Converters computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Effective Semisupervised Community Detection Using Negative Information

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-8页

作者： Liu, Dong Duan, Dequan Sui, Shikai Song, Guojie Henan Normal Univ Sch Comp & Informat Engn Xinxiang 453007 Peoples R China Peking Univ Sch Elect Engn & Comp Sci Beijing 100871 Peoples R China

The semisupervised community detection method, which can utilize prior information to guide the discovery process of community structure, has aroused considerable research interests in the past few years. Most of the former works assume that the exact labels of some nodes are known in advance and presented in the forms of individual labels and pairwise constraints. In this paper, we propose a novel type of prior information called negative information, which indicates whether a node does not belong to a specific community. Then the semisupervised community detection algorithm is presented based on negative information to efficiently make use of this type of information to assist the process of community detection. The proposed algorithm is evaluated on several artificial and real-world networks and shows high effectiveness in recovering communities.

关键词： SUPERVISION INFORMATION storage & retrieval systems COMMUNITY organization NEURAL networks (computer science) WIRELESS sensor nodes computer algorithms

来源：评论

学校读者我要写书评

暂无评论

WSNs Microseismic Signal Subsection Compression Algorithm Based on Compressed Sensing

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-9页

作者： Liu, Zhouzhou Wang, Fubao Northwestern Polytech Univ Sch Elect & Informat Xian 710072 Peoples R China Xian Aeronaut Univ Xian 710077 Peoples R China

For wireless network microseismic monitoring and the problems of low compression ratio and high energy consumption of communication, this paper proposes a segmentation compression algorithm according to the characteristics of the microseismic signals and the compression perception theory (CS) used in the transmission process. The algorithm will be collected as a number of nonzero elements of data segmented basis, by reducing the number of combinations of nonzero elements within the segment to improve the accuracy of signal reconstruction, while taking advantage of the characteristics of compressive sensing theory to achieve a high compression ratio of the signal. Experimental results show that, in the quantum chaos immune clone refactoring (Q-CSDR) algorithm for reconstruction algorithm, under the condition of signal sparse degree higher than 40, to be more than 0.4 of the compression ratio to compress the signal, the mean square error is less than 0.01, prolonging the network life by 2 times.

关键词： WIRELESS sensor networks MICROSEISMS SIGNAL processing computer algorithms COMPRESSED sensing (Signal processing) ENERGY consumption COMBINATIONS (Mathematics)

来源：评论

学校读者我要写书评

暂无评论

A new hierarchical moving curve-fitting algorithm for filtering lidar data for automatic DTM generation

引用

INTERNATIONAL JOURNAL OF REMOTE SENSING 2015年第14期36卷 3616-3635页

作者： Su, Wei Sun, Zhongping Zhong, Ruofei Huang, Jianxi Li, Menglin Zhu, Jingguo Zhang, Keshu Wu, Honggan Zhu, Dehai China Agr Univ Coll Informat & Elect Engn Beijing 100083 Peoples R China Minist Environm Protect Satellite Environm Ctr Beijing 100094 Peoples R China Capital Normal Univ Key Lab Informat Acquisit & Applicat 3D Minist Educ Beijing 100048 Peoples R China Chinese Acad Sci Acad Optoelect Beijing 100094 Peoples R China Chinese Acad Forestry Res Inst Forest Resource Informat Tech Beijing 100091 Peoples R China

Recent advances in laser scanning hardware have allowed rapid generation of high-resolution digital terrain models (DTMs) for large areas. However, the automatic discrimination of ground and non-ground light detection and ranging (lidar) points in areas covered by densely packed buildings or dense vegetation is difficult. In this paper, we introduce a new hierarchical moving curve-fitting filter algorithm that is designed to automatically and rapidly filter lidar data to permit automatic DTM generation. This algorithm is based on fitting a second-degree polynomial surface using flexible tiles of moving blocks and an adaptive threshold. The initial tile size is determined by the size of the largest building in the study area. Based on an adaptive threshold, non-ground points and ground points are classified and labelled step by step. In addition, we used a multi-scale weighted interpolation method to estimate the bare-earth elevation for non-ground points and obtain a recovered terrain model. Our experiments in four study areas showed that the new filtering method can separate ground and non-ground points in both urban areas and those covered by dense vegetation. The filter error ranged from 4.08% to 9.40% for Type I errors, from 2.48% to 7.63% for Type II errors, and from 5.01% to 7.40% for total errors. These errors are lower than those of triangulated irregular network filter algorithms.

关键词： LIDAR (Optics) DIGITAL elevation models computer algorithms CURVE fitting INTERPOLATION

来源：评论

学校读者我要写书评

暂无评论

Programming the Quantum Future

引用

COMMUNICATIONS OF THE ACM 2015年第8期58卷 52-61页

作者： Valiron, Benoit Ross, Neil J. Selinger, Peter Alexander, D. Scott Smith, Jonathan M. Univ Paris Sud Engn Sch CentraleSupelec Paris France Univ Paris Sud Comp Sci Lab Paris France Dalhousie Univ Halifax NS Canada Dalhousie Univ Math Halifax NS Canada Appl Commun Sci Basking Ridge NJ USA Univ Penn Engn & Appl Sci Philadelphia PA 19104 USA Univ Penn Comp & Informat Sci Philadelphia PA 19104 USA

THE EARLIEST computerS, like the ENIAC, were rare and heroically difficult to program. That difficulty stemmed from the requirement that algorithms be expressed in a "vocabulary" suited to the particular hardware available, ranging from function tables for the ENIAC to more conventional arithmetic and movement operations on later machines. Introduction of symbolic programming languages, exemplified by FORTRAN, solved a major difficulty for the next generation of computing devices by enabling specification of an algorithm in a form more suitable for human understanding, then translating this specification to a form executable by the machine. The "programming language" used for such specification bridged a semantic gap between the human and the computing device. It provided two important features: high-level abstractions, taking care of automated bookkeeping, and modularity, making it easier to reason about sub-parts of programs.

关键词： QUANTUM computing computer science QUANTUM computers computer algorithms computer software development PROGRAMMING languages (Electronic computers)

来源：评论

学校读者我要写书评

暂无评论

Three-Dimensional Dynamic Topology Optimization with Frequency Constraints Using Composite Exponential Function and ICM Method

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-10页

作者： Ye, Hongling Chen, Ning Sui, Yunkang Tie, Jun Beijing Univ Technol Coll Mech Engn & Appl Elect Beijing 100124 Peoples R China Tianjin Univ Finance & Econ Dept Math Tianjin 300222 Peoples R China

The dynamic topology optimization of three-dimensional continuum structures subject to frequency constraints is investigated using Independent Continuous Mapping (ICM) design variable fields. The composite exponential function (CEF) is selected to be a filter function which recognizes the design variables and to implement the changing process of design variables from "discrete" to "continuous" and back to "discrete." Explicit formulations of frequency constraints are given based on filter functions, first-order Taylor series expansion. And an improved optimal model is formulated using CEF and the explicit frequency constraints. Dual sequential quadratic programming (DSQP) algorithm is used to solve the optimal model. The program is developed on the platform of MSC Patran & Nastran. Finally, numerical examples are given to demonstrate the validity and applicability of the proposed method.

关键词： MATHEMATICAL optimization EXPONENTIAL functions TAYLOR'S series QUADRATIC programming computer algorithms MATHEMATICAL models

来源：评论

学校读者我要写书评

暂无评论

Sub-logarithmic distributed algorithms for metric facility location

引用

DISTRIBUTED COMPUTING 2015年第5期28卷 351-374页

作者： Hegeman, James W. Pemmaraju, Sriram V. Univ Iowa Dept Comp Sci Iowa City IA 52242 USA

The facility location problem consists of a set of facilities , a set of clients , an opening cost associated with each facility , and a connection cost between each facility and client . The goal is to find a subset of facilities to open, and to connect each client to an open facility, so as to minimize the total facility opening costs plus connection costs. We consider distributed versions of facility location in which the underlying network is either a clique, in which each node is both a client and a facility (and ), or a complete bipartite network, with forming the bipartition. This paper presents the first expected-sub-logarithmic-round distributed -approximation algorithms in the model for the metric facility location problem. We present our approach first for a clique network, and then extend it to a bipartite network. Our algorithms have expected running times of rounds, where , and where for a clique network and for a bipartite network (These results were first published in ICALP 2012 and DISC 2013). In order to obtain these results, our paper makes four main technical contributions. First, we show a new lower bound for metric facility location, extending the lower bound of Bdoiu et al. (ICALP 2005) that applies only to the special case of uniform facility opening costs. Next, we demonstrate a reduction of the distributed metric facility location problem to the problem of computing an -ruling set of an appropriate spanning subgraph. Third, we provide an expected-sub-logarithmic-round algorithm for computing a -ruling set in a spanning subgraph of a clique. Finally, we present a new technique based on probabilistic hashing to solve a problem of information dissemination on bipartite networks.

关键词： DISTRIBUTED computing RESEARCH computer algorithms BANDWIDTH research BIPARTITE graphs LOCATION problems (Programming)

来源：评论

学校读者我要写书评

暂无评论

WIP Abstract: Multiple Security Domain Nondeducibility for Point-of-Care Diagnostic Technology

WIP Abstract: Multiple Security Domain Nondeducibility for P...

引用

IEEE/ACM International Conference on Cyber-Physical Systems

作者： Fred Love Bruce McMillin Sivanesan Tulasidas W Balachandran Department of Computer Science Missouri University of Science and Technology Rolla Electronic and Computer Engineering Brunel University Uxbridge UK

ISBN: (纸本)9781509017737

Microfluidics is an interdisciplinary science focusing on the development of devices and systems that process low volumes of fluid for applications such as high throughput DNA sequencing, immunoassays, and entire Labs-on-Chip platforms. Microfluidic diagnostic technology enables these advances by facilitating the miniaturization and integration of complex biochemical processing through a microfluidic biochip [1]. This approach tightly couples the biochemical operations, sensing system, control algorithm, and droplet-based biochip. During the process the status of a droplet is monitored in real-time to detect operational errors. If an error has occurred, the control algorithm dynamically reconfigures to allow recovery and rescheduling of on-chip operations. During this recovery procedure the droplet that is the source of the error is discarded to prevent the propagation of the error and the operation is repeated. Threats to the operation of the microfluidics biochip include (1) integrity: an attack can modify control electrodes to corrupt the diagnosis, and (2) privacy: what can a user/operator deduce about the diagnosis? It is challenging to describe both these aspects using existing models;as Figure 1 depicts there are multiple security domains, Unidirectional information flows shown in black indicate undesirable flows, the bidirectional black arrows indicate desirable, but possibly corrupted, information flows, and the unidirectional red arrows indicate undesirable information flows. As with Stuxnet, a bidirectional, deducible information flow is needed between the monitoring security domain and internal security domain (biochip) [2]. Simultaneously, the attacker and the operators should receive a nondeducible information flow. Likewise, the red attack arrows should be deducible to the internal domain. Our current security research direction uses the novel approach of Multiple Security Domain Nondeducibility [2] to explore the vulnerabilities of exploiting this er

关键词： Digital microfluidics point-of-care diagnostics cyberphysical systems information flow security information flow Security Domain computer algorithms Microfluidics Biochips Surgery Point-of-Care Systems protection system control electrode High-Throughput DNA Sequencing Error Sources

来源：评论

学校读者我要写书评

暂无评论

Multi-agent flocking via generalized control algorithms: Existence and properties

Multi-agent flocking via generalized control algorithms: Exi...

引用

International Conference on Control, Automation, Robotics and Vision

作者： Jun Zhou Huimin Qian Xinbiao Lu School of Energy and Electrical Engineering Hohai University Nanjing 211100 China

ISBN: (纸本)9781509035502

In this paper, we propose a class of generalized flocking algorithms based on the Olfati-Saber's results for self-driving multi-agent networks by introducing some metric weighting matrix and leader-agent-related navigation-weighting coefficients, in which the multi-agents are also driven by distributed continuous-time control algorithms that are defined merely by local position and velocity measurements of neighboring multi-agents as usual. It is shown that the concerned multi-agent systems eventually run into what we call the generalized α-lattice flocking by means of the generalized algorithms, while flocking lattice geometries such as direction variation and lattice deformation (say, shrinkage and enlargement) can be achieved by choosing the weighting matrix and the leader agent coefficients. In the process of flocking, the whole multi-agent system satisfies the Reynold's principles of flocking aggregation, collision avoidance and velocity matching, while possible inter-agent collision is also verified by means of the variation-of-constants formula when initially the agents are aggregative too densely.

关键词： Nickel Artificial neural networks Terminology Electrical engineering Electronic mail Velocity measurement Speed measurement Velocimetry electronic mail ELECTRICAL ENGINEERING FLOCKING terminology Artificial neural networks Nickel generalized algorithm computer algorithms electrical engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：