The common use of several disciplines for the realization of practical purposes and their usual coworking favour such meetings involving different disciplines. Some old and recent successful examples ...of effective interferences between different disciplines are reported in order to evidence the potential fruitfulness of this process. The theme complexity and disorder are shown to be a central point of convergence between disciplines shown from the observation of past and future projects.
New generalized cyclotomic binary sequences of period p2 are proposed in this paper, where p is an odd prime. The sequences are almost balanced and their linear complexity is determined. The result ...shows that the proposed sequences have very large linear complexity if p is a non-Wieferich prime.
Monotone measures of statistical complexity Rudnicki, Łukasz; Toranzo, Irene V.; Sánchez-Moreno, Pablo ...
Physics letters. A,
01/2016, Volume:
380, Issue:
3
Journal Article
Peer reviewed
Open access
•The notion of monotonicity of the complexity measure of a probability distribution is introduced and discussed.•The monotonicity properties of statistical measures of complexity are studied.•The ...Cramer–Rao and Fisher–Shannon measures of complexity are shown to be monotone.
We introduce and discuss the notion of monotonicity for the complexity measures of general probability distributions, patterned after the resource theory of quantum entanglement. Then, we explore whether this property is satisfied by the three main intrinsic measures of complexity (Crámer–Rao, Fisher–Shannon, LMC) and some of their generalizations.
In this letter, we propose low-complexity linear equalizers for orthogonal time frequency space (OTFS) modulation that exploit the structure of the effective channel matrix in OTFS. The proposed ...approach exploits the block circulant nature of the OTFS channel matrix to achieve significant complexity reduction. For an N × M OTFS system, where N and M are the number of Doppler and delay bins, respectively, the proposed approach gives exact minimum mean square error (MMSE) and zero-forcing (ZF) solutions with just O(MN log MN) complexity, while MMSE and ZF solutions using the traditional matrix inversion approach require O(M 3 N 3 ) complexity. The proposed approach can provide low complexity initial solutions for local search techniques to achieve enhanced bit error performance.
Complexity management is an increasing challenge for industrial companies. To address this issue, this paper develops a procedure to reduce the complexity of products and processes. This procedure ...includes five steps: (1) definition of the scope of the products and processes to be included in the analysis, (2) grouping of products into A,B, and C categories, (3) identification and quantification of the most important complexity cost factors, (4) identification of initiatives for the possible reduction of complexity costs and the quantification of possible cost savings, and (5) evaluation and prioritisation of initiatives. To test the usefulness of the suggested procedure, it was applied at a globally leading manufacturer of mechanical consumer products. The case study demonstrated the usefulness of the proposed procedure in (1) supporting the allocation of complexity costs in relation to individual product variants, (2) achieving a better understanding of the cost structure of product assortment and business processes, and (3) providing a basis for generating and evaluating initiatives aimed at reducing the complexity of products and processes. The case study also showed that the use of the procedure can produce considerable financial benefits.
Assembly complexity assessment is a widely addressed topic in manufacturing. Several studies proved the correlation between assembly complexity and the occurrence of defects, thus justifying this ...increasing attention. A measure of complexity provides control over quality costs and performances. Over the years, many methods have been proposed to provide an objective measure of complexity. One of the most widely diffused is the so-called MCAT (i.e., “Manufacturing Complexity Assessment Tool”) modified by Samy and ElMaraghy H. for assessing product assembly complexity. Although this method highlights some interesting aspects, it presents some critical issues. This work aims to thoroughly analyse this method, focusing on its strengths and limitations.
DeepVCA: Deep Video Complexity Analyzer Amirpour, Hadi; Schoeffmann, Klaus; Ghanbari, Mohammad ...
IEEE transactions on circuits and systems for video technology,
03/2024
Journal Article
Peer reviewed
Open access
Video streaming and its applications are growing rapidly, making video optimization a primary target for content providers looking to enhance their services. Enhancing the quality of videos requires ...the adjustment of different encoding parameters such as bitrate, resolution, and frame rate. To avoid brute force approaches for predicting optimal encoding parameters, video complexity features are typically extracted and utilized. To predict optimal encoding parameters effectively, content providers traditionally use unsupervised feature extraction methods, such as ITU-T's Spatial Information ( SI ) and Temporal Information ( TI ) to represent the spatial and temporal complexity of video sequences. Recently, Video Complexity Analyzer (VCA) was introduced to extract DCT-based features to represent the complexity of a video sequence (or parts thereof). These unsupervised features, however, cannot accurately predict video encoding parameters. To address this issue, this paper introduces a novel supervised feature extraction method named DeepVCA, which extracts the spatial and temporal complexity of video sequences using deep neural networks. In this approach, the encoding bits required to encode each frame in intra-mode and inter-mode are used as labels for spatial and temporal complexity, respectively. Initially, we benchmark various deep neural network structures to predict spatial complexity. We then leverage the similarity of features used to predict the spatial complexity of the current frame and its previous frame to rapidly predict temporal complexity. This approach is particularly useful as the temporal complexity may depend not only on the differences between two consecutive frames but also on their spatial complexity. Our proposed approach demonstrates significant improvement over unsupervised methods, especially for temporal complexity. As an example application, we verify the effectiveness of these features in predicting the encoding bitrate and encoding time of video sequences, which are crucial tasks in video streaming. The source code and dataset is available at https://github.com/cd-athena/ DeepVCA.
PDF
