Opacity is a security and privacy property that evaluates whether an external observer (intruder) can infer a secret of a system by observing its behavior. This paper proposes an on-line approach to address the proble...
详细信息
Opacity is a security and privacy property that evaluates whether an external observer (intruder) can infer a secret of a system by observing its behavior. This paper proposes an on-line approach to address the problem of current-state opacity in discrete event systems (DESs) modeled in a labeled Petri Net (PN) framework and by observing its evolution. An observation of the system is said to be current-state opaque if the intruder is unable to determine whether the current state of the system is within a set of secret states, otherwise it is said to be not current-state opaque. The proposed approach to verify the current-state opacity works on-line: the verification algorithm waits for the occurrence of an observable event and uses integer linear programming problem solutions to verify if the behavior of the system is current-state opaque to the intruder under the given observation. Moreover, the proposed method is applied in two different settings: (i) a centralized approach where the intruder has full knowledge of the system model but can partially observe the system behavior;(ii) a decentralized approach where a set of intruders can observe different event sets and collaborate with a coordinator to disclose the same secret. Finally, experimental results are presented to demonstrate the efficiency of the proposed method. (C) 2018 Elsevier Ltd. All rights reserved.
This letter presents a simple optimal placement algorithm of phasor measurement units (PMU) by using integer linear programming. Cases with and without conventional power flow and injection measurements are considered...
详细信息
This letter presents a simple optimal placement algorithm of phasor measurement units (PMU) by using integer linear programming. Cases with and without conventional power flow and injection measurements are considered. The measurement placement problems under those cases are formulated as an integer linear programming which saves the CPU computation time greatly. Simulation results show that the proposed algorithm can be used in practice.
An interleaved-Dyck (InterDyck) language consists of the interleaving of two or more Dyck languages, where each Dyck language represents a set of strings of balanced parentheses. InterDyck-reachability is a fundamenta...
详细信息
An interleaved-Dyck (InterDyck) language consists of the interleaving of two or more Dyck languages, where each Dyck language represents a set of strings of balanced parentheses. InterDyck-reachability is a fundamental framework for program analyzers that simultaneously track multiple properly-matched pairs of actions such as call/return, lock/unlock, or write-data/read-data. Existing InterDyck-reachability algorithms are based on the well-known tabulation technique. This paper presents a new perspective on solving InterDyck-reachability. Our key observation is that for the single-source-single-target InterDyck-reachability variant, it is feasible to summarize all paths from the source node to the target node based on path expressions. Therefore, InterDyck-reachability becomes an InterDyck-path-recognition problem over path expressions. Instead of computing summary edges as in traditional tabulation algorithms, this new perspective enables us to express InterDyck-reachability as a parenthesis-counting problem, which can be naturally formulated via integer linear programming (ILP). We implemented our ILP-based algorithm and performed extensive evaluations based on two client analyses (a reachability analysis for concurrent programs and a taint analysis). In particular, we evaluated our algorithm against two types of algorithms: (1) the general all-pairs InterDyck-reachability algorithms based on linear conjunctive language (LCL) reachability and synchronized pushdown system (SPDS) reachability, and (2) two domain-specific algorithms for both client analyses. The experimental results are encouraging. Our algorithm achieves 1.42x, 28.24x, and 11.76x speedup for the concurrency-analysis benchmarks compared to all-pair LCL-reachability, SPDS-reachability, and domain-specific tools, respectively;1.2x, 69.9x, and 0.98x speedup for the taint-analysis benchmarks. Moreover, the algorithm also provides precision improvements, particularly for taint analysis, where it achieves
Automatic text summarization (ATS) plays a vital role in condensing original text documents while preserving the most crucial information. Its benefits extend to various domains, including e-Learning systems, where ed...
详细信息
Automatic text summarization (ATS) plays a vital role in condensing original text documents while preserving the most crucial information. Its benefits extend to various domains, including e-Learning systems, where educational content can be summarized to facilitate easier access and comprehension. Multi-document summarization (MDS) techniques enable the creation of concise summaries from groups of related text documents. Leveraging MDS for summarizing learning materials opens new avenues, offering students and teachers reference summaries for enhanced learning experiences. This paper introduces a concept-based integer linear programming model for summarizing learning materials, leveraging a phrase embedding technique. Phrases are treated as fundamental and significant semantic building blocks of sentences, facilitating the comprehension and summarization of documents. Embedding techniques are employed to semantically identify related phrases, eliminate redundancy, and enhance coherence through vector representations. Summaries are generated using the ILP technique, selecting key sentences and reducing redundancy with phrase vectors. The paper proposes sentence reordering techniques based on phrases and sentences to further enhance coherence. The resulting summaries are automatically evaluated using ROUGE metrics, demonstrating the superior performance of the proposed approach compared to various benchmark and baseline methods on both the DUC 2004 benchmark dataset and the newly created educational dataset, EduSumm.
In this paper, an optimum optical power monitor placement is formulated in integer linear programming for crosstalk attack detection by exploiting monitoring information from test connections. The experimental results...
详细信息
In this paper, an optimum optical power monitor placement is formulated in integer linear programming for crosstalk attack detection by exploiting monitoring information from test connections. The experimental results showed that equipping 6 out of 14, 8 out of 15 and 8 out of 16 nodes with optical power monitoring devices in NSF, MESH and GRID topologies are enough to detect the nodes that are traversed by the crosstalk attack in the networks. (C) 2014 Elsevier GmbH. All rights reserved.
Project portfolio selection involves decision making and it plays a crucial role in any organization. Therefore selecting not just the right projects but also the right mix of projects for the portfolio is considered ...
详细信息
Project portfolio selection involves decision making and it plays a crucial role in any organization. Therefore selecting not just the right projects but also the right mix of projects for the portfolio is considered as one of the most important tasks for organisations to ensure the achievement of the corporate strategy within limited resources and capabilities of the organization. Prioritizing and selecting optimal project portfolio can be very challenging especially with a large number of projects with multiple constraints and interdependences. In an ideal world with unlimited budget the project selection process would be very straightforward. However, this is not the case in life situations. In this work, an attempt is made to address this challenge. An integer linear programming model for project selection was developed and applied in a selected organization in Nigeria. The model seeks to optimize the mix of the projects to be undertaken while keeping the total cost and project interdependency as constraints. The analysis of the results showed that a total of 11 projects out of 16 were eligible for selection in the period under review. The total cost of the selected project was 92,840,000 Naira, which was about 90% of the total budget. Ordinarily, apart from not prioritizing and obtaining an optimal project mix, the community would have spread its entire resources on the 16 projects with some of them being abandoned later. The model can also be used to plan an optimal mix of project portfolio for a future date within the limitations of a given set of constraints and interdependence.
We introduce a new integer linear programming (ILP) approach for solving integerprogramming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the ...
详细信息
We introduce a new integer linear programming (ILP) approach for solving integerprogramming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear P. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems. (C) 2011 Elsevier B.V. All rights reserved.
This paper addresses the problem of decentralized on-line fault diagnosis in the Petri net framework by using integer linear programming. The decentralized architecture consists of a set of local sites communicating w...
详细信息
Several methods that have been developed to obtain energy, which is indispensable for life and whose necessity has increased geometrically in the course of time, are no longer sustainable. Therefore, human being has h...
详细信息
Several methods that have been developed to obtain energy, which is indispensable for life and whose necessity has increased geometrically in the course of time, are no longer sustainable. Therefore, human being has headed towards sustainable alternative energy sources. Wind has been one of the most interested renewable energy sources for human as of the beginning of the 20th century. This study focuses on one of the most important work items at the establishment phase of this important energy source, power plant site selection. Within the scope of linearprogramming perspective, two models were presented based on mixed integer linear programming. The first model provides employment of single-type wind turbine on the selected site, whereas the second model, which was developed within the current study, aims additional increase in total power output by allowing employment of multiple-type wind turbine on the selected site. The same region showed up as the most appropriate site to establish wind power plant as a result of both models of the study.
Quaternary-code (QC) designs, an attractive class of nonregular fractional factorial designs, have received much attention due to their theoretical elegance and practical applicability. Some recent works of QC designs...
详细信息
Quaternary-code (QC) designs, an attractive class of nonregular fractional factorial designs, have received much attention due to their theoretical elegance and practical applicability. Some recent works of QC designs revealed their good properties over their regular counterparts under commonly used criteria. We develop an optimization tool that can maximize the generalized resolution of a QC design of a given size. The problem can be recast as an integer linear programming (ILP) problem through a linear simplification that combines the k-and a-equations, even though the generalized resolution does not linearly depend on the aliasing indexes. The ILP surprisingly improves a class of (1/16)th-fraction QC designs with higher generalized resolutions. It also applies to obtain some (1/64) th-fraction QC designs with maximum generalized resolutions, and these QC designs generally have higher generalized resolutions than the regular designs of the same size.
暂无评论