Priority Encoding Research Articles

A multi-objective fuzzy programming model for port tugboat scheduling based on the Stackelberg game

To solve the optimization problem of tugboat scheduling for assisting ships in entering and exiting ports in uncertain environments, this study investigates the impact of the decisions of tugboat operators and port dispatchers on tugboat scheduling under the scenario of dynamic task arrival and fuzzy tugboat operation time. Considering the features of the shortest distance tugboat principle, the first available tugboat principle, and the principle of fairness in the task volume of each tugboat, the tugboat company aims to minimize the total daily fuel consumption of tugboat operations, maximize the total buffer time of dynamic tasks, and minimize the total completion time as the objective functions. Due to the limitations of port vessel berthing and departure, as well as the allocation standards for piloting or relocating tugboats, the present study proposes a Stackelberg game-based fuzzy model for port tugboat scheduling with the tugboat operator and port dispatcher acting as decision makers at the upper and lower levels, respectively. A seagull optimization algorithm based on priority encoding and genetic operators is designed as a solution approach. CPLEX, genetic algorithm, standard seagull optimization algorithm, and simulated annealing algorithm are used to compare and analyze the solution results for the 45 problem cases generated from the actual data obtained from the Guangzhou Port. The results verify the efficiency of the proposed seagull optimization algorithm based on priority encoding and genetic operators. Furthermore, additional experiments are conducted to evaluate the changes in fairness coefficient, uncertain parameter correlation coefficients, and objective function correlation coefficients to demonstrate the practicality of the fuzzy programming model. This analysis involves adjusting the confidence level incrementally from 0 to 100% with respect to the model’s uncertain parameters.

A Necessity-Based Optimization Approach for Closed-Loop Logistics Considering Carbon Emission Penalties and Rewards under Uncertainty

The recycling of waste products can bring enormous economic and environmental benefits to supply chain participants. Under the government’s reward and punishment system, the manufacturing industry is facing unfolded pressure to minimize carbon emissions. However, various factors related to the design of closed-loop logistics networks are uncertain in nature, including demand, facility capacity, transportation cost per unit of product per kilometer, landfill cost, unit carbon penalty cost, and carbon reward amount. As such, this study proposes a new fuzzy programming model for closed-loop supply chain network design which directly relies on fuzzy methods based on the necessity measure. The objective of the proposed optimization model is to minimize the total cost of the network and the sum of carbon rewards and penalties when selecting facility locations and transportation routes between network nodes. Based on the characteristics of the problem, a genetic algorithm based on variant priority encoding is proposed as a solution. This new solution encoding method can make up for the shortcomings of the four traditional encoding methods (i.e., Prüfer number-based encoding, spanning tree-based encoding, forest data structure-based encoding, and priority-based encoding) to speed up the computational time of the solution algorithm. Several alternative solution approaches were considered to evaluate the proposed algorithm including the precision optimization method (CPLEX) and priority-based encoding genetic algorithm. The results of numerous experiments indicated that even for large-scale numerical examples, the proposed algorithm can create optimal and high-quality solutions within acceptable computational time. The applicability of the model was demonstrated through a sensitivity analysis which was conducted by changing the parameters of the model and providing some important management insights. When external parameters change, the solution of the model maintains a certain level of satisfaction conservatism. At the same time, the changes in the penalty cost and reward amount per unit of carbon emissions have a significant impact on the carbon penalty revenue and total cost. The results of this study are expected to provide scientific support to relevant supply chain enterprises and stakeholders.

Multiobjective Sustainable Order Allocation Problem Optimization with Improved Genetic Algorithm Using Priority Encoding

Recently, incorporating carbon emissions into order allocation decisions has attracted considerable attention among scholars and industrialists. Moreover, affected by the random fluctuations of the man, machine, material, method, and environment (4M1E), the production process is usually imperfect with defective products. Reducing product defective rates can effectively improve the quality of the order allocation process. Therefore, considering product defective rate and carbon emission, a multiobjective integer nonlinear programming (INLP) formulation is presented to address this multiproduct, multiperiod, and multi-OEM order allocation problem. Furthermore, exploring the existing literatures, an improved genetic algorithm using priority encoding (IGAUPE) is put forward as a novel optimization technique. Finally, numerical experiments are conducted to validate the correctness of the proposed INLP model as well as the effectiveness of the proposed algorithm. Compared with the genetic algorithm using binary encoding (GAUBE), genetic algorithm using two-layer encoding (GAUTE), and LINGO software, the experiment results show that IGAUPE can improve the efficiency and effectiveness within the predetermined time limit when solving large-scale instances.

Encoding actions and verbs: Tracking the time-course of relational encoding during message and sentence formulation.

Two experiments tracked the encoding of relational information (actions at the level of the prelinguistic message and verbs at the level of the sentence) during formulation of transitive event descriptions (e.g., The tiger is scratching the photographer). At what point during message and sentence formulation do speakers encode actions and verbs? Participants described pictures of transitive events in response to neutral questions ("What is happening?"), agent questions ("What is [the agent] doing?"), and patient questions ("What is happening with [the patient]?"). The agent and patient questions were intended to change the message-level focus of speakers' responses and to induce priority encoding of the event action and the sentence verb. The questions had a nearly categorical effect on speakers' choice of sentence form in their responses (characters mentioned in the questions were produced in subject position, as expected) and a strong effect on the time-course of sentence formulation: Speakers rapidly directed their gaze to the part of the event needed to encode contextually new, task-relevant information-first the event action and the sentence verb, then the sentence object. The distribution of fixations during the "verb-encoding" window showed that speakers encode relational information by fixating both event characters. Comparing formulation of sentences describing events with action-informative agents and action-informative patients showed a small preference for fixating the more informative character both immediately after picture onset (message-level encoding) and during the verb-encoding window (sentence-level encoding). The results identify action-specific and verb-specific eye movement signatures in message and sentence formulation. (PsycINFO Database Record (c) 2019 APA, all rights reserved).

Power Efficient and Reliable Nonvolatile TCAM With Hi-PFO and Semi-Complementary Driver

In this paper, we propose a high priority first out (HiPFO) architecture of ternary content addressable memory (TCAM) to extend functions, not only “data comparison” but also “priority encoding.” With that architecture, we can select the longest matching prefix efficiently in terms of area and power consumption. We also introduce a semi-complementary data line driver (SCD <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) and self-tuning VON (STV). With those techniques, we can eliminate the dc current in the data line and guarantee sensing margins even under small R-ratio nonvolatile memory in a 3T-2R-based HiPFO cell. As in experimental results, the PRAM-based HiPFO structure reduces the existing power consumption of priority encoder, thereby reducing the total power consumption by 27%. Also, thanks to the SCD <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> , the power loss from the dc current is reduced by more than 26%. In addition, the STV is helpful to overcome match line sensing margin at low R-ratio, which resulted in 1.5 times or larger sensing margin window improvement in the voltage swing of 1.2 V and R-ratio of 3. All those techniques are built in nvTCAM with 64-bit $\times$ 32 rows array, and showed 46% improvement of total power consumption with simulation. And the nvTCAM fabricated at 180-nm CMOS technology demonstrates HiPFO operation.

Distinct roles of prefrontal and parietal areas in the encoding of attentional priority

When searching for an object in a crowded scene, information about the similarity of stimuli to the target object is thought to be encoded in spatial priority maps, which are subsequently used to guide shifts of attention and gaze to likely targets. Two key cortical areas that have been described as holding priority maps are the frontal eye field (FEF) and the lateral intraparietal area (LIP). However, little is known about their distinct contributions in priority encoding. Here, we compared neuronal responses in FEF and LIP during free-viewing visual search. Although saccade selection signals emerged earlier in FEF, information about the target emerged at similar latencies in distinct populations within the two areas. Notably, however, effects in FEF were more pronounced. Moreover, LIP neurons encoded the similarity of stimuli to the target independent of saccade selection, whereas in FEF, encoding of target similarity was strongly modulated by saccade selection. Taken together, our findings suggest hierarchical processing of saccade selection signals and parallel processing of feature-based attention signals within the parietofrontal network with FEF having a more prominent role in priority encoding. Furthermore, they suggest discrete roles of FEF and LIP in the construction of priority maps.

Experimental realization of a CMOS-compatible optical directed priority encoder using cascaded micro-ring resonators

AbstractIn this paper, we propose and experimentally demonstrate an integrated optical device that can implement the logical function of priority encoding from a 4-bit electrical signal to a 2-bit optical signal. For the proof of concept, the thermo-optic modulation scheme is adopted to tune each micro-ring resonator (MRR). A monochromatic light with the working wavelength is coupled into the input port of the device through a lensed fiber, and the four input electrical logic signals regarded as pending encode signals are applied to the micro-heaters above four MRRs to control the working states of the optical switches. The encoding results are directed to the output ports in the form of light. At last, the logical function of priority encoding with an operation speed of 10 Kbps is demonstrated successfully.

Multi‐scroll chaotic attractors from a generalized time‐delay sampled‐data system

SummaryIn this paper, the first generalization for time‐delay sampled‐data chaotic system in order to generate multi‐scroll attractor is introduced with its circuit implementation. An efficient delay‐line with binary priority encoding, parallel shifting, and binary decoding is also suggested and implemented to overcome the delay line realization drawback in such systems. The proposed system enhances the complexity of chaotic behavior by means of multi‐scroll feature and exemplifies the simplification of chaotic systems for better realizations. Copyright © 2015 John Wiley &amp; Sons, Ltd.

Adaptive multiple description coding and transmission of uncompressed video over 60GHz networks

While many cognitive radio (CR) techniques are developed to better utilize the allocated spectrum, the massive unlicensed bandwidth in the 60GHz band also provides great potential for supporting new bandwidth intensive applications. In this paper, we investigate the problem of streaming uncompressed High Definitio (HD) videos over 60GHz networks. We present an adaptive multiple description (MD) coding (MDC) technique based on Priority Encoding Transmission (PET) that exploits the different significanc of the pixel bits, and an interleaving based transmission scheme to combat the bursty losses due to blockage. A nonlinear integer programming problem is formulated and solved with a heuristic approach for determining the sub-optimal coding and transmission parameters. The proposed scheme is adaptive to the dynamic 60GHz link conditions for enhanced video quality. The performance of the proposed scheme is validated with simulations.

Memory, priority encoding, and overcoming high-value proactive interference in younger and older adults

ABSTRACTIt is often necessary to remember important information while directing attention away from encoding less valuable information. To examine how aging influences the ability to control and update the encoding of high-value information, younger and older adults studied six lists of words that varied in terms of the point values associated with each word. The words were paired with the same high and low point values for three study-test cycles, but on the fourth and subsequent cycles the value-word pairings were switched such that the lowest value pairs became the highest values (and vice versa). For the first three study-test cycles, younger adults outperformed older adults in terms of the number of words recalled and overall point totals, but performance was similar in terms of selectively remembering high-value words. When the values were switched, both groups displayed substantial interference from the previous pairings. Although both groups improved with additional study-test cycles, only younger adults were able to fully recover from the interference effects. A similar, and more pronounced, set of results were obtained when positive and negative point values were paired with the words. The findings are interpreted in a value-directed remembering framework, emphasizing the role of benefits and costs of strategic encoding and age-related differences in the effects of interference on memory.

Unequal error protection under bitrate constraint for video streaming over internet

This article describes a simple packet-level FEC system suitable for unequal error protection of layered video streams, that we called TAPIOCA (in French, Transport Audiovisuel avec Protection Inegale des Objets et Controle d'Admission). It is designed in a way that the FEC overhead induced by redundant packets is perfectly controlled by the sender. In order to achieve that, TAPIOCA calculates on-the-fly the optimal erasure code to be used, video data unit by video data unit, under a given bitrate constraint. In addition, and contrary to the well-known PET (Priority Encoding Transmission) system, the video data units of each layer are encoded separately. This is especially useful when all layers are not output from the video coder at the same time. Simulation results for MPEG-4 video streaming show that the proposed FEC system can be very efficient even if packet losses are due to network congestion. Moreover, comparison with PET system shows that TAPIOCA exhibits better performance, considering criteria including the decodable frame rate, protection system efficiency and computational cost.

Optimal PET Protection for Streaming Scalably Compressed Video Streams With Limited Retransmission Based on Incomplete Feedback

For streaming scalably compressed video streams over unreliable networks, Limited-Retransmission Priority Encoding Transmission (LR-PET) outperforms PET remarkably since the opportunity to retransmit is fully exploited by hypothesizing the possible future retransmission behavior before the retransmission really occurs. For the retransmission to be efficient in such a scheme, it is critical to get adequate acknowledgment from a previous transmission before deciding what data to retransmit. However, in many scenarios, the presence of a stochastic packet delay process results in frequent late acknowledgements, while imperfect feedback channels can impair the server's knowledge of what the client has received. This paper proposes an extended LR-PET scheme, which optimizes PET-protection of transmitted bitstreams, recognizing that the received feedback information is likely to be incomplete. Similar to the original LR-PET, the behavior of future retransmissions is hypothesized in the optimization objective of each transmission opportunity. As the key contribution, we develop a method to efficiently derive the effective recovery probability versus redundancy rate characteristic for the extended LR-PET communication process. This significantly simplifies the ultimate protection assignment procedure. This paper also demonstrates the advantage of the proposed strategy over several alternative strategies.

Adaptive Packet-Level Interleaved FEC for Wireless Priority-Encoded Video Streaming

Packet-level Forward Error Control (FEC) for video streaming over a wireless network has received comparatively limited investigation, because of the delay introduced by the need to assemble a group of packets. However, packet-level interleaving when combined with FEC presents a remedy to time-correlated error bursts, though it can further increase delay if this issue is not addressed. This paper proposes adapting the overall degree of interleaved packet-level FEC according to the display deadlines of packets, transmit buffer occupation, and estimated video input to the wireless channel, all of which address the issue of delay. To guard against estimation error, the scheme applies a conservative adaptation policy, which accounts for picture type importance to ensure that display deadlines are met, thus avoiding this defect of interleaving. The paper additionally introduces a greedy algorithm that effectively groups packet-level FEC protection according to packet priority. Priority encoding adds extra protection during deep fades. As feedback is not required, the interleaving scheme is suitable for all forms of video broadcast. A Bluetooth piconet demonstrates the packet-level FEC interleaving scheme, which provides higher quality delivered video compared to the industry-standard Pro-MPEG Cop#3r2 interleaving scheme.

Reduction of power dissipation in sequential circuits

In this paper, an attempt is made to reduce the power consumption of a synchronous digital system by minimizing the total power consumed by the clock signals. This paper presents a state assignment technique called priority encoding which uses multi-code assignment plus clock gating to reduce power dissipation in sequential circuits. The basic idea is to assign multiple codes to states so as to enable more effective clock gating in the sequential circuit. Experimental results demonstrate that the priority encoding technique can result in sizable power saving. Keywords: priority encoding, multi code state assignment, clock gating.

A comparative study of access topologies for chip-level address-event communication channels

We examine channel access algorithms and circuits for intra and inter chip communication channels. Classical access techniques such as arbitration, scanning, ALOHA, and priority encoding are compared by assessing throughput, latency, and power consumption. Our results provide guidance in the design of bio-inspired networks of processors, for efficient transmission of information with limited power consumption and reduced latency.

Controlled &amp; automatic processing: behavior, theory, and biological mechanisms

AbstractThis paper provides an overview of developments in a dual processing theory of automatic and controlled processing that began with the empirical and theoretical work described by Schneider and Shiffrin (1977) and Shiffrin and Schneider (1977) over a quarter century ago. A review of relevant empirical findings suggests that there is a set of core behavioral phenomena reflecting differences between controlled and automatic processing that must be addressed by a successful theory. These phenomena relate to: consistency in training, serial versus parallel processing, level of effort, robustness to stressors, degree of control, effects on long‐term memory, and priority encoding. We detail a computational model of controlled processing, CAP2, that accounts for these phenomena as emergent properties of an underlying hybrid computational architecture. The model employs a large network of distributed data modules that can categorize, buffer, associate, and prioritize information. Each module is a connectionist network with input and output layers, and each module communicates with a central Control System by outputting priority and activity report signals, and by receiving control signals. The Control System is composed of five processors including a Goal Processor, an Attention Controller, an Activity Monitor, an Episodic Store, and a Gating &amp; Report Relay. The transition from controlled to automatic processing occurs in this model as the data modules become capable of transmitting their output without mediation by the Control System. We describe recent progress in mapping the components of this model onto specific neuroanatomical substrates, briefly discuss the potential for applying functional neuroimaging techniques to test the model's predictions, and its relation to other models.

Controlled & automatic processing: behavior, theory, and biological mechanisms

This paper provides an overview of developments in a dual processing theory of automatic and controlled processing that began with the empirical and theoretical work described by Schneider and Shiffrin (1977) and Shiffrin and Schneider (1977) over a quarter century ago. A review of relevant empirical findings suggests that there is a set of core behavioral phenomena reflecting differences between controlled and automatic processing that must be addressed by a successful theory. These phenomena relate to: consistency in training, serial versus parallel processing, level of effort, robustness to stressors, degree of control, effects on long-term memory, and priority encoding. We detail a computational model of controlled processing, CAP2, that accounts for these phenomena as emergent properties of an underlying hybrid computational architecture. The model employs a large network of distributed data modules that can categorize, buffer, associate, and prioritize information. Each module is a connectionist network with input and output layers, and each module communicates with a central Control System by outputting priority and activity report signals, and by receiving control signals. The Control System is composed of five processors including a Goal Processor, an Attention Controller, an Activity Monitor, an Episodic Store, and a Gating & Report Relay. The transition from controlled to automatic processing occurs in this model as the data modules become capable of transmitting their output without mediation by the Control System. We describe recent progress in mapping the components of this model onto specific neuroanatomical substrates, briefly discuss the potential for applying functional neuroimaging techniques to test the model’s predictions, and its relation to other models.

High-performance and power-efficient CMOS comparators

Several design techniques for high-performance and power-efficient CMOS comparators are proposed. First, the comparator is based on the priority-encoding (PE) algorithm, and the dynamic circuit technique developed specifically for the priority encoder can be applied. Second, the PE function and the subsequent logic functions are merged and efficiently realized in the multiple output domino logic (MODL) to result in a shortened logic depth. The circuit in MODL CMOS is also compact and power efficient because few transistors are needed. Third, the multilevel look-ahead technique is used to shorten the path of priority-token propagation. Finally, the circuit is realized with a latch-based two-stage pipelined structure, and the comparison function is partitioned into two parts, with each part executed in each half of the clock cycle in a delay-balanced manner. Post-layout simulation results show that a 64-b comparator designed with the proposed techniques in a 3-V 0.6-μm CMOS technology is 16% faster, 50% smaller, and 79% more power efficient as compared with the all-n-transistor comparator, which is the fastest among the conventional comparators. Measurement results of the test chip conform with simulation results and prove the feasibility of the proposed techniques.

Firewire in modern integrated military avionics

High performance communications, navigation, and identification (CNI) functions on modern military aircraft are increasingly required for mission readiness. The operation of simultaneous waveforms through an integrated avionics rack of shared resources becomes a test in moving data rapidly from one signal processing stage to the next. The IEEE 1394, or Firewire, is a commercial high bandwidth bus whose 64-bit addressing and maximum 400 Mbits/second throughput satisfies this demanding military avionics interconnect need. The challenge in applying this commercial product to integrated avionics is the requirement to seamlessly add message priority encoding. By having message priorities, the slower strategic communications links will not impair the performance of higher data rate tactical communications, thereby avoiding potentially life-threatening bottlenecks. The flight environment imposes additional challenges to ruggedize the cabling between integrated avionics racks and to utilize the full capabilities of the Firewire bus. A discussion of the physical, data link, network, and transport layers, as used in avionics applications will be done. Additionally, the versatility of 1394 in military avionics with its variable channel sizes, bandwidth on demand, hierarchical addressing, and upgrade to 800 and 1600 Mbps with a 64-bit wide data path, is emphasized. Finally, system maintenance advantages of 1394's hot pluggable features are discussed, with an eye toward cost reduction on the flight line and total operational time of the aircraft avionics systems.

End-to-end delay analysis of videoconferencing over packet-switched networks

Videoconferencing is an important global application-it enables people around the globe to interact when distance separates them. In order for the participants in a videoconference call to interact naturally, the end-to-end delay should be below human perception; even though an objective and unique figure cannot be set, 100 ms is widely recognized as the desired one-way delay requirement for interaction. Since the global propagation delay can be about 100 ms, the actual end-to-end delay budget available to the system designer (excluding propagation delay) can be no more than 10 ms. We identify the components of the end-to-end delay in various configurations with the objective of understanding how it can be kept below the desired 10-ms bound. We analyze these components step-by-step through six system configurations obtained by combining three generic network architectures with two video encoding schemes. We study the transmission of raw video and variable bit rate (VBR) MPEG video encoding over (1) circuit switching; (2) synchronous packet switching; and (3) asynchronous packet switching. In addition, we show that constant bit rate (CBR) MPEG encoding delivers unacceptable delay-on the order of the group of pictures (GOP) time interval-when maximizing the quality for static scenes. This study aims at showing that having a global common time reference, together with time-driven priority (TDP) and VBR MPEG video encoding, provides adequate end-to-end delay, which is (1) below 10 ms; (2) independent of the network instant load; and (3) independent of the connection rate. The resulting end-to-end delay (excluding propagation delay) can be smaller than the video frame period, which is better than what can be obtained with circuit switching.