This study examines the impact of age, education, performance, caregiving responsibilities, and leisure time among 302 female Indonesian lecturers using PLS-SEM. Results show that age and education increase productivi...
详细信息
In information visualization, the position of symbols often encodes associated data values. When visualizing data elements with both a numerical and a categorical dimension, positioning in the categorical axis admits ...
详细信息
The optimal solution to an optimization problem depends on the problem’s objective function, constraints, and size. While deep neural networks (DNNs) have proven effective in solving optimization problems, changes in...
详细信息
This paper considers the achievable rate-exponent region of integrated sensing and communication systems in the presence of variable-length coding with feedback. This scheme is fundamentally different from earlier stu...
详细信息
ISBN:
(数字)9798350368369
ISBN:
(纸本)9798350368376
This paper considers the achievable rate-exponent region of integrated sensing and communication systems in the presence of variable-length coding with feedback. This scheme is fundamentally different from earlier studies, as the coding methods that utilize feedback impose different constraints on the codewords. The focus herein is specifically on the Gaussian channel, where three achievable regions are analytically derived and numerically evaluated. In contrast to a setting without feedback, we show that a trade-off exists between the operations of sensing and communications.
Digital Twins (DTs), serving personalized cloud-based digital assistants, hold great promise for supporting infotainment applications of the Internet of Vehicles (IoVs), in which personalized content such as high-defi...
详细信息
The paper presents a wideband 8×8-element slot antenna array operating in the E-band. The proposed design employs a low-loss coaxial waveguide transmission line filled with air implemented using multilayer wavegu...
详细信息
An absorber is a block of material employed to absorb a portion of the energy of an incident particle. Research on absorbers is rapidly expanding as a result of their prospective applications in several fields, includ...
详细信息
In today’s digital landscape, email is acknowledged as a critical conduit for global data exchanges. With a surge in data volume, malefactors exploit user identities, leading to data misuse. Cybercriminals employ ele...
详细信息
Broadcasting is one of the fundamental information dissemination primitives in interconnection networks, where a message is passed from one node (called originator) to all other nodes in the network. Following the inc...
详细信息
ISBN:
(数字)9798331524937
ISBN:
(纸本)9798331524944
Broadcasting is one of the fundamental information dissemination primitives in interconnection networks, where a message is passed from one node (called originator) to all other nodes in the network. Following the increasing interest in interconnection networks, extensive research was dedicated to broadcasting. Two main research goals of this area are finding inexpensive network structures that maintain efficient broadcasting and finding the broadcast time for well-known and widely used network topologies. In the scope of this study, we will mainly focus on determining the broadcast time and nearoptimal broadcasting schemes in networks. Determination of the broadcast time of any node in an arbitrary network is known to be NP-hard. Polynomial time solutions are known only for a few network topologies. There also exist various heuristic and approximation algorithms for different network topologies. In this study, we consider the broadcast time problem on graphs that comprise some recursive structures. We initiate a novel direction to designing broadcasting algorithms on recursively defined graphs. We provide a theoretical foundation for future broadcasting studies, as well as discuss several practical applications of the approach we introduce.
The heuristic iterative pruning strategy has been widely used for neural network sparsification. However, it is challenging to identify the right connections to remove at each pruning iteration with only a one-shot ev...
详细信息
ISBN:
(纸本)9798350323481
The heuristic iterative pruning strategy has been widely used for neural network sparsification. However, it is challenging to identify the right connections to remove at each pruning iteration with only a one-shot evaluation of weight magnitude, especially at the early pruning stage. The erroneously removed connections, unfortunately, can hardly be recovered. In this work, we propose a weight decay strategy as a substitute for pruning, which let the "insignificant" weights moderately decay instead of being directly clamped to zero. At the end of the training, the vast majority of redundant weights will naturally become close to zero, making it easier to identify which connections could be removed safely. Experimental results show that the proposed weight decay method can achieve an ultra-high sparsity of 99%. Compared to the current pruning strategy, the model size is further reduced by 34%, improving the compression rate from 69× to 106× at the same accuracy.
暂无评论