Search

We consider the problem of communicating over a channel that randomly “tears” the message block into small pieces of different sizes and shuffles them. For the binary torn-paper channel with block length $n$ and pieces of length ${\mathrm{ Geometric}}(p_{n})$ , we characterize the capacity as $C = e^{-\alpha }$ , where $\alpha = \lim _{n\to \infty } p_{n} \log n$. Our results show that the case of ${\mathrm{ Geometric}}(p_{n})$ -length fragments and the case of deterministic length- $(1/p_{n})$ fragments are qualitatively different and, surprisingly, the capacity of the former is larger. Intuitively, this is due to the fact that, in the random fragments case, large fragments are sometimes observed, which boosts the capacity. [ABSTRACT FROM AUTHOR]

Non-English languages are widely used, but their roles in scholarly communication are relatively under-explored. By using Web of Science's Science Citation Index Expanded ( SCIE, 1900-2015), Social Sciences Citation Index ( SSCI, 1900-2015), and Arts and Humanities Citation Index ( A&HCI, 1975-2015), this study probes the patterns and dynamics of non-English papers by year, citation index, and discipline using bibliometric analysis. The analyses show that English is increasingly being used as the dominating language from natural sciences and social sciences to arts and humanities. Around 97% of the papers in SCIE, 95% of the papers in SSCI, and 73% of the papers in A&HCI during the past decade were in English. However, other languages such as German and French were also used as important academic languages in sciences and social sciences during the first half of the 20th century, 1970s, and 1980s. Unlike natural science and social science disciplines, non-English papers have consistently played important role in arts and humanities disciplines from the beginning of 1975. Although the shares of non-English papers in SCIE and SSCI databases have been limited during the past decade, a large number of non-English papers can be found in some applied disciplines of sciences and social sciences. [ABSTRACT FROM AUTHOR]

The Randić index (R) and the geometric-arithmetic index (GA) are found to be useful tools in QSPR and QSAR studies. In the Journal of Inequalities and Applications 180, 1-7, Lokesha, Shwetha Shetty, Ranjini, Cangul, and Cevik gave "New bounds for Randić and GA indices." In the paper, we first point out that Theorems 1, 2, and 4 are incorrect and in this short note we present the correct inequalities for Randić and GA indices. In the same paper, we provide the equality cases for Theorems 3, 5, and 6. [ABSTRACT FROM AUTHOR]

As a meta-heuristic algorithm, the Golden Jackal Optimization (GJO) algorithm has been widely used in traditional network intrusion detection due to its ease of use and high efficiency. This paper aims to extend its application to the emerging field of Software-Defined Networking (SDN), which is a new network architecture. To adapt the GJO for SDN intrusion detection, a modified Golden Jackal Optimization (mGJO) is proposed to enhance its performance with the use of two strategies. First, an Elite Dynamic Opposite Learning strategy operates during each iteration to find solutions opposite to the current global optimal solutions, which increases population diversity. Second, an updating strategy based on the Golden Sine II Algorithm is utilized in the exploitation phase to update the position information of the golden jackal pairs, which accelerates the search for the best feature subset indexes. To validate the feasibility of the mGJO algorithm, this paper first assesses its optimization capability using benchmark test functions. Then, four UCI datasets and the NSL-KDD dataset are used to test the classification capability of the mGJO algorithm and its application in traditional network intrusion detection. Furthermore, the InSDN dataset is used to validate the feasibility of the mGJO algorithm for SDN intrusion detection. The experimental results show that, when the mGJO algorithm is applied to SDN for intrusion detection, the various indexes of classification and the selection of feature subsets achieve better results. [ABSTRACT FROM AUTHOR]

An $(r, \delta)$ -locally repairable code ($(r, \delta)$ -LRC for short) was introduced by Prakash et al. for tolerating multiple failed nodes in distributed storage systems, which was a generalization of the concept of $r$ -LRCs produced by Gopalan et al.. An $(r, \delta)$ -LRC is said to be optimal if it achieves the Singleton-like bound. Recently, Chen et al. generalized the construction of cyclic $r$ -LRCs proposed by Tamo et al. , and constructed several classes of optimal $(r, \delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively in terms of a union of the set of zeros controlling the minimum distance and the set of zeros ensuring the locality. Following the work of , , this paper first characterizes $(r, \delta)$ -locality of a cyclic code via its zeros. Then we construct several classes of optimal cyclic $(r, \delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively from the product of two sets of zeros. Our constructions include all optimal cyclic $(r,\delta)$ -LRCs proposed in , , and our method seems more convenient to obtain optimal cyclic $(r, \delta)$ -LRCs with flexible parameters. Moreover, many optimal cyclic $(r,\delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively with $(r+\delta -1)\nmid n$ can be obtained from our method. [ABSTRACT FROM AUTHOR]

The work reported in this paper aims at developing an algorithm for system operators to solve a robust security-constrained AC optimal power flow (R-SC-ACOPF) problem, which also optimizes the settings of discrete controllers including load tap changers (LTCs) and shunt capacitor banks (SCBs). An iterative algorithm involving a master problem and a number of sub-problems is proposed. The master problem selects the optimal discrete controllers’ settings by taking into account primal SC-ACOPF constraints based on the single-component worst contingencies identified by the sub-problems. Each sub-problem is a bi-level max-min problem used to find the current worst contingency. The overall objective is to minimize the total cost, including generation and load shedding cost, while satisfying all relevant constraints. The master problem and sub-problems allow representing LTC tap positions, SCB status, and contingencies using binary variables. Two case studies are presented as applications of this novel technique. [ABSTRACT FROM AUTHOR]

Linear codes achieving or nearly achieving the Singleton bound are interesting in both theory and practice. The objective of this paper is to construct several infinite families of MDS, near MDS and almost MDS codes from some special cyclic subgroups of ${\mathbb {F}}_{q^{2}}^{*}$. To this end, the augmentation and extension techniques are used. The codes in this paper have flexible parameters and their lengths could be large. The minimum linear locality of the codes constructed in this paper is also studied. Some infinite families of optimal linearly locally recoverable codes are obtained. Besides, some codes in this paper are proved to be proper for error detection. [ABSTRACT FROM AUTHOR]

The number-theoretic code is a class of codes defined by single or multiple congruences. These codes are mainly used for correcting insertion and deletion errors, and for correcting asymmetric errors. This paper presents a formula for a generalization of the complete weight enumerator for the number-theoretic codes. This formula allows us to derive the weight enumerators and cardinalities for the number-theoretic codes. As a special case, this paper provides the Hamming weight enumerators and cardinalities of the non-binary Tenengolts’ codes, correcting single insertion or deletion. Moreover, we show that the formula deduces the MacWilliams identity for the linear codes over the ring of integers modulo $r$. [ABSTRACT FROM AUTHOR]

Some of the deadliest wildfires in the U.S., such as California’s 2018 wildfires, have been ignited by power systems. In an effort to prevent and minimize the ignition of wildfires, or control them if ignited, energy companies have developed wildfire mitigation plans. This paper provides energy companies and power system operators, engineers, researchers, and suppliers an overview of the state-of-the-art studies that address key topics in these wildfire mitigation plans and compares the wildfire mitigation plans of several energy companies. The key topics include grid design and system hardening, asset management and inspection, situational awareness and forecasting, operational response, vegetation management, public safety power shutoff, and risk-spend efficiency. This paper also presents a comparison of several energy companies’ decision-making criteria for initiating a public safety power shutoff. Finally, we discuss opportunities for future research studies that could help energy companies prevent wildfire ignitions. [ABSTRACT FROM AUTHOR]

This paper proposes using the uncertainty of information (UoI), measured by Shannon’s entropy, as a metric for information freshness. We consider a system in which a central monitor observes M binary Markov processes through m communication channels (m

Cycle time, which is of order of ten weeks for most products in semiconductor wafer fabrication facilities (wafer fabs), must be explicitly considered in production planning models. Cycle times depend nonlinearly on the resource workload in a wafer fab. Different data-driven (DD) production planning formulations are studied in this paper. Such formulations are based on a set of system states representing the congestion behavior of a wafer fab with work in process (WIP) and resulting output levels. Different WIP-output relations in the DD formulations are investigated. In addition, different methods are proposed to gather representative sets of system states. The DD formulations are compared with the Allocated Clearing Function (ACF) formulation with respect to profit and cost values using simulation models of a scaled-down and a large-sized multi-product wafer fab, respectively. The simulation results show that some DD variants are able to outperform the ACF formulation under several experimental conditions. [ABSTRACT FROM AUTHOR]

This paper proposes a Principal Component Analysis (PCA)-based method to construct composite indices to rapidly assess power system transient stability. By assigning appropriate weights to a few selected sub-indicators, a composite index can be constructed to guarantee a better coverage of worst-case stability scenarios of the power system. This paper provides an automatic method to construct a composite index with four sub-indicators calculated by the integral of acceleration, speed deviation and rotor angle of generators over a certain integration period using PCA. The effectiveness of the sub-indicators is validated first, followed by a comprehensive example of process of composite index construction, and the assessment of the influence of the effect of integration period on the performance of the composite index. High accuracy of classification has been demonstrated using composite index with appropriate settings of the integration periods of the sub-indicators. [ABSTRACT FROM AUTHOR]

Recently, subfield codes of geometric codes over large finite fields ${\mathrm {GF}}(q)$ with dimension 3 and 4 were studied and distance-optimal subfield codes over ${\mathrm {GF}}(p)$ were obtained, where $q=p^{m}$. The key idea for obtaining very good subfield codes over small fields is to choose very good linear codes over an extension field with small dimension. This paper first presents a general construction of $[q+1, 2, q]$ MDS codes over ${\mathrm {GF}}(q)$ , and then studies the subfield codes over ${\mathrm {GF}}(p)$ of some of the $[q+1, 2,q]$ MDS codes over ${\mathrm {GF}}(q)$. Two families of dimension-optimal codes over ${\mathrm {GF}}(p)$ are obtained, and several families of nearly optimal codes over ${\mathrm {GF}}(p)$ are produced. Several open problems are also proposed in this paper. [ABSTRACT FROM AUTHOR]

Linear codes with few weights have applications in consumer electronics, communications, data storage systems, secret sharing, authentication codes, and association schemes. As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure computation of data between two parties. The construction of minimal linear codes with new and desirable parameters is an interesting research topic in coding theory and cryptography. Recently, Mesnager et.al. stated that “constructing linear codes with good parameters from non-weakly regular bent functions is an interesting problem.” The goal of this paper is to construct linear codes with two or three weights from non-weakly regular bent functions over finite fields and analyze the minimality of the constructed linear codes. In doing so, we draw inspiration from a paper by Mesnager in which she constructed linear codes with small weights from weakly regular bent functions based on a generic construction method. First, we recall the definitions of the subsets $B_{+}(f)$ and $B_{-}(f)$ associated with a non-weakly regular bent function $f$. Next, we construct two- or three-weight linear $p$ -ary codes on these sets using duals of the non-weakly regular bent functions that are also bent. We note that the constructed linear codes are minimal in almost all cases. Moreover, when $f$ is a non-weakly regular bent function in a certain subclass of Generalized Maiorana-McFarland bent functions, we determine the weight distributions of the corresponding linear codes. As far as we know, the construction of linear codes from non-weakly regular bent functions over finite fields is first studied in the literature by the second author in his dissertation. [ABSTRACT FROM AUTHOR]

This paper concerns the fundamental problem of processing conjunctive queries that contain both keyword and range conditions on public clouds in a privacy preserving manner. No prior Searchable Symmetric Encryption (SSE) based privacy preserving conjunctive query processing scheme satisfies the three requirements of adaptive security, efficient query processing, and scalable index size. In this paper, we propose the first privacy preserving conjunctive query processing scheme that satisfies all the above three requirements. To achieve adaptive security, we propose an Indistinguishable Bloom Filter (IBF) data structure for indexing. To achieve efficient query processing and structural indistinguishability, we propose a highly balanced binary tree data structure called Indistinguishable Binary Tree (IBtree). To achieve scalable and compact index size, we propose an IBtree space compression algorithm to remove redundant information in IBFs. To optimize search efficiency, we propose a traversal minimization algorithm. To make our scheme dynamic, we propose update algorithms. We prove that our scheme is adaptive secure under the IND-CKA secure model. The key contribution of this paper is on achieving conjunctive query processing with both strong privacy guarantee and practical efficiency in terms of both speed and space. We implemented our scheme in C++, evaluated and compared its performance with the prior KRB scheme for keyword queries and the prior PBtree scheme for range queries on two real-world data sets. Experimental results show that our scheme is both fast and scalable. For example, processing a query only takes a few milliseconds for millions of records. [ABSTRACT FROM AUTHOR]

Caching is an efficient way to reduce network traffic congestion during peak hours by storing some content at the users’ local caches. For the shared-link network with end-user-caches, Maddah-Ali and Niesen proposed a two-phase coded caching strategy. In practice, users may communicate with the server through intermediate relays. This paper studies the tradeoff between the memory size ${\mathsf M}$ and the network load ${\mathsf R}$ for the networks where a server with ${\mathsf N}$ files is connected to ${\mathsf H}$ relays (without caches), which in turn are connected to ${\mathsf K}$ users equipped with caches of ${\mathsf M}$ files. When each user is connected to a different subset of ${\mathsf r}$ relays, i.e., ${\mathsf K}= \binom {\mathsf H}{\mathsf r}$ , the system is referred to as a combination network with end-user-caches. In this work, converse bounds are derived for the practically motivated case of uncoded cache contents, that is, bits of the various files are directly pushed into the user caches without any coding. In this case, once the cache contents and the users’ demands are known, the problem reduces to a general index coding problem. This paper shows that relying on a well-known “acyclic index coding converse bound” results in converse bounds that are not tight for combination networks with end-user-caches. A novel converse bound that leverages the network topology is proposed, which is the tightest converse bound known to date. As a result of independent interest, an inequality that generalizes the well-known sub-modularity of entropy is derived. Several novel caching schemes are proposed, based on the Maddah-Ali and Niesen cache placement. These schemes leverage the structure of the combination network or/and perform interference elimination at the end-users. The proposed schemes are proved: (i) to be (order) optimal for some $({\mathsf N}, {\mathsf M}, {\mathsf H}, {\mathsf r})$ parameters regimes under the constraint of uncoded cache placement, and (ii) to outperform the state-of-the-art schemes in numerical evaluations. [ABSTRACT FROM AUTHOR]

This paper presents improved indices to evaluate the contribution of reactive power compensators at HVdc converter terminals. The presence of such compensators impacts converter performance, such as the maximum available power (MAP) limit, susceptance to commutation failure, fault recovery time and temporary over voltage. Traditionally, the Effective Short Circuit Ratio (ESCR) has been used to indicate system strength. However, this index cannot be directly applied when power-electronics based converters are used to provide the reactive power support. The approach of this paper is to use an improved form of the ‘Apparent increase in Short Circuit Ratio’ (AISCR) index to quantify the impact of the compensator on the HVdc system. This index is evaluated by comparing the performance with the reactive power device with a system without the device, but having the same performance. The paper shows that a single AISCR index cannot quantify all behaviors and suggest modifications to AISCR for each of several HVdc phenomena. In this paper two types of compensators are considered – the Synchronous Compensator and the Static Synchronous Compensator (STATCOM). [ABSTRACT FROM AUTHOR]

This index covers all technical items - papers, correspondence, reviews, etc. - that appeared in this periodical during the year, and items from previous years that were commented upon or corrected in this year. Departments and other items may also be covered if they have been judged to have archival value. The Author Index contains the primary entry for each item, listed under the first author's name. The primary entry includes the co-authors' names, the title of the paper or other item, and its location, specified by the publication abbreviation, year, month, and inclusive pagination. The Subject Index contains entries describing the item under all appropriate subject headings, plus the first author's name, the publication abbreviation, month, and year, and inclusive pages. Note that the item title is found only under the primary entry in the Author Index. [ABSTRACT FROM AUTHOR]

This paper studies the minimum-age scheduling problem in a wireless sensor network where an access point (AP) monitors the state of an object via a set of sensors. The freshness of the sensed state, measured by the age-of-information (AoI), varies at different sensors and is not directly observable to the AP. The AP has to decide which sensor to query/sample in order to get the most updated state information of the object (i.e., the state information with the minimum AoI). In this paper, we formulate the minimum-age scheduling problem as a multi-armed bandit problem with partially observable arms and explore the greedy policy to minimize the expected AoI sampled over an infinite horizon. To analyze the performance of the greedy policy, we 1) put forth a relaxed greedy policy that decouples the sampling processes of the arms, 2) formulate the sampling process of each arm as a partially observable Markov decision process (POMDP), and 3) derive the average sampled AoI under the relaxed greedy policy as a sum of the average AoI sampled from individual arms. Numerical and simulation results validate that the relaxed greedy policy is an excellent approximation to the greedy policy in terms of the expected AoI sampled over an infinite horizon. [ABSTRACT FROM AUTHOR]

Signed quadrature spatial modulation (SQSM) was recently introduced to enhance the throughput of spatial modulation (SM) in multiple-input multiple-output (MIMO) systems. This strategy involves independently transmitting the real and imaginary components of a symbol and its inverse from four independent antennas. In this paper, an extended SQSM (ESQSM) system is proposed. It combines $K$ SQSM constellations and transmits them from the same transmit-antenna set with the aim of realizing a $K$ -fold improvement in the spectral efficiency (SE). The proposed ESQSM employs the average power of the $K$ SQSM constellations as an additional dimension for transmission. Performance of the proposed ESQSM surpasses that of other state-of-art SM systems such as the QSM, DSM, IQSM SQSM, and EQSM by 13 dB, 11 dB, 10.55 dB, 10 dB, and 6.8 dB, respectively. In this paper, we also propose an efficient ESQSM with a multi-user (ESQSM-MU) system inspired by the ESQSM ability in increasing the SE. The proposed ESQSM-MU system offers a significant bit error rate (BER) improvement and a higher capacity (i.e., $5K$ -users) compared to the current non orthogonal multiple access-SM (NOMA-SM) and SM-assisted multi-antenna NOMA (SM-AMA-NOMA) systems. Moreover, an efficient low-complexity detector is introduced for the ESQSM signal detection, promising a 91.2% reduction in the computational complexity of ESQSM and ESQSM-MU systems relative to the maximum likelihood (ML) with a trivial loss in performance. [ABSTRACT FROM AUTHOR]

The annihilating-ideal graph of a commutative ring R with unity is deffned as the graph AG(R) whose vertex set is the set of all non-zero ideals with non-zero annihilators and two distinct vertices I and J are adjacent if and only if IJ = 0. Nikan-dish et.al. proved that AG(Zn) is weakly perfect. In this short paper, we characterize n for which AG(Zn) is perfect. [ABSTRACT FROM AUTHOR]

The Randić index R(G) of a graph G is the sum of the weights (dudv)1/2 of all edges uv in G, where du denotes the degree of vertex u. Du and Zhou [On Randić indices of trees, unicyclic graphs, and bicyclic graphs, Int. J. Quantum Chem. 111 (2011), 2760-2770] determined the n-vertex unicyclic graphs with the third maximum for n ≥ 5, the fourth maximum for n ≥ 7 and the fifth maximum for n ≥ 8. Recently, Li et al. [The Randić indices of trees, unicyclic graphs and bicyclic graphs, Ars Comb. 127 (2016), 409-419] obtained the n-vertex unicyclic graphs with the sixth maximum and the seventh maximum for n ≥ 9 and the eighth maximum for n ≥ 10. In this paper, we characterize the n-vertex unicyclic graphs with the ninth maximum, the tenth maximum, the eleventh maximum, the twelfth maximum and the thirteenth maximum of Randić values. [ABSTRACT FROM AUTHOR]

Let G be a fuzzy graph of order n, where(u) is the vertex membership, (u; v) is membership value of an edge and (u) is the strength of vertex. The first fuzzy Zagreb index is the sum -(ui)-(ui) + -(uj)-(uj) where uiuj 2 - and the corresponding fuzzy Zagreb matrix is the square matrix of order n whose (i; j)th entry whenever i 6= j, is -(ui)-(ui)+-(uj)-(uj) and zero otherwise. In this paper, we introduce the Zagreb Estrada index of fuzzy graphs and establish some bounds for it. [ABSTRACT FROM AUTHOR]

Let G be a graph with vertex set V (G) and edge set E(G). The two Zagreb indices M1 =P v2V (G) d² G(v) and M2 = Puv2E(G) dG(u)dG(v) are vertex degree based graph invariants that have been introduced in the 1970s and extensively studied ever since. In this paper, we first give a lower bound on the first Zagreb index of trees with given Roman domination number and we characterize all extremal trees. Then we present upper bound for Zagreb indices of unicyclic and bicyclic graphs with given Roman domination number. [ABSTRACT FROM AUTHOR]

This study aimed to analyze the scholarly productivity of the University of Engineering and Technology (UET), Lahore, over 50 years, from 1973 to 2022. Data indexed in the Web of Science (WoS) database was used and included information such as document type, year-wise research output, leading authors, significant collaborative organizations, primary international author collaborations, key corresponding author affiliations by country, major funding agencies, and highly cited publications. For bibliometric visualization, the BiblioShiny and VOSviewer software tools were employed. A comprehensive analysis of 5502 publications across diverse categories, such as research articles, conference papers, abstracts, reviews, editorials and others, was conducted. The UET research productivity displayed a positive trend, with 2022 emerging as the most productive year. Research articles constituted the predominant publication type, showcasing their popularity. Collaboration emerged as a preferred approach among researchers, evidenced by the prevalence of co-authored publications. The majority of the corresponding coauthors were affiliated with Pakistani institutions. The University of the Punjab (PU), Pakistan, was a prominent collaborative partner among all institutes. China was identified as the primary international collaborator for the researchers. Furthermore, the Higher Education Commission (HEC) of Pakistan was seen to be the primary funding agency for researchers at UET. The research domain of "engineering" claimed the most productivity, and "performance" was the most frequently used keyword. This study helps understand UET's research performance in the domains of engineering, science and technology. [ABSTRACT FROM AUTHOR]

In this paper, a joint decision tree and visual feature optimization rate control scheme for ultrahigh-definition (UHD) versatile video coding (VVC) is proposed. First, we design a new rate-distortion (R-D) model for UHD videos, and we establish a decision-tree-based multiclass classification scheme to improve the prediction accuracy of the R-D model by fully considering visual features. Second, based on the proposed R-D model, the globally optimal solution is obtained through convex optimization. Finally, we embed our algorithm into the latest VVC reference software, VTM 10.2. According to our experimental results, compared with the latest algorithm in VTM 10.2 and other state-of-the-art algorithms, our method can achieve significant bit rate reductions while maintaining a given peak signal-to-noise ratio (PSNR) or structural similarity index measure (SSIM). [ABSTRACT FROM AUTHOR]

Spatial co-location pattern mining (SCPM) aims to discover subsets of spatial features frequently located together in proximate areas. Previous studies of SCPM solely concern the inter-features association of a pattern, but neglect the interesting intra-feature behavior. In this paper, we propose the task of spatial co-location pattern mining with coupling relation consideration (SCPM-CR) to capture complex relations embedded in a co-location. Specifically, InterPCI measure is designed to capture the inter-features coupling by considering the comprehensive interaction of objects for the features in a pattern, and luckily it possesses the anti-monotone property. Another measure, IntraCAI, is proposed to capture the congregating behavior of intra-feature objects under the restriction of a co-location. A general framework is designed for SCPM-CR task and experiments show that a large fraction of computation time is devoted to identifying the participating objects of a candidate pattern. To tackle this calculation bottleneck, a novel candidate-and-search algorithm is suggested, CS-HBS, equipped with heuristic backtracking search. Extensive experiments are conducted on real and synthetic datasets to demonstrate the superiority of SCPM-CR compared with traditional SCPM methods, and also to validate the efficiency and scalability of CS-HBS. Experimental results show that CS-HBS outperforms the baselines by several times or even orders of magnitude. [ABSTRACT FROM AUTHOR]

Pursley and Sarwate established a lower bound on a combined measure of autocorrelation and crosscorrelation for a pair $(f,g)$ of binary sequences (i.e., sequences with terms in {−1, 1}). If $f$ is a nonzero sequence, then its autocorrelation demerit factor, $\text {ADF}(f)$ , is the sum of the squared magnitudes of the aperiodic autocorrelation values over all nonzero shifts for the sequence obtained by normalizing $f$ to have unit Euclidean norm. If $(f,g)$ is a pair of nonzero sequences, then their crosscorrelation demerit factor, $\text {CDF}(f,g)$ , is the sum of the squared magnitudes of the aperiodic crosscorrelation values over all shifts for the sequences obtained by normalizing both $f$ and $g$ to have unit Euclidean norm. Pursley and Sarwate showed that for binary sequences, the sum of $\text {CDF}(f,g)$ and the geometric mean of $\text {ADF}(f)$ and $\text {ADF}{(g)}$ must be at least 1. For randomly selected pairs of long binary sequences, this quantity is typically around 2. In this paper, we show that Pursley and Sarwate’s bound is met for binary sequences precisely when $(f,g)$ is a Golay complementary pair. We also prove a generalization of this result for sequences whose terms are arbitrary complex numbers. We investigate constructions that produce infinite families of Golay complementary pairs, and compute the asymptotic values of autocorrelation and crosscorrelation demerit factors for such families. [ABSTRACT FROM AUTHOR]

A tradeoff between sum rate and fairness for multiple-input single-output (MISO) broadcast communication employing dirty paper coding or zero-forcing dirty paper coding at physical layer is investigated in this paper. The tradeoff is based on a new design objective termed “tri-stage” approach as well as a new $\ell _1$ -based fairness measure that is much more robust than the well-known Jain's index for comparing fairness levels achieved by various design objectives at a much finer resolution in high SNR regime. The newly proposed tri-stage design also introduces a new concept of statistical power allocation that randomly allocates power to users based on an optimal probability distribution derived from the tradeoff between sum rate and fairness. Simulation results show that the proposed approach can simultaneously achieve a larger sum rate and better fairness than the reputable proportional fairness criterion. A performance upper bound is also given in the paper to show the excellent performance of the proposed approach at moderate and high SNR regimes as well as some potential for further improvement in low SNR regime. [ABSTRACT FROM AUTHOR]

Boolean functions with high algebraic immunity are important cryptographic primitives in some stream ciphers. In this paper, two methodologies for constructing minimal binary codes from sets, Boolean functions and vectorial Boolean functions with high algebraic immunity, are proposed. More precisely, a general construction of new minimal codes using minimal codes contained in Reed-Muller codes and sets without nonzero low degree annihilators is presented. The other construction allows us to yield minimal codes from certain subcodes of Reed-Muller codes and vectorial Boolean functions with high algebraic immunity. Via these general constructions, infinite families of minimal binary linear codes of dimension $m$ and length less than or equal to $m(m+1)/2$ are obtained. Besides, a lower bound on the minimum distance of the proposed minimal linear codes is established. Conjectures and open problems are also presented. The results of this paper show that Boolean functions with high algebraic immunity have nice applications in several fields additionally to symmetric cryptography, such as coding theory and secret sharing schemes. [ABSTRACT FROM AUTHOR]

Atabat-ol-kataba is a book written by Montajab-o-ddin Badi'e Joveini which includes samples of administrative and court-related correspondence as well as friendly letters of the Sultan Sanjar Saljuqi era. The book was edited and published in 1950 by Allameh Ghazvini and Eghbal Ashtiani based on a photo version of the book as the only existing version of the work in question. It was also reprinted in 2005. A re-edited version of the book including an index and commentaries has recently been published in 2017 by Maryam Sadeghi. She has resorted to a comparative method based onthe version published by Ghazvini and Eghbal. The present paper aims to explore Sadeghi's method of editing and correcting and to criticize some shortcomings with her work as opposed to Ghazvini and Eghbal’s edition. The findings indicate that in spite of correcting several errors resulting from typesetting in Ghazvini and Eghbal’s work, when it comes to refining the text itself, Sadeghi has frequently deviated from the comparative methodology and has rather made subjective corrections. As a result, in many cases, she has changed Ghazvini and Eghbal’s correct choices on the basis of her own taste and subjective perception and has entered huge mistakes into the text. The paper examines some cases of such arbitrary changes. [ABSTRACT FROM AUTHOR]

This paper overviews the motion vector coding and block merging techniques in the Versatile Video Coding (VVC) standard developed by the Joint Video Experts Team (JVET). In general, inter-prediction techniques in VVC can be classified into two major groups: “whole block-based inter prediction” and “subblock-based inter prediction”. In this paper, we focus on techniques for whole block-based inter prediction. As in its predecessor, High Efficiency Video Coding (HEVC), whole block-based inter prediction in VVC is represented by adaptive motion vector prediction (AMVP) mode or merge mode. Newly introduced features purely for AMVP mode include symmetric motion vector difference and adaptive motion vector resolution. The features purely for merge mode include pairwise average merge, merge with motion vector difference, combined inter-intra prediction and geometric partitioning mode. Coding tools such as history-based motion vector prediction and bidirectional prediction with coding unit weights can be applied on both AMVP mode and merge mode. This paper discusses the design principles and the implementation of the new inter-prediction methods. Using objective metrics, simulation results show that the methods overviewed in the paper can jointly achieve 6.2% and 4.7% BD-rate savings on average with the random access and low-delay configurations, respectively. Significant subjective picture quality improvements of some tools are also reported when comparing the resulting pictures at same bitrates. [ABSTRACT FROM AUTHOR]

The paper provides an overview of the quantization and entropy coding methods in the Versatile Video Coding (VVC) standard. Special focus is laid on techniques that improve coding efficiency relative to the methods included in the High Efficiency Video Coding (HEVC) standard: The inclusion of trellis-coded quantization, the advanced context modeling for entropy coding of transform coefficient levels, the arithmetic coding engine with multi-hypothesis probability estimation, and the joint coding of chroma residuals. Beside a description of the design concepts, the paper also discusses motivations and implementation aspects. The effectiveness of the quantization and entropy coding methods specified in VVC is validated by experimental results. [ABSTRACT FROM AUTHOR]

This paper examines an alternative view of the use of resources in R&D teams and proposes a way to resolve the dispute between integration versus separation of idea generation and idea implementation concerning the achievement of high levels of product innovation. Contrary to the symmetric approach espoused by earlier studies, the hypotheses here are grounded in the notion that resources have an asymmetric association with idea generation and idea implementation. By asymmetric association we mean that resources have more impact on idea generation than on idea implementation. This paper considers the interactional relationship of two types of resources, time and financial budget, on idea generation and idea implementation. It is based on responses from 214 team members that belong to 40 R&D teams. The results support the existence of an asymmetric mechanism of association between resources and the idea generation and idea implementation climates. Furthermore, they demonstrate that the integration of idea generation and idea implementation is associated with high levels of product innovation when resources are available, while the separation of the two is associated with high levels of product innovation when resources are scarce. [ABSTRACT FROM AUTHOR]

The growth of crowdfunding has attracted interest from academics and managers alike. Crowdfunders are consumers in the sense that they consume start-up ideas now and their outputs in the future. Given that a crowdfunding platform is almost the only channel for entrepreneurial marketers to interactively communicate with consumers, it is pivotal to study the effectiveness of campaign message design. Thus, the goals of this paper are, first, what impact does future-focused message framing have on seeking seed-stage finance when promoting novel ideas to retail investors who may become future consumers? Second, what are other factors that can be further combined as digital communication tools to effectively improve fundraising performance? We collected a dataset of 3361 reward-based crowdfunding campaigns on Kickstarter, the results of which show that a future-focused campaign has a negative impact on the amount of funds raised. In order to reduce such adverse effects on fundraising, campaigners’ extensive engagement is necessary especially when only a handful of reward options are available. This paper highlights the critical role of future focus in driving digital communication effectiveness and offers important implications for research and practice. [ABSTRACT FROM AUTHOR]

Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by C(ƒ) = {Tr(aƒ(x) + bx)x∈Fqm*: a, b ∈ Fqm}, where q is a prime power, Fqm* = Fqm \ {0}, Tr is the trace function from Fqm to Fq, and ƒ(x) is a function from Fqm to Fqm with ƒ(0) = 0. Almost bent functions, quadratic functions and some monomials on F2m were used in the first construction, and many families of binary linear codes with few weights were obtained in the literature. This paper studies some punctured codes of these binary codes. Several families of binary linear codes with few weights and new parameters are obtained in this paper. Several families of distance-optimal binary linear codes with new parameters are also produced in this paper. [ABSTRACT FROM AUTHOR]

The puncturing and shortening techniques are two important approaches to constructing new linear codes from old ones. In the past 70 years, a lot of progress on the puncturing technique has been made, and many works on punctured linear codes have been done. Many families of linear codes with interesting parameters have been obtained with the puncturing technique. However, little research on the shortening technique has been done and there are only a handful references on shortened linear codes. The first objective of this paper is to prove some general theory for shortened linear codes. The second objective is to study some shortened codes of the Hamming codes, Simplex codes, some Reed-Muller codes, and ovoid codes. Eleven families of optimal shortened codes over finite fields are presented in this paper. As a byproduct, five infinite families of 2-designs are also constructed from some of the shortened codes presented in this paper. [ABSTRACT FROM AUTHOR]

Let m be an even positive integer. A Boolean bent function ƒ on F2m-1 × F2 is called a cyclic bent function if for any a ≠ b ∈ F2m-1 and ε ∈ F2, ƒ(ax1, x2)+ ƒ(bx1, x2 + ε) is always bent, where x1 ∈ F2m-1, x2 ∈ F2. Cyclic bent functions look extremely rare. This paper focuses on cyclic bent functions on F2m-1 × F2 and their applications. The first objective of this paper is to establish a link between quadratic cyclic bent functions and a special type of prequasifields, and construct a class of quadratic cyclic bent functions from the Kantor-Williams prequasifields. The second objective is to use cyclic bent functions to construct families of optimal sequences. The results of this paper show that cyclic bent functions have nice applications in several fields such as coding theory, symmetric cryptography, and CDMA communication. [ABSTRACT FROM AUTHOR]

In the present paper, an attempt has been made to introduce a new Stability Index (SI) for induction motors (IMs) three-phase fault recovery in industrial networks. The proposed SI is based on the steady-state model of induction machine as well as the usage of concepts related to stable and unstable equilibrium points. This index is evaluated by estimating the post-fault slip and is a function of the maximum slip and slips related to the induction motor operating point in pre-fault and post-fault torque-slip characteristics. Moreover, this index quantifies the amount of stability in addition to the stability state determination. The method is validated through comparison between the analytical and dynamic simulation results. Sensitivity analysis has also been used to describe the proposed index completely. This paper also presents a novel objective function by which the fault recovery process can be done optimally. The proposed method presented in this paper has also been applied to two industrial networks, one of which is the modified IEEE 9-bus system. [ABSTRACT FROM AUTHOR]

This paper proposes a semi-analytical method to obtain the equilibrium bidding strategies for generation and demand units in a combined oligopoly and oligopsony wholesale electricity market. Such market structure is the outcome of the increasing deployment of demand response programs that facilitate active participation of demand-side players in the price-setting process. In this analysis, the concept of supply function equilibrium (SFE) is used to investigate the oligopolistic competition among generation units. The SFE model is extended and the demand function equilibrium (DFE) is obtained to study the oligopsonistic competition among demand units. The economic behavior of a market participant is formulated as a bi-level programming (BLP) problem. The imperfect competition among generation units, as well as among demand units, are modeled as a non-cooperative game. Next, a direct method is developed to calculate all candidate equilibriums of the market, and the locational marginal prices (LMPs) in terms of the bidding strategies of the market participants. The BLP problem is solved by obtaining the coordinated Pareto-dominant Nash equilibrium of the market participants’ non-cooperative games. Finally, the proposed analysis is examined in case studies. Accordingly, we report insightful observations with respect to the impact of the changes in the new market structure, at firm-level and market-level, such as in terms of mitigating market power of generation units, the market clearing prices and quantities, surplus for generation units and demand units, and potential impact on market efficiency. [ABSTRACT FROM AUTHOR]

In this paper, a detailed qualitative & quantitative comparative analysis of measurement based centralized voltage stability monitoring approaches using Thevenin equivalent is presented. These methods typically utilize the state estimation output, making them easily implementable at the control centers. The metrics for comparison are defined in terms of computation resources required, accuracy of identifying the critical loading point, critical contingency screening, and robustness to noise. These performance metrics are relevant for practical implementation and are presented on the IEEE 300 bus system and the MATPOWER 2383-bus system. To the best of our knowledge, this is the first systematic qualitative & quantitative comparison between various measurement based voltage stability methods using these performance metrics. The results will guide the utilities and operators about possible trade-offs between the various methods for large systems, enabling them to make an informed decision on the specific method to use for their needs. [ABSTRACT FROM AUTHOR]

The successive cancellation (SC) process in which symbols are decoded sequentially by processing some intermediate information is an essential component of various decoding algorithms used for polar codes and their variants. In some decoding schemes, we may need to redo this process from some specific symbol or from the first symbol. This operation is called rewinding. Rewinding the SC process seems trivial if we have access to all intermediate log-likelihood ratios (LLRs) and partial sums. However, as the block length increases, retaining all of the intermediate information becomes inefficient and impractical. Rewinding the SC process in a memory-efficient way is a problem that we address in this paper. As we store a fraction of all the intermediate information in the memory-efficient scheme, we may not be able to rewind the SC process to the target symbol index. The reason is that some of the stored intermediate information needed to decode the target symbol may have been overwritten. To recompute the lost information, we may need to rewind the process further. Before proposing the formal scheme for the rewinding process, we explore the known properties of the SC process based on the binary representation of the bit indices. Then, we introduce a new operator used for grouping the bit indices. This special grouping helps us in finding the closest bit index to the target index for rewinding. We also analytically prove that this approach gives access to the untouched intermediate information stored in the memory which is essential in resuming the SC process. Finally, we adapt the proposed approach to multiple rewinds and apply it to SC-flip decoding and shifted-pruning-based list decoding. The numerical evaluation of the proposed solution shows a significant reduction of ≥50% in the complexity of the additional decoding attempts at medium and high SNR regimes for SC-flip decoding and less for shifted-pruning based list decoding. [ABSTRACT FROM AUTHOR]

With the full development of intelligent mobile communications, wireless mixed reality (MR) provides a more visually immersive experience and stronger interaction with environments than virtual reality (VR) and augmented reality (AR). However, the asymmetric characteristic of wireless MR traffic creates a huge challenge to current mobile networks. Dynamic time division duplex (D-TDD) is considered as a promising technology to improve wireless MR users’ quality of experience (QoE) due to its potentials and advantages in delivering asymmetric traffic. Therefore, in this paper, we propose a QoE-driven distributed multidimensional resource allocation (MRA) supplemented by inter-cell interference (ICI) mitigation scheme for wireless MR in multi-cell D-TDD systems. First, to improve QoE of MR users, we formulate the joint optimization of subframe configuration, channel assignment and computation offloading as a mixed-integer nonlinear programming problem. A novel fully-decentralized multi-agent deep Q-network (DQN) algorithm is developed to solve the problem. Then, to mitigate ICI, a water filling based power control algorithm is investigated to minimize the total power of each small base station and its associated MR users. Simulation results demonstrate that our proposed scheme improves QoE of MR users in a realizable way as compared to existing schemes. [ABSTRACT FROM AUTHOR]