The objective of the study was to assess antioxidant potential alcalase-treated zein hydrolysate (ZH) during a two-stage (1 h pepsin → 0.5−2 pancreatin, 37 °C) in vitro digestion. Sephadex gel filtration and high-performance size exclusion chromatography were used separate ZH into fractions. amino acid composition, 2,2′-azinobis(3-ethylbenzothiazoline-6-sulfonic acid) (ABTS+•) 1,1-diphenyl-2-picrylhydrazyl (DPPH•) free radical scavenging activity, reducing power, Cu2+ chelation ability...

The objective of the study was to investigate role emulsified fat (lard) and oil (peanut oil) in rheology microstructure porcine myofibrillar protein (MP) gels. Heat-induced composite gels were prepared from 2% MP with 0% 15% pre-emulsified lipids at 0.6 M NaCl, pH 6.2. Dynamic rheological testing upon temperature sweeping (20 80 degrees C 2 C/min) showed substantial increases G' (an elastic modulus) sols/gels addition emulsions. Gel hardness markedly enhanced (P < 0.05) by incorporating...

Alcalase-treated zein hydrolysate (ZH) was separated by gel filtration, ultrafiltration, and reversed-phase HPLC, the scavenging activities for 2,2′-azinobis(3-ethylbenzothiazoline-6-sulfonic acid) (ABTS•+), 1,1-diphenyl-2-picrylhydrazyl (DPPH•), superoxide anion (O2•−) radicals of different peptide fractions were measured to establish antioxidant efficacy. Results showed that ability stabilize water-soluble free (ABTS•+) ZH components insensitive size, whereas against ethanol-soluble...

On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and deal with dynamic user access patterns. With the rapid growth of time-critical information services in emerging applications, there increasing need for support timely dissemination. This paper investigates online scheduling algorithms on-demand broadcast. We propose a novel algorithm called SIN-/spl alpha/ that takes urgency number outstanding requests into consideration. An efficient...

Top-k monitoring is important to many wireless sensor applications. This paper exploits the semantics of top-k query and proposes an energy-efficient approach called FILA. The basic idea install a filter at each node suppress unnecessary updates. Filter setting reevaluation upon updates are two fundamental issues correctness efficiency FILA approach. We develop algorithm that capable handling concurrent In particular, we present optimization techniques reduce probing cost. design skewed...

Influence maximization is a classic and extensively studied problem with important applications in viral marketing. Existing algorithms for influence maximization, however, mostly focus on offline processing, the sense that they do not provide any output to user until final answer derived, allowed terminate algorithm early trade quality of solution efficiency. Such lack interactiveness flexibility leads poor experience, especially when incurs long running time.

This paper exploits the tradeoff between data quality and energy consumption to extend lifetime of wireless sensor networks. We consider applications that require some aggregate form sensed with precision guarantees. Our key idea is differentiate precisions collected from different nodes balance their consumption. achieved by partitioning constraint aggregation allocating error bounds individual in a coordinated fashion. Three factors affecting are identified: (1) changing pattern readings;...

This paper investigates static job scheduling schemes that distribute workload in a network of computers with different speeds. Static involve very low overhead and complexity compared to dynamic schemes, but can still provide significant performance improvement over the case no load balancing. Optimization techniques are proposed for allocation dispatching. Workload is modeled as non-linear optimization problem solved mathematically. It shown allocating disproportionately high percentage...

The rapid growth of new information services and business-oriented applications entails the consideration quality service (QoS) in content distribution. This paper investigates QoS-aware replica placement problems for responsiveness QoS requirements. We consider two classes models: replica-aware replica-blind services. In services, servers are aware locations replicas can therefore optimize request routing to improve responsiveness. show that problem is NP-complete. Several heuristic...

In location-based services, users with location-aware mobile devices are able to make queries about their surroundings anywhere and at any time. While this ubiquitous computing paradigm brings great convenience for information access, it also raises concerns over potential intrusion into user location privacy. To protect privacy, one typical approach is cloak locations spatial regions based on user-specified privacy requirements, transform region-based queries. paper, we identify address...

Dynamic Bin Packing (DBP) is a variant of classical bin packing, which assumes that items may arrive and depart at arbitrary times. Existing works on DBP generally aim to minimize the maximum number bins ever used in packing. In this paper, we consider new version problem, namely, MinTotal problem targets minimizing total cost over time. It motivated by request dispatching arising cloud gaming systems. We analyze competitive ratios commonly First Fit, Best Any Fit packing (the family...

Renewable (or green) energy, such as solar or wind, has at least partially powered data centers to reduce the environmental impact of traditional energy sources (brown with high carbon footprint). In this paper, we propose a holistic workload scheduling algorithm minimize brown consumption across multiple geographically distributed renewable sources. While green supply for single center is intermittent due daily/seasonal effects, our aware different amounts and dynamically schedules centers....

Information can be disseminated widely and rapidly through Online Social Networks (OSNs) with "word-of-mouth" effects. Viral marketing is such a typical application in which new products or commercial activities are advertised by some seed users OSNs to other cascading manner. The selection of initial yields tradeoff between the expense reward viral marketing. In this paper, we define general profit metric that naturally combines benefit influence spread cost We carry out comprehensive study...

Dynamic Bin Packing (DBP) is a variant of classical bin packing, which assumes that items may arrive and depart at arbitrary times. Existing works on DBP generally aim to minimize the maximum number bins ever used in packing. In this paper, we consider new version problem, namely, MinTotal problem targets minimizing total cost overtime. It motivated by request dispatching arising from cloud gaming systems. We analyze competitive ratios modified versions commonly First Fit, Best Any Fit...

Given a social network G , the influence maximization (IM) problem seeks set S of k seed nodes in to maximize expected number activated via an cascade starting from S. Although lot algorithms have been proposed for IM, most them only work under non-adaptive setting, i.e., when all are selected before we observe how they other users. In this paper, study adaptive IM problem, where select batches equal size b such that choice i -th batch can be made after results first - 1 observed. We propose...

Web caching is an important technique for reducing Internet access latency, network traffic, and server load. This paper investigates cache management strategies the en-route web environment, where caches are associated with routing nodes in network. We propose a novel scheme that integrates both object placement replacement policies which makes decisions on all candidate sites coordinated fashion. In our scheme, status information along path of request used dynamically determining to...

Advances in cloud computing and GPU virtualization are allowing the game industry to move into a gaming era. In this paper, we consider multiplayer (MCG), which is natural integration of online paradigms. With MCG, server set rendering servers for players need be located launched clouds each session. We formulate an MCG allocation problem with objective minimizing total rental bandwidth cost charged by support The hard solve optimally. propose several efficient heuristics address carry out...

Information can be disseminated widely and rapidly through Online Social Networks (OSNs) with “word-of-mouth” effects. Viral marketing is such a typical application in which new products or commercial activities are advertised by some seed users OSNs to other cascading manner. The budget allocation for selection reflects tradeoff between the expense reward of viral marketing. In this paper, we define general profit metric that naturally combines benefit influence spread cost eliminate need...

Cloud-based systems often face the problem of dispatching a stream jobs to run on cloud servers in an online manner. Each job has size that defines resource demand for running job. is assigned server upon its arrival and departs after it completes. The departure time job, however, not known at arrival. fixed capacity total all cannot exceed times. objective minimize cost used, where renting each proportional hours by "pay-as-you-go" billing. above can be modeled as variant Dynamic Bin...

Cloud gaming is becoming increasingly popular. The basic idea of cloud to run games on servers and let players interact with through thin clients. As the player population grows, service provider needs maintain a large number for running game instances requested by players. A primary concern total cost servers. In this paper, we study problem how dispatch play requests in system. We show that dispatching strategy may heavily affect request can be considered as variant dynamic bin packing...

Mobile location-dependent information services are gaining increasing interest in both academic and industrial communities. In these services, data values depend on their locations. Caching frequently accessed mobile clients can help save wireless bandwidth improve system performance. However, since client location changes constantly, may become obsolete not only due to updates performed items but also because of movements across the network. To best authors' knowledge, previous work cache...