In this work we give two new constructions of ε-biased generators. Our first construction significantly extends a result of
Mossel et al. (Random Structures and Algorithms 2006, pages 56-81), and our second construction answers an open question of
Dodis and Smith (STOC 2005, pages 654-663). In particular we obtain the following results:
1.
For every k = o(log n) we construct an ε-biased generator G : {0, 1}m ? {0, 1}nG : \{0, 1\}^{m} \rightarrow \{0, 1\}^n that is implementable by degree k polynomials (namely, every output bit of the generator is a degree k polynomial in the input bits). For any constant k we get that n = W(m/log(1/ e))kn = \Omega(m/{\rm log}(1/ \epsilon))^k, which is nearly optimal. Our result also separates degree k generators from generators in NC0k, showing that the stretch of the former can be much larger than the stretch of the latter. The problem of constructing degree
k generators was introduced by Mossel et al. who gave a construction only for the case of k = 2.
2.
We construct a family of asymptotically good binary codes such that the codes in our family are also ε-biased sets for an
exponentially small ε. Our encoding algorithm runs in polynomial time in the block length of the code. Moreover, these codes
have a polynomial time decoding algorithm. This answers an open question of Dodis and Smith.
The paper also contains an appendix by Venkatesan Guruswami that provides an explicit construction of a family of error correcting
codes of rate 1/2 that has efficient encoding and decoding algorithms and whose dual codes are also good codes. 相似文献
In wireless multimedia sensor networks (WMSNs) a sensor node may have different types of sensor which gather different kinds of data. To support quality of service (QoS) requirements for multimedia applications having a reliable and fair transport protocol is necessary. One of the main objectives of the transport layer in WMSNs is congestion control. We observe that the information provided may have different levels of importance and argue that sensor networks should be willing to spend more resources in disseminating packets carrying more important information. Some applications of WMSNs may need to send real time traffic toward the sink node. This real time traffic requires low latency and high reliability so that immediate remedial and defensive actions can be taken when needed. Therefore, similar to wired networks, service differentiation in wireless sensor networks is also an important issue. We present a priority-based rate control mechanism for congestion control and service differentiation in WMSNs. We distinguish high priority real time traffic from low priority non-real time traffic, and service the input traffic based on its priority. Simulation results confirm the superior performance of the proposed model with respect to delays, delay variation and loss probability. 相似文献
This paper presents a robust adaptive fuzzy control algorithm for controlling unknown chaotic systems. The control approach encompasses a fuzzy system and a robust controller. The fuzzy system is designed to mimic an ideal controller, based on sliding-mode control. The robust controller is designed to compensate for the difference between the fuzzy controller and the ideal controller. The parameters of the fuzzy system, as well as uncertainty bound of the robust controller, are tuned adaptively. The adaptive laws are derived in the Lyapunov sense to guarantee the stability of the controlled system. Numerical simulations show the effectiveness of the proposed approach. 相似文献
Multidisciplinary design optimization approaches have significant effects on aerospace vehicle design methodology. In designing
next generation of space launch systems, MDO processes will face new and greater challenges. This study develops a system
sensitivity analysis method to optimize multidisciplinary design of a two-stage small solid propellant launch vehicle. Suitable
design variables, technological, and functional constraints are considered. Appropriate combinations of disciplines such as
propulsion, weight, geometry, and trajectory simulation are used. A generalized sensitivity equation is developed and solved.
These results are basis for optimization. Comparison of the developed approach with gradient optimization methods reveals
that developed approach requires less computation time. 相似文献
Calcium cobaltite Ca3Co4−xO9+δ (CCO) is a promising p-type thermoelectric (TE) material for high-temperature applications in air. The grains of the material exhibit strong anisotropic properties, making texturing and nanostructuring mostly favored to improve thermoelectric performance. On the one hand multitude of interfaces are needed within the bulk material to create reflecting surfaces that can lower the thermal conductivity. On the other hand, low residual porosity is needed to improve the contact between grains and raise the electrical conductivity. In this study, CCO fibers with 100% flat cross sections in a stacked, compact form are electrospun. Then the grains within the nanoribbons in the plane of the fibers are grown. Finally, the nanoribbons are electrospun into a textured ceramic that features simultaneously a high electrical conductivity of 177 S cm−1 and an immensely enhanced Seebeck coefficient of 200 µV K−1 at 1073 K are assembled. The power factor of 4.68 µW cm−1 K−2 at 1073 K in air surpasses all previous CCO TE performances of nanofiber ceramics by a factor of two. Given the relatively high power factor combined with low thermal conductivity, a relatively large figure-of-merit of 0.3 at 873 K in the air for the textured nanoribbon ceramic is obtained. 相似文献
The selective removal of one ligand in mixed-ligand MOFs upon thermolysis provides a powerful strategy to introduce additional mesopores without affecting the overall MOF structure. By varying the initial ligand ratio, MOFs of the MIL-125-Ti family with two distinct hierarchical pore architectures are synthesized, resembling either large cavities or branching fractures. The performance of the resulting hierarchically porous MOFs is evaluated toward the adsorptive removal of glyphosate (N-(phosphonomethyl)glycine) from water, and the adsorption kinetics and mechanism are examined. Due to their strong affinity for phosphoric groups, the numerous Ti–OH groups resulting from the selective ligand removal act as natural anchor points for effective glyphosate uptake. The relationships between contact duration, glyphosate concentration, and adsorbent dosage are investigated, and the impact of these parameters on the effectiveness of glyphosate removal from contaminated water samples is examined. The introduction of additional mesopores has increased the adsorption capacities by nearly 3 times with record values exceeding 440.9 mg g−1, which ranks these MOFs among the best-reported adsorbents. 相似文献
Engineering with Computers - This work addresses a hybrid scheme for the numerical solutions of time fractional Tricomi and Keldysh type equations. In proposed methodology, Haar wavelets are used... 相似文献
Cloud computing is becoming a very popular form of distributed computing, in which digital resources are shared via the Internet. The user is provided with an overview of many available resources. Cloud providers want to get the most out of their resources, and users are inclined to pay less for better performance. Task scheduling is one of the most important aspects of cloud computing. In order to achieve high performance from cloud computing systems, tasks need to be scheduled for processing by appropriate computing resources. The large search space of this issue makes it an NP-hard problem, and more random search methods are required to solve this problem. Multiple solutions have been proposed with several algorithms to solve this problem until now. This paper presents a hybrid algorithm called GSAGA to solve the Task Scheduling Problem (TSP) in cloud computing. Although it has a high ability to search the problem space, the Genetic Algorithm (GA) performs poorly in terms of stability and local search. It is therefore possible to create a stable algorithm by combining the general search capacities of the GA with the Gravitational Search Algorithm (GSA). Our experimental results indicate that the proposed algorithm can solve the problem with higher efficiency compared with the state-of-the-art.