排序方式: 共有32条查询结果,搜索用时 0 毫秒
11.
Trindade CS Terzi SC Trugo LC Della Modesta RC Couri S 《Archivos latinoamericanos de nutrición》2001,51(1):100-104
Yoghurts were prepared by fermentation of soy milk using a mixed starter culture containing Lactobacillus bulgaricus and Streptococcus thermophilus. Soy milk at 9 degrees Brix was homogenised under pressure (17 MPa) and fermented with and without addition of sucrose (2.0 and 2.5 g per 100 g) for 4, 5, 6 and 7 hours. The yoghurts were evaluated in terms of sensory quality, pH, titrable acidity, phytic acid and oligosaccharides: A yoghurt with the best sensory quality was obtained using the homogenised soy milk with 2% sucrose addition and fermented for 6 h. Lactobacillus bulgaricus and Streptococcus thermophilus did not produce phytases and alpha-galactosidases at the experimental conditions, consequently, phytic acid and galactosides were not affected by the process. 相似文献
12.
Medard M. Barry R.A. Finn S.G. Wenbo He Lumetta S.S. 《Networking, IEEE/ACM Transactions on》2002,10(1):153-164
Current means of providing loop-back recovery, which is widely used in SONET, rely on ring topologies, or on overlaying logical ring topologies upon physical meshes. Loop-back is desirable to provide rapid preplanned recovery of link or node failures in a bandwidth-efficient distributed manner. We introduce generalized loop-back, a novel scheme for performing loop-back in optical mesh networks. We present an algorithm to perform recovery for link failure and one to perform generalized loop-back recovery for node failure. We illustrate the operation of both algorithms, prove their validity, and present a network management protocol algorithm, which enables distributed operation for link or node failure. We present three different applications of generalized loop-back. First, we present heuristic algorithms for selecting recovery graphs, which maintain short maximum and average lengths of recovery paths. Second, we present WDM-based loop-back recovery for optical networks where wavelengths are used to back up other wavelengths. We compare, for WDM-based loop-back, the operation of generalized loop-back operation with known ring-based ways of providing loop-back recovery over mesh networks. Finally, we introduce the use of generalized loop-back to provide recovery in a way that allows dynamic choice of routes over preplanned directions 相似文献
13.
We consider a dynamical probabilistic traffic model for the number of users transmitting at any time. This model captures both user mobility and traffic burstiness. Moreover, we assume no centralized controller, such as a scheduler, is available. When multiple users transmit simultaneously, multiple-access interference (MAI) affects throughput considerably. Most queue control schemes assume individual users know the states of their own queues (local queue information) along with the states of other users queues (shared queue information) and address issues of scheduling; but this sharing of information may be onerous in a practical system. While shared queue information has recently been shown (Me/spl acute/dard et al., 2004) not to affect the capacity of such systems, it has a considerable impact on delay. We introduce a scheme, where for each user, a bit of shared queue information specifies whether its queue length is above or below a threshold. Our scheme relies on two different service classes implemented through a superposition coding scheme (first proposed with Me/spl acute/dard and Goldsmith, 1999, further studied and expanded with Me/spl acute/dard et al., 2004). The first class experiences no delay due to multiple-access interference, while the second class requires retransmissions when such an event occurs. We show how our scheme affords an energy-delay tradeoff. Moreover, when configured properly, our scheme can attain boundary points of the region corresponding to minimum energy with no shared queue information for zero delay along with minimum energy subject to system stability. We derive bounds on the performance of the multiple-access system using our proposed scheme by introducing Lyapunov function bounds in a manner similar to Bertsimas et al., 2001. 相似文献
14.
An algebraic approach to network coding 总被引:19,自引:0,他引:19
We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al.(see Proc. 2001 IEEE Int. Symp. Information Theory, p.102), who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary networks and robust networking. For networks which are restricted to using linear network codes, we find necessary and sufficient conditions for the feasibility of any given set of connections over a given network. We also consider the problem of network recovery for nonergodic link failures. For the multicast setup we prove that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question. The results are derived for both delay-free networks and networks with delays. 相似文献
15.
Medard M. Gallager R.G. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2002,48(4):840-852
We show that very large bandwidths on fading multipath channels cannot be effectively utilized by spread-spectrum systems that (in a particular sense) spread the available power uniformly over both time and frequency. The approach is to express the input process as an expansion in an orthonormal set of functions each localized in time and frequency. The fourth moment of each coefficient in this expansion is then uniformly constrained. We show that such a constraint forces the mutual information to 0 inversely with increasing bandwidth. Simply constraining the second moment of these coefficients does not achieve this effect. The results suggest strongly that conventional direct-sequence code-division multiple-access (CDMA) systems do not scale well to extremely large bandwidths. To illustrate how the interplay between channel estimation and symbol detection affects capacity, we present results for a specific channel and CDMA signaling scheme 相似文献
16.
Binary adaptive coded pilot symbol assisted modulation over Rayleigh fading channels without feedback 总被引:1,自引:0,他引:1
Pilot symbol assisted modulation (PSAM) is a standard approach for transceiver design for time-varying channels, with channel estimates obtained from pilot symbols being employed for coherent demodulation of the data symbols. In this paper, we show that PSAM schemes can be improved by adapting the coded modulation strategy at the sender to the quality of the channel measurement at the receiver, without requiring any channel feedback from the receiver. We consider performance in terms of achievable rate for binary signaling schemes. The transmitter employs interleaved codes, with data symbols coded according to their distance from the nearest pilot symbols. Symbols far away from pilot symbols encounter poorer channel measurements at the receiver and are therefore coded with lower rate codes, while symbols close to pilot symbols benefit from recent channel measurements and are coded with higher rate codes. The performance benefits from this approach are quantified in the context of binary signaling over time-varying Rayleigh fading channels described by a Gauss-Markov model. The spacing of the pilot symbols is optimized to maximize the mutual information between input and output in this setting. Causal and noncausal channel estimators of varying complexity and delay are considered. It is shown that, by appropriate optimization for the spacing between consecutive pilot symbols, the adaptive coding techniques proposed can improve achievable rate, without any feedback from the receiver to the sender. Moreover, channel estimation based on the two closest pilot symbols is generally close to optimal. 相似文献
17.
Codecast: a network-coding-based ad hoc multicast protocol 总被引:1,自引:0,他引:1
JOON-SANG Park Mario Gerla Desmond S. Lun Yunjung Yi Muriel Medard 《Wireless Communications, IEEE》2006,13(5):76-81
In this article we present CodeCast, a network-coding-based ad hoc multicast protocol. CodeCast is especially well-suited for multimedia applications with low-loss, low-latency constraints such as audio/video streaming. The key ingredient of CodeCast is random network coding, which transparently implements both localized loss recovery and path diversity with very low overhead. Simulation results show that in a typical setting, CodeCast yields a nearly 100 percent delivery ratio, as compared to a 94 percent delivery ratio by traditional multicast. More importantly, the overhead is reduced by as much as 50 percent 相似文献
18.
Minimum-cost multicast over coded packet networks 总被引:7,自引:0,他引:7
Lun D.S. Ratnakar N. Medard M. Koetter R. Karger D.R. Ho T. Ahmed E. Zhao F. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2006,52(6):2608-2623
We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group). For static multicast, we reduce the problem to a polynomial-time solvable optimization problem, and we present decentralized algorithms for solving it. These algorithms, when coupled with existing decentralized schemes for constructing network codes, yield a fully decentralized approach for achieving minimum-cost multicast. By contrast, establishing minimum-cost static multicast connections over routed packet networks is a very difficult problem even using centralized computation, except in the special cases of unicast and broadcast connections. For dynamic multicast, we reduce the problem to a dynamic programming problem and apply the theory of dynamic programming to suggest how it may be solved. 相似文献
19.
Carion O Souplet V Olivier C Maillet C Medard N El-Mahdi O Durand JO Melnyk O 《Chembiochem : a European journal of chemical biology》2007,8(3):315-322
Polycarbonate (PC) is a useful substrate for the preparation of microfluidic devices. Recently, its utility in bioanalysis has attracted much attention owing to the possibility of using compact discs as platforms for the high-throughput analysis of biomolecular interactions. In this article we report a novel method for the chemical micropatterning of polycarbonate based on the printing of functionalized silica nanoparticles. The semicarbazide groups present on the surface of the nanoparticles were used for the site-specific semicarbazone ligation of unprotected peptides derivatized by an alpha-oxoaldehyde group. The peptide micropatterns permitted the specific capture of antibodies. We report also the characterization of micropatterns on PC by using a wide-field optical imaging technique called Sarfus; this allows the detection of nm-thick films by using nonreflecting PC substrates and an optical microscope working with reflected differential interference contrast. The method described here is an easy way to modify polycarbonate surfaces for biomolecular interaction studies and should stimulate the use of PC for developing plastic biosensors. 相似文献
20.