or respectively 2 m−e 2e )d + 1, 2 m−3e 2e )d + 1, · · · , 2 m+3e 2e −k)d + 1. Then s1, · · · , sk−1 are maximum-length binary sequences of length 2 m − 1. Let C be the F2-vector space generated by all circular shifts of s, s1, · · · , sk−1. Then C has an F2m-vector space structure, and is of dimension k over F2m . When k = 2, C is the Gold code. So we regard C as a Gold type code of relative d...

Sex attractants for 3 Sesiidae and 3 Tineidae moth species in West-Kazakhstan and Lithuania were discovered by field screening tests of (3Z,13Z)-, (3E,13Z)- and (2E,13Z)-octadecadien-1-ols and their acetates as well as of some binary mixtures of these compounds. Total amount of chemicals was 0.3 mg/dispenser. Males of Synanthedon serica were attracted by a 5:5 mixture of 3E,13Z-18:OAc and 2E,13...

Hydrogen peroxide (H 2 O ) formed via the two-electron oxygen reduction reaction (2e-ORR) on carbon-based platinum group metal-free (PGM-free) catalysts at elevated temperature can cause catalyst degradation in fuel cells. In this work, we studied effects of selectivity iron- and nitrogen-doped carbon (Fe–N–C) for 2e- 4e-ORR acidic electrolyte using a high-temperature rotating-ring disk electro...

This paper presents a unified exact method for solving an extended model of the well-known Capacitated Vehicle Routing Problem (CVRP), called the Heterogenous Vehicle Routing Problem (HVRP), where a mixed fleet of vehicles having different capacities, routing and fixed costs is used to supply a set of customers. The HVRP model considered in this paper contains as special cases: the Single Depot...

This paper addresses an extension of the Capacitated Vehicle Routing Problem where the client demand consists of three-dimensional weighted items (3L-CVRP). The objective is to design a set of trips for a homogenous fleet of vehicles based on a depot node which minimizes the total transportation cost. Items in each vehicle trip must satisfy the three-dimensional orthogonal packing constraints. ...

This article addresses the Strip Packing Problem with Unloading Constraints (SPU). In this problem, we are given a strip of fixed width and unbounded height, and n items of C different classes. As in the well-known two-dimensional Strip Packing problem, we have to pack all items minimizing the used height, but now we have the additional constraint that items of higher classes cannot block the w...