The Experts below are selected from a list of 8757 Experts worldwide ranked by ideXlab platform
Theodoros H. Varzakas - One of the best experts on this subject based on the ideXlab platform.
-
application of iso22000 failure mode and effect analysis fmea cause and effect diagrams and pareto in conjunction with haccp and risk assessment for processing of Pastry products
Critical Reviews in Food Science and Nutrition, 2011Co-Authors: Theodoros H. VarzakasAbstract:The Failure Mode and Effect Analysis (FMEA) model has been applied for the risk assessment of Pastry processing. A tentative approach of FMEA application to the Pastry industry was attempted in conjunction with ISO22000. Preliminary Hazard Analysis was used to analyze and predict the occurring failure modes in a food chain system (Pastry processing plant), based on the functions, characteristics, and/or interactions of the ingredients or the processes, upon which the system depends. Critical Control points have been identified and implemented in the cause and effect diagram (also known as Ishikawa, tree diagram, and fishbone diagram). In this work a comparison of ISO22000 analysis with HACCP is carried out over Pastry processing and packaging. However, the main emphasis was put on the quantification of risk assessment by determining the Risk Priority Number (RPN) per identified processing hazard. Storage of raw materials and storage of final products at −18°C followed by freezing were the processes identi...
-
Application of iso22000, failure mode, and effect analysis (FMEA) cause and effect diagrams and pareto in conjunction with HACCP and risk assessment for processing of Pastry products
Critical Reviews in Food Science and Nutrition, 2011Co-Authors: Theodoros H. VarzakasAbstract:The Failure Mode and Effect Analysis (FMEA) model has been applied for the risk assessment of Pastry processing. A tentative approach of FMEA application to the Pastry industry was attempted in conjunction with ISO22000. Preliminary Hazard Analysis was used to analyze and predict the occurring failure modes in a food chain system (Pastry processing plant), based on the functions, characteristics, and/or interactions of the ingredients or the processes, upon which the system depends. Critical Control points have been identified and implemented in the cause and effect diagram (also known as Ishikawa, tree diagram, and fishbone diagram). In this work a comparison of ISO22000 analysis with HACCP is carried out over Pastry processing and packaging. However, the main emphasis was put on the quantification of risk assessment by determining the Risk Priority Number (RPN) per identified processing hazard. Storage of raw materials and storage of final products at -18°C followed by freezing were the processes identified as the ones with the highest RPN (225, 225, and 144 respectively) and corrective actions were undertaken. Following the application of corrective actions, a second calculation of RPN values was carried out leading to considerably lower values (below the upper acceptable limit of 130). It is noteworthy that the application of Ishikawa (Cause and Effect or Tree diagram) led to converging results thus corroborating the validity of conclusions derived from risk assessment and FMEA. Therefore, the incorporation of FMEA analysis within the ISO22000 system of a Pastry processing industry is considered imperative.
Antony Rowstron - One of the best experts on this subject based on the ideXlab platform.
-
an evaluation of scalable application level multicast built using peer to peer overlays
International Conference on Computer Communications, 2003Co-Authors: Miguel Castro, Antony Rowstron, Anne-marie Kermarrec, Michael B Jones, Marvin M Theimer, Helen J Wang, Alec WolmanAbstract:Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general approaches to accomplishing this: tree building and flooding. This paper evaluates these two approaches using two different types of structured overlay: 1) overlays which use a form of generalized hypercube routing, e.g., Chord, Pastry and Tapestry, and 2) overlays which use a numerical distance metric to route through a Cartesian hyperspace, e.g., CAN. Pastry and CAN are chosen as the representatives of each type of overlay. To the best of our knowledge, this paper reports the first head-to-head comparison of CAN-style versus Pastry-style overlay networks, using multicast communication workloads running on an identical simulation infrastructure. The two approaches to multicast are independent of overlay network choice, and we provide a comparison of flooding versus tree-based multicast on both overlays. Results show that the tree-based approach consistently outperforms the flooding approach. Finally, for tree-based multicast, we show that Pastry provides better performance than CAN.
-
scribe a large scale and decentralized application level multicast infrastructure
IEEE Journal on Selected Areas in Communications, 2002Co-Authors: Miguel Castro, Anne-marie Kermarrec, Peter Druschel, Antony RowstronAbstract:This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry's reliability, self-organization, and locality properties. Pastry is used to create and manage groups and to build efficient multicast trees for the dissemination of messages to each group. Scribe provides best-effort reliability guarantees, and we outline how an application can extend Scribe to provide stronger reliability. Simulation results, based on a realistic network topology model, show that Scribe scales across a wide range of groups and group sizes. Also, it balances the load on the nodes while achieving acceptable delay and link stress when compared with Internet protocol multicast.
-
Pastry scalable decentralized object location and routing for large scale peer to peer systems
Lecture Notes in Computer Science, 2001Co-Authors: Antony Rowstron, Peter DruschelAbstract:This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications. Pastry performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet. It can be used to support a variety of peer-to-peer applications, including global data storage, data sharing, group communication and naming. Each node in the Pastry network has a unique identifier (nodeId). When presented with a message and a key, a Pastry node efficiently routes the message to the node with a nodeId that is numerically closest to the key, among all currently live Pastry nodes. Each Pastry node keeps track of its immediate neighbors in the nodeId space, and notifies applications of new node arrivals, node failures and recoveries. Pastry takes into account network locality; it seeks to minimize the distance messages travel, according to a to scalar proximity metric like the number of IP routing hops. Pastry is completely decentralized, scalable, and self-organizing; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.
-
scribe the design of a large scale event notification infrastructure
Lecture Notes in Computer Science, 2001Co-Authors: Antony Rowstron, Anne-marie Kermarrec, Miguel Castro, Peter DruschelAbstract:This paper presents Scribe, a large-scale event notification infrastructure for topic-based publish-subscribe applications. Scribe supports large numbers of topics, with a potentially large number of subscribers per topic. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry's reliability, self-organization and locality properties. Pastryi s used to create a topic (group) and to build an efficient multicast tree for the dissemination of events to the topic's subscribers (members). Scribe provides weak reliability guarantees, but we outline how an application can extend Scribe to provide stronger ones.
Peter Druschel - One of the best experts on this subject based on the ideXlab platform.
-
optimizing routing in structured peer to peer overlay networks using routing table redundancy
IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems, 2003Co-Authors: Rongmei Zhang, Peter DruschelAbstract:Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry [3, 6, 5, 9] provide a self-organizing substrate for large-scale peer-to-peer applications. These systems provide efficient, fault-tolerant routing, object location and load balancing within a self-organization overlay network. In this paper, we show how redundant information that is collected as part of the normal overlay maintenance protocol can be exploited to improve the performance of routing, in terms of both the number of routing hops and routing delay penalty. We use Pastry as a concrete example to describe the set of optimizations and to evaluate their improvement in routing performance via a large scale simulation using a realistic network topology model. We then discuss how these optimizations can be applied to other structured p2p overlays.
-
scribe a large scale and decentralized application level multicast infrastructure
IEEE Journal on Selected Areas in Communications, 2002Co-Authors: Miguel Castro, Anne-marie Kermarrec, Peter Druschel, Antony RowstronAbstract:This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry's reliability, self-organization, and locality properties. Pastry is used to create and manage groups and to build efficient multicast trees for the dissemination of messages to each group. Scribe provides best-effort reliability guarantees, and we outline how an application can extend Scribe to provide stronger reliability. Simulation results, based on a realistic network topology model, show that Scribe scales across a wide range of groups and group sizes. Also, it balances the load on the nodes while achieving acceptable delay and link stress when compared with Internet protocol multicast.
-
Pastry scalable decentralized object location and routing for large scale peer to peer systems
Lecture Notes in Computer Science, 2001Co-Authors: Antony Rowstron, Peter DruschelAbstract:This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications. Pastry performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet. It can be used to support a variety of peer-to-peer applications, including global data storage, data sharing, group communication and naming. Each node in the Pastry network has a unique identifier (nodeId). When presented with a message and a key, a Pastry node efficiently routes the message to the node with a nodeId that is numerically closest to the key, among all currently live Pastry nodes. Each Pastry node keeps track of its immediate neighbors in the nodeId space, and notifies applications of new node arrivals, node failures and recoveries. Pastry takes into account network locality; it seeks to minimize the distance messages travel, according to a to scalar proximity metric like the number of IP routing hops. Pastry is completely decentralized, scalable, and self-organizing; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.
-
scribe the design of a large scale event notification infrastructure
Lecture Notes in Computer Science, 2001Co-Authors: Antony Rowstron, Anne-marie Kermarrec, Miguel Castro, Peter DruschelAbstract:This paper presents Scribe, a large-scale event notification infrastructure for topic-based publish-subscribe applications. Scribe supports large numbers of topics, with a potentially large number of subscribers per topic. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry's reliability, self-organization and locality properties. Pastryi s used to create a topic (group) and to build an efficient multicast tree for the dissemination of events to the topic's subscribers (members). Scribe provides weak reliability guarantees, but we outline how an application can extend Scribe to provide stronger ones.
Griffin, James A. - One of the best experts on this subject based on the ideXlab platform.
-
Cruffin Style Pastries Using Croissant Pastry
Dublin Institute of Technology, 2020Co-Authors: Griffin, James A.Abstract:Join Master baker Jimmy Griffin, World silver medalist Coupe du Monde Chocolatine 2019 with a step by step table-top teaching lesson on making a Cruffin style Pastry using a block of croissant Pastry. The Pastry has a layer of sugar added for extra caramelised flavour
-
Incorporating Pastry Trimmings Into the Pastry Block to eliminate wastage
Dublin Institute of Technology, 2020Co-Authors: Griffin, James A.Abstract:How to incorporate trimmings from previous Pastry to reduce Pastry wastage completely
-
Shaping Chocolatine/Pain Chocolat Three Ways
Dublin Institute of Technology, 2020Co-Authors: Griffin, James A.Abstract:Join master baker Jimmy Griffin in his tabletop teaching series of laminated Pastry formation. This lesson examines cutting and shaping sheeted Pastry to make Chocolatine/Pain Chocolat using homemade chocolate bars. Three popular shaping styles which are used in many Pastry kitchens and bakeries are demonstrated at the end of the lesson
-
Croissant Pastry Make Up Video Rolling and Folding a 3 Turn
Dublin Institute of Technology, 2020Co-Authors: Griffin, James A.Abstract:The final stage of layer building in the makeup of laminated Croissant Pastry requires the Pastry to be sheeted down to a thickness of approximately 6mm by rolling the Pastry with a rolling pin and folding a 3 turn for the final layer building process. This instructional video guides the student towards completion of this stage in the process
-
Laminated Dough, the Lock in 3 Process, Stage #1 Pastry Making
Dublin Institute of Technology, 2020Co-Authors: Griffin, James A.Abstract:Locking a pre-prepared block of butter between two or more sheets of dough is known as the Lock-in stage in laminated Pastry making. James Griffin, Masterbaker explains the process known as a Lock-in 3, the first stage of laminated Pastry production, where initially three alternating layers of dough/butter/dough are formed. The dough is then sheeted and folded to create layers in the Pastry
Miguel Castro - One of the best experts on this subject based on the ideXlab platform.
-
an evaluation of scalable application level multicast built using peer to peer overlays
International Conference on Computer Communications, 2003Co-Authors: Miguel Castro, Antony Rowstron, Anne-marie Kermarrec, Michael B Jones, Marvin M Theimer, Helen J Wang, Alec WolmanAbstract:Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general approaches to accomplishing this: tree building and flooding. This paper evaluates these two approaches using two different types of structured overlay: 1) overlays which use a form of generalized hypercube routing, e.g., Chord, Pastry and Tapestry, and 2) overlays which use a numerical distance metric to route through a Cartesian hyperspace, e.g., CAN. Pastry and CAN are chosen as the representatives of each type of overlay. To the best of our knowledge, this paper reports the first head-to-head comparison of CAN-style versus Pastry-style overlay networks, using multicast communication workloads running on an identical simulation infrastructure. The two approaches to multicast are independent of overlay network choice, and we provide a comparison of flooding versus tree-based multicast on both overlays. Results show that the tree-based approach consistently outperforms the flooding approach. Finally, for tree-based multicast, we show that Pastry provides better performance than CAN.
-
scribe a large scale and decentralized application level multicast infrastructure
IEEE Journal on Selected Areas in Communications, 2002Co-Authors: Miguel Castro, Anne-marie Kermarrec, Peter Druschel, Antony RowstronAbstract:This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry's reliability, self-organization, and locality properties. Pastry is used to create and manage groups and to build efficient multicast trees for the dissemination of messages to each group. Scribe provides best-effort reliability guarantees, and we outline how an application can extend Scribe to provide stronger reliability. Simulation results, based on a realistic network topology model, show that Scribe scales across a wide range of groups and group sizes. Also, it balances the load on the nodes while achieving acceptable delay and link stress when compared with Internet protocol multicast.
-
scribe the design of a large scale event notification infrastructure
Lecture Notes in Computer Science, 2001Co-Authors: Antony Rowstron, Anne-marie Kermarrec, Miguel Castro, Peter DruschelAbstract:This paper presents Scribe, a large-scale event notification infrastructure for topic-based publish-subscribe applications. Scribe supports large numbers of topics, with a potentially large number of subscribers per topic. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry's reliability, self-organization and locality properties. Pastryi s used to create a topic (group) and to build an efficient multicast tree for the dissemination of events to the topic's subscribers (members). Scribe provides weak reliability guarantees, but we outline how an application can extend Scribe to provide stronger ones.