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

International Conference on Computing Methodologies and Communication (ICCMC)

作者： Sidhant Allawadi Ritika Vivek Rana Minni Jain Delhi Technological University New Delhi India

ISBN: (纸本)9781665403603;9781665447751

In recent years, there has been a massive increase in multimedia data due to the increasing use of social media and communication technology. So, extracting useful information from a large set of data has become difficult and very time consuming. Multimedia Data (Text, Image, Audio, Video) summarization is a very useful technology that overcomes this challenge by eliminating information that is redundant or useless, and extracting only the relevant key details of the events in summaries. A lot of work has been done in this field to generate summaries in the form of text and images, but very limited research has been done to produce a multimodular summary especially on Asynchronous Data. This research work proposes an ILP based model, which takes a multimodal dataset (text, images, videos) as input and generates textual and image video summary as output. The results were obtained by comparing the two basic baseline's ROUGE values with the proposed model. Results for different modalities have confirmed that the proposed model performs better than the other baseline approaches.

关键词： Social networking (online) Computational modeling Multimedia computing Mixture models Streaming media integer linear programming Data models

来源：评论

学校读者我要写书评

暂无评论

Sidelobe Suppression by Phase-only Tapering with integer linear programming

Sidelobe Suppression by Phase-only Tapering with Integer Lin...

引用

IEEE International Conference on Radar

作者： Ke Miao Yi Zhang Chen Yao Houjun Sun Beijing Key Laboratory of Millimeter Wave and Terahertz Techniques School of Information and Electronics Beijing Institute of Technology Beijing China School of Physics Beijing Institute of Technology Beijing China

ISBN: (纸本)9781665468893

Phase-only tapering for sidelobe suppression is a simple method of phased array design due to the simplification of antenna manufacturing. When using digital phase shifters, considering the quantization of the phase, we employ integer linear programming to adjust the phased shifter and get a better pattern. The proposed method combines a fast sidelobe formula with a power reduction mathematical technique. Finally, we conduct numeric experiments to verify the proposed method.

关键词： Phased arrays Quantization (signal) Phase shifters Radar integer linear programming Manufacturing

来源：评论

学校读者我要写书评

暂无评论

Resolving Logical Contradictions in Description Logic Ontologies Based on integer linear programming

引用

IEEE ACCESS 2019年 7卷 71500-71510页

作者： Ji, Qiu Boutouhami, Khaoula Qi, Guilin Nanjing Univ Posts & Telecommun Sch Modern Posts Nanjing 210023 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Inst Modern Posts Nanjing 210023 Jiangsu Peoples R China Southeast Univ Sch Comp Sci & Engn Nanjing 211189 Jiangsu Peoples R China Southeast Univ Key Lab Comp Network & Informat Integrat Minist Educ Nanjing 211189 Jiangsu Peoples R China

When resolving logical contradictions in ontologies, Reiter's hitting set tree algorithm is often applied to satisfy the minimal change principle. To improve the efficiency, the researchers have proposed various algorithms by using a scoring function, defining new semantics or applying some heuristic strategies. However, these algorithms either sacrifice minimal change or are designed for less expressive ontologies like DL-Lite. In this paper, we propose a mathematic approach based on integer linear programming, which is an optimization problem of maximizing or minimizing a linear objective function, to deal with DL ontologies. Specifically, we define the integer linear programming-based model to resolve logical contradictions. To realize the model, we propose one algorithm to find a cardinality-minimal solution and two algorithms dealing with weighted ontologies. Our experiments are conducted over 70 real-life and artificial ontologies to compare our algorithms with those hitting set tree-based ones. Through the experiments, the prominent efficiency and effectiveness have been exhibited by our algorithms. They usually take about 0.4 s to find a solution while others spend more than 100 s in many cases. The experimental results also show that the first two algorithms could find the cardinality-minimal solutions and those with a minimal sum of weights, respectively.

关键词： Logical contradictions inconsistency handling ontology repair semantic web integer linear programming

来源：评论

学校读者我要写书评

暂无评论

On-line verification of initial-state opacity by Petri nets and integer linear programming

引用

ISA TRANSACTIONS 2019年 93卷 108-114页

作者： Cong, Xuya Fanti, Maira Pia Mangini, Agostino Marcello Li, Zhiwu Xidian Univ Sch Electromech Engn 2 South Taibai Rd Xian 710071 Shaanxi Peoples R China Polytech Bari Dept Elect & Informat Engn I-70125 Bari Italy Macau Univ Sci & Technol Inst Syst Engn Taipa Macao Peoples R China

This paper deals with a problem related to the observability of discrete event systems: the initial-state opacity. Given a set of system states (the secret), a system observation is called initial-state opaque if an agent (named intruder), who can partially observe the system, cannot determine whether the set of initial states consistent with an event sequence is included in the secret. Such a character can describe security problems in cyber-infrastructures, such as Internet and mobile communication networks or national defense service systems. This work presents a novel on-line methodology to verify the notion of initial-state opacity of discrete event systems that are modeled by labeled Petri nets. By working on-line, the intruder records an event and exploits integer linear programming problem for checking the initial-state opacity of the system's evolution under the given observation. A set of examples are shown to shed light on the efficiency of the presented methodology. (C) 2019 ISA. Published by Elsevier Ltd. All rights reserved.

关键词： Initial-state opacity Petri nets integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Acoustic event diarization in TV/movie audios using deep embedding and integer linear programming

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2019年第23期78卷 33999-34025页

作者： Li, Yanxiong Zhang, Yuhan Li, Xianku Liu, Mingle Wang, Wucheng Yang, Jichen South China Univ Technol Sch Elect & Informat Engn Room 223Shaw Sci Bldg381 Wushan Rd Guangzhou 510640 Guangdong Peoples R China

In this study, we propose a method for acoustic event diarization based on a feature of deep embedding and a clustering algorithm of integer linear programming. The deep embedding learned by deep auto-encoder network is used to represent the properties of different classes of acoustic events, and then the integer linear programming is adopted for merging audio segments belonging to the same class of acoustic events. Four kinds of TV/movie audios (21.5 h in total) are used as experimental data, including Sport, Situation comedy, Award ceremony, and Action movie. We compare the deep embedding with state-of-the-art features. Further, the clustering algorithm of integer linear programming is compared with other clustering algorithms adopted in previous works. Finally, the proposed method is compared to both supervised and unsupervised methods on four kinds of TV/movie audios. The results show that the proposed method is superior to other unsupervised methods based on agglomerative information bottleneck, Bayesian information criterion and spectral clustering, and is little inferior to the supervised method based on deep neural network in terms of acoustic event error.

关键词： Deep embedding integer linear programming acoustic event detection audio content analysis

来源：评论

学校读者我要写书评

暂无评论

A Bi-objective integer linear programming model for the routing and network coding assignment problem in WDM optical networks with dedicated protection

引用

COMPUTER COMMUNICATIONS 2019年第Jan.期133卷 51-58页

作者： Dao Thanh Hai Vietnam Natl Univ Int Sch Lab Data Sci & Optimizat Complex Syst Hanoi Vietnam

The explosive traffic growths are pushing the transport network close to its capacity limitation, raising critical issues about fiber capacity crunch. In this context, network coding has been emerging as the promising technique to improve the network capacity efficiency thanks to the capability of better resources utilization. The application of network coding to the realms of failure recovery in optical networks has paved the new way for more efficient protection schemes and indeed, XOR network coding combined with dedicated protection has been proposed, investigated and developed to challenge the well-established understanding of trading capacity efficiency for recovery speed and vice versa. In order to maximize the benefits empowered by network coding in this case, the problem of 1 + 1 routing and network coding assignment (1 + 1 RNCA) has to be optimally solved. Apart from traditional 1 + 1 routing, the decision of network coding information has also to be taken into account including the selection of pair of demands for encoding and the respective coding node and coding links. In this paper, we propose a bi-objective integer linear programming model of the 1 + 1 RNCA problem aiming at minimizing the conventional routing cost as the primary objective and furthermore minimizing the number of nodes with coding capabilities as the secondary objective. Our formulation uses a weighting method to combine two objectives into an integrated one and we provide a rigorous analysis on configuring the weight coefficients to capture the desired priority of individual objectives. The efficiency of our integrated objective model in comparison with reference designs based on the single-objective model, 1 + 1 routing and 1 + 1 RNCA, is numerically evaluated on different realistic topologies and traffic sets. Extensive simulation demonstrates that our proposal outperforms traditional approaches when it could achieve the lowest routing cost while simultaneously employing minimal nu

关键词： Routing Dedicated protection WDM optical networks Network coding integer linear programming Bi-objective model

来源：评论

学校读者我要写书评

暂无评论

A Petri Net Approach to Generate integer linear programming Problems

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2019年第2期E102A卷 389-398页

作者： Nakamura, Morikazu Tengan, Takeshi Yoshida, Takeo Univ Ryukyus Fac Engn Comp Sci & Intelligent Syst Nishihara Okinawa 9030213 Japan Meio Univ Fac Int Studies Informat Syst Nago 9058585 Japan

This paper proposes a Petri net based mathematical programming approach to combinatorial optimization, in which we generate integer linear programming problems from Petri net models instead of the direct mathematical formulation. We treat two types of combinatorial optimization problems, ordinary problems and time-dependent problems. Firstly, we present autonomous Petri net modeling for ordinary optimization problems, where we obtain fundamental constraints derived from Petri net properties and additional problem-specific ones. Secondly, we propose a colored timed Petri net modeling approach to time-dependent problems, wherewe generate variables and constraints for time management and for resolving conflicts. Our Petri net approach can drastically reduce the difficulty of the mathematical formulation in a sense that (1) the Petri net modeling does not require deep knowledge of mathematical programming and technique of integer linear model formulations, (2) our automatic formulation allows us to generate large size of integer linear programming problems, and (3) the Petri net modeling approach is flexible for input parameter changes of the original problem.

关键词： mathematical programming integer linear programming Petri net colored timed Petri net autonomous Petri net

来源：评论

学校读者我要写书评

暂无评论

On solving the 1+1 routing, wavelength and network coding assignment problem with a bi-objective integer linear programming model

引用

TELECOMMUNICATION SYSTEMS 2019年第2期71卷 155-165页

作者： Dao Thanh Hai Hanoi Univ Ind Inst Technol Hanoi Vietnam

Network coding techniques have been viewed as the promising venue to improve the network efficiency and indeed, have been widely explored in the realm of failure recovery in optical networks. The combination of near-instantaneous recovery achieved by dedicated protections and capacity efficiency enabled by network coding brings about new opportunities to challenge the well-established trade-off of trading speed recovery for capacity efficiency and vice versa. In this context, the use of all-optical XOR network coding has reshaped the traditional 1+1 optical path protection in transparent WDM optical networks and established a new problem, called, 1+1 routing, wavelength and network coding assignment (1+1 RWNCA) as the extension of the conventional 1+1 routing and wavelength assignment (1+1 RWA). In this paper, we propose a bi-objective integer linear programming model of the 1+1 RWNCA problem aiming at minimizing the wavelength resources as the primary objective and simultaneously minimizing the wavelength link usage as the secondary objective. Our formulation uses a weighting method to combine two objectives into an integrated one and we provide insights on setting up the weight vectors to capture the priority of individual objectives. The effectiveness of our integrated objective model in comparison with reference designs based on the single-objective model, 1+1 RWA and 1+1 RWNCA, is numerically evaluated on different realistic topologies and traffic sets. Extensive simulation highlights that our proposal uses as efficient as around 60% of the required wavelength link resources of reference designs and simultaneously achieve the highest performance on the primary objective of minimizing the wavelength resources while its computation time is a few time longer than its single objective counterpart model.

关键词： Routing and wavelength assignment Dedicated path protection All-optical XOR network coding Transparent WDM networks integer linear programming Multi-objective pptimization

来源：评论

学校读者我要写书评

暂无评论

The Loading Optimization: A Novel integer linear programming Model

引用

ENTERPRISE INFORMATION SYSTEMS 2019年第10期13卷 1471-1482页

作者： Wang, Lei Ni, Mingfang Gao, Jie Shen, Qingguo Jia, Yongxing Yao, Changhua PLA Army Engn Univ Coll Commun Engn Nanjing Jiangsu Peoples R China JiLin Univ Zhuhai Coll Sch Disciplinary Bacs & Appl Stat Zhuhai Peoples R China

This paper establishes a new integer linear programming model for container loading problem. This model can be used to calculate the optimal loading plan for each container. To solve the model, in this paper, the model problem is decomposed into two easy to solve sub-problems: auxiliary problem (AP) and transportation problem, and prove by solving the two sub-problems can quickly and efficiently to find the optimal solution of the model. Finally, an example is given to illustrate the solution process, which shows that the algorithm can give the optimal stowage scheme quickly and effectively.

关键词： integer linear programming distribution optimisation transportation container

来源：评论

学校读者我要写书评

暂无评论

Detecting Fault Injection Attacks Based on Compressed Sensing and integer linear programming

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2019年第3期16卷 476-483页

作者： Li, Huiyun Shao, Cuiping Wang, Zheng Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen 518055 Peoples R China Univ Chinese Acad Sci Shenzhen Coll Adv Technol Shenzhen 518055 Peoples R China Chinese Univ Hongkong Shenzhen 518055 Peoples R China

Cryptographic ICs have been widely applied to numerous security-critical environments nowadays. Fault injection has become a serious attack on cryptographic IC, especially soft-errors or single event upsets (SEUs) by fine-resolution fault injection attacks. Detection and tamper evidence of these attacks become important. Traditional SEU diagnose methods usually require special sensors embedded into the circuits. However, these methods require non-trivial design and test effort, and usually just yield statistic results. In this paper, we formulate the detection fault injection attacks as a compressed sensing problem, due to sparsity of soft errors. Besides, due to the binary characteristic of the coefficient matrix and the variables, integer linear programming is adopted to reconstruct the soft error signals. Simulation results on a cryptographic IC demonstrate that the proposed method is capable to accurately detect the locations of soft-errors caused by fault injection attacks with negligible hardware overhead. The abnormal test output of scan-chains can be tamper evidence of the fault injection attacks.

关键词： Fault injection attacks compressed sensing integer linear programming soft-errors detection tamper evidence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：