- Sort by:
- Newest first
- Titles A to Z
Filter by subject:
- Electrical and electronic engineering [4]
- General topics, engineering mathematics and materials science [4]
- Engineering mathematics and mathematical techniques [4]
- Algebra [4]
- Computer and control engineering [4]
- Systems and control theory [4]
- Mathematical techniques [4]
- Algebra [4]
- Mechanical and production engineering [4]
- General topics in manufacturing and production engineering [4]
- [4]
- http://iet.metastore.ingenta.com/content/subject/e0210,http://iet.metastore.ingenta.com/content/subject/e0210a,http://iet.metastore.ingenta.com/content/subject/a,http://iet.metastore.ingenta.com/content/subject/a0000,http://iet.metastore.ingenta.com/content/subject/a0200,http://iet.metastore.ingenta.com/content/subject/a0210,http://iet.metastore.ingenta.com/content/subject/b0250,http://iet.metastore.ingenta.com/content/subject/b0260,http://iet.metastore.ingenta.com/content/subject/c1160,http://iet.metastore.ingenta.com/content/subject/c1180,http://iet.metastore.ingenta.com/content/subject/e0210e,http://iet.metastore.ingenta.com/content/subject/e0210g,http://iet.metastore.ingenta.com/content/subject/c4000,http://iet.metastore.ingenta.com/content/subject/c4200,http://iet.metastore.ingenta.com/content/subject/c4240,http://iet.metastore.ingenta.com/content/subject/c4240c
- e0210,e0210a,a,a0000,a0200,a0210,b0250,b0260,c1160,c1180,e0210e,e0210g,c4000,c4200,c4240,c4240c
- [4],[4],[3],[3],[3],[3],[2],[2],[2],[2],[2],[2],[1],[1],[1],[1]
- /search/morefacet;jsessionid=dtp3a68h5alt0.x-iet-live-01
- /content/searchconcept;jsessionid=dtp3a68h5alt0.x-iet-live-01?operator4=AND&operator5=AND&operator6=AND&pageSize=50&sortDescending=true&value5=2015&value6=ConferencePaper&facetNames=pub_concept_facet+pub_concept_facet+pub_concept_facet+pub_year_facet+contentType_facet+pub_concept_facet&value3=e0200&value4=b0000&option6=contentType_facet&value1=e0210a&option5=pub_year_facet&value2=c1000&facetOptions=2+3+4+5+6+7&option1=pub_concept&option2=pub_concept_facet&option3=pub_concept_facet&option4=pub_concept_facet&sortField=prism_publicationDate&operator3=AND&operator2=AND&operator7=AND&option7=pub_concept_facet&value7=
- See more See less
Filter by content type:
- ConferencePaper [4]
Filter by publication date:
- 2015 [4]
Filter by author:
This paper describes an efficient implementation of a form of linear semi-infinite programming (LSIP). We look at maximizing (minimizing) a linear function over a set of constraints formed by positive trigonometric polynomials. Previous studies about LSIP are formulated using semi-definite programming (SDP), this is typically done by using the Kalman Yakubovich Popov (KYP) lemma or using a trace operation involving a Grammian matrix, which can be computationally expensive. The proposed algorithm is based on simplex method that directly solves the LSIP without any parameterization. Numerical results show that the proposed LISP algorithm is significantly more efficient than existing SDP solvers using KYP lemma and Grammian matrix, in both execution time and memory.
Given a graph G = (V, E) with a set W ⊆ V of vertices, we enumerate colorings to W such that for every two enumerated colorings c and c' the corresponding colored graphs (G, c) and (G, c') are not isomorphic. This problem has an important application in the study of isomers of chemical graphs such as generation of benzen isomers from a tree-like chemical graph structure. The number of such colorings can be computed efficiently based on Polya's theorem. However, enumerating each from the set of these colorings without using a large space is a challenging problem in general. In this paper, we propose a method for enumerating these colorings when the automorphisms of G are determined by two axial symmetries, and show that our algorithm can be implemented to run in polynomial delay and polynomial space.
Word search is a classical puzzle to search for all given words on a given assignment of letters to a rectangular grid (matrix). This problem is clearly in P. The inverse of this problem is more difficult, which asks to assign letters in a given alphabet to a matrix of given size so that every word in a given wordset can be found horizontally, vertically, or diagonally. This problem is in NP; it admits a trivial polynomial-size certificate. We prove its NP-hardness. It turns out to be so even under the following restrictions: 1) the alphabet size is 2 (binary) and 2) all the words to be found are of length at most 2. These results are optimal in the sense that decreasing these bounds 2 to 1 makes the problem be trivially in P.
Polynomial parahermitian matrices can accurately and elegantly capture the space-time covariance in broadband array problems. To factorise such matrices, a number of polynomial EVD (PEVD) algorithms have been suggested. At every step, these algorithms move various amounts of off-diagonal energy onto the diagonal, to eventually reach an approximate diagonalisation. In practical experiments, we have found that the relative performance of these algorithms depends quite significantly on the type of parahermitian matrix that is to be factorised. This paper aims to explore this performance space, and to provide some insight into the characteristics of PEVD algorithms.
